mirror of
https://github.com/Z3Prover/z3
synced 2025-04-13 12:28:44 +00:00
fix core extraction for QF_BV theory/inc_sat_solver based on regressions pointed out by Matthias Heizmann and Tjark Weber
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
d7d22cad02
commit
8f862f8fed
|
@ -1476,7 +1476,7 @@ void cmd_context::check_sat(unsigned num_assumptions, expr * const * assumptions
|
|||
if (produce_unsat_cores()) {
|
||||
expr_ref_vector asms(m());
|
||||
asms.append(num_assumptions, assumptions);
|
||||
for (unsigned i = 0; i < m_assertion_names.size(); ++i) {
|
||||
for (unsigned i = 0; false && i < m_assertion_names.size(); ++i) {
|
||||
if (m_assertion_names[i]) {
|
||||
asms.push_back(m_assertion_names[i]);
|
||||
}
|
||||
|
|
|
@ -135,7 +135,6 @@ public:
|
|||
lbool r = internalize_formulas();
|
||||
if (r != l_true) return r;
|
||||
r = internalize_assumptions(sz, assumptions, dep2asm);
|
||||
SASSERT(sz == m_asms.size());
|
||||
if (r != l_true) return r;
|
||||
|
||||
r = m_solver.check(m_asms.size(), m_asms.c_ptr(), m_weights.c_ptr(), max_weight);
|
||||
|
@ -147,7 +146,7 @@ public:
|
|||
break;
|
||||
case l_false:
|
||||
// TBD: expr_dependency core is not accounted for.
|
||||
if (sz > 0) {
|
||||
if (!m_asms.empty()) {
|
||||
extract_core(dep2asm);
|
||||
}
|
||||
break;
|
||||
|
@ -314,7 +313,7 @@ private:
|
|||
}
|
||||
|
||||
lbool internalize_assumptions(unsigned sz, expr* const* asms, dep2asm_t& dep2asm) {
|
||||
if (sz == 0) {
|
||||
if (sz == 0 && get_num_assumptions() == 0) {
|
||||
m_asms.shrink(0);
|
||||
return l_true;
|
||||
}
|
||||
|
@ -322,6 +321,9 @@ private:
|
|||
for (unsigned i = 0; i < sz; ++i) {
|
||||
g->assert_expr(asms[i], m.mk_leaf(asms[i]));
|
||||
}
|
||||
for (unsigned i = 0; i < get_num_assumptions(); ++i) {
|
||||
g->assert_expr(get_assumption(i), m.mk_leaf(get_assumption(i)));
|
||||
}
|
||||
lbool res = internalize_goal(g, dep2asm);
|
||||
if (res == l_true) {
|
||||
extract_assumptions(sz, asms, dep2asm);
|
||||
|
@ -355,6 +357,13 @@ private:
|
|||
++j;
|
||||
}
|
||||
}
|
||||
for (unsigned i = 0; i < get_num_assumptions(); ++i) {
|
||||
if (dep2asm.find(get_assumption(i), lit)) {
|
||||
SASSERT(lit.var() <= m_solver.num_vars());
|
||||
m_asms.push_back(lit);
|
||||
}
|
||||
}
|
||||
|
||||
SASSERT(dep2asm.size() == m_asms.size());
|
||||
}
|
||||
|
||||
|
|
Loading…
Reference in a new issue