mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-28 11:25:51 +00:00
Code Activity

add compare utility to compress common cases

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2016-05-25 09:03:24 -07:00
parent af3cc7e578
commit cd441c318e
1 changed files with 19 additions and 19 deletions
Download patch file Download diff file Expand all files Collapse all files

38
src/model/model_evaluator.cpp
View file

@ -344,38 +344,38 @@ struct evaluator_cfg : public default_rewriter_cfg {
expr * const* args = 0;
expr* val = stores2[i][arity];
if (table1.find(stores2[i].c_ptr(), args)) {
if (m().are_equal(args[arity], val)) {
table1.remove(stores2[i].c_ptr());
}
else if (m().are_distinct(args[arity], val)) {
result = m().mk_false();
return BR_DONE;
}
else {
conj.push_back(m().mk_eq(val, args[arity]));
switch (compare(args[arity], val)) {
case l_true: table1.remove(stores2[i].c_ptr()); break;
case l_false: result = m().mk_false(); return BR_DONE;
default: conj.push_back(m().mk_eq(val, args[arity])); break;
}
}
else {
if (m().are_equal(else1, val)) {
// no-op
}
else if (m().are_distinct(else1, val)) {
result = m().mk_false();
return BR_DONE;
}
else {
conj.push_back(m().mk_eq(else1, val));
switch (compare(else1, val)) {
case l_true: break;
case l_false: result = m().mk_false(); return BR_DONE;
default: conj.push_back(m().mk_eq(else1, val)); break;
}
}
}
args_table::iterator it = table1.begin(), end = table1.end();
for (; it != end; ++it) {
conj.push_back(m().mk_eq((*it)[arity], else2));
switch (compare((*it)[arity], else2)) {
case l_true: break;
case l_false: result = m().mk_false(); return BR_DONE;
default: conj.push_back(m().mk_eq((*it)[arity], else2)); break;
}
}
result = mk_and(conj);
return BR_REWRITE_FULL;
}
lbool compare(expr* a, expr* b) {
if (m().are_equal(a, b)) return l_true;
if (m().are_distinct(a, b)) return l_false;
return l_undef;
}
bool args_are_unique_values(expr_ref_vector const& store) {
bool args_are_values = true;