tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6
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 +57 -53
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +109 -10
- package/dist/index.d.ts +109 -10
- 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 +146 -31
- package/dist/run.js +146 -31
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +132 -104
- package/dist/transfer.js +132 -104
- package/dist/worker.cjs +6 -6
- package/dist/worker.js +6 -6
- package/package.json +3 -1
- package/src/ast.ts +45 -59
- package/src/bags.ts +99 -102
- package/src/builtins.ts +28 -75
- package/src/bundled-modules.ts +1 -8
- package/src/check-failure.ts +116 -0
- package/src/check-trace.ts +282 -0
- package/src/check.ts +797 -782
- package/src/cli/options.ts +12 -32
- package/src/cli/run.ts +0 -2
- package/src/cli/runtime-invariants.ts +136 -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 +687 -0
- package/src/cli/tlc-usage.ts +360 -0
- package/src/cli/tlc.ts +323 -658
- 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 +196 -74
- package/src/config.ts +140 -109
- package/src/coverage.ts +830 -0
- package/src/dependencies.ts +36 -54
- package/src/dfid.ts +618 -0
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +178 -339
- package/src/errors.ts +100 -57
- package/src/evaluate.ts +598 -340
- package/src/exit-codes.ts +38 -3
- package/src/fingerprints.ts +75 -11
- package/src/index.ts +3 -0
- package/src/instances.ts +126 -21
- package/src/java-hash.ts +7 -0
- package/src/java-overrides.ts +4 -19
- package/src/json-reader.ts +455 -0
- package/src/json.ts +252 -139
- package/src/levels.ts +46 -58
- package/src/lexer.ts +83 -101
- package/src/liveness-checker.ts +590 -311
- package/src/liveness.ts +180 -124
- 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 +38 -19
- package/src/obligations/levels.ts +27 -18
- package/src/obligations/module.ts +28 -55
- package/src/obligations/normalize.ts +30 -37
- package/src/obligations/operators.ts +0 -3
- package/src/obligations/pragma.ts +52 -24
- package/src/obligations/printer.ts +89 -58
- 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 +119 -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 +30 -60
- package/src/parallel.ts +59 -73
- package/src/parser.ts +1082 -399
- 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 +224 -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 +0 -14
- package/src/prover/isabelle/provers/classical.ts +58 -61
- package/src/prover/isabelle/provers/hypsubst.ts +27 -52
- 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 +31 -74
- 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 +1 -44
- 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 +0 -2
- 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 +1026 -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 +615 -53
- 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 +309 -0
- package/src/prover/smt/solver/array.ts +1 -3
- package/src/prover/smt/solver/asserted-formulas.ts +87 -58
- package/src/prover/smt/solver/ast-lt.ts +166 -22
- package/src/prover/smt/solver/ast-util.ts +160 -7
- package/src/prover/smt/solver/ast.ts +1424 -180
- package/src/prover/smt/solver/auf-solver.ts +7 -44
- package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +600 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +338 -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 +110 -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 +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -11
- package/src/prover/smt/solver/context.ts +519 -175
- package/src/prover/smt/solver/ctx-simplify.ts +33 -50
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -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 +81 -0
- package/src/prover/smt/solver/der.ts +39 -30
- package/src/prover/smt/solver/diff-neq.ts +206 -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 +260 -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-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +545 -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 +907 -0
- package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
- package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
- package/src/prover/smt/solver/euf/mam.ts +1050 -0
- package/src/prover/smt/solver/euf/q-ematch.ts +830 -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 +335 -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 +146 -0
- package/src/prover/smt/solver/factor.ts +141 -0
- package/src/prover/smt/solver/fd-solver.ts +265 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -26
- package/src/prover/smt/solver/fix-dl-var.ts +148 -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 +640 -0
- package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
- package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
- package/src/prover/smt/solver/goal.ts +176 -28
- package/src/prover/smt/solver/goal2nlsat.ts +189 -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 +26 -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 +112 -132
- 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 +345 -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 +11 -30
- package/src/prover/smt/solver/lp/core-solver.ts +23 -29
- package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
- 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 +69 -82
- package/src/prover/smt/solver/lp/lar-term.ts +0 -5
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
- package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
- package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
- package/src/prover/smt/solver/lp/nex.ts +0 -6
- 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 +91 -135
- 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 +22 -72
- 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 +123 -112
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
- package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
- package/src/prover/smt/solver/lp/pdd.ts +7 -70
- 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 +309 -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 +105 -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 -62
- package/src/prover/smt/solver/model-evaluator.ts +190 -40
- package/src/prover/smt/solver/model-finder.ts +14 -32
- package/src/prover/smt/solver/model-generator.ts +56 -40
- 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 +711 -0
- package/src/prover/smt/solver/mus.ts +51 -0
- package/src/prover/smt/solver/muz/dl-context.ts +404 -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 +496 -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 +201 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1406 -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 +218 -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 +177 -160
- package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
- package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
- package/src/prover/smt/solver/nlsat/explain.ts +65 -69
- package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
- package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
- package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
- package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
- package/src/prover/smt/solver/nlsat/solver.ts +241 -110
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -9
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
- package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +107 -60
- 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 +787 -0
- package/src/prover/smt/solver/opt-nlsat.ts +375 -0
- package/src/prover/smt/solver/opt-pareto.ts +282 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +308 -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 +284 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +204 -79
- package/src/prover/smt/solver/probes.ts +512 -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/qe-arith-plugin.ts +1098 -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 +39 -49
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1498 -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 +814 -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 +8 -23
- 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 +261 -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 +52 -129
- package/src/prover/smt/solver/rewriter.ts +477 -120
- package/src/prover/smt/solver/rlimit.ts +39 -21
- 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 +526 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +165 -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 +2127 -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 +1010 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1301 -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 +728 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -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 +2402 -0
- package/src/prover/smt/solver/seq-skolem.ts +317 -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 +83 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +496 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
- package/src/prover/smt/solver/smtlib-script.ts +1631 -0
- package/src/prover/smt/solver/solve-eqs.ts +929 -0
- package/src/prover/smt/solver/solver.ts +119 -39
- 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 +1986 -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 +1200 -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 +59 -91
- package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
- package/src/prover/smt/solver/theory-lra-model.ts +23 -53
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
- package/src/prover/smt/solver/theory-lra-state.ts +6 -27
- package/src/prover/smt/solver/theory-lra.ts +188 -8
- package/src/prover/smt/solver/theory-pb.ts +934 -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 +871 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -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 +67 -41
- 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 +0 -6
- package/src/prover/zenon/expr.ts +8 -28
- package/src/prover/zenon/index-table.ts +26 -59
- package/src/prover/zenon/isar-case.ts +8 -20
- package/src/prover/zenon/isar.ts +35 -65
- 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 +1 -13
- package/src/prover/zenon/proof.ts +0 -11
- package/src/prover/zenon/propositional-rules.ts +0 -7
- package/src/prover/zenon/rules.ts +2 -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 +67 -185
- package/src/runtime.ts +26 -22
- package/src/sany/builtins.ts +2 -5
- package/src/sany/generation.ts +394 -0
- package/src/sany/generator-def-entries.ts +210 -0
- package/src/sany/generator-definitions.ts +686 -0
- package/src/sany/generator-expressions.ts +1100 -0
- package/src/sany/generator-proofs.ts +662 -0
- package/src/sany/generator.ts +191 -2764
- package/src/sany/levels.ts +5 -35
- package/src/sany/lexer.ts +58 -77
- package/src/sany/linter.ts +0 -10
- package/src/sany/modules.ts +1 -5
- package/src/sany/nodes.ts +5 -43
- package/src/sany/parse-error.ts +39 -117
- package/src/sany/report.ts +32 -69
- package/src/sany/selectors.ts +49 -76
- package/src/sany/source.ts +1 -17
- package/src/sany/xml.ts +35 -117
- package/src/search.ts +671 -169
- package/src/simulate.ts +712 -0
- package/src/spec-description.ts +192 -100
- package/src/standard-definitions.ts +4 -4
- package/src/standard-modules.ts +264 -95
- package/src/state-graph.ts +52 -33
- package/src/subexpressions.ts +69 -52
- package/src/substitution-levels.ts +7 -7
- package/src/successors.ts +267 -100
- package/src/symmetry.ts +35 -27
- package/src/tableau.ts +29 -26
- package/src/tlc/fingerprint.ts +267 -79
- package/src/tlc/jar-data.ts +112 -6
- package/src/tlc/messages.ts +125 -54
- package/src/tlc/order.ts +39 -69
- package/src/tlc/random.ts +37 -49
- package/src/tlc/replay.ts +553 -228
- package/src/tlc/summary.ts +64 -60
- package/src/tlc/tlc-operators.ts +78 -44
- package/src/tlc/tlcext-operators.ts +171 -122
- package/src/tlc/trace-spec.ts +249 -0
- package/src/tlc/value-stream.ts +139 -0
- package/src/tlc/version.ts +1 -4
- package/src/transfer.ts +22 -25
- package/src/typed-tier.ts +6535 -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 +832 -484
- 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,299 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../errors";
|
|
2
|
+
import { type AstManager, OP_AND, OP_EQ, OP_ITE, OP_OR } from "./ast";
|
|
3
|
+
import { mkNot } from "./ast-util";
|
|
4
|
+
import { AssertedFormulas } from "./asserted-formulas";
|
|
5
|
+
import type { Context } from "./context";
|
|
6
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
|
|
7
|
+
import { getVar, isNegated, toBoolVar } from "./literal";
|
|
8
|
+
import type { ProtoModel } from "./proto-model";
|
|
9
|
+
import { RandomGen } from "./random-gen";
|
|
10
|
+
import { RefVector } from "./ref-vector";
|
|
11
|
+
import { isAncestor, isPathContaining, type SearchNode, SearchTree } from "./search-tree";
|
|
12
|
+
import { SmtKernel } from "./smt-kernel";
|
|
13
|
+
import type { KernelParams } from "./solver";
|
|
14
|
+
|
|
15
|
+
export interface ParallelParams {
|
|
16
|
+
threadsMax: number;
|
|
17
|
+
numBbThreads: number;
|
|
18
|
+
isAblatingBacktracking: boolean;
|
|
19
|
+
}
|
|
20
|
+
|
|
21
|
+
interface ParallelResult {
|
|
22
|
+
status: number;
|
|
23
|
+
model: ProtoModel | undefined;
|
|
24
|
+
core: number[];
|
|
25
|
+
}
|
|
26
|
+
|
|
27
|
+
const INITIAL_MAX_THREAD_CONFLICTS = 1000;
|
|
28
|
+
const MAX_CONFLICT_MUL = 1.5;
|
|
29
|
+
const MAX_CUBE_DEPTH = 20;
|
|
30
|
+
const UINT_MAX = 4294967295;
|
|
31
|
+
|
|
32
|
+
const STATE_RUNNING = 0;
|
|
33
|
+
const STATE_SAT = 1;
|
|
34
|
+
const STATE_UNSAT = 2;
|
|
35
|
+
const STATE_UNKNOWN = 3;
|
|
36
|
+
|
|
37
|
+
const isConnective = (manager: AstManager, atom: number) => {
|
|
38
|
+
const op = manager.getOp(atom);
|
|
39
|
+
return (
|
|
40
|
+
op === OP_AND ||
|
|
41
|
+
op === OP_OR ||
|
|
42
|
+
op === OP_ITE ||
|
|
43
|
+
(op === OP_EQ && manager.isBool(manager.getArg(atom, 0)))
|
|
44
|
+
);
|
|
45
|
+
};
|
|
46
|
+
|
|
47
|
+
// The batch manager and its only worker. Shared clauses never reach the worker that shares them,
|
|
48
|
+
// and the backbone candidates and core minimization jobs only feed workers that one hardware
|
|
49
|
+
// thread leaves out, so those are not ported.
|
|
50
|
+
class ParallelSolver {
|
|
51
|
+
private state = STATE_RUNNING;
|
|
52
|
+
private readonly tree: SearchTree;
|
|
53
|
+
// Holds the literals of the tree, the cores and the global backbones.
|
|
54
|
+
private readonly literals: RefVector;
|
|
55
|
+
private readonly globalBackbones = new Set<number>();
|
|
56
|
+
private readonly knownUnits = new Set<number>();
|
|
57
|
+
// smt_solver's random_gen, which cube_vsids draws from.
|
|
58
|
+
private readonly random = new RandomGen(0);
|
|
59
|
+
private readonly context: Context;
|
|
60
|
+
private readonly numInitialAtoms: number;
|
|
61
|
+
private sharedUnitsPrefix: number;
|
|
62
|
+
private threadsMaxConflicts = INITIAL_MAX_THREAD_CONFLICTS;
|
|
63
|
+
private model: ProtoModel | undefined;
|
|
64
|
+
private core: number[] = [];
|
|
65
|
+
|
|
66
|
+
constructor(
|
|
67
|
+
private readonly manager: AstManager,
|
|
68
|
+
private readonly kernel: SmtKernel,
|
|
69
|
+
private readonly assumptions: number[],
|
|
70
|
+
private readonly params: ParallelParams,
|
|
71
|
+
) {
|
|
72
|
+
this.tree = new SearchTree(manager);
|
|
73
|
+
this.tree.setEffortUnit(INITIAL_MAX_THREAD_CONFLICTS);
|
|
74
|
+
this.literals = new RefVector(manager);
|
|
75
|
+
this.context = kernel.context;
|
|
76
|
+
this.context.popToBaseLevel();
|
|
77
|
+
this.sharedUnitsPrefix = this.context.assignedLiterals.length;
|
|
78
|
+
this.numInitialAtoms = this.context.numBoolVars;
|
|
79
|
+
kernel.setPreprocess(false);
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
solve(): ParallelResult {
|
|
83
|
+
for (let lease = this.getCube(true); lease !== undefined; lease = this.getCube(false)) {
|
|
84
|
+
if (!this.conquer(lease, this.getCubeLiterals(lease))) break;
|
|
85
|
+
this.shareUnits();
|
|
86
|
+
}
|
|
87
|
+
this.literals.reset();
|
|
88
|
+
if (this.state === STATE_RUNNING) throw new SmtTacticError("par2: inconsistent end state");
|
|
89
|
+
const status =
|
|
90
|
+
this.state === STATE_SAT ? L_TRUE : this.state === STATE_UNSAT ? L_FALSE : L_UNDEF;
|
|
91
|
+
return { status, model: this.model, core: this.core };
|
|
92
|
+
}
|
|
93
|
+
|
|
94
|
+
private getCube(isFirstRun: boolean) {
|
|
95
|
+
if (this.tree.isClosed || this.state !== STATE_RUNNING) return undefined;
|
|
96
|
+
return isFirstRun ? this.tree.activateRoot() : this.tree.activateBestNode();
|
|
97
|
+
}
|
|
98
|
+
|
|
99
|
+
private getCubeLiterals(lease: SearchNode) {
|
|
100
|
+
const cube: number[] = [];
|
|
101
|
+
for (
|
|
102
|
+
let node: SearchNode | undefined = lease;
|
|
103
|
+
node !== undefined && node.literal !== -1;
|
|
104
|
+
node = node.parent
|
|
105
|
+
)
|
|
106
|
+
cube.push(node.literal);
|
|
107
|
+
return cube;
|
|
108
|
+
}
|
|
109
|
+
|
|
110
|
+
// The worker's loop over one cube, which answers whether the worker goes on to the next cube.
|
|
111
|
+
private conquer(lease: SearchNode, cube: number[]) {
|
|
112
|
+
for (;;) {
|
|
113
|
+
this.context.maxConflicts = this.threadsMaxConflicts;
|
|
114
|
+
const result = this.kernel.check([...this.assumptions, ...cube]);
|
|
115
|
+
if (result === L_TRUE) {
|
|
116
|
+
this.setSat(this.context.getModel());
|
|
117
|
+
return false;
|
|
118
|
+
}
|
|
119
|
+
if (result === L_FALSE) {
|
|
120
|
+
const core = this.context.unsatCore;
|
|
121
|
+
if (core.every((literal) => this.assumptions.includes(literal))) {
|
|
122
|
+
this.setUnsat(core);
|
|
123
|
+
return false;
|
|
124
|
+
}
|
|
125
|
+
this.backtrack(this.params.isAblatingBacktracking ? cube : core, lease);
|
|
126
|
+
return true;
|
|
127
|
+
}
|
|
128
|
+
// Only a cube that ran out of conflicts gets more conflicts or a split.
|
|
129
|
+
const reason = this.context.getLastFailureMessage();
|
|
130
|
+
if (reason !== "max-conflicts-reached") {
|
|
131
|
+
this.setUnknown();
|
|
132
|
+
return false;
|
|
133
|
+
}
|
|
134
|
+
const next = MAX_CONFLICT_MUL * this.threadsMaxConflicts;
|
|
135
|
+
this.threadsMaxConflicts = next >= UINT_MAX ? UINT_MAX : Math.trunc(next);
|
|
136
|
+
if (cube.length >= MAX_CUBE_DEPTH) continue;
|
|
137
|
+
const atom = this.getSplitAtom(cube);
|
|
138
|
+
if (atom === -1) continue;
|
|
139
|
+
this.trySplit(lease, atom);
|
|
140
|
+
return true;
|
|
141
|
+
}
|
|
142
|
+
}
|
|
143
|
+
|
|
144
|
+
private setSat(model: ProtoModel) {
|
|
145
|
+
if (this.state !== STATE_RUNNING && this.state !== STATE_UNKNOWN) return;
|
|
146
|
+
this.state = STATE_SAT;
|
|
147
|
+
this.model = model;
|
|
148
|
+
}
|
|
149
|
+
|
|
150
|
+
private setUnsat(core: number[]) {
|
|
151
|
+
if (this.state !== STATE_RUNNING && this.state !== STATE_UNKNOWN) return;
|
|
152
|
+
this.state = STATE_UNSAT;
|
|
153
|
+
this.core = core;
|
|
154
|
+
}
|
|
155
|
+
|
|
156
|
+
private setUnknown() {
|
|
157
|
+
if (this.state === STATE_RUNNING) this.state = STATE_UNKNOWN;
|
|
158
|
+
}
|
|
159
|
+
|
|
160
|
+
// cube_vsids: the unassigned atom of the highest activity, ties broken at random.
|
|
161
|
+
private getSplitAtom(cube: number[]) {
|
|
162
|
+
const manager = this.manager;
|
|
163
|
+
const context = this.context;
|
|
164
|
+
const invalid = new Set(
|
|
165
|
+
[...cube, ...(this.params.numBbThreads > 0 ? this.globalBackbones : [])].map((literal) =>
|
|
166
|
+
manager.isNot(literal) ? manager.getArg(literal, 0) : literal,
|
|
167
|
+
),
|
|
168
|
+
);
|
|
169
|
+
let result = -1;
|
|
170
|
+
let score = 0;
|
|
171
|
+
let numTies = 0;
|
|
172
|
+
context.popToSearchLevel();
|
|
173
|
+
for (let boolVar = 0; boolVar < context.numBoolVars; boolVar++) {
|
|
174
|
+
if (context.getBoolVarAssignment(toBoolVar(boolVar)) !== L_UNDEF) continue;
|
|
175
|
+
const expr = context.boolVar2Expr[boolVar];
|
|
176
|
+
if (invalid.has(manager.isNot(expr) ? manager.getArg(expr, 0) : expr)) continue;
|
|
177
|
+
const newScore = context.activity[boolVar];
|
|
178
|
+
if (
|
|
179
|
+
newScore > score ||
|
|
180
|
+
result === -1 ||
|
|
181
|
+
(newScore === score && this.random.next() % ++numTies === 0)
|
|
182
|
+
) {
|
|
183
|
+
score = newScore;
|
|
184
|
+
result = expr;
|
|
185
|
+
}
|
|
186
|
+
}
|
|
187
|
+
return result;
|
|
188
|
+
}
|
|
189
|
+
|
|
190
|
+
private trySplit(lease: SearchNode, atom: number) {
|
|
191
|
+
if (this.state !== STATE_RUNNING) return;
|
|
192
|
+
if (!this.tree.isLeaseCanceled(lease)) {
|
|
193
|
+
const negation = mkNot(this.manager, atom);
|
|
194
|
+
this.literals.push(atom);
|
|
195
|
+
this.literals.push(negation);
|
|
196
|
+
this.tree.trySplit(lease, atom, negation, this.threadsMaxConflicts);
|
|
197
|
+
}
|
|
198
|
+
lease.decActiveWorkers();
|
|
199
|
+
}
|
|
200
|
+
|
|
201
|
+
private collectMatchingTargets(source: SearchNode | undefined, literal: number, core: number[]) {
|
|
202
|
+
const targets: SearchNode[] = [];
|
|
203
|
+
for (const node of this.tree.findNonclosedNodesWithLiteral(literal)) {
|
|
204
|
+
if (node === source) continue;
|
|
205
|
+
// Another branch's node can only take the conflict when its path has the whole core.
|
|
206
|
+
if (source !== undefined && (isAncestor(source, node) || isAncestor(node, source))) continue;
|
|
207
|
+
if (!core.every((coreLiteral) => isPathContaining(node, coreLiteral))) continue;
|
|
208
|
+
if (node.parent !== undefined && targets.some((target) => isAncestor(target, node.parent)))
|
|
209
|
+
continue;
|
|
210
|
+
targets.push(node);
|
|
211
|
+
}
|
|
212
|
+
return targets;
|
|
213
|
+
}
|
|
214
|
+
|
|
215
|
+
private backtrack(core: number[], lease: SearchNode) {
|
|
216
|
+
if (this.state !== STATE_RUNNING) return;
|
|
217
|
+
this.backtrackNodes(core, lease, this.collectMatchingTargets(lease, lease.literal, core));
|
|
218
|
+
}
|
|
219
|
+
|
|
220
|
+
private backtrackNodes(core: number[], lease: SearchNode | undefined, targets: SearchNode[]) {
|
|
221
|
+
if (this.state !== STATE_RUNNING) return;
|
|
222
|
+
let isBacktracked = false;
|
|
223
|
+
if (lease !== undefined) {
|
|
224
|
+
lease.decActiveWorkers();
|
|
225
|
+
if (!this.tree.isLeaseCanceled(lease)) {
|
|
226
|
+
isBacktracked = true;
|
|
227
|
+
this.tree.backtrack(lease, core);
|
|
228
|
+
}
|
|
229
|
+
}
|
|
230
|
+
for (const target of targets) {
|
|
231
|
+
if (this.tree.isLeaseCanceled(target)) continue;
|
|
232
|
+
isBacktracked = true;
|
|
233
|
+
this.tree.backtrack(target, core);
|
|
234
|
+
}
|
|
235
|
+
if (isBacktracked && this.tree.isClosed) {
|
|
236
|
+
this.state = STATE_UNSAT;
|
|
237
|
+
this.core = this.tree.root.core;
|
|
238
|
+
}
|
|
239
|
+
}
|
|
240
|
+
|
|
241
|
+
private collectGlobalBackbone(backbone: number) {
|
|
242
|
+
if (this.globalBackbones.has(backbone)) return;
|
|
243
|
+
this.globalBackbones.add(backbone);
|
|
244
|
+
const negation = mkNot(this.manager, backbone);
|
|
245
|
+
this.literals.push(backbone);
|
|
246
|
+
this.literals.push(negation);
|
|
247
|
+
const targets = this.collectMatchingTargets(undefined, negation, [negation]);
|
|
248
|
+
if (targets.length > 0) this.backtrackNodes([negation], undefined, targets);
|
|
249
|
+
}
|
|
250
|
+
|
|
251
|
+
// Shares the new units of the base level among the initial atoms, skipping the trail's prefix of
|
|
252
|
+
// base-level literals that it already went through.
|
|
253
|
+
private shareUnits() {
|
|
254
|
+
const manager = this.manager;
|
|
255
|
+
const context = this.context;
|
|
256
|
+
const trail = context.assignedLiterals;
|
|
257
|
+
let prefix = Math.min(this.sharedUnitsPrefix, trail.length);
|
|
258
|
+
let isAtPrefix = true;
|
|
259
|
+
for (let index = this.sharedUnitsPrefix; index < trail.length; index++) {
|
|
260
|
+
const literal = trail[index];
|
|
261
|
+
const boolVar = getVar(literal);
|
|
262
|
+
if (context.getLevel(boolVar) > 0) {
|
|
263
|
+
isAtPrefix = false;
|
|
264
|
+
continue;
|
|
265
|
+
}
|
|
266
|
+
if (isAtPrefix) prefix++;
|
|
267
|
+
const atom = context.boolVar2Expr[boolVar];
|
|
268
|
+
if (isConnective(manager, atom) || this.knownUnits.has(boolVar)) continue;
|
|
269
|
+
this.knownUnits.add(boolVar);
|
|
270
|
+
if (!context.isRelevant(atom) || boolVar >= this.numInitialAtoms) continue;
|
|
271
|
+
this.collectGlobalBackbone(isNegated(literal) ? manager.mkNot(atom) : atom);
|
|
272
|
+
}
|
|
273
|
+
this.sharedUnitsPrefix = prefix;
|
|
274
|
+
}
|
|
275
|
+
}
|
|
276
|
+
|
|
277
|
+
// parallel_tactic over mk_smt_solver. Z3 runs a worker for each hardware thread, but the port runs
|
|
278
|
+
// the schedule of one hardware thread, where neither backbone nor core minimizer workers run.
|
|
279
|
+
// threads.max caps the threads, so that schedule is Z3's with parallel.threads.max=1.
|
|
280
|
+
export const solveParallel = (
|
|
281
|
+
manager: AstManager,
|
|
282
|
+
kernelParams: KernelParams,
|
|
283
|
+
params: ParallelParams,
|
|
284
|
+
clauses: number[],
|
|
285
|
+
assumptions: number[],
|
|
286
|
+
) => {
|
|
287
|
+
if (params.numBbThreads > 2)
|
|
288
|
+
throw new SmtTacticError("parallel.num_bb_threads must be 0, 1, or 2");
|
|
289
|
+
if (params.threadsMax === 0) throw new SmtTacticError("par2: inconsistent end state");
|
|
290
|
+
// The tactic's solver keeps the asserted formulas, and its worker copies them.
|
|
291
|
+
const source = new AssertedFormulas(manager, kernelParams.isFindingMacros);
|
|
292
|
+
for (const clause of clauses) source.assertExpr(clause);
|
|
293
|
+
const kernel = new SmtKernel(manager, kernelParams);
|
|
294
|
+
for (const formula of source.getFormulas()) kernel.assertExpr(formula);
|
|
295
|
+
kernel.internalize();
|
|
296
|
+
const result = new ParallelSolver(manager, kernel, assumptions, params).solve();
|
|
297
|
+
manager.limit.release();
|
|
298
|
+
return result;
|
|
299
|
+
};
|
|
@@ -1,7 +1,3 @@
|
|
|
1
|
-
// Ported from Z3 (src/ast/pattern/pattern_inference.cpp), MIT license, see z3-license.txt.
|
|
2
|
-
// Infers E-matching patterns for quantifiers that have none, with Z3's default parameters:
|
|
3
|
-
// pi.max_multi_patterns=0, pi.block_loop_patterns=true, pi.decompose_patterns=true,
|
|
4
|
-
// pi.arith=1 (conservative), pi.avoid_skolems=true.
|
|
5
1
|
import {
|
|
6
2
|
AstManager,
|
|
7
3
|
FAMILY_ARITH,
|
|
@@ -12,6 +8,7 @@ import {
|
|
|
12
8
|
OP_FALSE,
|
|
13
9
|
OP_IDIV,
|
|
14
10
|
OP_MOD,
|
|
11
|
+
OP_REM,
|
|
15
12
|
OP_MUL,
|
|
16
13
|
OP_TRUE,
|
|
17
14
|
} from "./ast";
|
|
@@ -40,12 +37,11 @@ const isSameSet = (left: Set<number>, right: Set<number>) =>
|
|
|
40
37
|
const isSubset = (left: Set<number>, right: Set<number>) =>
|
|
41
38
|
[...left].every((element) => right.has(element));
|
|
42
39
|
|
|
43
|
-
// pattern_inference_cfg, which asserted_formulas keeps as long as it lives. m_candidates holds its
|
|
44
|
-
// candidates until the end of mk_patterns.
|
|
45
40
|
export class PatternInference {
|
|
46
41
|
private candidates: RefVector;
|
|
47
42
|
private candidateInfos = new Map<number, CandidateInfo>();
|
|
48
43
|
private numBindings = 0;
|
|
44
|
+
private noPatterns: number[] = [];
|
|
49
45
|
private isArithForbidden = true;
|
|
50
46
|
private isNestedArithOnly = true;
|
|
51
47
|
private isBlockingLoopPatterns = true;
|
|
@@ -56,7 +52,7 @@ export class PatternInference {
|
|
|
56
52
|
|
|
57
53
|
private isForbidden(expr: number) {
|
|
58
54
|
const manager = this.manager;
|
|
59
|
-
if (manager.
|
|
55
|
+
if (manager.isGroundApp(expr)) return false;
|
|
60
56
|
const decl = manager.funcDecls[manager.decls[expr]];
|
|
61
57
|
if (decl.isSkolem) return true;
|
|
62
58
|
if (decl.family === FAMILY_BASIC) return decl.op !== OP_TRUE && decl.op !== OP_FALSE;
|
|
@@ -97,7 +93,7 @@ export class PatternInference {
|
|
|
97
93
|
const decl = manager.funcDecls[manager.decls[expr]];
|
|
98
94
|
const isArithCandidate =
|
|
99
95
|
!this.isNestedArithOnly &&
|
|
100
|
-
(decl.op === OP_IDIV || decl.op === OP_MOD || decl.op === OP_MUL);
|
|
96
|
+
(decl.op === OP_IDIV || decl.op === OP_MOD || decl.op === OP_REM || decl.op === OP_MUL);
|
|
101
97
|
if (
|
|
102
98
|
freeVars.size > 0 &&
|
|
103
99
|
boundVars.size === 0 &&
|
|
@@ -129,12 +125,11 @@ export class PatternInference {
|
|
|
129
125
|
}
|
|
130
126
|
|
|
131
127
|
private addCandidate(expr: number, freeVars: Set<number>, size: number) {
|
|
132
|
-
if (this.candidateInfos.has(expr)) return;
|
|
128
|
+
if (this.noPatterns.includes(expr) || this.candidateInfos.has(expr)) return;
|
|
133
129
|
this.candidateInfos.set(expr, { freeVars, boundVars: new Set(), size });
|
|
134
130
|
this.candidates.push(expr);
|
|
135
131
|
}
|
|
136
132
|
|
|
137
|
-
// smaller_pattern: whether second is an instance of first.
|
|
138
133
|
private isSmaller(first: number, second: number) {
|
|
139
134
|
const manager = this.manager;
|
|
140
135
|
const bindings = Array.from({ length: this.numBindings }, () => -1);
|
|
@@ -231,7 +226,7 @@ export class PatternInference {
|
|
|
231
226
|
args[index] = args[args.length - 1];
|
|
232
227
|
index--;
|
|
233
228
|
args.pop();
|
|
234
|
-
if (manager.
|
|
229
|
+
if (manager.isGroundApp(arg)) continue;
|
|
235
230
|
for (let argIndex = 0; argIndex < manager.getNumArgs(arg); argIndex++) {
|
|
236
231
|
const innerArg = manager.getArg(arg, argIndex);
|
|
237
232
|
if (manager.kinds[innerArg] !== KIND_APP) return manager.mkPattern([candidate]);
|
|
@@ -274,15 +269,15 @@ export class PatternInference {
|
|
|
274
269
|
}
|
|
275
270
|
}
|
|
276
271
|
|
|
277
|
-
private mkPatterns(numBindings: number, body: number) {
|
|
272
|
+
private mkPatterns(numBindings: number, body: number, noPatterns: number[]) {
|
|
278
273
|
this.numBindings = numBindings;
|
|
274
|
+
this.noPatterns = noPatterns;
|
|
279
275
|
this.collect(body);
|
|
280
276
|
const result: number[] = [];
|
|
281
277
|
if (this.candidates.size > 0) {
|
|
282
278
|
const looseCandidates = this.filterLoopingPatterns().filter(
|
|
283
279
|
(candidate) => !this.containsSubpattern(candidate),
|
|
284
280
|
);
|
|
285
|
-
// m_tmp1: the candidates that do not cover every variable, which may form a multi-pattern.
|
|
286
281
|
const partialCandidates: number[] = [];
|
|
287
282
|
for (const candidate of looseCandidates) {
|
|
288
283
|
const info = this.candidateInfos.get(candidate);
|
|
@@ -292,13 +287,11 @@ export class PatternInference {
|
|
|
292
287
|
}
|
|
293
288
|
const numExtraMultiPatterns = result.length === 0 ? 1 : 0;
|
|
294
289
|
if (numExtraMultiPatterns > 0 && partialCandidates.length > 0) {
|
|
295
|
-
// std::stable_sort with m_pattern_weight_lt.
|
|
296
|
-
const weightOf = (candidate: number) => this.candidateInfos.get(candidate);
|
|
297
290
|
const sorted = partialCandidates
|
|
298
291
|
.map((candidate, index) => ({ candidate, index }))
|
|
299
292
|
.sort((left, right) => {
|
|
300
|
-
const leftInfo =
|
|
301
|
-
const rightInfo =
|
|
293
|
+
const leftInfo = this.candidateInfos.get(left.candidate);
|
|
294
|
+
const rightInfo = this.candidateInfos.get(right.candidate);
|
|
302
295
|
if (leftInfo === undefined || rightInfo === undefined) return left.index - right.index;
|
|
303
296
|
if (leftInfo.freeVars.size !== rightInfo.freeVars.size)
|
|
304
297
|
return rightInfo.freeVars.size - leftInfo.freeVars.size;
|
|
@@ -314,34 +307,36 @@ export class PatternInference {
|
|
|
314
307
|
return result;
|
|
315
308
|
}
|
|
316
309
|
|
|
317
|
-
//
|
|
318
|
-
//
|
|
319
|
-
infer(numBindings: number, body: number, weight: number): InferredPatterns {
|
|
310
|
+
// Arithmetic, then looping and non-nested arithmetic patterns, are allowed when no pattern is
|
|
311
|
+
// found without them. The no-patterns are ignored only when they leave no other pattern.
|
|
312
|
+
infer(numBindings: number, body: number, weight: number, noPatterns: number[]): InferredPatterns {
|
|
320
313
|
this.isArithForbidden = true;
|
|
321
314
|
this.isNestedArithOnly = true;
|
|
322
315
|
this.isBlockingLoopPatterns = true;
|
|
323
|
-
const patterns = this.mkPatterns(numBindings, body);
|
|
316
|
+
const patterns = this.mkPatterns(numBindings, body, noPatterns);
|
|
324
317
|
if (patterns.length > 0) return { patterns, weight };
|
|
318
|
+
if (noPatterns.length > 0) {
|
|
319
|
+
const ignoringPatterns = this.mkPatterns(numBindings, body, []);
|
|
320
|
+
if (ignoringPatterns.length > 0) return { patterns: ignoringPatterns, weight };
|
|
321
|
+
}
|
|
325
322
|
this.isArithForbidden = false;
|
|
326
323
|
this.isBlockingLoopPatterns = false;
|
|
327
|
-
const arithPatterns = this.mkPatterns(numBindings, body);
|
|
324
|
+
const arithPatterns = this.mkPatterns(numBindings, body, noPatterns);
|
|
328
325
|
if (arithPatterns.length > 0)
|
|
329
326
|
return { patterns: arithPatterns, weight: Math.max(weight, PI_ARITH_WEIGHT) };
|
|
330
327
|
this.isNestedArithOnly = false;
|
|
331
|
-
const nonNestedPatterns = this.mkPatterns(numBindings, body);
|
|
328
|
+
const nonNestedPatterns = this.mkPatterns(numBindings, body, noPatterns);
|
|
332
329
|
return {
|
|
333
330
|
patterns: nonNestedPatterns,
|
|
334
331
|
weight: nonNestedPatterns.length > 0 ? Math.max(weight, PI_NON_NESTED_ARITH_WEIGHT) : weight,
|
|
335
332
|
};
|
|
336
333
|
}
|
|
337
334
|
|
|
338
|
-
// The patterns of a quantifier that pull_quant changed, found once with the settings that infer
|
|
339
|
-
// restores: arithmetic is allowed, but only nested, and looping patterns are blocked.
|
|
340
335
|
inferPulled(numBindings: number, body: number) {
|
|
341
336
|
this.isArithForbidden = false;
|
|
342
337
|
this.isNestedArithOnly = true;
|
|
343
338
|
this.isBlockingLoopPatterns = true;
|
|
344
|
-
return this.mkPatterns(numBindings, body);
|
|
339
|
+
return this.mkPatterns(numBindings, body, []);
|
|
345
340
|
}
|
|
346
341
|
}
|
|
347
342
|
|