tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479
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 +6 -6
- package/dist/compile.js +10 -10
- package/dist/deciders.cjs +41 -37
- package/dist/deciders.js +41 -37
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +21 -4
- package/dist/index.d.ts +21 -4
- 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 +2681 -425
- package/dist/prove.js +2681 -425
- package/dist/run.cjs +41 -42
- package/dist/run.js +41 -42
- package/dist/tlapm.cjs +2 -2
- package/dist/tlapm.js +2 -2
- package/dist/transfer.cjs +97 -89
- package/dist/transfer.js +97 -89
- package/dist/worker.cjs +7 -7
- package/dist/worker.js +7 -7
- package/package.json +1 -1
- package/src/ast.ts +72 -39
- package/src/bags.ts +50 -29
- package/src/builtins.ts +8 -16
- package/src/check-failure.ts +118 -0
- package/src/check-trace.ts +321 -0
- package/src/check.ts +828 -770
- package/src/cli/options.ts +6 -31
- package/src/cli/runtime-invariants.ts +20 -56
- package/src/cli/shared.ts +1 -1
- package/src/cli/tlapm.ts +433 -70
- package/src/cli/tlc-arguments.ts +224 -212
- package/src/cli/tlc-output.ts +701 -0
- package/src/cli/tlc-usage.ts +1 -2
- package/src/cli/tlc.ts +65 -712
- package/src/cli/xml-exporter.ts +23 -33
- package/src/codegen.ts +28 -20
- package/src/coverage.ts +255 -20
- package/src/dependencies.ts +96 -27
- package/src/dfid.ts +115 -50
- package/src/environment-config.ts +315 -0
- package/src/environment.ts +175 -373
- package/src/errors.ts +40 -5
- package/src/evaluate.ts +429 -139
- package/src/exit-codes.ts +28 -12
- package/src/fingerprints.ts +65 -1
- package/src/instances.ts +178 -17
- package/src/java-hash.ts +14 -0
- package/src/java-overrides.ts +2 -2
- package/src/json.ts +4 -7
- package/src/levels.ts +708 -272
- package/src/lexer.ts +17 -5
- package/src/liveness-checker.ts +707 -249
- package/src/liveness.ts +148 -95
- package/src/obligations/action.ts +14 -17
- package/src/obligations/anonymize.ts +37 -16
- package/src/obligations/enabled-axioms.ts +218 -0
- package/src/obligations/equality.ts +1 -3
- package/src/obligations/expression.ts +36 -8
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +66 -54
- package/src/obligations/index.ts +39 -9
- package/src/obligations/levels.ts +24 -11
- package/src/obligations/module.ts +28 -41
- package/src/obligations/normalize.ts +27 -18
- 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 +55 -50
- package/src/obligations/source.ts +120 -74
- package/src/obligations/subexpression.ts +45 -18
- package/src/obligations/substitution.ts +1 -3
- package/src/obligations/temporal.ts +5 -7
- package/src/obligations/tuples.ts +0 -2
- package/src/parallel-worker.ts +17 -31
- package/src/parallel.ts +29 -47
- package/src/parser.ts +757 -326
- package/src/pretty-print.ts +1 -1
- package/src/prover/decide-pool.ts +3 -3
- package/src/prover/deciders.ts +12 -9
- package/src/prover/isabelle/decide.ts +3 -25
- package/src/prover/isabelle/encode.ts +72 -42
- 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 +158 -7
- package/src/prover/isabelle/isar/method.ts +509 -212
- 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 +487 -76
- package/src/prover/isabelle/isar/toplevel.ts +331 -0
- package/src/prover/isabelle/isar/type-check.ts +89 -14
- package/src/prover/isabelle/provers/blast/blast.ts +7 -65
- 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 +19 -30
- package/src/prover/isabelle/pure/bicompose.ts +9 -27
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +2 -10
- package/src/prover/isabelle/pure/drule.ts +72 -6
- 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 +1 -3
- 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 +4 -15
- package/src/prover/isabelle/pure/rewriter.ts +9 -20
- 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 +2 -3
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +42 -37
- 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 +14 -13
- 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 +18 -16
- package/src/prover/isabelle/tla/context.ts +58 -11
- package/src/prover/isabelle/tla/logic-data.ts +1 -1
- package/src/prover/isabelle/tla/logic.ts +49 -21
- package/src/prover/isabelle/tla/simpdata.ts +1 -12
- package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
- package/src/prover/ocaml.ts +4 -1
- package/src/prover/prep/action.ts +30 -31
- package/src/prover/prep/enabled-axioms.ts +11 -2
- package/src/prover/prep/fingerprint.ts +2 -5
- package/src/prover/prep/md5.ts +26 -29
- package/src/prover/prep/methods.ts +181 -51
- package/src/prover/prep/normalize.ts +38 -9
- package/src/prover/prove.ts +395 -94
- 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 +43 -8
- package/src/prover/smt/data.ts +498 -379
- package/src/prover/smt/encode.ts +148 -57
- 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 +1016 -618
- package/src/prover/smt/simplify.ts +441 -0
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -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 +624 -9
- package/src/prover/smt/solver/arith-terms.ts +121 -0
- package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
- package/src/prover/smt/solver/array-rewriter.ts +319 -0
- package/src/prover/smt/solver/asserted-formulas.ts +240 -56
- 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 +1483 -45
- package/src/prover/smt/solver/auf-solver.ts +25 -18
- package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
- package/src/prover/smt/solver/bit-blaster.ts +871 -0
- package/src/prover/smt/solver/blast-term-ite.ts +47 -0
- package/src/prover/smt/solver/bound-manager.ts +196 -0
- package/src/prover/smt/solver/bound-simplifier.ts +598 -0
- package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
- package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
- package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
- package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
- package/src/prover/smt/solver/bv1-blast.ts +214 -0
- package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
- package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
- package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
- package/src/prover/smt/solver/card2bv.ts +127 -0
- package/src/prover/smt/solver/case-split-queue.ts +0 -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 +293 -0
- package/src/prover/smt/solver/conflict-resolution.ts +78 -2
- package/src/prover/smt/solver/context.ts +598 -128
- package/src/prover/smt/solver/ctx-simplify.ts +29 -14
- package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
- package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
- package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
- package/src/prover/smt/solver/demodulator.ts +786 -0
- package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
- package/src/prover/smt/solver/der.ts +38 -10
- package/src/prover/smt/solver/diff-neq.ts +207 -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 +298 -0
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +7 -8
- package/src/prover/smt/solver/elim-bounds.ts +89 -0
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
- package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
- package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
- package/src/prover/smt/solver/enode.ts +100 -3
- package/src/prover/smt/solver/eq2bv-tactic.ts +227 -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 +734 -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 +886 -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 +178 -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 +34 -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 +111 -39
- 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 +355 -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 +30 -11
- 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 +1 -10
- 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 +1 -2
- 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 +41 -5
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
- 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 +68 -17
- 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 +122 -90
- 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 +310 -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 +106 -0
- package/src/prover/smt/solver/maxsmt.ts +92 -0
- package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
- package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
- package/src/prover/smt/solver/model-based-opt.ts +844 -0
- package/src/prover/smt/solver/model-checker.ts +19 -28
- package/src/prover/smt/solver/model-evaluator.ts +190 -12
- package/src/prover/smt/solver/model-finder.ts +12 -18
- package/src/prover/smt/solver/model-generator.ts +104 -35
- package/src/prover/smt/solver/model-macro-solver.ts +49 -46
- package/src/prover/smt/solver/model-printer.ts +214 -0
- package/src/prover/smt/solver/mpf.ts +709 -0
- package/src/prover/smt/solver/mus.ts +50 -0
- package/src/prover/smt/solver/muz/dl-context.ts +382 -0
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
- package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
- package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
- package/src/prover/smt/solver/muz/hnf.ts +201 -0
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
- package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
- package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
- package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
- package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
- package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
- package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
- package/src/prover/smt/solver/muz/substitution.ts +203 -0
- package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
- package/src/prover/smt/solver/nlqsat.ts +485 -0
- package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
- package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +427 -229
- package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
- package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
- package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
- package/src/prover/smt/solver/nlsat/solver.ts +293 -92
- 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 +9 -8
- 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 +110 -24
- package/src/prover/smt/solver/normalize-bounds.ts +53 -0
- package/src/prover/smt/solver/occf.ts +97 -0
- package/src/prover/smt/solver/opt-context.ts +801 -0
- package/src/prover/smt/solver/opt-nlsat.ts +386 -0
- package/src/prover/smt/solver/opt-pareto.ts +301 -0
- package/src/prover/smt/solver/opt-preprocess.ts +101 -0
- package/src/prover/smt/solver/opt-solver.ts +312 -0
- package/src/prover/smt/solver/opt-value.ts +55 -0
- package/src/prover/smt/solver/optsmt.ts +692 -0
- package/src/prover/smt/solver/parallel-tactic.ts +299 -0
- package/src/prover/smt/solver/pattern-inference.ts +19 -11
- package/src/prover/smt/solver/pb-rewriter.ts +281 -0
- package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
- package/src/prover/smt/solver/poly-rewriter.ts +259 -57
- package/src/prover/smt/solver/probes.ts +577 -0
- package/src/prover/smt/solver/propagate-values.ts +37 -21
- package/src/prover/smt/solver/proto-model.ts +648 -19
- package/src/prover/smt/solver/pull-quant.ts +28 -12
- package/src/prover/smt/solver/purify-arith.ts +634 -0
- package/src/prover/smt/solver/push-app-ite.ts +37 -0
- package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
- package/src/prover/smt/solver/qe-lite-der.ts +2 -3
- package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
- package/src/prover/smt/solver/qe-lite.ts +39 -19
- 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 +829 -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 +19 -20
- package/src/prover/smt/solver/quantifier-manager.ts +22 -25
- 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 +82 -14
- package/src/prover/smt/solver/rewriter.ts +505 -60
- package/src/prover/smt/solver/rlimit.ts +45 -5
- 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 +589 -0
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
- package/src/prover/smt/solver/sat/model-converter.ts +136 -0
- package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
- package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
- package/src/prover/smt/solver/sat/probing.ts +170 -0
- package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
- package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
- package/src/prover/smt/solver/sat/scc.ts +142 -0
- package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
- package/src/prover/smt/solver/sat/solver.ts +2107 -0
- package/src/prover/smt/solver/sat/var-queue.ts +117 -0
- package/src/prover/smt/solver/sat/watch-list.ts +140 -0
- package/src/prover/smt/solver/search-tree.ts +284 -0
- package/src/prover/smt/solver/seq-axioms.ts +995 -0
- package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
- package/src/prover/smt/solver/seq-derive.ts +1298 -0
- package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
- package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
- package/src/prover/smt/solver/seq-factory.ts +89 -0
- package/src/prover/smt/solver/seq-monadic.ts +730 -0
- package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
- package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
- package/src/prover/smt/solver/seq-re-util.ts +758 -0
- package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
- package/src/prover/smt/solver/seq-regex-live.ts +200 -0
- package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
- package/src/prover/smt/solver/seq-skolem.ts +294 -0
- package/src/prover/smt/solver/seq-subset.ts +165 -0
- package/src/prover/smt/solver/seq-view-witness.ts +353 -0
- package/src/prover/smt/solver/smt-consequences.ts +297 -0
- package/src/prover/smt/solver/smt-kernel.ts +124 -0
- package/src/prover/smt/solver/smt-logics.ts +66 -0
- package/src/prover/smt/solver/smt-setup.ts +589 -0
- package/src/prover/smt/solver/smt2-printer.ts +765 -0
- package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
- package/src/prover/smt/solver/smtlib-script.ts +2136 -0
- package/src/prover/smt/solver/solve-eqs.ts +928 -0
- package/src/prover/smt/solver/solver.ts +128 -23
- 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 +2176 -0
- package/src/prover/smt/solver/term-enumeration.ts +205 -0
- package/src/prover/smt/solver/theory-array.ts +1240 -0
- package/src/prover/smt/solver/theory-bv.ts +1210 -0
- package/src/prover/smt/solver/theory-char.ts +355 -0
- package/src/prover/smt/solver/theory-datatype.ts +598 -0
- package/src/prover/smt/solver/theory-finite-set.ts +30 -0
- package/src/prover/smt/solver/theory-fpa.ts +389 -0
- package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
- package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
- package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
- package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
- package/src/prover/smt/solver/theory-lra-model.ts +20 -35
- package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
- package/src/prover/smt/solver/theory-lra-state.ts +7 -23
- package/src/prover/smt/solver/theory-lra.ts +189 -2
- package/src/prover/smt/solver/theory-pb.ts +951 -0
- package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
- package/src/prover/smt/solver/theory-recfun.ts +307 -0
- package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
- package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
- package/src/prover/smt/solver/theory-seq-state.ts +852 -0
- package/src/prover/smt/solver/theory-seq.ts +961 -0
- package/src/prover/smt/solver/theory-without-terms.ts +24 -0
- package/src/prover/smt/solver/theory.ts +189 -0
- package/src/prover/smt/solver/tseitin-cnf.ts +495 -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 +57 -26
- package/src/prover/tlapm/tlapm.ts +15 -9
- package/src/prover/tlapm-library.ts +3208 -0
- package/src/prover/verdict.ts +9 -0
- package/src/prover/zenon/check/check.ts +1 -2
- package/src/prover/zenon/check/records.ts +1 -1
- package/src/prover/zenon/check/relations.ts +2 -1
- package/src/prover/zenon/check/rewrites.ts +2 -15
- package/src/prover/zenon/check/sets.ts +40 -58
- package/src/prover/zenon/check/terms.ts +1 -2
- package/src/prover/zenon/decide.ts +10 -7
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +2 -2
- package/src/prover/zenon/equality-rules.ts +24 -2
- package/src/prover/zenon/expr.ts +28 -2
- package/src/prover/zenon/index-table.ts +16 -23
- package/src/prover/zenon/isar-case.ts +1 -3
- package/src/prover/zenon/isar.ts +37 -39
- package/src/prover/zenon/llproof.ts +2 -13
- package/src/prover/zenon/mltoll.ts +12 -30
- package/src/prover/zenon/node.ts +20 -5
- package/src/prover/zenon/parse.ts +9 -8
- 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 +11 -19
- package/src/prover/zenon/tla/functions.ts +2 -4
- package/src/prover/zenon/tla/llproof.ts +9 -13
- package/src/prover/zenon/tla/records.ts +1 -8
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +22 -22
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +7 -8
- package/src/resolve.ts +1327 -328
- package/src/runtime.ts +25 -2
- package/src/sany/builtins.ts +10 -10
- package/src/sany/generation.ts +384 -0
- package/src/sany/generator-def-entries.ts +297 -0
- package/src/sany/generator-definitions.ts +688 -0
- package/src/sany/generator-expressions.ts +1123 -0
- package/src/sany/generator-proofs.ts +668 -0
- package/src/sany/generator.ts +161 -2625
- package/src/sany/levels.ts +0 -2
- package/src/sany/lexer.ts +32 -23
- package/src/sany/linter.ts +0 -2
- package/src/sany/modules.ts +4 -2
- package/src/sany/nodes.ts +3 -4
- package/src/sany/report.ts +3 -6
- package/src/sany/selectors.ts +46 -44
- package/src/sany/xml.ts +25 -58
- package/src/search.ts +513 -165
- package/src/simulate.ts +340 -251
- package/src/spec-description.ts +48 -55
- package/src/standard-definitions.ts +5 -0
- package/src/standard-modules.ts +72 -54
- package/src/state-graph.ts +0 -2
- package/src/subexpressions.ts +564 -138
- package/src/substitution-levels.ts +5 -4
- package/src/successors.ts +56 -28
- package/src/symmetry.ts +4 -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 +23 -18
- package/src/tlc/order.ts +14 -3
- package/src/tlc/random.ts +6 -5
- package/src/tlc/replay.ts +152 -58
- package/src/tlc/summary.ts +29 -14
- package/src/tlc/tlc-operators.ts +12 -11
- package/src/tlc/tlcext-operators.ts +87 -26
- package/src/tlc/trace-spec.ts +27 -60
- package/src/trace-liveness.ts +529 -0
- package/src/typed-tier.ts +6556 -0
- package/src/typescript/actions.ts +2 -4
- package/src/typescript/collections.ts +34 -20
- package/src/typescript/compile.ts +1 -3
- package/src/typescript/formula.ts +5 -3
- package/src/typescript/model.ts +4 -5
- package/src/typescript/steps.ts +20 -18
- package/src/typescript/types.ts +2 -2
- package/src/values.ts +208 -227
- 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/tlc/replay.ts
CHANGED
|
@@ -2,8 +2,10 @@ import type { Expression, SourceLocation } from "../ast";
|
|
|
2
2
|
import { TlaEvaluationError } from "../errors";
|
|
3
3
|
import { isConstantLevel } from "../dependencies";
|
|
4
4
|
import {
|
|
5
|
+
chargeContexts,
|
|
6
|
+
chargeRandomOrder,
|
|
5
7
|
countCoverage,
|
|
6
|
-
|
|
8
|
+
createChargedEnumerator,
|
|
7
9
|
getCoverageNode,
|
|
8
10
|
runAtCoverageNode,
|
|
9
11
|
type Coverage,
|
|
@@ -16,6 +18,7 @@ import {
|
|
|
16
18
|
evaluate,
|
|
17
19
|
forEachBoundElement,
|
|
18
20
|
freezeCallStack,
|
|
21
|
+
getContextElements,
|
|
19
22
|
getLazyFunction,
|
|
20
23
|
getQuantifierElements,
|
|
21
24
|
mapBoundSets,
|
|
@@ -38,7 +41,9 @@ import {
|
|
|
38
41
|
type Value,
|
|
39
42
|
} from "../values";
|
|
40
43
|
import { substitutionFrames } from "../instances";
|
|
44
|
+
import type { SuccessorGenerator } from "../successors";
|
|
41
45
|
import { MESSAGE_CODE } from "./messages";
|
|
46
|
+
import { getRandomSubset, nextPrime } from "./random";
|
|
42
47
|
|
|
43
48
|
interface ReplayAction {
|
|
44
49
|
expression: Expression;
|
|
@@ -61,7 +66,8 @@ interface Replay {
|
|
|
61
66
|
isEnabled: boolean;
|
|
62
67
|
current: Value[] | undefined;
|
|
63
68
|
onState: (state: Value[]) => void;
|
|
64
|
-
onIncomplete: ((state: State) =>
|
|
69
|
+
onIncomplete: ((state: State) => boolean) | undefined;
|
|
70
|
+
generator: SuccessorGenerator | undefined;
|
|
65
71
|
}
|
|
66
72
|
|
|
67
73
|
const withFrame = <Result>(replay: Replay, expression: Expression, run: () => Result): Result => {
|
|
@@ -216,8 +222,7 @@ const proceedItems = (
|
|
|
216
222
|
): boolean => {
|
|
217
223
|
if (items === undefined) {
|
|
218
224
|
if (isComplete(partial)) return addState(replay, partial, node);
|
|
219
|
-
replay.onIncomplete?.(partial);
|
|
220
|
-
return false;
|
|
225
|
+
return replay.onIncomplete?.(partial) ?? false;
|
|
221
226
|
}
|
|
222
227
|
if (isComplete(partial) && isAssignedShortcut(replay)) {
|
|
223
228
|
return proceedAssigned(replay, items, partial, node);
|
|
@@ -309,16 +314,19 @@ const visitAt = (
|
|
|
309
314
|
case "Let": {
|
|
310
315
|
const context = getContext(replay, scope, partial);
|
|
311
316
|
const definitions = expression.definitions;
|
|
312
|
-
const bound =
|
|
313
|
-
|
|
314
|
-
|
|
315
|
-
|
|
316
|
-
|
|
317
|
-
|
|
317
|
+
const bound =
|
|
318
|
+
replay.coverage && !replay.isEnabled
|
|
319
|
+
? bindDefinitions(definitions, context, {
|
|
320
|
+
impure: new Set(definitions),
|
|
321
|
+
streamed: new Set(),
|
|
322
|
+
})
|
|
323
|
+
: bindDefinitions(definitions, context);
|
|
318
324
|
return visit(replay, expression.body, items, bound, partial, node);
|
|
319
325
|
}
|
|
320
326
|
case "Label":
|
|
321
327
|
return visit(replay, expression.body, items, scope, partial, node);
|
|
328
|
+
case "Selection":
|
|
329
|
+
return visit(replay, expression.expression, items, scope, partial, node);
|
|
322
330
|
default:
|
|
323
331
|
if (LITERAL_KINDS.has(expression.kind))
|
|
324
332
|
throw new TlaEvaluationError("The state relation is not a boolean expression.");
|
|
@@ -434,11 +442,6 @@ const createItem = (
|
|
|
434
442
|
rest: ActionItem | undefined,
|
|
435
443
|
): ActionItem => ({ kind, expression, scope, node, rest });
|
|
436
444
|
|
|
437
|
-
const getEnumerated = (replay: Replay, set: Value, elements: Value[]) => {
|
|
438
|
-
if (replay.coverage) costCoverage(replay.coverage, set, elements.length + 1);
|
|
439
|
-
return elements;
|
|
440
|
-
};
|
|
441
|
-
|
|
442
445
|
const visitAssignment = (
|
|
443
446
|
replay: Replay,
|
|
444
447
|
expression: Expression & { kind: "Apply" },
|
|
@@ -464,7 +467,10 @@ const visitAssignment = (
|
|
|
464
467
|
return proceedWithValue(replay, items, partial, index, value, node);
|
|
465
468
|
}
|
|
466
469
|
const set: Value = expression.operator === "\\subseteq" ? { kind: "Subset", base: value } : value;
|
|
467
|
-
if (typeof set === "object" && set !== value)
|
|
470
|
+
if (typeof set === "object" && set !== value) {
|
|
471
|
+
replay.callStack?.sources.set(set, source);
|
|
472
|
+
replay.coverage?.values.set(set, node);
|
|
473
|
+
}
|
|
468
474
|
if (assigned !== undefined) {
|
|
469
475
|
return (
|
|
470
476
|
evaluateAt(replay, node, expression, context) === true &&
|
|
@@ -473,11 +479,23 @@ const visitAssignment = (
|
|
|
473
479
|
}
|
|
474
480
|
if (!isTlcEnumerable(set))
|
|
475
481
|
throw new TlaEvaluationError("The right side of \\IN is not enumerable.");
|
|
476
|
-
|
|
477
|
-
|
|
478
|
-
|
|
479
|
-
|
|
480
|
-
|
|
482
|
+
const elements = getStreamedElements(set);
|
|
483
|
+
const generator = replay.generator;
|
|
484
|
+
if (generator) {
|
|
485
|
+
const order = getRandomOrder(replay, set, elements);
|
|
486
|
+
for (let position = 0; position < order.length; position++) {
|
|
487
|
+
const isProduced = proceed(replay, items, assign(partial, index, order[position]), node);
|
|
488
|
+
if (generator.kept > 0) return isProduced;
|
|
489
|
+
}
|
|
490
|
+
}
|
|
491
|
+
const enumerator =
|
|
492
|
+
replay.coverage && createChargedEnumerator(replay.coverage, set, elements, false);
|
|
493
|
+
const isProduced = elements.reduce<boolean>((isProduced, element) => {
|
|
494
|
+
enumerator?.next();
|
|
495
|
+
return proceed(replay, items, assign(partial, index, element), node) || isProduced;
|
|
496
|
+
}, false);
|
|
497
|
+
enumerator?.next();
|
|
498
|
+
return isProduced;
|
|
481
499
|
};
|
|
482
500
|
|
|
483
501
|
const ASSIGNMENT_OPERATORS = new Set(["=", "\\in", "\\subseteq"]);
|
|
@@ -512,6 +530,13 @@ export const getEnabledFailure = (expression: Expression) => {
|
|
|
512
530
|
return undefined;
|
|
513
531
|
};
|
|
514
532
|
|
|
533
|
+
const getRandomOrder = (replay: Replay, set: Value, elements: Value[]) => {
|
|
534
|
+
const runtime = replay.environment.runtime;
|
|
535
|
+
const order = getRandomSubset(elements.length, set, runtime.getRandom(), runtime.version);
|
|
536
|
+
if (replay.coverage) chargeRandomOrder(replay.coverage, set, elements.length, order);
|
|
537
|
+
return order;
|
|
538
|
+
};
|
|
539
|
+
|
|
515
540
|
const getBindings = (
|
|
516
541
|
replay: Replay,
|
|
517
542
|
expression: Expression & { kind: "Exists" | "Forall" },
|
|
@@ -520,19 +545,26 @@ const getBindings = (
|
|
|
520
545
|
) => {
|
|
521
546
|
const bindings: (Scope | undefined)[] = [];
|
|
522
547
|
const version = replay.environment.runtime.version;
|
|
523
|
-
const
|
|
548
|
+
const bounded = runAt(replay, node, () =>
|
|
524
549
|
mapBoundSets(expression.bounds, (set) => {
|
|
525
550
|
const value = evaluate(set, context);
|
|
526
|
-
|
|
527
|
-
if (Array.isArray(elements)) getEnumerated(replay, value, elements);
|
|
528
|
-
return elements;
|
|
551
|
+
return { value, elements: getQuantifierElements(value, set, version) };
|
|
529
552
|
}),
|
|
530
553
|
);
|
|
554
|
+
const sets = bounded.map((item) => item.elements);
|
|
531
555
|
forEachBoundElement(expression.bounds, sets, context.scope, (bound) => {
|
|
532
556
|
bindings.push(bound);
|
|
533
557
|
return false;
|
|
534
558
|
});
|
|
535
|
-
|
|
559
|
+
const coverage = replay.coverage;
|
|
560
|
+
const charge =
|
|
561
|
+
coverage &&
|
|
562
|
+
chargeContexts(
|
|
563
|
+
coverage,
|
|
564
|
+
bounded.map((item) => item.value),
|
|
565
|
+
sets,
|
|
566
|
+
);
|
|
567
|
+
return { bindings, charge };
|
|
536
568
|
};
|
|
537
569
|
|
|
538
570
|
const visitApplication = (
|
|
@@ -582,7 +614,39 @@ const visitApplication = (
|
|
|
582
614
|
}
|
|
583
615
|
case "Or": {
|
|
584
616
|
const operands = expression.operands;
|
|
585
|
-
|
|
617
|
+
const isWhole = expression.isBulleted || operands.length === 2;
|
|
618
|
+
const generator = replay.generator;
|
|
619
|
+
if (generator) {
|
|
620
|
+
const count = isWhole ? operands.length : 2;
|
|
621
|
+
const start = Math.floor(generator.random.nextDouble() * count);
|
|
622
|
+
const prime = nextPrime(generator.random);
|
|
623
|
+
let isProduced = false;
|
|
624
|
+
for (let attempt = 0; attempt < count; attempt++) {
|
|
625
|
+
const choice = (start + attempt * prime) % count;
|
|
626
|
+
const isChoiceProduced =
|
|
627
|
+
isWhole || choice === 1
|
|
628
|
+
? visit(
|
|
629
|
+
replay,
|
|
630
|
+
operands[isWhole ? choice : operands.length - 1],
|
|
631
|
+
items,
|
|
632
|
+
scope,
|
|
633
|
+
partial,
|
|
634
|
+
node,
|
|
635
|
+
)
|
|
636
|
+
: visitAt(
|
|
637
|
+
replay,
|
|
638
|
+
getPrefix(expression, operands.length - 1),
|
|
639
|
+
items,
|
|
640
|
+
scope,
|
|
641
|
+
partial,
|
|
642
|
+
getPrefixNode(replay, node),
|
|
643
|
+
);
|
|
644
|
+
isProduced = isChoiceProduced || isProduced;
|
|
645
|
+
if (generator.kept > 0) return isProduced;
|
|
646
|
+
}
|
|
647
|
+
return isProduced;
|
|
648
|
+
}
|
|
649
|
+
if (isWhole) {
|
|
586
650
|
return operands.reduce(
|
|
587
651
|
(isProduced, operand) =>
|
|
588
652
|
visit(replay, operand, items, scope, partial, node) || isProduced,
|
|
@@ -607,14 +671,36 @@ const visitApplication = (
|
|
|
607
671
|
);
|
|
608
672
|
return isPrefixProduced || isLastProduced;
|
|
609
673
|
}
|
|
610
|
-
case "Exists":
|
|
611
|
-
|
|
612
|
-
|
|
613
|
-
|
|
614
|
-
|
|
615
|
-
|
|
674
|
+
case "Exists": {
|
|
675
|
+
const generator = replay.generator;
|
|
676
|
+
if (generator) {
|
|
677
|
+
const version = replay.environment.runtime.version;
|
|
678
|
+
const orders = runAt(replay, node, () =>
|
|
679
|
+
mapBoundSets(expression.bounds, (set) => evaluate(set, context)),
|
|
680
|
+
).map((set, position) =>
|
|
681
|
+
getRandomOrder(
|
|
682
|
+
replay,
|
|
683
|
+
set,
|
|
684
|
+
getContextElements(set, expression.bounds[position].set, version),
|
|
685
|
+
),
|
|
686
|
+
);
|
|
687
|
+
let isProduced = false;
|
|
688
|
+
forEachBoundElement(expression.bounds, orders, context.scope, (bound) => {
|
|
689
|
+
isProduced = visit(replay, expression.body, items, bound, partial, node) || isProduced;
|
|
690
|
+
return generator.kept > 0;
|
|
691
|
+
});
|
|
692
|
+
return isProduced;
|
|
693
|
+
}
|
|
694
|
+
const bound = getBindings(replay, expression, context, node);
|
|
695
|
+
return bound.bindings.reduce((isProduced, scope) => {
|
|
696
|
+
bound.charge?.();
|
|
697
|
+
return visit(replay, expression.body, items, scope, partial, node) || isProduced;
|
|
698
|
+
}, false);
|
|
699
|
+
}
|
|
616
700
|
case "Forall": {
|
|
617
|
-
const
|
|
701
|
+
const bound = getBindings(replay, expression, context, node);
|
|
702
|
+
const bounds = bound.bindings;
|
|
703
|
+
bounds.forEach(() => bound.charge?.());
|
|
618
704
|
if (bounds.length === 0) return proceed(replay, items, partial, node);
|
|
619
705
|
const rest = bounds
|
|
620
706
|
.slice(1)
|
|
@@ -715,6 +801,7 @@ const visitUnchanged = (
|
|
|
715
801
|
if (index !== undefined) {
|
|
716
802
|
const value = replay.current?.[index];
|
|
717
803
|
if (value === undefined) return false;
|
|
804
|
+
if (replay.isEnabled && replay.coverage) countCoverage(replay.coverage, node);
|
|
718
805
|
const assigned = partial[index];
|
|
719
806
|
if (assigned !== undefined && !isEqualLikeTlc(assigned, value)) {
|
|
720
807
|
warnChangedUnchanged(replay.environment, index, expression);
|
|
@@ -776,20 +863,22 @@ const visitUnchanged = (
|
|
|
776
863
|
|
|
777
864
|
const createReplay = (
|
|
778
865
|
environment: Environment,
|
|
779
|
-
|
|
866
|
+
kind: "init" | "next" | "enabled",
|
|
780
867
|
current: Value[] | undefined,
|
|
781
868
|
onState: (state: Value[]) => void,
|
|
782
|
-
|
|
783
|
-
|
|
869
|
+
onIncomplete?: (state: State) => boolean,
|
|
870
|
+
generator?: SuccessorGenerator,
|
|
784
871
|
): Replay => ({
|
|
785
872
|
environment,
|
|
786
873
|
callStack: environment.callStack,
|
|
787
|
-
coverage:
|
|
788
|
-
|
|
789
|
-
|
|
874
|
+
coverage:
|
|
875
|
+
kind === "enabled" && environment.coverage?.current === -1 ? undefined : environment.coverage,
|
|
876
|
+
isInit: kind === "init",
|
|
877
|
+
isEnabled: kind === "enabled",
|
|
790
878
|
current,
|
|
791
879
|
onState,
|
|
792
880
|
onIncomplete,
|
|
881
|
+
generator,
|
|
793
882
|
});
|
|
794
883
|
|
|
795
884
|
const ENABLED_FOUND = new Error("The replay found a successor");
|
|
@@ -800,23 +889,19 @@ export const replayEnabled = (
|
|
|
800
889
|
state: Value[],
|
|
801
890
|
environment: Environment,
|
|
802
891
|
) => {
|
|
803
|
-
const
|
|
804
|
-
|
|
805
|
-
|
|
806
|
-
|
|
807
|
-
|
|
808
|
-
throw ENABLED_FOUND;
|
|
809
|
-
},
|
|
810
|
-
true,
|
|
811
|
-
);
|
|
892
|
+
const found = () => {
|
|
893
|
+
throw ENABLED_FOUND;
|
|
894
|
+
};
|
|
895
|
+
const node = environment.coverage?.current ?? -1;
|
|
896
|
+
const replay = createReplay(environment, "enabled", state, found, found);
|
|
812
897
|
const callStack = replay.callStack;
|
|
813
898
|
const depth = callStack?.expressions.length ?? 0;
|
|
814
899
|
try {
|
|
815
900
|
if (expression.kind === "AngleAction" && expression.location === expression.action.location) {
|
|
816
|
-
const changed = createItem("Changed", expression.subscript, scope,
|
|
817
|
-
visit(replay, expression.action, changed, scope, getEmptyState(environment),
|
|
901
|
+
const changed = createItem("Changed", expression.subscript, scope, node, undefined);
|
|
902
|
+
visit(replay, expression.action, changed, scope, getEmptyState(environment), node);
|
|
818
903
|
} else {
|
|
819
|
-
visit(replay, expression, undefined, scope, getEmptyState(environment),
|
|
904
|
+
visit(replay, expression, undefined, scope, getEmptyState(environment), node);
|
|
820
905
|
}
|
|
821
906
|
return false;
|
|
822
907
|
} catch (error) {
|
|
@@ -833,11 +918,11 @@ export const replayInitialStates = (
|
|
|
833
918
|
inits: (ReplayAction & { node?: number })[],
|
|
834
919
|
environment: Environment,
|
|
835
920
|
onState: (state: Value[]) => void,
|
|
836
|
-
onIncomplete?: (state: State) =>
|
|
921
|
+
onIncomplete?: (state: State) => boolean,
|
|
837
922
|
) => {
|
|
838
923
|
const [first, ...others] = inits;
|
|
839
924
|
if (first === undefined) return;
|
|
840
|
-
const replay = createReplay(environment,
|
|
925
|
+
const replay = createReplay(environment, "init", undefined, onState, onIncomplete);
|
|
841
926
|
const rest = others.reduceRight<ActionItem | undefined>(
|
|
842
927
|
(tail, init) => createItem("Predicate", init.expression, init.scope, init.node ?? -1, tail),
|
|
843
928
|
undefined,
|
|
@@ -845,16 +930,21 @@ export const replayInitialStates = (
|
|
|
845
930
|
visit(replay, first.expression, rest, first.scope, getEmptyState(environment), first.node ?? -1);
|
|
846
931
|
};
|
|
847
932
|
|
|
848
|
-
export const replaySuccessors = <Action extends ReplayAction>(
|
|
933
|
+
export const replaySuccessors = <Action extends ReplayAction & { node?: number }>(
|
|
849
934
|
actions: Action[],
|
|
850
935
|
state: Value[],
|
|
851
936
|
environment: Environment,
|
|
852
937
|
onState: (state: Value[], action: Action) => void,
|
|
853
938
|
) => {
|
|
854
939
|
if (actions.some((action) => LITERAL_KINDS.has(action.expression.kind))) return;
|
|
940
|
+
const coverage = environment.coverage;
|
|
855
941
|
actions.forEach((action) => {
|
|
856
942
|
const successors: Value[][] = [];
|
|
857
|
-
|
|
943
|
+
const node = action.node ?? -1;
|
|
944
|
+
walkSuccessors(action, node, state, environment, (next) => {
|
|
945
|
+
if (coverage && node !== -1) coverage.primary[node]++;
|
|
946
|
+
successors.push(next);
|
|
947
|
+
});
|
|
858
948
|
successors.forEach((successor) => onState(successor, action));
|
|
859
949
|
});
|
|
860
950
|
};
|
|
@@ -865,9 +955,10 @@ export const walkSuccessors = (
|
|
|
865
955
|
state: Value[],
|
|
866
956
|
environment: Environment,
|
|
867
957
|
onState: (state: Value[]) => void,
|
|
868
|
-
onIncomplete?: (state: State) =>
|
|
958
|
+
onIncomplete?: (state: State) => boolean,
|
|
959
|
+
generator?: SuccessorGenerator,
|
|
869
960
|
) => {
|
|
870
|
-
const replay = createReplay(environment,
|
|
961
|
+
const replay = createReplay(environment, "next", state, onState, onIncomplete, generator);
|
|
871
962
|
visit(replay, action.expression, undefined, action.scope, getEmptyState(environment), node);
|
|
872
963
|
};
|
|
873
964
|
|
|
@@ -914,6 +1005,9 @@ export const getPrimedRanges = (actions: ReplayAction[], environment: Environmen
|
|
|
914
1005
|
case "Label":
|
|
915
1006
|
collect(expression.body, scope, visited);
|
|
916
1007
|
return;
|
|
1008
|
+
case "Selection":
|
|
1009
|
+
collect(expression.expression, scope, visited);
|
|
1010
|
+
return;
|
|
917
1011
|
case "FunctionApplication":
|
|
918
1012
|
collect(expression.function, scope, visited);
|
|
919
1013
|
return;
|
package/src/tlc/summary.ts
CHANGED
|
@@ -69,30 +69,45 @@ export const getActualProbability = (distance: bigint) => {
|
|
|
69
69
|
return Number(`${quotient + (isRoundedUp ? 1n : 0n)}e-${exponent + 1}`);
|
|
70
70
|
};
|
|
71
71
|
|
|
72
|
+
// The fingerprints come in runs, each of which holds only fingerprints below those of the next.
|
|
72
73
|
export const getFingerprintDistance = (
|
|
73
74
|
distinctStates: number,
|
|
74
75
|
generatedStates: number,
|
|
75
|
-
|
|
76
|
+
forEachRun: (visit: (run: BigInt64Array) => void) => void,
|
|
76
77
|
) => {
|
|
77
78
|
const probability = getOptimisticProbability(distinctStates, generatedStates);
|
|
78
79
|
if (probability < ACTUAL_PROBABILITY_THRESHOLD) return undefined;
|
|
79
|
-
const fingerprints = getFingerprints().sort();
|
|
80
|
-
const words = new Int32Array(fingerprints.buffer);
|
|
81
80
|
let narrowest = Number.POSITIVE_INFINITY;
|
|
82
81
|
let widest = 0x7fff_ffff_ffff_ffffn;
|
|
83
|
-
|
|
84
|
-
|
|
85
|
-
|
|
86
|
-
|
|
87
|
-
|
|
88
|
-
|
|
89
|
-
const gap = highGap * 0x1_0000_0000 + (words[2 * index] >>> 0) - (words[2 * index - 2] >>> 0);
|
|
90
|
-
narrowest = Math.min(narrowest, gap);
|
|
91
|
-
} else {
|
|
92
|
-
const gap = fingerprints[index] - fingerprints[index - 1];
|
|
82
|
+
let previous: bigint | undefined;
|
|
83
|
+
forEachRun((run) => {
|
|
84
|
+
if (run.length === 0) return;
|
|
85
|
+
const fingerprints = run.sort();
|
|
86
|
+
if (previous !== undefined && previous < 0n === fingerprints[0] < 0n) {
|
|
87
|
+
const gap = fingerprints[0] - previous;
|
|
93
88
|
if (gap < widest) widest = gap;
|
|
94
89
|
}
|
|
95
|
-
|
|
90
|
+
previous = fingerprints[fingerprints.length - 1];
|
|
91
|
+
const words = new Int32Array(
|
|
92
|
+
fingerprints.buffer,
|
|
93
|
+
fingerprints.byteOffset,
|
|
94
|
+
fingerprints.length * 2,
|
|
95
|
+
);
|
|
96
|
+
for (let index = 1; index < fingerprints.length; index++) {
|
|
97
|
+
const high = words[2 * index + 1];
|
|
98
|
+
const previousHigh = words[2 * index - 1];
|
|
99
|
+
if (high < 0 !== previousHigh < 0) continue;
|
|
100
|
+
const highGap = high - previousHigh;
|
|
101
|
+
if (highGap <= 0x10_0000) {
|
|
102
|
+
const gap =
|
|
103
|
+
highGap * 0x1_0000_0000 + (words[2 * index] >>> 0) - (words[2 * index - 2] >>> 0);
|
|
104
|
+
narrowest = Math.min(narrowest, gap);
|
|
105
|
+
} else {
|
|
106
|
+
const gap = fingerprints[index] - fingerprints[index - 1];
|
|
107
|
+
if (gap < widest) widest = gap;
|
|
108
|
+
}
|
|
109
|
+
}
|
|
110
|
+
});
|
|
96
111
|
if (narrowest === Number.POSITIVE_INFINITY) return widest;
|
|
97
112
|
const narrow = BigInt(narrowest);
|
|
98
113
|
return narrow < widest ? narrow : widest;
|
package/src/tlc/tlc-operators.ts
CHANGED
|
@@ -16,12 +16,13 @@ import {
|
|
|
16
16
|
toEnumeratedSet,
|
|
17
17
|
} from "../builtins";
|
|
18
18
|
import { getNamedRegisters, NAMED_REGISTER_PREFIX, type CheckerRuntime } from "../runtime";
|
|
19
|
-
import { createActionRecord, setTlcValue } from "./tlcext-operators";
|
|
19
|
+
import { createActionRecord, createTlcRecord, setTlcValue } from "./tlcext-operators";
|
|
20
20
|
import { getRandomElement } from "./random";
|
|
21
21
|
import {
|
|
22
22
|
ANY_SET,
|
|
23
23
|
createFunction,
|
|
24
24
|
createSet,
|
|
25
|
+
createSortedFunction,
|
|
25
26
|
createTuple,
|
|
26
27
|
createWrittenFunction,
|
|
27
28
|
formatNormalizedCopies,
|
|
@@ -34,20 +35,17 @@ import {
|
|
|
34
35
|
toFiniteSet,
|
|
35
36
|
type Value,
|
|
36
37
|
rankString,
|
|
37
|
-
setFunctionClass,
|
|
38
38
|
} from "../values";
|
|
39
39
|
import { getFingerprintPolynomial } from "./fingerprint";
|
|
40
|
-
|
|
41
|
-
const padTime = (value: number) => String(value).padStart(2, "0");
|
|
40
|
+
import { zeroPad } from "./messages";
|
|
42
41
|
|
|
43
42
|
const formatCalendarVersion = (date: Date) =>
|
|
44
|
-
`${date.getUTCFullYear()}.${
|
|
43
|
+
`${date.getUTCFullYear()}.${zeroPad(date.getUTCMonth() + 1)}.${zeroPad(date.getUTCDate())}.${zeroPad(date.getUTCHours())}${zeroPad(date.getUTCMinutes())}${zeroPad(date.getUTCSeconds())}`;
|
|
45
44
|
|
|
46
45
|
const getRegisterFunction = <Key extends Value>(registers: Map<Key, Value>) =>
|
|
47
|
-
createFunction(
|
|
48
|
-
|
|
49
|
-
|
|
50
|
-
setFunctionClass(createWrittenFunction(fields), "record");
|
|
46
|
+
createFunction(
|
|
47
|
+
[...registers].map((entry): [Value, Value] => [entry[0], createTuple([entry[1]])]),
|
|
48
|
+
);
|
|
51
49
|
|
|
52
50
|
const CHECKER_KEYS = new Set(["diameter", "generated", "distinct", "queue", "stats", "config"]);
|
|
53
51
|
const TLC_174_KEYS = new Set(["diameter", "distinct", "queue", "duration", "level"]);
|
|
@@ -134,7 +132,7 @@ const getTlcValue = (runtime: CheckerRuntime, key: Value, context: Context | und
|
|
|
134
132
|
}
|
|
135
133
|
if (typeof key !== "string") {
|
|
136
134
|
throw new TlaModuleError(
|
|
137
|
-
`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${formatValue(key)}`,
|
|
135
|
+
`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${prettyPrint(formatValue(key))}`,
|
|
138
136
|
);
|
|
139
137
|
}
|
|
140
138
|
return getRuntimeValue(runtime, key, context?.state);
|
|
@@ -161,8 +159,11 @@ const normalizeDeeply = (value: Value): void => {
|
|
|
161
159
|
const convertLikeTlcEval = (value: Value): Value => {
|
|
162
160
|
if (typeof value !== "object") return value;
|
|
163
161
|
switch (value.kind) {
|
|
164
|
-
case "ModelValue":
|
|
165
162
|
case "Function":
|
|
163
|
+
return value.functionClass === undefined
|
|
164
|
+
? value
|
|
165
|
+
: createSortedFunction(value.domain, value.range);
|
|
166
|
+
case "ModelValue":
|
|
166
167
|
case "MixedSet":
|
|
167
168
|
case "InfiniteSet":
|
|
168
169
|
case "SequenceSet":
|