tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +2 -1
- package/dist/compile.cjs +3 -3
- package/dist/compile.js +1 -1
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +45 -41
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +5 -1
- package/dist/index.d.ts +5 -1
- 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 +2682 -426
- package/dist/prove.js +2679 -423
- package/dist/run.cjs +43 -42
- package/dist/run.js +44 -43
- package/dist/tlapm.cjs +1 -1
- package/dist/tlapm.js +1 -1
- package/dist/transfer.cjs +43 -40
- package/dist/transfer.js +43 -40
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +4 -3
- package/src/bags.ts +46 -28
- package/src/check-trace.ts +2 -16
- package/src/check.ts +349 -91
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/tlapm.ts +424 -62
- package/src/cli/tlc-arguments.ts +2 -2
- package/src/cli/tlc-output.ts +4 -5
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +26 -7
- package/src/cli/xml-exporter.ts +1 -1
- package/src/codegen.ts +9 -5
- package/src/dependencies.ts +72 -11
- package/src/dfid.ts +9 -2
- package/src/environment.ts +65 -36
- package/src/errors.ts +38 -3
- package/src/evaluate.ts +92 -32
- package/src/exit-codes.ts +5 -2
- package/src/instances.ts +5 -5
- package/src/java-overrides.ts +2 -2
- package/src/levels.ts +138 -90
- package/src/lexer.ts +5 -3
- package/src/liveness-checker.ts +572 -204
- package/src/liveness.ts +47 -32
- package/src/obligations/action.ts +10 -6
- package/src/obligations/anonymize.ts +33 -14
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +18 -6
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +22 -17
- package/src/obligations/index.ts +37 -7
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +1 -3
- package/src/obligations/normalize.ts +25 -17
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/pragma.ts +53 -16
- package/src/obligations/printer.ts +48 -18
- package/src/obligations/proof.ts +3 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +17 -7
- package/src/obligations/source.ts +71 -17
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +8 -2
- package/src/parallel.ts +7 -2
- package/src/parser.ts +664 -287
- package/src/pretty-print.ts +1 -1
- package/src/prover/deciders.ts +11 -8
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +71 -41
- 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 +149 -3
- package/src/prover/isabelle/isar/method.ts +506 -198
- package/src/prover/isabelle/isar/proof.ts +570 -14
- package/src/prover/isabelle/isar/rule-cases.ts +226 -0
- package/src/prover/isabelle/isar/theory.ts +479 -69
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +83 -8
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +1 -3
- package/src/prover/isabelle/provers/classical.ts +45 -20
- package/src/prover/isabelle/provers/hypsubst.ts +2 -4
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +63 -4
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +1 -3
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +13 -7
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +4 -11
- package/src/prover/isabelle/pure/search.ts +0 -2
- package/src/prover/isabelle/pure/seq.ts +0 -2
- package/src/prover/isabelle/pure/simplifier.ts +26 -7
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +3 -5
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +1 -2
- package/src/prover/isabelle/tla/context.ts +51 -9
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +40 -1
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +19 -12
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +159 -50
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +343 -65
- package/src/prover/ptl/decide.ts +95 -50
- package/src/prover/ptl/encode.ts +2 -3
- package/src/prover/ptl/tableau.ts +28 -2
- package/src/prover/smt/arithmetic.ts +310 -0
- package/src/prover/smt/axioms.ts +12 -8
- package/src/prover/smt/context.ts +42 -6
- package/src/prover/smt/data.ts +191 -84
- package/src/prover/smt/encode.ts +122 -43
- package/src/prover/smt/extensionality.ts +5 -3
- package/src/prover/smt/flatten.ts +4 -6
- package/src/prover/smt/format.ts +28 -4
- package/src/prover/smt/instances.ts +7 -1
- package/src/prover/smt/layout.ts +91 -0
- package/src/prover/smt/rewrite.ts +483 -116
- 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 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
- package/src/prover/smt/solver/aig-tactic.ts +52 -0
- package/src/prover/smt/solver/aig.ts +889 -0
- package/src/prover/smt/solver/arith-rewriter.ts +613 -6
- 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/asserted-formulas.ts +93 -15
- package/src/prover/smt/solver/ast-lt.ts +165 -11
- package/src/prover/smt/solver/ast-util.ts +160 -2
- package/src/prover/smt/solver/ast.ts +1449 -41
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- 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 +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 +109 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +39 -25
- package/src/prover/smt/solver/check-logic.ts +330 -0
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +533 -114
- package/src/prover/smt/solver/ctx-simplify.ts +21 -12
- 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 +38 -10
- 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 +260 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +6 -7
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- 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 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
- package/src/prover/smt/solver/expr2polynomial.ts +271 -0
- package/src/prover/smt/solver/factor.ts +163 -0
- package/src/prover/smt/solver/fd-solver.ts +267 -0
- package/src/prover/smt/solver/fingerprints.ts +15 -15
- package/src/prover/smt/solver/fix-dl-var.ts +147 -0
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +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 +177 -15
- package/src/prover/smt/solver/goal2nlsat.ts +216 -0
- package/src/prover/smt/solver/guard-set.ts +219 -0
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +30 -16
- package/src/prover/smt/solver/inf-eps.ts +63 -0
- package/src/prover/smt/solver/inj-axiom.ts +101 -0
- package/src/prover/smt/solver/internalizer.ts +109 -36
- package/src/prover/smt/solver/lackr.ts +381 -0
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +268 -0
- package/src/prover/smt/solver/lia2pb.ts +154 -0
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +345 -0
- package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
- package/src/prover/smt/solver/lp/constraints.ts +0 -1
- package/src/prover/smt/solver/lp/containers.ts +7 -2
- package/src/prover/smt/solver/lp/core-solver.ts +18 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +3 -4
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
- package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
- package/src/prover/smt/solver/lp/nex.ts +2 -2
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
- package/src/prover/smt/solver/lp/nla-core.ts +66 -11
- package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
- package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
- package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
- package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
- package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
- package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
- package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
- package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
- package/src/prover/smt/solver/lp/nla-order.ts +0 -2
- package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
- package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
- package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
- package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
- package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
- package/src/prover/smt/solver/lp/nla-types.ts +0 -2
- package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
- package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
- package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
- package/src/prover/smt/solver/lp/pdd.ts +725 -290
- package/src/prover/smt/solver/lp/random-updater.ts +0 -2
- package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
- package/src/prover/smt/solver/lp/union-find.ts +7 -2
- package/src/prover/smt/solver/macro-finder.ts +530 -0
- package/src/prover/smt/solver/mam-compiler.ts +118 -88
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
- package/src/prover/smt/solver/max-cliques.ts +105 -0
- package/src/prover/smt/solver/maxcore.ts +309 -0
- package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
- package/src/prover/smt/solver/maxlex.ts +115 -0
- package/src/prover/smt/solver/maxsmt-base.ts +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 +17 -26
- package/src/prover/smt/solver/model-evaluator.ts +188 -12
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +59 -30
- package/src/prover/smt/solver/model-macro-solver.ts +38 -27
- 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 +410 -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 +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 +305 -88
- package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +424 -211
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
- package/src/prover/smt/solver/nlsat/solver.ts +282 -69
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
- package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
- package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
- package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
- package/src/prover/smt/solver/nnf.ts +105 -23
- 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 +792 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -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 +311 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
- package/src/prover/smt/solver/poly-rewriter.ts +202 -57
- package/src/prover/smt/solver/probes.ts +511 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +650 -17
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +632 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +37 -17
- package/src/prover/smt/solver/qe-mbp.ts +270 -0
- package/src/prover/smt/solver/qe.ts +1499 -0
- package/src/prover/smt/solver/qel.ts +25 -0
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +814 -0
- package/src/prover/smt/solver/quant-hoist.ts +196 -0
- package/src/prover/smt/solver/quant-tactics.ts +16 -56
- package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
- package/src/prover/smt/solver/quantifier-manager.ts +25 -24
- package/src/prover/smt/solver/quasi-macros.ts +243 -0
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +45 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
- package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
- package/src/prover/smt/solver/reduce-args.ts +225 -0
- package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +1 -2
- package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
- package/src/prover/smt/solver/rewriter.ts +475 -36
- package/src/prover/smt/solver/rlimit.ts +38 -2
- 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 +44 -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 +2105 -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 +90 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +544 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
- package/src/prover/smt/solver/smtlib-script.ts +1843 -0
- package/src/prover/smt/solver/solve-eqs.ts +923 -0
- package/src/prover/smt/solver/solver.ts +113 -22
- package/src/prover/smt/solver/static-features.ts +314 -0
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +2012 -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 +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
- package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
- package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
- package/src/prover/smt/solver/theory-lra-state.ts +6 -22
- package/src/prover/smt/solver/theory-lra.ts +188 -2
- package/src/prover/smt/solver/theory-pb.ts +933 -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.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
- package/src/prover/smt/solver/var-subst.ts +36 -14
- package/src/prover/smt/table.ts +3 -2
- package/src/prover/smt/types.ts +146 -0
- package/src/prover/tlapm/cache.ts +37 -16
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +2 -0
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +21 -2
- package/src/prover/zenon/index-table.ts +7 -4
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +2 -4
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +6 -2
- package/src/prover/zenon/phrase.ts +1 -3
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +2 -3
- package/src/prover/zenon/search.ts +7 -5
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +7 -8
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +625 -189
- package/src/runtime.ts +7 -1
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +2 -13
- package/src/sany/generator-definitions.ts +3 -1
- package/src/sany/generator-expressions.ts +36 -30
- package/src/sany/generator-proofs.ts +5 -3
- package/src/sany/generator.ts +2 -1
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +3 -3
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +1 -1
- package/src/sany/selectors.ts +11 -6
- package/src/sany/xml.ts +2 -3
- package/src/search.ts +209 -56
- package/src/simulate.ts +3 -0
- package/src/spec-description.ts +2 -2
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +265 -94
- package/src/successors.ts +2 -1
- package/src/symmetry.ts +3 -3
- package/src/tableau.ts +2 -2
- package/src/tlc/fingerprint.ts +81 -9
- package/src/tlc/jar-data.ts +10 -0
- package/src/tlc/messages.ts +3 -3
- package/src/tlc/order.ts +14 -3
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +3 -1
- package/src/tlc/tlcext-operators.ts +61 -16
- package/src/tlc/trace-spec.ts +5 -5
- package/src/typed-tier.ts +6541 -0
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +46 -27
- package/src/prover/isabelle/isar/statement.ts +0 -52
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/tlaps-module.ts +0 -510
- package/src/prover/zenon/LICENSE +0 -32
package/src/check.ts
CHANGED
|
@@ -47,6 +47,7 @@ import {
|
|
|
47
47
|
getStateHash,
|
|
48
48
|
isSameState,
|
|
49
49
|
markSeenState,
|
|
50
|
+
type StateTable,
|
|
50
51
|
} from "./fingerprints";
|
|
51
52
|
import type { JavaOverride } from "./java-overrides";
|
|
52
53
|
import {
|
|
@@ -109,6 +110,7 @@ import {
|
|
|
109
110
|
import { getFingerprintDistance, OUT_DEGREE_BUCKETS } from "./tlc/summary";
|
|
110
111
|
import { createActionRecord, createCounterExample } from "./tlc/tlcext-operators";
|
|
111
112
|
import type { TlcVersion } from "./tlc/version";
|
|
113
|
+
import { runTypedSearch, type TypedResult } from "./typed-tier";
|
|
112
114
|
import {
|
|
113
115
|
createCanonicalizer,
|
|
114
116
|
createModelValue,
|
|
@@ -148,6 +150,8 @@ export interface CheckOptions {
|
|
|
148
150
|
isTool?: boolean;
|
|
149
151
|
/** TLC's -continue: reports each violation through onProgress and goes on. */
|
|
150
152
|
isContinued?: boolean;
|
|
153
|
+
/** Skips fingerprintDistance, which takes fingerprinting every state again after the search. */
|
|
154
|
+
isFingerprintDistanceSkipped?: boolean;
|
|
151
155
|
moduleOperators?: ModuleOperator[];
|
|
152
156
|
/** TLC's trace exploration spec, and the binary trace TLC records for it unless -noTEBin. */
|
|
153
157
|
traceSpec?: TraceSpecOptions;
|
|
@@ -202,7 +206,7 @@ export type CheckProgress =
|
|
|
202
206
|
branches: number;
|
|
203
207
|
/** Whether TLC checks the complete state graph. */
|
|
204
208
|
isComplete: boolean;
|
|
205
|
-
/** How many states of
|
|
209
|
+
/** How many states the graphs of all branches have together. */
|
|
206
210
|
states: number;
|
|
207
211
|
statistics: SearchStatistics;
|
|
208
212
|
}
|
|
@@ -411,6 +415,15 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
411
415
|
key.startsWith(`${name}${KEY_SEPARATOR}`),
|
|
412
416
|
),
|
|
413
417
|
});
|
|
418
|
+
const getCoverage = () =>
|
|
419
|
+
coverage?.relations.some((relation) => relation.kind === "next")
|
|
420
|
+
? getCoverageReport(
|
|
421
|
+
coverage,
|
|
422
|
+
environment,
|
|
423
|
+
specification.variableLocations,
|
|
424
|
+
search?.getTlcOrder() ?? [],
|
|
425
|
+
)
|
|
426
|
+
: undefined;
|
|
414
427
|
const createResult = (
|
|
415
428
|
status: CheckStatus,
|
|
416
429
|
violation?: ReportedViolation,
|
|
@@ -431,14 +444,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
431
444
|
initialStates: computedInitialStates,
|
|
432
445
|
outDegrees: undefined,
|
|
433
446
|
fingerprintDistance: undefined,
|
|
434
|
-
coverage:
|
|
435
|
-
? getCoverageReport(
|
|
436
|
-
coverage,
|
|
437
|
-
environment,
|
|
438
|
-
specification.variableLocations,
|
|
439
|
-
search?.getTlcOrder() ?? [],
|
|
440
|
-
)
|
|
441
|
-
: undefined,
|
|
447
|
+
coverage: getCoverage(),
|
|
442
448
|
...(traceSpec !== undefined && { traceSpec }),
|
|
443
449
|
};
|
|
444
450
|
};
|
|
@@ -457,14 +463,20 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
457
463
|
const createSuccess = (): CheckResult => ({
|
|
458
464
|
...createResult("success"),
|
|
459
465
|
outDegrees: [...outDegrees],
|
|
460
|
-
fingerprintDistance:
|
|
461
|
-
|
|
462
|
-
runtime.generatedStates,
|
|
463
|
-
|
|
464
|
-
|
|
465
|
-
|
|
466
|
-
|
|
467
|
-
|
|
466
|
+
fingerprintDistance: options.isFingerprintDistanceSkipped
|
|
467
|
+
? undefined
|
|
468
|
+
: getFingerprintDistance(runtime.distinctStates, runtime.generatedStates, (visit) =>
|
|
469
|
+
visit(
|
|
470
|
+
search
|
|
471
|
+
? search.getStoredFingerprints(
|
|
472
|
+
exploredStates.length === 0 ? states : states.concat(exploredStates),
|
|
473
|
+
exploredStates.length === 0
|
|
474
|
+
? fingerprintStates
|
|
475
|
+
: fingerprintStates.concat(exploredFingerprintStates),
|
|
476
|
+
)
|
|
477
|
+
: BigInt64Array.from(states, runtime.getFingerprint),
|
|
478
|
+
),
|
|
479
|
+
),
|
|
468
480
|
});
|
|
469
481
|
|
|
470
482
|
const search = createSearch(
|
|
@@ -474,6 +486,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
474
486
|
() => created.order.getDeclarationOrder("variable"),
|
|
475
487
|
options.onProgress,
|
|
476
488
|
specification.moduleOperators,
|
|
489
|
+
specification.runtimeInvariants,
|
|
477
490
|
);
|
|
478
491
|
const findViolatedAssumption = () =>
|
|
479
492
|
findAssumptionViolation(specification.assumptions, environment);
|
|
@@ -550,12 +563,6 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
550
563
|
const getFingerprintState = search.getFingerprintState;
|
|
551
564
|
// Tool's constructor splits the next-state relation into actions before TLC checks anything.
|
|
552
565
|
const nextActions = getDescription().actions;
|
|
553
|
-
runtime.getSuccessorAction = (state, next) =>
|
|
554
|
-
nextActions.find((action) =>
|
|
555
|
-
getSuccessors(action.expression, state, environment, action.scope).some((successor) =>
|
|
556
|
-
successor.state.every((value, index) => isSameValue(value, next[index])),
|
|
557
|
-
),
|
|
558
|
-
);
|
|
559
566
|
const addCoverageRelations = (kind: "init" | "next", actions: SpecAction[]) =>
|
|
560
567
|
actions.map((action): CoveredAction => ({
|
|
561
568
|
...action,
|
|
@@ -605,6 +612,17 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
605
612
|
);
|
|
606
613
|
return successors;
|
|
607
614
|
};
|
|
615
|
+
// TLC generates the successors of each action again, which its coverage counts.
|
|
616
|
+
const findSuccessorAction = (state: Value[], isMatch: (successor: Successor) => boolean) =>
|
|
617
|
+
coverage
|
|
618
|
+
? coverageActions.find((item) => getCoveredSuccessors(item, state).some(isMatch))
|
|
619
|
+
: nextActions.find((item) =>
|
|
620
|
+
getSuccessors(item.expression, state, environment, item.scope).some(isMatch),
|
|
621
|
+
);
|
|
622
|
+
runtime.getSuccessorAction = (state, next) =>
|
|
623
|
+
findSuccessorAction(state, (successor) =>
|
|
624
|
+
successor.state.every((value, index) => isSameValue(value, next[index])),
|
|
625
|
+
);
|
|
608
626
|
const rejectIncompleteInitialState = (partial: (Value | undefined)[]) => {
|
|
609
627
|
throw setExitCode(new TlaIllegalStateError([...partial]), EXIT_STATUS.error);
|
|
610
628
|
};
|
|
@@ -623,8 +641,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
623
641
|
return (state: Value[], callStack: CallStack | undefined) => {
|
|
624
642
|
fingerprintReplayed(state, getFingerprintState(state), callStack);
|
|
625
643
|
const fingerprintState = getFingerprintState(state);
|
|
644
|
+
const hash = getStateHash(fingerprintState);
|
|
626
645
|
const isSeen =
|
|
627
|
-
findStateIndex(seenStates,
|
|
646
|
+
findStateIndex(seenStates, hash, fingerprintState) !== -1 ||
|
|
647
|
+
isExplored(hash, fingerprintState) ||
|
|
628
648
|
replayed.some((seen) => isSameState(seen, fingerprintState));
|
|
629
649
|
if (isSeen) return false;
|
|
630
650
|
replayed.push(fingerprintState);
|
|
@@ -711,28 +731,38 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
711
731
|
if (spec.next === undefined) return successors;
|
|
712
732
|
const livenessSource = current.livenessSource;
|
|
713
733
|
current.livenessSource = source;
|
|
734
|
+
const addSuccessor = (successor: Value[]) => {
|
|
735
|
+
canonicalizeState(successor);
|
|
736
|
+
const isInModel =
|
|
737
|
+
search.satisfiesConstraints(successor, state) &&
|
|
738
|
+
search.satisfiesActionConstraints(state, successor);
|
|
739
|
+
if (!isInModel) return;
|
|
740
|
+
const fingerprintState = getFingerprintState(successor);
|
|
741
|
+
const hash = getStateHash(fingerprintState);
|
|
742
|
+
const index = findStateIndex(seenStates, hash, fingerprintState);
|
|
743
|
+
successors.push({
|
|
744
|
+
index: index === -1 ? getPendingIndex(hash, fingerprintState) : index,
|
|
745
|
+
state: successor,
|
|
746
|
+
});
|
|
747
|
+
};
|
|
714
748
|
try {
|
|
715
|
-
|
|
716
|
-
|
|
717
|
-
|
|
718
|
-
|
|
719
|
-
|
|
720
|
-
|
|
721
|
-
|
|
722
|
-
|
|
723
|
-
|
|
724
|
-
|
|
725
|
-
|
|
726
|
-
|
|
727
|
-
|
|
728
|
-
|
|
729
|
-
|
|
730
|
-
|
|
731
|
-
|
|
732
|
-
return false;
|
|
733
|
-
},
|
|
734
|
-
spec.scope,
|
|
735
|
-
);
|
|
749
|
+
// TLC's coverage counts the successors of each action the graph generates again.
|
|
750
|
+
if (coverage) {
|
|
751
|
+
coverageActions.forEach((action) =>
|
|
752
|
+
walkCoveredSuccessors(action, state, addSuccessor),
|
|
753
|
+
);
|
|
754
|
+
} else {
|
|
755
|
+
forEachSuccessor(
|
|
756
|
+
spec.next,
|
|
757
|
+
state,
|
|
758
|
+
environment,
|
|
759
|
+
(successor) => {
|
|
760
|
+
addSuccessor(successor.state);
|
|
761
|
+
return false;
|
|
762
|
+
},
|
|
763
|
+
spec.scope,
|
|
764
|
+
);
|
|
765
|
+
}
|
|
736
766
|
} finally {
|
|
737
767
|
current.livenessSource = livenessSource;
|
|
738
768
|
}
|
|
@@ -751,6 +781,23 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
751
781
|
const actions: (string | undefined)[] = [];
|
|
752
782
|
const depths: number[] = [];
|
|
753
783
|
const seenStates = createStateTable(fingerprintStates);
|
|
784
|
+
const exploredStates: Value[][] = [];
|
|
785
|
+
const exploredFingerprintStates: Value[][] = [];
|
|
786
|
+
let exploredTable: StateTable | undefined;
|
|
787
|
+
const isExplored = (hash: number, fingerprintState: Value[]) =>
|
|
788
|
+
exploredTable !== undefined && findStateIndex(exploredTable, hash, fingerprintState) !== -1;
|
|
789
|
+
const pendingFingerprintStates: Value[][] = [];
|
|
790
|
+
let pendingStates: StateTable | undefined;
|
|
791
|
+
const getPendingIndex = (hash: number, fingerprintState: Value[]) => {
|
|
792
|
+
pendingStates ??= createStateTable(pendingFingerprintStates);
|
|
793
|
+
const found = findStateIndex(pendingStates, hash, fingerprintState);
|
|
794
|
+
const position = found === -1 ? pendingFingerprintStates.length : found;
|
|
795
|
+
if (found === -1) {
|
|
796
|
+
markSeenState(pendingStates, hash, position);
|
|
797
|
+
pendingFingerprintStates.push(fingerprintState);
|
|
798
|
+
}
|
|
799
|
+
return -2 - position;
|
|
800
|
+
};
|
|
754
801
|
const canonicalizeState = createCanonicalizer();
|
|
755
802
|
|
|
756
803
|
const toRecord = search.toRecord;
|
|
@@ -801,7 +848,12 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
801
848
|
outDegrees: failureOptions.outDegrees,
|
|
802
849
|
};
|
|
803
850
|
};
|
|
804
|
-
|
|
851
|
+
// Deviation from TLC: under -continue, TLC goes on past an incomplete successor and leaks an ArrayIndexOutOfBoundsException.
|
|
852
|
+
const reportIncompleteSuccessor = (
|
|
853
|
+
index: number,
|
|
854
|
+
error: TlaIncompleteSuccessorError,
|
|
855
|
+
liveSuccessors: LiveSuccessor[],
|
|
856
|
+
) => {
|
|
805
857
|
runtime.generatedStates++;
|
|
806
858
|
const named =
|
|
807
859
|
nextActions.length === 1
|
|
@@ -823,7 +875,12 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
823
875
|
);
|
|
824
876
|
const undefinedValue = createModelValue("null");
|
|
825
877
|
const partial = error.state.map((value) => value ?? undefinedValue);
|
|
826
|
-
const
|
|
878
|
+
const live = captureOutput(() => addFailedLiveState(index, liveSuccessors));
|
|
879
|
+
const failure = createFailureResult(
|
|
880
|
+
error,
|
|
881
|
+
appendTraceOutput(traces.getStateTrace(index), live.lines),
|
|
882
|
+
{ callStack: live.result },
|
|
883
|
+
);
|
|
827
884
|
return withOutDegrees({
|
|
828
885
|
...failure,
|
|
829
886
|
failure: failure.failure && {
|
|
@@ -851,7 +908,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
851
908
|
};
|
|
852
909
|
let unstoredFingerprint: Value[] | undefined;
|
|
853
910
|
const countDistinctState = (depth: number) => {
|
|
854
|
-
runtime.distinctStates = states.length + 1;
|
|
911
|
+
runtime.distinctStates = states.length + exploredStates.length + 1;
|
|
855
912
|
searchDepth = Math.max(searchDepth, depth);
|
|
856
913
|
runtime.diameter = Math.max(runtime.diameter, depth);
|
|
857
914
|
};
|
|
@@ -892,18 +949,27 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
892
949
|
tracedSteps,
|
|
893
950
|
captureOutput,
|
|
894
951
|
getInitialStates: getSpecInitialStates,
|
|
895
|
-
findSuccessorAction
|
|
896
|
-
coverage
|
|
897
|
-
? coverageActions.find((item) => getCoveredSuccessors(item, state).some(isMatch))
|
|
898
|
-
: nextActions.find((item) =>
|
|
899
|
-
getSuccessors(item.expression, state, environment, item.scope).some(isMatch),
|
|
900
|
-
),
|
|
952
|
+
findSuccessorAction,
|
|
901
953
|
});
|
|
902
954
|
const getPath = (index: number): Value[][] =>
|
|
903
955
|
index === -1 ? [] : [...getPath(parents[index]), states[index]];
|
|
956
|
+
// TLC adds a successor's fingerprint to its set before it checks the invariants of the successor.
|
|
904
957
|
runtime.isSeen = (state) => {
|
|
905
958
|
const fingerprintState = getFingerprintState(state);
|
|
906
|
-
|
|
959
|
+
const hash = getStateHash(fingerprintState);
|
|
960
|
+
return (
|
|
961
|
+
findStateIndex(seenStates, hash, fingerprintState) !== -1 ||
|
|
962
|
+
isExplored(hash, fingerprintState) ||
|
|
963
|
+
(unstoredFingerprint !== undefined && isSameState(unstoredFingerprint, fingerprintState))
|
|
964
|
+
);
|
|
965
|
+
};
|
|
966
|
+
runtime.markExplored = (state) => {
|
|
967
|
+
const fingerprintState = getFingerprintState(state);
|
|
968
|
+
exploredTable ??= createStateTable(exploredFingerprintStates);
|
|
969
|
+
markSeenState(exploredTable, getStateHash(fingerprintState), exploredStates.length);
|
|
970
|
+
exploredStates.push(state);
|
|
971
|
+
exploredFingerprintStates.push(fingerprintState);
|
|
972
|
+
runtime.distinctStates++;
|
|
907
973
|
};
|
|
908
974
|
runtime.getBehavior = (state) => {
|
|
909
975
|
const index = state === current.candidate ? -1 : states.indexOf(state);
|
|
@@ -994,18 +1060,9 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
994
1060
|
addState(state, fingerprintState, -1, undefined);
|
|
995
1061
|
return undefined;
|
|
996
1062
|
};
|
|
997
|
-
|
|
998
|
-
|
|
999
|
-
|
|
1000
|
-
liveSuccessors: LiveSuccessor[],
|
|
1001
|
-
source: GraphState | undefined,
|
|
1002
|
-
action: SpecAction | undefined,
|
|
1003
|
-
) => {
|
|
1004
|
-
const state = states[index];
|
|
1005
|
-
runtime.generatedStates++;
|
|
1006
|
-
current.candidate = successor.state;
|
|
1007
|
-
current.candidateLevel = depths[index] + 1;
|
|
1008
|
-
if (isCanonicalizedFirst) canonicalizeState(successor.state);
|
|
1063
|
+
// Looks a successor up, where the constraints keep it in the model, as the search does before it
|
|
1064
|
+
// checks the successor.
|
|
1065
|
+
const lookUpSuccessor = (state: Value[], successor: Successor) => {
|
|
1009
1066
|
const fingerprintState = getFingerprintState(successor.state);
|
|
1010
1067
|
const hash = getStateHash(fingerprintState);
|
|
1011
1068
|
const foundIndex = findStateIndex(seenStates, hash, fingerprintState);
|
|
@@ -1018,15 +1075,36 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1018
1075
|
successor.state.forEach(markFingerprinted);
|
|
1019
1076
|
}
|
|
1020
1077
|
const existing = isInModel ? foundIndex : -1;
|
|
1021
|
-
|
|
1078
|
+
return {
|
|
1079
|
+
fingerprintState,
|
|
1080
|
+
hash,
|
|
1081
|
+
isInModel,
|
|
1082
|
+
existing,
|
|
1083
|
+
isSeen: existing !== -1 || (isInModel && isExplored(hash, fingerprintState)),
|
|
1084
|
+
};
|
|
1085
|
+
};
|
|
1086
|
+
const visitSuccessor = (
|
|
1087
|
+
index: number,
|
|
1088
|
+
successor: Successor,
|
|
1089
|
+
liveSuccessors: LiveSuccessor[],
|
|
1090
|
+
source: GraphState | undefined,
|
|
1091
|
+
action: SpecAction | undefined,
|
|
1092
|
+
) => {
|
|
1093
|
+
const state = states[index];
|
|
1094
|
+
runtime.generatedStates++;
|
|
1095
|
+
current.candidate = successor.state;
|
|
1096
|
+
current.candidateLevel = depths[index] + 1;
|
|
1097
|
+
if (isCanonicalizedFirst) canonicalizeState(successor.state);
|
|
1098
|
+
const found = lookUpSuccessor(state, successor);
|
|
1099
|
+
if (source && found.isInModel) {
|
|
1022
1100
|
stateWriter?.writeSuccessor(
|
|
1023
1101
|
source,
|
|
1024
1102
|
getGraphState(successor.state, depths[index] + 1),
|
|
1025
|
-
|
|
1103
|
+
found.isSeen,
|
|
1026
1104
|
action && getGraphAction(action),
|
|
1027
1105
|
);
|
|
1028
1106
|
}
|
|
1029
|
-
if (source && !isInModel && options.dump?.constrained) {
|
|
1107
|
+
if (source && !found.isInModel && options.dump?.constrained) {
|
|
1030
1108
|
const excluded = getGraphState(successor.state, depths[index] + 1);
|
|
1031
1109
|
search
|
|
1032
1110
|
.getExcludingConstraints(state, successor.state)
|
|
@@ -1039,20 +1117,26 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1039
1117
|
),
|
|
1040
1118
|
);
|
|
1041
1119
|
}
|
|
1042
|
-
if (existing !== -1 && liveness) {
|
|
1043
|
-
const stored = states[existing];
|
|
1120
|
+
if (found.existing !== -1 && liveness) {
|
|
1121
|
+
const stored = states[found.existing];
|
|
1044
1122
|
const isStored = stored.every((value, position) => value === successor.state[position]);
|
|
1045
|
-
liveSuccessors.push({ index: existing, state: isStored ? stored : successor.state });
|
|
1123
|
+
liveSuccessors.push({ index: found.existing, state: isStored ? stored : successor.state });
|
|
1046
1124
|
}
|
|
1047
|
-
|
|
1125
|
+
if (found.isSeen && found.existing === -1 && liveness) {
|
|
1126
|
+
liveSuccessors.push({
|
|
1127
|
+
index: getPendingIndex(found.hash, found.fingerprintState),
|
|
1128
|
+
state: successor.state,
|
|
1129
|
+
});
|
|
1130
|
+
}
|
|
1131
|
+
const isNew = found.isInModel && !found.isSeen;
|
|
1048
1132
|
if (isNew && liveness) liveSuccessors.push({ index: states.length, state: successor.state });
|
|
1049
|
-
unstoredFingerprint = isNew ? fingerprintState : undefined;
|
|
1133
|
+
unstoredFingerprint = isNew ? found.fingerprintState : undefined;
|
|
1050
1134
|
if (isNew) {
|
|
1051
1135
|
countDistinctState(depths[index] + 1);
|
|
1052
1136
|
newStateCount++;
|
|
1053
1137
|
if (coverage) coverage.secondary[coveredNode]++;
|
|
1054
1138
|
}
|
|
1055
|
-
if (
|
|
1139
|
+
if (!found.isSeen) {
|
|
1056
1140
|
try {
|
|
1057
1141
|
const violated = search.findViolatedInvariant(successor.state, state);
|
|
1058
1142
|
const violation = violated && { name: violated.name, ...traces.getTrace(index, successor) };
|
|
@@ -1082,8 +1166,12 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1082
1166
|
if (!isNew) return undefined;
|
|
1083
1167
|
if (coverage) countCoverageVariables(coverage, successor.state);
|
|
1084
1168
|
if (!isCanonicalizedFirst) canonicalizeState(successor.state);
|
|
1085
|
-
markSeenState(seenStates, hash, states.length);
|
|
1086
|
-
|
|
1169
|
+
markSeenState(seenStates, found.hash, states.length);
|
|
1170
|
+
if (pendingStates) {
|
|
1171
|
+
const pending = findStateIndex(pendingStates, found.hash, found.fingerprintState);
|
|
1172
|
+
if (pending !== -1) liveness?.storeState(-2 - pending, states.length);
|
|
1173
|
+
}
|
|
1174
|
+
addState(successor.state, found.fingerprintState, index, successor.action);
|
|
1087
1175
|
runtime.queueSize++;
|
|
1088
1176
|
return undefined;
|
|
1089
1177
|
};
|
|
@@ -1096,6 +1184,57 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1096
1184
|
const assumptionViolation = findViolatedAssumption();
|
|
1097
1185
|
if (assumptionViolation) return createResult("assumption-violation", assumptionViolation);
|
|
1098
1186
|
options.onProgress?.({ kind: "initial-states-started" });
|
|
1187
|
+
const typedChecks =
|
|
1188
|
+
!options.isContinued &&
|
|
1189
|
+
options.dump === undefined &&
|
|
1190
|
+
// A set of small integers on the tier is a 31-bit mask, which a lower bound could overflow.
|
|
1191
|
+
options.maxSetSize === undefined &&
|
|
1192
|
+
!hasPostconditions
|
|
1193
|
+
? search.getTypedChecks(liveness?.solutions)
|
|
1194
|
+
: undefined;
|
|
1195
|
+
const typed =
|
|
1196
|
+
typedChecks &&
|
|
1197
|
+
runTypedSearch(environment, {
|
|
1198
|
+
...typedChecks,
|
|
1199
|
+
isDeadlockChecked: config.checkDeadlock,
|
|
1200
|
+
isFingerprinted: !options.isFingerprintDistanceSkipped,
|
|
1201
|
+
livenessCheck: options.livenessCheck ?? "default",
|
|
1202
|
+
});
|
|
1203
|
+
if (typed && !typed.deadlock && !typed.violation && !typed.lasso) {
|
|
1204
|
+
for (let count = 2; count < typed.initialStates.generated; count *= 2) {
|
|
1205
|
+
reportInitialStatesProgress(count, options.onProgress);
|
|
1206
|
+
}
|
|
1207
|
+
options.onProgress?.({ kind: "initial-states-computed", initialStates: typed.initialStates });
|
|
1208
|
+
const statistics = {
|
|
1209
|
+
...createResult("success"),
|
|
1210
|
+
generatedStates: typed.generatedStates,
|
|
1211
|
+
distinctStates: typed.distinctStates,
|
|
1212
|
+
queuedStates: 0,
|
|
1213
|
+
depth: typed.generatedStates === 0 ? 0 : Math.max(typed.depth, 1),
|
|
1214
|
+
initialStates: typed.initialStates,
|
|
1215
|
+
};
|
|
1216
|
+
if (liveness && options.livenessCheck !== "off") {
|
|
1217
|
+
options.onProgress?.({
|
|
1218
|
+
kind: "liveness-started",
|
|
1219
|
+
branches: liveness.branches,
|
|
1220
|
+
isComplete: true,
|
|
1221
|
+
states: liveness.branches * typed.distinctStates,
|
|
1222
|
+
statistics,
|
|
1223
|
+
});
|
|
1224
|
+
options.onProgress?.({ kind: "liveness-finished" });
|
|
1225
|
+
}
|
|
1226
|
+
return {
|
|
1227
|
+
...statistics,
|
|
1228
|
+
outDegrees: typed.outDegrees,
|
|
1229
|
+
fingerprintDistance: options.isFingerprintDistanceSkipped
|
|
1230
|
+
? undefined
|
|
1231
|
+
: getFingerprintDistance(
|
|
1232
|
+
typed.distinctStates,
|
|
1233
|
+
typed.generatedStates,
|
|
1234
|
+
typed.forEachFingerprintRun,
|
|
1235
|
+
),
|
|
1236
|
+
};
|
|
1237
|
+
}
|
|
1099
1238
|
if (spec.init !== undefined) {
|
|
1100
1239
|
let overflowState: Value[] | undefined;
|
|
1101
1240
|
const reportInitialFailure = (error: unknown, state: Value[]) => {
|
|
@@ -1336,6 +1475,8 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1336
1475
|
return {
|
|
1337
1476
|
...result,
|
|
1338
1477
|
violation: appendTraceOutput(result.violation, live.lines),
|
|
1478
|
+
// TLC adds the state to the behavior graph before it reports the coverage.
|
|
1479
|
+
coverage: getCoverage(),
|
|
1339
1480
|
...(live.result && { liveCallStack: live.result }),
|
|
1340
1481
|
};
|
|
1341
1482
|
}
|
|
@@ -1467,29 +1608,136 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1467
1608
|
const startedAt = performance.now();
|
|
1468
1609
|
const periodic = {
|
|
1469
1610
|
at: startedAt + PERIODIC_START,
|
|
1470
|
-
|
|
1611
|
+
checkedCounts: liveness?.getStateCounts().map(() => 1) ?? [],
|
|
1471
1612
|
time: 0,
|
|
1472
1613
|
coverageCount: Math.trunc(options.coverage ?? 0),
|
|
1473
1614
|
};
|
|
1474
|
-
const
|
|
1615
|
+
const getGraphStates = (checker: LivenessChecker) =>
|
|
1616
|
+
checker.getStateCounts().reduce((sum, count) => sum + count, 0);
|
|
1617
|
+
const findPeriodicViolation = (checker: LivenessChecker) => {
|
|
1475
1618
|
const now = performance.now();
|
|
1476
|
-
const
|
|
1619
|
+
const counts = checker.getStateCounts();
|
|
1620
|
+
const isGrown = counts.some(
|
|
1621
|
+
(count, branch) =>
|
|
1622
|
+
(count - periodic.checkedCounts[branch]) / periodic.checkedCounts[branch] > LIVENESS_GROWTH,
|
|
1623
|
+
);
|
|
1477
1624
|
if (!isGrown || periodic.time > (now - startedAt) * LIVENESS_RATIO) return undefined;
|
|
1478
|
-
periodic.
|
|
1479
|
-
if (!liveness) return undefined;
|
|
1625
|
+
periodic.checkedCounts = counts;
|
|
1480
1626
|
options.onProgress?.({
|
|
1481
1627
|
kind: "liveness-started",
|
|
1482
|
-
branches:
|
|
1628
|
+
branches: checker.branches,
|
|
1483
1629
|
isComplete: false,
|
|
1484
|
-
states:
|
|
1630
|
+
states: getGraphStates(checker),
|
|
1485
1631
|
statistics: createResult("success"),
|
|
1486
1632
|
});
|
|
1487
|
-
const lasso =
|
|
1633
|
+
const lasso = checker.findViolation();
|
|
1488
1634
|
if (!lasso) options.onProgress?.({ kind: "liveness-finished" });
|
|
1489
1635
|
periodic.time += performance.now() - now;
|
|
1490
1636
|
return lasso;
|
|
1491
1637
|
};
|
|
1492
|
-
|
|
1638
|
+
const adoptTypedSearch = (searched: TypedResult) => {
|
|
1639
|
+
runtime.generatedStates = searched.generatedStates;
|
|
1640
|
+
runtime.distinctStates = searched.distinctStates;
|
|
1641
|
+
runtime.queueSize = searched.queuedStates;
|
|
1642
|
+
runtime.diameter = searched.depth;
|
|
1643
|
+
searchDepth = searched.depth;
|
|
1644
|
+
outDegrees.splice(0, outDegrees.length, ...searched.outDegrees);
|
|
1645
|
+
newStateCount = 0;
|
|
1646
|
+
};
|
|
1647
|
+
// The tier found a state without successors, or a successor that violates an invariant or an
|
|
1648
|
+
// action property. The interpreter rebuilds the tier's path to it and reports it, as it would after
|
|
1649
|
+
// its own search.
|
|
1650
|
+
const path = typed?.deadlock ?? typed?.violation;
|
|
1651
|
+
const initialIndex = path ? states.findIndex((state) => path.isPathState(0, state)) : -1;
|
|
1652
|
+
if (typed && path && initialIndex !== -1) {
|
|
1653
|
+
const steps: { successor: Successor; action: SpecAction | undefined }[] = [];
|
|
1654
|
+
const getLastState = () => steps.at(-1)?.successor.state ?? states[initialIndex];
|
|
1655
|
+
for (let position = 1; position === steps.length + 1 && position < path.length; position++) {
|
|
1656
|
+
// The interpreter expands only the states it stores, which it has canonicalized.
|
|
1657
|
+
canonicalizeState(getLastState());
|
|
1658
|
+
forEachActionSuccessor(getLastState(), undefined, (successor, action) => {
|
|
1659
|
+
if (!path.isPathState(position, successor.state)) return false;
|
|
1660
|
+
steps.push({ successor, action });
|
|
1661
|
+
return true;
|
|
1662
|
+
});
|
|
1663
|
+
}
|
|
1664
|
+
const isRebuilt = steps.length === path.length - 1;
|
|
1665
|
+
const violating = typed.violation && isRebuilt ? steps.pop() : undefined;
|
|
1666
|
+
if (violating && isCanonicalizedFirst) canonicalizeState(violating.successor.state);
|
|
1667
|
+
const violatedInvariant =
|
|
1668
|
+
violating && search.findViolatedInvariant(violating.successor.state, getLastState());
|
|
1669
|
+
const violatedProperty =
|
|
1670
|
+
violating &&
|
|
1671
|
+
!violatedInvariant &&
|
|
1672
|
+
search.findViolatedActionProperty(getLastState(), violating.successor.state);
|
|
1673
|
+
const violated = violatedInvariant ?? violatedProperty;
|
|
1674
|
+
const isDeadlocked =
|
|
1675
|
+
typed.deadlock !== undefined &&
|
|
1676
|
+
isRebuilt &&
|
|
1677
|
+
forEachActionSuccessor(getLastState(), undefined, () => true) === 0;
|
|
1678
|
+
if (isDeadlocked || violated) {
|
|
1679
|
+
const parent = { index: initialIndex };
|
|
1680
|
+
for (const step of steps) {
|
|
1681
|
+
visitSuccessor(parent.index, step.successor, [], undefined, step.action);
|
|
1682
|
+
parent.index = states.length - 1;
|
|
1683
|
+
}
|
|
1684
|
+
adoptTypedSearch(typed);
|
|
1685
|
+
Object.assign(current, { index: parent.index, candidate: undefined, isExpanding: true });
|
|
1686
|
+
if (violating && violated) {
|
|
1687
|
+
lookUpSuccessor(states[parent.index], violating.successor);
|
|
1688
|
+
current.candidate = violating.successor.state;
|
|
1689
|
+
current.candidateLevel = depths[parent.index] + 1;
|
|
1690
|
+
return withOutDegrees(
|
|
1691
|
+
reportViolation(violatedInvariant ? "invariant-violation" : "liveness-violation", {
|
|
1692
|
+
name: violated.name,
|
|
1693
|
+
...traces.getTrace(parent.index, violating.successor),
|
|
1694
|
+
}),
|
|
1695
|
+
);
|
|
1696
|
+
}
|
|
1697
|
+
const result = expandState(parent.index, []);
|
|
1698
|
+
if (result) return result;
|
|
1699
|
+
}
|
|
1700
|
+
}
|
|
1701
|
+
// The tier found a behavior that violates a temporal property after its whole search. The
|
|
1702
|
+
// interpreter stores the paths to the lasso's states and reports it, as it would after its own.
|
|
1703
|
+
const lassoSteps = new Map<number, { successor: Successor; action: SpecAction | undefined }>();
|
|
1704
|
+
for (const entry of typed?.lasso?.states ?? []) {
|
|
1705
|
+
const initial = entry.parent === -1 ? states.find(entry.isState) : undefined;
|
|
1706
|
+
if (initial) {
|
|
1707
|
+
lassoSteps.set(entry.index, {
|
|
1708
|
+
successor: { state: initial, action: undefined },
|
|
1709
|
+
action: undefined,
|
|
1710
|
+
});
|
|
1711
|
+
}
|
|
1712
|
+
const parent = lassoSteps.get(entry.parent)?.successor.state;
|
|
1713
|
+
if (!parent) continue;
|
|
1714
|
+
// The interpreter expands only the states it stores, which it has canonicalized.
|
|
1715
|
+
canonicalizeState(parent);
|
|
1716
|
+
forEachActionSuccessor(parent, undefined, (successor, action) => {
|
|
1717
|
+
if (!entry.isState(successor.state)) return false;
|
|
1718
|
+
lassoSteps.set(entry.index, { successor, action });
|
|
1719
|
+
return true;
|
|
1720
|
+
});
|
|
1721
|
+
}
|
|
1722
|
+
const lassoIndexes = new Map<number, number>();
|
|
1723
|
+
const typedLasso =
|
|
1724
|
+
typed?.lasso && lassoSteps.size === typed.lasso.states.length ? typed.lasso : undefined;
|
|
1725
|
+
typedLasso?.states.forEach((entry) => {
|
|
1726
|
+
const step = lassoSteps.get(entry.index);
|
|
1727
|
+
const parent = lassoIndexes.get(entry.parent);
|
|
1728
|
+
if (step && parent !== undefined)
|
|
1729
|
+
visitSuccessor(parent, step.successor, [], undefined, step.action);
|
|
1730
|
+
lassoIndexes.set(
|
|
1731
|
+
entry.index,
|
|
1732
|
+
parent === undefined ? states.findIndex(entry.isState) : states.length - 1,
|
|
1733
|
+
);
|
|
1734
|
+
});
|
|
1735
|
+
if (typed && typedLasso) adoptTypedSearch(typed);
|
|
1736
|
+
for (
|
|
1737
|
+
let index = typedLasso ? states.length : 0;
|
|
1738
|
+
index < states.length && !runtime.isStopped;
|
|
1739
|
+
index++
|
|
1740
|
+
) {
|
|
1493
1741
|
current.index = index;
|
|
1494
1742
|
current.candidate = undefined;
|
|
1495
1743
|
runtime.queueSize = states.length - index - 1;
|
|
@@ -1500,7 +1748,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1500
1748
|
} catch (error) {
|
|
1501
1749
|
outcome =
|
|
1502
1750
|
error instanceof TlaIncompleteSuccessorError
|
|
1503
|
-
? reportIncompleteSuccessor(index, error)
|
|
1751
|
+
? reportIncompleteSuccessor(index, error, liveSuccessors)
|
|
1504
1752
|
: reportNextStateFailure(error, index, liveSuccessors);
|
|
1505
1753
|
}
|
|
1506
1754
|
if (outcome) return outcome;
|
|
@@ -1508,7 +1756,7 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1508
1756
|
newStateCount = 0;
|
|
1509
1757
|
if ((isPeriodic || options.onProgress) && performance.now() >= periodic.at) {
|
|
1510
1758
|
periodic.at = performance.now() + PROGRESS_INTERVAL;
|
|
1511
|
-
const lasso = isPeriodic ? findPeriodicViolation(
|
|
1759
|
+
const lasso = isPeriodic && liveness ? findPeriodicViolation(liveness) : undefined;
|
|
1512
1760
|
if (liveness && lasso) return reportLasso(liveness, lasso);
|
|
1513
1761
|
const isCoverageDue = options.coverage !== undefined && periodic.coverageCount === 0;
|
|
1514
1762
|
periodic.coverageCount = isCoverageDue
|
|
@@ -1530,11 +1778,21 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
|
|
|
1530
1778
|
kind: "liveness-started",
|
|
1531
1779
|
branches: finalLiveness.branches,
|
|
1532
1780
|
isComplete: true,
|
|
1533
|
-
states:
|
|
1781
|
+
states: typedLasso
|
|
1782
|
+
? finalLiveness.branches * runtime.distinctStates
|
|
1783
|
+
: getGraphStates(finalLiveness),
|
|
1534
1784
|
statistics: createResult("success"),
|
|
1535
1785
|
});
|
|
1536
1786
|
}
|
|
1537
|
-
const
|
|
1787
|
+
const getLassoIndexes = (indexes: number[]) =>
|
|
1788
|
+
indexes.map((index) => lassoIndexes.get(index) ?? -1);
|
|
1789
|
+
const lasso = typedLasso
|
|
1790
|
+
? {
|
|
1791
|
+
prefix: getLassoIndexes(typedLasso.prefix),
|
|
1792
|
+
cycle: getLassoIndexes(typedLasso.cycle),
|
|
1793
|
+
isCycleConstrained: typedLasso.isCycleConstrained,
|
|
1794
|
+
}
|
|
1795
|
+
: finalLiveness?.findViolation();
|
|
1538
1796
|
if (finalLiveness && lasso) return reportLasso(finalLiveness, lasso);
|
|
1539
1797
|
|
|
1540
1798
|
if (finalLiveness) options.onProgress?.({ kind: "liveness-finished" });
|