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
package/src/prover/ptl/decide.ts
CHANGED
|
@@ -1,68 +1,108 @@
|
|
|
1
|
-
// Decides the text tlapm sends LS4, as LS4 does: unsat when the negated obligation has no model,
|
|
2
|
-
// which proves the obligation.
|
|
3
|
-
|
|
4
|
-
import { TlaSyntaxError } from "../../errors";
|
|
5
1
|
import type { DecideOptions, Verdict } from "../verdict";
|
|
6
|
-
import { getSatisfiability, type PtlFormula } from "./tableau";
|
|
2
|
+
import { getSatisfiability, type BinaryKind, type PtlFormula } from "./tableau";
|
|
7
3
|
|
|
8
|
-
//
|
|
9
|
-
|
|
10
|
-
|
|
11
|
-
|
|
12
|
-
|
|
13
|
-
|
|
14
|
-
|
|
15
|
-
|
|
16
|
-
|
|
17
|
-
|
|
18
|
-
|
|
19
|
-
|
|
20
|
-
|
|
21
|
-
|
|
22
|
-
|
|
23
|
-
|
|
24
|
-
|
|
25
|
-
|
|
26
|
-
|
|
4
|
+
// ptl_to_trp's binary operators, from the loosest.
|
|
5
|
+
const BINARY_LEVELS = [
|
|
6
|
+
new Map<string, BinaryKind>([["until", "Until"]]),
|
|
7
|
+
new Map<string, BinaryKind>([["unless", "Unless"]]),
|
|
8
|
+
new Map<string, BinaryKind>([
|
|
9
|
+
["<=>", "Equiv"],
|
|
10
|
+
["<->", "Equiv"],
|
|
11
|
+
]),
|
|
12
|
+
new Map<string, BinaryKind>([["|", "Or"]]),
|
|
13
|
+
new Map<string, BinaryKind>([
|
|
14
|
+
["=>", "Implies"],
|
|
15
|
+
["->", "Implies"],
|
|
16
|
+
]),
|
|
17
|
+
new Map<string, BinaryKind>([["&", "And"]]),
|
|
18
|
+
];
|
|
19
|
+
|
|
20
|
+
const PREFIX_OPERATORS = new Map<string, "Not" | "Always" | "Eventually" | "Next" | "Past">([
|
|
21
|
+
["~", "Not"],
|
|
22
|
+
["not", "Not"],
|
|
23
|
+
["always", "Always"],
|
|
24
|
+
["sometime", "Eventually"],
|
|
25
|
+
["next", "Next"],
|
|
26
|
+
["alwaysp", "Past"],
|
|
27
|
+
["sometimep", "Past"],
|
|
28
|
+
]);
|
|
29
|
+
|
|
30
|
+
const KEYWORDS = new Set([
|
|
31
|
+
...PREFIX_OPERATORS.keys(),
|
|
32
|
+
...BINARY_LEVELS.flatMap((operators) => [...operators.keys()]),
|
|
33
|
+
"True",
|
|
34
|
+
"False",
|
|
35
|
+
]);
|
|
36
|
+
|
|
37
|
+
const RESERVED = /^(skolem|hidden|constant|NV_V\w*|NVV\w*)$/;
|
|
38
|
+
|
|
39
|
+
const MAX_LS4_IDENTIFIER = 31;
|
|
40
|
+
|
|
41
|
+
// ptl_to_trp and LS4 reach no verdict on text that this reads as undefined.
|
|
42
|
+
const parseLs4 = (text: string): PtlFormula | undefined => {
|
|
43
|
+
const tokens = text.replace(/;.*/g, "").match(/<=>|<->|=>|->|[A-Za-z]\w*|\S/g) ?? [];
|
|
44
|
+
let position = 0;
|
|
45
|
+
const isIdentifier = (token: string | undefined): token is string =>
|
|
46
|
+
token !== undefined && /^[A-Za-z]/.test(token) && !KEYWORDS.has(token) && !RESERVED.test(token);
|
|
47
|
+
const takeList = () => {
|
|
48
|
+
const items: string[] = [];
|
|
49
|
+
for (;;) {
|
|
50
|
+
const token = tokens[position++];
|
|
51
|
+
if (!isIdentifier(token)) return undefined;
|
|
52
|
+
items.push(token);
|
|
53
|
+
if (tokens[position] !== ",") return items;
|
|
54
|
+
position += 1;
|
|
27
55
|
}
|
|
28
|
-
if (token === "~" || token === "not") return { kind: "Not", body: parseUnary() };
|
|
29
|
-
if (token === "always") return { kind: "Always", body: parseUnary() };
|
|
30
|
-
if (token === "sometime") return { kind: "Eventually", body: parseUnary() };
|
|
31
|
-
if (token === "next") return { kind: "Next", body: parseUnary() };
|
|
32
|
-
if (!/^[\w']+$/.test(token))
|
|
33
|
-
throw new TlaSyntaxError(`Expected a formula in LS4 input, found ${token}`);
|
|
34
|
-
return { kind: "Atom", name: token };
|
|
35
56
|
};
|
|
36
|
-
const
|
|
37
|
-
const
|
|
38
|
-
|
|
39
|
-
|
|
40
|
-
|
|
57
|
+
const parsePrefix = (): PtlFormula | undefined => {
|
|
58
|
+
const token = tokens[position++];
|
|
59
|
+
if (token === undefined) return undefined;
|
|
60
|
+
const prefix = PREFIX_OPERATORS.get(token);
|
|
61
|
+
if (prefix !== undefined) {
|
|
62
|
+
const body = parsePrefix();
|
|
63
|
+
// ptl_to_trp does not translate the past operators.
|
|
64
|
+
return body === undefined || prefix === "Past" ? undefined : { kind: prefix, body };
|
|
41
65
|
}
|
|
42
|
-
|
|
43
|
-
|
|
44
|
-
|
|
45
|
-
|
|
46
|
-
|
|
47
|
-
|
|
48
|
-
|
|
66
|
+
if (token === "!" || token === "?") {
|
|
67
|
+
if (tokens[position++] !== "[") return undefined;
|
|
68
|
+
const variables = takeList();
|
|
69
|
+
// foyacc.mly checks only that the last variable of the list is uppercase.
|
|
70
|
+
return variables !== undefined &&
|
|
71
|
+
/^[A-Z]/.test(variables[variables.length - 1]) &&
|
|
72
|
+
tokens[position++] === "]"
|
|
73
|
+
? parsePrefix()
|
|
74
|
+
: undefined;
|
|
75
|
+
}
|
|
76
|
+
if (token === "(") {
|
|
77
|
+
const inner = parseBinary(0);
|
|
78
|
+
return tokens[position++] === ")" ? inner : undefined;
|
|
79
|
+
}
|
|
80
|
+
if (token === "True" || token === "False") return { kind: "Constant", value: token === "True" };
|
|
81
|
+
// LS4 reads no predicate with arguments and no identifier longer than 31 characters.
|
|
82
|
+
return isIdentifier(token) && tokens[position] !== "(" && token.length <= MAX_LS4_IDENTIFIER
|
|
83
|
+
? { kind: "Atom", name: token }
|
|
84
|
+
: undefined;
|
|
49
85
|
};
|
|
50
|
-
const
|
|
51
|
-
const
|
|
52
|
-
if (
|
|
53
|
-
|
|
54
|
-
|
|
86
|
+
const parseOperators = (level: number, left: PtlFormula | undefined): PtlFormula | undefined => {
|
|
87
|
+
const kind = BINARY_LEVELS[level].get(tokens[position] ?? "");
|
|
88
|
+
if (left === undefined || kind === undefined) return left;
|
|
89
|
+
position += 1;
|
|
90
|
+
const right = parseBinary(level + 1);
|
|
91
|
+
return right === undefined ? undefined : parseOperators(level, { kind, left, right });
|
|
55
92
|
};
|
|
56
|
-
const
|
|
57
|
-
|
|
58
|
-
|
|
59
|
-
return formula;
|
|
93
|
+
const parseBinary = (level: number): PtlFormula | undefined =>
|
|
94
|
+
level === BINARY_LEVELS.length ? parsePrefix() : parseOperators(level, parseBinary(level + 1));
|
|
95
|
+
const formula = parseBinary(0);
|
|
96
|
+
return position < tokens.length ? undefined : formula;
|
|
60
97
|
};
|
|
61
98
|
|
|
62
99
|
export const decidePtl = (text: string, options: DecideOptions): Verdict => {
|
|
63
100
|
const deadline = performance.now() + options.timeLimitMs;
|
|
64
|
-
|
|
65
|
-
|
|
66
|
-
|
|
67
|
-
|
|
101
|
+
const formula = parseLs4(text);
|
|
102
|
+
return formula === undefined
|
|
103
|
+
? "unknown"
|
|
104
|
+
: getSatisfiability(
|
|
105
|
+
formula,
|
|
106
|
+
() => options.signal?.aborted === true || performance.now() > deadline,
|
|
107
|
+
);
|
|
68
108
|
};
|
package/src/prover/ptl/encode.ts
CHANGED
|
@@ -1,8 +1,3 @@
|
|
|
1
|
-
// tlapm's PTL backend up to the text it sends LS4 (Pltl.process_obligation, Prep.flatten, and
|
|
2
|
-
// Ls4's printer): temporal operators reduce to [], <> and prime, assumptions that hold
|
|
3
|
-
// always get a [], and every other subformula becomes an atom named by a hash of its printed form.
|
|
4
|
-
// The text is the negated obligation.
|
|
5
|
-
|
|
6
1
|
import {
|
|
7
2
|
bumpBy,
|
|
8
3
|
shift,
|
|
@@ -27,9 +22,6 @@ import { getLevelInfo } from "../../obligations/levels";
|
|
|
27
22
|
import { expandAction, expandFairness, expandLeadsto, getTime } from "../../obligations/temporal";
|
|
28
23
|
import { getHashName, LEVEL_NUMBER_PREFIXES, LEVEL_PREFIXES } from "../prep/action";
|
|
29
24
|
|
|
30
|
-
// Coalesce.rename_with_loc: each declared name gets its kind in front, or its level for a definition,
|
|
31
|
-
// as in VARIABLE_x_ and CONSTANT_i_, so atoms print with the names tlapm hashes. A variable a
|
|
32
|
-
// temporal quantifier binds keeps its name.
|
|
33
25
|
const renameSequent = (scope: Scope | undefined, sequent: Sequent): Sequent => {
|
|
34
26
|
const [inner, context] = mapAccumulate(
|
|
35
27
|
scope,
|
|
@@ -93,40 +85,31 @@ const renameDeclarations = (scope: Scope | undefined, expression: Expr): Expr =>
|
|
|
93
85
|
}
|
|
94
86
|
};
|
|
95
87
|
|
|
96
|
-
interface PreparedHyps {
|
|
97
|
-
scope: Scope | undefined;
|
|
98
|
-
substitution: Substitution;
|
|
99
|
-
context: Hyp[];
|
|
100
|
-
}
|
|
101
|
-
|
|
102
|
-
// Pltl.expand_domains and Pltl.box_assumptions: NEW x \in S becomes NEW x and the fact x \in S, and
|
|
103
|
-
// each visible fact that holds always gets a [].
|
|
104
88
|
const prepareHyps = (scope: Scope | undefined, expression: Expr): Expr => {
|
|
105
89
|
if (expression.kind !== "Sequent")
|
|
106
90
|
return mapScoped(scope, expression, prepareHyps, adjoin, "all");
|
|
107
|
-
|
|
91
|
+
let innerScope = scope;
|
|
92
|
+
let substitution: Substitution = shift(0);
|
|
93
|
+
const context: Hyp[] = [];
|
|
108
94
|
const push = (hyp: Hyp) => {
|
|
109
95
|
const prepared =
|
|
110
96
|
hyp.kind === "Fact" && hyp.visibility === "Visible" && hyp.time === "Always"
|
|
111
97
|
? { ...hyp, expression: applyBuiltin("BoxTrue", [hyp.expression], hyp.expression) }
|
|
112
98
|
: hyp;
|
|
113
|
-
|
|
114
|
-
|
|
99
|
+
context.push(prepared);
|
|
100
|
+
innerScope = adjoin(innerScope, prepared);
|
|
115
101
|
};
|
|
116
102
|
for (const original of expression.sequent.context) {
|
|
117
|
-
const hyp = substituteHyp(
|
|
118
|
-
if (hyp.kind !== "Fresh" || !hyp.domain
|
|
103
|
+
const hyp = substituteHyp(substitution, original);
|
|
104
|
+
if (hyp.kind !== "Fresh" || !hyp.domain) {
|
|
119
105
|
push(
|
|
120
|
-
hyp.kind === "Fact"
|
|
121
|
-
? { ...hyp, expression: prepareHyps(state.scope, hyp.expression) }
|
|
122
|
-
: hyp,
|
|
106
|
+
hyp.kind === "Fact" ? { ...hyp, expression: prepareHyps(innerScope, hyp.expression) } : hyp,
|
|
123
107
|
);
|
|
124
|
-
|
|
108
|
+
substitution = bumpBy(1, substitution);
|
|
125
109
|
continue;
|
|
126
110
|
}
|
|
127
|
-
const domain = prepareHyps(
|
|
111
|
+
const domain = prepareHyps(innerScope, hyp.domain);
|
|
128
112
|
push({ ...hyp, domain: undefined });
|
|
129
|
-
// tlapm judges the time of the domain as written, one hypothesis too deep.
|
|
130
113
|
push({
|
|
131
114
|
kind: "Fact",
|
|
132
115
|
expression: applyBuiltin(
|
|
@@ -135,19 +118,19 @@ const prepareHyps = (scope: Scope | undefined, expression: Expr): Expr => {
|
|
|
135
118
|
domain,
|
|
136
119
|
),
|
|
137
120
|
visibility: hyp.domainVisibility,
|
|
138
|
-
time: hyp.level === "Constant" ? getTime(
|
|
121
|
+
time: hyp.level === "Constant" ? getTime(innerScope, shiftExpr(1, domain)) : "Now",
|
|
139
122
|
location: hyp.location,
|
|
140
123
|
});
|
|
141
|
-
|
|
124
|
+
substitution = {
|
|
142
125
|
kind: "Compose",
|
|
143
126
|
outer: shift(1),
|
|
144
|
-
inner: bumpBy(1,
|
|
127
|
+
inner: bumpBy(1, substitution),
|
|
145
128
|
};
|
|
146
129
|
}
|
|
147
|
-
const active = substituteExpr(
|
|
130
|
+
const active = substituteExpr(substitution, expression.sequent.active);
|
|
148
131
|
return {
|
|
149
132
|
...expression,
|
|
150
|
-
sequent: { context
|
|
133
|
+
sequent: { context, active: prepareHyps(innerScope, active) },
|
|
151
134
|
};
|
|
152
135
|
};
|
|
153
136
|
|
|
@@ -166,8 +149,6 @@ const UNARY: Partial<Record<Builtin, string>> = {
|
|
|
166
149
|
Prime: "next",
|
|
167
150
|
};
|
|
168
151
|
|
|
169
|
-
// Prep.flatten, which tlapm applies after Pltl.process_obligation has made every equality an atom:
|
|
170
|
-
// TRUE drops out of the conjunctions of each visible fact, and a fact left with nothing disappears.
|
|
171
152
|
const removeTrue = (expression: Expr): Expr | undefined => {
|
|
172
153
|
if (expression.kind === "Internal" && expression.builtin === "TRUE") return undefined;
|
|
173
154
|
if (expression.kind === "List" && expression.bullet !== "Or") {
|
|
@@ -189,10 +170,7 @@ const removeTrue = (expression: Expr): Expr | undefined => {
|
|
|
189
170
|
|
|
190
171
|
const TRUE_TEXT = "(cc | ~ cc)";
|
|
191
172
|
|
|
192
|
-
// The text tlapm sends LS4 for an obligation after Prep.normalize_expand.
|
|
193
173
|
export const encodePtl = (sequent: Sequent): string => {
|
|
194
|
-
// Ls4's printer. A sequent becomes an implication from its visible facts, joined by &, and
|
|
195
|
-
// Prep.flatten applies to the facts of the outermost one.
|
|
196
174
|
const print = (hyps: Hyp[], expression: Expr, isOutermost = false): string => {
|
|
197
175
|
const recurse = (inner: Expr) => print(hyps, inner);
|
|
198
176
|
switch (expression.kind) {
|
|
@@ -235,7 +213,6 @@ export const encodePtl = (sequent: Sequent): string => {
|
|
|
235
213
|
return facts.length === 0 ? goal : `(${facts.join(" & ")} -> ${goal})`;
|
|
236
214
|
}
|
|
237
215
|
}
|
|
238
|
-
// Pltl.coalesce_fol names an atom as Coalesce does.
|
|
239
216
|
return getHashName(hyps, expression);
|
|
240
217
|
};
|
|
241
218
|
const renamed = renameDeclarations(undefined, { kind: "Sequent", sequent });
|
package/src/prover/ptl/sat.ts
CHANGED
|
@@ -1,9 +1,3 @@
|
|
|
1
|
-
// A conflict-driven clause learning SAT solver for the clauses of one tableau node. A literal is a
|
|
2
|
-
// variable number, negated when below zero. The solver keeps what it learns across calls, which add
|
|
3
|
-
// clauses or assume literals. It decides each open variable false first, so a model sets few
|
|
4
|
-
// variables, and a model holds 1 for each true variable and -1 for each false one. It gives up at
|
|
5
|
-
// the first conflict after isExpired turns true.
|
|
6
|
-
|
|
7
1
|
const getIndex = (literal: number) => (literal > 0 ? 2 * literal : -2 * literal + 1);
|
|
8
2
|
|
|
9
3
|
export const createSolver = (variableCount: number, isExpired: () => boolean) => {
|
|
@@ -15,7 +9,9 @@ export const createSolver = (variableCount: number, isExpired: () => boolean) =>
|
|
|
15
9
|
const watches: number[][][] = Array.from({ length: 2 * variableCount + 2 }, () => []);
|
|
16
10
|
const trail: number[] = [];
|
|
17
11
|
const levelStarts: number[] = [];
|
|
18
|
-
|
|
12
|
+
let head = 0;
|
|
13
|
+
let bump = 1;
|
|
14
|
+
let isUnsatisfiable = false;
|
|
19
15
|
const getValue = (literal: number) => (literal > 0 ? values[literal] : -values[-literal]);
|
|
20
16
|
const assign = (literal: number, reason: number[] | undefined) => {
|
|
21
17
|
const variable = Math.abs(literal);
|
|
@@ -28,11 +24,9 @@ export const createSolver = (variableCount: number, isExpired: () => boolean) =>
|
|
|
28
24
|
watches[getIndex(clause[0])].push(clause);
|
|
29
25
|
watches[getIndex(clause[1])].push(clause);
|
|
30
26
|
};
|
|
31
|
-
// Moves each watch off a literal that turned false, and returns the clause of a conflict. The
|
|
32
|
-
// literal a clause implies sits first in it.
|
|
33
27
|
const propagate = () => {
|
|
34
|
-
for (;
|
|
35
|
-
const falsified = -trail[
|
|
28
|
+
for (; head < trail.length; head++) {
|
|
29
|
+
const falsified = -trail[head];
|
|
36
30
|
const watching = watches[getIndex(falsified)];
|
|
37
31
|
for (let position = 0; position < watching.length; position++) {
|
|
38
32
|
const clause = watching[position];
|
|
@@ -59,39 +53,38 @@ export const createSolver = (variableCount: number, isExpired: () => boolean) =>
|
|
|
59
53
|
const size = levelStarts[level];
|
|
60
54
|
while (trail.length > size) values[Math.abs(trail.pop() ?? 0)] = 0;
|
|
61
55
|
levelStarts.length = level;
|
|
62
|
-
|
|
56
|
+
head = trail.length;
|
|
63
57
|
};
|
|
64
|
-
// Resolves the conflict back to the first literal of the current level that all its paths pass
|
|
65
|
-
// through, and returns the learned clause with that literal first.
|
|
66
58
|
const analyze = (conflict: number[]) => {
|
|
67
59
|
const learned = [0];
|
|
68
60
|
const current = levelStarts.length;
|
|
69
|
-
|
|
61
|
+
let pendingCount = 0;
|
|
62
|
+
let resolved = 0;
|
|
63
|
+
let trailIndex = trail.length - 1;
|
|
70
64
|
for (let clause: number[] | undefined = conflict; ;) {
|
|
71
|
-
for (const literal of clause?.slice(
|
|
65
|
+
for (const literal of clause?.slice(resolved === 0 ? 0 : 1) ?? []) {
|
|
72
66
|
const variable = Math.abs(literal);
|
|
73
67
|
if (seen[variable] || levels[variable] === 0) continue;
|
|
74
68
|
seen[variable] = 1;
|
|
75
|
-
activities[variable] +=
|
|
76
|
-
if (levels[variable] === current)
|
|
69
|
+
activities[variable] += bump;
|
|
70
|
+
if (levels[variable] === current) pendingCount++;
|
|
77
71
|
else learned.push(literal);
|
|
78
72
|
}
|
|
79
|
-
while (!seen[Math.abs(trail[
|
|
80
|
-
|
|
81
|
-
seen[Math.abs(
|
|
82
|
-
clause = reasons[Math.abs(
|
|
83
|
-
if (--
|
|
73
|
+
while (!seen[Math.abs(trail[trailIndex])]) trailIndex--;
|
|
74
|
+
resolved = trail[trailIndex--];
|
|
75
|
+
seen[Math.abs(resolved)] = 0;
|
|
76
|
+
clause = reasons[Math.abs(resolved)];
|
|
77
|
+
if (--pendingCount === 0) break;
|
|
84
78
|
}
|
|
85
|
-
learned[0] = -
|
|
79
|
+
learned[0] = -resolved;
|
|
86
80
|
learned.forEach((literal) => (seen[Math.abs(literal)] = 0));
|
|
87
|
-
|
|
81
|
+
bump *= 1.05;
|
|
88
82
|
return learned;
|
|
89
83
|
};
|
|
90
|
-
// Literals false for good are dropped, since the solver adds clauses only at level 0.
|
|
91
84
|
const addClause = (clause: number[]) => {
|
|
92
85
|
backtrack(0);
|
|
93
86
|
const literals = [...new Set(clause)];
|
|
94
|
-
if (
|
|
87
|
+
if (isUnsatisfiable || literals.some((literal) => getValue(literal) > 0)) return;
|
|
95
88
|
if (literals.some((literal) => literals.includes(-literal))) return;
|
|
96
89
|
const open = literals.filter((literal) => getValue(literal) === 0);
|
|
97
90
|
if (open.length > 1) {
|
|
@@ -99,21 +92,20 @@ export const createSolver = (variableCount: number, isExpired: () => boolean) =>
|
|
|
99
92
|
return;
|
|
100
93
|
}
|
|
101
94
|
if (open.length === 0) {
|
|
102
|
-
|
|
95
|
+
isUnsatisfiable = true;
|
|
103
96
|
return;
|
|
104
97
|
}
|
|
105
98
|
assign(open[0], undefined);
|
|
106
|
-
if (propagate())
|
|
99
|
+
if (propagate()) isUnsatisfiable = true;
|
|
107
100
|
};
|
|
108
|
-
// A model of the clauses in which every assumed literal holds, or unsat when there is none.
|
|
109
101
|
const solve = (assumptions: number[]): Int8Array | "unsat" | "unknown" => {
|
|
110
102
|
backtrack(0);
|
|
111
|
-
if (
|
|
103
|
+
if (isUnsatisfiable) return "unsat";
|
|
112
104
|
for (;;) {
|
|
113
105
|
const conflict = propagate();
|
|
114
106
|
if (conflict) {
|
|
115
107
|
if (levelStarts.length === 0) {
|
|
116
|
-
|
|
108
|
+
isUnsatisfiable = true;
|
|
117
109
|
return "unsat";
|
|
118
110
|
}
|
|
119
111
|
if (isExpired()) return "unknown";
|
|
@@ -1,22 +1,20 @@
|
|
|
1
|
-
// Decides satisfiability of propositional linear temporal logic over infinite traces, the logic LS4
|
|
2
|
-
// decides. A tableau node is the set of formulas that must hold now. A SAT call per step picks the
|
|
3
|
-
// atoms and the formulas the next node must hold, and the formula is satisfiable when a reachable
|
|
4
|
-
// strongly connected component can fulfill every eventuality it postpones.
|
|
5
|
-
|
|
6
1
|
import type { Verdict } from "../verdict";
|
|
7
2
|
import { createSolver } from "./sat";
|
|
8
3
|
|
|
4
|
+
export type BinaryKind = "And" | "Or" | "Implies" | "Equiv" | "Until" | "Unless";
|
|
5
|
+
|
|
9
6
|
export type PtlFormula =
|
|
10
7
|
| { kind: "Atom"; name: string }
|
|
8
|
+
| { kind: "Constant"; value: boolean }
|
|
11
9
|
| { kind: "Not" | "Next" | "Always" | "Eventually"; body: PtlFormula }
|
|
12
|
-
| { kind:
|
|
10
|
+
| { kind: BinaryKind; left: PtlFormula; right: PtlFormula };
|
|
13
11
|
|
|
14
|
-
// Formulas in negation normal form, numbered so that equal formulas share a number.
|
|
15
12
|
type Normal =
|
|
16
13
|
| { kind: "Constant"; value: boolean }
|
|
17
14
|
| { kind: "Literal"; atom: string; isPositive: boolean }
|
|
18
15
|
| { kind: "And" | "Or"; children: number[] }
|
|
19
|
-
| { kind: "Next" | "Always" | "Eventually"; body: number }
|
|
16
|
+
| { kind: "Next" | "Always" | "Eventually"; body: number }
|
|
17
|
+
| { kind: "Until" | "Unless"; left: number; right: number };
|
|
20
18
|
|
|
21
19
|
interface Step {
|
|
22
20
|
next: number[];
|
|
@@ -40,19 +38,19 @@ const createTable = () => {
|
|
|
40
38
|
};
|
|
41
39
|
const getConstant = (value: boolean) => intern(String(value), { kind: "Constant", value });
|
|
42
40
|
const getJunction = (kind: "And" | "Or", operands: number[]): number => {
|
|
43
|
-
const
|
|
41
|
+
const isAbsorbing = kind === "Or";
|
|
44
42
|
const children = new Set<number>();
|
|
45
43
|
for (const operand of operands) {
|
|
46
44
|
const normal = normals[operand];
|
|
47
45
|
if (normal.kind === "Constant") {
|
|
48
|
-
if (normal.value ===
|
|
46
|
+
if (normal.value === isAbsorbing) return operand;
|
|
49
47
|
continue;
|
|
50
48
|
}
|
|
51
49
|
if (normal.kind === kind) normal.children.forEach((child) => children.add(child));
|
|
52
50
|
else children.add(operand);
|
|
53
51
|
}
|
|
54
52
|
const sorted = [...children].sort((left, right) => left - right);
|
|
55
|
-
if (sorted.length === 0) return getConstant(!
|
|
53
|
+
if (sorted.length === 0) return getConstant(!isAbsorbing);
|
|
56
54
|
if (sorted.length === 1) return sorted[0];
|
|
57
55
|
return intern(`${kind}(${sorted.join(",")})`, { kind, children: sorted });
|
|
58
56
|
};
|
|
@@ -61,6 +59,8 @@ const createTable = () => {
|
|
|
61
59
|
if (normal.kind === "Constant" || (kind !== "Next" && normal.kind === kind)) return body;
|
|
62
60
|
return intern(`${kind}(${body})`, { kind, body });
|
|
63
61
|
};
|
|
62
|
+
const getUntil = (kind: "Until" | "Unless", left: number, right: number) =>
|
|
63
|
+
intern(`${kind}(${left},${right})`, { kind, left, right });
|
|
64
64
|
const memo = [new WeakMap<PtlFormula, number>(), new WeakMap<PtlFormula, number>()];
|
|
65
65
|
const normalize = (formula: PtlFormula, isNegated: boolean): number => {
|
|
66
66
|
const cache = memo[isNegated ? 1 : 0];
|
|
@@ -74,6 +74,8 @@ const createTable = () => {
|
|
|
74
74
|
atom: formula.name,
|
|
75
75
|
isPositive: !isNegated,
|
|
76
76
|
});
|
|
77
|
+
case "Constant":
|
|
78
|
+
return getConstant(formula.value !== isNegated);
|
|
77
79
|
case "Not":
|
|
78
80
|
return normalize(formula.body, !isNegated);
|
|
79
81
|
case "Next":
|
|
@@ -106,6 +108,15 @@ const createTable = () => {
|
|
|
106
108
|
normalize(formula.right, !isNegated),
|
|
107
109
|
]),
|
|
108
110
|
]);
|
|
111
|
+
case "Until":
|
|
112
|
+
case "Unless": {
|
|
113
|
+
// translate/fofunctions.ml#negate: ~(f until g) is ~g unless (~f & ~g), and dually.
|
|
114
|
+
const kind = (formula.kind === "Until") === isNegated ? "Unless" : "Until";
|
|
115
|
+
const right = normalize(formula.right, isNegated);
|
|
116
|
+
return isNegated
|
|
117
|
+
? getUntil(kind, right, getJunction("And", [normalize(formula.left, true), right]))
|
|
118
|
+
: getUntil(kind, normalize(formula.left, false), right);
|
|
119
|
+
}
|
|
109
120
|
}
|
|
110
121
|
})();
|
|
111
122
|
cache.set(formula, result);
|
|
@@ -114,10 +125,6 @@ const createTable = () => {
|
|
|
114
125
|
return { normals, normalize };
|
|
115
126
|
};
|
|
116
127
|
|
|
117
|
-
// Every way to satisfy the formulas now, keeping only the steps that require the fewest next
|
|
118
|
-
// formulas and leave the fewest eventualities pending. A step that requires more of both can only
|
|
119
|
-
// do what a smaller one can, so dropping it keeps the decision complete. Undefined once isExpired
|
|
120
|
-
// turns true.
|
|
121
128
|
const getSteps = (
|
|
122
129
|
normals: Normal[],
|
|
123
130
|
formulas: number[],
|
|
@@ -128,8 +135,8 @@ const getSteps = (
|
|
|
128
135
|
const nexts = new Map<number, number>();
|
|
129
136
|
const pendings = new Map<number, number>();
|
|
130
137
|
const literals = new Map<number, number>();
|
|
131
|
-
|
|
132
|
-
const createVariable = () => ++
|
|
138
|
+
let variableCount = 0;
|
|
139
|
+
const createVariable = () => ++variableCount;
|
|
133
140
|
const getVariable = <Key>(variables: Map<Key, number>, key: Key) => {
|
|
134
141
|
const existing = variables.get(key);
|
|
135
142
|
if (existing !== undefined) return existing;
|
|
@@ -137,7 +144,6 @@ const getSteps = (
|
|
|
137
144
|
variables.set(key, variable);
|
|
138
145
|
return variable;
|
|
139
146
|
};
|
|
140
|
-
// Plaisted-Greenbaum: a formula's literal implies the formula, which suffices in normal form.
|
|
141
147
|
const encode = (formula: number): number => {
|
|
142
148
|
const cached = literals.get(formula);
|
|
143
149
|
if (cached !== undefined) return cached;
|
|
@@ -177,6 +183,15 @@ const getSteps = (
|
|
|
177
183
|
clauses.push([-variable, body, next], [-next, body, getVariable(pendings, formula)]);
|
|
178
184
|
return variable;
|
|
179
185
|
}
|
|
186
|
+
case "Until":
|
|
187
|
+
case "Unless": {
|
|
188
|
+
const variable = createVariable();
|
|
189
|
+
const right = encode(normal.right);
|
|
190
|
+
const next = getVariable(nexts, formula);
|
|
191
|
+
clauses.push([-variable, right, encode(normal.left)], [-variable, right, next]);
|
|
192
|
+
if (normal.kind === "Until") clauses.push([-next, right, getVariable(pendings, formula)]);
|
|
193
|
+
return variable;
|
|
194
|
+
}
|
|
180
195
|
}
|
|
181
196
|
})();
|
|
182
197
|
literals.set(formula, literal);
|
|
@@ -184,14 +199,12 @@ const getSteps = (
|
|
|
184
199
|
};
|
|
185
200
|
formulas.forEach((formula) => clauses.push([encode(formula)]));
|
|
186
201
|
const choices = [...nexts.values(), ...pendings.values()];
|
|
187
|
-
const solver = createSolver(
|
|
202
|
+
const solver = createSolver(variableCount, isExpired);
|
|
188
203
|
clauses.forEach(solver.addClause);
|
|
189
204
|
const steps: Step[] = [];
|
|
190
205
|
for (;;) {
|
|
191
206
|
const model = solver.solve([]);
|
|
192
207
|
if (typeof model === "string") return model === "unsat" ? steps : undefined;
|
|
193
|
-
// Drops each chosen variable that a model with no other choice can do without. A variable one
|
|
194
|
-
// pass keeps stays needed as the set shrinks, so the set that remains is minimal.
|
|
195
208
|
const minimal = choices.reduce<Int8Array | undefined>((current, choice) => {
|
|
196
209
|
if (current?.[choice] !== 1) return current;
|
|
197
210
|
const unchosen = choices.filter((other) => current[other] !== 1);
|
|
@@ -209,7 +222,6 @@ const getSteps = (
|
|
|
209
222
|
}
|
|
210
223
|
};
|
|
211
224
|
|
|
212
|
-
// Whether the formula is satisfiable, or unknown once isExpired turns true.
|
|
213
225
|
export const getSatisfiability = (formula: PtlFormula, isExpired: () => boolean): Verdict => {
|
|
214
226
|
const table = createTable();
|
|
215
227
|
const nodes: number[][] = [];
|
|
@@ -230,12 +242,12 @@ export const getSatisfiability = (formula: PtlFormula, isExpired: () => boolean)
|
|
|
230
242
|
if (!steps) return "unknown";
|
|
231
243
|
edges.push(steps.map((step) => ({ target: getNode(step.next), pending: step.pending })));
|
|
232
244
|
}
|
|
233
|
-
// Tarjan's algorithm, checking each component as it closes.
|
|
234
245
|
const indices = new Int32Array(nodes.length).fill(-1);
|
|
235
246
|
const lowlinks = new Int32Array(nodes.length);
|
|
236
247
|
const components = new Int32Array(nodes.length).fill(-1);
|
|
237
248
|
const stack: number[] = [];
|
|
238
|
-
|
|
249
|
+
let nextIndex = 0;
|
|
250
|
+
let componentCount = 0;
|
|
239
251
|
const isFair = (component: number) => {
|
|
240
252
|
const inner = edges.flatMap((outgoing, source) =>
|
|
241
253
|
components[source] === component
|
|
@@ -252,9 +264,9 @@ export const getSatisfiability = (formula: PtlFormula, isExpired: () => boolean)
|
|
|
252
264
|
return unfulfilled.length === 0;
|
|
253
265
|
};
|
|
254
266
|
const visit = (node: number): boolean => {
|
|
255
|
-
indices[node] =
|
|
256
|
-
lowlinks[node] =
|
|
257
|
-
|
|
267
|
+
indices[node] = nextIndex;
|
|
268
|
+
lowlinks[node] = nextIndex;
|
|
269
|
+
nextIndex++;
|
|
258
270
|
stack.push(node);
|
|
259
271
|
for (const edge of edges[node]) {
|
|
260
272
|
if (indices[edge.target] === -1) {
|
|
@@ -265,7 +277,7 @@ export const getSatisfiability = (formula: PtlFormula, isExpired: () => boolean)
|
|
|
265
277
|
}
|
|
266
278
|
}
|
|
267
279
|
if (lowlinks[node] !== indices[node]) return false;
|
|
268
|
-
const component =
|
|
280
|
+
const component = componentCount++;
|
|
269
281
|
for (let member = stack.pop(); member !== undefined; member = stack.pop()) {
|
|
270
282
|
components[member] = component;
|
|
271
283
|
if (member === node) break;
|