mirror of
https://github.com/Z3Prover/z3
synced 2025-04-07 18:05:21 +00:00
updates to resource exceptions, update master possibly handle pull request issue
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
3ff7283f94
commit
a7e2fb31e3
|
@ -373,7 +373,7 @@ struct nnf::imp {
|
|||
if (memory::get_allocation_size() > m_max_memory)
|
||||
throw nnf_exception(Z3_MAX_MEMORY_MSG);
|
||||
if (m().canceled())
|
||||
throw nnf_exception(Z3_CANCELED_MSG);
|
||||
throw nnf_exception(m().limit().get_cancel_msg());
|
||||
}
|
||||
|
||||
void set_new_child_flag() {
|
||||
|
|
|
@ -28,7 +28,7 @@ void bit_blaster_tpl<Cfg>::checkpoint() {
|
|||
if (memory::get_allocation_size() > m_max_memory)
|
||||
throw rewriter_exception(Z3_MAX_MEMORY_MSG);
|
||||
if (m().canceled())
|
||||
throw rewriter_exception(Z3_CANCELED_MSG);
|
||||
throw rewriter_exception(m().limit().get_cancel_msg());
|
||||
cooperate("bit-blaster");
|
||||
}
|
||||
|
||||
|
|
|
@ -2051,7 +2051,7 @@ namespace qe {
|
|||
|
||||
void checkpoint() {
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
cooperate("qe");
|
||||
}
|
||||
|
||||
|
|
|
@ -738,7 +738,7 @@ namespace eq {
|
|||
void checkpoint() {
|
||||
cooperate("der");
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
}
|
||||
|
||||
public:
|
||||
|
@ -917,8 +917,8 @@ namespace ar {
|
|||
void checkpoint() {
|
||||
cooperate("der");
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
}
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
}
|
||||
|
||||
public:
|
||||
|
||||
|
@ -2207,7 +2207,7 @@ namespace fm {
|
|||
void checkpoint() {
|
||||
cooperate("fm");
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
}
|
||||
public:
|
||||
|
||||
|
@ -2477,7 +2477,7 @@ class qe_lite_tactic : public tactic {
|
|||
|
||||
void checkpoint() {
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
cooperate("qe-lite");
|
||||
}
|
||||
|
||||
|
|
|
@ -662,7 +662,7 @@ namespace qe {
|
|||
|
||||
void checkpoint() {
|
||||
if (m.canceled()) {
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
}
|
||||
cooperate("qe-sat");
|
||||
}
|
||||
|
|
|
@ -45,7 +45,7 @@ class qe_tactic : public tactic {
|
|||
|
||||
void checkpoint() {
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
cooperate("qe");
|
||||
}
|
||||
|
||||
|
|
|
@ -333,7 +333,7 @@ struct goal2sat::imp {
|
|||
loop:
|
||||
cooperate("goal2sat");
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
if (memory::get_allocation_size() > m_max_memory)
|
||||
throw tactic_exception(TACTIC_MAX_MEMORY_MSG);
|
||||
frame & fr = m_frame_stack.back();
|
||||
|
@ -626,7 +626,7 @@ struct sat2goal::imp {
|
|||
|
||||
void checkpoint() {
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
if (memory::get_allocation_size() > m_max_memory)
|
||||
throw tactic_exception(TACTIC_MAX_MEMORY_MSG);
|
||||
}
|
||||
|
|
|
@ -3318,7 +3318,7 @@ namespace smt {
|
|||
void model_finder::checkpoint(char const* msg) {
|
||||
cooperate(msg);
|
||||
if (m_context && m_context->get_cancel_flag())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m_context->get_manager().limit().get_cancel_msg());
|
||||
}
|
||||
|
||||
mf::quantifier_info * model_finder::get_quantifier_info(quantifier * q) const {
|
||||
|
|
|
@ -58,7 +58,7 @@ struct unit_subsumption_tactic : public tactic {
|
|||
|
||||
void checkpoint() {
|
||||
if (m.canceled()) {
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -86,6 +86,13 @@ void theory_seq::solution_map::display(std::ostream& out) const {
|
|||
}
|
||||
}
|
||||
|
||||
bool theory_seq::exclusion_table::contains(expr* e, expr* r) const {
|
||||
if (e->get_id() > r->get_id()) {
|
||||
std::swap(e, r);
|
||||
}
|
||||
return m_table.contains(std::make_pair(e, r));
|
||||
}
|
||||
|
||||
void theory_seq::exclusion_table::update(expr* e, expr* r) {
|
||||
if (e->get_id() > r->get_id()) {
|
||||
std::swap(e, r);
|
||||
|
|
|
@ -81,9 +81,7 @@ namespace smt {
|
|||
~exclusion_table() { }
|
||||
bool empty() const { return m_table.empty(); }
|
||||
void update(expr* e, expr* r);
|
||||
bool contains(expr* e, expr* r) {
|
||||
return m_table.contains(std::make_pair(e, r));
|
||||
}
|
||||
bool contains(expr* e, expr* r) const;
|
||||
void push_scope() { m_limit.push_back(m_lhs.size()); }
|
||||
void pop_scope(unsigned num_scopes);
|
||||
void display(std::ostream& out) const;
|
||||
|
|
|
@ -131,7 +131,7 @@ struct aig_manager::imp {
|
|||
if (memory::get_allocation_size() > m_max_memory)
|
||||
throw aig_exception(TACTIC_MAX_MEMORY_MSG);
|
||||
if (m().canceled())
|
||||
throw aig_exception(TACTIC_CANCELED_MSG);
|
||||
throw aig_exception(m().limit().get_cancel_msg());
|
||||
cooperate("aig");
|
||||
}
|
||||
|
||||
|
|
|
@ -37,7 +37,7 @@ struct arith_bounds_tactic : public tactic {
|
|||
|
||||
void checkpoint() {
|
||||
if (m.canceled()) {
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
}
|
||||
}
|
||||
|
||||
|
|
|
@ -100,7 +100,7 @@ class degree_shift_tactic : public tactic {
|
|||
|
||||
void checkpoint() {
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
cooperate("degree_shift");
|
||||
}
|
||||
|
||||
|
|
|
@ -289,7 +289,7 @@ class diff_neq_tactic : public tactic {
|
|||
unsigned nvars = num_vars();
|
||||
while (m_stack.size() < nvars) {
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
TRACE("diff_neq_tactic", display_model(tout););
|
||||
var x = m_stack.size();
|
||||
if (extend_model(x))
|
||||
|
|
|
@ -197,7 +197,7 @@ class fm_tactic : public tactic {
|
|||
clauses::iterator it = m_clauses[i].begin();
|
||||
clauses::iterator end = m_clauses[i].end();
|
||||
for (; it != end; ++it) {
|
||||
if (m.canceled()) throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
if (m.canceled()) throw tactic_exception(m.limit().get_cancel_msg());
|
||||
switch (process(x, *it, u, ev, val)) {
|
||||
case NONE:
|
||||
TRACE("fm_mc", tout << "no bound for:\n" << mk_ismt2_pp(*it, m) << "\n";);
|
||||
|
@ -1543,7 +1543,7 @@ class fm_tactic : public tactic {
|
|||
void checkpoint() {
|
||||
cooperate("fm");
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
if (memory::get_allocation_size() > m_max_memory)
|
||||
throw tactic_exception(TACTIC_MAX_MEMORY_MSG);
|
||||
}
|
||||
|
|
|
@ -176,7 +176,7 @@ struct bv_size_reduction_tactic::imp {
|
|||
|
||||
void checkpoint() {
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
}
|
||||
|
||||
void operator()(goal & g, model_converter_ref & mc) {
|
||||
|
|
|
@ -50,7 +50,7 @@ class bvarray2uf_tactic : public tactic {
|
|||
|
||||
void checkpoint() {
|
||||
if (m_manager.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m_manager.limit().get_cancel_msg());
|
||||
}
|
||||
|
||||
void operator()(goal_ref const & g,
|
||||
|
|
|
@ -36,7 +36,7 @@ struct cofactor_elim_term_ite::imp {
|
|||
if (memory::get_allocation_size() > m_max_memory)
|
||||
throw tactic_exception(TACTIC_MAX_MEMORY_MSG);
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
}
|
||||
|
||||
// Collect atoms that contain term if-then-else
|
||||
|
|
|
@ -96,7 +96,7 @@ struct ctx_simplify_tactic::imp {
|
|||
if (memory::get_allocation_size() > m_max_memory)
|
||||
throw tactic_exception(TACTIC_MAX_MEMORY_MSG);
|
||||
if (m.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m.limit().get_cancel_msg());
|
||||
}
|
||||
|
||||
bool shared(expr * t) const {
|
||||
|
|
|
@ -94,7 +94,7 @@ struct reduce_args_tactic::imp {
|
|||
|
||||
void checkpoint() {
|
||||
if (m_manager.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m_manager.limit().get_cancel_msg());
|
||||
cooperate("reduce-args");
|
||||
}
|
||||
|
||||
|
|
|
@ -77,8 +77,8 @@ class solve_eqs_tactic : public tactic {
|
|||
|
||||
void checkpoint() {
|
||||
if (m().canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
cooperate("solve-eqs");
|
||||
throw tactic_exception(m().limit().get_cancel_msg());
|
||||
cooperate("solve-eqs");
|
||||
}
|
||||
|
||||
// Check if the number of occurrences of t is below the specified threshold :solve-eqs-max-occs
|
||||
|
|
|
@ -95,7 +95,7 @@ void sls_engine::collect_statistics(statistics& st) const {
|
|||
|
||||
void sls_engine::checkpoint() {
|
||||
if (m_manager.canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
throw tactic_exception(m_manager.limit().get_cancel_msg());
|
||||
cooperate("sls");
|
||||
}
|
||||
|
||||
|
|
|
@ -77,8 +77,8 @@ class quasi_macros_tactic : public tactic {
|
|||
|
||||
while (more) { // CMW: use repeat(...) ?
|
||||
if (m().canceled())
|
||||
throw tactic_exception(TACTIC_CANCELED_MSG);
|
||||
|
||||
throw tactic_exception(m().limit().get_cancel_msg());
|
||||
|
||||
new_forms.reset();
|
||||
new_proofs.reset();
|
||||
more = qm(forms.size(), forms.c_ptr(), proofs.c_ptr(), new_forms, new_proofs);
|
||||
|
|
Loading…
Reference in a new issue