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/dist/index.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e.
|
|
9
|
+
Object.defineProperty(exports,Symbol.toStringTag,{value:`Module`});const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs");exports.TlaConfigError=e._,exports.TlaError=e.y,exports.TlaEvaluationError=e.b,exports.TlaSyntaxError=e.F,exports.TlaUnsupportedError=e.B,exports.check=n.S,exports.formatValue=t.Ht,exports.parseConfig=t.gn,exports.parseModule=t.x,exports.prove=n.o;
|
package/dist/index.d.cts
CHANGED
|
@@ -6,6 +6,7 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
+
import "@typescript/typescript6";
|
|
9
10
|
interface LocalResolution {
|
|
10
11
|
kind: "Local";
|
|
11
12
|
}
|
|
@@ -106,6 +107,7 @@ interface CaseExpression {
|
|
|
106
107
|
kind: "Case";
|
|
107
108
|
arms: CaseArm[];
|
|
108
109
|
other: Expression | undefined;
|
|
110
|
+
otherRange?: SourceRange;
|
|
109
111
|
location: SourceLocation;
|
|
110
112
|
}
|
|
111
113
|
interface LetExpression {
|
|
@@ -261,6 +263,7 @@ interface LabelExpression {
|
|
|
261
263
|
name: string;
|
|
262
264
|
params: string[];
|
|
263
265
|
paramRanges?: SourceRange[];
|
|
266
|
+
head?: SourceRange;
|
|
264
267
|
body: Expression;
|
|
265
268
|
location: SourceLocation;
|
|
266
269
|
}
|
|
@@ -298,6 +301,7 @@ interface OperatorDefinition {
|
|
|
298
301
|
params: OperatorParam[];
|
|
299
302
|
body: Expression;
|
|
300
303
|
bodyRange?: SourceRange;
|
|
304
|
+
head?: SourceRange;
|
|
301
305
|
isLocal: boolean;
|
|
302
306
|
isRecursive: boolean;
|
|
303
307
|
location: SourceLocation;
|
|
@@ -439,6 +443,7 @@ type ModuleUnit = {
|
|
|
439
443
|
} | {
|
|
440
444
|
kind: "Recursive";
|
|
441
445
|
declarations: Declaration[];
|
|
446
|
+
location: SourceLocation;
|
|
442
447
|
} | {
|
|
443
448
|
kind: "Definition";
|
|
444
449
|
definition: Definition;
|
|
@@ -511,6 +516,7 @@ interface ModelConfig {
|
|
|
511
516
|
actionConstraints: string[];
|
|
512
517
|
constants: ConstantAssignment[];
|
|
513
518
|
substitutions: Substitution[];
|
|
519
|
+
rawConstants: string[];
|
|
514
520
|
checkDeadlock: boolean;
|
|
515
521
|
symmetry: string | undefined;
|
|
516
522
|
view: string | undefined;
|
|
@@ -529,6 +535,14 @@ interface SyntaxFailure {
|
|
|
529
535
|
line: number;
|
|
530
536
|
column: number;
|
|
531
537
|
isEnd: boolean;
|
|
538
|
+
proof?: {
|
|
539
|
+
stop: {
|
|
540
|
+
line: number;
|
|
541
|
+
column: number;
|
|
542
|
+
};
|
|
543
|
+
exception: string;
|
|
544
|
+
printed: string;
|
|
545
|
+
};
|
|
532
546
|
}
|
|
533
547
|
interface SanyError {
|
|
534
548
|
location: string;
|
|
@@ -570,6 +584,8 @@ interface LazySet {
|
|
|
570
584
|
interface SetValue {
|
|
571
585
|
kind: "Set";
|
|
572
586
|
elements: Value[];
|
|
587
|
+
writtenElements: Value[] | undefined;
|
|
588
|
+
isNormalized: boolean;
|
|
573
589
|
hash: number;
|
|
574
590
|
fingerprint: number;
|
|
575
591
|
isFingerprinted: boolean;
|
|
@@ -586,6 +602,7 @@ interface FunctionValue {
|
|
|
586
602
|
fingerprint: number;
|
|
587
603
|
writtenKeys: Value[] | undefined;
|
|
588
604
|
functionClass: FunctionClass | undefined;
|
|
605
|
+
lambdaDomain: Value | undefined;
|
|
589
606
|
isFingerprinted: boolean;
|
|
590
607
|
}
|
|
591
608
|
interface IntervalValue {
|
|
@@ -632,7 +649,7 @@ interface FilteredSetSource {
|
|
|
632
649
|
interface FilteredSetValue extends LazySet {
|
|
633
650
|
kind: "FilteredSet";
|
|
634
651
|
base: Value;
|
|
635
|
-
test: (element: Value) => boolean;
|
|
652
|
+
test: (element: Value, isMember: boolean) => boolean;
|
|
636
653
|
source?: FilteredSetSource;
|
|
637
654
|
}
|
|
638
655
|
interface UnionValue extends LazySet {
|
|
@@ -651,6 +668,7 @@ interface LazyFunctionValue {
|
|
|
651
668
|
kind: "LazyFunction";
|
|
652
669
|
domain: Value;
|
|
653
670
|
apply: (argument: Value) => Value;
|
|
671
|
+
boundTupleLengths?: (number | undefined)[];
|
|
654
672
|
source?: LazyFunctionSource;
|
|
655
673
|
functionClass?: FunctionClass;
|
|
656
674
|
enumerated?: FunctionValue;
|
|
@@ -659,22 +677,47 @@ interface LazyFunctionValue {
|
|
|
659
677
|
type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
|
|
660
678
|
type FunctionClass = "lambda" | "tuple" | "record";
|
|
661
679
|
export declare const formatValue: (value: Value, isStrict?: boolean, isNormalized?: boolean) => string;
|
|
662
|
-
interface FingerprintFailure {
|
|
663
|
-
sources: Expression[];
|
|
664
|
-
reason: string;
|
|
665
|
-
}
|
|
666
680
|
interface JavaOverride {
|
|
667
681
|
module: string;
|
|
668
682
|
operator: string;
|
|
669
683
|
signature: string;
|
|
670
684
|
isMatched: boolean;
|
|
671
685
|
}
|
|
686
|
+
interface FingerprintFailure {
|
|
687
|
+
sources: Expression[];
|
|
688
|
+
reason: string;
|
|
689
|
+
}
|
|
690
|
+
type CoverageKind = "init" | "next" | "invariant" | "constraint" | "implied";
|
|
691
|
+
interface CoverageReport {
|
|
692
|
+
variables: CoverageVariable[];
|
|
693
|
+
relations: CoverageRelationReport[];
|
|
694
|
+
}
|
|
695
|
+
interface CoverageVariable {
|
|
696
|
+
label: string;
|
|
697
|
+
distinct: number;
|
|
698
|
+
}
|
|
699
|
+
interface CoverageRelationReport {
|
|
700
|
+
kind: CoverageKind;
|
|
701
|
+
label: string;
|
|
702
|
+
distinct: number;
|
|
703
|
+
generated: number;
|
|
704
|
+
expressions: CoverageExpression[];
|
|
705
|
+
}
|
|
706
|
+
interface CoverageExpression {
|
|
707
|
+
location: string;
|
|
708
|
+
depth: number;
|
|
709
|
+
count: number;
|
|
710
|
+
cost: number;
|
|
711
|
+
}
|
|
672
712
|
interface StateDump {
|
|
673
713
|
path: string;
|
|
674
714
|
dot?: boolean;
|
|
675
715
|
colorize?: boolean;
|
|
676
716
|
actionLabels?: boolean;
|
|
677
717
|
snapshot?: boolean;
|
|
718
|
+
constrained?: boolean;
|
|
719
|
+
stuttering?: boolean;
|
|
720
|
+
strict?: boolean;
|
|
678
721
|
}
|
|
679
722
|
interface FailureMessage {
|
|
680
723
|
code: number;
|
|
@@ -689,19 +732,50 @@ interface CheckOptions {
|
|
|
689
732
|
onPrint?: (text: string) => void;
|
|
690
733
|
onPause?: () => void;
|
|
691
734
|
readFile?: (path: string) => string | undefined;
|
|
692
|
-
writeFile?: (path: string, content: string) => void;
|
|
735
|
+
writeFile?: (path: string, content: string | Uint8Array) => void;
|
|
736
|
+
makeDirectory?: (path: string) => void;
|
|
693
737
|
seed?: bigint;
|
|
694
738
|
workers?: number;
|
|
695
|
-
|
|
739
|
+
/** TLC's -lncheck: "final" checks liveness only on the complete graph, "off" never looks for a cycle. */
|
|
740
|
+
livenessCheck?: "default" | "final" | "off";
|
|
741
|
+
/** TLC's -fp: the index of the polynomial in TLC's FP64.Polys that fingerprints states. */
|
|
742
|
+
fingerprintPolynomial?: number;
|
|
743
|
+
/** False for TLC's -terse, which prints a lazy value, such as SUBSET S, without enumerating it. */
|
|
744
|
+
isLazyValueExpanded?: boolean;
|
|
745
|
+
/** TLC's -view: prints each state as the value of the configuration's VIEW. */
|
|
746
|
+
isViewPrinted?: boolean;
|
|
747
|
+
/** TLC's -maxSetSize: the most elements TLC enumerates into a set, or states into a list of them. */
|
|
748
|
+
maxSetSize?: number;
|
|
749
|
+
/** TLC's -dump: writes the reachable states, or with `dot` the state graph, through writeFile. */
|
|
696
750
|
dump?: StateDump;
|
|
751
|
+
/** TLC's -tool, which changes the messages of TLC's errors. */
|
|
697
752
|
isTool?: boolean;
|
|
753
|
+
/** TLC's -continue: reports each violation through onProgress and goes on. */
|
|
698
754
|
isContinued?: boolean;
|
|
699
|
-
|
|
755
|
+
/** Skips fingerprintDistance, which takes fingerprinting every state again after the search. */
|
|
756
|
+
isFingerprintDistanceSkipped?: boolean;
|
|
757
|
+
moduleOperators?: ModuleOperator[];
|
|
758
|
+
/** TLC's trace exploration spec, and the binary trace TLC records for it unless -noTEBin. */
|
|
759
|
+
traceSpec?: TraceSpecOptions;
|
|
760
|
+
/** Whether the caller printed SANY's report, its warnings included, before the check. */
|
|
700
761
|
isSanyReported?: boolean;
|
|
762
|
+
/** False for TLC's -nowarning, which changes how TLC computes some successors. */
|
|
701
763
|
isWarningEnabled?: boolean;
|
|
764
|
+
/** TLC's -coverage, in minutes. */
|
|
765
|
+
coverage?: number;
|
|
702
766
|
version?: TlcVersion;
|
|
703
767
|
onProgress?: (progress: CheckProgress) => void;
|
|
704
768
|
}
|
|
769
|
+
interface TraceSpecOptions {
|
|
770
|
+
module: string;
|
|
771
|
+
traceFile?: string;
|
|
772
|
+
}
|
|
773
|
+
interface ModuleOperator {
|
|
774
|
+
kind: "postcondition" | "constraint" | "view";
|
|
775
|
+
module: string;
|
|
776
|
+
operator: string;
|
|
777
|
+
constants?: Record<string, string>;
|
|
778
|
+
}
|
|
705
779
|
interface InitialStatesProgress {
|
|
706
780
|
kind: "initial-states-progress";
|
|
707
781
|
count: number;
|
|
@@ -739,7 +813,9 @@ type CheckProgress = {
|
|
|
739
813
|
} | {
|
|
740
814
|
kind: "liveness-started";
|
|
741
815
|
branches: number;
|
|
816
|
+
/** Whether TLC checks the complete state graph. */
|
|
742
817
|
isComplete: boolean;
|
|
818
|
+
/** How many states of the graph each branch has. */
|
|
743
819
|
states: number;
|
|
744
820
|
statistics: SearchStatistics;
|
|
745
821
|
} | {
|
|
@@ -758,25 +834,33 @@ type CheckProgress = {
|
|
|
758
834
|
} | ({
|
|
759
835
|
kind: "java-override";
|
|
760
836
|
} & JavaOverride);
|
|
761
|
-
interface SearchStatistics extends Pick<CheckResult, "generatedStates" | "distinctStates" | "queuedStates" | "depth"> {}
|
|
837
|
+
interface SearchStatistics extends Pick<CheckResult, "generatedStates" | "distinctStates" | "queuedStates" | "depth" | "coverage"> {}
|
|
762
838
|
type CheckStatus = "success" | "assumption-violation" | "invariant-violation" | "property-violation" | "liveness-violation" | "postcondition-violation" | "deadlock" | "error";
|
|
763
839
|
interface TraceStep {
|
|
764
840
|
action: string | undefined;
|
|
841
|
+
/** TLC's name, parameters and location for the action that took this step. */
|
|
765
842
|
label: string | undefined;
|
|
766
843
|
state: Record<string, Value>;
|
|
844
|
+
/** What the spec prints before this step as TLC rebuilds the trace, and before it for the first. */
|
|
767
845
|
output?: OutputLine[];
|
|
768
846
|
}
|
|
769
847
|
interface Violation {
|
|
770
848
|
name: string;
|
|
849
|
+
/** Every temporal property that a liveness counterexample violates, in the configuration's order. */
|
|
771
850
|
properties?: string[];
|
|
772
851
|
trace: TraceStep[];
|
|
852
|
+
/** What the spec prints after the trace, as TLC finds the lasso's step back or rebuilds the trace. */
|
|
773
853
|
traceOutput?: OutputLine[];
|
|
854
|
+
/** What the postconditions print, which TLC checks after the lasso's step back. */
|
|
855
|
+
postconditionOutput?: OutputLine[];
|
|
774
856
|
loopStart: number | undefined;
|
|
775
857
|
loopLabel?: string;
|
|
776
858
|
message?: string;
|
|
777
859
|
counts?: string;
|
|
778
860
|
unwitnessed?: Postcondition;
|
|
861
|
+
/** A POSTCONDITION that is false or fails, which TLC checks as it prints the counterexample. */
|
|
779
862
|
postcondition?: Postcondition;
|
|
863
|
+
/** What TLC warns about after a counterexample, with its code. */
|
|
780
864
|
warning?: {
|
|
781
865
|
code: number;
|
|
782
866
|
text: string;
|
|
@@ -788,6 +872,7 @@ interface Postcondition {
|
|
|
788
872
|
message: string;
|
|
789
873
|
counts?: string;
|
|
790
874
|
}
|
|
875
|
+
/** An evaluation that failed during the search, with the behavior up to the state TLC was working on. */
|
|
791
876
|
interface EvaluationFailure {
|
|
792
877
|
code: number;
|
|
793
878
|
message: string;
|
|
@@ -796,11 +881,17 @@ interface EvaluationFailure {
|
|
|
796
881
|
traceOutput?: OutputLine[];
|
|
797
882
|
initialState: Record<string, Value> | undefined;
|
|
798
883
|
exitCode: number;
|
|
884
|
+
/** The expressions TLC was evaluating, outermost first, when its replay finds them. */
|
|
799
885
|
callStack: Expression[] | undefined;
|
|
886
|
+
/** Whether TLC prints the call stack before the error, as it does for a failed liveness check. */
|
|
800
887
|
isCallStackFirst?: boolean;
|
|
888
|
+
/** The FingerprintException the replay raises, which TLC reports in place of the call stack. */
|
|
801
889
|
fingerprint?: FingerprintFailure;
|
|
890
|
+
/** How TLC reports failing again as it prints the trace, since it can't fingerprint the state. */
|
|
802
891
|
traceFailure?: FailureMessage;
|
|
892
|
+
/** A POSTCONDITION that is false or fails after the trace, which TLC checks as it prints one. */
|
|
803
893
|
postcondition?: Postcondition;
|
|
894
|
+
/** Whether TLC stops before it prints the statistics, as it does for an illegal initial state. */
|
|
804
895
|
isWithoutStatistics?: boolean;
|
|
805
896
|
}
|
|
806
897
|
interface InitialStates {
|
|
@@ -815,12 +906,20 @@ interface CheckResult {
|
|
|
815
906
|
distinctStates: number;
|
|
816
907
|
queuedStates: number;
|
|
817
908
|
depth: number;
|
|
909
|
+
/** Once TLC computed all the initial states without a violation or an error. */
|
|
818
910
|
initialStates: InitialStates | undefined;
|
|
911
|
+
/** How many expanded states found each number of new states, when TLC prints the outdegree. */
|
|
819
912
|
outDegrees: number[] | undefined;
|
|
913
|
+
/** The smallest distance between two fingerprints, when TLC estimates a collision from them. */
|
|
820
914
|
fingerprintDistance: bigint | undefined;
|
|
915
|
+
/** A temporal property TLC finds violated as it adds a deadlocked state, reported after. */
|
|
821
916
|
additionalViolation?: Violation;
|
|
917
|
+
/** Where TLC's worker fails to add the state to the behavior graph after it reports a violation. */
|
|
822
918
|
liveCallStack?: Expression[];
|
|
919
|
+
/** The outdegrees when TLC's workers stop on a violation that TLC 1.7.4 reports as a success. */
|
|
823
920
|
violationOutDegrees?: number[];
|
|
921
|
+
traceSpec?: string;
|
|
922
|
+
coverage?: CoverageReport;
|
|
824
923
|
}
|
|
825
924
|
export declare const check: (options: CheckOptions) => Promise<CheckResult>;
|
|
826
925
|
export declare const parseModule: (source: string) => Module;
|
|
@@ -856,4 +955,4 @@ interface ProveOptions {
|
|
|
856
955
|
workers?: number;
|
|
857
956
|
}
|
|
858
957
|
export declare const prove: (options: ProveOptions) => Promise<ProveResult>;
|
|
859
|
-
export type { CheckOptions, CheckProgress, CheckResult, CheckStatus, ConfigValue, ConstantAssignment, EvaluationFailure, ModelConfig, Module, ProofObligation, ProofStatus, ProveOptions, ProveResult, ProvedObligation, Substitution, TraceStep, TrivialObligation, UnprovedObligation, Value, Violation };
|
|
958
|
+
export type { CheckOptions, CheckProgress, CheckResult, CheckStatus, ConfigValue, ConstantAssignment, CoverageReport, EvaluationFailure, ModelConfig, Module, ModuleOperator, ProofObligation, ProofStatus, ProveOptions, ProveResult, ProvedObligation, Substitution, TraceSpecOptions, TraceStep, TrivialObligation, UnprovedObligation, Value, Violation };
|
package/dist/index.d.ts
CHANGED
|
@@ -6,6 +6,7 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
+
import ts from "@typescript/typescript6";
|
|
9
10
|
interface LocalResolution {
|
|
10
11
|
kind: "Local";
|
|
11
12
|
}
|
|
@@ -106,6 +107,7 @@ interface CaseExpression {
|
|
|
106
107
|
kind: "Case";
|
|
107
108
|
arms: CaseArm[];
|
|
108
109
|
other: Expression | undefined;
|
|
110
|
+
otherRange?: SourceRange;
|
|
109
111
|
location: SourceLocation;
|
|
110
112
|
}
|
|
111
113
|
interface LetExpression {
|
|
@@ -261,6 +263,7 @@ interface LabelExpression {
|
|
|
261
263
|
name: string;
|
|
262
264
|
params: string[];
|
|
263
265
|
paramRanges?: SourceRange[];
|
|
266
|
+
head?: SourceRange;
|
|
264
267
|
body: Expression;
|
|
265
268
|
location: SourceLocation;
|
|
266
269
|
}
|
|
@@ -298,6 +301,7 @@ interface OperatorDefinition {
|
|
|
298
301
|
params: OperatorParam[];
|
|
299
302
|
body: Expression;
|
|
300
303
|
bodyRange?: SourceRange;
|
|
304
|
+
head?: SourceRange;
|
|
301
305
|
isLocal: boolean;
|
|
302
306
|
isRecursive: boolean;
|
|
303
307
|
location: SourceLocation;
|
|
@@ -439,6 +443,7 @@ type ModuleUnit = {
|
|
|
439
443
|
} | {
|
|
440
444
|
kind: "Recursive";
|
|
441
445
|
declarations: Declaration[];
|
|
446
|
+
location: SourceLocation;
|
|
442
447
|
} | {
|
|
443
448
|
kind: "Definition";
|
|
444
449
|
definition: Definition;
|
|
@@ -511,6 +516,7 @@ interface ModelConfig {
|
|
|
511
516
|
actionConstraints: string[];
|
|
512
517
|
constants: ConstantAssignment[];
|
|
513
518
|
substitutions: Substitution[];
|
|
519
|
+
rawConstants: string[];
|
|
514
520
|
checkDeadlock: boolean;
|
|
515
521
|
symmetry: string | undefined;
|
|
516
522
|
view: string | undefined;
|
|
@@ -529,6 +535,14 @@ interface SyntaxFailure {
|
|
|
529
535
|
line: number;
|
|
530
536
|
column: number;
|
|
531
537
|
isEnd: boolean;
|
|
538
|
+
proof?: {
|
|
539
|
+
stop: {
|
|
540
|
+
line: number;
|
|
541
|
+
column: number;
|
|
542
|
+
};
|
|
543
|
+
exception: string;
|
|
544
|
+
printed: string;
|
|
545
|
+
};
|
|
532
546
|
}
|
|
533
547
|
interface SanyError {
|
|
534
548
|
location: string;
|
|
@@ -570,6 +584,8 @@ interface LazySet {
|
|
|
570
584
|
interface SetValue {
|
|
571
585
|
kind: "Set";
|
|
572
586
|
elements: Value[];
|
|
587
|
+
writtenElements: Value[] | undefined;
|
|
588
|
+
isNormalized: boolean;
|
|
573
589
|
hash: number;
|
|
574
590
|
fingerprint: number;
|
|
575
591
|
isFingerprinted: boolean;
|
|
@@ -586,6 +602,7 @@ interface FunctionValue {
|
|
|
586
602
|
fingerprint: number;
|
|
587
603
|
writtenKeys: Value[] | undefined;
|
|
588
604
|
functionClass: FunctionClass | undefined;
|
|
605
|
+
lambdaDomain: Value | undefined;
|
|
589
606
|
isFingerprinted: boolean;
|
|
590
607
|
}
|
|
591
608
|
interface IntervalValue {
|
|
@@ -632,7 +649,7 @@ interface FilteredSetSource {
|
|
|
632
649
|
interface FilteredSetValue extends LazySet {
|
|
633
650
|
kind: "FilteredSet";
|
|
634
651
|
base: Value;
|
|
635
|
-
test: (element: Value) => boolean;
|
|
652
|
+
test: (element: Value, isMember: boolean) => boolean;
|
|
636
653
|
source?: FilteredSetSource;
|
|
637
654
|
}
|
|
638
655
|
interface UnionValue extends LazySet {
|
|
@@ -651,6 +668,7 @@ interface LazyFunctionValue {
|
|
|
651
668
|
kind: "LazyFunction";
|
|
652
669
|
domain: Value;
|
|
653
670
|
apply: (argument: Value) => Value;
|
|
671
|
+
boundTupleLengths?: (number | undefined)[];
|
|
654
672
|
source?: LazyFunctionSource;
|
|
655
673
|
functionClass?: FunctionClass;
|
|
656
674
|
enumerated?: FunctionValue;
|
|
@@ -659,22 +677,47 @@ interface LazyFunctionValue {
|
|
|
659
677
|
type Value = boolean | number | string | ModelValue | SetValue | MixedSetValue | FunctionValue | IntervalValue | InfiniteSetValue | SubsetValue | FunctionSetValue | RecordSetValue | ProductSetValue | SequenceSetValue | SetOperationValue | FilteredSetValue | UnionValue | LazyFunctionValue;
|
|
660
678
|
type FunctionClass = "lambda" | "tuple" | "record";
|
|
661
679
|
export declare const formatValue: (value: Value, isStrict?: boolean, isNormalized?: boolean) => string;
|
|
662
|
-
interface FingerprintFailure {
|
|
663
|
-
sources: Expression[];
|
|
664
|
-
reason: string;
|
|
665
|
-
}
|
|
666
680
|
interface JavaOverride {
|
|
667
681
|
module: string;
|
|
668
682
|
operator: string;
|
|
669
683
|
signature: string;
|
|
670
684
|
isMatched: boolean;
|
|
671
685
|
}
|
|
686
|
+
interface FingerprintFailure {
|
|
687
|
+
sources: Expression[];
|
|
688
|
+
reason: string;
|
|
689
|
+
}
|
|
690
|
+
type CoverageKind = "init" | "next" | "invariant" | "constraint" | "implied";
|
|
691
|
+
interface CoverageReport {
|
|
692
|
+
variables: CoverageVariable[];
|
|
693
|
+
relations: CoverageRelationReport[];
|
|
694
|
+
}
|
|
695
|
+
interface CoverageVariable {
|
|
696
|
+
label: string;
|
|
697
|
+
distinct: number;
|
|
698
|
+
}
|
|
699
|
+
interface CoverageRelationReport {
|
|
700
|
+
kind: CoverageKind;
|
|
701
|
+
label: string;
|
|
702
|
+
distinct: number;
|
|
703
|
+
generated: number;
|
|
704
|
+
expressions: CoverageExpression[];
|
|
705
|
+
}
|
|
706
|
+
interface CoverageExpression {
|
|
707
|
+
location: string;
|
|
708
|
+
depth: number;
|
|
709
|
+
count: number;
|
|
710
|
+
cost: number;
|
|
711
|
+
}
|
|
672
712
|
interface StateDump {
|
|
673
713
|
path: string;
|
|
674
714
|
dot?: boolean;
|
|
675
715
|
colorize?: boolean;
|
|
676
716
|
actionLabels?: boolean;
|
|
677
717
|
snapshot?: boolean;
|
|
718
|
+
constrained?: boolean;
|
|
719
|
+
stuttering?: boolean;
|
|
720
|
+
strict?: boolean;
|
|
678
721
|
}
|
|
679
722
|
interface FailureMessage {
|
|
680
723
|
code: number;
|
|
@@ -689,19 +732,50 @@ interface CheckOptions {
|
|
|
689
732
|
onPrint?: (text: string) => void;
|
|
690
733
|
onPause?: () => void;
|
|
691
734
|
readFile?: (path: string) => string | undefined;
|
|
692
|
-
writeFile?: (path: string, content: string) => void;
|
|
735
|
+
writeFile?: (path: string, content: string | Uint8Array) => void;
|
|
736
|
+
makeDirectory?: (path: string) => void;
|
|
693
737
|
seed?: bigint;
|
|
694
738
|
workers?: number;
|
|
695
|
-
|
|
739
|
+
/** TLC's -lncheck: "final" checks liveness only on the complete graph, "off" never looks for a cycle. */
|
|
740
|
+
livenessCheck?: "default" | "final" | "off";
|
|
741
|
+
/** TLC's -fp: the index of the polynomial in TLC's FP64.Polys that fingerprints states. */
|
|
742
|
+
fingerprintPolynomial?: number;
|
|
743
|
+
/** False for TLC's -terse, which prints a lazy value, such as SUBSET S, without enumerating it. */
|
|
744
|
+
isLazyValueExpanded?: boolean;
|
|
745
|
+
/** TLC's -view: prints each state as the value of the configuration's VIEW. */
|
|
746
|
+
isViewPrinted?: boolean;
|
|
747
|
+
/** TLC's -maxSetSize: the most elements TLC enumerates into a set, or states into a list of them. */
|
|
748
|
+
maxSetSize?: number;
|
|
749
|
+
/** TLC's -dump: writes the reachable states, or with `dot` the state graph, through writeFile. */
|
|
696
750
|
dump?: StateDump;
|
|
751
|
+
/** TLC's -tool, which changes the messages of TLC's errors. */
|
|
697
752
|
isTool?: boolean;
|
|
753
|
+
/** TLC's -continue: reports each violation through onProgress and goes on. */
|
|
698
754
|
isContinued?: boolean;
|
|
699
|
-
|
|
755
|
+
/** Skips fingerprintDistance, which takes fingerprinting every state again after the search. */
|
|
756
|
+
isFingerprintDistanceSkipped?: boolean;
|
|
757
|
+
moduleOperators?: ModuleOperator[];
|
|
758
|
+
/** TLC's trace exploration spec, and the binary trace TLC records for it unless -noTEBin. */
|
|
759
|
+
traceSpec?: TraceSpecOptions;
|
|
760
|
+
/** Whether the caller printed SANY's report, its warnings included, before the check. */
|
|
700
761
|
isSanyReported?: boolean;
|
|
762
|
+
/** False for TLC's -nowarning, which changes how TLC computes some successors. */
|
|
701
763
|
isWarningEnabled?: boolean;
|
|
764
|
+
/** TLC's -coverage, in minutes. */
|
|
765
|
+
coverage?: number;
|
|
702
766
|
version?: TlcVersion;
|
|
703
767
|
onProgress?: (progress: CheckProgress) => void;
|
|
704
768
|
}
|
|
769
|
+
interface TraceSpecOptions {
|
|
770
|
+
module: string;
|
|
771
|
+
traceFile?: string;
|
|
772
|
+
}
|
|
773
|
+
interface ModuleOperator {
|
|
774
|
+
kind: "postcondition" | "constraint" | "view";
|
|
775
|
+
module: string;
|
|
776
|
+
operator: string;
|
|
777
|
+
constants?: Record<string, string>;
|
|
778
|
+
}
|
|
705
779
|
interface InitialStatesProgress {
|
|
706
780
|
kind: "initial-states-progress";
|
|
707
781
|
count: number;
|
|
@@ -739,7 +813,9 @@ type CheckProgress = {
|
|
|
739
813
|
} | {
|
|
740
814
|
kind: "liveness-started";
|
|
741
815
|
branches: number;
|
|
816
|
+
/** Whether TLC checks the complete state graph. */
|
|
742
817
|
isComplete: boolean;
|
|
818
|
+
/** How many states of the graph each branch has. */
|
|
743
819
|
states: number;
|
|
744
820
|
statistics: SearchStatistics;
|
|
745
821
|
} | {
|
|
@@ -758,25 +834,33 @@ type CheckProgress = {
|
|
|
758
834
|
} | ({
|
|
759
835
|
kind: "java-override";
|
|
760
836
|
} & JavaOverride);
|
|
761
|
-
interface SearchStatistics extends Pick<CheckResult, "generatedStates" | "distinctStates" | "queuedStates" | "depth"> {}
|
|
837
|
+
interface SearchStatistics extends Pick<CheckResult, "generatedStates" | "distinctStates" | "queuedStates" | "depth" | "coverage"> {}
|
|
762
838
|
type CheckStatus = "success" | "assumption-violation" | "invariant-violation" | "property-violation" | "liveness-violation" | "postcondition-violation" | "deadlock" | "error";
|
|
763
839
|
interface TraceStep {
|
|
764
840
|
action: string | undefined;
|
|
841
|
+
/** TLC's name, parameters and location for the action that took this step. */
|
|
765
842
|
label: string | undefined;
|
|
766
843
|
state: Record<string, Value>;
|
|
844
|
+
/** What the spec prints before this step as TLC rebuilds the trace, and before it for the first. */
|
|
767
845
|
output?: OutputLine[];
|
|
768
846
|
}
|
|
769
847
|
interface Violation {
|
|
770
848
|
name: string;
|
|
849
|
+
/** Every temporal property that a liveness counterexample violates, in the configuration's order. */
|
|
771
850
|
properties?: string[];
|
|
772
851
|
trace: TraceStep[];
|
|
852
|
+
/** What the spec prints after the trace, as TLC finds the lasso's step back or rebuilds the trace. */
|
|
773
853
|
traceOutput?: OutputLine[];
|
|
854
|
+
/** What the postconditions print, which TLC checks after the lasso's step back. */
|
|
855
|
+
postconditionOutput?: OutputLine[];
|
|
774
856
|
loopStart: number | undefined;
|
|
775
857
|
loopLabel?: string;
|
|
776
858
|
message?: string;
|
|
777
859
|
counts?: string;
|
|
778
860
|
unwitnessed?: Postcondition;
|
|
861
|
+
/** A POSTCONDITION that is false or fails, which TLC checks as it prints the counterexample. */
|
|
779
862
|
postcondition?: Postcondition;
|
|
863
|
+
/** What TLC warns about after a counterexample, with its code. */
|
|
780
864
|
warning?: {
|
|
781
865
|
code: number;
|
|
782
866
|
text: string;
|
|
@@ -788,6 +872,7 @@ interface Postcondition {
|
|
|
788
872
|
message: string;
|
|
789
873
|
counts?: string;
|
|
790
874
|
}
|
|
875
|
+
/** An evaluation that failed during the search, with the behavior up to the state TLC was working on. */
|
|
791
876
|
interface EvaluationFailure {
|
|
792
877
|
code: number;
|
|
793
878
|
message: string;
|
|
@@ -796,11 +881,17 @@ interface EvaluationFailure {
|
|
|
796
881
|
traceOutput?: OutputLine[];
|
|
797
882
|
initialState: Record<string, Value> | undefined;
|
|
798
883
|
exitCode: number;
|
|
884
|
+
/** The expressions TLC was evaluating, outermost first, when its replay finds them. */
|
|
799
885
|
callStack: Expression[] | undefined;
|
|
886
|
+
/** Whether TLC prints the call stack before the error, as it does for a failed liveness check. */
|
|
800
887
|
isCallStackFirst?: boolean;
|
|
888
|
+
/** The FingerprintException the replay raises, which TLC reports in place of the call stack. */
|
|
801
889
|
fingerprint?: FingerprintFailure;
|
|
890
|
+
/** How TLC reports failing again as it prints the trace, since it can't fingerprint the state. */
|
|
802
891
|
traceFailure?: FailureMessage;
|
|
892
|
+
/** A POSTCONDITION that is false or fails after the trace, which TLC checks as it prints one. */
|
|
803
893
|
postcondition?: Postcondition;
|
|
894
|
+
/** Whether TLC stops before it prints the statistics, as it does for an illegal initial state. */
|
|
804
895
|
isWithoutStatistics?: boolean;
|
|
805
896
|
}
|
|
806
897
|
interface InitialStates {
|
|
@@ -815,12 +906,20 @@ interface CheckResult {
|
|
|
815
906
|
distinctStates: number;
|
|
816
907
|
queuedStates: number;
|
|
817
908
|
depth: number;
|
|
909
|
+
/** Once TLC computed all the initial states without a violation or an error. */
|
|
818
910
|
initialStates: InitialStates | undefined;
|
|
911
|
+
/** How many expanded states found each number of new states, when TLC prints the outdegree. */
|
|
819
912
|
outDegrees: number[] | undefined;
|
|
913
|
+
/** The smallest distance between two fingerprints, when TLC estimates a collision from them. */
|
|
820
914
|
fingerprintDistance: bigint | undefined;
|
|
915
|
+
/** A temporal property TLC finds violated as it adds a deadlocked state, reported after. */
|
|
821
916
|
additionalViolation?: Violation;
|
|
917
|
+
/** Where TLC's worker fails to add the state to the behavior graph after it reports a violation. */
|
|
822
918
|
liveCallStack?: Expression[];
|
|
919
|
+
/** The outdegrees when TLC's workers stop on a violation that TLC 1.7.4 reports as a success. */
|
|
823
920
|
violationOutDegrees?: number[];
|
|
921
|
+
traceSpec?: string;
|
|
922
|
+
coverage?: CoverageReport;
|
|
824
923
|
}
|
|
825
924
|
export declare const check: (options: CheckOptions) => Promise<CheckResult>;
|
|
826
925
|
export declare const parseModule: (source: string) => Module;
|
|
@@ -856,4 +955,4 @@ interface ProveOptions {
|
|
|
856
955
|
workers?: number;
|
|
857
956
|
}
|
|
858
957
|
export declare const prove: (options: ProveOptions) => Promise<ProveResult>;
|
|
859
|
-
export type { CheckOptions, CheckProgress, CheckResult, CheckStatus, ConfigValue, ConstantAssignment, EvaluationFailure, ModelConfig, Module, ProofObligation, ProofStatus, ProveOptions, ProveResult, ProvedObligation, Substitution, TraceStep, TrivialObligation, UnprovedObligation, Value, Violation };
|
|
958
|
+
export type { CheckOptions, CheckProgress, CheckResult, CheckStatus, ConfigValue, ConstantAssignment, CoverageReport, EvaluationFailure, ModelConfig, Module, ModuleOperator, ProofObligation, ProofStatus, ProveOptions, ProveResult, ProvedObligation, Substitution, TraceSpecOptions, TraceStep, TrivialObligation, UnprovedObligation, Value, Violation };
|
package/dist/index.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{
|
|
9
|
+
import{B as e,F as t,_ as n,b as r,y as i}from"./worker.js";import{Ht as a,gn as o,x as s}from"./transfer.js";import{S as c,o as l}from"./prove.js";export{n as TlaConfigError,i as TlaError,r as TlaEvaluationError,t as TlaSyntaxError,e as TlaUnsupportedError,c as check,a as formatValue,o as parseConfig,s as parseModule,l as prove};
|
package/dist/parallel-worker.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=(n,r)=>{let i=new Map(n.modules),a=e=>i.get(e),o=new Map(n.classes),s=t.c(n.config,{...n,loadModule:a,loadClass:e=>o.get(e),seed:void 0},()=>{},!0),c=s.specification,l=c.environment,u=t.u(n.config,l,c.variableLocations,()=>s.order.getDeclarationOrder(`variable`)),d=u?.spec.next;if(!u||d===void 0)return r.postMessage({type:`abort`});let f=n.index,p=t.Mt(),m=t.t(l.variables.length),h=n.fingerprints,g=n.requests,_=n.remaining,v=u.isSymmetric?t.P():void 0,y=/* @__PURE__ */ new Int32Array(2),b=()=>{},x=e=>{};n.ports.forEach(e=>{e?.addEventListener(`message`,e=>x(e.data)),e?.start?.()});let S=m(n.seed).map(p),C=e.t(),w=(e,r)=>{let i=Atomics.load(g,f)-1,a=Math.floor((e.end-e.origin-1)/2),o=t.n(),s=e.states.slice(e.end-a,e.end),c=a>0&&s.every(o.encode);c&&(e.end-=a);let l=c?o.finish():t.n().finish();n.ports[i]?.postMessage(l,[l.words.buffer]),Atomics.store(g,f,r),Atomics.notify(g,f)},T=e=>{Atomics.store(_,f,0),Atomics.compareExchange(g,f,0,-1)!==0&&w(e,-1)},E=e=>{Atomics.store(_,f,e.end-e.origin),Atomics.store(g,f,0)},D=e=>{for(;e.origin<e.end;e.origin++){let r=e.states[e.origin];if(!e.successors){if(performance.now()>=e.breakAt)return`break`;if(Atomics.load(g,f)>0&&w(e,0),Atomics.store(_,f,e.end-e.origin-1),e.successors=t.tt(d,r,l,u.spec.scope),e.generated+=e.successors.length,e.successors.length===0&&n.config.checkDeadlock)return}let i=e.successors;for(;e.index<i.length;e.index++){if(t.H(h))return`paused`;let n=i[e.index];if(u.findViolatedActionProperty(r,n.state))return;if(!u.satisfiesActionConstraints(r,n.state)){if(u.findViolatedInvariant(n.state,r))return;continue}if(v&&(t.W(n.state,y),!v.insert(y[0],y[1])))continue;p(n.state);let a=u.getFingerprintState(n.state);if(t.W(a,y),t.B(h,y[0],y[1])){if(u.findViolatedInvariant(n.state,r))return;u.satisfiesConstraints(n.state,r)&&(e.next.push(n.state),e.fingerprintStates.push(a),e.added++)}}e.outDegrees[Math.min(e.added,31)]++,e.successors=void 0,e.index=0,e.added=0}return`done`},O=async e=>{let t=/* @__PURE__ */ new Set;for(;;){let r=n.ports.reduce((e,n,r)=>!n||t.has(r)||Atomics.load(_,r)<2?e:e===void 0||Atomics.load(_,r)>Atomics.load(_,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(g,r,0,f+1);if(i===-1&&t.add(r),i>0&&Atomics.wait(g,r,i),i!==0)continue;let a=await new Promise(e=>x=e);if(a.count===0)t.add(r);else return e.states=m(a).map(p),e.origin=0,e.end=e.states.length,E(e),!0}},k=e=>r.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),A=async()=>{let e={states:S,origin:0,end:S.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=D(e);if(t===void 0)return;if(t===`break`)await C(),e.breakAt=performance.now()+100;else if(T(e),t===`paused`){let t=new Promise(e=>b=e);k({type:`paused`}),await t,E(e)}else if(!await O(e))break}let n=t.Yt();return n===void 0?(S=e.next,Atomics.store(_,f,S.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:u.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:n}},j=()=>{A().then(e=>k(e??{type:`abort`}),()=>k({type:`abort`}))};r.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&j(),t.type===`resize`&&(h=t.fingerprints,b())}),Atomics.store(_,f,S.length),k({type:`ready`})};e.n().then(e=>{let t=r=>{let i=r.data;if(i.type===`start`){e.removeEventListener?.(`message`,t);try{n(i,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|
package/dist/parallel-worker.js
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{n as e,t}from"./worker.js";import{
|
|
9
|
+
import{n as e,t}from"./worker.js";import{B as n,H as r,Mt as i,P as a,W as o,Yt as s,c,n as l,t as u,tt as d,u as f}from"./transfer.js";const p=(e,p)=>{let m=new Map(e.modules),h=e=>m.get(e),g=new Map(e.classes),_=c(e.config,{...e,loadModule:h,loadClass:e=>g.get(e),seed:void 0},()=>{},!0),v=_.specification,y=v.environment,b=f(e.config,y,v.variableLocations,()=>_.order.getDeclarationOrder(`variable`)),x=b?.spec.next;if(!b||x===void 0)return p.postMessage({type:`abort`});let S=e.index,C=i(),w=u(y.variables.length),T=e.fingerprints,E=e.requests,D=e.remaining,O=b.isSymmetric?a():void 0,k=/* @__PURE__ */ new Int32Array(2),A=()=>{},j=e=>{};e.ports.forEach(e=>{e?.addEventListener(`message`,e=>j(e.data)),e?.start?.()});let M=w(e.seed).map(C),N=t(),P=(t,n)=>{let r=Atomics.load(E,S)-1,i=Math.floor((t.end-t.origin-1)/2),a=l(),o=t.states.slice(t.end-i,t.end),s=i>0&&o.every(a.encode);s&&(t.end-=i);let c=s?a.finish():l().finish();e.ports[r]?.postMessage(c,[c.words.buffer]),Atomics.store(E,S,n),Atomics.notify(E,S)},F=e=>{Atomics.store(D,S,0),Atomics.compareExchange(E,S,0,-1)!==0&&P(e,-1)},I=e=>{Atomics.store(D,S,e.end-e.origin),Atomics.store(E,S,0)},L=t=>{for(;t.origin<t.end;t.origin++){let i=t.states[t.origin];if(!t.successors){if(performance.now()>=t.breakAt)return`break`;if(Atomics.load(E,S)>0&&P(t,0),Atomics.store(D,S,t.end-t.origin-1),t.successors=d(x,i,y,b.spec.scope),t.generated+=t.successors.length,t.successors.length===0&&e.config.checkDeadlock)return}let a=t.successors;for(;t.index<a.length;t.index++){if(r(T))return`paused`;let e=a[t.index];if(b.findViolatedActionProperty(i,e.state))return;if(!b.satisfiesActionConstraints(i,e.state)){if(b.findViolatedInvariant(e.state,i))return;continue}if(O&&(o(e.state,k),!O.insert(k[0],k[1])))continue;C(e.state);let s=b.getFingerprintState(e.state);if(o(s,k),n(T,k[0],k[1])){if(b.findViolatedInvariant(e.state,i))return;b.satisfiesConstraints(e.state,i)&&(t.next.push(e.state),t.fingerprintStates.push(s),t.added++)}}t.outDegrees[Math.min(t.added,31)]++,t.successors=void 0,t.index=0,t.added=0}return`done`},R=async t=>{let n=/* @__PURE__ */ new Set;for(;;){let r=e.ports.reduce((e,t,r)=>!t||n.has(r)||Atomics.load(D,r)<2?e:e===void 0||Atomics.load(D,r)>Atomics.load(D,e)?r:e,void 0);if(r===void 0)return!1;let i=Atomics.compareExchange(E,r,0,S+1);if(i===-1&&n.add(r),i>0&&Atomics.wait(E,r,i),i!==0)continue;let a=await new Promise(e=>j=e);if(a.count===0)n.add(r);else return t.states=w(a).map(C),t.origin=0,t.end=t.states.length,I(t),!0}},z=e=>p.postMessage(e,e.type===`level`?[e.fingerprints.buffer]:[]),B=async()=>{let e={states:M,origin:0,end:M.length,successors:void 0,index:0,added:0,generated:0,outDegrees:Array.from({length:32},()=>0),next:[],fingerprintStates:[],breakAt:performance.now()+100};for(;;){let t=L(e);if(t===void 0)return;if(t===`break`)await N(),e.breakAt=performance.now()+100;else if(F(e),t===`paused`){let t=new Promise(e=>A=e);z({type:`paused`}),await t,I(e)}else if(!await R(e))break}let t=s();return t===void 0?(M=e.next,Atomics.store(D,S,M.length),{type:`level`,generated:e.generated,added:e.next.length,outDegrees:e.outDegrees,fingerprints:b.getStoredFingerprints(e.next,e.fingerprintStates)}):{type:`abort`,string:t}},V=()=>{B().then(e=>z(e??{type:`abort`}),()=>z({type:`abort`}))};p.addEventListener(`message`,e=>{let t=e.data;t.type===`level`&&V(),t.type===`resize`&&(T=t.fingerprints,A())}),Atomics.store(D,S,M.length),z({type:`ready`})};e().then(e=>{let t=n=>{let r=n.data;if(r.type===`start`){e.removeEventListener?.(`message`,t);try{p(r,e)}catch{e.postMessage({type:`abort`})}}};e.addEventListener(`message`,t),e.start?.()});
|
package/dist/prove-worker.cjs
CHANGED
|
@@ -6,4 +6,4 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./deciders.cjs"),n=n=>{try{return t.t(n.prover,n.text,{timeLimitMs:n.timeLimitMs})}catch(t){if(t instanceof e.
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./deciders.cjs"),n=n=>{try{return t.t(n.prover,n.text,{timeLimitMs:n.timeLimitMs})}catch(t){if(t instanceof e.j)return{error:t.message};throw t}};e.n().then(e=>{e.addEventListener(`message`,t=>e.postMessage(n(t.data))),e.start?.()});
|