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

butterfly effect with relevancy marking

Browse source 
bail out of infinite instantiation loop
This commit is contained in:
Nikolaj Bjorner 2021-02-15 16:37:23 -08:00
parent a6dce246f6
commit 823830181b
8 changed files with 45 additions and 33 deletions
Download patch file Download diff file Expand all files Collapse all files

40
src/ast/rewriter/seq_skolem.cpp
View file

@ -3,7 +3,7 @@ Copyright (c) 2011 Microsoft Corporation
Module Name:
seq_skolem.cpp
skolem.cpp
Author:
@ -14,10 +14,10 @@ Author:
#include "ast/rewriter/seq_skolem.h"
#include "ast/ast_pp.h"
using namespace smt;
using namespace seq;
seq_skolem::seq_skolem(ast_manager& m, th_rewriter& rw):
skolem::skolem(ast_manager& m, th_rewriter& rw):
m(m),
m_rewrite(rw),
seq(m),
@ -40,7 +40,7 @@ seq_skolem::seq_skolem(ast_manager& m, th_rewriter& rw):
m_is_non_empty = "re.is_non_empty";
}
expr_ref seq_skolem::mk(symbol const& s, expr* e1, expr* e2, expr* e3, expr* e4, sort* range, bool rw) {
expr_ref skolem::mk(symbol const& s, expr* e1, expr* e2, expr* e3, expr* e4, sort* range, bool rw) {
expr* es[4] = { e1, e2, e3, e4 };
unsigned len = e4?4:(e3?3:(e2?2:(e1?1:0)));
if (!range) {
@ -52,19 +52,19 @@ expr_ref seq_skolem::mk(symbol const& s, expr* e1, expr* e2, expr* e3, expr* e4,
return result;
}
expr_ref seq_skolem::mk_max_unfolding_depth(unsigned depth) {
expr_ref skolem::mk_max_unfolding_depth(unsigned depth) {
parameter ps[2] = { parameter(m_max_unfolding), parameter(depth) };
func_decl* f = m.mk_func_decl(seq.get_family_id(), _OP_SEQ_SKOLEM, 2, ps, 0, (sort*const*) nullptr, m.mk_bool_sort());
return expr_ref(m.mk_const(f), m);
}
expr_ref seq_skolem::mk_length_limit(expr* e, unsigned d) {
expr_ref skolem::mk_length_limit(expr* e, unsigned d) {
parameter ps[3] = { parameter(m_length_limit), parameter(d), parameter(e) };
func_decl* f = m.mk_func_decl(seq.get_family_id(), _OP_SEQ_SKOLEM, 3, ps, 0, (sort*const*) nullptr, m.mk_bool_sort());
return expr_ref(m.mk_const(f), m);
}
bool seq_skolem::is_length_limit(expr* p, unsigned& lim, expr*& s) const {
bool skolem::is_length_limit(expr* p, unsigned& lim, expr*& s) const {
if (!is_length_limit(p))
return false;
lim = to_app(p)->get_parameter(1).get_int();
@ -73,11 +73,11 @@ bool seq_skolem::is_length_limit(expr* p, unsigned& lim, expr*& s) const {
}
bool seq_skolem::is_skolem(symbol const& s, expr const* e) const {
bool skolem::is_skolem(symbol const& s, expr const* e) const {
return seq.is_skolem(e) && to_app(e)->get_decl()->get_parameter(0).get_symbol() == s;
}
void seq_skolem::decompose(expr* e, expr_ref& head, expr_ref& tail) {
void skolem::decompose(expr* e, expr_ref& head, expr_ref& tail) {
expr* e1 = nullptr, *e2 = nullptr;
zstring s;
rational r;
@ -124,7 +124,7 @@ decompose_main:
}
}
bool seq_skolem::is_step(expr* e, expr*& s, expr*& idx, expr*& re, expr*& i, expr*& j, expr*& t) const {
bool skolem::is_step(expr* e, expr*& s, expr*& idx, expr*& re, expr*& i, expr*& j, expr*& t) const {
if (is_step(e)) {
s = to_app(e)->get_arg(0);
idx = to_app(e)->get_arg(1);
@ -139,34 +139,34 @@ bool seq_skolem::is_step(expr* e, expr*& s, expr*& idx, expr*& re, expr*& i, exp
}
}
bool seq_skolem::is_tail_u(expr* e, expr*& s, unsigned& idx) const {
bool skolem::is_tail_u(expr* e, expr*& s, unsigned& idx) const {
expr* i = nullptr;
rational r;
return is_tail(e, s, i) && a.is_numeral(i, r) && r.is_unsigned() && (idx = r.get_unsigned(), true);
}
bool seq_skolem::is_tail(expr* e, expr*& s) const {
bool skolem::is_tail(expr* e, expr*& s) const {
expr* i = nullptr;
return is_tail(e, s, i);
}
bool seq_skolem::is_tail(expr* e, expr*& s, expr*& idx) const {
bool skolem::is_tail(expr* e, expr*& s, expr*& idx) const {
return is_tail(e) && (s = to_app(e)->get_arg(0), idx = to_app(e)->get_arg(1), true);
}
bool seq_skolem::is_eq(expr* e, expr*& a, expr*& b) const {
bool skolem::is_eq(expr* e, expr*& a, expr*& b) const {
return is_skolem(m_eq, e) && (a = to_app(e)->get_arg(0), b = to_app(e)->get_arg(1), true);
}
bool seq_skolem::is_pre(expr* e, expr*& s, expr*& i) {
bool skolem::is_pre(expr* e, expr*& s, expr*& i) {
return is_skolem(m_pre, e) && (s = to_app(e)->get_arg(0), i = to_app(e)->get_arg(1), true);
}
bool seq_skolem::is_post(expr* e, expr*& s, expr*& start) {
bool skolem::is_post(expr* e, expr*& s, expr*& start) {
return is_skolem(m_post, e) && (s = to_app(e)->get_arg(0), start = to_app(e)->get_arg(1), true);
}
expr_ref seq_skolem::mk_unit_inv(expr* n) {
expr_ref skolem::mk_unit_inv(expr* n) {
expr* u = nullptr;
VERIFY(seq.str.is_unit(n, u));
sort* s = u->get_sort();
@ -174,7 +174,7 @@ expr_ref seq_skolem::mk_unit_inv(expr* n) {
}
expr_ref seq_skolem::mk_last(expr* s) {
expr_ref skolem::mk_last(expr* s) {
zstring str;
if (seq.str.is_string(s, str) && str.length() > 0) {
return expr_ref(seq.str.mk_char(str, str.length()-1), m);
@ -184,7 +184,7 @@ expr_ref seq_skolem::mk_last(expr* s) {
return mk(m_seq_last, s, char_sort);
}
expr_ref seq_skolem::mk_first(expr* s) {
expr_ref skolem::mk_first(expr* s) {
zstring str;
if (seq.str.is_string(s, str) && str.length() > 0) {
return expr_ref(seq.str.mk_string(str.extract(0, str.length()-1)), m);
@ -192,7 +192,7 @@ expr_ref seq_skolem::mk_first(expr* s) {
return mk(m_seq_first, s);
}
expr_ref seq_skolem::mk_step(expr* s, expr* idx, expr* re, unsigned i, unsigned j, expr* t) {
expr_ref skolem::mk_step(expr* s, expr* idx, expr* re, unsigned i, unsigned j, expr* t) {
expr_ref_vector args(m);
args.push_back(s).push_back(idx).push_back(re);
args.push_back(a.mk_int(i));