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,203 @@
|
|
|
1
|
+
export const NULL_LITERAL = -2;
|
|
2
|
+
export const NULL_BOOL_VAR = -1;
|
|
3
|
+
export const UINT_MAX = 4294967295;
|
|
4
|
+
|
|
5
|
+
const STRENGTHENED = 1;
|
|
6
|
+
const REMOVED = 2;
|
|
7
|
+
const LEARNED = 4;
|
|
8
|
+
const USED = 8;
|
|
9
|
+
const FROZEN = 16;
|
|
10
|
+
const REINIT_STACK = 32;
|
|
11
|
+
|
|
12
|
+
const grow = (array: Int32Array<ArrayBuffer>, size: number) => {
|
|
13
|
+
if (size <= array.length) return array;
|
|
14
|
+
const grown = new Int32Array(Math.max(size, array.length * 2));
|
|
15
|
+
grown.set(array);
|
|
16
|
+
return grown;
|
|
17
|
+
};
|
|
18
|
+
|
|
19
|
+
const getApprox = (lits: ArrayLike<number>, size: number) => {
|
|
20
|
+
let approx = 0;
|
|
21
|
+
for (let index = 0; index < size; index++) approx |= 1 << ((lits[index] >> 1) & 31);
|
|
22
|
+
return approx;
|
|
23
|
+
};
|
|
24
|
+
|
|
25
|
+
export class ClauseArena {
|
|
26
|
+
lits = new Int32Array(1024);
|
|
27
|
+
private top = 0;
|
|
28
|
+
private freeIds: number[] = [];
|
|
29
|
+
private numIds = 0;
|
|
30
|
+
start = new Int32Array(64);
|
|
31
|
+
size = new Int32Array(64);
|
|
32
|
+
flags = new Int32Array(64);
|
|
33
|
+
approx = new Int32Array(64);
|
|
34
|
+
inactRounds = new Int32Array(64);
|
|
35
|
+
glue = new Int32Array(64);
|
|
36
|
+
psm = new Int32Array(64);
|
|
37
|
+
|
|
38
|
+
private mkId() {
|
|
39
|
+
const id = this.freeIds.pop() ?? this.numIds++;
|
|
40
|
+
if (id >= this.start.length) {
|
|
41
|
+
const length = this.start.length * 2;
|
|
42
|
+
this.start = grow(this.start, length);
|
|
43
|
+
this.size = grow(this.size, length);
|
|
44
|
+
this.flags = grow(this.flags, length);
|
|
45
|
+
this.approx = grow(this.approx, length);
|
|
46
|
+
this.inactRounds = grow(this.inactRounds, length);
|
|
47
|
+
this.glue = grow(this.glue, length);
|
|
48
|
+
this.psm = grow(this.psm, length);
|
|
49
|
+
}
|
|
50
|
+
return id;
|
|
51
|
+
}
|
|
52
|
+
|
|
53
|
+
mkClause(lits: ArrayLike<number>, numLits: number, isLearned: boolean) {
|
|
54
|
+
const id = this.mkId();
|
|
55
|
+
this.lits = grow(this.lits, this.top + numLits);
|
|
56
|
+
for (let index = 0; index < numLits; index++) this.lits[this.top + index] = lits[index];
|
|
57
|
+
this.start[id] = this.top;
|
|
58
|
+
this.top += numLits;
|
|
59
|
+
this.size[id] = numLits;
|
|
60
|
+
this.flags[id] = isLearned ? LEARNED : 0;
|
|
61
|
+
this.inactRounds[id] = 0;
|
|
62
|
+
this.glue[id] = 255;
|
|
63
|
+
this.psm[id] = 255;
|
|
64
|
+
this.markStrengthened(id);
|
|
65
|
+
return id;
|
|
66
|
+
}
|
|
67
|
+
|
|
68
|
+
copyClause(other: ClauseArena, source: number) {
|
|
69
|
+
const id = this.mkClause(other.lits.subarray(other.start[source]), other.size[source], false);
|
|
70
|
+
this.flags[id] =
|
|
71
|
+
(other.flags[source] & (LEARNED | REINIT_STACK | FROZEN)) | (this.flags[id] & STRENGTHENED);
|
|
72
|
+
this.glue[id] = other.glue[source];
|
|
73
|
+
this.psm[id] = other.psm[source];
|
|
74
|
+
this.approx[id] = other.approx[source];
|
|
75
|
+
return id;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
delClause(id: number) {
|
|
79
|
+
this.freeIds.push(id);
|
|
80
|
+
}
|
|
81
|
+
|
|
82
|
+
get(id: number, index: number) {
|
|
83
|
+
return this.lits[this.start[id] + index];
|
|
84
|
+
}
|
|
85
|
+
|
|
86
|
+
set(id: number, index: number, lit: number) {
|
|
87
|
+
this.lits[this.start[id] + index] = lit;
|
|
88
|
+
}
|
|
89
|
+
|
|
90
|
+
swap(id: number, first: number, second: number) {
|
|
91
|
+
const base = this.start[id];
|
|
92
|
+
const lit = this.lits[base + first];
|
|
93
|
+
this.lits[base + first] = this.lits[base + second];
|
|
94
|
+
this.lits[base + second] = lit;
|
|
95
|
+
}
|
|
96
|
+
|
|
97
|
+
getLits(id: number) {
|
|
98
|
+
return Array.from(this.lits.subarray(this.start[id], this.start[id] + this.size[id]));
|
|
99
|
+
}
|
|
100
|
+
|
|
101
|
+
private hasFlag(id: number, flag: number) {
|
|
102
|
+
return (this.flags[id] & flag) !== 0;
|
|
103
|
+
}
|
|
104
|
+
|
|
105
|
+
private setFlag(id: number, flag: number, isSet: boolean) {
|
|
106
|
+
this.flags[id] = isSet ? this.flags[id] | flag : this.flags[id] & ~flag;
|
|
107
|
+
}
|
|
108
|
+
|
|
109
|
+
isLearned(id: number) {
|
|
110
|
+
return this.hasFlag(id, LEARNED);
|
|
111
|
+
}
|
|
112
|
+
|
|
113
|
+
setLearned(id: number, isLearned: boolean) {
|
|
114
|
+
this.setFlag(id, LEARNED, isLearned);
|
|
115
|
+
}
|
|
116
|
+
|
|
117
|
+
isStrengthened(id: number) {
|
|
118
|
+
return this.hasFlag(id, STRENGTHENED);
|
|
119
|
+
}
|
|
120
|
+
|
|
121
|
+
markStrengthened(id: number) {
|
|
122
|
+
this.setFlag(id, STRENGTHENED, true);
|
|
123
|
+
this.updateApprox(id);
|
|
124
|
+
}
|
|
125
|
+
|
|
126
|
+
unmarkStrengthened(id: number) {
|
|
127
|
+
this.setFlag(id, STRENGTHENED, false);
|
|
128
|
+
}
|
|
129
|
+
|
|
130
|
+
updateApprox(id: number) {
|
|
131
|
+
this.approx[id] = getApprox(this.lits.subarray(this.start[id]), this.size[id]);
|
|
132
|
+
}
|
|
133
|
+
|
|
134
|
+
wasRemoved(id: number) {
|
|
135
|
+
return this.hasFlag(id, REMOVED);
|
|
136
|
+
}
|
|
137
|
+
|
|
138
|
+
setRemoved(id: number, isRemoved: boolean) {
|
|
139
|
+
this.setFlag(id, REMOVED, isRemoved);
|
|
140
|
+
}
|
|
141
|
+
|
|
142
|
+
wasUsed(id: number) {
|
|
143
|
+
return this.hasFlag(id, USED);
|
|
144
|
+
}
|
|
145
|
+
|
|
146
|
+
markUsed(id: number) {
|
|
147
|
+
this.setFlag(id, USED, true);
|
|
148
|
+
}
|
|
149
|
+
|
|
150
|
+
unmarkUsed(id: number) {
|
|
151
|
+
this.setFlag(id, USED, false);
|
|
152
|
+
}
|
|
153
|
+
|
|
154
|
+
isFrozen(id: number) {
|
|
155
|
+
return this.hasFlag(id, FROZEN);
|
|
156
|
+
}
|
|
157
|
+
|
|
158
|
+
setFrozen(id: number, isFrozen: boolean) {
|
|
159
|
+
this.setFlag(id, FROZEN, isFrozen);
|
|
160
|
+
}
|
|
161
|
+
|
|
162
|
+
isOnReinitStack(id: number) {
|
|
163
|
+
return this.hasFlag(id, REINIT_STACK);
|
|
164
|
+
}
|
|
165
|
+
|
|
166
|
+
setReinitStack(id: number, isOnStack: boolean) {
|
|
167
|
+
this.setFlag(id, REINIT_STACK, isOnStack);
|
|
168
|
+
}
|
|
169
|
+
|
|
170
|
+
setGlue(id: number, glue: number) {
|
|
171
|
+
this.glue[id] = Math.min(glue, 255);
|
|
172
|
+
}
|
|
173
|
+
|
|
174
|
+
setPsm(id: number, psm: number) {
|
|
175
|
+
this.psm[id] = Math.min(psm, 255);
|
|
176
|
+
}
|
|
177
|
+
|
|
178
|
+
incInactRounds(id: number) {
|
|
179
|
+
this.inactRounds[id] = (this.inactRounds[id] + 1) & 255;
|
|
180
|
+
}
|
|
181
|
+
|
|
182
|
+
shrink(id: number, numLits: number) {
|
|
183
|
+
if (numLits < this.size[id]) {
|
|
184
|
+
this.size[id] = numLits;
|
|
185
|
+
this.markStrengthened(id);
|
|
186
|
+
}
|
|
187
|
+
}
|
|
188
|
+
|
|
189
|
+
restore(id: number, numLits: number) {
|
|
190
|
+
this.size[id] = numLits;
|
|
191
|
+
}
|
|
192
|
+
|
|
193
|
+
elim(id: number, lit: number) {
|
|
194
|
+
const base = this.start[id];
|
|
195
|
+
const size = this.size[id];
|
|
196
|
+
let index = 0;
|
|
197
|
+
while (this.lits[base + index] !== lit) index++;
|
|
198
|
+
for (index++; index < size; index++) this.lits[base + index - 1] = this.lits[base + index];
|
|
199
|
+
this.lits[base + size - 1] = lit;
|
|
200
|
+
this.size[id] = size - 1;
|
|
201
|
+
this.markStrengthened(id);
|
|
202
|
+
}
|
|
203
|
+
}
|
|
@@ -0,0 +1,94 @@
|
|
|
1
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
2
|
+
import type { Solver } from "./solver";
|
|
3
|
+
import { WATCH_EXT_CONSTRAINT } from "./watch-list";
|
|
4
|
+
|
|
5
|
+
export class Cleaner {
|
|
6
|
+
private lastNumUnits = 0;
|
|
7
|
+
private cleanupCounter = 0;
|
|
8
|
+
|
|
9
|
+
constructor(private solver: Solver) {}
|
|
10
|
+
|
|
11
|
+
dec() {
|
|
12
|
+
this.cleanupCounter--;
|
|
13
|
+
}
|
|
14
|
+
|
|
15
|
+
private cleanupWatches() {
|
|
16
|
+
const solver = this.solver;
|
|
17
|
+
for (let lit = 0; lit < solver.watches.length; lit++) {
|
|
18
|
+
const wlist = solver.watches[lit];
|
|
19
|
+
if (solver.value(lit) !== L_UNDEF) {
|
|
20
|
+
wlist.finalize();
|
|
21
|
+
continue;
|
|
22
|
+
}
|
|
23
|
+
let next = 0;
|
|
24
|
+
for (let index = 0; index < wlist.size; index++)
|
|
25
|
+
if (
|
|
26
|
+
wlist.getKind(index) === WATCH_EXT_CONSTRAINT ||
|
|
27
|
+
(wlist.isBinary(index) && solver.value(wlist.getLiteral(index)) === L_UNDEF)
|
|
28
|
+
)
|
|
29
|
+
wlist.copy(next++, index);
|
|
30
|
+
wlist.setEnd(next);
|
|
31
|
+
}
|
|
32
|
+
}
|
|
33
|
+
|
|
34
|
+
private cleanupClauses(clauses: number[]) {
|
|
35
|
+
const solver = this.solver;
|
|
36
|
+
const arena = solver.arena;
|
|
37
|
+
let target = 0;
|
|
38
|
+
for (const clause of clauses) {
|
|
39
|
+
const size = arena.size[clause];
|
|
40
|
+
let index = 0;
|
|
41
|
+
let next = 0;
|
|
42
|
+
this.cleanupCounter += size;
|
|
43
|
+
for (; index < size; index++) {
|
|
44
|
+
const value = solver.value(arena.get(clause, index));
|
|
45
|
+
if (value === L_TRUE) break;
|
|
46
|
+
if (value === L_FALSE) continue;
|
|
47
|
+
if (index !== next) arena.swap(clause, next, index);
|
|
48
|
+
next++;
|
|
49
|
+
}
|
|
50
|
+
if (index < size) {
|
|
51
|
+
solver.delClause(clause);
|
|
52
|
+
continue;
|
|
53
|
+
}
|
|
54
|
+
switch (next) {
|
|
55
|
+
case 0:
|
|
56
|
+
solver.setConflict();
|
|
57
|
+
solver.delClause(clause);
|
|
58
|
+
break;
|
|
59
|
+
case 1:
|
|
60
|
+
solver.assignUnit(arena.get(clause, 0));
|
|
61
|
+
solver.delClause(clause);
|
|
62
|
+
break;
|
|
63
|
+
case 2:
|
|
64
|
+
solver.mkBinClause(arena.get(clause, 0), arena.get(clause, 1), arena.isLearned(clause));
|
|
65
|
+
solver.delClause(clause);
|
|
66
|
+
break;
|
|
67
|
+
default:
|
|
68
|
+
solver.shrink(clause, size, next);
|
|
69
|
+
clauses[target++] = clause;
|
|
70
|
+
if (!arena.isFrozen(clause)) solver.attachClause(clause);
|
|
71
|
+
}
|
|
72
|
+
}
|
|
73
|
+
clauses.length = target;
|
|
74
|
+
}
|
|
75
|
+
|
|
76
|
+
run(isForced: boolean) {
|
|
77
|
+
const solver = this.solver;
|
|
78
|
+
let trailSize = solver.trail.length;
|
|
79
|
+
solver.propagate(false);
|
|
80
|
+
if (solver.isInconsistent) return false;
|
|
81
|
+
if (this.lastNumUnits === trailSize) return false;
|
|
82
|
+
if (!isForced && this.cleanupCounter > 0) return false;
|
|
83
|
+
this.lastNumUnits = trailSize;
|
|
84
|
+
this.cleanupCounter = 0;
|
|
85
|
+
do {
|
|
86
|
+
trailSize = solver.trail.length;
|
|
87
|
+
this.cleanupWatches();
|
|
88
|
+
this.cleanupClauses(solver.clauses);
|
|
89
|
+
this.cleanupClauses(solver.learned);
|
|
90
|
+
solver.propagate(false);
|
|
91
|
+
} while (trailSize < solver.trail.length && !solver.isInconsistent);
|
|
92
|
+
return true;
|
|
93
|
+
}
|
|
94
|
+
}
|
|
@@ -0,0 +1,122 @@
|
|
|
1
|
+
import { SmtTacticError } from "../../../../errors";
|
|
2
|
+
import { UINT_MAX } from "./clause";
|
|
3
|
+
|
|
4
|
+
export const PS_ALWAYS_TRUE = 0;
|
|
5
|
+
export const PS_ALWAYS_FALSE = 1;
|
|
6
|
+
export const PS_BASIC_CACHING = 2;
|
|
7
|
+
export const PS_SAT_CACHING = 3;
|
|
8
|
+
export const PS_FROZEN = 5;
|
|
9
|
+
export const PS_RANDOM = 6;
|
|
10
|
+
|
|
11
|
+
export const RS_GEOMETRIC = 0;
|
|
12
|
+
export const RS_LUBY = 1;
|
|
13
|
+
export const RS_EMA = 2;
|
|
14
|
+
const RS_STATIC = 3;
|
|
15
|
+
|
|
16
|
+
export const GC_DYN_PSM = 0;
|
|
17
|
+
export const GC_PSM = 1;
|
|
18
|
+
export const GC_GLUE = 2;
|
|
19
|
+
export const GC_GLUE_PSM = 3;
|
|
20
|
+
export const GC_PSM_GLUE = 4;
|
|
21
|
+
|
|
22
|
+
export type SatParams = ReadonlyMap<string, boolean | number | string>;
|
|
23
|
+
|
|
24
|
+
const PHASES = new Map([
|
|
25
|
+
["always_false", PS_ALWAYS_FALSE],
|
|
26
|
+
["always_true", PS_ALWAYS_TRUE],
|
|
27
|
+
["basic_caching", PS_BASIC_CACHING],
|
|
28
|
+
["caching", PS_SAT_CACHING],
|
|
29
|
+
["random", PS_RANDOM],
|
|
30
|
+
["frozen", PS_FROZEN],
|
|
31
|
+
]);
|
|
32
|
+
|
|
33
|
+
const RESTARTS = new Map([
|
|
34
|
+
["luby", RS_LUBY],
|
|
35
|
+
["geometric", RS_GEOMETRIC],
|
|
36
|
+
["ema", RS_EMA],
|
|
37
|
+
["static", RS_STATIC],
|
|
38
|
+
]);
|
|
39
|
+
|
|
40
|
+
const GCS = new Map([
|
|
41
|
+
["dyn_psm", GC_DYN_PSM],
|
|
42
|
+
["glue_psm", GC_GLUE_PSM],
|
|
43
|
+
["glue", GC_GLUE],
|
|
44
|
+
["psm", GC_PSM],
|
|
45
|
+
["psm_glue", GC_PSM_GLUE],
|
|
46
|
+
]);
|
|
47
|
+
|
|
48
|
+
export const getNumber = (params: SatParams, name: string, defaultValue: number) => {
|
|
49
|
+
const value = params.get(name);
|
|
50
|
+
return typeof value === "number" ? value : defaultValue;
|
|
51
|
+
};
|
|
52
|
+
|
|
53
|
+
export const getBool = (params: SatParams, name: string, defaultValue: boolean) => {
|
|
54
|
+
const value = params.get(name);
|
|
55
|
+
return typeof value === "boolean" ? value : defaultValue;
|
|
56
|
+
};
|
|
57
|
+
|
|
58
|
+
const getSymbol = <Value>(
|
|
59
|
+
params: SatParams,
|
|
60
|
+
name: string,
|
|
61
|
+
defaultValue: string,
|
|
62
|
+
values: Map<string, Value>,
|
|
63
|
+
message: string,
|
|
64
|
+
) => {
|
|
65
|
+
const value = values.get(String(params.get(name) ?? defaultValue));
|
|
66
|
+
if (value === undefined) throw new SmtTacticError(message);
|
|
67
|
+
return value;
|
|
68
|
+
};
|
|
69
|
+
|
|
70
|
+
export const getSatConfig = (params: SatParams) => ({
|
|
71
|
+
restart: getSymbol(
|
|
72
|
+
params,
|
|
73
|
+
"restart",
|
|
74
|
+
"ema",
|
|
75
|
+
RESTARTS,
|
|
76
|
+
"invalid restart strategy. Use ema (default), luby, geometric, static",
|
|
77
|
+
),
|
|
78
|
+
fastGlueAvg: getNumber(params, "restart.emafastglue", 0.03),
|
|
79
|
+
slowGlueAvg: getNumber(params, "restart.emaslowglue", 1e-5),
|
|
80
|
+
restartMargin: getNumber(params, "restart.margin", 1.1),
|
|
81
|
+
isRestartFast: getBool(params, "restart.fast", true),
|
|
82
|
+
phase: getSymbol(
|
|
83
|
+
params,
|
|
84
|
+
"phase",
|
|
85
|
+
"caching",
|
|
86
|
+
PHASES,
|
|
87
|
+
"invalid phase selection strategy: always_false, always_true, basic_caching, caching, random",
|
|
88
|
+
),
|
|
89
|
+
rephaseBase: getNumber(params, "rephase.base", 1000),
|
|
90
|
+
searchSatConflicts: getNumber(params, "search.sat.conflicts", 400),
|
|
91
|
+
searchUnsatConflicts: getNumber(params, "search.unsat.conflicts", 400),
|
|
92
|
+
restartInitial: getNumber(params, "restart.initial", 2),
|
|
93
|
+
restartFactor: getNumber(params, "restart.factor", 1.5),
|
|
94
|
+
restartMax: getNumber(params, "restart.max", UINT_MAX),
|
|
95
|
+
inprocessMax: getNumber(params, "inprocess.max", UINT_MAX),
|
|
96
|
+
randomFreq: getNumber(params, "random_freq", 0.01),
|
|
97
|
+
randomSeed: getNumber(params, "random_seed", 0),
|
|
98
|
+
burstSearch: getNumber(params, "burst_search", 100),
|
|
99
|
+
isEnablingPreSimplify: getBool(params, "enable_pre_simplify", false),
|
|
100
|
+
maxConflicts: getNumber(params, "max_conflicts", UINT_MAX),
|
|
101
|
+
nextSimplify1: getNumber(params, "next_simplify", 90000),
|
|
102
|
+
simplifyMult2: getNumber(params, "simplify_mult2", 1.5),
|
|
103
|
+
simplifyMax: getNumber(params, "simplify_max", 1000000),
|
|
104
|
+
simplifyDelay: getNumber(params, "simplify.delay", 0),
|
|
105
|
+
gcStrategy: getSymbol(params, "gc", "glue_psm", GCS, "invalid gc strategy"),
|
|
106
|
+
gcInitial: getNumber(params, "gc.initial", 20000),
|
|
107
|
+
gcIncrement: getNumber(params, "gc.increment", 500),
|
|
108
|
+
gcSmallLbd: getNumber(params, "gc.small_lbd", 3),
|
|
109
|
+
gcK: Math.min(255, getNumber(params, "gc.k", 7)),
|
|
110
|
+
isGcBurst: getBool(params, "gc.burst", false),
|
|
111
|
+
isGcDefrag: getBool(params, "gc.defrag", true),
|
|
112
|
+
isForcingCleanup: getBool(params, "force_cleanup", false),
|
|
113
|
+
backtrackScopes: getNumber(params, "backtrack.scopes", 100),
|
|
114
|
+
backtrackInitConflicts: getNumber(params, "backtrack.conflicts", 4000),
|
|
115
|
+
isMinimizingLemmas: getBool(params, "minimize_lemmas", true),
|
|
116
|
+
isDynSubRes: getBool(params, "dyn_sub_res", true),
|
|
117
|
+
variableDecay: getNumber(params, "variable_decay", 110),
|
|
118
|
+
isScc: getBool(params, "scc", true),
|
|
119
|
+
isSccTr: getBool(params, "scc.tr", true),
|
|
120
|
+
});
|
|
121
|
+
|
|
122
|
+
export type SatConfig = ReturnType<typeof getSatConfig>;
|
|
@@ -0,0 +1,203 @@
|
|
|
1
|
+
import { SmtUnsupportedError } from "../../../../errors";
|
|
2
|
+
import { getIdentityHash, ObjHashtable } from "../hashtable";
|
|
3
|
+
import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
|
|
4
|
+
import {
|
|
5
|
+
JUSTIFICATION_BINARY,
|
|
6
|
+
JUSTIFICATION_CLAUSE,
|
|
7
|
+
JUSTIFICATION_NONE,
|
|
8
|
+
type Solver,
|
|
9
|
+
} from "./solver";
|
|
10
|
+
|
|
11
|
+
// tracked_uint_set: an insertion-ordered set whose removal moves the last element into the gap.
|
|
12
|
+
class TrackedSet {
|
|
13
|
+
readonly items: number[] = [];
|
|
14
|
+
private isIn = new Set<number>();
|
|
15
|
+
|
|
16
|
+
constructor(values: readonly number[] = []) {
|
|
17
|
+
for (const value of values) this.insert(value);
|
|
18
|
+
}
|
|
19
|
+
|
|
20
|
+
insert(value: number) {
|
|
21
|
+
if (this.isIn.has(value)) return;
|
|
22
|
+
this.isIn.add(value);
|
|
23
|
+
this.items.push(value);
|
|
24
|
+
}
|
|
25
|
+
|
|
26
|
+
has(value: number) {
|
|
27
|
+
return this.isIn.has(value);
|
|
28
|
+
}
|
|
29
|
+
|
|
30
|
+
remove(value: number) {
|
|
31
|
+
if (!this.isIn.delete(value)) return;
|
|
32
|
+
const index = this.items.lastIndexOf(value);
|
|
33
|
+
this.items[index] = this.items[this.items.length - 1];
|
|
34
|
+
this.items.pop();
|
|
35
|
+
}
|
|
36
|
+
}
|
|
37
|
+
|
|
38
|
+
class ConsequenceFinder {
|
|
39
|
+
private antecedents = new Map<number, ObjHashtable>();
|
|
40
|
+
private todo: number[] = [];
|
|
41
|
+
readonly consequences: number[][] = [];
|
|
42
|
+
|
|
43
|
+
constructor(private readonly solver: Solver) {}
|
|
44
|
+
|
|
45
|
+
private checkDomain(lit: number) {
|
|
46
|
+
if (this.antecedents.has(lit >> 1)) return true;
|
|
47
|
+
this.todo.push(lit);
|
|
48
|
+
return false;
|
|
49
|
+
}
|
|
50
|
+
|
|
51
|
+
private addAntecedents(target: ObjHashtable, lit: number) {
|
|
52
|
+
for (const index of this.antecedents.get(lit >> 1) ?? []) target.add(index);
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
private extractAssumptions(lit: number, premises: ObjHashtable) {
|
|
56
|
+
const solver = this.solver;
|
|
57
|
+
const boolVar = lit >> 1;
|
|
58
|
+
const kind = solver.justKind[boolVar];
|
|
59
|
+
const val = solver.justVal[boolVar];
|
|
60
|
+
if (kind === JUSTIFICATION_NONE) return true;
|
|
61
|
+
if (kind === JUSTIFICATION_BINARY) {
|
|
62
|
+
if (!this.checkDomain(val ^ 1)) return false;
|
|
63
|
+
this.addAntecedents(premises, val);
|
|
64
|
+
return true;
|
|
65
|
+
}
|
|
66
|
+
if (kind !== JUSTIFICATION_CLAUSE)
|
|
67
|
+
throw new SmtUnsupportedError("consequences of external SAT constraints");
|
|
68
|
+
let isAllFound = true;
|
|
69
|
+
for (let index = 0; index < solver.arena.size[val]; index++) {
|
|
70
|
+
const other = solver.arena.get(val, index);
|
|
71
|
+
if (other === lit) continue;
|
|
72
|
+
if (this.checkDomain(other ^ 1) && isAllFound) this.addAntecedents(premises, other);
|
|
73
|
+
else isAllFound = false;
|
|
74
|
+
}
|
|
75
|
+
return isAllFound;
|
|
76
|
+
}
|
|
77
|
+
|
|
78
|
+
private extractFixedConsequence1(lit: number, assumptions: TrackedSet, unfixed: TrackedSet) {
|
|
79
|
+
if (this.antecedents.has(lit >> 1)) return true;
|
|
80
|
+
const premises = new ObjHashtable(getIdentityHash);
|
|
81
|
+
if (assumptions.has(lit)) premises.add(lit);
|
|
82
|
+
else {
|
|
83
|
+
if (!this.extractAssumptions(lit, premises)) return false;
|
|
84
|
+
this.solver.addAssumption(lit);
|
|
85
|
+
}
|
|
86
|
+
if (unfixed.has(lit >> 1)) {
|
|
87
|
+
this.consequences.push([lit, ...premises]);
|
|
88
|
+
unfixed.remove(lit >> 1);
|
|
89
|
+
}
|
|
90
|
+
this.antecedents.set(lit >> 1, premises);
|
|
91
|
+
return true;
|
|
92
|
+
}
|
|
93
|
+
|
|
94
|
+
private extractFixedConsequence(lit: number, assumptions: TrackedSet, unfixed: TrackedSet) {
|
|
95
|
+
this.todo.push(lit);
|
|
96
|
+
while (this.todo.length > 0)
|
|
97
|
+
if (this.extractFixedConsequence1(this.todo[this.todo.length - 1], assumptions, unfixed))
|
|
98
|
+
this.todo.pop();
|
|
99
|
+
}
|
|
100
|
+
|
|
101
|
+
private extractFixedConsequences(
|
|
102
|
+
unfixedLits: TrackedSet,
|
|
103
|
+
assumptions: TrackedSet,
|
|
104
|
+
unfixedVars: TrackedSet,
|
|
105
|
+
) {
|
|
106
|
+
const solver = this.solver;
|
|
107
|
+
for (const lit of unfixedLits.items)
|
|
108
|
+
if (solver.lvl(lit) <= 1 && solver.value(lit) === L_TRUE)
|
|
109
|
+
this.extractFixedConsequence(lit, assumptions, unfixedVars);
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
private deleteUnfixed(unfixedLits: TrackedSet, unfixedVars: TrackedSet) {
|
|
113
|
+
const kept = new TrackedSet();
|
|
114
|
+
for (const lit of unfixedLits.items)
|
|
115
|
+
if (this.solver.value(lit) === L_TRUE) kept.insert(lit);
|
|
116
|
+
else unfixedVars.remove(lit >> 1);
|
|
117
|
+
return kept;
|
|
118
|
+
}
|
|
119
|
+
|
|
120
|
+
private updateUnfixedLiterals(unfixedLits: TrackedSet, unfixedVars: TrackedSet) {
|
|
121
|
+
for (const lit of unfixedLits.items.filter((item) => !unfixedVars.has(item >> 1)))
|
|
122
|
+
unfixedLits.remove(lit);
|
|
123
|
+
}
|
|
124
|
+
|
|
125
|
+
run(asms: readonly number[], lits: readonly number[]) {
|
|
126
|
+
const solver = this.solver;
|
|
127
|
+
let unfixedLits = new TrackedSet(lits);
|
|
128
|
+
const assumptions = new TrackedSet(asms);
|
|
129
|
+
const unfixedVars = new TrackedSet(lits.map((lit) => lit >> 1));
|
|
130
|
+
solver.popToBaseLevel();
|
|
131
|
+
if (solver.isInconsistent) return L_FALSE;
|
|
132
|
+
solver.initSearch();
|
|
133
|
+
solver.propagate(false);
|
|
134
|
+
if (solver.isInconsistent) return L_FALSE;
|
|
135
|
+
solver.initAssumptions(asms.length > 0 ? asms : [2 * solver.mkVar(true)]);
|
|
136
|
+
solver.propagate(false);
|
|
137
|
+
if (solver.checkInconsistent()) return L_FALSE;
|
|
138
|
+
this.extractFixedConsequences(unfixedLits, assumptions, unfixedVars);
|
|
139
|
+
this.updateUnfixedLiterals(unfixedLits, unfixedVars);
|
|
140
|
+
while (unfixedLits.items.length > 0) {
|
|
141
|
+
if (solver.scopeLvl > solver.searchLvl) solver.pop(solver.scopeLvl - solver.searchLvl);
|
|
142
|
+
solver.propagate(false);
|
|
143
|
+
solver.checkpoint();
|
|
144
|
+
let numResolves = 0;
|
|
145
|
+
let status = L_TRUE;
|
|
146
|
+
for (const lit of unfixedLits.items) {
|
|
147
|
+
if (solver.value(lit) !== L_UNDEF) {
|
|
148
|
+
if (solver.lvl(lit) <= 1 && solver.value(lit) === L_TRUE)
|
|
149
|
+
this.extractFixedConsequence(lit, assumptions, unfixedVars);
|
|
150
|
+
continue;
|
|
151
|
+
}
|
|
152
|
+
solver.push();
|
|
153
|
+
solver.assignScoped(lit ^ 1);
|
|
154
|
+
solver.propagate(false);
|
|
155
|
+
while (solver.isInconsistent) {
|
|
156
|
+
if (!solver.resolveConflict()) {
|
|
157
|
+
solver.isInconsistent = false;
|
|
158
|
+
status = L_UNDEF;
|
|
159
|
+
break;
|
|
160
|
+
}
|
|
161
|
+
solver.propagate(false);
|
|
162
|
+
numResolves++;
|
|
163
|
+
}
|
|
164
|
+
}
|
|
165
|
+
this.extractFixedConsequences(unfixedLits, assumptions, unfixedVars);
|
|
166
|
+
if (status === L_TRUE) {
|
|
167
|
+
if (solver.scopeLvl === solver.searchLvl && numResolves > 0) status = L_UNDEF;
|
|
168
|
+
else {
|
|
169
|
+
status = solver.boundedSearch();
|
|
170
|
+
if (status === L_UNDEF) {
|
|
171
|
+
solver.doRestart(true);
|
|
172
|
+
solver.propagate(false);
|
|
173
|
+
}
|
|
174
|
+
this.extractFixedConsequences(unfixedLits, assumptions, unfixedVars);
|
|
175
|
+
}
|
|
176
|
+
}
|
|
177
|
+
if (status === L_FALSE) solver.isInconsistent = false;
|
|
178
|
+
if (status === L_TRUE) unfixedLits = this.deleteUnfixed(unfixedLits, unfixedVars);
|
|
179
|
+
this.updateUnfixedLiterals(unfixedLits, unfixedVars);
|
|
180
|
+
}
|
|
181
|
+
return L_TRUE;
|
|
182
|
+
}
|
|
183
|
+
}
|
|
184
|
+
|
|
185
|
+
// The SAT solver's get_consequences: each consequence is a fixed literal followed by the
|
|
186
|
+
// assumptions it depends on.
|
|
187
|
+
export const getConsequences = (
|
|
188
|
+
solver: Solver,
|
|
189
|
+
asms: readonly number[],
|
|
190
|
+
vars: readonly number[],
|
|
191
|
+
) => {
|
|
192
|
+
const finder = new ConsequenceFinder(solver);
|
|
193
|
+
const result = solver.isModelCurrent ? L_TRUE : solver.check(asms);
|
|
194
|
+
if (result !== L_TRUE) return { result, consequences: finder.consequences };
|
|
195
|
+
const model = solver.model.slice();
|
|
196
|
+
const lits = vars.flatMap((boolVar) =>
|
|
197
|
+
model[boolVar] === L_TRUE ? [2 * boolVar] : model[boolVar] === L_FALSE ? [2 * boolVar + 1] : [],
|
|
198
|
+
);
|
|
199
|
+
const found = finder.run(asms, lits);
|
|
200
|
+
solver.model = model;
|
|
201
|
+
solver.isModelCurrent = model.length > 0;
|
|
202
|
+
return { result: found, consequences: finder.consequences };
|
|
203
|
+
};
|