mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-12 12:08:18 +00:00
Code Activity

#6953

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2023-10-25 09:06:57 -07:00
parent d5fe4b0d78
commit 0859be5649
2 changed files with 11 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
src/ast/rewriter/bit_blaster/bit_blaster_rewriter.cpp
View file

@ -21,6 +21,7 @@ Notes:
#include "ast/rewriter/bit_blaster/bit_blaster_tpl_def.h" #include "ast/rewriter/bit_blaster/bit_blaster_tpl_def.h"
#include "ast/rewriter/rewriter_def.h" #include "ast/rewriter/rewriter_def.h"
#include "ast/rewriter/bool_rewriter.h" #include "ast/rewriter/bool_rewriter.h"
#include "ast/rewriter/th_rewriter.h"
#include "util/ref_util.h" #include "util/ref_util.h"
#include "ast/ast_smt2_pp.h" #include "ast/ast_smt2_pp.h"
@ -549,10 +550,19 @@ MK_PARAMETRIC_UNARY_REDUCE(reduce_sign_extend, mk_sign_extend);
case OP_INT2BV: case OP_INT2BV:
case OP_BV2INT: case OP_BV2INT:
return BR_FAILED; return BR_FAILED;
default: default:
TRACE("bit_blaster", tout << "non-supported operator: " << f->get_name() << "\n"; TRACE("bit_blaster", tout << "non-supported operator: " << f->get_name() << "\n";
for (unsigned i = 0; i < num; i++) tout << mk_ismt2_pp(args[i], m()) << std::endl;); for (unsigned i = 0; i < num; i++) tout << mk_ismt2_pp(args[i], m()) << std::endl;);
{
expr_ref r(m().mk_app(f, num, args), m());
result = r;
th_rewriter rw(m());
rw(result);
if (!is_app(result) || to_app(result)->get_decl() != f)
return BR_REWRITE_FULL;
}
throw_unsupported(f); throw_unsupported(f);
} }
} }

7
src/sat/smt/arith_solver.cpp
View file

@ -996,9 +996,6 @@ namespace arith {
TRACE("arith", ctx.display(tout);); TRACE("arith", ctx.display(tout););
if (!check_delayed_eqs())
return sat::check_result::CR_CONTINUE;
switch (check_lia()) { switch (check_lia()) {
case l_true: case l_true:
break; break;
@ -1022,10 +1019,6 @@ namespace arith {
break; break;
} }
if (delayed_assume_eqs()) {
++m_stats.m_assume_eqs;
return sat::check_result::CR_CONTINUE;
}
if (assume_eqs()) { if (assume_eqs()) {
++m_stats.m_assume_eqs; ++m_stats.m_assume_eqs;
return sat::check_result::CR_CONTINUE; return sat::check_result::CR_CONTINUE;