mirror of
https://github.com/Z3Prover/z3
synced 2025-04-11 19:53:34 +00:00
129 lines
3.8 KiB
C++
129 lines
3.8 KiB
C++
/*++
|
|
Copyright (c) 2011 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
theory_seq_empty.h
|
|
|
|
Abstract:
|
|
|
|
<abstract>
|
|
|
|
Author:
|
|
|
|
Nikolaj Bjorner (nbjorner) 2011-14-11
|
|
|
|
Revision History:
|
|
|
|
--*/
|
|
#ifndef THEORY_SEQ_EMPTY_H_
|
|
#define THEORY_SEQ_EMPTY_H_
|
|
|
|
#include "smt_theory.h"
|
|
#include "seq_decl_plugin.h"
|
|
|
|
namespace smt {
|
|
class seq_factory : public value_factory {
|
|
typedef hashtable<symbol, symbol_hash_proc, symbol_eq_proc> symbol_set;
|
|
ast_manager& m;
|
|
proto_model& m_model;
|
|
seq_util u;
|
|
symbol_set m_strings;
|
|
unsigned m_next;
|
|
std::string m_unique_prefix;
|
|
obj_map<sort, expr*> m_unique_sequences;
|
|
expr_ref_vector m_trail;
|
|
public:
|
|
|
|
seq_factory(ast_manager & m, family_id fid, proto_model & md):
|
|
value_factory(m, fid),
|
|
m(m),
|
|
m_model(md),
|
|
u(m),
|
|
m_next(0),
|
|
m_unique_prefix("#B"),
|
|
m_trail(m)
|
|
{
|
|
m_strings.insert(symbol(""));
|
|
m_strings.insert(symbol("a"));
|
|
m_strings.insert(symbol("b"));
|
|
}
|
|
|
|
void add_trail(expr* e) {
|
|
m_trail.push_back(e);
|
|
}
|
|
|
|
void set_prefix(char const* p) {
|
|
m_unique_prefix = p;
|
|
}
|
|
|
|
// generic method for setting unique sequences
|
|
void set_prefix(expr* uniq) {
|
|
m_trail.push_back(uniq);
|
|
m_unique_sequences.insert(m.get_sort(uniq), uniq);
|
|
}
|
|
|
|
virtual expr* get_some_value(sort* s) {
|
|
if (u.is_string(s))
|
|
return u.str.mk_string(symbol(""));
|
|
NOT_IMPLEMENTED_YET();
|
|
return 0;
|
|
}
|
|
virtual bool get_some_values(sort* s, expr_ref& v1, expr_ref& v2) {
|
|
if (u.is_string(s)) {
|
|
v1 = u.str.mk_string(symbol("a"));
|
|
v2 = u.str.mk_string(symbol("b"));
|
|
return true;
|
|
}
|
|
NOT_IMPLEMENTED_YET();
|
|
return false;
|
|
}
|
|
virtual expr* get_fresh_value(sort* s) {
|
|
if (u.is_string(s)) {
|
|
while (true) {
|
|
std::ostringstream strm;
|
|
strm << m_unique_prefix << m_next++;
|
|
symbol sym(strm.str().c_str());
|
|
if (m_strings.contains(sym)) continue;
|
|
m_strings.insert(sym);
|
|
return u.str.mk_string(sym);
|
|
}
|
|
}
|
|
sort* seq = 0;
|
|
if (u.is_re(s, seq)) {
|
|
expr* v0 = get_fresh_value(seq);
|
|
return u.re.mk_to_re(v0);
|
|
}
|
|
NOT_IMPLEMENTED_YET();
|
|
return 0;
|
|
}
|
|
virtual void register_value(expr* n) {
|
|
symbol sym;
|
|
if (u.str.is_string(n, sym)) {
|
|
m_strings.insert(sym);
|
|
}
|
|
}
|
|
};
|
|
|
|
class theory_seq_empty : public theory {
|
|
bool m_used;
|
|
virtual final_check_status final_check_eh() { return m_used?FC_GIVEUP:FC_DONE; }
|
|
virtual bool internalize_atom(app*, bool) { if (!m_used) { get_context().push_trail(value_trail<context,bool>(m_used)); m_used = true; } return false; }
|
|
virtual bool internalize_term(app*) { return internalize_atom(0,false); }
|
|
virtual void new_eq_eh(theory_var, theory_var) { }
|
|
virtual void new_diseq_eh(theory_var, theory_var) {}
|
|
virtual theory* mk_fresh(context* new_ctx) { return alloc(theory_seq_empty, new_ctx->get_manager()); }
|
|
virtual char const * get_name() const { return "seq-empty"; }
|
|
public:
|
|
theory_seq_empty(ast_manager& m):theory(m.mk_family_id("seq")), m_used(false) {}
|
|
virtual void init_model(model_generator & mg) {
|
|
mg.register_factory(alloc(seq_factory, get_manager(), get_family_id(), mg.get_model()));
|
|
}
|
|
|
|
};
|
|
|
|
};
|
|
|
|
#endif /* THEORY_SEQ_EMPTY_H_ */
|
|
|