tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -1
- package/dist/parallel-worker.js +1 -1
- package/dist/prove-worker.cjs +1 -1
- package/dist/prove-worker.js +1 -1
- package/dist/prove.cjs +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +55 -50
- package/src/obligations/source.ts +120 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +757 -326
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- package/src/prover/isabelle/isar/attrib.ts +250 -0
- package/src/prover/isabelle/isar/context.ts +335 -0
- package/src/prover/isabelle/isar/induct.ts +382 -0
- package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +19 -30
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +1 -3
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +9 -20
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +14 -13
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
- package/src/prover/smt/solver/ackr-helper.ts +179 -0
- package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +624 -9
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -0
- package/src/prover/smt/solver/distribute-forall.ts +57 -0
- package/src/prover/smt/solver/dom-simplify.ts +511 -0
- package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
- package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
- package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
- package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
- package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
- package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
- package/src/prover/smt/solver/euf/array-solver.ts +306 -0
- package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
- package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
- package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
- package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
- package/src/prover/smt/solver/euf/egraph.ts +901 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1046 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
- package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
- package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
- package/src/prover/smt/solver/euf/q-solver.ts +361 -0
- package/src/prover/smt/solver/euf/th-solver.ts +328 -0
- package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +734 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +886 -0
- package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
- package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +178 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +34 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +111 -39
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +30 -11
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +68 -17
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +122 -90
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +310 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +110 -24
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +829 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +22 -25
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
- package/src/prover/smt/solver/sat/big.ts +177 -0
- package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
- package/src/prover/smt/solver/sat/clause.ts +203 -0
- package/src/prover/smt/solver/sat/cleaner.ts +94 -0
- package/src/prover/smt/solver/sat/config.ts +122 -0
- package/src/prover/smt/solver/sat/consequences.ts +203 -0
- package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
- package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2176 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +57 -26
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
|
@@ -1,10 +1,35 @@
|
|
|
1
|
-
|
|
1
|
+
import { SmtCanceledError, SmtInvariantError } from "../../../errors";
|
|
2
2
|
import type { AssertedFormulas } from "./asserted-formulas";
|
|
3
|
-
import {
|
|
3
|
+
import {
|
|
4
|
+
AstManager,
|
|
5
|
+
FAMILY_ARITH,
|
|
6
|
+
FAMILY_ARRAY,
|
|
7
|
+
FAMILY_BASIC,
|
|
8
|
+
FAMILY_BV,
|
|
9
|
+
FAMILY_CHAR,
|
|
10
|
+
FAMILY_DATALOG_RELATION,
|
|
11
|
+
FAMILY_DATATYPE,
|
|
12
|
+
FAMILY_FF,
|
|
13
|
+
FAMILY_FINITE_SET,
|
|
14
|
+
FAMILY_FPA,
|
|
15
|
+
FAMILY_PB,
|
|
16
|
+
FAMILY_POLY,
|
|
17
|
+
FAMILY_RECFUN,
|
|
18
|
+
FAMILY_SEQ,
|
|
19
|
+
FAMILY_SPECIAL_RELATIONS,
|
|
20
|
+
KIND_APP,
|
|
21
|
+
KIND_QUANTIFIER,
|
|
22
|
+
KIND_VAR,
|
|
23
|
+
OP_IMPLIES,
|
|
24
|
+
OP_ITE,
|
|
25
|
+
OP_NOT,
|
|
26
|
+
SORT_BOOL,
|
|
27
|
+
} from "./ast";
|
|
4
28
|
import { getCongruenceJustification, isCongruent } from "./cg-table";
|
|
5
29
|
import { BJustification, type Clause, CLS_LEARNED, CLS_TH_LEMMA, HEADER_SIZE } from "./clause";
|
|
6
30
|
import { ConflictResolution } from "./conflict-resolution";
|
|
7
31
|
import { DynAckManager } from "./dyn-ack";
|
|
32
|
+
import { FingerprintSet } from "./fingerprints";
|
|
8
33
|
import {
|
|
9
34
|
Enode,
|
|
10
35
|
EqConflictJustification,
|
|
@@ -26,34 +51,56 @@ import {
|
|
|
26
51
|
UNDO_TH_VAR,
|
|
27
52
|
} from "./internalizer";
|
|
28
53
|
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
29
|
-
import {
|
|
54
|
+
import { MaxCliques } from "./max-cliques";
|
|
55
|
+
import { BoolVar, getVar, isNegated, Literal, mkLiteral, negate, toBoolVar } from "./literal";
|
|
56
|
+
import type { MacroManager } from "./macro-finder";
|
|
30
57
|
import { mkModel } from "./model-generator";
|
|
58
|
+
import { TheoryRecfun } from "./theory-recfun";
|
|
31
59
|
import type { GeneratedModel } from "./model-generator";
|
|
32
60
|
import type { ProtoModel } from "./proto-model";
|
|
33
61
|
import { DefaultQuantifierManager } from "./quantifier-manager";
|
|
62
|
+
import { FC_CONTINUE, FC_DONE, FC_GIVEUP, Theory } from "./theory";
|
|
63
|
+
import { TheoryArray } from "./theory-array";
|
|
64
|
+
import { TheoryBv } from "./theory-bv";
|
|
65
|
+
import { TheoryFpa } from "./theory-fpa";
|
|
66
|
+
import { TheoryChar } from "./theory-char";
|
|
67
|
+
import { TheorySeq } from "./theory-seq";
|
|
68
|
+
import { TheoryDatatype } from "./theory-datatype";
|
|
69
|
+
import { TheoryFiniteSet } from "./theory-finite-set";
|
|
70
|
+
import { TheoryPb } from "./theory-pb";
|
|
71
|
+
import { TheoryPolymorphism } from "./theory-polymorphism";
|
|
72
|
+
import { TheoryWithoutTerms } from "./theory-without-terms";
|
|
34
73
|
import { TheoryLra } from "./theory-lra";
|
|
35
74
|
import { shrink } from "./array";
|
|
36
|
-
|
|
37
|
-
|
|
38
|
-
|
|
39
|
-
|
|
75
|
+
import {
|
|
76
|
+
DEFAULT_CONFIG,
|
|
77
|
+
getSmtConfig,
|
|
78
|
+
PS_ALWAYS_FALSE,
|
|
79
|
+
PS_CACHING_CONSERVATIVE,
|
|
80
|
+
PS_CACHING_CONSERVATIVE2,
|
|
81
|
+
PS_THEORY,
|
|
82
|
+
RS_GEOMETRIC,
|
|
83
|
+
RS_LUBY,
|
|
84
|
+
type SmtSetup,
|
|
85
|
+
} from "./smt-setup";
|
|
86
|
+
import type { KernelParams } from "./solver";
|
|
40
87
|
|
|
41
88
|
const ACTIVITY_LIMIT = 1e100;
|
|
42
89
|
const INV_ACTIVITY_LIMIT = 1e-100;
|
|
43
90
|
const INV_DECAY = 1.052;
|
|
44
91
|
const RESTART_INITIAL = 100;
|
|
45
|
-
const RESTART_FACTOR = 1.1;
|
|
46
92
|
const PHASE_CACHING_ON = 400;
|
|
47
93
|
const PHASE_CACHING_OFF = 100;
|
|
48
94
|
const AGILITY_FACTOR = 0.9999;
|
|
49
95
|
const LEMMA_GC_INITIAL = 5000;
|
|
50
|
-
const NUM_ARITH_FINAL_CHECK_LEVELS = 2;
|
|
51
96
|
const NEW_OLD_RATIO = 16;
|
|
52
97
|
const OLD_CLAUSE_ACTIVITY = 500;
|
|
53
98
|
const NEW_CLAUSE_RELEVANCY = 45;
|
|
54
99
|
const OLD_CLAUSE_RELEVANCY = 6;
|
|
55
100
|
const RESTART_AGILITY_THRESHOLD = 0.18;
|
|
56
101
|
|
|
102
|
+
export const MBQI_MAX_ITERATIONS = 1000;
|
|
103
|
+
|
|
57
104
|
export const CHECK_MODEL_SAT = 0;
|
|
58
105
|
export const CHECK_MODEL_UNKNOWN = 1;
|
|
59
106
|
export const CHECK_MODEL_RESTART = 2;
|
|
@@ -62,12 +109,14 @@ const FAILURE_OK = 0;
|
|
|
62
109
|
const FAILURE_THEORY = 1;
|
|
63
110
|
const FAILURE_QUANTIFIERS = 2;
|
|
64
111
|
const FAILURE_CANCELED = 3;
|
|
112
|
+
const FAILURE_NUM_CONFLICTS = 4;
|
|
65
113
|
|
|
66
114
|
type SearchFailure =
|
|
67
115
|
| typeof FAILURE_OK
|
|
68
116
|
| typeof FAILURE_THEORY
|
|
69
117
|
| typeof FAILURE_QUANTIFIERS
|
|
70
|
-
| typeof FAILURE_CANCELED
|
|
118
|
+
| typeof FAILURE_CANCELED
|
|
119
|
+
| typeof FAILURE_NUM_CONFLICTS;
|
|
71
120
|
|
|
72
121
|
type ModelState =
|
|
73
122
|
| { kind: "none" }
|
|
@@ -75,14 +124,62 @@ type ModelState =
|
|
|
75
124
|
| { kind: "proto"; generated: GeneratedModel }
|
|
76
125
|
| { kind: "final"; generated: GeneratedModel; model: ProtoModel };
|
|
77
126
|
|
|
78
|
-
|
|
127
|
+
const THEORY_MAKERS = new Map<number, (context: Context) => Theory>([
|
|
128
|
+
[FAMILY_ARITH, (context) => new TheoryLra(context)],
|
|
129
|
+
[FAMILY_ARRAY, (context) => new TheoryArray(context)],
|
|
130
|
+
[FAMILY_BV, (context) => new TheoryBv(context)],
|
|
131
|
+
[FAMILY_DATATYPE, (context) => new TheoryDatatype(context)],
|
|
132
|
+
[FAMILY_RECFUN, (context) => new TheoryRecfun(context)],
|
|
133
|
+
[FAMILY_SEQ, (context) => new TheorySeq(context)],
|
|
134
|
+
[FAMILY_CHAR, (context) => new TheoryChar(context)],
|
|
135
|
+
[FAMILY_FPA, (context) => new TheoryFpa(context)],
|
|
136
|
+
[FAMILY_FINITE_SET, (context) => new TheoryFiniteSet(context)],
|
|
137
|
+
[FAMILY_POLY, (context) => new TheoryPolymorphism(context)],
|
|
138
|
+
[FAMILY_PB, (context) => new TheoryPb(context)],
|
|
139
|
+
[
|
|
140
|
+
FAMILY_DATALOG_RELATION,
|
|
141
|
+
(context) => new TheoryWithoutTerms(context, FAMILY_DATALOG_RELATION, "datalog"),
|
|
142
|
+
],
|
|
143
|
+
[FAMILY_FF, (context) => new TheoryWithoutTerms(context, FAMILY_FF, "finite-field")],
|
|
144
|
+
[
|
|
145
|
+
FAMILY_SPECIAL_RELATIONS,
|
|
146
|
+
(context) => new TheoryWithoutTerms(context, FAMILY_SPECIAL_RELATIONS, "unknown"),
|
|
147
|
+
],
|
|
148
|
+
]);
|
|
149
|
+
|
|
150
|
+
// get_luby
|
|
151
|
+
const getLuby = (index: number): number => {
|
|
152
|
+
if (index === 1) return 1;
|
|
153
|
+
const exponent = Math.log(index + 1) / Math.log(2);
|
|
154
|
+
if (exponent === Math.floor(exponent + 0.5)) return 2 ** (exponent - 1);
|
|
155
|
+
return getLuby(index - 2 ** Math.floor(exponent) + 1);
|
|
156
|
+
};
|
|
157
|
+
|
|
158
|
+
const isValidAssumption = (manager: AstManager, expr: number) => {
|
|
159
|
+
if (manager.sorts[expr] !== SORT_BOOL) return false;
|
|
160
|
+
if (manager.isUninterpretedConst(expr)) return true;
|
|
161
|
+
if (manager.isNot(expr) && manager.isUninterpretedConst(manager.getArg(expr, 0))) return true;
|
|
162
|
+
if (manager.kinds[expr] !== KIND_APP || expr === manager.falseExpr) return false;
|
|
163
|
+
if (expr === manager.trueExpr) return true;
|
|
164
|
+
return manager.getFamily(expr) !== FAMILY_BASIC && manager.getNumArgs(expr) === 0;
|
|
165
|
+
};
|
|
166
|
+
|
|
167
|
+
export interface SmtParams {
|
|
79
168
|
isMbqi: boolean;
|
|
169
|
+
mbqiMaxIterations: number;
|
|
80
170
|
relevancyLevel: 0 | 2;
|
|
171
|
+
randomSeed?: number;
|
|
172
|
+
// The model checker's auxiliary context pretends every array operation is supported.
|
|
173
|
+
isArrayFakeSupport?: boolean;
|
|
81
174
|
}
|
|
82
175
|
|
|
83
176
|
export class Context extends Internalizer {
|
|
84
|
-
|
|
177
|
+
arith: TheoryLra | undefined;
|
|
178
|
+
setup: SmtSetup | undefined;
|
|
179
|
+
readonly theories: Theory[] = [];
|
|
180
|
+
private theoryByFamily: (Theory | undefined)[] = [];
|
|
85
181
|
readonly qmanager: DefaultQuantifierManager;
|
|
182
|
+
readonly fingerprints = new FingerprintSet(this.manager);
|
|
86
183
|
readonly conflictResolution: ConflictResolution = new ConflictResolution(this);
|
|
87
184
|
private readonly dynAck = new DynAckManager(this);
|
|
88
185
|
private qhead = 0;
|
|
@@ -90,36 +187,104 @@ export class Context extends Internalizer {
|
|
|
90
187
|
private scopeAuxClauseLimits: number[] = [];
|
|
91
188
|
private scopeTrailLimits: number[] = [];
|
|
92
189
|
private baseScopeLemmaLimits: number[] = [];
|
|
190
|
+
private isBaseScopeInconsistent: boolean[] = [];
|
|
93
191
|
private atomPropagationQueue: Literal[] = [];
|
|
94
192
|
private thEqQueue: number[] = [];
|
|
95
193
|
private thDiseqQueue: number[] = [];
|
|
96
194
|
private bvarInc = 1;
|
|
97
195
|
private agility = 0;
|
|
98
196
|
private numConflicts = 0;
|
|
197
|
+
maxConflicts = Infinity;
|
|
99
198
|
private numConflictsSinceRestart = 0;
|
|
100
199
|
private numConflictsSinceLemmaGc = 0;
|
|
101
200
|
private restartThreshold = RESTART_INITIAL;
|
|
102
201
|
private restartOuterThreshold = RESTART_INITIAL;
|
|
103
202
|
private isPhaseCacheOn = true;
|
|
104
203
|
private phaseCounter = 0;
|
|
204
|
+
private phaseDefault = false;
|
|
205
|
+
private lubyIndex = 1;
|
|
105
206
|
private finalCheckIndex = 0;
|
|
207
|
+
private literalAssumptions = new Map<Literal, number>();
|
|
208
|
+
unsatCore: number[] = [];
|
|
106
209
|
private r1ParentGenerations = new Map<Enode, number>();
|
|
107
210
|
private erasedGenerations = new Map<Enode, number>();
|
|
108
211
|
private lastSearchFailure: SearchFailure = FAILURE_OK;
|
|
212
|
+
// As in Z3, a new search doesn't reset it.
|
|
213
|
+
reasonUnknown = "unknown";
|
|
214
|
+
private hasCaseSplit = true;
|
|
215
|
+
private incompleteTheories: Theory[] = [];
|
|
109
216
|
private modelState: ModelState = { kind: "none" };
|
|
217
|
+
private asserted: AssertedFormulas | undefined;
|
|
218
|
+
macros: MacroManager | undefined;
|
|
219
|
+
hasQuantifiers = false;
|
|
220
|
+
|
|
221
|
+
constructor(
|
|
222
|
+
manager: AstManager,
|
|
223
|
+
readonly params: SmtParams,
|
|
224
|
+
) {
|
|
225
|
+
super(manager, params.relevancyLevel > 0);
|
|
226
|
+
this.qmanager = new DefaultQuantifierManager(this);
|
|
227
|
+
}
|
|
228
|
+
|
|
229
|
+
// As in Z3, rereading the parameters drops the setup's tuning but for eliminate_term_ite, eliminate_bounds and relevancy.
|
|
230
|
+
updateParams(params: KernelParams) {
|
|
231
|
+
this.params.isMbqi = params.isMbqi;
|
|
232
|
+
this.params.mbqiMaxIterations = params.mbqiMaxIterations;
|
|
233
|
+
this.params.randomSeed = params.randomSeed;
|
|
234
|
+
this.config = {
|
|
235
|
+
...DEFAULT_CONFIG,
|
|
236
|
+
theories: this.config.theories,
|
|
237
|
+
isFindingMacros: params.isFindingMacros,
|
|
238
|
+
isEliminatingTermIte: this.config.isEliminatingTermIte,
|
|
239
|
+
isEliminatingBounds: this.config.isEliminatingBounds,
|
|
240
|
+
};
|
|
241
|
+
this.qmanager.updateParams();
|
|
242
|
+
}
|
|
243
|
+
|
|
244
|
+
// setup_context and setup_components. The setup's theories come in its order, then setup_card's.
|
|
245
|
+
setupContext(
|
|
246
|
+
setup: SmtSetup | undefined,
|
|
247
|
+
isUsingStaticFeatures: boolean,
|
|
248
|
+
asserted: AssertedFormulas,
|
|
249
|
+
) {
|
|
250
|
+
if (this.isInconsistent() || asserted.isInconsistent) return false;
|
|
251
|
+
const config = getSmtConfig(
|
|
252
|
+
this.manager,
|
|
253
|
+
setup,
|
|
254
|
+
isUsingStaticFeatures,
|
|
255
|
+
asserted.getFormulas(),
|
|
256
|
+
this.config,
|
|
257
|
+
);
|
|
258
|
+
this.setup = setup;
|
|
259
|
+
this.config = config;
|
|
260
|
+
this.randomSeed = this.params.randomSeed ?? 0;
|
|
261
|
+
if (config.relevancyLevel !== undefined) this.relevancy.isEnabled = config.relevancyLevel > 0;
|
|
262
|
+
for (const family of config.theories)
|
|
263
|
+
if (family !== FAMILY_POLY || this.manager.hasTypeVars) this.registerFamily(family);
|
|
264
|
+
this.registerFamily(FAMILY_PB);
|
|
265
|
+
asserted.setup(config);
|
|
266
|
+
return true;
|
|
267
|
+
}
|
|
110
268
|
|
|
111
|
-
|
|
112
|
-
|
|
113
|
-
this.
|
|
269
|
+
// register_plugin keeps the theory a family already has.
|
|
270
|
+
registerFamily(family: number) {
|
|
271
|
+
if (this.getTheory(family) !== undefined) return;
|
|
272
|
+
const theory = THEORY_MAKERS.get(family)!(this);
|
|
273
|
+
if (theory instanceof TheoryLra) this.arith = theory;
|
|
274
|
+
this.theories.push(theory);
|
|
275
|
+
this.theoryByFamily[theory.id] = theory;
|
|
276
|
+
theory.init();
|
|
277
|
+
for (let level = 0; level < this.scopeLevel; level++) theory.pushScopeEh();
|
|
114
278
|
}
|
|
115
279
|
|
|
116
|
-
|
|
117
|
-
|
|
118
|
-
this.theory.init();
|
|
280
|
+
getTheory(family: number) {
|
|
281
|
+
return family < 0 ? undefined : this.theoryByFamily[family];
|
|
119
282
|
}
|
|
120
283
|
|
|
121
|
-
checkCanceled() {
|
|
122
|
-
|
|
284
|
+
checkCanceled(cost = 1) {
|
|
285
|
+
if (this.manager.limit.inc(cost)) return false;
|
|
286
|
+
this.lastSearchFailure = FAILURE_CANCELED;
|
|
287
|
+
return true;
|
|
123
288
|
}
|
|
124
289
|
|
|
125
290
|
assign(literal: Literal, justification: BJustification, isDecision = false) {
|
|
@@ -136,7 +301,7 @@ export class Context extends Internalizer {
|
|
|
136
301
|
this.justifications[boolVar] = justification;
|
|
137
302
|
this.setLevel(boolVar, this.scopeLevel);
|
|
138
303
|
const isNegative = isNegated(literal);
|
|
139
|
-
if (this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE)) {
|
|
304
|
+
if (this.config.isRestartAdaptive && this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE)) {
|
|
140
305
|
this.agility *= AGILITY_FACTOR;
|
|
141
306
|
if (!isDecision && this.hasBoolVarFlag(boolVar, BV_PHASE) === isNegative)
|
|
142
307
|
this.agility += 1 - AGILITY_FACTOR;
|
|
@@ -244,7 +409,7 @@ export class Context extends Internalizer {
|
|
|
244
409
|
}
|
|
245
410
|
}
|
|
246
411
|
} else if (this.hasBoolVarFlag(boolVar, BV_THEORY))
|
|
247
|
-
this.
|
|
412
|
+
this.getTheory(this.getBoolVarTheory(boolVar))?.assignEh(boolVar, value === L_TRUE);
|
|
248
413
|
else if (this.hasBoolVarFlag(boolVar, BV_QUANTIFIER) && value === L_TRUE)
|
|
249
414
|
this.qmanager.assignEh(this.boolVar2Expr[boolVar]);
|
|
250
415
|
if (this.isInconsistent()) return false;
|
|
@@ -294,8 +459,14 @@ export class Context extends Internalizer {
|
|
|
294
459
|
if (this.manager.kinds[expr] !== KIND_APP) return;
|
|
295
460
|
const node = this.exprToEnode[expr];
|
|
296
461
|
if (node !== undefined) this.qmanager.relevantEh(node);
|
|
297
|
-
|
|
298
|
-
|
|
462
|
+
const propagated = this.getTheory(this.manager.getFamily(expr));
|
|
463
|
+
propagated?.relevantEh(expr);
|
|
464
|
+
if (node === undefined || node.thVar < 0) return;
|
|
465
|
+
if (this.theoryByFamily[node.thId] !== propagated)
|
|
466
|
+
this.theoryByFamily[node.thId]?.relevantEh(expr);
|
|
467
|
+
for (let cell = node.thNext; cell !== null; cell = cell.next)
|
|
468
|
+
if (this.theoryByFamily[cell.thId] !== propagated)
|
|
469
|
+
this.theoryByFamily[cell.thId]?.relevantEh(expr);
|
|
299
470
|
}
|
|
300
471
|
|
|
301
472
|
private propagateRelevancy(qhead: number) {
|
|
@@ -308,25 +479,38 @@ export class Context extends Internalizer {
|
|
|
308
479
|
|
|
309
480
|
private propagateThEqs() {
|
|
310
481
|
const queue = this.thEqQueue;
|
|
311
|
-
for (let index = 0; index < queue.length && !this.isInconsistent(); index +=
|
|
312
|
-
this.
|
|
482
|
+
for (let index = 0; index < queue.length && !this.isInconsistent(); index += 3)
|
|
483
|
+
this.theoryByFamily[queue[index]]?.newEqEh(queue[index + 1], queue[index + 2]);
|
|
313
484
|
this.thEqQueue = [];
|
|
314
485
|
}
|
|
315
486
|
|
|
316
487
|
private propagateThDiseqs() {
|
|
317
488
|
const queue = this.thDiseqQueue;
|
|
318
|
-
for (let index = 0; index < queue.length && !this.isInconsistent(); index +=
|
|
319
|
-
this.
|
|
489
|
+
for (let index = 0; index < queue.length && !this.isInconsistent(); index += 3)
|
|
490
|
+
this.theoryByFamily[queue[index]]?.newDiseqEh(queue[index + 1], queue[index + 2]);
|
|
320
491
|
this.thDiseqQueue = [];
|
|
321
492
|
}
|
|
322
493
|
|
|
494
|
+
private canTheoriesPropagate() {
|
|
495
|
+
for (const theory of this.theories) if (theory.canPropagate()) return true;
|
|
496
|
+
return false;
|
|
497
|
+
}
|
|
498
|
+
|
|
499
|
+
private propagateTheories() {
|
|
500
|
+
for (const theory of this.theories) {
|
|
501
|
+
theory.propagate();
|
|
502
|
+
if (this.isInconsistent()) return false;
|
|
503
|
+
}
|
|
504
|
+
return true;
|
|
505
|
+
}
|
|
506
|
+
|
|
323
507
|
canPropagate() {
|
|
324
508
|
return (
|
|
325
509
|
this.qhead !== this.assignedLiterals.length ||
|
|
326
510
|
this.relevancy.canPropagate() ||
|
|
327
511
|
this.atomPropagationQueue.length > 0 ||
|
|
328
512
|
this.qmanager.canPropagate() ||
|
|
329
|
-
this.
|
|
513
|
+
this.canTheoriesPropagate() ||
|
|
330
514
|
this.eqPropagationQueue.length > 0 ||
|
|
331
515
|
this.thEqQueue.length > 0 ||
|
|
332
516
|
this.thDiseqQueue.length > 0
|
|
@@ -345,8 +529,7 @@ export class Context extends Internalizer {
|
|
|
345
529
|
this.propagateThEqs();
|
|
346
530
|
this.propagateThDiseqs();
|
|
347
531
|
if (this.isInconsistent()) return false;
|
|
348
|
-
this.
|
|
349
|
-
if (this.isInconsistent()) return false;
|
|
532
|
+
if (!this.propagateTheories()) return false;
|
|
350
533
|
if (!this.checkCanceled()) this.qmanager.propagate();
|
|
351
534
|
if (this.isInconsistent()) return false;
|
|
352
535
|
if (this.isResourceLimitExceeded()) {
|
|
@@ -357,9 +540,12 @@ export class Context extends Internalizer {
|
|
|
357
540
|
}
|
|
358
541
|
}
|
|
359
542
|
|
|
360
|
-
private getClosestVar(start: Enode) {
|
|
361
|
-
|
|
362
|
-
|
|
543
|
+
private getClosestVar(start: Enode, thId: number) {
|
|
544
|
+
if (thId < 0) return -1;
|
|
545
|
+
for (let node: Enode | null = start; node !== null; node = node.transTarget) {
|
|
546
|
+
const thVar = node.getThVar(thId);
|
|
547
|
+
if (thVar >= 0) return thVar;
|
|
548
|
+
}
|
|
363
549
|
return -1;
|
|
364
550
|
}
|
|
365
551
|
|
|
@@ -379,17 +565,19 @@ export class Context extends Internalizer {
|
|
|
379
565
|
}
|
|
380
566
|
}
|
|
381
567
|
|
|
382
|
-
private pushNewThEq(first: number, second: number) {
|
|
383
|
-
this.thEqQueue.push(first, second);
|
|
568
|
+
private pushNewThEq(thId: number, first: number, second: number) {
|
|
569
|
+
this.thEqQueue.push(thId, first, second);
|
|
384
570
|
}
|
|
385
571
|
|
|
386
|
-
private pushNewThDiseq(first: number, second: number) {
|
|
387
|
-
const theory = this.
|
|
572
|
+
private pushNewThDiseq(thId: number, first: number, second: number) {
|
|
573
|
+
const theory = this.theoryByFamily[thId];
|
|
574
|
+
if (theory === undefined) return;
|
|
388
575
|
if (theory.getEnode(first).isInterpreted && theory.getEnode(second).isInterpreted) return;
|
|
389
|
-
this.thDiseqQueue.push(first, second);
|
|
576
|
+
this.thDiseqQueue.push(thId, first, second);
|
|
390
577
|
}
|
|
391
578
|
|
|
392
|
-
private pushNewThDiseqs(root: Enode, thVar: number) {
|
|
579
|
+
private pushNewThDiseqs(root: Enode, thVar: number, thId: number) {
|
|
580
|
+
if (!this.theoryByFamily[thId]?.useDiseqs()) return;
|
|
393
581
|
for (const parent of root.parents) {
|
|
394
582
|
if (!parent.isEq) continue;
|
|
395
583
|
if (this.assignment[mkLiteral(this.getBoolVar(parent.owner))] !== L_FALSE) continue;
|
|
@@ -400,10 +588,10 @@ export class Context extends Internalizer {
|
|
|
400
588
|
lhs = rhs;
|
|
401
589
|
rhs = saved;
|
|
402
590
|
}
|
|
403
|
-
const rhsVar = this.getClosestVar(rhs);
|
|
404
|
-
const lhsVar = this.getClosestVar(lhs);
|
|
591
|
+
const rhsVar = this.getClosestVar(rhs, thId);
|
|
592
|
+
const lhsVar = this.getClosestVar(lhs, thId);
|
|
405
593
|
const finalVar = lhsVar >= 0 ? lhsVar : thVar;
|
|
406
|
-
if (rhsVar >= 0 && finalVar !== rhsVar) this.pushNewThDiseq(finalVar, rhsVar);
|
|
594
|
+
if (rhsVar >= 0 && finalVar !== rhsVar) this.pushNewThDiseq(thId, finalVar, rhsVar);
|
|
407
595
|
}
|
|
408
596
|
}
|
|
409
597
|
|
|
@@ -411,38 +599,65 @@ export class Context extends Internalizer {
|
|
|
411
599
|
const r2 = n2.root;
|
|
412
600
|
const r1 = n1.root;
|
|
413
601
|
if (r1.thVar < 0 && r2.thVar < 0) return;
|
|
414
|
-
const
|
|
415
|
-
|
|
416
|
-
|
|
417
|
-
|
|
418
|
-
|
|
419
|
-
|
|
420
|
-
|
|
421
|
-
|
|
422
|
-
|
|
602
|
+
const fromTheory =
|
|
603
|
+
justification.kind === "justification" ? justification.justification.fromTheory : -1;
|
|
604
|
+
if (r2.thNext === null && r1.thNext === null) {
|
|
605
|
+
const t2 = r2.thId;
|
|
606
|
+
const t1 = r1.thId;
|
|
607
|
+
const v2 = this.getClosestVar(n2, t2);
|
|
608
|
+
const v1 = this.getClosestVar(n1, t1);
|
|
609
|
+
if (v2 >= 0 && v1 >= 0) {
|
|
610
|
+
if (t1 === t2) {
|
|
611
|
+
if (t1 !== fromTheory) this.pushNewThEq(t1, v2, v1);
|
|
612
|
+
return;
|
|
613
|
+
}
|
|
614
|
+
r2.addThVar(v1, t1);
|
|
615
|
+
this.pushNewThDiseqs(r2, v1, t1);
|
|
616
|
+
this.pushNewThDiseqs(r1, v2, t2);
|
|
617
|
+
} else if (v1 < 0 && v2 >= 0) this.pushNewThDiseqs(r1, v2, t2);
|
|
618
|
+
else if (v1 >= 0 && v2 < 0) {
|
|
619
|
+
r2.thVar = v1;
|
|
620
|
+
r2.thId = t1;
|
|
621
|
+
this.pushNewThDiseqs(r2, v1, t1);
|
|
622
|
+
}
|
|
623
|
+
return;
|
|
423
624
|
}
|
|
424
|
-
|
|
425
|
-
|
|
426
|
-
|
|
427
|
-
|
|
625
|
+
r2.forEachThVar((t2) => {
|
|
626
|
+
const v2 = this.getClosestVar(n2, t2);
|
|
627
|
+
const v1 = this.getClosestVar(n1, t2);
|
|
628
|
+
if (v1 >= 0) {
|
|
629
|
+
if (t2 !== fromTheory) this.pushNewThEq(t2, v2, v1);
|
|
630
|
+
} else this.pushNewThDiseqs(r1, v2, t2);
|
|
631
|
+
});
|
|
632
|
+
r1.forEachThVar((t1) => {
|
|
633
|
+
const v1 = this.getClosestVar(n1, t1);
|
|
634
|
+
if (r2.getThVar(t1) >= 0) return;
|
|
635
|
+
r2.addThVar(v1, t1);
|
|
636
|
+
this.pushNewThDiseqs(r2, v1, t1);
|
|
637
|
+
});
|
|
638
|
+
}
|
|
639
|
+
|
|
640
|
+
attachThVar(node: Enode, theory: Theory, thVar: number) {
|
|
641
|
+
const thId = theory.id;
|
|
642
|
+
const oldVar = node.getThVar(thId);
|
|
428
643
|
if (oldVar >= 0) {
|
|
429
|
-
node.thVar
|
|
644
|
+
node.replaceThVar(thVar, thId);
|
|
430
645
|
this.pushTrail(() => {
|
|
431
|
-
node.
|
|
646
|
+
node.replaceThVar(oldVar, thId);
|
|
432
647
|
});
|
|
433
|
-
this.pushNewThEq(thVar, oldVar);
|
|
648
|
+
this.pushNewThEq(thId, thVar, oldVar);
|
|
434
649
|
return;
|
|
435
650
|
}
|
|
436
651
|
const root = node.root;
|
|
437
|
-
const rootVar = root.
|
|
438
|
-
node.thVar
|
|
439
|
-
this.trailInts.push(
|
|
652
|
+
const rootVar = root.getThVar(thId);
|
|
653
|
+
node.addThVar(thVar, thId);
|
|
654
|
+
this.trailInts.push(thId);
|
|
440
655
|
this.trailNodes.push(node);
|
|
441
656
|
this.trailKinds.push(UNDO_TH_VAR);
|
|
442
657
|
if (rootVar < 0) {
|
|
443
|
-
if (root !== node) root.thVar
|
|
444
|
-
this.pushNewThDiseqs(root, thVar);
|
|
445
|
-
} else if (root !== node) this.pushNewThEq(rootVar, thVar);
|
|
658
|
+
if (root !== node) root.addThVar(thVar, thId);
|
|
659
|
+
this.pushNewThDiseqs(root, thVar, thId);
|
|
660
|
+
} else if (root !== node) this.pushNewThEq(thId, rootVar, thVar);
|
|
446
661
|
}
|
|
447
662
|
|
|
448
663
|
addEq(inputN1: Enode, inputN2: Enode, justification: EqJustification) {
|
|
@@ -555,9 +770,10 @@ export class Context extends Internalizer {
|
|
|
555
770
|
}
|
|
556
771
|
case UNDO_TH_VAR: {
|
|
557
772
|
const node = this.popTrailNode();
|
|
558
|
-
const
|
|
559
|
-
|
|
560
|
-
|
|
773
|
+
const thId = this.popTrailInt();
|
|
774
|
+
const thVar = node.getThVar(thId);
|
|
775
|
+
node.delThVar(thId);
|
|
776
|
+
if (node.root !== node && node.root.getThVar(thId) === thVar) node.root.delThVar(thId);
|
|
561
777
|
return;
|
|
562
778
|
}
|
|
563
779
|
default:
|
|
@@ -601,7 +817,12 @@ export class Context extends Internalizer {
|
|
|
601
817
|
parent.cg = congruent;
|
|
602
818
|
if (congruent === parent) parent.generation = generation;
|
|
603
819
|
}
|
|
604
|
-
if (r2.
|
|
820
|
+
if (r2.thNext === null) {
|
|
821
|
+
if (r2.thVar >= 0 && this.theoryByFamily[r2.thId]?.getEnode(r2.thVar).root !== r2) {
|
|
822
|
+
r2.thVar = -1;
|
|
823
|
+
r2.thId = -1;
|
|
824
|
+
}
|
|
825
|
+
} else r2.restoreThVars((thId, thVar) => this.theoryByFamily[thId]?.getEnode(thVar) ?? r2);
|
|
605
826
|
n1.transTarget = null;
|
|
606
827
|
this.invertTrans(r1);
|
|
607
828
|
}
|
|
@@ -643,13 +864,38 @@ export class Context extends Internalizer {
|
|
|
643
864
|
private addDiseq(n1: Enode, n2: Enode) {
|
|
644
865
|
const r1 = n1.root;
|
|
645
866
|
const r2 = n2.root;
|
|
646
|
-
if (r1 === r2) return r1.
|
|
647
|
-
|
|
648
|
-
|
|
649
|
-
|
|
867
|
+
if (r1 === r2) return this.theoryByFamily[r1.thId]?.useDiseqs() ?? false;
|
|
868
|
+
if (r1.thNext === null && r2.thNext === null) {
|
|
869
|
+
const t1 = r1.thId;
|
|
870
|
+
const v1 = this.getClosestVar(n1, t1);
|
|
871
|
+
const v2 = this.getClosestVar(n2, t1);
|
|
872
|
+
if (v1 >= 0 && v2 >= 0 && t1 === r2.thId && this.theoryByFamily[t1]?.useDiseqs())
|
|
873
|
+
this.pushNewThDiseq(t1, v1, v2);
|
|
874
|
+
return true;
|
|
875
|
+
}
|
|
876
|
+
r1.forEachThVar((t1) => {
|
|
877
|
+
if (!this.theoryByFamily[t1]?.useDiseqs()) return;
|
|
878
|
+
const v1 = this.getClosestVar(n1, t1);
|
|
879
|
+
const v2 = this.getClosestVar(n2, t1);
|
|
880
|
+
if (v2 >= 0) this.pushNewThDiseq(t1, v1, v2);
|
|
881
|
+
});
|
|
650
882
|
return true;
|
|
651
883
|
}
|
|
652
884
|
|
|
885
|
+
isShared(node: Enode) {
|
|
886
|
+
const root = node.root;
|
|
887
|
+
if (this.manager.getOp(root.owner) === OP_ITE) return true;
|
|
888
|
+
if (root.thVar < 0) return false;
|
|
889
|
+
if (root.thNext !== null) return true;
|
|
890
|
+
if (this.qmanager.isShared(root)) return true;
|
|
891
|
+
for (const parent of root.parents) {
|
|
892
|
+
const family = this.manager.getFamily(parent.owner);
|
|
893
|
+
if (family === root.thId || family === FAMILY_BASIC) continue;
|
|
894
|
+
if (!this.getTheory(family)?.isBetaRedex(parent, root)) return true;
|
|
895
|
+
}
|
|
896
|
+
return this.getTheory(root.thId)?.isShared(root.thVar) ?? false;
|
|
897
|
+
}
|
|
898
|
+
|
|
653
899
|
assumeEq(lhs: Enode, rhs: Enode) {
|
|
654
900
|
if (lhs.root === rhs.root) return false;
|
|
655
901
|
const eq = this.mkEqAtom(lhs.owner, rhs.owner);
|
|
@@ -659,7 +905,10 @@ export class Context extends Internalizer {
|
|
|
659
905
|
const boolVar = this.getBoolVar(eq);
|
|
660
906
|
this.setBoolVarFlag(boolVar, BV_EQ, true);
|
|
661
907
|
this.setTrueFirstFlag(boolVar);
|
|
662
|
-
this.
|
|
908
|
+
this.getTheory(this.manager.getSortFamily(this.manager.sorts[lhs.owner]))?.internalizeEqEh(
|
|
909
|
+
eq,
|
|
910
|
+
boolVar,
|
|
911
|
+
);
|
|
663
912
|
isNew = true;
|
|
664
913
|
}
|
|
665
914
|
const boolVar = this.getBoolVar(eq);
|
|
@@ -685,14 +934,15 @@ export class Context extends Internalizer {
|
|
|
685
934
|
this.caseSplitQueue.activityIncreased(boolVar);
|
|
686
935
|
}
|
|
687
936
|
|
|
688
|
-
|
|
937
|
+
pushScope() {
|
|
689
938
|
this.scopeLevel++;
|
|
690
939
|
this.scopeAssignedLimits.push(this.assignedLiterals.length);
|
|
691
940
|
this.scopeAuxClauseLimits.push(this.auxClauses.length);
|
|
692
941
|
this.scopeTrailLimits.push(this.trailKinds.length);
|
|
693
942
|
this.relevancy.push();
|
|
694
943
|
this.qmanager.push();
|
|
695
|
-
this.
|
|
944
|
+
this.fingerprints.push();
|
|
945
|
+
for (const theory of this.theories) theory.pushScopeEh();
|
|
696
946
|
}
|
|
697
947
|
|
|
698
948
|
private cacheGenerationOfExpr(expr: number, newLevel: number, visited: Set<number>) {
|
|
@@ -750,16 +1000,18 @@ export class Context extends Internalizer {
|
|
|
750
1000
|
const newLevel = this.scopeLevel - numScopes;
|
|
751
1001
|
this.cacheGeneration(newLevel, visited);
|
|
752
1002
|
this.qmanager.pop(numScopes);
|
|
1003
|
+
this.fingerprints.pop(numScopes);
|
|
1004
|
+
if (newLevel >= this.baseLevel || !this.isBaseScopeInconsistent[newLevel]) this.conflict = null;
|
|
753
1005
|
if (newLevel < this.baseLevel) {
|
|
754
1006
|
this.deleteClauses(this.lemmas, this.baseScopeLemmaLimits[newLevel]);
|
|
755
1007
|
shrink(this.baseScopeLemmaLimits, newLevel);
|
|
1008
|
+
shrink(this.isBaseScopeInconsistent, newLevel);
|
|
756
1009
|
}
|
|
757
|
-
this.conflict = null;
|
|
758
1010
|
this.deleteClauses(this.auxClauses, this.scopeAuxClauseLimits[newLevel]);
|
|
759
1011
|
this.relevancy.pop(numScopes);
|
|
760
1012
|
this.unassignVars(this.scopeAssignedLimits[newLevel]);
|
|
761
1013
|
this.popTrail(this.scopeTrailLimits[newLevel]);
|
|
762
|
-
this.theory.popScopeEh(numScopes);
|
|
1014
|
+
for (const theory of this.theories) theory.popScopeEh(numScopes);
|
|
763
1015
|
this.eqPropagationQueue = [];
|
|
764
1016
|
this.thEqQueue = [];
|
|
765
1017
|
this.thDiseqQueue = [];
|
|
@@ -777,7 +1029,7 @@ export class Context extends Internalizer {
|
|
|
777
1029
|
return numBoolVars;
|
|
778
1030
|
}
|
|
779
1031
|
|
|
780
|
-
|
|
1032
|
+
popScope(numScopes: number) {
|
|
781
1033
|
this.popScopeCore(numScopes, new Set());
|
|
782
1034
|
this.cachedGeneration.clear();
|
|
783
1035
|
}
|
|
@@ -875,11 +1127,17 @@ export class Context extends Internalizer {
|
|
|
875
1127
|
private guess(boolVar: BoolVar) {
|
|
876
1128
|
if (this.manager.kinds[this.boolVar2Expr[boolVar]] === KIND_QUANTIFIER) return false;
|
|
877
1129
|
if (this.hasBoolVarFlag(boolVar, BV_TRUE_FIRST)) return true;
|
|
878
|
-
|
|
879
|
-
|
|
880
|
-
|
|
881
|
-
|
|
882
|
-
|
|
1130
|
+
const phaseSelection = this.config.phaseSelection;
|
|
1131
|
+
if (phaseSelection === PS_ALWAYS_FALSE) return false;
|
|
1132
|
+
const isPhaseAvailable = this.hasBoolVarFlag(boolVar, BV_PHASE_AVAILABLE);
|
|
1133
|
+
if (phaseSelection === PS_THEORY) {
|
|
1134
|
+
const phase = this.getTheory(this.getBoolVarTheory(boolVar))?.getPhase(boolVar) ?? L_UNDEF;
|
|
1135
|
+
if (phase !== L_UNDEF) return phase === L_TRUE;
|
|
1136
|
+
return isPhaseAvailable ? this.hasBoolVarFlag(boolVar, BV_PHASE) : this.phaseDefault;
|
|
1137
|
+
}
|
|
1138
|
+
return this.isPhaseCacheOn && isPhaseAvailable
|
|
1139
|
+
? this.hasBoolVarFlag(boolVar, BV_PHASE)
|
|
1140
|
+
: this.phaseDefault;
|
|
883
1141
|
}
|
|
884
1142
|
|
|
885
1143
|
private updatePhaseCacheCounter() {
|
|
@@ -887,18 +1145,27 @@ export class Context extends Internalizer {
|
|
|
887
1145
|
if (this.phaseCounter < (this.isPhaseCacheOn ? PHASE_CACHING_ON : PHASE_CACHING_OFF)) return;
|
|
888
1146
|
this.phaseCounter = 0;
|
|
889
1147
|
this.isPhaseCacheOn = !this.isPhaseCacheOn;
|
|
1148
|
+
if (this.config.phaseSelection === PS_CACHING_CONSERVATIVE2)
|
|
1149
|
+
this.phaseDefault = !this.phaseDefault;
|
|
890
1150
|
}
|
|
891
1151
|
|
|
892
1152
|
private decide() {
|
|
893
1153
|
const boolVar = this.caseSplitQueue.nextCaseSplit();
|
|
894
|
-
if (boolVar === undefined)
|
|
1154
|
+
if (boolVar === undefined) {
|
|
1155
|
+
const hadCaseSplit = this.hasCaseSplit;
|
|
1156
|
+
this.pushTrail(() => {
|
|
1157
|
+
this.hasCaseSplit = hadCaseSplit;
|
|
1158
|
+
});
|
|
1159
|
+
this.hasCaseSplit = false;
|
|
1160
|
+
return false;
|
|
1161
|
+
}
|
|
895
1162
|
const isPositive = this.guess(boolVar);
|
|
896
1163
|
this.pushScope();
|
|
897
1164
|
this.assign(mkLiteral(boolVar, !isPositive), "axiom", true);
|
|
898
1165
|
return true;
|
|
899
1166
|
}
|
|
900
1167
|
|
|
901
|
-
|
|
1168
|
+
resolveConflict() {
|
|
902
1169
|
this.numConflicts++;
|
|
903
1170
|
this.numConflictsSinceRestart++;
|
|
904
1171
|
this.numConflictsSinceLemmaGc++;
|
|
@@ -906,9 +1173,15 @@ export class Context extends Internalizer {
|
|
|
906
1173
|
this.eqPropagationQueue = [];
|
|
907
1174
|
this.thEqQueue = [];
|
|
908
1175
|
this.thDiseqQueue = [];
|
|
1176
|
+
const phaseSelection = this.config.phaseSelection;
|
|
909
1177
|
const head = this.scopeLevel === 0 ? 0 : this.scopeAssignedLimits[this.scopeLevel - 1];
|
|
910
|
-
|
|
911
|
-
|
|
1178
|
+
if (
|
|
1179
|
+
phaseSelection === PS_THEORY ||
|
|
1180
|
+
phaseSelection === PS_CACHING_CONSERVATIVE ||
|
|
1181
|
+
phaseSelection === PS_CACHING_CONSERVATIVE2
|
|
1182
|
+
)
|
|
1183
|
+
for (let index = head; index < this.assignedLiterals.length; index++)
|
|
1184
|
+
this.setBoolVarFlag(getVar(this.assignedLiterals[index]), BV_PHASE_AVAILABLE, false);
|
|
912
1185
|
const resolution = this.conflictResolution;
|
|
913
1186
|
if (
|
|
914
1187
|
this.conflict === null ||
|
|
@@ -954,19 +1227,18 @@ export class Context extends Internalizer {
|
|
|
954
1227
|
let failure: SearchFailure = FAILURE_OK;
|
|
955
1228
|
let level = 1;
|
|
956
1229
|
let maxLevel = 1;
|
|
1230
|
+
this.incompleteTheories = [];
|
|
957
1231
|
for (;;) {
|
|
958
|
-
const
|
|
959
|
-
|
|
960
|
-
if (
|
|
961
|
-
|
|
962
|
-
this.getRandomValue();
|
|
963
|
-
}
|
|
964
|
-
const check = isTheory ? this.theory.finalCheckEh(level) : qmanager.finalCheckEh(true);
|
|
965
|
-
if (isTheory) maxLevel = Math.max(maxLevel, NUM_ARITH_FINAL_CHECK_LEVELS);
|
|
966
|
-
const isCanceled = isTheory && this.checkCanceled();
|
|
1232
|
+
const theory = this.theories[this.finalCheckIndex];
|
|
1233
|
+
const check = theory === undefined ? qmanager.finalCheckEh(true) : theory.finalCheckEh(level);
|
|
1234
|
+
if (theory !== undefined) maxLevel = Math.max(maxLevel, theory.numFinalCheckLevels());
|
|
1235
|
+
const isCanceled = theory !== undefined && this.checkCanceled();
|
|
967
1236
|
if (isCanceled) failure = FAILURE_CANCELED;
|
|
968
|
-
else if (
|
|
969
|
-
|
|
1237
|
+
else if (theory !== undefined && check === FC_GIVEUP) {
|
|
1238
|
+
failure = FAILURE_THEORY;
|
|
1239
|
+
if (!this.incompleteTheories.includes(theory)) this.incompleteTheories.push(theory);
|
|
1240
|
+
}
|
|
1241
|
+
this.finalCheckIndex = (this.finalCheckIndex + 1) % (this.theories.length + 1);
|
|
970
1242
|
if (check === FC_CONTINUE) return FC_CONTINUE;
|
|
971
1243
|
if (check === FC_GIVEUP || isCanceled) result = FC_GIVEUP;
|
|
972
1244
|
if (this.finalCheckIndex !== oldIndex) continue;
|
|
@@ -974,13 +1246,14 @@ export class Context extends Internalizer {
|
|
|
974
1246
|
level++;
|
|
975
1247
|
result = FC_DONE;
|
|
976
1248
|
failure = FAILURE_OK;
|
|
1249
|
+
this.incompleteTheories = [];
|
|
977
1250
|
}
|
|
978
1251
|
if (this.canPropagate()) return FC_CONTINUE;
|
|
979
1252
|
if (result === FC_GIVEUP && failure !== FAILURE_OK) this.lastSearchFailure = failure;
|
|
980
1253
|
return result;
|
|
981
1254
|
}
|
|
982
1255
|
|
|
983
|
-
|
|
1256
|
+
boundedSearch() {
|
|
984
1257
|
for (;;) {
|
|
985
1258
|
while (!this.propagate()) {
|
|
986
1259
|
if (!this.resolveConflict()) return L_FALSE;
|
|
@@ -991,6 +1264,10 @@ export class Context extends Internalizer {
|
|
|
991
1264
|
this.scopeLevel - this.baseLevel > 2
|
|
992
1265
|
)
|
|
993
1266
|
return L_UNDEF;
|
|
1267
|
+
if (this.numConflicts > this.maxConflicts) {
|
|
1268
|
+
this.lastSearchFailure = FAILURE_NUM_CONFLICTS;
|
|
1269
|
+
return L_UNDEF;
|
|
1270
|
+
}
|
|
994
1271
|
}
|
|
995
1272
|
if (this.numConflictsSinceLemmaGc > LEMMA_GC_INITIAL) this.delInactiveLemmas();
|
|
996
1273
|
this.dynAck.propagateEh();
|
|
@@ -1023,6 +1300,9 @@ export class Context extends Internalizer {
|
|
|
1023
1300
|
}
|
|
1024
1301
|
|
|
1025
1302
|
private mkProtoModel() {
|
|
1303
|
+
const failure = this.lastSearchFailure;
|
|
1304
|
+
if (this.hasCaseSplits() || failure === FAILURE_CANCELED || failure === FAILURE_NUM_CONFLICTS)
|
|
1305
|
+
return undefined;
|
|
1026
1306
|
if (this.modelState.kind !== "none") this.modelState.generated.model.decRef();
|
|
1027
1307
|
const generated = mkModel(this);
|
|
1028
1308
|
generated.model.incRef();
|
|
@@ -1035,18 +1315,56 @@ export class Context extends Internalizer {
|
|
|
1035
1315
|
return generated;
|
|
1036
1316
|
}
|
|
1037
1317
|
|
|
1318
|
+
getLastFailureMessage() {
|
|
1319
|
+
if (this.lastSearchFailure === FAILURE_CANCELED) return "canceled";
|
|
1320
|
+
if (this.lastSearchFailure === FAILURE_NUM_CONFLICTS) return "max-conflicts-reached";
|
|
1321
|
+
if (this.lastSearchFailure === FAILURE_QUANTIFIERS) return "(incomplete quantifiers)";
|
|
1322
|
+
if (this.lastSearchFailure === FAILURE_THEORY)
|
|
1323
|
+
return `(incomplete (theory${this.incompleteTheories.map((theory) => ` ${theory.name}`).join("")}))`;
|
|
1324
|
+
return this.reasonUnknown;
|
|
1325
|
+
}
|
|
1326
|
+
|
|
1327
|
+
private hasCaseSplits() {
|
|
1328
|
+
if (!this.hasCaseSplit) return false;
|
|
1329
|
+
for (let index = this.numBoolVars; index-- > 0;)
|
|
1330
|
+
if (
|
|
1331
|
+
this.isRelevant(this.boolVar2Expr[index]) &&
|
|
1332
|
+
this.assignment[mkLiteral(toBoolVar(index))] === L_UNDEF
|
|
1333
|
+
)
|
|
1334
|
+
return true;
|
|
1335
|
+
return false;
|
|
1336
|
+
}
|
|
1337
|
+
|
|
1338
|
+
isQuantifierIncomplete() {
|
|
1339
|
+
return this.lastSearchFailure === FAILURE_QUANTIFIERS;
|
|
1340
|
+
}
|
|
1341
|
+
|
|
1342
|
+
// Z3's update_model always answers false, after it recomputes a final state for the next model.
|
|
1343
|
+
updateModel() {
|
|
1344
|
+
if (!this.hasCaseSplits() && this.finalCheck() === FC_DONE) this.resetModel();
|
|
1345
|
+
}
|
|
1346
|
+
|
|
1038
1347
|
getModel() {
|
|
1348
|
+
if (this.isInconsistent()) return undefined;
|
|
1039
1349
|
if (this.modelState.kind === "final") return this.modelState.model;
|
|
1350
|
+
if (!this.manager.limit.inc()) return undefined;
|
|
1040
1351
|
const generated =
|
|
1041
1352
|
this.modelState.kind === "proto" ? this.modelState.generated : this.mkProtoModel();
|
|
1353
|
+
if (generated === undefined) return undefined;
|
|
1042
1354
|
const model = generated.model.mkModel();
|
|
1043
|
-
|
|
1044
|
-
if (!model.constInterps.has(entry[0])) model.registerConst(entry[0], entry[1]);
|
|
1355
|
+
model.addRecFuns();
|
|
1045
1356
|
model.incRef();
|
|
1046
1357
|
this.modelState = { kind: "final", generated, model };
|
|
1047
1358
|
return model;
|
|
1048
1359
|
}
|
|
1049
1360
|
|
|
1361
|
+
getSatModel() {
|
|
1362
|
+
const model = this.getModel();
|
|
1363
|
+
if (model !== undefined) return model;
|
|
1364
|
+
if (this.manager.limit.isExhausted()) throw new SmtCanceledError();
|
|
1365
|
+
throw new SmtInvariantError("a sat answer without a model");
|
|
1366
|
+
}
|
|
1367
|
+
|
|
1050
1368
|
validateModel(model: ProtoModel) {
|
|
1051
1369
|
const manager = this.manager;
|
|
1052
1370
|
for (const literal of this.assignedLiterals) {
|
|
@@ -1071,41 +1389,43 @@ export class Context extends Internalizer {
|
|
|
1071
1389
|
this.lastSearchFailure !== FAILURE_THEORY ||
|
|
1072
1390
|
status === L_FALSE ||
|
|
1073
1391
|
this.isInconsistent() ||
|
|
1074
|
-
|
|
1392
|
+
qmanager.quantifiers.length === 0 ||
|
|
1075
1393
|
!qmanager.isModelBased()
|
|
1076
1394
|
)
|
|
1077
1395
|
return status;
|
|
1078
1396
|
const generated = this.mkProtoModel();
|
|
1079
|
-
if (
|
|
1397
|
+
if (
|
|
1398
|
+
generated === undefined ||
|
|
1399
|
+
qmanager.checkModel(generated.model, generated.root2value) !== CHECK_MODEL_RESTART
|
|
1400
|
+
)
|
|
1080
1401
|
return status;
|
|
1081
1402
|
this.lastSearchFailure = FAILURE_OK;
|
|
1082
1403
|
status = L_UNDEF;
|
|
1083
1404
|
isForcedRestart = true;
|
|
1084
1405
|
}
|
|
1085
1406
|
if (status === L_FALSE) return L_FALSE;
|
|
1086
|
-
if (status === L_TRUE &&
|
|
1407
|
+
if (status === L_TRUE && qmanager.quantifiers.length === 0) return L_TRUE;
|
|
1087
1408
|
if (status === L_TRUE) {
|
|
1088
1409
|
const generated = this.mkProtoModel();
|
|
1089
|
-
const result =
|
|
1090
|
-
|
|
1091
|
-
|
|
1410
|
+
const result =
|
|
1411
|
+
generated !== undefined && qmanager.isModelBased()
|
|
1412
|
+
? qmanager.checkModel(generated.model, generated.root2value)
|
|
1413
|
+
: CHECK_MODEL_UNKNOWN;
|
|
1092
1414
|
if (result === CHECK_MODEL_SAT) return L_TRUE;
|
|
1093
1415
|
if (result === CHECK_MODEL_UNKNOWN) {
|
|
1094
1416
|
this.lastSearchFailure = FAILURE_QUANTIFIERS;
|
|
1095
1417
|
return L_UNDEF;
|
|
1096
1418
|
}
|
|
1097
1419
|
}
|
|
1098
|
-
|
|
1099
|
-
|
|
1100
|
-
|
|
1101
|
-
|
|
1102
|
-
|
|
1103
|
-
|
|
1104
|
-
|
|
1105
|
-
this.numConflictsSinceRestart = 0;
|
|
1106
|
-
if (isForcedRestart || status === L_TRUE || this.agility < RESTART_AGILITY_THRESHOLD) {
|
|
1420
|
+
this.incLimits();
|
|
1421
|
+
if (
|
|
1422
|
+
isForcedRestart ||
|
|
1423
|
+
status === L_TRUE ||
|
|
1424
|
+
!this.config.isRestartAdaptive ||
|
|
1425
|
+
this.agility < RESTART_AGILITY_THRESHOLD
|
|
1426
|
+
) {
|
|
1107
1427
|
if (this.scopeLevel > currentLevel) this.popScope(this.scopeLevel - currentLevel);
|
|
1108
|
-
if (!this.isInconsistent())
|
|
1428
|
+
for (const theory of this.theories) if (!this.isInconsistent()) theory.restartEh();
|
|
1109
1429
|
if (!this.isInconsistent()) qmanager.restartEh();
|
|
1110
1430
|
if (this.isInconsistent()) {
|
|
1111
1431
|
this.resolveConflict();
|
|
@@ -1115,6 +1435,28 @@ export class Context extends Internalizer {
|
|
|
1115
1435
|
return undefined;
|
|
1116
1436
|
}
|
|
1117
1437
|
|
|
1438
|
+
incLimits() {
|
|
1439
|
+
const config = this.config;
|
|
1440
|
+
if (this.numConflictsSinceRestart >= this.restartThreshold) {
|
|
1441
|
+
if (config.restartStrategy === RS_LUBY) {
|
|
1442
|
+
this.lubyIndex++;
|
|
1443
|
+
this.restartThreshold = getLuby(this.lubyIndex) * RESTART_INITIAL;
|
|
1444
|
+
} else {
|
|
1445
|
+
this.restartThreshold = Math.trunc(this.restartThreshold * config.restartFactor);
|
|
1446
|
+
if (
|
|
1447
|
+
config.restartStrategy !== RS_GEOMETRIC &&
|
|
1448
|
+
this.restartThreshold > this.restartOuterThreshold
|
|
1449
|
+
) {
|
|
1450
|
+
this.restartThreshold = RESTART_INITIAL;
|
|
1451
|
+
this.restartOuterThreshold = Math.trunc(
|
|
1452
|
+
this.restartOuterThreshold * config.restartFactor,
|
|
1453
|
+
);
|
|
1454
|
+
}
|
|
1455
|
+
}
|
|
1456
|
+
}
|
|
1457
|
+
this.numConflictsSinceRestart = 0;
|
|
1458
|
+
}
|
|
1459
|
+
|
|
1118
1460
|
private isDeletable(clause: Clause) {
|
|
1119
1461
|
const store = this.clauses;
|
|
1120
1462
|
if (store.isReinit(clause)) return false;
|
|
@@ -1164,6 +1506,7 @@ export class Context extends Internalizer {
|
|
|
1164
1506
|
this.popToBaseLevel();
|
|
1165
1507
|
this.pushScope();
|
|
1166
1508
|
this.baseScopeLemmaLimits.push(this.lemmas.length);
|
|
1509
|
+
this.isBaseScopeInconsistent.push(this.isInconsistent());
|
|
1167
1510
|
this.baseLevel++;
|
|
1168
1511
|
this.searchLevel++;
|
|
1169
1512
|
}
|
|
@@ -1177,46 +1520,173 @@ export class Context extends Internalizer {
|
|
|
1177
1520
|
if (this.scopeLevel > this.baseLevel) this.popScope(this.scopeLevel - this.baseLevel);
|
|
1178
1521
|
}
|
|
1179
1522
|
|
|
1523
|
+
popToSearchLevel() {
|
|
1524
|
+
if (this.scopeLevel > this.searchLevel) this.popScope(this.scopeLevel - this.searchLevel);
|
|
1525
|
+
}
|
|
1526
|
+
|
|
1527
|
+
hasSearchFailure() {
|
|
1528
|
+
return this.lastSearchFailure !== FAILURE_OK;
|
|
1529
|
+
}
|
|
1530
|
+
|
|
1531
|
+
resetConflict() {
|
|
1532
|
+
this.conflict = null;
|
|
1533
|
+
}
|
|
1534
|
+
|
|
1535
|
+
getNumAssertedFormulas() {
|
|
1536
|
+
return this.asserted?.getNumFormulas() ?? 0;
|
|
1537
|
+
}
|
|
1538
|
+
|
|
1180
1539
|
internalizeAssertions(asserted: AssertedFormulas) {
|
|
1181
|
-
|
|
1540
|
+
this.asserted = asserted;
|
|
1541
|
+
this.macros = asserted.macros;
|
|
1542
|
+
this.hasQuantifiers = asserted.hasQuantifiers;
|
|
1543
|
+
if (this.checkCanceled()) return;
|
|
1544
|
+
asserted.reduce();
|
|
1545
|
+
if (this.checkCanceled()) return;
|
|
1182
1546
|
if (asserted.isInconsistent) {
|
|
1183
1547
|
this.setConflict("axiom", null);
|
|
1184
1548
|
return;
|
|
1185
1549
|
}
|
|
1186
|
-
|
|
1187
|
-
|
|
1188
|
-
|
|
1550
|
+
const formulas = asserted.getFormulas();
|
|
1551
|
+
const size = asserted.getNumFormulas();
|
|
1552
|
+
for (let qhead = asserted.getQhead(); qhead < size && !this.isInconsistent(); qhead++) {
|
|
1553
|
+
if (this.checkCanceled()) {
|
|
1554
|
+
asserted.commit(qhead);
|
|
1555
|
+
return;
|
|
1556
|
+
}
|
|
1557
|
+
this.internalizeAssertion(formulas[qhead], 0);
|
|
1189
1558
|
}
|
|
1559
|
+
asserted.commit();
|
|
1190
1560
|
}
|
|
1191
1561
|
|
|
1192
|
-
initAssumptions(assumptions: number[]) {
|
|
1562
|
+
initAssumptions(assumptions: number[], asserted: AssertedFormulas) {
|
|
1563
|
+
this.literalAssumptions.clear();
|
|
1564
|
+
for (const assumption of this.unsatCore) this.manager.decRef(assumption);
|
|
1565
|
+
this.unsatCore = [];
|
|
1193
1566
|
if (assumptions.length > 0) {
|
|
1194
1567
|
this.propagate();
|
|
1195
|
-
if (this.isInconsistent()) return;
|
|
1568
|
+
if (this.isInconsistent() || this.checkCanceled()) return;
|
|
1196
1569
|
this.delInactiveLemmas();
|
|
1197
1570
|
this.pushScope();
|
|
1198
|
-
|
|
1571
|
+
const manager = this.manager;
|
|
1572
|
+
const proxies = assumptions.map((assumption) => {
|
|
1573
|
+
if (isValidAssumption(manager, assumption)) return assumption;
|
|
1574
|
+
const proxy = manager.mkFreshConst(null, SORT_BOOL);
|
|
1575
|
+
asserted.assertExpr(manager.mkApp(OP_IMPLIES, [proxy, assumption], SORT_BOOL));
|
|
1576
|
+
return proxy;
|
|
1577
|
+
});
|
|
1578
|
+
this.internalizeAssertions(asserted);
|
|
1579
|
+
for (const [index, proxy] of proxies.entries()) {
|
|
1199
1580
|
if (this.isInconsistent()) break;
|
|
1200
|
-
|
|
1581
|
+
if (proxy === manager.trueExpr) continue;
|
|
1582
|
+
this.internalizeAssertion(proxy, 0);
|
|
1583
|
+
const literal = this.getLiteral(proxy);
|
|
1584
|
+
if (literal === this.trueLiteral || literal === this.falseLiteral) continue;
|
|
1585
|
+
this.literalAssumptions.set(literal, assumptions[index]);
|
|
1201
1586
|
}
|
|
1202
1587
|
}
|
|
1203
1588
|
this.searchLevel = this.scopeLevel;
|
|
1204
1589
|
}
|
|
1205
1590
|
|
|
1591
|
+
addTheoryAssumptions(assumptions: number[]) {
|
|
1592
|
+
for (const theory of this.theories) theory.addTheoryAssumptions(assumptions);
|
|
1593
|
+
}
|
|
1594
|
+
|
|
1595
|
+
checkResearching(asserted: AssertedFormulas, assumptions: readonly number[]) {
|
|
1596
|
+
let result: number;
|
|
1597
|
+
for (;;) {
|
|
1598
|
+
this.popToBaseLevel();
|
|
1599
|
+
this.internalizeAssertions(asserted);
|
|
1600
|
+
const all = [...assumptions];
|
|
1601
|
+
this.addTheoryAssumptions(all);
|
|
1602
|
+
this.initAssumptions(all, asserted);
|
|
1603
|
+
result = this.mkUnsatCore(this.search());
|
|
1604
|
+
if (result !== L_FALSE || this.unsatCore.length === 0) return result;
|
|
1605
|
+
if (!this.theories.some((theory) => theory.shouldResearch(this.unsatCore))) return result;
|
|
1606
|
+
}
|
|
1607
|
+
}
|
|
1608
|
+
|
|
1609
|
+
findMutexes(vars: readonly number[]) {
|
|
1610
|
+
const manager = this.manager;
|
|
1611
|
+
const cliques = new MaxCliques((index) => index ^ 1);
|
|
1612
|
+
const literals: number[] = [];
|
|
1613
|
+
for (const variable of vars) {
|
|
1614
|
+
const isNot = manager.getOp(variable) === OP_NOT;
|
|
1615
|
+
const atom = isNot ? manager.getArg(variable, 0) : variable;
|
|
1616
|
+
const boolVar = this.findBoolVar(atom);
|
|
1617
|
+
if (boolVar !== undefined) literals.push(mkLiteral(boolVar, isNot));
|
|
1618
|
+
}
|
|
1619
|
+
for (let index = 0; index < this.binaryWatches.length; index++)
|
|
1620
|
+
for (const other of this.binaryWatches[index] ?? []) {
|
|
1621
|
+
const source = index ^ 1;
|
|
1622
|
+
if (source < other) cliques.addEdge(source, other);
|
|
1623
|
+
}
|
|
1624
|
+
return cliques.cliques2(literals).map((mutex) =>
|
|
1625
|
+
mutex.map((index) => {
|
|
1626
|
+
const literal = index as Literal;
|
|
1627
|
+
if (literal === this.trueLiteral) return manager.trueExpr;
|
|
1628
|
+
if (literal === this.falseLiteral) return manager.falseExpr;
|
|
1629
|
+
const atom = this.boolVar2Expr[getVar(literal)];
|
|
1630
|
+
return isNegated(literal) ? manager.mkApp(OP_NOT, [atom], SORT_BOOL) : atom;
|
|
1631
|
+
}),
|
|
1632
|
+
);
|
|
1633
|
+
}
|
|
1634
|
+
|
|
1635
|
+
isAssumption(boolVar: BoolVar) {
|
|
1636
|
+
return (
|
|
1637
|
+
this.literalAssumptions.has(mkLiteral(boolVar)) ||
|
|
1638
|
+
this.literalAssumptions.has(mkLiteral(boolVar, true))
|
|
1639
|
+
);
|
|
1640
|
+
}
|
|
1641
|
+
|
|
1642
|
+
isTrackingAssumptions() {
|
|
1643
|
+
return this.literalAssumptions.size > 0 && this.searchLevel > this.baseLevel;
|
|
1644
|
+
}
|
|
1645
|
+
|
|
1646
|
+
mkUnsatCore(result: number) {
|
|
1647
|
+
if (result !== L_FALSE || !this.isTrackingAssumptions()) return result;
|
|
1648
|
+
const literalAssumptions = this.literalAssumptions;
|
|
1649
|
+
const found = new Set<Literal>();
|
|
1650
|
+
const core: number[] = [];
|
|
1651
|
+
for (const literal of this.conflictResolution.unsatCore) {
|
|
1652
|
+
const assumed = literalAssumptions.has(literal) ? literal : negate(literal);
|
|
1653
|
+
const assumption = literalAssumptions.get(assumed);
|
|
1654
|
+
if (assumption === undefined || found.has(assumed)) continue;
|
|
1655
|
+
found.add(assumed);
|
|
1656
|
+
this.manager.incRef(assumption);
|
|
1657
|
+
core.push(assumption);
|
|
1658
|
+
}
|
|
1659
|
+
literalAssumptions.clear();
|
|
1660
|
+
this.popToBaseLevel();
|
|
1661
|
+
this.searchLevel = this.baseLevel;
|
|
1662
|
+
const ids = this.manager.ids;
|
|
1663
|
+
this.unsatCore = core.sort((left, right) => ids[left] - ids[right]);
|
|
1664
|
+
return L_FALSE;
|
|
1665
|
+
}
|
|
1666
|
+
|
|
1206
1667
|
search() {
|
|
1207
|
-
if (this.isInconsistent())
|
|
1668
|
+
if (this.asserted?.isInconsistent && !this.isInconsistent()) this.setConflict("axiom", null);
|
|
1669
|
+
if (this.isInconsistent()) {
|
|
1670
|
+
this.resolveConflict();
|
|
1671
|
+
return L_FALSE;
|
|
1672
|
+
}
|
|
1673
|
+
if (this.checkCanceled()) return L_UNDEF;
|
|
1208
1674
|
this.resetModel();
|
|
1209
|
-
this.theory.initSearchEh();
|
|
1675
|
+
for (const theory of this.theories) theory.initSearchEh();
|
|
1210
1676
|
this.qmanager.initSearchEh();
|
|
1211
1677
|
this.dynAck.initSearchEh();
|
|
1678
|
+
this.incompleteTheories = [];
|
|
1212
1679
|
this.numConflicts = 0;
|
|
1213
1680
|
this.numConflictsSinceRestart = 0;
|
|
1214
1681
|
this.numConflictsSinceLemmaGc = 0;
|
|
1215
1682
|
this.restartThreshold = RESTART_INITIAL;
|
|
1216
1683
|
this.restartOuterThreshold = RESTART_INITIAL;
|
|
1217
1684
|
this.agility = 0;
|
|
1685
|
+
this.lubyIndex = 1;
|
|
1218
1686
|
this.finalCheckIndex = 0;
|
|
1219
1687
|
this.lastSearchFailure = FAILURE_OK;
|
|
1688
|
+
this.phaseDefault = false;
|
|
1689
|
+
if (this.manager.hasTypeVars) this.registerFamily(FAMILY_POLY);
|
|
1220
1690
|
this.isSearching = true;
|
|
1221
1691
|
const currentLevel = this.scopeLevel;
|
|
1222
1692
|
let result: number | undefined;
|