mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 00:55:31 +00:00
Code Activity

debugging mbi

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2018-06-11 21:22:53 -07:00 • committed by Arie Gurfinkel
parent e0aaf4452b
commit ba504e4243
4 changed files with 82 additions and 17 deletions
Download patch file Download diff file Expand all files Collapse all files

13
src/qe/qe_mbi.cpp
View file

@ -30,13 +30,17 @@ Revision History:
namespace qe {
lbool mbi_plugin::check(func_decl_ref_vector const& vars, expr_ref_vector& lits, model_ref& mdl) {
SASSERT(lits.empty());
ast_manager& m = lits.get_manager();
expr_ref_vector lits0(lits);
while (true) {
lits.reset();
lits.append(lits0);
switch ((*this)(vars, lits, mdl)) {
case mbi_sat:
return l_true;
case mbi_unsat:
if (lits.empty()) return l_false;
TRACE("qe", tout << "block: " << lits << "\n";);
block(lits);
break;
case mbi_undef:
@ -111,6 +115,10 @@ namespace qe {
m_solver(s),
m_dual_solver(sNot)
{
params_ref p;
p.set_bool("smt.core.minimize", true);
m_solver->updt_params(p);
m_dual_solver->updt_params(p);
expr_ref_vector fmls(m);
m_solver->get_assertions(fmls);
expr_fast_mark1 marks;
@ -141,6 +149,7 @@ namespace qe {
lits.push_back(m.mk_not(e));
}
}
TRACE("qe", tout << "atoms from model: " << lits << "\n";);
r = m_dual_solver->check_sat(lits);
expr_ref_vector core(m);
term_graph tg(m);
@ -148,10 +157,12 @@ namespace qe {
case l_false:
// use the dual solver to find a 'small' implicant
m_dual_solver->get_unsat_core(core);
TRACE("qe", tout << "core: " << core << "\n";);
// project the implicant onto vars
tg.add_lits(core);
lits.reset();
lits.append(tg.project(vars, false));
TRACE("qe", tout << "project: " << lits << "\n";);
return mbi_sat;
case l_undef:
return mbi_undef;

30
src/qe/qe_term_graph.cpp
View file

@ -65,9 +65,9 @@ namespace qe {
m_children.push_back(t);
}
}
~term() {}
class parents {
term const& t;
public:
@ -168,9 +168,9 @@ namespace qe {
arith_term_graph_plugin(term_graph &g) :
term_graph_plugin (g.get_ast_manager().mk_family_id("arith")),
m_g(g), m(g.get_ast_manager()), m_arith(m) {(void)m_g;}
virtual ~arith_term_graph_plugin() {}
bool mk_eq_core (expr *_e1, expr *_e2, expr_ref &res) {
expr *e1, *e2;
e1 = _e1;
@ -385,7 +385,7 @@ namespace qe {
SASSERT(res);
return res;
}
void term_graph::internalize_eq(expr *a1, expr* a2) {
SASSERT(m_merge.empty());
merge(*internalize_term(a1), *internalize_term(a2));
@ -415,17 +415,17 @@ namespace qe {
void term_graph::merge(term &t1, term &t2) {
// -- merge might invalidate term2app cache
m_term2app.reset();
m_pinned.reset();
m_pinned.reset();
term *a = &t1.get_root();
term *b = &t2.get_root();
if (a == b) return;
if (a->get_class_size() > b->get_class_size()) {
std::swap(a, b);
}
// Remove parents of it from the cg table.
for (term* p : term::parents(b)) {
if (!p->is_marked()) {
@ -736,7 +736,7 @@ namespace qe {
}
}
m_tg.reset_marks();
}
}
bool find_app(term &t, expr *&res) {
return m_root2rep.find(t.get_root().get_id(), res);
@ -744,7 +744,7 @@ namespace qe {
bool find_app(expr *lit, expr *&res) {
return m_root2rep.find(m_tg.get_term(lit)->get_root().get_id(), res);
}
}
void mk_lits(expr_ref_vector &res) {
expr *e = nullptr;
@ -752,7 +752,7 @@ namespace qe {
if (!m.is_eq(lit) && find_app(lit, e))
res.push_back(e);
}
}
}
void mk_pure_equalities(const term &t, expr_ref_vector &res) {
expr *rep = nullptr;
@ -842,12 +842,12 @@ namespace qe {
return res;
}
};
}
}
expr_ref_vector term_graph::project(func_decl_ref_vector const& decls, bool exclude) {
projector p(*this);
return p.project(decls, exclude);
}
}
expr_ref_vector term_graph::solve(func_decl_ref_vector const &decls, bool exclude) {
projector p(*this);