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

Merge branch 'master' of https://github.com/z3prover/z3

Browse source
This commit is contained in:
Nikolaj Bjorner 2018-11-28 13:50:40 -08:00
commit 45dd820b6c
16 changed files with 86 additions and 73 deletions
Download patch file Download diff file Expand all files Collapse all files

2
src/ackermannization/lackr.h
View file

@ -102,7 +102,7 @@ class lackr {
// //
// Introduce congruence ackermann lemma for the two given terms. // Introduce congruence ackermann lemma for the two given terms.
// //
bool ackr(app * const t1, app * const t2); bool ackr(app * t1, app * t2);
// //
// Introduce the ackermann lemma for each pair of terms. // Introduce the ackermann lemma for each pair of terms.

2
src/ast/rewriter/bv_bounds.cpp
View file

@ -628,7 +628,7 @@ bool bv_bounds::is_sat_core(app * v) {
numeral new_hi = lower - one; numeral new_hi = lower - one;
numeral ptr = lower; numeral ptr = lower;
if (has_neg_intervals) { if (has_neg_intervals) {
SASSERT(negative_intervals != NULL); SASSERT(negative_intervals != nullptr);
std::sort(negative_intervals->begin(), negative_intervals->end(), interval_comp); std::sort(negative_intervals->begin(), negative_intervals->end(), interval_comp);
intervals::const_iterator e = negative_intervals->end(); intervals::const_iterator e = negative_intervals->end();
for (intervals::const_iterator i = negative_intervals->begin(); i != e; ++i) { for (intervals::const_iterator i = negative_intervals->begin(); i != e; ++i) {

2
src/ast/rewriter/bv_trailing.cpp
View file

@ -364,7 +364,7 @@ struct bv_trailing::imp {
} }
void reset_cache(const unsigned condition) { void reset_cache(const unsigned condition) {
SASSERT(m_count_cache[0] == NULL); SASSERT(m_count_cache[0] == nullptr);
for (unsigned i = 1; i <= TRAILING_DEPTH; ++i) { for (unsigned i = 1; i <= TRAILING_DEPTH; ++i) {
if (m_count_cache[i] == nullptr) continue; if (m_count_cache[i] == nullptr) continue;
TRACE("bv-trailing", tout << "may reset cache " << i << " " << condition << "\n";); TRACE("bv-trailing", tout << "may reset cache " << i << " " << condition << "\n";);

2
src/math/simplex/model_based_opt.cpp
View file

@ -606,7 +606,7 @@ namespace opt {
} }
} }
void model_based_opt::mk_coeffs_without(vector<var>& dst, vector<var> const src, unsigned x) { void model_based_opt::mk_coeffs_without(vector<var>& dst, vector<var> const& src, unsigned x) {
for (var const & v : src) { for (var const & v : src) {
if (v.m_id != x) dst.push_back(v); if (v.m_id != x) dst.push_back(v);
} }

2
src/math/simplex/model_based_opt.h
View file

@ -132,7 +132,7 @@ namespace opt {
void normalize(unsigned row_id); void normalize(unsigned row_id);
void mk_coeffs_without(vector<var>& dst, vector<var> const src, unsigned x); void mk_coeffs_without(vector<var>& dst, vector<var> const& src, unsigned x);
unsigned new_row(); unsigned new_row();

2
src/muz/fp/datalog_parser.cpp
View file

@ -101,7 +101,7 @@ public:
resize_data(0); resize_data(0);
#if _WINDOWS #if _WINDOWS
errno_t err = fopen_s(&m_file, fname, "rb"); errno_t err = fopen_s(&m_file, fname, "rb");
m_ok = (m_file != NULL) && (err == 0); m_ok = (m_file != nullptr) && (err == 0);
#else #else
m_file = fopen(fname, "rb"); m_file = fopen(fname, "rb");
m_ok = (m_file != nullptr); m_ok = (m_file != nullptr);

2
src/muz/rel/dl_compiler.h
View file

@ -148,7 +148,7 @@ namespace datalog {
void make_join(reg_idx t1, reg_idx t2, const variable_intersection & vars, reg_idx & result, void make_join(reg_idx t1, reg_idx t2, const variable_intersection & vars, reg_idx & result,
bool reuse_t1, instruction_block & acc); bool reuse_t1, instruction_block & acc);
void make_min(reg_idx source, reg_idx & target, const unsigned_vector & group_by_cols, void make_min(reg_idx source, reg_idx & target, const unsigned_vector & group_by_cols,
const unsigned min_col, instruction_block & acc); unsigned min_col, instruction_block & acc);
void make_join_project(reg_idx t1, reg_idx t2, const variable_intersection & vars, void make_join_project(reg_idx t1, reg_idx t2, const variable_intersection & vars,
const unsigned_vector & removed_cols, reg_idx & result, bool reuse_t1, instruction_block & acc); const unsigned_vector & removed_cols, reg_idx & result, bool reuse_t1, instruction_block & acc);
void make_filter_interpreted_and_project(reg_idx src, app_ref & cond, void make_filter_interpreted_and_project(reg_idx src, app_ref & cond,

2
src/muz/rel/dl_instruction.h
View file

@ -285,7 +285,7 @@ namespace datalog {
const unsigned * cols1, const unsigned * cols2, unsigned removed_col_cnt, const unsigned * cols1, const unsigned * cols2, unsigned removed_col_cnt,
const unsigned * removed_cols, reg_idx result); const unsigned * removed_cols, reg_idx result);
static instruction * mk_min(reg_idx source, reg_idx target, const unsigned_vector & group_by_cols, static instruction * mk_min(reg_idx source, reg_idx target, const unsigned_vector & group_by_cols,
const unsigned min_col); unsigned min_col);
static instruction * mk_rename(reg_idx src, unsigned cycle_len, const unsigned * permutation_cycle, static instruction * mk_rename(reg_idx src, unsigned cycle_len, const unsigned * permutation_cycle,
reg_idx tgt); reg_idx tgt);
static instruction * mk_filter_by_negation(reg_idx tgt, reg_idx neg_rel, unsigned col_cnt, static instruction * mk_filter_by_negation(reg_idx tgt, reg_idx neg_rel, unsigned col_cnt,

4
src/sat/sat_simplifier_params.pyg
View file

@ -2,7 +2,7 @@ def_module_params(module_name='sat',
class_name='sat_simplifier_params', class_name='sat_simplifier_params',
export=True, export=True,
params=(('bce', BOOL, False, 'eliminate blocked clauses'), params=(('bce', BOOL, False, 'eliminate blocked clauses'),
('abce', BOOL, False, 'eliminate blocked clauses using asymmmetric literals'), ('abce', BOOL, False, 'eliminate blocked clauses using asymmetric literals'),
('cce', BOOL, False, 'eliminate covered clauses'), ('cce', BOOL, False, 'eliminate covered clauses'),
('ate', BOOL, True, 'asymmetric tautology elimination'), ('ate', BOOL, True, 'asymmetric tautology elimination'),
('acce', BOOL, False, 'eliminate covered clauses using asymmetric added literals'), ('acce', BOOL, False, 'eliminate covered clauses using asymmetric added literals'),
@ -11,7 +11,7 @@ def_module_params(module_name='sat',
('bce_delay', UINT, 2, 'delay eliminate blocked clauses until simplification round'), ('bce_delay', UINT, 2, 'delay eliminate blocked clauses until simplification round'),
('retain_blocked_clauses', BOOL, True, 'retain blocked clauses as lemmas'), ('retain_blocked_clauses', BOOL, True, 'retain blocked clauses as lemmas'),
('blocked_clause_limit', UINT, 100000000, 'maximum number of literals visited during blocked clause elimination'), ('blocked_clause_limit', UINT, 100000000, 'maximum number of literals visited during blocked clause elimination'),
('override_incremental', BOOL, False, 'override incemental safety gaps. Enable elimination of blocked clauses and variables even if solver is reused'), ('override_incremental', BOOL, False, 'override incremental safety gaps. Enable elimination of blocked clauses and variables even if solver is reused'),
('resolution.limit', UINT, 500000000, 'approx. maximum number of literals visited during variable elimination'), ('resolution.limit', UINT, 500000000, 'approx. maximum number of literals visited during variable elimination'),
('resolution.occ_cutoff', UINT, 10, 'first cutoff (on number of positive/negative occurrences) for Boolean variable elimination'), ('resolution.occ_cutoff', UINT, 10, 'first cutoff (on number of positive/negative occurrences) for Boolean variable elimination'),
('resolution.occ_cutoff_range1', UINT, 8, 'second cutoff (number of positive/negative occurrences) for Boolean variable elimination, for problems containing less than res_cls_cutoff1 clauses'), ('resolution.occ_cutoff_range1', UINT, 8, 'second cutoff (number of positive/negative occurrences) for Boolean variable elimination, for problems containing less than res_cls_cutoff1 clauses'),

2
src/smt/theory_recfun.h
View file

@ -69,7 +69,7 @@ namespace smt {
recfun::case_def const * m_cdef; recfun::case_def const * m_cdef;
ptr_vector<expr> m_args; ptr_vector<expr> m_args;
body_expansion(recfun::util& u, app * n) : m_pred(n), m_cdef(0), m_args() { body_expansion(recfun::util& u, app * n) : m_pred(n), m_cdef(nullptr), m_args() {
m_cdef = &u.get_case_def(n); m_cdef = &u.get_case_def(n);
m_args.append(n->get_num_args(), n->get_args()); m_args.append(n->get_num_args(), n->get_args());
} }

75
src/smt/theory_str.cpp
View file

@ -505,7 +505,7 @@ namespace smt {
app * a = mk_fresh_const(name.c_str(), int_sort); app * a = mk_fresh_const(name.c_str(), int_sort);
ctx.internalize(a, false); ctx.internalize(a, false);
SASSERT(ctx.get_enode(a) != NULL); SASSERT(ctx.get_enode(a) != nullptr);
SASSERT(ctx.e_internalized(a)); SASSERT(ctx.e_internalized(a));
ctx.mark_as_relevant(a); ctx.mark_as_relevant(a);
// I'm assuming that this combination will do the correct thing in the integer theory. // I'm assuming that this combination will do the correct thing in the integer theory.
@ -544,7 +544,7 @@ namespace smt {
// I have a hunch that this may not get internalized for free... // I have a hunch that this may not get internalized for free...
ctx.internalize(a, false); ctx.internalize(a, false);
SASSERT(ctx.get_enode(a) != NULL); SASSERT(ctx.get_enode(a) != nullptr);
SASSERT(ctx.e_internalized(a)); SASSERT(ctx.e_internalized(a));
// this might help?? // this might help??
mk_var(ctx.get_enode(a)); mk_var(ctx.get_enode(a));
@ -566,7 +566,7 @@ namespace smt {
m_trail.push_back(a); m_trail.push_back(a);
ctx.internalize(a, false); ctx.internalize(a, false);
SASSERT(ctx.get_enode(a) != NULL); SASSERT(ctx.get_enode(a) != nullptr);
SASSERT(ctx.e_internalized(a)); SASSERT(ctx.e_internalized(a));
mk_var(ctx.get_enode(a)); mk_var(ctx.get_enode(a));
m_basicstr_axiom_todo.push_back(ctx.get_enode(a)); m_basicstr_axiom_todo.push_back(ctx.get_enode(a));
@ -617,7 +617,7 @@ namespace smt {
app * a = mk_fresh_const(name.c_str(), string_sort); app * a = mk_fresh_const(name.c_str(), string_sort);
ctx.internalize(a, false); ctx.internalize(a, false);
SASSERT(ctx.get_enode(a) != NULL); SASSERT(ctx.get_enode(a) != nullptr);
// this might help?? // this might help??
mk_var(ctx.get_enode(a)); mk_var(ctx.get_enode(a));
@ -710,7 +710,7 @@ namespace smt {
* Returns the simplified concatenation of two expressions, * Returns the simplified concatenation of two expressions,
* where either both expressions are constant strings * where either both expressions are constant strings
* or one expression is the empty string. * or one expression is the empty string.
* If this precondition does not hold, the function returns NULL. * If this precondition does not hold, the function returns nullptr.
* (note: this function was strTheory::Concat()) * (note: this function was strTheory::Concat())
*/ */
expr * theory_str::mk_concat_const_str(expr * n1, expr * n2) { expr * theory_str::mk_concat_const_str(expr * n1, expr * n2) {
@ -1661,53 +1661,66 @@ namespace smt {
} }
} }
// (str.replace s t t') is the string obtained by replacing the first occurrence
// of t in s, if any, by t'. Note that if t is empty, the result is to prepend
// t' to s; also, if t does not occur in s then the result is s.
void theory_str::instantiate_axiom_Replace(enode * e) { void theory_str::instantiate_axiom_Replace(enode * e) {
context & ctx = get_context(); context & ctx = get_context();
ast_manager & m = get_manager(); ast_manager & m = get_manager();
app * expr = e->get_owner(); app * ex = e->get_owner();
if (axiomatized_terms.contains(expr)) { if (axiomatized_terms.contains(ex)) {
TRACE("str", tout << "already set up Replace axiom for " << mk_pp(expr, m) << std::endl;); TRACE("str", tout << "already set up Replace axiom for " << mk_pp(ex, m) << std::endl;);
return; return;
} }
axiomatized_terms.insert(expr); axiomatized_terms.insert(ex);
TRACE("str", tout << "instantiate Replace axiom for " << mk_pp(expr, m) << std::endl;); TRACE("str", tout << "instantiate Replace axiom for " << mk_pp(ex, m) << std::endl;);
expr_ref x1(mk_str_var("x1"), m); expr_ref x1(mk_str_var("x1"), m);
expr_ref x2(mk_str_var("x2"), m); expr_ref x2(mk_str_var("x2"), m);
expr_ref i1(mk_int_var("i1"), m); expr_ref i1(mk_int_var("i1"), m);
expr_ref result(mk_str_var("result"), m); expr_ref result(mk_str_var("result"), m);
expr * replaceS;
expr * replaceT;
expr * replaceTPrime;
u.str.is_replace(ex, replaceS, replaceT, replaceTPrime);
// t empty => result = (str.++ t' s)
expr_ref emptySrcAst(ctx.mk_eq_atom(replaceT, mk_string("")), m);
expr_ref prependTPrimeToS(ctx.mk_eq_atom(result, mk_concat(replaceTPrime, replaceS)), m);
// condAst = Contains(args[0], args[1]) // condAst = Contains(args[0], args[1])
expr_ref condAst(mk_contains(expr->get_arg(0), expr->get_arg(1)), m); expr_ref condAst(mk_contains(ex->get_arg(0), ex->get_arg(1)), m);
// ----------------------- // -----------------------
// true branch // true branch
expr_ref_vector thenItems(m); expr_ref_vector thenItems(m);
// args[0] = x1 . args[1] . x2 // args[0] = x1 . args[1] . x2
thenItems.push_back(ctx.mk_eq_atom(expr->get_arg(0), mk_concat(x1, mk_concat(expr->get_arg(1), x2)))); thenItems.push_back(ctx.mk_eq_atom(ex->get_arg(0), mk_concat(x1, mk_concat(ex->get_arg(1), x2))));
// i1 = |x1| // i1 = |x1|
thenItems.push_back(ctx.mk_eq_atom(i1, mk_strlen(x1))); thenItems.push_back(ctx.mk_eq_atom(i1, mk_strlen(x1)));
// args[0] = x3 . x4 /\ |x3| = |x1| + |args[1]| - 1 /\ ! contains(x3, args[1]) // args[0] = x3 . x4 /\ |x3| = |x1| + |args[1]| - 1 /\ ! contains(x3, args[1])
expr_ref x3(mk_str_var("x3"), m); expr_ref x3(mk_str_var("x3"), m);
expr_ref x4(mk_str_var("x4"), m); expr_ref x4(mk_str_var("x4"), m);
expr_ref tmpLen(m_autil.mk_add(i1, mk_strlen(expr->get_arg(1)), mk_int(-1)), m); expr_ref tmpLen(m_autil.mk_add(i1, mk_strlen(ex->get_arg(1)), mk_int(-1)), m);
thenItems.push_back(ctx.mk_eq_atom(expr->get_arg(0), mk_concat(x3, x4))); thenItems.push_back(ctx.mk_eq_atom(ex->get_arg(0), mk_concat(x3, x4)));
thenItems.push_back(ctx.mk_eq_atom(mk_strlen(x3), tmpLen)); thenItems.push_back(ctx.mk_eq_atom(mk_strlen(x3), tmpLen));
thenItems.push_back(mk_not(m, mk_contains(x3, expr->get_arg(1)))); thenItems.push_back(mk_not(m, mk_contains(x3, ex->get_arg(1))));
thenItems.push_back(ctx.mk_eq_atom(result, mk_concat(x1, mk_concat(expr->get_arg(2), x2)))); thenItems.push_back(ctx.mk_eq_atom(result, mk_concat(x1, mk_concat(ex->get_arg(2), x2))));
// ----------------------- // -----------------------
// false branch // false branch
expr_ref elseBranch(ctx.mk_eq_atom(result, expr->get_arg(0)), m); expr_ref elseBranch(ctx.mk_eq_atom(result, ex->get_arg(0)), m);
th_rewriter rw(m); th_rewriter rw(m);
expr_ref breakdownAssert(m.mk_ite(condAst, m.mk_and(thenItems.size(), thenItems.c_ptr()), elseBranch), m); expr_ref breakdownAssert(m.mk_ite(emptySrcAst, prependTPrimeToS,
m.mk_ite(condAst, mk_and(thenItems), elseBranch)), m);
expr_ref breakdownAssert_rw(breakdownAssert, m); expr_ref breakdownAssert_rw(breakdownAssert, m);
rw(breakdownAssert_rw); rw(breakdownAssert_rw);
assert_axiom(breakdownAssert_rw); assert_axiom(breakdownAssert_rw);
expr_ref reduceToResult(ctx.mk_eq_atom(expr, result), m); expr_ref reduceToResult(ctx.mk_eq_atom(ex, result), m);
expr_ref reduceToResult_rw(reduceToResult, m); expr_ref reduceToResult_rw(reduceToResult, m);
rw(reduceToResult_rw); rw(reduceToResult_rw);
assert_axiom(reduceToResult_rw); assert_axiom(reduceToResult_rw);
@ -2148,7 +2161,7 @@ namespace smt {
// Evaluates the concatenation (n1 . n2) with respect to // Evaluates the concatenation (n1 . n2) with respect to
// the current equivalence classes of n1 and n2. // the current equivalence classes of n1 and n2.
// Returns a constant string expression representing this concatenation // Returns a constant string expression representing this concatenation
// if one can be determined, or NULL if this is not possible. // if one can be determined, or nullptr if this is not possible.
expr * theory_str::eval_concat(expr * n1, expr * n2) { expr * theory_str::eval_concat(expr * n1, expr * n2) {
bool n1HasEqcValue = false; bool n1HasEqcValue = false;
bool n2HasEqcValue = false; bool n2HasEqcValue = false;
@ -2222,7 +2235,7 @@ namespace smt {
for (enode_vector::iterator parent_it = current_parents.begin(); parent_it != current_parents.end(); ++parent_it) { for (enode_vector::iterator parent_it = current_parents.begin(); parent_it != current_parents.end(); ++parent_it) {
enode * e_parent = *parent_it; enode * e_parent = *parent_it;
SASSERT(e_parent != NULL); SASSERT(e_parent != nullptr);
app * a_parent = e_parent->get_owner(); app * a_parent = e_parent->get_owner();
TRACE("str", tout << "considering parent " << mk_ismt2_pp(a_parent, m) << std::endl;); TRACE("str", tout << "considering parent " << mk_ismt2_pp(a_parent, m) << std::endl;);
@ -5575,7 +5588,7 @@ namespace smt {
tout << " " << mk_pp(el, m); tout << " " << mk_pp(el, m);
} }
tout << std::endl; tout << std::endl;
if (constStrAst == NULL) { if (constStrAst == nullptr) {
tout << "constStrAst = NULL" << std::endl; tout << "constStrAst = NULL" << std::endl;
} else { } else {
tout << "constStrAst = " << mk_pp(constStrAst, m) << std::endl; tout << "constStrAst = " << mk_pp(constStrAst, m) << std::endl;
@ -7787,7 +7800,7 @@ namespace smt {
generate_mutual_exclusion(arrangement_disjunction); generate_mutual_exclusion(arrangement_disjunction);
} }
} /* (arg1Len != 1 || arg2Len != 1) */ } /* (arg1Len != 1 || arg2Len != 1) */
} /* if (Concat(arg1, arg2) == NULL) */ } /* if (Concat(arg1, arg2) == nullptr) */
} }
} }
} }
@ -10417,12 +10430,12 @@ namespace smt {
} }
} // foreach(term in str_in_re_terms) } // foreach(term in str_in_re_terms)
eautomaton * aut_inter = NULL; eautomaton * aut_inter = nullptr;
CTRACE("str", !intersect_constraints.empty(), tout << "check intersection of automata constraints for " << mk_pp(str, m) << std::endl;); CTRACE("str", !intersect_constraints.empty(), tout << "check intersection of automata constraints for " << mk_pp(str, m) << std::endl;);
for (svector<regex_automaton_under_assumptions>::iterator aut_it = intersect_constraints.begin(); for (svector<regex_automaton_under_assumptions>::iterator aut_it = intersect_constraints.begin();
aut_it != intersect_constraints.end(); ++aut_it) { aut_it != intersect_constraints.end(); ++aut_it) {
regex_automaton_under_assumptions aut = *aut_it; regex_automaton_under_assumptions aut = *aut_it;
if (aut_inter == NULL) { if (aut_inter == nullptr) {
// start somewhere // start somewhere
aut_inter = aut.get_automaton(); aut_inter = aut.get_automaton();
used_intersect_constraints.push_back(aut); used_intersect_constraints.push_back(aut);
@ -10472,7 +10485,7 @@ namespace smt {
} }
} }
} // foreach(entry in intersect_constraints) } // foreach(entry in intersect_constraints)
if (aut_inter != NULL) { if (aut_inter != nullptr) {
aut_inter->compress(); aut_inter->compress();
} }
TRACE("str", tout << "intersected " << used_intersect_constraints.size() << " constraints" << std::endl;); TRACE("str", tout << "intersected " << used_intersect_constraints.size() << " constraints" << std::endl;);
@ -10503,7 +10516,7 @@ namespace smt {
} }
conflict_lhs = mk_and(conflict_terms); conflict_lhs = mk_and(conflict_terms);
if (used_intersect_constraints.size() > 1 && aut_inter != NULL) { if (used_intersect_constraints.size() > 1 && aut_inter != nullptr) {
// check whether the intersection is only the empty string // check whether the intersection is only the empty string
unsigned initial_state = aut_inter->init(); unsigned initial_state = aut_inter->init();
if (aut_inter->final_states().size() == 1 && aut_inter->is_final_state(initial_state)) { if (aut_inter->final_states().size() == 1 && aut_inter->is_final_state(initial_state)) {
@ -10521,7 +10534,7 @@ namespace smt {
} }
} }
if (aut_inter != NULL && aut_inter->is_empty()) { if (aut_inter != nullptr && aut_inter->is_empty()) {
TRACE("str", tout << "product automaton is empty; asserting conflict clause" << std::endl;); TRACE("str", tout << "product automaton is empty; asserting conflict clause" << std::endl;);
expr_ref conflict_clause(m.mk_not(mk_and(conflict_terms)), m); expr_ref conflict_clause(m.mk_not(mk_and(conflict_terms)), m);
assert_axiom(conflict_clause); assert_axiom(conflict_clause);
@ -11809,7 +11822,7 @@ namespace smt {
expr_ref assertL(mk_and(and_items_LHS), m); expr_ref assertL(mk_and(and_items_LHS), m);
SASSERT(assertL); SASSERT(assertL);
expr * finalAxiom = m.mk_or(m.mk_not(assertL), lenTestAssert.get()); expr * finalAxiom = m.mk_or(m.mk_not(assertL), lenTestAssert.get());
SASSERT(finalAxiom != NULL); SASSERT(finalAxiom != nullptr);
TRACE("str", tout << "crash avoidance finalAxiom: " << mk_pp(finalAxiom, m) << std::endl;); TRACE("str", tout << "crash avoidance finalAxiom: " << mk_pp(finalAxiom, m) << std::endl;);
return finalAxiom; return finalAxiom;
} else { } else {
@ -12095,7 +12108,7 @@ namespace smt {
lenTester_fvar_map.insert(indicator, freeVar); lenTester_fvar_map.insert(indicator, freeVar);
expr * lenTestAssert = gen_len_test_options(freeVar, indicator, testNum); expr * lenTestAssert = gen_len_test_options(freeVar, indicator, testNum);
SASSERT(lenTestAssert != NULL); SASSERT(lenTestAssert != nullptr);
return lenTestAssert; return lenTestAssert;
} else { } else {
TRACE("str", tout << "found previous in-scope length assertions" << std::endl;); TRACE("str", tout << "found previous in-scope length assertions" << std::endl;);
@ -12201,7 +12214,7 @@ namespace smt {
testNum = i + 1; testNum = i + 1;
} }
expr * lenTestAssert = gen_len_test_options(freeVar, indicator, testNum); expr * lenTestAssert = gen_len_test_options(freeVar, indicator, testNum);
SASSERT(lenTestAssert != NULL); SASSERT(lenTestAssert != nullptr);
return lenTestAssert; return lenTestAssert;
} else { } else {
// if we are performing automata-based reasoning and the term associated with // if we are performing automata-based reasoning and the term associated with

2
src/tactic/smtlogics/qfufbv_tactic.cpp
View file

@ -121,7 +121,7 @@ private:
tactic_ref t = mk_qfaufbv_tactic(m_m, m_p); tactic_ref t = mk_qfaufbv_tactic(m_m, m_p);
sat = mk_tactic2solver(m_m, t.get(), m_p); sat = mk_tactic2solver(m_m, t.get(), m_p);
} }
SASSERT(sat != NULL); SASSERT(sat != nullptr);
sat->set_produce_models(true); sat->set_produce_models(true);
return sat; return sat;
} }

2
src/util/array.h
View file

@ -154,7 +154,7 @@ public:
return static_cast<unsigned>(reinterpret_cast<size_t *>(m_data)[SIZE_IDX]); return static_cast<unsigned>(reinterpret_cast<size_t *>(m_data)[SIZE_IDX]);
} }
bool empty() const { return m_data == 0; } bool empty() const { return m_data == nullptr; }
T & operator[](unsigned idx) { T & operator[](unsigned idx) {
SASSERT(idx < size()); SASSERT(idx < size());

44
src/util/mpn.h
View file

@ -37,29 +37,29 @@ public:
mpn_manager(); mpn_manager();
~mpn_manager(); ~mpn_manager();
int compare(mpn_digit const * a, size_t const lnga, int compare(mpn_digit const * a, size_t lnga,
mpn_digit const * b, size_t const lngb) const; mpn_digit const * b, size_t lngb) const;
bool add(mpn_digit const * a, size_t const lnga, bool add(mpn_digit const * a, size_t lnga,
mpn_digit const * b, size_t const lngb, mpn_digit const * b, size_t lngb,
mpn_digit *c, size_t const lngc_alloc, mpn_digit *c, size_t lngc_alloc,
size_t * plngc) const; size_t * plngc) const;
bool sub(mpn_digit const * a, size_t const lnga, bool sub(mpn_digit const * a, size_t lnga,
mpn_digit const * b, size_t const lngb, mpn_digit const * b, size_t lngb,
mpn_digit * c, mpn_digit * pborrow) const; mpn_digit * c, mpn_digit * pborrow) const;
bool mul(mpn_digit const * a, size_t const lnga, bool mul(mpn_digit const * a, size_t lnga,
mpn_digit const * b, size_t const lngb, mpn_digit const * b, size_t lngb,
mpn_digit * c) const; mpn_digit * c) const;
bool div(mpn_digit const * numer, size_t const lnum, bool div(mpn_digit const * numer, size_t lnum,
mpn_digit const * denom, size_t const lden, mpn_digit const * denom, size_t lden,
mpn_digit * quot, mpn_digit * quot,
mpn_digit * rem); mpn_digit * rem);
char * to_string(mpn_digit const * a, size_t const lng, char * to_string(mpn_digit const * a, size_t lng,
char * buf, size_t const lbuf) const; char * buf, size_t lbuf) const;
private: private:
#ifdef _AMD64_ #ifdef _AMD64_
class mpn_sbuffer : public sbuffer<mpn_digit> { class mpn_sbuffer : public sbuffer<mpn_digit> {
@ -88,29 +88,29 @@ private:
static const mpn_digit zero; static const mpn_digit zero;
mpn_sbuffer u, v, t_ms, t_ab; mpn_sbuffer u, v, t_ms, t_ab;
void display_raw(std::ostream & out, mpn_digit const * a, size_t const lng) const; void display_raw(std::ostream & out, mpn_digit const * a, size_t lng) const;
size_t div_normalize(mpn_digit const * numer, size_t const lnum, size_t div_normalize(mpn_digit const * numer, size_t lnum,
mpn_digit const * denom, size_t const lden, mpn_digit const * denom, size_t lden,
mpn_sbuffer & n_numer, mpn_sbuffer & n_numer,
mpn_sbuffer & n_denom) const; mpn_sbuffer & n_denom) const;
void div_unnormalize(mpn_sbuffer & numer, mpn_sbuffer & denom, void div_unnormalize(mpn_sbuffer & numer, mpn_sbuffer & denom,
size_t const d, mpn_digit * rem) const; size_t d, mpn_digit * rem) const;
bool div_1(mpn_sbuffer & numer, mpn_digit const denom, bool div_1(mpn_sbuffer & numer, mpn_digit denom,
mpn_digit * quot) const; mpn_digit * quot) const;
bool div_n(mpn_sbuffer & numer, mpn_sbuffer const & denom, bool div_n(mpn_sbuffer & numer, mpn_sbuffer const & denom,
mpn_digit * quot, mpn_digit * rem, mpn_digit * quot, mpn_digit * rem,
mpn_sbuffer & ms, mpn_sbuffer & ab) const; mpn_sbuffer & ms, mpn_sbuffer & ab) const;
void trace(mpn_digit const * a, size_t const lnga, void trace(mpn_digit const * a, size_t lnga,
mpn_digit const * b, size_t const lngb, mpn_digit const * b, size_t lngb,
const char * op) const; const char * op) const;
void trace(mpn_digit const * a, size_t const lnga) const; void trace(mpn_digit const * a, size_t lnga) const;
void trace_nl(mpn_digit const * a, size_t const lnga) const; void trace_nl(mpn_digit const * a, size_t lnga) const;
}; };
#endif #endif

12
src/util/scoped_timer.cpp
View file

@ -146,7 +146,7 @@ struct scoped_timer::imp {
#if defined(_WINDOWS) || defined(_CYGWIN) #if defined(_WINDOWS) || defined(_CYGWIN)
m_first = true; m_first = true;
CreateTimerQueueTimer(&m_timer, CreateTimerQueueTimer(&m_timer,
NULL, nullptr,
abort_proc, abort_proc,
this, this,
0, 0,
@ -180,9 +180,9 @@ struct scoped_timer::imp {
m_ms = ms; m_ms = ms;
m_initialized = false; m_initialized = false;
m_signal_sent = false; m_signal_sent = false;
ENSURE(pthread_mutex_init(&m_mutex, NULL) == 0); ENSURE(pthread_mutex_init(&m_mutex, nullptr) == 0);
ENSURE(pthread_cond_init(&m_cond, NULL) == 0); ENSURE(pthread_cond_init(&m_cond, nullptr) == 0);
ENSURE(pthread_create(&m_thread_id, NULL, &thread_func, this) == 0); ENSURE(pthread_create(&m_thread_id, nullptr, &thread_func, this) == 0);
#else #else
// Other platforms // Other platforms
#endif #endif
@ -190,7 +190,7 @@ struct scoped_timer::imp {
~imp() { ~imp() {
#if defined(_WINDOWS) || defined(_CYGWIN) #if defined(_WINDOWS) || defined(_CYGWIN)
DeleteTimerQueueTimer(NULL, DeleteTimerQueueTimer(nullptr,
m_timer, m_timer,
INVALID_HANDLE_VALUE); INVALID_HANDLE_VALUE);
#elif defined(__APPLE__) && defined(__MACH__) #elif defined(__APPLE__) && defined(__MACH__)
@ -242,7 +242,7 @@ struct scoped_timer::imp {
// Perform signal outside of lock to avoid waking timing thread twice. // Perform signal outside of lock to avoid waking timing thread twice.
pthread_cond_signal(&m_cond); pthread_cond_signal(&m_cond);
pthread_join(m_thread_id, NULL); pthread_join(m_thread_id, nullptr);
pthread_cond_destroy(&m_cond); pthread_cond_destroy(&m_cond);
pthread_mutex_destroy(&m_mutex); pthread_mutex_destroy(&m_mutex);
#else #else

2
src/util/warning.cpp
View file

@ -88,7 +88,7 @@ void format2ostream(std::ostream & out, char const* msg, va_list args) {
#ifdef _WINDOWS #ifdef _WINDOWS
size_t msg_len = _vscprintf(msg, args_copy); size_t msg_len = _vscprintf(msg, args_copy);
#else #else
size_t msg_len = vsnprintf(NULL, 0, msg, args_copy); size_t msg_len = vsnprintf(nullptr, 0, msg, args_copy);
#endif #endif
va_end(args_copy); va_end(args_copy);