tla-ts 0.0.9 → 0.0.10-dev.06b481ee0
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 +30 -1
- package/dist/compile.cjs +23 -0
- package/dist/compile.js +23 -0
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +48 -44
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +122 -12
- package/dist/index.d.ts +122 -12
- 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 +2746 -410
- package/dist/prove.js +2745 -409
- package/dist/run.cjs +144 -31
- package/dist/run.js +144 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +134 -104
- package/dist/transfer.js +134 -104
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +3 -1
- package/src/ast.ts +56 -60
- package/src/bags.ts +128 -110
- package/src/builtins.ts +31 -77
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +320 -0
- package/src/check.ts +1156 -888
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +100 -0
- package/src/cli/shared.ts +19 -12
- package/src/cli/tlapm.ts +433 -82
- package/src/cli/tlc-arguments.ts +652 -0
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +330 -659
- package/src/cli/typescript.ts +23 -0
- package/src/cli/xml-exporter.ts +27 -49
- package/src/cli.ts +0 -1
- package/src/codegen.ts +217 -82
- package/src/config.ts +140 -109
- package/src/coverage.ts +1019 -0
- package/src/dependencies.ts +101 -66
- package/src/dfid.ts +683 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +263 -370
- package/src/errors.ts +107 -57
- package/src/evaluate.ts +898 -369
- package/src/exit-codes.ts +63 -13
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +137 -22
- package/src/java-hash.ts +21 -0
- package/src/java-overrides.ts +6 -21
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +231 -154
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +743 -322
- package/src/liveness.ts +230 -133
- package/src/obligations/action.ts +17 -44
- package/src/obligations/anonymize.ts +120 -95
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +37 -26
- package/src/obligations/format.ts +0 -10
- package/src/obligations/generate.ts +66 -64
- package/src/obligations/index.ts +39 -20
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +31 -41
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +94 -63
- package/src/obligations/proof.ts +3 -6
- package/src/obligations/regroup.ts +0 -5
- package/src/obligations/simplify.ts +57 -63
- package/src/obligations/source.ts +121 -95
- package/src/obligations/subexpression.ts +49 -28
- package/src/obligations/substitution.ts +1 -5
- package/src/obligations/temporal.ts +12 -20
- package/src/obligations/tuples.ts +2 -10
- package/src/parallel-worker.ts +36 -60
- package/src/parallel.ts +64 -73
- package/src/parser.ts +1184 -531
- package/src/pcal/ast.ts +53 -86
- package/src/pcal/parse.ts +144 -219
- package/src/pcal/tokenize.ts +91 -131
- package/src/pcal/translate.ts +83 -130
- package/src/pcal/validate.ts +48 -68
- package/src/pretty-print.ts +7 -8
- package/src/prover/decide-pool.ts +8 -13
- package/src/prover/deciders.ts +12 -13
- package/src/prover/first-order.ts +0 -11
- package/src/prover/isabelle/decide.ts +3 -31
- package/src/prover/isabelle/encode.ts +82 -64
- 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 +262 -117
- package/src/prover/isabelle/isar/method.ts +510 -226
- package/src/prover/isabelle/isar/proof.ts +570 -23
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +488 -88
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +99 -38
- package/src/prover/isabelle/provers/blast/blast.ts +16 -105
- package/src/prover/isabelle/provers/blast/branch.ts +0 -33
- package/src/prover/isabelle/provers/blast/prove.ts +0 -36
- package/src/prover/isabelle/provers/blast/rules.ts +5 -45
- package/src/prover/isabelle/provers/blast/state.ts +1 -29
- package/src/prover/isabelle/provers/blast/term.ts +8 -37
- package/src/prover/isabelle/provers/clasimp.ts +1 -15
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +29 -54
- package/src/prover/isabelle/pure/bicompose.ts +24 -39
- package/src/prover/isabelle/pure/consts.ts +0 -8
- package/src/prover/isabelle/pure/conv.ts +2 -18
- package/src/prover/isabelle/pure/drule.ts +95 -45
- package/src/prover/isabelle/pure/envir.ts +2 -53
- package/src/prover/isabelle/pure/goal.ts +1 -9
- package/src/prover/isabelle/pure/interrupt.ts +0 -5
- package/src/prover/isabelle/pure/list.ts +0 -3
- package/src/prover/isabelle/pure/logic.ts +1 -16
- package/src/prover/isabelle/pure/name.ts +1 -10
- package/src/prover/isabelle/pure/net.ts +2 -60
- package/src/prover/isabelle/pure/object-logic.ts +15 -16
- package/src/prover/isabelle/pure/pattern.ts +1 -20
- package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
- package/src/prover/isabelle/pure/rewriter.ts +34 -77
- package/src/prover/isabelle/pure/search.ts +2 -11
- package/src/prover/isabelle/pure/seq.ts +0 -11
- package/src/prover/isabelle/pure/simplifier.ts +27 -16
- package/src/prover/isabelle/pure/table.ts +2 -33
- package/src/prover/isabelle/pure/tactic.ts +11 -23
- package/src/prover/isabelle/pure/tactical.ts +47 -48
- package/src/prover/isabelle/pure/term-ord.ts +1 -7
- package/src/prover/isabelle/pure/term.ts +4 -47
- package/src/prover/isabelle/pure/thm.ts +26 -48
- package/src/prover/isabelle/pure/type.ts +1 -16
- package/src/prover/isabelle/pure/unify.ts +19 -31
- package/src/prover/isabelle/pure/variable.ts +2 -8
- package/src/prover/isabelle/tla/classical-setup.ts +17 -25
- package/src/prover/isabelle/tla/context.ts +65 -26
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +53 -32
- package/src/prover/isabelle/tla/simpdata.ts +45 -44
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
- package/src/prover/ocaml.ts +4 -7
- package/src/prover/prep/action.ts +33 -66
- package/src/prover/prep/enabled-axioms.ts +22 -20
- package/src/prover/prep/fingerprint.ts +2 -21
- package/src/prover/prep/level-comparison.ts +8 -12
- package/src/prover/prep/md5.ts +26 -31
- package/src/prover/prep/methods.ts +189 -86
- package/src/prover/prep/normalize.ts +42 -37
- package/src/prover/prove-worker.ts +0 -2
- package/src/prover/prove.ts +398 -133
- package/src/prover/ptl/decide.ts +96 -56
- package/src/prover/ptl/encode.ts +15 -38
- package/src/prover/ptl/sat.ts +24 -32
- package/src/prover/ptl/tableau.ts +40 -28
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -15
- package/src/prover/smt/context.ts +60 -32
- package/src/prover/smt/data.ts +517 -401
- package/src/prover/smt/encode.ts +155 -85
- package/src/prover/smt/extensionality.ts +5 -13
- package/src/prover/smt/flatten.ts +7 -28
- package/src/prover/smt/format.ts +33 -14
- package/src/prover/smt/instances.ts +7 -11
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +1021 -658
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -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 -16
- 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 +626 -56
- 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/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +241 -99
- package/src/prover/smt/solver/ast-lt.ts +165 -21
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1480 -184
- package/src/prover/smt/solver/auf-solver.ts +30 -56
- 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 -10
- package/src/prover/smt/solver/cg-table.ts +39 -42
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -27
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +600 -187
- package/src/prover/smt/solver/ctx-simplify.ts +34 -52
- 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 +39 -30
- package/src/prover/smt/solver/diff-neq.ts +205 -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 +296 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -11
- package/src/prover/smt/solver/e-matching.ts +9 -41
- 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 +542 -0
- package/src/prover/smt/solver/enode.ts +100 -23
- package/src/prover/smt/solver/eq2bv-tactic.ts +218 -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 -5
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
- 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 -26
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -9
- package/src/prover/smt/solver/fm-tactic.ts +884 -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 +179 -28
- 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 -9
- package/src/prover/smt/solver/hashtable.ts +30 -23
- 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 +113 -133
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -2
- 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 -4
- package/src/prover/smt/solver/logic-tactics.ts +355 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
- package/src/prover/smt/solver/lp/constraints.ts +1 -8
- package/src/prover/smt/solver/lp/containers.ts +18 -31
- package/src/prover/smt/solver/lp/core-solver.ts +35 -37
- package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
- package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
- package/src/prover/smt/solver/lp/dependency.ts +0 -5
- package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
- package/src/prover/smt/solver/lp/explanation.ts +0 -6
- package/src/prover/smt/solver/lp/gomory.ts +8 -22
- package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
- package/src/prover/smt/solver/lp/hnf.ts +10 -28
- package/src/prover/smt/solver/lp/int-cube.ts +17 -39
- package/src/prover/smt/solver/lp/int-solver.ts +3 -35
- package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
- package/src/prover/smt/solver/lp/nex.ts +2 -7
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
- package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
- package/src/prover/smt/solver/lp/nla-core.ts +92 -136
- package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
- package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
- package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
- package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
- package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
- package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
- package/src/prover/smt/solver/lp/nla-order.ts +0 -13
- package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -12
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
- package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
- package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
- package/src/prover/smt/solver/lp/pdd.ts +730 -358
- package/src/prover/smt/solver/lp/random-updater.ts +0 -9
- package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
- package/src/prover/smt/solver/lp/union-find.ts +5 -5
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +129 -139
- package/src/prover/smt/solver/mam-interpreter.ts +0 -21
- 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 -21
- 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 +20 -63
- package/src/prover/smt/solver/model-evaluator.ts +192 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +104 -46
- package/src/prover/smt/solver/model-macro-solver.ts +60 -114
- 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 +484 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
- package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +429 -275
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
- package/src/prover/smt/solver/nlsat/solver.ts +297 -156
- 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 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
- package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +112 -61
- 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 +21 -26
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +261 -79
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -30
- package/src/prover/smt/solver/proto-model.ts +650 -66
- package/src/prover/smt/solver/pull-quant.ts +28 -23
- package/src/prover/smt/solver/purify-arith.ts +632 -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 -31
- package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
- package/src/prover/smt/solver/qe-lite.ts +41 -51
- 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 -16
- 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 +17 -74
- package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
- package/src/prover/smt/solver/quantifier-manager.ts +22 -32
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -2
- package/src/prover/smt/solver/rational.ts +45 -8
- 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 -6
- package/src/prover/smt/solver/relevancy.ts +2 -16
- package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
- package/src/prover/smt/solver/rewriter.ts +507 -144
- package/src/prover/smt/solver/rlimit.ts +46 -24
- 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 +579 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -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 +53 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +189 -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 +3546 -406
- package/src/prover/smt/solver/smtlib-script.ts +2134 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +135 -40
- package/src/prover/smt/solver/sort.ts +1 -5
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -6
- package/src/prover/smt/solver/tactic.ts +2141 -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 +55 -25
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
- package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
- package/src/prover/smt/solver/theory-lra-state.ts +7 -28
- package/src/prover/smt/solver/theory-lra.ts +189 -9
- 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 +486 -0
- package/src/prover/smt/solver/var-subst.ts +37 -39
- package/src/prover/smt/table.ts +3 -10
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +74 -48
- package/src/prover/tlapm/ocaml-marshal.ts +19 -21
- package/src/prover/tlapm/tlapm.ts +21 -20
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -2
- package/src/prover/zenon/check/check.ts +1 -11
- package/src/prover/zenon/check/definitions.ts +5 -15
- package/src/prover/zenon/check/equality.ts +0 -8
- package/src/prover/zenon/check/functions.ts +0 -4
- package/src/prover/zenon/check/keys.ts +0 -7
- package/src/prover/zenon/check/propositional.ts +0 -3
- package/src/prover/zenon/check/records.ts +1 -6
- package/src/prover/zenon/check/relations.ts +2 -14
- package/src/prover/zenon/check/rewrites.ts +2 -21
- package/src/prover/zenon/check/sets.ts +40 -61
- package/src/prover/zenon/check/terms.ts +1 -19
- package/src/prover/zenon/check/tla.ts +0 -6
- package/src/prover/zenon/decide.ts +10 -19
- package/src/prover/zenon/encode.ts +0 -9
- package/src/prover/zenon/eqrel.ts +2 -15
- package/src/prover/zenon/equality-rules.ts +24 -6
- package/src/prover/zenon/expr.ts +29 -28
- package/src/prover/zenon/index-table.ts +33 -61
- package/src/prover/zenon/isar-case.ts +9 -21
- package/src/prover/zenon/isar.ts +37 -67
- package/src/prover/zenon/limits.ts +0 -4
- package/src/prover/zenon/llproof.ts +2 -22
- package/src/prover/zenon/mltoll.ts +66 -106
- package/src/prover/zenon/node.ts +20 -15
- package/src/prover/zenon/ocaml.ts +1 -17
- package/src/prover/zenon/parse.ts +9 -13
- package/src/prover/zenon/phrase.ts +2 -14
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +3 -8
- package/src/prover/zenon/search.ts +11 -35
- package/src/prover/zenon/tla/functions.ts +59 -33
- package/src/prover/zenon/tla/llproof.ts +67 -78
- package/src/prover/zenon/tla/records.ts +57 -35
- package/src/prover/zenon/tla/rewrites.ts +12 -21
- package/src/prover/zenon/tla/sets.ts +88 -59
- package/src/prover/zenon/tla/terms.ts +0 -8
- package/src/prover/zenon/tla/tla.ts +66 -66
- package/src/randomization.ts +81 -35
- package/src/resolve.ts +1132 -430
- package/src/runtime.ts +33 -23
- package/src/sany/builtins.ts +11 -14
- package/src/sany/generation.ts +383 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1108 -0
- package/src/sany/generator-proofs.ts +665 -0
- package/src/sany/generator.ts +192 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +61 -80
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +5 -7
- package/src/sany/nodes.ts +6 -44
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +60 -82
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +37 -120
- package/src/search.ts +913 -227
- package/src/simulate.ts +765 -0
- package/src/spec-description.ts +198 -104
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +302 -99
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +578 -166
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +299 -108
- package/src/symmetry.ts +37 -28
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +122 -6
- package/src/tlc/messages.ts +127 -56
- package/src/tlc/order.ts +53 -72
- package/src/tlc/random.ts +38 -49
- package/src/tlc/replay.ts +579 -230
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +83 -47
- package/src/tlc/tlcext-operators.ts +205 -127
- package/src/tlc/trace-spec.ts +235 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/trace-liveness.ts +529 -0
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +479 -0
- package/src/typescript/collections.ts +614 -0
- package/src/typescript/compile.ts +63 -0
- package/src/typescript/context.ts +94 -0
- package/src/typescript/emit.ts +121 -0
- package/src/typescript/expressions.ts +496 -0
- package/src/typescript/formula.ts +154 -0
- package/src/typescript/functions.ts +284 -0
- package/src/typescript/model.ts +162 -0
- package/src/typescript/names.ts +114 -0
- package/src/typescript/program.ts +48 -0
- package/src/typescript/properties.ts +139 -0
- package/src/typescript/scope.ts +112 -0
- package/src/typescript/steps.ts +167 -0
- package/src/typescript/types.ts +171 -0
- package/src/values.ts +945 -526
- package/src/worker.ts +7 -8
- package/src/prover/isabelle/isar/statement.ts +0 -57
- 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
|
@@ -0,0 +1,117 @@
|
|
|
1
|
+
export class VarQueue {
|
|
2
|
+
private values: number[] = [-1];
|
|
3
|
+
private indices: number[] = [];
|
|
4
|
+
|
|
5
|
+
constructor(private activity: number[]) {}
|
|
6
|
+
|
|
7
|
+
private isLess(first: number, second: number) {
|
|
8
|
+
return this.activity[first] > this.activity[second];
|
|
9
|
+
}
|
|
10
|
+
|
|
11
|
+
private moveUp(start: number) {
|
|
12
|
+
let index = start;
|
|
13
|
+
const value = this.values[index];
|
|
14
|
+
for (;;) {
|
|
15
|
+
const parentIndex = index >> 1;
|
|
16
|
+
if (parentIndex === 0 || !this.isLess(value, this.values[parentIndex])) break;
|
|
17
|
+
this.values[index] = this.values[parentIndex];
|
|
18
|
+
this.indices[this.values[index]] = index;
|
|
19
|
+
index = parentIndex;
|
|
20
|
+
}
|
|
21
|
+
this.values[index] = value;
|
|
22
|
+
this.indices[value] = index;
|
|
23
|
+
}
|
|
24
|
+
|
|
25
|
+
private moveDown(start: number) {
|
|
26
|
+
let index = start;
|
|
27
|
+
const value = this.values[index];
|
|
28
|
+
const size = this.values.length;
|
|
29
|
+
for (;;) {
|
|
30
|
+
const left = 2 * index;
|
|
31
|
+
if (left >= size) break;
|
|
32
|
+
const right = left + 1;
|
|
33
|
+
const minIndex =
|
|
34
|
+
right < size && this.isLess(this.values[right], this.values[left]) ? right : left;
|
|
35
|
+
const minValue = this.values[minIndex];
|
|
36
|
+
if (!this.isLess(minValue, value)) break;
|
|
37
|
+
this.values[index] = minValue;
|
|
38
|
+
this.indices[minValue] = index;
|
|
39
|
+
index = minIndex;
|
|
40
|
+
}
|
|
41
|
+
this.values[index] = value;
|
|
42
|
+
this.indices[value] = index;
|
|
43
|
+
}
|
|
44
|
+
|
|
45
|
+
contains(value: number) {
|
|
46
|
+
return value < this.indices.length && this.indices[value] !== 0;
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
isEmpty() {
|
|
50
|
+
return this.values.length === 1;
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
private insert(value: number) {
|
|
54
|
+
const index = this.values.length;
|
|
55
|
+
this.indices[value] = index;
|
|
56
|
+
this.values.push(value);
|
|
57
|
+
this.moveUp(index);
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
private erase(value: number) {
|
|
61
|
+
const index = this.indices[value];
|
|
62
|
+
if (index === this.values.length - 1) {
|
|
63
|
+
this.indices[value] = 0;
|
|
64
|
+
this.values.pop();
|
|
65
|
+
return;
|
|
66
|
+
}
|
|
67
|
+
const last = this.values[this.values.length - 1];
|
|
68
|
+
this.values[index] = last;
|
|
69
|
+
this.indices[last] = index;
|
|
70
|
+
this.indices[value] = 0;
|
|
71
|
+
this.values.pop();
|
|
72
|
+
const parentIndex = index >> 1;
|
|
73
|
+
if (parentIndex !== 0 && this.isLess(last, this.values[parentIndex])) this.moveUp(index);
|
|
74
|
+
else this.moveDown(index);
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
activityIncreased(value: number) {
|
|
78
|
+
if (this.contains(value)) this.moveUp(this.indices[value]);
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
mkVar(value: number) {
|
|
82
|
+
while (this.indices.length <= value) this.indices.push(0);
|
|
83
|
+
this.unassignVar(value);
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
delVar(value: number) {
|
|
87
|
+
if (this.contains(value)) this.erase(value);
|
|
88
|
+
}
|
|
89
|
+
|
|
90
|
+
unassignVar(value: number) {
|
|
91
|
+
if (!this.contains(value)) this.insert(value);
|
|
92
|
+
}
|
|
93
|
+
|
|
94
|
+
nextVar() {
|
|
95
|
+
const result = this.values[1];
|
|
96
|
+
if (this.values.length === 2) {
|
|
97
|
+
this.indices[result] = 0;
|
|
98
|
+
this.values.pop();
|
|
99
|
+
return result;
|
|
100
|
+
}
|
|
101
|
+
const last = this.values[this.values.length - 1];
|
|
102
|
+
this.values[1] = last;
|
|
103
|
+
this.indices[last] = 1;
|
|
104
|
+
this.indices[result] = 0;
|
|
105
|
+
this.values.pop();
|
|
106
|
+
this.moveDown(1);
|
|
107
|
+
return result;
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
minVar() {
|
|
111
|
+
return this.values[1];
|
|
112
|
+
}
|
|
113
|
+
|
|
114
|
+
isMoreActive(first: number, second: number) {
|
|
115
|
+
return this.isLess(first, second);
|
|
116
|
+
}
|
|
117
|
+
}
|
|
@@ -0,0 +1,140 @@
|
|
|
1
|
+
export const WATCH_BINARY = 0;
|
|
2
|
+
export const WATCH_CLAUSE = 1;
|
|
3
|
+
export const WATCH_EXT_CONSTRAINT = 2;
|
|
4
|
+
|
|
5
|
+
export const mkBinaryWatch = (isLearned: boolean) => (isLearned ? 4 : 0);
|
|
6
|
+
|
|
7
|
+
export const mkClauseWatch = (blockedLit: number) => WATCH_CLAUSE + (blockedLit << 2);
|
|
8
|
+
|
|
9
|
+
export class WatchList {
|
|
10
|
+
data = new Int32Array(8);
|
|
11
|
+
size = 0;
|
|
12
|
+
|
|
13
|
+
push(val1: number, val2: number) {
|
|
14
|
+
if (2 * this.size + 2 > this.data.length) {
|
|
15
|
+
const data = new Int32Array(this.data.length * 2);
|
|
16
|
+
data.set(this.data);
|
|
17
|
+
this.data = data;
|
|
18
|
+
}
|
|
19
|
+
this.data[2 * this.size] = val1;
|
|
20
|
+
this.data[2 * this.size + 1] = val2;
|
|
21
|
+
this.size++;
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
pushBinary(lit: number, isLearned: boolean) {
|
|
25
|
+
this.push(lit, mkBinaryWatch(isLearned));
|
|
26
|
+
}
|
|
27
|
+
|
|
28
|
+
pushClause(blockedLit: number, clause: number) {
|
|
29
|
+
this.push(clause, mkClauseWatch(blockedLit));
|
|
30
|
+
}
|
|
31
|
+
|
|
32
|
+
val1(index: number) {
|
|
33
|
+
return this.data[2 * index];
|
|
34
|
+
}
|
|
35
|
+
|
|
36
|
+
val2(index: number) {
|
|
37
|
+
return this.data[2 * index + 1];
|
|
38
|
+
}
|
|
39
|
+
|
|
40
|
+
getKind(index: number) {
|
|
41
|
+
return this.data[2 * index + 1] & 3;
|
|
42
|
+
}
|
|
43
|
+
|
|
44
|
+
isBinary(index: number) {
|
|
45
|
+
return (this.data[2 * index + 1] & 3) === WATCH_BINARY;
|
|
46
|
+
}
|
|
47
|
+
|
|
48
|
+
isClause(index: number) {
|
|
49
|
+
return (this.data[2 * index + 1] & 3) === WATCH_CLAUSE;
|
|
50
|
+
}
|
|
51
|
+
|
|
52
|
+
getLiteral(index: number) {
|
|
53
|
+
return this.data[2 * index];
|
|
54
|
+
}
|
|
55
|
+
|
|
56
|
+
isLearned(index: number) {
|
|
57
|
+
return ((this.data[2 * index + 1] >> 2) & 1) === 1;
|
|
58
|
+
}
|
|
59
|
+
|
|
60
|
+
setLearned(index: number, isLearned: boolean) {
|
|
61
|
+
this.data[2 * index + 1] = isLearned
|
|
62
|
+
? this.data[2 * index + 1] | 4
|
|
63
|
+
: this.data[2 * index + 1] & ~4;
|
|
64
|
+
}
|
|
65
|
+
|
|
66
|
+
numNonlearnedBin() {
|
|
67
|
+
let count = 0;
|
|
68
|
+
for (let index = 0; index < this.size; index++)
|
|
69
|
+
if (this.isBinary(index) && !this.isLearned(index)) count++;
|
|
70
|
+
return count;
|
|
71
|
+
}
|
|
72
|
+
|
|
73
|
+
getClause(index: number) {
|
|
74
|
+
return this.data[2 * index];
|
|
75
|
+
}
|
|
76
|
+
|
|
77
|
+
getBlockedLiteral(index: number) {
|
|
78
|
+
return this.data[2 * index + 1] >> 2;
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
setClause(index: number, blockedLit: number, clause: number) {
|
|
82
|
+
this.data[2 * index] = clause;
|
|
83
|
+
this.data[2 * index + 1] = mkClauseWatch(blockedLit);
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
copy(target: number, source: number) {
|
|
87
|
+
this.data[2 * target] = this.data[2 * source];
|
|
88
|
+
this.data[2 * target + 1] = this.data[2 * source + 1];
|
|
89
|
+
}
|
|
90
|
+
|
|
91
|
+
setEnd(size: number) {
|
|
92
|
+
this.size = size;
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
reset() {
|
|
96
|
+
this.size = 0;
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
finalize() {
|
|
100
|
+
this.data = new Int32Array(8);
|
|
101
|
+
this.size = 0;
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
findBinary(lit: number) {
|
|
105
|
+
for (let index = 0; index < this.size; index++)
|
|
106
|
+
if (this.isBinary(index) && this.data[2 * index] === lit) return index;
|
|
107
|
+
return -1;
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
eraseAt(position: number) {
|
|
111
|
+
this.data.copyWithin(2 * position, 2 * position + 2, 2 * this.size);
|
|
112
|
+
this.size--;
|
|
113
|
+
}
|
|
114
|
+
|
|
115
|
+
erase(val1: number, val2: number) {
|
|
116
|
+
for (let index = 0; index < this.size; index++)
|
|
117
|
+
if (this.data[2 * index] === val1 && this.data[2 * index + 1] === val2) {
|
|
118
|
+
this.eraseAt(index);
|
|
119
|
+
return;
|
|
120
|
+
}
|
|
121
|
+
}
|
|
122
|
+
|
|
123
|
+
eraseClause(clause: number) {
|
|
124
|
+
for (let index = 0; index < this.size; index++)
|
|
125
|
+
if (this.isClause(index) && this.data[2 * index] === clause) {
|
|
126
|
+
this.eraseAt(index);
|
|
127
|
+
return true;
|
|
128
|
+
}
|
|
129
|
+
return false;
|
|
130
|
+
}
|
|
131
|
+
|
|
132
|
+
sortBinariesFirst() {
|
|
133
|
+
const binaries: number[] = [];
|
|
134
|
+
const others: number[] = [];
|
|
135
|
+
for (let index = 0; index < this.size; index++)
|
|
136
|
+
(this.isBinary(index) ? binaries : others).push(this.val1(index), this.val2(index));
|
|
137
|
+
this.data.set(binaries, 0);
|
|
138
|
+
this.data.set(others, binaries.length);
|
|
139
|
+
}
|
|
140
|
+
}
|
|
@@ -0,0 +1,284 @@
|
|
|
1
|
+
import { SmtInvariantError } from "../../../errors";
|
|
2
|
+
import type { AstManager } from "./ast";
|
|
3
|
+
import { RandomGen } from "./random-gen";
|
|
4
|
+
|
|
5
|
+
const STATUS_OPEN = 0;
|
|
6
|
+
const STATUS_CLOSED = 1;
|
|
7
|
+
const STATUS_ACTIVE = 2;
|
|
8
|
+
|
|
9
|
+
// A literal is an expression, and -1 stands for the root's null literal.
|
|
10
|
+
export class SearchNode {
|
|
11
|
+
left: SearchNode | undefined;
|
|
12
|
+
right: SearchNode | undefined;
|
|
13
|
+
status = STATUS_OPEN;
|
|
14
|
+
core: number[] = [];
|
|
15
|
+
numActivations = 0;
|
|
16
|
+
effortSpent = 0;
|
|
17
|
+
private roundMaxEffort = 0;
|
|
18
|
+
private activeWorkers = 0;
|
|
19
|
+
|
|
20
|
+
constructor(
|
|
21
|
+
readonly literal: number,
|
|
22
|
+
readonly parent: SearchNode | undefined,
|
|
23
|
+
) {}
|
|
24
|
+
|
|
25
|
+
get isLeaf() {
|
|
26
|
+
return this.left === undefined && this.right === undefined;
|
|
27
|
+
}
|
|
28
|
+
|
|
29
|
+
get depth() {
|
|
30
|
+
let depth = 0;
|
|
31
|
+
for (let node = this.parent; node !== undefined; node = node.parent) depth++;
|
|
32
|
+
return depth;
|
|
33
|
+
}
|
|
34
|
+
|
|
35
|
+
markNewActivation() {
|
|
36
|
+
this.status = STATUS_ACTIVE;
|
|
37
|
+
this.numActivations++;
|
|
38
|
+
this.activeWorkers++;
|
|
39
|
+
}
|
|
40
|
+
|
|
41
|
+
decActiveWorkers() {
|
|
42
|
+
if (this.activeWorkers > 0) this.activeWorkers--;
|
|
43
|
+
if (this.activeWorkers === 0 && this.status === STATUS_ACTIVE) {
|
|
44
|
+
this.roundMaxEffort = 0;
|
|
45
|
+
this.status = STATUS_OPEN;
|
|
46
|
+
}
|
|
47
|
+
}
|
|
48
|
+
|
|
49
|
+
updateRoundMaxEffort(effort: number) {
|
|
50
|
+
if (effort <= this.roundMaxEffort) return;
|
|
51
|
+
this.effortSpent += effort - this.roundMaxEffort;
|
|
52
|
+
this.roundMaxEffort = effort;
|
|
53
|
+
}
|
|
54
|
+
}
|
|
55
|
+
|
|
56
|
+
interface Candidate {
|
|
57
|
+
node: SearchNode | undefined;
|
|
58
|
+
scaledEffort: number;
|
|
59
|
+
depth: number;
|
|
60
|
+
}
|
|
61
|
+
|
|
62
|
+
const getAtom = (manager: AstManager, literal: number) =>
|
|
63
|
+
manager.isNot(literal) ? manager.getArg(literal, 0) : literal;
|
|
64
|
+
|
|
65
|
+
const isPathContainingAtom = (manager: AstManager, node: SearchNode, literal: number) => {
|
|
66
|
+
const atom = getAtom(manager, literal);
|
|
67
|
+
for (let current: SearchNode | undefined = node; current !== undefined; current = current.parent)
|
|
68
|
+
if (current.literal !== -1 && getAtom(manager, current.literal) === atom) return true;
|
|
69
|
+
return false;
|
|
70
|
+
};
|
|
71
|
+
|
|
72
|
+
const isBetter = (first: Candidate, second: Candidate) => {
|
|
73
|
+
if (first.node === undefined) return false;
|
|
74
|
+
if (second.node === undefined) return true;
|
|
75
|
+
if (first.scaledEffort !== second.scaledEffort) return first.scaledEffort < second.scaledEffort;
|
|
76
|
+
return first.depth > second.depth;
|
|
77
|
+
};
|
|
78
|
+
|
|
79
|
+
export const isAncestor = (ancestor: SearchNode, node: SearchNode | undefined) => {
|
|
80
|
+
for (let current = node; current !== undefined; current = current.parent)
|
|
81
|
+
if (current === ancestor) return true;
|
|
82
|
+
return false;
|
|
83
|
+
};
|
|
84
|
+
|
|
85
|
+
export const isPathContaining = (node: SearchNode, literal: number) => {
|
|
86
|
+
for (let current: SearchNode | undefined = node; current !== undefined; current = current.parent)
|
|
87
|
+
if (current.literal === literal) return true;
|
|
88
|
+
return false;
|
|
89
|
+
};
|
|
90
|
+
|
|
91
|
+
const getSiblingResolvent = (left: SearchNode, right: SearchNode) => {
|
|
92
|
+
const resolvent: number[] = [];
|
|
93
|
+
if (left.core.length === 0 || right.core.length === 0 || left.parent !== right.parent)
|
|
94
|
+
return resolvent;
|
|
95
|
+
for (const literal of left.core)
|
|
96
|
+
if (literal !== left.literal && !resolvent.includes(literal)) resolvent.push(literal);
|
|
97
|
+
for (const literal of right.core)
|
|
98
|
+
if (literal !== right.literal && !resolvent.includes(literal)) resolvent.push(literal);
|
|
99
|
+
return resolvent;
|
|
100
|
+
};
|
|
101
|
+
|
|
102
|
+
const close = (node: SearchNode | undefined, core: number[]) => {
|
|
103
|
+
if (node === undefined || node.status === STATUS_CLOSED) return;
|
|
104
|
+
node.status = STATUS_CLOSED;
|
|
105
|
+
node.core = core;
|
|
106
|
+
close(node.left, core);
|
|
107
|
+
close(node.right, core);
|
|
108
|
+
};
|
|
109
|
+
|
|
110
|
+
export class SearchTree {
|
|
111
|
+
root = new SearchNode(-1, undefined);
|
|
112
|
+
private random = new RandomGen(0);
|
|
113
|
+
private effortUnit = 1000;
|
|
114
|
+
|
|
115
|
+
constructor(private manager: AstManager) {}
|
|
116
|
+
|
|
117
|
+
setEffortUnit(effortUnit: number) {
|
|
118
|
+
this.effortUnit = Math.max(1, effortUnit);
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
private getScaledEffort(node: SearchNode) {
|
|
122
|
+
return Math.trunc(node.effortSpent / Math.max(1, this.effortUnit));
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
private selectNextNode(node: SearchNode | undefined, status: number, best: Candidate) {
|
|
126
|
+
if (node === undefined || node.status === STATUS_CLOSED) return;
|
|
127
|
+
if (node.status === status) {
|
|
128
|
+
const candidate = { node, scaledEffort: this.getScaledEffort(node), depth: node.depth };
|
|
129
|
+
if (isBetter(candidate, best)) Object.assign(best, candidate);
|
|
130
|
+
}
|
|
131
|
+
this.selectNextNode(node.left, status, best);
|
|
132
|
+
this.selectNextNode(node.right, status, best);
|
|
133
|
+
}
|
|
134
|
+
|
|
135
|
+
private hasUnvisitedOpenNode(node: SearchNode | undefined): boolean {
|
|
136
|
+
if (node === undefined || node.status === STATUS_CLOSED) return false;
|
|
137
|
+
if (node.status === STATUS_OPEN && node.numActivations === 0) return true;
|
|
138
|
+
return this.hasUnvisitedOpenNode(node.left) || this.hasUnvisitedOpenNode(node.right);
|
|
139
|
+
}
|
|
140
|
+
|
|
141
|
+
private countUnsolvedNodes(node: SearchNode | undefined): number {
|
|
142
|
+
if (node === undefined || node.status === STATUS_CLOSED) return 0;
|
|
143
|
+
return 1 + this.countUnsolvedNodes(node.left) + this.countUnsolvedNodes(node.right);
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
private countActiveNodes(node: SearchNode | undefined): number {
|
|
147
|
+
if (node === undefined || node.status === STATUS_CLOSED) return 0;
|
|
148
|
+
return (
|
|
149
|
+
(node.status === STATUS_ACTIVE ? 1 : 0) +
|
|
150
|
+
this.countActiveNodes(node.left) +
|
|
151
|
+
this.countActiveNodes(node.right)
|
|
152
|
+
);
|
|
153
|
+
}
|
|
154
|
+
|
|
155
|
+
private getShallowestTimedOutLeafDepth(node: SearchNode | undefined): number {
|
|
156
|
+
if (node === undefined || node.status === STATUS_CLOSED) return Infinity;
|
|
157
|
+
return Math.min(
|
|
158
|
+
node.isLeaf && node.effortSpent > 0 ? node.depth : Infinity,
|
|
159
|
+
this.getShallowestTimedOutLeafDepth(node.left),
|
|
160
|
+
this.getShallowestTimedOutLeafDepth(node.right),
|
|
161
|
+
);
|
|
162
|
+
}
|
|
163
|
+
|
|
164
|
+
// m_min_tree_size is 0, so the throttle always applies.
|
|
165
|
+
private shouldSplit(node: SearchNode) {
|
|
166
|
+
if (node.status !== STATUS_ACTIVE || !node.isLeaf) return false;
|
|
167
|
+
const numActiveNodes = this.countActiveNodes(this.root);
|
|
168
|
+
if (this.countUnsolvedNodes(this.root) >= numActiveNodes * 2) return false;
|
|
169
|
+
if (this.hasUnvisitedOpenNode(this.root)) return false;
|
|
170
|
+
if (this.random.next() % 2 !== 0) return false;
|
|
171
|
+
return node.depth === this.getShallowestTimedOutLeafDepth(this.root);
|
|
172
|
+
}
|
|
173
|
+
|
|
174
|
+
private findHighestAttach(node: SearchNode, resolvent: number[]) {
|
|
175
|
+
let attach = node;
|
|
176
|
+
for (let candidate: SearchNode | undefined = node; candidate !== undefined;) {
|
|
177
|
+
const current: SearchNode = candidate;
|
|
178
|
+
if (resolvent.every((literal) => isPathContaining(current, literal))) attach = current;
|
|
179
|
+
candidate = current.parent;
|
|
180
|
+
}
|
|
181
|
+
return attach;
|
|
182
|
+
}
|
|
183
|
+
|
|
184
|
+
private propagateClosureUpward(node: SearchNode) {
|
|
185
|
+
for (let current = node; ;) {
|
|
186
|
+
const parent = current.parent;
|
|
187
|
+
if (parent?.left === undefined || parent.right === undefined) return;
|
|
188
|
+
if (parent.left.status !== STATUS_CLOSED || parent.right.status !== STATUS_CLOSED) return;
|
|
189
|
+
if (parent.left.core.length === 0 || parent.right.core.length === 0) return;
|
|
190
|
+
const resolvent = getSiblingResolvent(parent.left, parent.right);
|
|
191
|
+
if (resolvent.length === 0) {
|
|
192
|
+
close(this.root, resolvent);
|
|
193
|
+
return;
|
|
194
|
+
}
|
|
195
|
+
close(parent, resolvent);
|
|
196
|
+
current = parent;
|
|
197
|
+
}
|
|
198
|
+
}
|
|
199
|
+
|
|
200
|
+
private closeWithCore(node: SearchNode, core: number[]) {
|
|
201
|
+
if (node.status === STATUS_CLOSED && node.core.every((literal) => core.includes(literal)))
|
|
202
|
+
return;
|
|
203
|
+
const parent = node.parent;
|
|
204
|
+
if (parent !== undefined && core.every((literal) => literal !== node.literal)) {
|
|
205
|
+
this.closeWithCore(parent, core);
|
|
206
|
+
return;
|
|
207
|
+
}
|
|
208
|
+
close(node, core);
|
|
209
|
+
if (parent?.left === undefined || parent.right === undefined) return;
|
|
210
|
+
if (parent.left.status !== STATUS_CLOSED || parent.right.status !== STATUS_CLOSED) return;
|
|
211
|
+
if (parent.left.core.length === 0 || parent.right.core.length === 0) return;
|
|
212
|
+
const resolvent = getSiblingResolvent(parent.left, parent.right);
|
|
213
|
+
if (resolvent.length === 0) {
|
|
214
|
+
close(this.root, resolvent);
|
|
215
|
+
return;
|
|
216
|
+
}
|
|
217
|
+
const attach = this.findHighestAttach(parent, resolvent);
|
|
218
|
+
close(attach, resolvent);
|
|
219
|
+
this.propagateClosureUpward(attach);
|
|
220
|
+
}
|
|
221
|
+
|
|
222
|
+
trySplit(node: SearchNode, literal: number, negation: number, effort: number) {
|
|
223
|
+
if (this.isLeaseCanceled(node)) return false;
|
|
224
|
+
node.updateRoundMaxEffort(effort);
|
|
225
|
+
if (!this.shouldSplit(node)) return false;
|
|
226
|
+
if (isPathContainingAtom(this.manager, node, literal))
|
|
227
|
+
throw new SmtInvariantError("the search tree splits on an atom of its path");
|
|
228
|
+
node.left = new SearchNode(literal, node);
|
|
229
|
+
node.right = new SearchNode(negation, node);
|
|
230
|
+
return true;
|
|
231
|
+
}
|
|
232
|
+
|
|
233
|
+
// The conflict's literals are on the path from the root to the node, or are assumptions.
|
|
234
|
+
backtrack(node: SearchNode, conflict: number[]) {
|
|
235
|
+
if (conflict.length === 0) {
|
|
236
|
+
this.closeWithCore(this.root, conflict);
|
|
237
|
+
return;
|
|
238
|
+
}
|
|
239
|
+
for (let current: SearchNode | undefined = node; current !== undefined;) {
|
|
240
|
+
const literal = current.literal;
|
|
241
|
+
if (conflict.includes(literal)) {
|
|
242
|
+
this.closeWithCore(current, conflict);
|
|
243
|
+
return;
|
|
244
|
+
}
|
|
245
|
+
current = current.parent;
|
|
246
|
+
}
|
|
247
|
+
throw new SmtInvariantError("the conflict has no literal of the search tree's path");
|
|
248
|
+
}
|
|
249
|
+
|
|
250
|
+
activateBestNode() {
|
|
251
|
+
const best: Candidate = { node: undefined, scaledEffort: Infinity, depth: 0 };
|
|
252
|
+
this.selectNextNode(this.root, STATUS_OPEN, best);
|
|
253
|
+
if (best.node === undefined) this.selectNextNode(this.root, STATUS_ACTIVE, best);
|
|
254
|
+
best.node?.markNewActivation();
|
|
255
|
+
return best.node;
|
|
256
|
+
}
|
|
257
|
+
|
|
258
|
+
activateRoot() {
|
|
259
|
+
if (this.root.status === STATUS_CLOSED) return undefined;
|
|
260
|
+
this.root.markNewActivation();
|
|
261
|
+
return this.root;
|
|
262
|
+
}
|
|
263
|
+
|
|
264
|
+
findNonclosedNodesWithLiteral(literal: number) {
|
|
265
|
+
const found: SearchNode[] = [];
|
|
266
|
+
const visit = (node: SearchNode | undefined) => {
|
|
267
|
+
if (node === undefined) return;
|
|
268
|
+
if (node.literal !== -1 && node.literal === literal && node.status !== STATUS_CLOSED)
|
|
269
|
+
found.push(node);
|
|
270
|
+
visit(node.left);
|
|
271
|
+
visit(node.right);
|
|
272
|
+
};
|
|
273
|
+
visit(this.root);
|
|
274
|
+
return found;
|
|
275
|
+
}
|
|
276
|
+
|
|
277
|
+
isLeaseCanceled(node: SearchNode) {
|
|
278
|
+
return node.status === STATUS_CLOSED;
|
|
279
|
+
}
|
|
280
|
+
|
|
281
|
+
get isClosed() {
|
|
282
|
+
return this.root.status === STATUS_CLOSED;
|
|
283
|
+
}
|
|
284
|
+
}
|