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/dist/transfer.js
CHANGED
|
@@ -6,85 +6,17 @@
|
|
|
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{$ as e,
|
|
10
|
-
`,t:` `,r:`\r`,f:`\f`},Ee=(e,t)=>t===9?e+8-e%8:e+1,De=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),Oe=(e,t)=>{if(e.charCodeAt(t)!==92)return 0;let n=De.get(e.charAt(t+1).toLowerCase());if(n===void 0)return 0;let r=_e(e,t+2,n);return r===t+2?0:r-t},ke=(e,t=!1)=>{let n=me.exec(e);if(!n)throw new r(`Expected a module header such as ---- MODULE Name ----`);let i=[],a=/* @__PURE__ */ new Map,o=e.slice(0,n.index).split(`
|
|
11
|
-
`),s=n.index,c=o.length,l=n.index-o[o.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==l||f>s)&&(d=l,f=l,p=0);f<s;f++)p=Ee(p,e.charCodeAt(f));return Ee(p,e.charCodeAt(s))},h=(e,t,n,r)=>{let a=m();i.push({kind:e,text:t,spelling:r,line:c,column:a,endColumn:a+n-1}),s+=n},g=t=>{for(let n=0;n<t;n++)e.charCodeAt(s)===10&&(c++,l=s+1),s++},ee=t=>new r(`${t} at line ${c}, column ${m()}`,void 0,{reason:t,line:c,column:m(),isEnd:s>=e.length});for(;s<e.length;){let n=e.charCodeAt(s);if(n===10||n===32||n===9||n===13){g(1);continue}if(n===92&&e.charCodeAt(s+1)===42){g(D(e,s,e=>e!==`
|
|
12
|
-
`&&e!==`\r`)-s);continue}if(n===40&&e.charCodeAt(s+1)===42){let t=0;do{if(s>=e.length)throw ee(`Unterminated comment`);e.startsWith(`(*`,s)?(t++,g(2)):e.startsWith(`*)`,s)?(t--,g(2)):g(1)}while(t>0);continue}if(n===45&&e.startsWith(`----`,s)){let t=D(e,s,e=>e===`-`)-s,n=D(e,s+t,e=>e===` `);e.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,s)){if(h(`ModuleEnd`,`====`,D(e,s,e=>e===`=`)-s),u--,u<=0)break;continue}if(n===34){let t=c,n=m(),r=[];for(g(1);e.charCodeAt(s)!==34;){let t=e.charCodeAt(s);if(s>=e.length||t===10||t===13)throw ee(`Unterminated string`);if(t===92){let t=e[s+1];if(t===void 0||!`ntrf\\"`.includes(t))throw ee(`Invalid escape in string`);r.push(Te[t]??t),g(2)}else r.push(e[s]),g(1)}g(1),i.push({kind:`String`,text:r.join(``),line:t,column:n,endColumn:m()-1});continue}let r=Oe(e,s);if(r>0){h(`Number`,e.slice(s,s+r),r);continue}if(ge(n,7)){let t=_e(e,s,7),r=e.slice(s,t),i=_e(e,s,1);if(i===t){let n=e.charCodeAt(t)===46?_e(e,t+1,1):t,i=n>t+1,a=i?e.slice(s,n):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(s,i);h(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let o=a.get(r)??r;a.set(o,o),h(de.has(r)?`Keyword`:`Identifier`,o,r.length);continue}let o=e[s];if(n>=128&&xe.has(o)){h(`Identifier`,a.get(o)??o,1),a.set(o,o);continue}if(n===60){let n=Ce(e,s,t);if(n>0){h(`Step`,e.slice(s,s+n),n);continue}}let l=E(e,s);if(l){let t=e.slice(s,s+l.length);h(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw ee(`Unexpected character ${JSON.stringify(o)}`)}let _=m();return i.push({kind:`End`,text:``,line:c,column:_,endColumn:_}),i},Ae=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],je=Ae.map(e=>e[0]),Me=new Map(je.map((e,t)=>[e,t]).reverse()),O=e=>{let t=Me.get(e);if(t===void 0)throw new ce(`Unknown SANY token kind ${e}`);return t},Ne=new Map(Ae.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),Pe=Math.max(...[...Ne.keys()].map(e=>e.length)),Fe=Array.from({length:Pe},(e,t)=>Pe-t),Ie=/----+ *MODULE/y,Le=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],Re=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),ze=Re(String.raw`\.\/\\`),Be=Re(String.raw`\.\\\/`),Ve=String.raw`<(?:[0-9]+|\+|\*)>`,He=[[`_BM0`,[Ie]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,ze],[`BOR`,Be],[`IDENTIFIER`,Le],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${Ve}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(Ve,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${Ve}(?:\*\.*|-\.*|\.+)`,`y`)]]],k=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[Ie]]],Ue=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[Ie]],[`BAND`,ze],[`BOR`,Be],[`IDENTIFIER`,Le]],We=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),Ge=(e,t,n)=>e.map(([e,r])=>({kind:O(e),length:Math.max(...r.map(e=>We(e,t,n)))})).reduce((e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,{kind:-1,length:0}),Ke=(e,t)=>{let n=Fe.find(n=>Ne.has(e.slice(t,t+n))),r=Ge(He,e,t);if(n===void 0)return r;let i={kind:Ne.get(e.slice(t,t+n))??-1,length:n};return i.length>r.length||i.length===r.length&&i.kind<r.kind?i:r},qe=e=>e+8-e%8,Je=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
|
|
9
|
+
import{$ as e,A as t,B as n,C as r,F as i,G as a,H as o,I as s,J as c,K as l,P as u,Q as d,S as f,V as p,X as m,Y as h,Z as g,_,at as v,b as y,g as ee,nt as b,q as x,tt as te,u as S,v as C,w as ne,x as w,y as re,z as T}from"./worker.js";import{gzipSync as ie}from"node:zlib";const ae=[[`EOF`],[`BEGIN_PRAGMA`,`--->`],[`_BM1`],[`NUMBER`],[`_BM2`],[`_BM0`],[`SEPARATOR`],[`END_MODULE`],[`ACTION`,`ACTION`,`ACTIONS`],[`ASSUME`,`ASSUME`],[`BOXASSUME`,`[]ASSUME`],[`ASSUMPTION`,`ASSUMPTION`,`AXIOM`],[`CASE`,`CASE`],[`CHOOSE`,`CHOOSE`],[`CONSTANT`,`CONSTANT`,`CONSTANTS`],[`ELSE`,`ELSE`],[`EXCEPT`,`EXCEPT`],[`EXISTS`,`\\E`,`\\exists`,`∃`],[`EXTENDS`,`EXTENDS`],[`FORALL`,`\\A`,`\\forall`,`∀`],[`IF`,`IF`],[`INSTANCE`,`INSTANCE`],[`LET`,`LET`],[`LETIN`,`IN`],[`LOCAL`,`LOCAL`],[`MODULE`,`MODULE`],[`NEW`,`NEW`],[`OTHER`,`OTHER`],[`PROPOSITION`,`PROPOSITION`,`LEMMA`,`COROLLARY`],[`SF`,`SF_`],[`T_EXISTS`,`\\EE`],[`T_FORALL`,`\\AA`],[`THEN`,`THEN`],[`BY`,`BY`],[`ONLY`,`ONLY`],[`DEFINE`,`DEFINE`],[`DF`,`DEF`,`DEFS`],[`THEOREM`,`THEOREM`],[`USE`,`USE`],[`HIDE`,`HIDE`],[`HAVE`,`HAVE`],[`OBVIOUS`,`OBVIOUS`],[`OMITTED`,`OMITTED`],[`LAMBDA`,`LAMBDA`],[`TAKE`,`TAKE`],[`PROOF`,`PROOF`],[`PROVE`,`PROVE`],[`BOXPROVE`,`[]PROVE`],[`QED`,`QED`],[`RECURSIVE`,`RECURSIVE`],[`STATE`,`STATE`],[`TEMPORAL`,`TEMPORAL`,`TEMPORALS`],[`PICK`,`PICK`],[`WITNESS`,`WITNESS`],[`SUFFICES`,`SUFFICES`],[`VARIABLE`,`VARIABLE`,`VARIABLES`],[`WF`,`WF_`],[`WITH`,`WITH`],[`COMMA`,`,`],[`COLON`,`:`],[`COLONCOLON`,`::`,`∷`],[`DOT`,`.`],[`US`,`_`],[`DEF`,`==`,`≜`],[`LBR`,`(`],[`RBR`,`)`],[`DEFBREAK`,`-|-`],[`LSB`,`[`],[`ARSB`,`]_`],[`RSB`,`]`],[`LBC`,`{`],[`RBC`,`}`],[`LAB`,`<<`,`⟨`],[`ARAB`,`>>_`,`⟩_`],[`RAB`,`>>`,`⟩`],[`BANG`,`!`],[`ARROW`,`->`,`→`],[`SUBSTITUTE`,`<-`,`←`],[`MAPTO`,`|->`,`↦`],[`NUMBER_LITERAL`],[`STRING_LITERAL`],[`BAND`],[`BOR`],[`op_57`,`'`],[`op_68`,`^+`,`⁺`],[`op_69`,`^*`],[`op_70`,`^#`],[`op_76`,`-.`],[`op_26`,`\\lnot`,`¬`],[`op_29`,`\\neg`],[`op_58`,`~`],[`CASESEP`,`[]`,`□`],[`op_61`,`<>`,`◇`],[`op_112`,`ENABLED`],[`op_113`,`UNCHANGED`],[`op_114`,`SUBSET`],[`op_115`,`UNION`],[`op_116`,`DOMAIN`],[`op_1`,`//`],[`AND`,`/\\`,`∧`],[`op_3`,`/=`],[`op_4`,`/`],[`OR`,`\\/`,`∨`],...[`\\approx`,`\\asymp`,`\\bigcirc`,`\\bullet`,`\\cap`,`\\cdot`,`\\circ`,`\\cong`,`\\cup`,`\\div`,`\\doteq`,`\\equiv`,`\\geq`,`\\gg`].map(e=>[`infix`,e]),[`IN`,`\\in`,`∈`],...(/* @__PURE__ */ `\\intersect.\\union.\\land.\\leq.\\ll.\\lor.\\o.\\odot.\\ominus.\\oplus.\\oslash.\\otimes.\\prec.\\preceq.\\propto.\\sim.\\simeq.\\sqcap.\\sqcup.\\sqsubset.\\sqsupset.\\sqsubseteq.\\sqsupseteq.\\star.\\subset.\\subseteq.\\succ.\\succeq.\\supset.\\supseteq.\\uplus.\\wr.\\.~>.=>.=<.=|`.split(`.`)).map(e=>[`infix`,e]),[`EQUALS`,`=`],...[`##`,`#`,`^^`,`^`,`--`,`-|`,`-+->`].map(e=>[`infix`,e]),[`op_77`,`-`],...[`**`,`*`,`++`,`+`,`<=>`,`<:`,`<=`,`<`,`>=`,`>`,`...`,`..`,`||`,`|`,`|-`,`|=`,`&&`,`&`,`$$`,`$`,`??`,`%%`,`%`,`@@`,`!!`,`:>`,`:=`,`::=`,`(+)`,`(-)`,`(.)`,`(/)`,`(\\X)`,`\\notin`,...`≈≔≍◯⩴●∩⋅∘≅∪÷≐‥…≡‼≥≫⇔⇒⫤↝≤≪⊣≠∉⊙⊖⊕⊘⊗⇸≺⪯∝⁇⊨⊢∼≃⊓⊔⊏⊑⊐⊒⋆⊂⊆≻⪰⊃⊇×⊎‖≀`,`\\times`].map(e=>[`infix`,e]),[`op_119`,`\\X`],[`IDENTIFIER`],[`ProofStepLexeme`],[`ProofImplicitStepLexeme`],[`ProofStepDotLexeme`],[`BareLevelLexeme`],[`UnnumberedStepLexeme`]],oe=ae.map(e=>e[0]),se=new Map(oe.map((e,t)=>[e,t]).reverse()),E=e=>{let t=se.get(e);if(t===void 0)throw new y(`Unknown SANY token kind ${e}`);return t},ce=new Map(ae.flatMap((e,t)=>e.slice(1).map(e=>[e,t]))),D=Math.max(...[...ce.keys()].map(e=>e.length)),O=Array.from({length:D},(e,t)=>D-t),k=/----+ *MODULE/y,A=[/_\w*[A-Za-z]\w*/y,/[0-9]\w*[A-Za-z]\w*/y,/[WS](?:[a-zA-EG-Z_0-9]\w*)?/y,/[WS]F(?:[A-Za-z0-9]\w*)?/y,/[a-zA-RT-VX-Z]\w*/y,/@|ℕ|ℤ|ℝ/y],le=e=>[/[0-9][A-Za-z0-9]*/,/[WS][a-zA-EG-Z0-9][A-Za-z0-9]*/,/[a-zA-RT-VX-Z][A-Za-z0-9]*/].map(t=>RegExp(`${t.source}${e}`,`y`)),ue=le(String.raw`\.\/\\`),de=le(String.raw`\.\\\/`),fe=String.raw`<(?:[0-9]+|\+|\*)>`,pe=[[`_BM0`,[k]],[`SEPARATOR`,[/----+/y]],[`END_MODULE`,[/====+/y]],[`NUMBER_LITERAL`,[/[0-9]+|\\[oO][0-7]+|\\[bB][01]+|\\[hH][0-9a-fA-F]+/y]],[`STRING_LITERAL`,[/"(?:[^"\n\r\\]|\\[ntrf\\"])*"/y]],[`BAND`,ue],[`BOR`,de],[`IDENTIFIER`,A],[`ProofStepLexeme`,[/<[0-9]+>\w+/y]],[`ProofImplicitStepLexeme`,[/<[+*]>[A-Za-z0-9]+/y]],[`ProofStepDotLexeme`,[new RegExp(String.raw`${fe}\w+\.+`,`y`)]],[`BareLevelLexeme`,[new RegExp(fe,`y`)]],[`UnnumberedStepLexeme`,[new RegExp(String.raw`${fe}(?:\*\.*|-\.*|\.+)`,`y`)]]],me=[[`BEGIN_PRAGMA`,[/--->/y]],[`_BM1`,[k]]],he=[[`NUMBER`,[/[0-9]+/y]],[`_BM2`,[k]],[`BAND`,ue],[`BOR`,de],[`IDENTIFIER`,A]],ge=(e,t,n)=>(e.lastIndex=n,e.exec(t)?.[0].length??0),_e=(e,t)=>t.length>e.length||t.length===e.length&&t.kind<e.kind?t:e,ve=(e,t,n)=>e.map(e=>({kind:E(e[0]),length:Math.max(...e[1].map(e=>ge(e,t,n)))})).reduce(_e,{kind:-1,length:0}),ye=(e,t)=>{let n=O.find(n=>ce.has(e.slice(t,t+n))),r=ve(pe,e,t);return n===void 0?r:_e(r,{kind:ce.get(e.slice(t,t+n))??-1,length:n})},be=e=>e+8-e%8,xe=e=>{let t=[],n=[],r=1,i=0,a=!1,o=!1;for(let s of e)for(let e=0;e<s.length;e++)i++,o?(o=!1,r++,i=1):a&&(a=!1,s===`
|
|
13
10
|
`?o=!0:(r++,i=1)),s===`\r`?a=!0:s===`
|
|
14
|
-
`?o=!0:s===` `&&(i=
|
|
15
|
-
`||e[a]===`\r`?
|
|
16
|
-
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=
|
|
17
|
-
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),
|
|
11
|
+
`?o=!0:s===` `&&(i=be(i-1)),t.push(r),n.push(i);return{lines:t,columns:n}},Se=e=>{let t=xe(e);return{line:t.lines[e.length-1]??0,column:t.columns[e.length-1]??0}},Ce=/"(?:[^"\n\r\\]|\\[ntrf\\"])*\\?/y,we=new Set([...ce.keys()].flatMap(e=>Array.from({length:e.length-1},(t,n)=>e.slice(0,n+1)))),Te=(e,t)=>{let n=0;for(;we.has(e.slice(t,t+n+1));)n++;return e.slice(t,t+Math.max(n,ge(Ce,e,t)))},Ee=e=>{let t=xe(e),n=0,r=`DEFAULT`,i=(n,r,i)=>({kind:n,image:e.slice(r,r+i),beginLine:t.lines[r]??0,beginColumn:t.columns[r]??0,next:void 0}),a=()=>i(E(`EOF`),e.length-1,0),o=(n,r,i)=>{let a=r-1,o=t.lines[a],s=t.columns[a];return r<e.length?ke(o,s,e[a],i):t.lines[n]===o?e[a]===`
|
|
12
|
+
`||e[a]===`\r`?ke(o+1,0,void 0,i):ke(o,s+1,void 0,i):`Lexical {error: EOF reached, possibly open comment starting around line ${t.lines[n]}`},s=()=>{let t=n;if(e.startsWith(`\\*`,t)){let r=e.slice(t).search(/[\n\r]/);if(r===-1)return o(t,e.length,``);n+=r+1;return}let r=0,i=t,a=t;for(;a<e.length;)if(e.startsWith(`(*`,a))r++,a+=2,r>1&&(i=a);else if(e.startsWith(`*)`,a)){if(r--,a+=2,i=a,r===0){n=a;return}}else a++;return n=a,i===e.length?void 0:o(i,a,``)},c=t=>{for(;n<e.length;){let a=ve(t,e,n);if(a.length>0){let e=i(a.kind,n,a.length);return n+=a.length,oe[a.kind].startsWith(`_BM`)&&(r=`SPEC`),oe[a.kind]===`BEGIN_PRAGMA`&&(r=`PRAGMA`),e}n++}return a()};return()=>{if(r===`DEFAULT`)return c(me);if(r===`PRAGMA`)return c(he);for(;n<e.length;){let t=n;if(`
|
|
13
|
+
\r`.includes(e[t]))n++;else if(e.startsWith(`(*`,t)||e.startsWith(`\\*`,t)){let e=s();if(e!==void 0)return e}else{let r=ye(e,t);if(r.length===0){let n=Te(e,t),r=Math.min(t+n.length+1,e.length),i=e.slice(t,r),a=r<e.length?n:i.length>1?i:``;return o(t,r,a)}let a=i(r.kind,t,r.length);return n+=r.length,a}}return a()}},De=/* @__PURE__ */ new Map([[`\b`,`\\b`],[` `,`\\t`],[`
|
|
14
|
+
`,`\\n`],[`\f`,`\\f`],[`\r`,`\\r`],[`"`,`\\"`],[`'`,`\\'`],[`\\`,`\\\\`]]),Oe=e=>e.replace(/[\0-\x1f"'\\\x7f-\uffff]/g,e=>De.get(e)??(e===`\0`?``:`\\u${e.charCodeAt(0).toString(16).padStart(4,`0`)}`)),ke=(e,t,n,r)=>`Lexical error at line ${e}, column ${t}. Encountered: ${n===void 0?`<EOF> `:`"${Oe(n)}" (${n.charCodeAt(0)}), `}after : "${Oe(r)}"`,Ae=e=>{let t=Ee(e);for(let e=t();typeof e!=`string`&&e.kind!==E(`EOF`);e=t()){let t=e.image.split(``).findIndex(e=>{let t=e.charCodeAt(0);return t>255&&(t&255)<128});if(t===-1)continue;let n=e.image.slice(1,t+1).split(``).reduce((e,t)=>t===` `?be(e):e+1,e.beginColumn);return ke(e.beginLine,n,e.image[t],e.image.slice(0,t))}},je=/* @__PURE__ */ new Set(/* @__PURE__ */ `ACTION.ACTIONS.ASSUME.ASSUMPTION.AXIOM.BY.CASE.CHOOSE.CONSTANT.CONSTANTS.COROLLARY.DEF.DEFINE.DEFS.DOMAIN.ELSE.ENABLED.EXCEPT.EXTENDS.HAVE.HIDE.IF.IN.INSTANCE.LAMBDA.LEMMA.LET.LOCAL.MODULE.NEW.OBVIOUS.OMITTED.ONLY.OTHER.PICK.PROOF.PROPOSITION.PROVE.QED.RECURSIVE.STATE.SUBSET.SUFFICES.TAKE.TEMPORAL.TEMPORALS.THEN.THEOREM.UNCHANGED.UNION.USE.VARIABLE.VARIABLES.WITH.WITNESS`.split(`.`)),Me=/* @__PURE__ */ new Map([[`in`,`\\in`],[`notin`,`\\notin`],[`subseteq`,`\\subseteq`],[`subset`,`\\subset`],[`supseteq`,`\\supseteq`],[`supset`,`\\supset`],[`cup`,`\\cup`],[`union`,`\\cup`],[`cap`,`\\cap`],[`intersect`,`\\cap`],[`X`,`\\X`],[`times`,`\\X`],[`o`,`\\o`],[`circ`,`\\o`],[`div`,`\\div`],[`land`,`/\\`],[`lor`,`\\/`],[`lnot`,`~`],[`neg`,`~`],[`equiv`,`<=>`],[`leq`,`<=`],[`geq`,`>=`],[`A`,`\\A`],[`forall`,`\\A`],[`E`,`\\E`],[`exists`,`\\E`],[`AA`,`\\AA`],[`EE`,`\\EE`],[`cdot`,`\\cdot`],[`sqsubseteq`,`\\sqsubseteq`],[`sqsupseteq`,`\\sqsupseteq`],[`sqsubset`,`\\sqsubset`],[`sqsupset`,`\\sqsupset`],[`sqcap`,`\\sqcap`],[`sqcup`,`\\sqcup`],[`oplus`,`\\oplus`],[`ominus`,`\\ominus`],[`otimes`,`\\otimes`],[`oslash`,`\\oslash`],[`odot`,`\\odot`],[`uplus`,`\\uplus`],[`prec`,`\\prec`],[`preceq`,`\\preceq`],[`succ`,`\\succ`],[`succeq`,`\\succeq`],[`sim`,`\\sim`],[`simeq`,`\\simeq`],[`approx`,`\\approx`],[`cong`,`\\cong`],[`asymp`,`\\asymp`],[`doteq`,`\\doteq`],[`propto`,`\\propto`],[`wr`,`\\wr`],[`star`,`\\star`],[`bullet`,`\\bullet`],[`bigcirc`,`\\bigcirc`],[`ll`,`\\ll`],[`gg`,`\\gg`]]),Ne=/* @__PURE__ */ new Map([[`/=`,`#`],[`=<`,`<=`],[`(+)`,`\\oplus`],[`(-)`,`\\ominus`],[`(.)`,`\\odot`],[`(/)`,`\\oslash`],[`(\\X)`,`\\otimes`]]),Pe=/* @__PURE__ */ `-+-> (\\X) <=> |-> ... ::= >>_ (+) (-) (.) (/) == => =< =| << <= <> <- >> >= /\\ \\/ /= [] ]_ |- |= || -> -| ~> .. :: := :> <: @@ ++ -- -. ** // ^^ ^+ ^* ^# %% ## && $$ ?? !! = < > / [ ] ( ) { } | - ~ . : @ , ' ! # % + * ^ & $ ?`.split(` `),Fe=/* @__PURE__ */ new Map([[`∃`,`\\E`],[`∀`,`\\A`],[`∷`,`::`],[`≜`,`==`],[`⟨`,`<<`],[`⟩_`,`>>_`],[`⟩`,`>>`],[`→`,`->`],[`←`,`<-`],[`↦`,`|->`],[`⁺`,`^+`],[`¬`,`~`],[`□`,`[]`],[`◇`,`<>`],[`∧`,`/\\`],[`∨`,`\\/`],[`∈`,`\\in`],[`≈`,`\\approx`],[`≔`,`:=`],[`≍`,`\\asymp`],[`◯`,`\\bigcirc`],[`⩴`,`::=`],[`●`,`\\bullet`],[`∩`,`\\cap`],[`⋅`,`\\cdot`],[`∘`,`\\o`],[`≅`,`\\cong`],[`∪`,`\\cup`],[`÷`,`\\div`],[`≐`,`\\doteq`],[`‥`,`..`],[`…`,`...`],[`≡`,`<=>`],[`‼`,`!!`],[`≥`,`>=`],[`≫`,`\\gg`],[`⇔`,`<=>`],[`⇒`,`=>`],[`⫤`,`=|`],[`↝`,`~>`],[`≤`,`<=`],[`≪`,`\\ll`],[`⊣`,`-|`],[`≠`,`#`],[`∉`,`\\notin`],[`⊙`,`\\odot`],[`⊖`,`\\ominus`],[`⊕`,`\\oplus`],[`⊘`,`\\oslash`],[`⊗`,`\\otimes`],[`⇸`,`-+->`],[`≺`,`\\prec`],[`⪯`,`\\preceq`],[`∝`,`\\propto`],[`⁇`,`??`],[`⊨`,`|=`],[`⊢`,`|-`],[`∼`,`\\sim`],[`≃`,`\\simeq`],[`⊓`,`\\sqcap`],[`⊔`,`\\sqcup`],[`⊏`,`\\sqsubset`],[`⊑`,`\\sqsubseteq`],[`⊐`,`\\sqsupset`],[`⊒`,`\\sqsupseteq`],[`⋆`,`\\star`],[`⊂`,`\\subset`],[`⊆`,`\\subseteq`],[`≻`,`\\succ`],[`⪰`,`\\succeq`],[`⊃`,`\\supset`],[`⊇`,`\\supseteq`],[`×`,`\\X`],[`⊎`,`\\uplus`],[`‖`,`||`],[`≀`,`\\wr`]]),Ie=/* @__PURE__ */ new Map([[`b`,2],[`o`,8],[`h`,16]]),Le=e=>e.startsWith(`\\`)?parseInt(e.slice(2),Ie.get(e[1].toLowerCase())):Number(e),Re=/-{4,} *MODULE\b/,ze=/* @__PURE__ */ new Uint8Array(128);(/* @__PURE__ */ new Map([[`0123456789`,33],[`abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ`,2],[`_`,4],[`01`,8],[`01234567`,16],[`abcdefABCDEF`,32]])).forEach((e,t)=>{for(let n of t)ze[n.charCodeAt(0)]|=e});const Be=(e,t)=>e<128&&(ze[e]&t)!==0,Ve=(e,t,n)=>{let r=t;for(;Be(e.charCodeAt(r),n);)r++;return r},He=/* @__PURE__ */ new Map;Pe.forEach(e=>{let t=e.charCodeAt(0),n=He.get(t)??[];n.push(e),He.set(t,n)});const Ue=(e,t)=>{let n=He.get(e.charCodeAt(t));if(n!==void 0){for(let r=0;r<n.length;r++)if(e.startsWith(n[r],t))return n[r]}},We=(e,t)=>{if(e.charCodeAt(t)<128)return;let n=e.slice(t,t+2);if(Fe.has(n))return n;let r=e[t];return Fe.has(r)?r:void 0},Ge=(e,t)=>{let n=e.charCodeAt(t);if(n===92&&Be(e.charCodeAt(t+1),2)){let n=e.slice(t+1,Ve(e,t+1,2)),r=n.length;for(;r>0&&!Me.has(n.slice(0,r));)r--;let i=Me.get(n.slice(0,r));return{text:i??`\\`,length:i===void 0?1:r+1}}let r=We(e,t);if(r!==void 0)return{text:Fe.get(r)??``,length:r.length};let i=Ue(e,t);return i?{text:Ne.get(i)??i,length:i.length}:n===92?{text:`\\`,length:1}:void 0},Ke=/* @__PURE__ */ new Set([`ℕ`,`ℤ`,`ℝ`]),qe=(e,t)=>{let n=[e.slice(t,t+2),e[t]].find(e=>Fe.has(e)||Ke.has(e));return n===void 0?void 0:{text:n,length:n.length}},Je=(e,t,n)=>{let r=t;for(;r<e.length&&n(e[r]);)r++;return r},Ye=(e,t,n)=>{let r=e[t+1]===`+`||e[t+1]===`*`,i=r?t+2:Ve(e,t+1,1);if(i===t+1||e[i]!==`>`)return 0;let a=!r||!n,o=a?Ve(e,i+1,7):i+1,s=a&&o===i+1&&(e[o]===`*`||e[o]===`-`);return Je(e,s?o+1:o,e=>e===`.`)-t},Xe=e=>e.kind===`Operator`&&e.text===`@`?{...e,kind:`Identifier`}:e,Ze={n:`
|
|
15
|
+
`,t:` `,r:`\r`,f:`\f`},Qe=(e,t)=>t===9?e+8-e%8:e+1,$e=/* @__PURE__ */ new Map([[`b`,8],[`o`,16],[`h`,32]]),et=(e,t,n=!1)=>{if(e.charCodeAt(t)!==92)return 0;let r=e.charAt(t+1),i=$e.get(n?r:r.toLowerCase());if(i===void 0)return 0;let a=Ve(e,t+2,i);return a===t+2?0:a-t},tt=(e,t=!1)=>{let n=Re.exec(e);if(!n){let t=Se(e),n=`Expected a module header such as ---- MODULE Name ----`;throw new s(`${n} at line ${t.line}, column ${t.column}`,void 0,{reason:n,line:t.line,column:t.column,isEnd:!0})}let r=[],i=/* @__PURE__ */ new Map,a=e.slice(0,n.index).split(`
|
|
16
|
+
`),o=n.index,c=a.length,l=n.index-a[a.length-1].length,u=0,d=-1,f=0,p=0,m=()=>{for((d!==l||f>o)&&(d=l,f=l,p=0);f<o;f++)p=Qe(p,e.charCodeAt(f));return Qe(p,e.charCodeAt(o))},h=(e,t,n,i)=>{let a=m();r.push({kind:e,text:t,spelling:i,line:c,column:a,endColumn:a+n-1}),o+=n},g=t=>{for(let n=0;n<t;n++)e.charCodeAt(o)===10&&(c++,l=o+1),o++},_=t=>new s(`${t} at line ${c}, column ${m()}`,void 0,{reason:t,line:c,column:m(),isEnd:o>=e.length});for(;o<e.length;){let n=e.charCodeAt(o);if(n===10||n===32||n===9||n===13){g(1);continue}if(n===92&&e.charCodeAt(o+1)===42){g(Je(e,o,e=>e!==`
|
|
17
|
+
`&&e!==`\r`)-o);continue}if(n===40&&e.charCodeAt(o+1)===42){let t=0;do{if(o>=e.length)throw _(`Unterminated comment`);e.startsWith(`(*`,o)?(t++,g(2)):e.startsWith(`*)`,o)?(t--,g(2)):g(1)}while(t>0);continue}if(n===45&&e.startsWith(`----`,o)){let t=Je(e,o,e=>e===`-`)-o,n=Je(e,o+t,e=>e===` `);e.startsWith(`MODULE`,n)&&u++,h(`Separator`,`----`,t);continue}if(n===61&&e.startsWith(`====`,o)){if(h(`ModuleEnd`,`====`,Je(e,o,e=>e===`=`)-o),u--,u<=0)break;continue}if(n===34){let t=c,n=m(),i=[];for(g(1);e.charCodeAt(o)!==34;){let t=e.charCodeAt(o);if(o>=e.length||t===10||t===13)throw _(`Unterminated string`);if(t===92){let t=e[o+1];if(t===void 0||!`ntrf\\"`.includes(t))throw _(`Invalid escape in string`);i.push(Ze[t]??t),g(2)}else i.push(e[o]),g(1)}g(1),r.push({kind:`String`,text:i.join(``),line:t,column:n,endColumn:m()-1});continue}let a=et(e,o,t);if(a>0){h(`Number`,e.slice(o,o+a),a);continue}if(Be(n,7)){let t=Ve(e,o,7),r=e.slice(o,t),a=Ve(e,o,1);if(a===t){let n=e.charCodeAt(t)===46?Ve(e,t+1,1):t,i=n>t+1,a=i?e.slice(o,n):r;h(i?`Decimal`:`Number`,a,a.length);continue}if(!/[A-Za-z]/.test(r)){let t=n===95?`_`:e.slice(o,a);h(t===`_`?`Operator`:`Number`,t,t.length);continue}if(r.startsWith(`WF_`)||r.startsWith(`SF_`)){h(`Keyword`,r.slice(0,3),3);continue}let s=i.get(r)??r;i.set(s,s),h(je.has(r)?`Keyword`:`Identifier`,s,r.length);continue}let s=e[o];if(n>=128&&Ke.has(s)){h(`Identifier`,i.get(s)??s,1),i.set(s,s);continue}if(n===60){let n=Ye(e,o,t);if(n>0){h(`Step`,e.slice(o,o+n),n);continue}}let l=Ge(e,o);if(l){let t=e.slice(o,o+l.length);h(`Operator`,l.text,l.length,t===l.text?void 0:t)}else throw _(`Unexpected character ${JSON.stringify(s)}`)}let v=m();return r.push({kind:`End`,text:``,line:c,column:v,endColumn:v}),r},nt=[`CONSTANT`,`CONSTANTS`,`INIT`,`NEXT`,`SPECIFICATION`,`INVARIANT`,`INVARIANTS`,`PROPERTY`,`PROPERTIES`,`CONSTRAINT`,`CONSTRAINTS`,`ACTION_CONSTRAINT`,`ACTION_CONSTRAINTS`,`SYMMETRY`,`VIEW`,`CHECK_DEADLOCK`],rt=/* @__PURE__ */ new Set([...nt,`ALIAS`,`POSTCONDITION`,`POSTCONDITIONS`,`_POSSIBLE`,`_PERIODIC`,`_RL_REWARD`]),it=[`TYPE`,`TYPE_CONSTRAINT`],at=/* @__PURE__ */ new Set([...nt,...it]),ot=[`<-`,`<<`,`>>`,`=`,`{`,`}`,`,`,`[`,`]`,`(`,`)`,`!`],j=e=>{let t=0,n=0;do{if(t>=e.length)return;let r=e.slice(t,t+2),i=r===`(*`?1:r===`*)`?-1:0;n+=i,t+=i===0?1:2}while(n>0);return t},st=e=>{let t=[],n=0,r=1,i=0,a=(n,a)=>{t.push({kind:`Error`,text:ke(r,n-i+1,e[n],a),line:r})},o=e=>{t.push({kind:`Error`,text:ke(r+1,0,void 0,e),line:r})},s=e=>{let t=e.split(`
|
|
18
18
|
`);t.length>1&&(r+=t.length-1,i=n+e.length-t[t.length-1].length),n+=e.length};for(;n<e.length;){let i=e.slice(n),c=/^\s+/.exec(i)?.[0];if(c){s(c);continue}if(i.startsWith(`\\*`)){let e=i.indexOf(`
|
|
19
|
-
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=ct(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=Oe(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=Se(e,n)??E(e,n),m=st.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},ut=(e,t)=>new _(`TLC found an error in the configuration file at line ${e}\n${t}`),dt=(e,t)=>ut(e,`The keyword ${t} appeared twice.`),ft=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),pt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),mt=(t,n=`master`)=>{let r=n===`1.7.4`?ot:it,i=lt(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new _(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw x(new _(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),ie.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new _(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw ut(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw ut(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw ut(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw ut(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw ut(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ut(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw ut(t,``);r=l()}if(r.text!==`=`)throw ut(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?ft.get(e):void 0,i=r.has(e)?pt.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw ut(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw dt(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw ut(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw dt(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!at.includes(e))throw ut(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw dt(t,e);c.add(e),h=l()}}return o},ht=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[])}},A=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,gt=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},_t={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},vt=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},yt=e=>e!==void 0&&/^\p{Nd}$/u.test(e),bt=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),xt=e=>{let t=t=>{let n=D(e,t,vt);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=D(e,t,yt);if(e.startsWith(`..`,n)&&yt(e[n+2]))return{kind:`Constant`,first:t,last:D(e,n+2,yt)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=yt(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:D(e,t+1,yt)-1,children:[]};if(bt(n))return{kind:`Constant`,first:t,last:D(e,t,bt)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},j=e=>{let t=e.length===0?void 0:xt(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=_t[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},St={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},Ct={none:0,error:1,warning:3,state:4},wt={0:``,1:`Error: `,3:`Warning: `,4:`State `},Tt=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${wt[n]}${r}`,Et=(e,t=!0,n=`master`,r=[],i=[])=>{let a=/* @__PURE__ */ new Set;return{isTool:e,version:n,print:(n,o,s)=>{let c=o===Ct.warning;if(c&&i.includes(n))throw new p(n,s);if(c&&!t||o!==Ct.error&&r.includes(n))return;let l=c&&!e&&a.size===0?`
|
|
20
|
-
(Use the -nowarning option to disable this warning.)`:``,u=Tt(e,n,o,`${s}${l}`);c&&a.has(u)||(c&&a.add(u),console.log(u))}}},Dt=`The configuration file did not specify the initial state predicate.
|
|
21
|
-
Can also be caused by trying to run TLC on a specification from
|
|
22
|
-
a module imported with a parameterized INSTANCE statement.`,Ot=[[1005,ae,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
23
|
-
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
24
|
-
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
25
|
-
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
26
|
-
%1%,
|
|
27
|
-
but it produced the following error:
|
|
28
|
-
%2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
|
|
29
|
-
`,!1],[2155,`Attempted to compare %1% with the value
|
|
30
|
-
%2%`,!0],[2158,`Attempted to check if the value:
|
|
31
|
-
%1%
|
|
32
|
-
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
33
|
-
the following value:
|
|
34
|
-
%1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
35
|
-
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,te,!1],[2176,`Applying %1% to the following value,
|
|
36
|
-
which is not %2%:
|
|
37
|
-
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
38
|
-
element is not a bag:
|
|
39
|
-
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
40
|
-
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
41
|
-
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
42
|
-
%4%
|
|
43
|
-
, but instead it is
|
|
44
|
-
%5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
|
|
45
|
-
on the right-hand side of a <- after already appearing on the
|
|
46
|
-
left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
|
|
47
|
-
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Dt,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
|
|
48
|
-
cannot be used as a %3%`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
49
|
-
%1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
|
|
50
|
-
but TLC can handle only specifications with one next-state relation.`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
|
|
51
|
-
%1%`,!1],[2245,`In the configuration file, the module name %1% is not a module in the specification.`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
52
|
-
but instead found %3%.
|
|
53
|
-
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
54
|
-
but didn't find one.
|
|
55
|
-
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
56
|
-
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
57
|
-
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
58
|
-
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
59
|
-
%4%`,!0],[2272,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property: Let A be the formula at %2%; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2273,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at %2% (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2274,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that infinitely many %1% steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at %2% (compare page 91 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
60
|
-
%2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
|
|
61
|
-
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
62
|
-
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
63
|
-
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
64
|
-
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
65
|
-
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
66
|
-
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
67
|
-
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let kt;const At=()=>kt??=Ot.map(([e,t,n])=>({pattern:RegExp(`^${t.split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e,isEvalException:n}})),jt=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,Mt=e=>jt.test(e)?void 0:At().find(t=>t.pattern.test(e))?.message,Nt=e=>e instanceof c||Mt(e.message)?.isEvalException===!0,Pt=/* @__PURE__ */ new Map([[1e3,`
|
|
68
|
-
: `],[2105,`failed.
|
|
69
|
-
`],[2154,`but it produced the following error:
|
|
70
|
-
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
71
|
-
`],[2281,` - specifically: `],[2405,`failed.
|
|
72
|
-
`]]),Ft=(e,t,n)=>{let r=n?Pt.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${It(t.slice(a),n)}`},It=(e,t)=>{let n=t?Mt(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${Ct.none} @!@!@\n${Ft(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},Lt=e=>String(e).padStart(2,`0`),Rt=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${Lt(r%24)}h`:e>36e5?`${Lt(r%24)}h ${Lt(n)}min`:e>6e4?`${Lt(n)}min ${Lt(t)}s`:`${Lt(t)}s`},zt=e=>`${e.getFullYear()}-${Lt(e.getMonth()+1)}-${Lt(e.getDate())} ${Lt(e.getHours())}:${Lt(e.getMinutes())}:${Lt(e.getSeconds())}`,Bt=/* @__PURE__ */ new WeakMap,Vt=(e,t,n)=>{if(!(e instanceof v))return e;let r=x(new v(`${n}\n${e.message}`,e),u(e));return Bt.set(r,{code:t,headline:n,inner:e}),r},Ht=e=>Bt.has(e),Ut=e(`util.WrongInvocationException`),Wt=i.slice(0,i.indexOf(`
|
|
73
|
-
`)),Gt=`${i}tlc2.tool.EvalException: `,Kt=`${i}util.Assert$TLCRuntimeException: `,qt=e=>Nt(e)?Gt:Kt,Jt=e=>{try{return e()}catch(e){throw e instanceof v?Nt(e)?new v(`${m}${e.message}`):Mt(e.message)?e:new v(`${i}${e.message}`):e}},Yt=[Gt,Kt,i,m],Xt=(e,t)=>{let n=Bt.get(e);if(n)return`${n.headline}\n${Xt(n.inner,t)}`;let r=e.message;if(e instanceof le)return r;let i=Yt.find(e=>r.startsWith(e))??``;return`${i}${It(r.slice(i.length),t)}`},Zt=(e,t)=>{let n=Bt.get(e),r=e.message;if(n)return{code:n.code,message:r,toolMessage:Xt(e,!0)};if(e instanceof l)return{code:t?St.stackOverflow:St.general,message:r,toolMessage:r};if(t&&Nt(e))return{code:Mt(r)?.code??St.general,message:r,toolMessage:r};let a=t&&!r.startsWith(Wt)&&!(e instanceof le),o=e instanceof s?Ut:i,c=a?o:``;return{code:St.general,message:`${c}${r}`,toolMessage:`${c}${Xt(e,!0)}`}},Qt=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,$t=1e6;let en=$t;const tn=()=>en,nn=()=>Math.max(en,10),rn=()=>`Attempted to construct a set with too many elements (>${en}).`,an=(e,t)=>{if(e.length===nn())throw new s(rn());e.push(t)},on=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=nn(),sn=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},M=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,cn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),ln=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),un=e=>typeof e==`object`&&e.kind===`ModelValue`,dn=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),fn=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:M(e)?`set`:`function`,pn=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let mn=!1;const hn=(e,t)=>(mn=!0,e.writtenKeys=t,e),gn=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,_n=e=>gn(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),vn=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):_n(e),yn=(e,t,n)=>hn(mi(e,t),n),bn=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(bn);e.writtenKeys=void 0,e.range.forEach(bn)}},xn=e=>e.every(e=>typeof e==`string`),Sn=(e,t)=>e.length>0&&t.length>0&&xn(e)!==xn(t),Cn=(e,t)=>{mn&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Sn(n,r)?Nr(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=Jn(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:Jn(t,n);if(r!==0)return r}return 0},wn=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=Jn(n[e],r[e]);if(t!==0)return t}return 0},Tn=e=>un(e)?e.type:void 0,En=(e,t,n)=>{let r=Tn(e),i=Tn(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(un(e)&&un(t)){if(r===void 0||i===void 0||r===i)return;throw new v(`Attempted to ${a} the differently-typed model values ${L(e)} and ${L(t)}`)}throw r===void 0?new v(`Attempted to ${a} the typed model value ${L(t)} and the non-model value\n${L(e)}`):new v(`Attempted to ${a}${n?``:` the`} typed model value ${L(e)} and non-model value\n${L(t)}`)},Dn={ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0},On=e=>{Dn.ranks=Object.create(null),Dn.size=0,Dn.searchRank=void 0,Dn.unorderedString=void 0,Yn.clear();for(let t of e)Rn(t)},kn=()=>{Dn.searchRank=Dn.size},An=()=>Dn.unorderedString;let jn=!1;const Mn={isExpanded:!0,isViewPrinted:!1},Nn=e=>{jn=e.version===`1.7.4`,en=e.maxSetSize??$t,Mn.isExpanded=e.isLazyValueExpanded??!0,Mn.isViewPrinted=e.isViewPrinted??!1},Pn=/* @__PURE__ */ new WeakMap,Fn=(e,t)=>(Mn.isViewPrinted&&Pn.set(e,t),e),In=/* @__PURE__ */ new WeakMap,Ln=(e,t)=>(In.set(e,t),e),Rn=e=>(Dn.ranks[e]===void 0&&(Dn.ranks[e]=Dn.size++),e),zn=e=>Dn.ranks[Rn(e)],Bn=(e,t)=>{if(e===t)return 0;let n=Dn.ranks,r=n[e],i=n[t],a=Dn.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(Dn.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},Vn=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),Hn=(e,t)=>(Vn(e)||Vn(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),Un=(e,t)=>new v(Vn(e)?`Attempted to compare overridden value ${L(e,!0)} with non-overridden value:\n${L(t)}`:`Attempted to compare ${fn(e)} ${L(e)} with ${fn(t)} ${L(t)}`),Wn=(e,t,n)=>{if(!Vn(e))throw new v(`Attempted to ${n} the set ${L(N(e)?P(e):e,!0)} with the value:\n${L(t,!0)}`);if(!Vn(t))throw Un(e,t);let r=e.kind===`InfiniteSet`?e.name:void 0,i=t.kind===`InfiniteSet`?t.name:void 0;if(r!==void 0&&r===i)return 0;if(r===`Nat`&&i===`Int`||r===`Int`&&i===`Nat`)return r===`Nat`?-1:1;throw new c(`Attempted to compare ${L(e,!0)} with the value\n${L(t,!0)}`)},Gn={kind:`InfiniteSet`,name:`Any`},Kn=e=>{throw new c(`Attempted to compare ANY with the value\n${L(e)}`)},qn=e=>{mn&&bn(e),e===Gn&&Kn(e),typeof e==`object`&&e.kind===`LazyFunction`&&I(e)},Jn=(e,t)=>{if(e===t)return qn(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Cn(e,t);if(n===`Set`&&r===`Set`)return wn(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&En(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return En(e,t,!1),n===`ModelValue`?-1:1;if(e===Gn||t===Gn)return Kn(e===Gn?t:e);if(M(e)&&M(t)&&Hn(e,t))return Wn(e,t,`compare`);let i=M(e);if(i!==M(t))throw Un(e,t);if(n===`Interval`&&r===`Set`){let n=Li(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-Li(t);if(n!==0)return n}return i?wn(P(e),P(t)):Cn(I(e),I(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return Bn(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(En(e,t,!1),un(e))return-1;if(un(t))return 1;throw Un(e,t)},Yn=/* @__PURE__ */ new Map,Xn=32768,Zn=e=>{let t=Yn.get(e);if(t)return t;if(Yn.size===Xn)throw new se(`TLC supports at most ${Xn} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:zn(e),hash:ma(ha(ga(e),109)),fingerprint:Ta(Ea(e)^60)};return Yn.set(e,n),n},Qn=()=>[...Yn.values()],$n=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),er=e=>{let t=$n(e);return t.isNormalized=!0,t},tr=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let nr=!1;const rr=(e,t)=>(t===`lambda`&&(nr=!0),t!==void 0&&(e.functionClass=t),e),ir=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,ar=e=>rr(e,`lambda`),or=e=>Qt(e)&&e.isCached===!0;let sr=!1;const cr=e=>(sr=!0,e),lr=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),ur=e=>{sr&&typeof e==`object`&&Qt(e)&&lr.has(e.kind)&&(e.isCached=!0)},dr=e=>{(nr||sr)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(dr),e.range.forEach(dr)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(dr):M(e)&&N(e)&&(ur(e),P(e).elements.forEach(dr))))},fr=(e,t)=>{if(ur(e),e===t)return qn(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&En(e,t,!0),Jn(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Cn(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return wn(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&Li(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==Li(t))return!1;if(un(e)||un(t))return e.kind===`LazyFunction`&&I(e),En(e,t,!0),un(e)&&un(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return fr(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=F(e.domain),r=F(t.domain);if(n||r)return n===r;let i=F(e.range),a=F(t.range);return i||a?i===a:fr(e.domain,t.domain)&&fr(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(F(e))return F(t);if(F(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&fr(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return F(e)?F(t):!F(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>fr(e,t.factors[n]));let n=M(e)&&M(t)&&!(N(e)&&N(t));if(n&&Hn(e,t))return Wn(e,t,`check equality of`)===0;if(n){if(!Vn(e)){let n=P(e);if(!Vn(t))return wn(n,P(t))===0}return ja(e)===ja(t)}return Jn(e,t)===0},pr=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):ja(n)===ja(r);return n},mr=pr(!1),hr=pr(!0),gr=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},_r=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=wa(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||hr(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||hr(i[e],n))return i[e]}return n.kind===`Set`?gr(n.elements,t):(gr(n.domain,t),gr(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},vr=(e,t)=>t.length===0||ir(e)===`tuple`?1:da(t)?.low,yr=e=>{if(!ln(e))return;let t=I(e);return{domain:t.domain,range:t.range,low:vr(e,t.domain)}},br=e=>{if(!ln(e))return;let t=I(e);return xn(t.domain)?t:void 0},xr=(e,t)=>(En(t,e,!1),1),Sr=(e,t)=>(En(t,e,!0),!1),Cr=(e,t)=>(e.type!==void 0&&En(e,t,!1),un(t)?e.rank-t.rank:-1),wr=(e,t)=>(e.type!==void 0&&En(e,t,!0),un(t)&&e.name===t.name),Tr={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Er=(e,t,n)=>{let r=Tr[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${L(e)} with ${r.other}:\n${L(t)}`},Dr=(e,t,n)=>{let r=yr(n);if(!r){if(un(n))return xr(n,t);throw new v(`Attempted to compare the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return e.range.length-r.range.length;let i=()=>Or(e.range,r.range);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&r.low!==void 0)return e.low===r.low?i():e.low-r.low;let a=e.low??r.low;if(a===void 0)return Or(e.domain,r.domain)||i();let o=e.low===void 0?e.domain:r.domain;for(let t=0;t<o.length;t++){let n=o[t];if(typeof n!=`number`)throw new v(`Attempted to compare integer with non-integer${e.low===void 0?``:`:`}\n${L(n)}.`);let r=e.low===void 0?n-(a+t):a+t-n;if(r!==0)return r}return i()},Or=(e,t)=>{for(let n=0;n<e.length;n++){let r=Nr(e[n],t[n]);if(r!==0)return r}return 0},kr=(e,t)=>{let n=I(e);if(ir(e)===`tuple`){let r=ln(t)?Hi(t):void 0;return r?n.range.length-r.length||Or(n.range,r):Dr({...n,low:1},e,t)}if(ir(e)===`record`){let r=br(t);if(!r){if(un(t))return xr(t,e);throw new v(`Attempted to compare record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length-r.domain.length||Or(n.domain,r.domain)||Or(n.range,r.range)}return Dr({...n,low:vr(e,n.domain)},e,t)},Ar=(e,t)=>Vn(e)||Vn(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),jr=(e,t)=>{let n=dn(t)?t:P(t);return{elements:P(e).elements,otherElements:P(n).elements}},Mr=(e,t)=>{if(Ar(e,t))return Jn(e,t);if(!dn(e))return Mr(P(e),t);if(!M(t)){if(un(t))return xr(t,e);throw new v(`Attempted to compare the set ${L(e)} with the value:\n${L(t)}`)}let n=jr(e,t);return n.elements.length-n.otherElements.length||Or(n.elements,n.otherElements)},Nr=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return Jn(e,t);if(un(t))return xr(t,e);throw new v(Er(e,t,!1))}return e.kind===`ModelValue`?Cr(e,t):ln(e)?kr(e,t):Mr(e,t)},Pr=(e,t)=>e.every((e,n)=>Rr(e,t[n])),Fr=(e,t,n)=>{let r=yr(n);if(!r){if(un(n))return Sr(n,t);throw new v(`Attempted to check equality of the function ${L(t)} with the value:\n${L(n)}`)}if(e.range.length!==r.range.length)return!1;if(e.low!==void 0&&r.low!==void 0)return(e.range.length===0||e.low===r.low)&&Pr(e.range,r.range);let i=e.low??r.low;return i===void 0?Pr(e.domain,r.domain)&&Pr(e.range,r.range):(e.low===void 0?e.domain:r.domain).every((e,t)=>{if(typeof e!=`number`)throw new v(`Attempted to compare an integer with non-integer:\n${L(e)}.`);return e===i+t})&&Pr(e.range,r.range)},Ir=(e,t)=>{let n=I(e);if(ir(e)===`tuple`){let r=ln(t)?Hi(t):void 0;return r?n.range.length===r.length&&Pr(n.range,r):Fr({...n,low:1},e,t)}if(ir(e)===`record`){let r=br(t);if(!r){if(un(t))return Sr(t,e);throw new v(`Attempted to check equality of record:\n${L(e)}\nwith non-record\n${L(t)}`)}return n.domain.length===r.domain.length&&Pr(n.domain,r.domain)&&Pr(n.range,r.range)}return Fr({...n,low:vr(e,n.domain)},e,t)},Lr=(e,t)=>{if(Ar(e,t))return fr(e,t);if(!dn(e))return Lr(P(e),t);if(!M(t)){if(un(t))return Sr(t,e);throw new v(`Attempted to check equality of the set ${L(e)} with the value:\n${L(t)}`)}let n=jr(e,t);return n.elements.length===n.otherElements.length&&Pr(n.elements,n.otherElements)},Rr=(e,t)=>{if(typeof e!=`object`){if(typeof t==typeof e)return e===t;if(un(t))return Sr(t,e);throw new v(Er(e,t,!0))}return e.kind===`ModelValue`?wr(e,t):ln(e)?Ir(e,t):Lr(e,t)},zr=e=>{let t=[];for(let n of e){let e=Vr(n,t);e.isFound||t.splice(e.index,0,n)}return t},Br=(e,t)=>{let n=Wi.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},Vr=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=Br(e,()=>Nr(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},Hr=(e,t)=>t.some(t=>Br(t,()=>Rr(t,e))),Ur=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,Wr=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(Wr)),e.kind===`Function`&&(e.domain.forEach(Wr),e.range.forEach(Wr)))},Gr=e=>{if(!(typeof e!=`object`||or(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:P(e);return;case`FilteredSet`:case`Subset`:return Gr(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(Gr(e.left),Gr(e.right));case`FunctionSet`:return Gr(e.domain),Gr(e.range);case`RecordSet`:return e.sets.forEach(Gr);case`ProductSet`:return e.factors.forEach(Gr)}},Kr=(e,t)=>Gi(fr,Rr,e,t),qr=e=>{for(let t=1;t<e.length;t++)if(Jn(e[t-1],e[t])>=0)return!1;return!0},Jr=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},Yr=e=>{for(let t=1;t<e.length;t++)ur(e[t]);if(e.length<2||qr(e))return $n(e);let t=[...e].sort(Jn),n=[t[0]];for(let e=1;e<t.length;e++)Jn(n[n.length-1],t[e])!==0&&n.push(t[e]);return $n(n)},Xr=e=>{if(Jr(e))return $n(e);let t=Gi(Yr,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},Zr=$n([]),Qr=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Jn(r[a],t)<0;)a++;a<r.length&&Jn(r[a],t)===0||i.push(t)}return i.length===n.length?e:$n(i)},$r=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&Jn(r[a],t)<0;)a++;a<r.length&&Jn(r[a],t)===0&&i.push(t)}return i.length===n.length?e:$n(i)},ei=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=Jn(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=$n(i);if(e.hash!==0&&e.hash!==ya){let t=e.hash,n=0;for(;n<a.length;n++){let e=wa(a[n]);if(e===ya)break;t=t+_a(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Da(a[e])|0;c.fingerprint=t}return c},ti=e=>{let t=e.length<2?e:[...e].sort((e,t)=>Jn(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&Jn(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return tr(n,r)},ni=e=>{let t=ti(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:hn(t,e.map(e=>e[0]))},ri=[],ii=/* @__PURE__ */ new Map,ai=[],oi=/* @__PURE__ */ new WeakMap,si=e=>{let t=ri[e]??ii.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?ii.set(e,new WeakRef(n)):ri[e]=n,n},ci=e=>{if(Li(e),e.low===1&&e.high>=1)return si(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},li=e=>e.length>0&&(e===ri[e.length]||e===ii.get(e.length)?.deref())||oi.has(e),ui=e=>{let t=P(e).elements;return li(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},di=e=>{let t=ai[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return ai[e]=n,n},fi=e=>rr(tr(si(e.length),e),`tuple`),pi=e=>rr(ti(e),`record`),mi=(e,t)=>rr(tr(e,t),`record`),hi=e=>M(e)&&!Vn(e),gi=(e,t=!1)=>`UNION(${L(e.base,t)})`,_i=(e,t=e=>P(e).elements)=>{if(!hi(e.base))throw new v(`Attempted to enumerate the nonenumerable set:\n${gi(e)}`);return t(e.base)},vi=(e,t,n)=>{if(hi(e))return e;throw new v(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${L(e)}\nwhen enumerating:\n${gi(n)}`)},N=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return N(e.base);case`FunctionSet`:return N(e.domain)&&N(e.range)||yi(e.domain)===!0||yi(e)===!0;case`RecordSet`:return e.sets.every(N)||yi(e)===!0;case`ProductSet`:return e.factors.every(N)||yi(e)===!0;case`Union`:return N(e.base)&&(dn(e.base)?Ur(e.base):Ai(e.base)).every(N);case`SetOperation`:return e.operator===`\\cup`?N(e.left)&&N(e.right):e.operator===`\\cap`?N(e.left)||N(e.right):N(e.left);default:return!1}},yi=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=yi(e.domain);return t===void 0?void 0:!t&&yi(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=yi(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return N(e)?P(e).elements.length===0:void 0;default:return}},bi=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},xi=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Si=e=>{if(typeof e!=`object`||e.kind!==`Subset`||Vn(e.base))return;let t=P(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:xi(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return $n(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},Ci=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push($n(r.map(t=>e[t])));while(xi(r,e.length))}return t},wi=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(Vn(a))throw new v(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},Ti=(e,t=e=>P(e).elements)=>{if(typeof e!=`object`)throw new v(`Expected a set but found ${L(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return zr(e.elements);case`Interval`:{let t=ci(e);return t!==ri[t.length]&&oi.set(t,e),t}case`Subset`:{if(Li(e.base)===0)return Ci([]);if(!M(e.base))throw new v(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${j(L(e.base))}`);let t=P(e.base).elements;if(t.length>30)throw new v(Ii(e));return Ci(t)}case`FunctionSet`:{if(!jn&&F(e))return[];if(Vn(e.domain))throw new v(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${L(e.domain)}\ncannot be enumerated.`);let n=ui(e.domain);if((n.length>0||jn)&&Vn(e.range))throw new v(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${L(e.range)}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return bi(n.map(()=>r)).map(e=>tr(n,e))}case`RecordSet`:{if(!jn&&F(e))return[];let n=wi(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${L(t)}`);return bi(n).map(t=>pi(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!jn&&F(e))return[];let n=wi(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${L(e)}`);return bi(n).map(fi)}case`FilteredSet`:if(!M(e.base)||Vn(e.base))throw new v(`Attempted to enumerate { x \\in S : p(x) } when S:\n${L(e.base)}\nis not enumerable`);return P(Xr(Ai(e.base).filter(t=>e.test(t,!1)))).elements;case`Union`:{let t=[];return _i(e).forEach((n,r)=>{let i=vi(n,r,e);if(on(i))throw new s(rn());Ai(i).forEach(e=>an(t,e))}),P(Xr(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!hi(e.left)&&!hi(e.right))throw new v(`Attempted to enumerate S \\cap T when neither S:\n${L(e.left)}\nnor T:\n${L(e.right)}\nis enumerable`);if(e.operator===`\\`&&!hi(e.left))throw new v(`Attempted to enumerate S \\ T when S:\n${L(e.left)}\nis not enumerable.`);if(e.operator===`\\cup`)return P(Xr(Di(e))).elements;let t=e.operator===`\\`||hi(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return sn(typeof n==`object`&&n.kind===`Interval`?n:Ai(n),t=>{qi(t,r)===(e.operator===`\\cap`)&&an(i,t)}),P(Xr(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new v(`Attempted to enumerate the non-enumerable set ${L(e)}`);default:throw new v(`Expected a set but found ${L(e)}`)}},P=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return $n(Ti(e));let t=typeof e==`object`&&Qt(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=Wi.sets;n?.push(e);let r=Ti(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?$n(r):Yr(r);return t&&(t.enumerated=i),i},Ei=e=>{if(!(typeof e!=`object`||or(e)))switch(e.kind){case`MixedSet`:P(e);return;case`FilteredSet`:return hi(e.base)||P(e),Ei(e.base);case`Union`:if(!dn(e.base)&&hi(e.base))return Ei(e.base);_i(e).slice(0,1).forEach(t=>Ei(vi(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!hi(e.left)&&P(e),e.operator!==`\\cup`||hi(e.left)&&hi(e.right)||P(e),e.operator!==`\\cap`||hi(e.left)?Ei(e.left):Ei(e.right),e.operator===`\\cup`&&Ei(e.right)}},Di=e=>{if(!hi(e.left)||!hi(e.right))throw new v(`Attempted to enumerate S \\cup T when S:\n${L(e.left)}\nand T:\n${L(e.right)}\nare not both enumerable`);if(Ei(e.left),Ei(e.right),on(e.left))throw new s(rn());let t=Ai(e.left),n=on(e.right)?void 0:Ai(e.right);if(!n||t.length+n.length>nn())throw new s(rn());return[...t,...n]},Oi=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return P(e).elements;let t=Br(e,()=>Di(e)),n=P(Xr(t)).elements;return e.enumerated=$n(n),n},ki=(e,t)=>{if(typeof e!=`object`||or(e))return P(e).elements.some(t);let n=Wi.sets;n?.push(e),Ei(e);let r=Pi(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Ai=e=>{let t=[];return ki(e,e=>(t.push(e),!1)),t},ji=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,Mi=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(Mi);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(Mi)&&e.range.every(Mi);case`SetOperation`:return e.operator!==`\\cup`&&Mi(e.left)&&Mi(e.right);case`FilteredSet`:return Mi(e.base);case`ProductSet`:return e.factors.every(Mi);default:return!1}},Ni=e=>typeof e!=`object`||or(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?Ni(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||Ni(e.left)||Ni(e.right):ji(e)?.some(Ni)??!1,Pi=(e,t)=>{if(e.kind===`Union`)return _i(e,Ai).some((n,r)=>ki(vi(n,r,e),t));if(e.kind===`FilteredSet`&&hi(e.base))return ki(e.base,n=>e.test(n,!1)&&t(n));if(ji(e)?.some(Ni))return Ti(e,Ai).some(t);if(e.kind!==`SetOperation`)return P(e).elements.some(t);if(e.operator===`\\cup`)return!hi(e.left)||!hi(e.right)?P(e).elements.some(t):ki(e.left,t)||ki(e.right,t);let n=e.operator===`\\`||hi(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return hi(r)?ki(r,n=>qi(n,i)===(e.operator===`\\cap`)&&t(n)):P(e).elements.some(t)},F=e=>{if(typeof e!=`object`||!M(e))throw new v(`Shouldn't call isEmpty() on value ${L(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new v(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(F);case`RecordSet`:return e.sets.some(F);case`FunctionSet`:return!F(e.domain)&&F(e.range);case`Union`:return _i(e).every((t,n)=>F(vi(t,n,e)));default:return P(e).elements.length===0}},Fi=(e,t,n)=>e.reduce((e,r)=>{let i=e*Li(r,t);if(i>2147483647)throw new v(n());return i},1),Ii=e=>`Overflow when computing the number of elements in:\n${L(e)}`,Li=(e,t)=>{if(typeof e!=`object`)throw new v(`Attempted to compute the number of elements in the ${fn(e)} ${L(e)}.`);switch(e.kind){case`ModelValue`:throw new v(`Attempted to compute the number of elements in the model value ${L(e)}.`);case`Function`:return e.domain.length;case`LazyFunction`:return Li(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new v(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new v(`Attempted to compute the number of elements in the overridden value ${L(e)}.`);case`Subset`:{let n=Li(e.base,t);if(n>=31)throw new v(Ii(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(F(e.domain))return 1;if(F(e.range))return 0;if(Li(e.range,t)===1)return 1}let n=Li(e.domain,t),r=Li(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new v(Ii(e));return i}case`RecordSet`:return t!==`1.7.4`&&F(e)?0:Fi(e.sets,t,()=>Ii(e));case`ProductSet`:return t!==`1.7.4`&&F(e)?0:Fi(e.factors,t,()=>`Overflow when computing the number of elements in ${L(e)}`);default:return ur(e),P(e).elements.length}},Ri=e=>`Attempted to check if the set ${L(e)}is finite.`,zi=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new v(`Attempted to check if the ${fn(e)} ${L(e)} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new v(`Attempted to check if the function:\n${L(e)}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return zi(e.base)&&F(e.base);case`Subset`:return zi(e.base);case`FunctionSet`:{let t=zi(e.domain);if(t&&F(e.domain))return!0;let n=zi(e.range);return n&&F(e.range)?!0:n&&(t||Li(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!zi(e))n=!1;else if(F(e))return!0;return n}case`Union`:if(!hi(e.base))throw new v(`Attempted to check if the nonenumerable set:\n${gi(e)}\nis a finite set.`);return P(e.base).elements.every(zi);case`SetOperation`:if(e.operator===`\\cup`)return zi(e.left)&&zi(e.right);if(e.operator===`\\cap`){if(!zi(e.left)&&!zi(e.right))throw new v(Ri(e));return!0}if(zi(e.left))return!0;if(!zi(e.right))throw new v(Ri(e));return!1;case`FilteredSet`:if(!zi(e.base))throw new v(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${L(e.base)}\nis finite.`);return!0}},Bi=(e,t,n=Jn)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},Vi=(e,t)=>{let n=e.elements;if(n.length>nn())throw new s(rn());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=Bi(n,e);return!r[t]&&(r[t]=!0,!0)}),a=$n(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},Hi=e=>{if(typeof e!=`object`||!ln(e))return;if(e.kind===`LazyFunction`&&(!M(e.domain)||Vn(e.domain)))throw new v(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=I(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},Ui=(e,t)=>{let n=`Attempted to check if the value:\n${L(e)}\nis an element of the`;if(!ln(t))return`${n} ${fn(t)} ${L(t)}`;let r=ir(t);return r===`record`?`Attempted to check if element:\n${L(e)}\nis in the record:\n${L(t)}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${L(t)}`},Wi={sets:void 0},Gi=(e,t,n,r)=>{let i=Wi.sets,a=Wi.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof v))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},Ki=e=>(Wi.sets??[]).slice(e).some(e=>typeof e==`object`&&Wi.callStack?.sources.has(e)===!0),qi=(e,t)=>{let n=Wi.sets;if(n===void 0)return Qi(e,t);n.push(t);let r=Qi(e,t);return n.pop(),r},Ji=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},Yi=(e,t)=>Bi(t.elements,e)!==-1,Xi=(e,t)=>t.isNormalized?Vr(e,t.elements).isFound:Hr(e,Ur(t)),Zi=(e,t)=>{if(e.type!==void 0)throw new v(`Attempted to check if the typed model value ${j(L(e))} is an element of\n${j(L(t))}`);return!1},Qi=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return Ji(e,t)??$i(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return $i(e,t)},$i=(e,t)=>{if(!M(t))throw new v(Ui(e,t));switch(t.kind){case`Set`:return ur(e),Gi(Yi,Xi,e,t);case`MixedSet`:return Hr(e,t.elements);case`Interval`:if(typeof e==`number`)return e>=t.low&&e<=t.high;if(t.low<=t.high&&(!un(e)||e.type!==void 0))throw new v(`Attempted to check if the value:\n${L(e)}\nis in the integer interval ${L(t)}`);return!1;case`InfiniteSet`:if(t.name===`Any`)return!0;if(un(e))return Zi(e,t);if(!(t.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new c(`Attempted to check if the value:\n${L(e)}\nis an element of ${t.name}.`);return t.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!M(e)||Vn(e))throw new v(`Attempted to check if the non-enumerable value\n${j(L(e))}\nis element of\n${j(L(t))}`);return P(e).elements.every(e=>qi(e,t.base));case`FunctionSet`:{if(!ln(e)){if(un(e))return Zi(e,t);throw new v(`Attempted to check if \n${L(e)}\nwhich is not a TLC function value, is in the set of functions:\n${j(L(t))}`)}let n=I(e),r=vr(e,n.domain);return(r===void 0?Kr(t.domain,$n(n.domain)):Kr({kind:`Interval`,low:r,high:r+n.domain.length-1},t.domain))&&n.range.every(e=>qi(e,t.range))}case`RecordSet`:{let n=ln(e)?I(e):void 0;if(!n||!xn(n.domain)){if(un(e))return Zi(e,t);throw new v(`Attempted to check if non-record\n${L(e)}\nis in the set of records:\n${L(t)}`)}return n.domain.length===t.names.length&&t.names.every((e,r)=>{let i=Bi(n.domain,e);return i!==-1&&qi(n.range[i],t.sets[r])})}case`ProductSet`:{let n=ln(e)?Hi(e):void 0;if(n===void 0){let n=ln(e)&&I(e).domain.every(e=>typeof e==`number`);if(un(e))return Zi(e,t);if(n)return!1;throw new v(`Attempted to check if non-tuple\n${L(e)}\nis in the set of tuples:\n${L(t)}`)}return n.length===t.factors.length&&n.every((e,n)=>qi(e,t.factors[n]))}case`FilteredSet`:try{return qi(e,t.base)&&t.test(e,!0)}catch(n){throw!(n instanceof v)||!Nt(n)?n:new v(`Cannot decide if element:\n${j(L(e))}\n is element of:\n${j(L(t.base))}\nand satisfies the predicate ${t.source?.predicate}`)}case`Union`:{if(!hi(t.base))throw new v(`Attempted to check if:\n ${L(e)}\nis an element of the non-enumerable set:\n ${gi(t)}`);let n=P(t.base).elements;return n.length>1&&n.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),n.some(t=>qi(e,t))}case`SetOperation`:return t.operator===`\\cup`?qi(e,t.left)||qi(e,t.right):qi(e,t.left)&&qi(e,t.right)===(t.operator===`\\cap`);case`SequenceSet`:{let n=Hi(e);if(n===void 0){if(un(e))return Zi(e,t);throw new c(`Attempted to check if the value:\n${j(L(e))}\nis an element of ${j(L(t))}.`)}return n.every(e=>qi(e,t.base))}default:throw new v(Ui(e,t))}},ea=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?qi(e,n):e.range.every((e,r)=>ea(e,t.range[r],n.range)),I=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(N(e.domain)||Li(e.domain),!M(e.domain))throw new v(`The domains of formal parameters must be enumerable.`);let t=ui(e.domain);return e.enumerated=rr(tr(t,t.map(t=>e.apply(t))),ir(e)),e.enumerated}throw new v(`Expected a function but found ${L(e)}`)},ta=(e,t,n)=>{let r=j(L(e)),i=j(L(t)),a=n===`1.7.4`;switch(ir(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},na=(e,t)=>{if(!jn)return ta(e,t);let n=j(L(t));return ir(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},ra=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},ia=e=>new v(`Attempted to apply function with integer domain to the non-integer argument ${j(L(e))}`),aa=(e,t)=>Bi(e.domain,t),oa=(e,t,n)=>{let r=gn(e);throw jn||r!==e.domain||r.length<32?r.forEach(e=>Rr(e,t)):Bi(r,t,Nr),n},sa=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=ir(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new v(n(e,t));if(a===void 0&&!jn&&typeof t!=`number`&&li(r))throw ia(t)}let i=ra(r,t);return i===-1?Gi(aa,oa,e,t):i},ca=(e,t,n)=>{let r=e.domain,i=Hi(n),a=(t,n,r)=>`In applying the function\n${j(L(e))},\nthe ${t} is:\n${j(L(n))}\nwhich ${r}.\n`,o=()=>new v(a(`argument list`,n,`does not match its formal parameter`));if(i===void 0)throw o();if(typeof r!=`object`||r.kind!==`ProductSet`)throw new v(`Attempted to apply a function to ${L(n)}, which is not in its domain`);if(t.forEach((e,t)=>{if(t>=i.length)throw o();let n=i[t],s=`argument number ${t+1}`;if(!qi(n,r.factors[t]))throw new v(a(s,n,e===void 0?`is not in the function's domain ${L(r)}`:`is not in its domain`));if(e!==void 0&&Hi(n)?.length!==e)throw new v(a(s,n,`does not match its formal parameter`))}),i.length>t.length)throw o()},la=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!qi(t,e.lambdaDomain),ua=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return ua(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return ca(e,r,t),e.apply(t);if(!qi(t,e.domain))throw new v(ir(e)===`lambda`?ta(e,t):`Attempted to apply a function to ${L(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new v(`Attempted to apply ${L(e)}, which is not a function`);let r=n??ta;if(la(e,t))throw new v(r(e,t));let i=sa(e,t,r);if(i===-1)throw new v(r(e,t));return e.range[i]},da=e=>li(e)?oi.get(e)??di(e.length):void 0,fa=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=I(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=da(t.domain);if(n)return n;let r=$n(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},pa=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(!qi(t,e.domain))return e;let r=n(e.apply(t));return rr({kind:`LazyFunction`,domain:e.domain,apply:n=>Kr(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},ir(e))}if(!ln(e))throw new v(`Attempted to apply EXCEPT construct to the value ${j(L(e))}.`);let i=I(e);if(la(i,t))return i;let a=sa(i,t,na);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=rr(tr(i.domain,o),ir(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==ya){let e=wa(c);if(e!==ya){let t=wa(i.domain[a]);l.hash=s===c?i.hash:i.hash-va(t,wa(s))+va(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-Oa(e,s)+Oa(e,c)|0}return l},ma=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},ha=(e,t)=>Math.imul(e^t,16777619),ga=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return ma(t)},_a=e=>ma(e+2654435769|0),va=(e,t)=>ma(Math.imul(e,668265261)+t|0),ya=795548749,ba=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=wa(t[e]);if(r===ya)return ya;n=n+_a(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=wa(e.domain[n]),i=wa(e.range[n]);if(r===ya||i===ya)return ya;t=t+va(r,i)|0}return t},xa=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new v(`TLC has found a state in which the value of a variable contains ${L(e)}`);if(M(e)){P(e).elements.forEach(xa);return}let t=I(e);t.domain.forEach(xa),t.range.forEach(xa)},Sa=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{wa(e)===ya&&xa(e);return}catch(e){if(!(e instanceof v))throw e;return e}},Ca=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},wa=e=>typeof e==`number`?ma(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?ga(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=ba(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?N(e.domain)?wa(I(e)):ya:N(e)?wa(P(e)):ya,Ta=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Ea=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Ta(t)},Da=e=>Ta(Aa(e)+2135587861|0),Oa=(e,t)=>Ta(Math.imul(Aa(e),374761393)+Aa(t)|0),ka=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Da(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+Oa(e.domain[n],e.range[n])|0;return t},Aa=e=>typeof e==`number`?Ta(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Ea(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ka(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?Aa(I(e)):N(e)?Aa(P(e)):Ea(ja(e)),ja=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):Ma(e),Ma=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${ja(e.base)}>`;if(e.kind===`FilteredSet`&&!N(e))throw new v(`Attempted to compare the non-enumerable set ${L(e)} with another value`);if(M(e))return N(e)?`{${P(e).elements.map(ja).join(`,`)}}`:`<${e.kind} ${L(e)}>`;let t=I(e);return`(${t.domain.map((e,n)=>`${ja(e)}:${ja(t.range[n])}`).join(`,`)})`},Na={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},Pa=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>Na[e])}"`,Fa=1999,Ia=e=>e.reduce((e,t)=>e===0?0:e*Li(t),1),La=e=>{if(e.kind===`Subset`)return Li(e.base)<=6?P(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return P(e);if(e.kind===`FunctionSet`){let t=F(e.domain)?0:Li(e.domain);return(t===0?1:Li(e.range)**t)<=Fa?P(e):void 0}return Ia(e.kind===`RecordSet`?e.sets:e.factors)<=Fa?P(e):void 0},Ra=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&ln(e.base)&&(e.base.kind===`Function`||N(e.base.domain)))return La(e);if(N(e))try{return La(e)}catch(e){if(e instanceof v)return;throw e}},za=(e,t)=>{let n=e=>L(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return gi(e,t)}},Ba=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),Va=e=>{if(N(e.domain))try{return I(e)}catch(e){if(e instanceof v||y(e))return;throw e}},Ha=e=>{let t=[],n=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:if(e.elements.forEach(n),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(n),P(e);return;case`Function`:e.range.forEach(n);return;case`LazyFunction`:n(e.enumerated??e.domain);return;case`SetOperation`:n(e.left),n(e.right);return;case`FunctionSet`:n(e.domain),n(e.range);return;case`RecordSet`:e.sets.forEach(n);return;case`ProductSet`:e.factors.forEach(n);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:n(e.base);return;default:return}};try{return e.forEach(n),e.map(e=>L(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1})}},L=(e,t=!1,n=!1)=>{let r=e=>L(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return Pa(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(P(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=Mn.isExpanded?Ra(e,t):void 0;return n?r(n):za(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?Mn.isExpanded||!e.source?Va(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${L(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&jn&&ir(e)!==`tuple`)return`<< >>`;let a=r=>L(r,t,n&&ir(e)!==`lambda`);if(i.domain.length===0&&ir(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):vn(i);return ir(e)===`record`||i.domain.every(e=>typeof e==`string`&&Ba(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},Ua=(e,t)=>{if(e===void 0)return!1;try{return fr(e,t)}catch(e){if(e instanceof v)return!1;throw e}},Wa=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,Ga=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(Wa,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
74
|
-
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(gt(m)>>>0).toString(16),ee=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?ee:ee.toUpperCase()});return i?a:void 0},Ka=(e,t)=>{let n=t?void 0:Pn.get(e);if(n)return n();let r=Object.entries(e),i=In.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
|
|
75
|
-
`:`/\\ %s = %s
|
|
76
|
-
`;if(typeof o!=`string`)throw new b(`The _format field of the ALIAS ${i} is ${L(o)}, but it must be a string.`);return r.filter(([e])=>!(a&&e===`_format`)).filter(([e,n])=>!t||!Ua(t[e],n)).map(([e,t])=>{let n=Ga(o,[e,j(L(t))]);if(n===void 0)throw new b(`The _format field of the ALIAS ${i} is ${L(o)}, but it must format two strings, the name and the value of a field.`);return n}).join(``)},qa=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let Ja=qa[0];const Ya=()=>Ja,Xa=/* @__PURE__ */ new Int32Array(256),Za=/* @__PURE__ */ new Int32Array(256),Qa=/* @__PURE__ */ new Int32Array(256),$a=/* @__PURE__ */ new Int32Array(256),eo=/* @__PURE__ */ new Int32Array(256),to=/* @__PURE__ */ new Int32Array(256),no=/* @__PURE__ */ new Int32Array(256),ro=/* @__PURE__ */ new Int32Array(256);let io=0,ao=0,oo=0,so=0;const co=e=>{let t=(e^so)&255;so=(so>>>8|oo<<24)^eo[t],oo=oo>>>8^Xa[t]},lo=e=>{let t=qa[e];Ja=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);Xa[e]=Number(BigInt.asIntN(32,t>>32n)),eo[e]=Number(BigInt.asIntN(32,t))}let i=[Xa,Za,Qa,$a],a=[eo,to,no,ro];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^eo[o],i[e][r]=t[r]>>>8^Xa[o]}}io=Number(BigInt.asIntN(32,t>>32n)),ao=Number(BigInt.asIntN(32,t))};lo(0);const uo=e=>{let t=so^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;so=oo^ro[n]^no[r]^to[i]^eo[a],oo=$a[n]^Qa[r]^Za[i]^Xa[a]},fo=e=>{if(typeof e==`boolean`)return co(0),co(e?116:102),2;if(typeof e==`number`)return co(1),uo(e),5;if(typeof e==`string`){co(3),uo(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)uo(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)co(e.charCodeAt(n));return 5+e.length}return co(21),uo(zn(e.name)+1),5},po=e=>{if(typeof e!=`object`||un(e))fo(e);else if(ln(e)){let t=I(e);co(9),uo(t.domain.length);for(let e=0;e<t.domain.length;e++)po(t.domain[e]),po(t.range[e])}else{let t=P(e).elements;co(5),uo(t.length);for(let e of t)po(e)}},mo=e=>{let t=oo,n=so;oo=io,so=ao;for(let t of e)po(t);let r=BigInt(oo>>>0)<<32n|BigInt(so>>>0);return oo=t,so=n,r},ho=(e,t)=>{let n=new BigInt64Array(e.length),r=new Int32Array(n.buffer),i=oo,a=so;return e.forEach((e,n)=>{oo=io,so=ao;for(let n of t)po(e[n]);r[2*n]=so,r[2*n+1]=oo}),oo=i,so=a,n},go=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),_o=1024,vo=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*_o),relations:[]}),yo=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},bo=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,xo=(e,t,n,r,i)=>{let a=t===`next`?bo(e,t,r):void 0;if(a!==void 0)return a;let o=yo(e,void 0,r.location.range,-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},So=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,Co=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=t.location.range;return!r||!i?`Action ${a?h(a):`Unknown location`}`:So(r.body.location.range,a)||!a?`${r.name} ${h(i)}`:`${r.name} ${h(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},wo=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,To=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,Eo=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},Do=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(gt(t.name)&2147483647)%e.length].unshift(t));t=e}t[(gt(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},Oo=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),ko=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),Ao=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),jo=(e,t,n)=>{let r=new Set(n.map(wo)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(A(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!go.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=yo(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(wo(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?Ao(t.bounds):t.params.map(e=>e.name);m(t.body,ko(n,e.scope)),t.kind===`Function`&&Oo(t.bounds).forEach(t=>m(t,e.scope)),o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,ko(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:m(e.body,ko(e.params,t));return;case`Lambda`:m(e.body,ko(e.params,t));return;case`Let`:{let n=e.definitions.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),Do(e.definitions).forEach(e=>u({definition:e,scope:n})),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,To(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,Eo(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,To(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,ko(Ao(e.bounds),t)),r(Oo(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,ko(Ao(e.bounds),t)),r(Oo(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,ko(Ao([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,ko(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,ko(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}};e.relations.forEach(e=>{i.push(e.node),m(e.expression,void 0),i.pop()})},Mo=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=Mo(e,r,n);if(t!==-1)return t}}return-1},No=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=Mo(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:Mo(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},Po=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},Fo=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},Io=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},Lo=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Ro=(e,t)=>t.forEach((t,n)=>{let r=mo([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*_o+i;e.registers[o]=Math.max(e.registers[o],Lo(a)+1)}),zo=(e,t)=>{let n=e.registers.subarray(t*_o,(t+1)*_o),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*_o*_o/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*_o?a===0?i:_o*Math.log(_o/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},Bo=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Vo=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>Bo(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Ho=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},Uo=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Wo=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Go=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},Ko=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||Uo(e,t))&&Ho(n,a),Wo(e,t).forEach(e=>i(e).forEach(e=>Ho(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?h(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Wo(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Ho(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=Uo(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Vo(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Wo(e,t).forEach(e=>{i(e),s(e,0)}),n},qo=[`init`,`next`,`invariant`,`constraint`,`implied`],Jo=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,Yo=e=>qo.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Jo(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Jo(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Xo=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?h(i):`Unknown location`}`,distinct:zo(e,r)}}),relations:Yo(e).map(t=>({kind:t.kind,label:t.label,...Go(e,t),expressions:Ko(e,t.node)}))}),Zo=(e,t,n)=>{let r=bo(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},Qo=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),$o=(e,t)=>Qo.has(e)?new v(t):new c(t),es=(e,t,n,r)=>new c(`The ${e} argument of ${t} should be a ${n}, but instead it is:\n${L(r)}`),ts=(e,t,n=e)=>{if(!M(e)||Vn(e))throw new c(`Applying ${t} to the following value,\nwhich is not a finite set:\n${L(n)}`);return P(e)},ns=e=>typeof e==`object`&&e.kind===`Operator`,R=(e,t,n)=>{let r=e[t];if(r===void 0||ns(r))throw $o(n,`${n} expects a value as argument ${t+1}`);return r},rs=(e,t,n)=>{let r=R(e,t,n);if(typeof r!=`boolean`)throw $o(n,`${n} expects a boolean but received ${L(r)}`);return r},is=(e,t,n)=>{let r=e[t];if(r===void 0||!ns(r))throw $o(n,`${n} expects an operator as argument ${t+1}`);return r},as=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),z=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),os=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),ss=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),cs=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(R(n,0,e),R(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ls=e=>e>2147483647||e<-2147483648,us=e=>new c(`Overflow when computing ${e}`),ds={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},fs={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},ps={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},ms={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},hs=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return fs[e.operator];if(e.kind!==`Function`)return ds[e.kind];let t=ir(e);return t===void 0?`FcnRcdValue`:ms[t]},gs=e=>ps[hs(e)],_s=(e,t)=>`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`,vs=(e,t)=>new v(_s(e,t)),ys=(e,t)=>{let n=n=>(...r)=>{let i=Wi.sets?.length??0;try{return n(...r)}catch(n){if(!(n instanceof v)||n instanceof oe)throw n;let r=Ki(i);throw Wi.sets&&(Wi.sets.length=i),e.isLazy!==!0&&n instanceof c&&!r?n:e.isLazy!==!0&&n instanceof ne?new c(_s(t,n.message)):vs(t,n.message)}},r=n(e.evaluate);return{...e,evaluate:(n,i)=>{if(n.length!==e.arity)throw vs(t,`array is not of length ${e.arity}`);return r(n,i)},evaluateUnary:e.evaluateUnary&&n(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&n(e.evaluateBinary)}},bs=(e,t)=>{if(typeof e!=`number`)throw vs(t,`Cannot cast tlc2.value.impl.${hs(e)} to tlc2.value.impl.IntValue`);return e},xs=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,Ss=(e,t,n,r)=>{let i=xs(e,n,`IntValue`,2);return cs(t,(e,n)=>{let a=bs(n,i),o=bs(e,i),s=r(o,a);if(ls(s))throw us(`${o}${t}${a}`);return s})},Cs=(e,t,n)=>{if(typeof e!=`number`)throw new c(`The ${t} argument of ${n} should be an integer, but instead it is:\n${L(e)}`);return e},ws=(e,t,n=e)=>cs(e,(e,r)=>t(Cs(e,`first`,n),Cs(r,`second`,n))),Ts=(e,t,n)=>({...ss(e,t,n),isLazy:!0}),Es=(e,t,n)=>{let r=is(e,t,n);return()=>r.call([])},Ds=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Os=()=>({implication:eg,negate:tg,equivalent:ng,body:rg,condition:(e,t)=>{if(typeof e!=`boolean`)throw Lh(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Rh(t,n,e);return e},apply:ua,expectFunction:Xh,tuple:fi,set:Xr,record:mi,writtenRecord:yn,equal:fr,enumerate:ug,choiceElements:F_,noChoice:e=>{throw I_(e)},filterPredicate:P_,isReducible:cn,finiteElements:e=>P(e).elements,addBounded:an,normalizedSet:er,isBeyondBound:on,cardinality:Li,functionDomain:ui,sortedFunction:tr,unassigned:(e,t)=>{throw Gh(e,t)},prime:e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),keepLazyContext:Zh,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>Jh(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let ks,As;const js=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},Ms=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),Ns=e=>`local${e.counter++}`,Ps=(e,t=/* @__PURE__ */ new Set)=>(e.kind===`Identifier`&&t.add(e.name),e.kind===`Apply`&&t.add(e.operator),ht(e).forEach(e=>Ps(e,t)),t),Fs=(e,t,n)=>{let r=Ps(t),i=[...n.locals].filter(([e])=>r.has(e));if(i.length===0)return n.context;let a=Ms(e,i.map(([e])=>e));return`extend(${n.context}, ${a}, [${i.map(([,e])=>e).join(`, `)}])`},Is=(e,t,n)=>`${Ms(e,U(t,e.environment))}(${Fs(e,t,n)})`,Ls=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},Rs=(e,t,n,r)=>{let i=Ns(e),a=Ns(e),o=Ns(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},zs=(e,t,n)=>{let r=t.kind===`Forall`;return Ls(e,n,n=>{let i=t.bounds.map(()=>Ns(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${Ks(e,r.set,n)}, ${Ms(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=Ns(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${Ks(e,t.body,n)}, ${Ms(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>Rs(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},Bs=(e,t,n,r,i)=>Ls(e,i,i=>{let a=Ns(e),o=Ns(e),s=Ms(e,t),c=`choiceElements(${Ks(e,n,i)}, ${s}, ${Ms(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${Ks(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${Rs(e,a,o,l)} return noChoice(${s});`}),Vs=(e,t,n,r)=>Ls(e,r,r=>{let i=Ns(e),a=Ns(e),o=Ns(e),s=Ns(e),c=Ms(e,t),l=`if (!isReducible(${i})) return ${Ms(e,N_(t,e.environment))}(${i}, ${Fs(e,t,r)});`,u=Ks(e,t.bound.set,r);r.locals.set(n,s);let d=`if (filterPredicate(${Ks(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${Rs(e,a,s,d)} return normalizedSet(${o});`}),Hs=(e,t,n,r)=>Ls(e,r,r=>{let i=Ns(e),a=Ns(e),o=Ns(e),s=Ns(e),c=Ns(e),l=Ns(e),u=Ms(e,A_(t,e.environment)),d=Fs(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=Ks(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${Ks(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${Rs(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),Us=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=Ks(e,r[0],n),a=Ks(e,r[1],n),o=Ms(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${Ks(e,r[0],n)}, ${Ms(e,t)})`;if(t.operator===`<=>`)return`equivalent(${Ks(e,r[0],n)}, ${Ks(e,r[1],n)}, ${Ms(e,t)})`;if(A(t))return Is(e,t,n);let i=Lg(t.operator,e.environment);if(i?.kind!==`Builtin`)return Is(e,t,n);if(i.name===`DOMAIN`)return`${Ms(e,Vh(t))}(${Ks(e,r[0],n)})`;if(i.name===`TLCEval`)return Is(e,t,n);if(i.name===`\\subseteq`&&r.length===2)return`${Ms(e,Hh(t,i))}(${Ks(e,r[0],n)}, ${Ks(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&g_(r[0],a))return`${Ms(e,i.evaluateUnary)}(${Ks(e,r[0],n)})`;let o=r.length===2&&g_(r[0],a)&&g_(r[1],a);return i.evaluateBinary&&o?`${Ms(e,i.evaluateBinary)}(${Ks(e,r[0],n)}, ${Ks(e,r[1],n)})`:Is(e,t,n)},Ws=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(A(e))return!1;let r=Jg(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return Ws(e.expression,t,n);case`FieldAccess`:return Ws(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>Ws(e,t,n));default:return!1}},Gs=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return Gs(e.record);case`FunctionApplication`:return[e.function,...e.args].every(Gs);default:return!1}},Ks=(e,t,n)=>{let r=(t,r=n)=>Ks(e,t,r);switch(t.kind){case`Number`:return pn(t.value)?String(t.value):Is(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(A(t))return Is(e,t,n);let i=Jg(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=Ms(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?Ms(e,i.value):Is(e,t,n)}case`Apply`:return Us(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=Ms(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${Ms(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{T_(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${Ws(t.function,n,e.environment)?r(t.function):Gs(t.function)?r(t.function,i):Is(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${Ms(e,t)}))`,o=Bh(e.environment.runtime.version),s=o?`, ${Ms(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${Ms(e,zh(t))}(${r(t.record)})`;case`Record`:{let i=R_(t.fields);if(z_(i))return Is(e,t,n);let a=Ms(e,i.map(e=>e.name)),o=`[${i.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${o}, ${Ms(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?Is(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?zs(e,t,n):Is(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?Bs(e,t,t.set,t.pattern.name,n):Is(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!k_(t)?Hs(e,t,r.pattern.name,n):Is(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?Vs(e,t,t.bound.pattern.name,n):Is(e,t,n);default:return Is(e,t,n)}},qs=(e,t)=>{if(!Ds.has(e.kind)||(As??=js(),!As))return;let n={environment:t,references:[],helpers:[],counter:0},r=Ks(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
77
|
-
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return ks??=Os(),Function(...Object.keys(ks),...i,a)(...Object.values(ks),...n.references)},Js={kind:`Local`},Ys=/* @__PURE__ */ new WeakSet,Xs=/* @__PURE__ */ new WeakMap,Zs=/* @__PURE__ */ new WeakMap,Qs=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},$s=new Map([`~>`,`-+->`,`\\cdot`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}])),ec=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,tc=e=>e.kind===`Operator`?e.params.length:0,nc=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],rc=e=>e.name.includes(`!`),ic=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},ac=(e,t,n)=>{let r=t.bindings.get(e);return r&&ec(r.position,t.location)&&(!n||ec(r.position,n.start))?r:void 0},oc=(e,t)=>e!==void 0&&t!==void 0&&h(e)===h(t),sc=(e,t,n,r)=>{if(t===void 0)return!0;if(oc(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=h(i),o=t.range&&h(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${e} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${e}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${e}. \nThis duplicates the one at ${o}.`}),!1},cc=(e,t,n,r)=>sc(t,ic(e,t)??ac(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,lc=(e,t,n)=>{sc(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},uc=(e,t,n,r)=>t.reduce((e,t,i)=>cc(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),dc=(e,t,n)=>t.reduce((e,t)=>cc(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),fc=e=>e.kind===`Name`?[e.name]:e.names,pc=e=>e.flatMap(e=>fc(e.pattern)),mc=(e,t)=>{let n=t.definitions.get(e);return n!==void 0&&(n===t.self?n.kind===`Function`||n.isRecursive:n.isRecursive||ec(n.location,t.location))?n:void 0},hc=(e,t)=>{let n=mc(e,t);return n?{key:t.getKey(n),arity:tc(n),params:nc(n),kind:`Definition`}:t.imported.get(e)},gc=(e,t,n)=>ic(t,e)??hc(e,n),_c=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),vc=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:_c(e.location,e.spelling??t)},yc=e=>{if(e.kind===`Apply`){if(e.args.length===2)return`infix`;if(e.args.length===1)return ec(e.location,e.args[0].location)?`prefix`:`postfix`}},bc=e=>!/^[\p{L}\d_]/u.test(e),xc=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Sc=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Cc=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},wc=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Cc(e.name,[],void 0):Cc(e.operator,e.args,e.argumentCounts),Tc=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ec=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:pc(e.bounds),body:e.body,sets:Tc(e.bounds)};case`SetMap`:return{names:pc(e.bounds),body:e.expression,sets:Tc(e.bounds)};case`SetFilter`:return{names:fc(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:fc(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},Dc=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Oc=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,kc=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ac=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind!==`Lambda`)return e.kind===`Let`?Ac(e.body,t):ht(e).reduce((e,n)=>e??Ac(n,t),void 0)},jc=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??jc(i,t,n||kc(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ac(e.set,t):Ac(e,t)},Mc=e=>e.kind===`Label`?Mc(e.body):e,Nc=e=>typeof e==`number`?`argument selector ${e}`:e,Pc=`within the scope of a declaration
|
|
78
|
-
from outside that declaration's scope.`,Fc=(e,t,n,r,i,a)=>{let o=(t,n)=>{let r=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;r&&i.errors.push({location:h(r),message:n})},s=n.isSuffices===n.isInProof,c=n.statement,l={node:c,isGoal:!0,isSufficesOpen:n.isSuffices};for(let[e,n]of t.slice(1).entries()){let a=e+1,u=l.node;if(n.kind===`Name`){if(t[a-1].kind!==`Name`)return u.kind!==`NewSymbol`&&u.kind!==`AssumeProve`&&Mc(u).kind===`Let`?void 0:o(a-1,`A name selector here must be from a LET clause.`);let e=c.kind===`AssumeProve`?[...c.assumptions,c.conclusion]:[c],r=a===1?e.map((e,t)=>({position:t,label:jc(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:u.kind===`Label`?Ac(u.body,n.name):void 0};if(!r?.label)return o(a,`Cannot find label \`${n.name}'.`);if(a===1&&c.kind===`AssumeProve`&&kc(c,r.position)&&s)return o(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Pc}`);if(n.args.length!==r.label.params.length)return o(a,`Label \`${n.name}' used with wrong number of arguments.`);l.node=r.label,l.isGoal=!1,l.isSufficesOpen=!1;continue}if(n.kind!==`Operand`)return;let d=Nc(n.operand);if(l.isSufficesOpen){if(Sc(n.operand,1)!==0)return o(a,u.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);l.isSufficesOpen=!1;continue}if(u.kind===`NewSymbol`)return;if(u.kind!==`AssumeProve`){let e=Mc(u);if([`Number`,`Decimal`,`String`].includes(e.kind))return o(a,`Selecting subexpression of expression that has none.`);let t=e.kind===`Identifier`?gc(e.name,r,i)?.kind:void 0;if(t===`Variable`||t?.startsWith(`New`))return o(a,`Choosing operand \`${d}' of subexpression with no operands.`);let s=Ec(e)?.sets,c=e.kind===`Identifier`?[]:s?s.length>0?s:void 0:e.kind===`Except`?void 0:Dc(e);if(!c)return;let f=Sc(n.operand,c.length);if(f===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);l.node=c[f],l.isGoal=!1;continue}let f=[...u.assumptions,u.conclusion],p=Sc(n.operand,f.length);if(p===-1)return o(a,`Nonexistent operand specified by \`${d}'.`);if(kc(u,p)&&(!l.isGoal||s))return o(a,`Accessing ASSUME/PROVE clause ${Pc}`);let m=f[p];if(m.kind===`NewSymbol`&&a!==t.length-1)return o(a,`Selected a subexpression of a NEW clause of an ASSUME.`);l.node=m,l.isGoal=!1}a||(l.node.kind===`AssumeProve`&&o(void 0,`Selected ASSUME/PROVE instead of expression.`),l.node.kind===`NewSymbol`&&o(void 0,`Selected a NEW declaration as an expression or operator.`))},Ic=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:h(e.location.range),message:n}),!0)},Lc=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=h(r),a=e.params.filter((r,i)=>{let a=ic(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:h(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Rc=(e,t,n,r)=>{if(!Oc(e))return!1;let i=wc(e),a=i[0],o=i.length>1&&a.kind===`Name`?ic(t,a.name)?.goal??n.goals.get(a.name):void 0;return o&&Fc(e,i,o,t,n,r),o!==void 0},zc=(e,t,n,r)=>{let i=e.location;if(Yc(e,n,r))return;let a=Zs.get(e);if(a!==void 0)return a;if(Qs(t))return e.kind===`Apply`?e.args.length:0;let o=ic(n,t);if(o?.isNonFact){r.errors.push({location:h(vc(e,t)),message:`Step number of non-expression step used as an expression.`});return}if(Rc(e,n,r,!1)||xc(t)&&o)return e.kind===`Apply`?e.args.length:0;if(o&&e.kind!==`OperatorReference`&&(e.resolution=Js),o)return o.arity;let s=hc(t,r);if(s)return e.kind===`Identifier`?e.name=s.key:e.operator=s.key,Zs.set(e,s.arity),s.arity;let c=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``;if(c!==``&&(ic(n,c)!==void 0||hc(c,r)!==void 0||r.facts.has(c)))return e.kind===`Apply`?e.args.length:0;let l=(e.kind===`Identifier`?void 0:e.spelling)??t,u=h(e.kind===`Apply`&&l===`-.`?_c(i,`-`):vc(e,t));if(!bc(t)||xc(t)){r.errors.push({location:u,message:`Unknown operator: \`${t}'.`});return}r.errors.push({location:u,message:`Could not find declaration or definition of symbol '${l}'.`});let d=yc(e);d&&i.range&&r.errors.push({location:h(i.range),message:`Couldn't resolve ${d} operator symbol \`${l}'.`})},Bc=(e,t,n)=>(e.forEach(e=>B(e.set,t,n)),e.reduce((e,t)=>uc(e,fc(t.pattern),t.pattern.ranges,n),t)),Vc=(e,t)=>e.kind===`Identifier`&&e.name===t&&A(e)||ht(e).some(e=>Vc(e,t)),Hc=(e,t)=>{e.kind===`FunctionConstruction`&&Vc(e.body,t)&&(e.isRecursive=!0),ht(e).forEach(e=>Hc(e,t))},Uc=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?pc(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:h(o),message:e})},c=e.kind===`Function`?Bc(e.bounds,t,i):dc(t,e.params,i),l=ic(c,a)??ac(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${a} defined at wrong LET/IN level.`):l&&!u&&s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${a} already defined or declared.`),e.kind===`Function`?(B(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),Hc(e.body,a),e.isSelfReferential=Vc(e.body,a)):B(e.body,c,i),l&&u?(l.isPending=!1,l.range=o,!1):e.kind===`Function`?l===void 0:sc(a,ic(t,a)??ac(a,i,o),{kind:`Definition`,arity:tc(e),range:o},i)},Wc=(e,t,n,r=[])=>{let i=/* @__PURE__ */ new Set,a=e.filter(e=>e.isRecursive).reduce((e,t)=>{if(ic(e,t.name)?.isPending)return e;let n={name:t.name,arity:tc(t),params:nc(t),kind:`Definition`,parent:e,isPending:!0};return i.add(n),n},t),o=n.isGenerated?[]:[...r],s=(e,t)=>{let r=o.findIndex(e=>!t(e));return o.splice(0,r===-1?o.length:r).reduce((e,t)=>tl(t,e,n),e)};return s(e.reduce((e,t)=>{let a=Qs(t.name)?e:s(e,e=>!ec(t.location,e.location)),o={name:t.name,arity:tc(t),kind:`Definition`,range:t.location.range,parent:a};if(rc(t))return o;let c=r.some(e=>e.location===t.location),l=n.isGenerated||t.isLocal||Qs(t.name),u=c?{...n,isGenerated:!0,errors:[],warnings:[]}:l?{...n,isGenerated:l}:n;return Uc(t,a,u,i)?{...o,params:nc(t)}:a},a),()=>!0)},Gc=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:ic(t,r)??ac(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity}:void 0},Kc=(e,t,n)=>{if(e.kind!==`Identifier`&&e.kind!==`Apply`)return!1;let r=Gc(e.kind===`Identifier`?e.name:e.operator,t,n),i=e.kind===`Apply`?e.argumentCounts?.[0]??0:0;if(!r||i===r.arity)return!1;let a=(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??e.location.range;return a&&n.errors.push({location:h(a),message:`The operator ${r.name} requires ${r.arity} arguments.`}),!0},qc=(e,t,n)=>{if(Kc(e,t,n))return;let r=e.operator,i=gc(r,t,n),a=zc(e,r,t,n);if(a===void 0)return;if(a!==e.args.length){n.errors.push({location:h(e.argumentsRange??vc(e,r)),message:`The operator ${r} requires ${a-(Gc(r,t,n)?.arity??0)} arguments.`});return}let o=i&&(i.kind===`Definition`?i.params:[]);if(o===void 0){e.args.forEach(e=>Jc(e,t,n));return}let s=(e,t)=>{e&&n.errors.push({location:h(e),message:t})};e.args.map((i,a)=>{let c=o[a]??0,l=i.location.range;if(c===0){if(i.kind===`Lambda`&&i.operator!==void 0)s(l,`The operator ${i.operator} requires 1 arguments.`);else if(i.kind===`Lambda`&&l)s(l,`LAMBDA expression used where an expression is required.`);else if(i.kind===`OperatorReference`){let e=zc(i,i.operator,t,n);e!==void 0&&s(l,`The operator ${i.operator} requires ${e} arguments.`)}else B(i,t,n);return!0}if(i.kind===`Lambda`){B(i,t,n);let o=i.params.length===c;return!o&&Ys.has(i)?s(l,`Expected arity ${c} but found operator of arity ${i.params.length}.`):!o&&l&&i.operator===void 0&&s(e.selectorRanges?.at(-1)??vc(e,r),`Lambda expression with arity ${i.params.length} used as argument ${a+1} of operator \`${r}', \nbut an operator of arity ${c} is required.`),o}if(i.kind===`Subexpression`)return B(i,t,n),!0;if(i.kind===`Apply`&&i.argumentCounts?.at(-1)===0){let e=i.argumentCounts.findIndex(e=>e>0);return s(i.selectorRanges?.[e],`Selector \`${i.operator.split(`!`)[e]}' should not have argument(s).`),!1}if(i.kind!==`Identifier`&&i.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${a+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let u=i.kind===`Identifier`?i.name:i.operator,d=gc(u,t,n)?.params??[],f=zc(i,u,t,n);return i.kind===`Identifier`&&f!==void 0&&f!==c&&s(vc(i,u),`Expected arity ${c} but found operator of arity ${f}.`),f===c&&d.every(e=>e===0)}).forEach((t,n)=>{t||s(e.location.range,`Argument number ${n+1} to operator '${r}' \nshould be a ${o[n]}-parameter operator.`)})},Jc=(e,t,n)=>{e.kind===`Identifier`?zc(e,e.name,t,n):B(e,t,n)},Yc=(e,t,n)=>{let r=Xs.get(e);return r?(r.args.forEach(e=>Jc(e,t,n)),n.errors.push(r.error),!0):!1},B=(e,t,n)=>{if(Ys.has(e)&&!n.isGenerated){B(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>B(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return;case`Identifier`:{if(Kc(e,t,n))return;let r=e.name,i=zc(e,r,t,n);i!==void 0&&i>0&&n.errors.push({location:h(vc(e,r)),message:`The operator ${r} requires ${i} arguments.`});return}case`OperatorReference`:zc(e,e.operator,t,n);return;case`Apply`:qc(e,t,n);return;case`Lambda`:B(e.body,uc(t,e.params,e.paramRanges,n),i(e.params));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:B(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&B(e.other,t,n);return;case`Let`:B(e.body,Wc(e.definitions,t,n,e.instances),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:B(e.body,Bc(e.bounds,t,n),i(pc(e.bounds)));return;case`UnboundedQuantifier`:B(e.body,uc(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&B(e.set,t,n),B(e.body,uc(t,fc(e.pattern),e.pattern.ranges,n),i(fc(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:B(e.predicate,Bc([e.bound],t,n),i(fc(e.bound.pattern)));return;case`SetMap`:B(e.expression,Bc(e.bounds,t,n),i(pc(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:h(r.location.range??_c(r.location,r.name)),message:`Non-unique fields in constructor.`}),B(r.value,t,n)});return;case`Except`:B(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),B(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:r([e.function,...e.args]);return;case`FieldAccess`:B(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Ic(e,n))return;B(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Lc(e,t,n);return;case`Subexpression`:if(Yc(e,t,n))return;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>Jc(e,t,n)),Rc(e,t,n,!1)}},Xc=(e,t,n)=>e.forEach(e=>{if(e.kind===`ModuleFact`||Kc(e,t,n)||Rc(e,t,n,!0))return;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;e.kind===`Identifier`&&ic(t,r)?.isNonFact?n.errors.push({location:h(vc(e,r)),message:`Step number of non-fact used as a fact`}):n.facts.has(r)||B(e,t,n)}),Zc=(e,t,n)=>(e.set&&B(e.set,t,n),cc(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Qc=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:Zc(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Qc(t,e.scope,e.unit,!0):B(t,e.scope,e.unit),e),{scope:t,unit:n});return B(e.conclusion,i.scope,i.unit),i.scope},$c=(e,t,n)=>e.kind===`AssumeProve`?Qc(e,t,n):(B(e,t,n),t),el=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&Xc(e.facts,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>nl(t,e,r),t)},tl=(e,t,n)=>{let r=cl(e,t,n);return e.name===void 0?r:cc(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},nl=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t},o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,isNonFact:!0};switch(r.kind){case`Assert`:{let a=$c(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return el(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0};return el(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return Xc(r.facts,t,n),o(t);case`Instance`:return o(tl(r,t,i));case`Define`:return o(r.definitions.reduce((e,t)=>t.kind===`Instance`?tl(t,e,i):Wc([t],e,n),t));case`Have`:case`Case`:return B(r.expression,t,i),el(e.proof,a(t),n),a(t);case`Witness`:return r.expressions.forEach(e=>B(e,t,i)),a(t);case`Take`:return a(uc(Bc(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let o=uc(Bc(r.bounds,t,i),r.names,r.nameRanges,i);return B(r.body,o,{...i,labelParams:[...i.labelParams,...pc(r.bounds),...r.names]}),el(e.proof,a(t),n),a(o)}default:return el(e.proof,a(t),n),a(t)}},rl=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:$c(e.statement,void 0,t);e.name!==void 0&&lc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),el(e.proof,n,t),r&&(r.isInProof=!1)},il={line:0,column:0},al=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),ol=(e,t)=>{let n=new Map([...$s,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},sl=(e,t,n,i,a)=>{let o=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),i),s=(t,n)=>{if(t.arity===0||n.kind!==`Identifier`){B(n,o,a);return}let i=zc(n,n.name,o,a);if(i!==void 0&&i!==t.arity)throw new r(`An operator must be substituted for symbol '${t.name}', and it must have arity ${t.arity} in the instance of ${e.module} at line ${e.location.line}, column ${e.location.column}`)},c=/* @__PURE__ */ new Map;e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){a.errors.push({location:h(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let i=e.expression;s(r,i);let o=i.location.range;c.has(n)?o&&a.errors.push({location:h(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):c.set(n,i)});let l=t.filter(e=>!c.has(e.name)),u=e=>!ic(o,e.name)&&!hc(e.name,a);return l.filter(e=>!u(e)).forEach(t=>{let n={kind:`Identifier`,name:t.name,location:e.location};s(t,n),c.set(t.name,n)}),l.filter(u).forEach(t=>{let r=e.location.range,i=t.location.range;r&&i&&a.errors.push({location:h(r),message:`Substitution missing for symbol ${t.name} declared at ${h(i)} \nand instantiated in module ${n}.`})}),c},cl=(e,t,n)=>{let r=n.getInstance(e);return sl(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,[t,r])=>cc(e,t,r,n),t)},ll=(e,t,n,r)=>{let i=ol(n,r.imported),a={location:e.location,errors:[],warnings:[]};return r.reports.push(a),sl(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(([e,t])=>[e,{...t,position:il}])),errors:a.errors,warnings:a.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},ul=(e,t)=>{let n=[],i=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>ec(e.location,t.location)?-1:+!!ec(t.location,e.location)).forEach(e=>{let a=[],o=[];try{e.check(a,o)}catch(e){if(!(e instanceof r)||!e.sany&&a.length===0)throw e;a.push(...e.sany?.errors??[])}a.forEach(e=>i(n,e)),o.forEach(e=>i(t,e))}),n},dl=(e,t)=>{let n=ol(e,t.imported),r=/* @__PURE__ */ new Set([...t.facts,...[...e.theorems,...e.assumptions].flatMap(e=>e.name??[])]),i=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1}]]:[])),a=new Map([...$s,...t.bound].map(([e,t])=>[e,{...t,position:il}])),o=/* @__PURE__ */ new Set,s=[],c=(e,o,s,c,l)=>({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,location:e,self:o,facts:r,goals:i,bindings:a,errors:s,warnings:c,hasLabelScope:l,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1}),l=(e,t)=>e.map(e=>({location:e.location,check:(n,r)=>lc(e.name,{kind:t,arity:e.arity,range:e.location.range},c(e.location,void 0,n,r,!1))}));return ul([...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...l(e.constants,`Constant`),...l(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>({location:e.location,check:(t,n)=>{let r={kind:`Definition`,arity:e.arity,range:e.location.range,position:e.location,isPending:!0},i=sc(e.name,a.get(e.name),r,c(e.location,void 0,t,n,!1));i&&(a.set(e.name,r),o.add(r)),s.push({declaration:e,binding:i?r:void 0})}})),...e.definitions.map(t=>({location:t.location,check:(n,r)=>{let i=c(t.location,t,n,r,!0);al(e,t)?B(t.body,void 0,i):Uc(t,void 0,i,o)&&a.set(t.name,{kind:`Definition`,arity:tc(t),range:t.location.range,position:t.location})}})),...e.instances.map(e=>({location:e.location,check:(n,r)=>{let i=c(e.location,void 0,n,r,!1);dc(void 0,e.params,i),t.instanced.get(e)?.forEach((e,t)=>lc(t,e,i)),e.name!==void 0&&lc(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},i)}})),...e.assumptions.map(e=>({location:e.location,check:(t,n)=>{let r=c(e.location,void 0,t,n,e.name!==void 0);B(e.expression,void 0,r),e.name!==void 0&&lc(e.name,{kind:`Theorem`,arity:0,range:e.location.range},r)}})),...e.theorems.map(e=>({location:e.location,check:(t,n)=>rl(e,c(e.location,void 0,t,n,e.name!==void 0))})),...e.uses.map(e=>({location:e.location,check:(t,n)=>Xc(e.facts,void 0,c(e.location,void 0,t,n,!1))})),{location:e.location.range?.end??e.location,check:e=>s.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:h(n),message:`Symbol ${t.declaration.name} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},fl=/* @__PURE__ */ new WeakSet,pl=/* @__PURE__ */ new WeakMap,ml=(e,t)=>{if(t.length===0)return e;let n={...e};return fl.has(e)&&fl.add(n),pl.set(n,[...t,...pl.get(e)??[]]),n},hl=(e,t,n=/* @__PURE__ */ new Set)=>{let r=xl(e,(e,r)=>hl(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&A(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&A(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},gl=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),_l=/* @__PURE__ */ new WeakMap,vl=e=>_l.get(e)??e.name,yl=(e,t)=>(vl(t)!==e.name&&_l.set(e,vl(t)),e),bl=(e,t)=>yl(e.kind===`Function`?{...e,bounds:gl(e.bounds,e=>t(e,[])),body:t(e.body,pc(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),xl=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>bl(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:gl(e.bounds,n),body:t(e.body,pc(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,fc(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,fc(e.bound.pattern))};case`SetMap`:return{...e,bounds:gl(e.bounds,n),expression:t(e.expression,pc(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({path:e.path.map(e=>e.kind===`Index`?{kind:`Index`,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Sl=`LAMBDA`,Cl=e=>`${e}@SUBSTITUTION`,wl=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(wl),Tl=(e,t)=>{if(e.kind!==`Identifier`)return!wl(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=A(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!wl(n.body)},El=(e,t=/* @__PURE__ */ new Set)=>{let n=e.kind===`Identifier`?e.name:e.kind===`Apply`||e.kind===`OperatorReference`?e.operator:void 0,r=n===void 0||t.has(n)?[]:[n];return xl(e,(e,n)=>(r.push(...El(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n]))),e)),r},Dl=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Ol=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),kl=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Al=(e,t)=>e.map(e=>({pattern:kl(e.pattern,t),set:e.set})),jl=(e,t)=>e.kind===`Function`?{...e,bounds:Al(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Ml=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>yl({...jl(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Al(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:kl(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:kl(e.bound.pattern,n),set:e.bound.set}};default:return e}},Nl=e=>`${e}@ENABLED`,Pl=(e,t)=>e.modes.get(t)??e,Fl=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!A(e)&&t.instantiation.variables.has(e.name),Il=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Il(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Fl(e,t,n))return[e.name];let r=A(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Il(r.body,t,/* @__PURE__ */ new Map):void 0},Ll=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Fl(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:Nl(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:Hl(e.expression,Pl(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[Hl(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:Hl(e.subscript,Pl(t,`Primed`),n),location:r},Hl(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Il(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:Nl(r),location:e.location},location:e.location},Hl({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Rl=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Js}),zl=(e,t)=>e.map(e=>Rl(e.name,t)),Bl=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...zl(t,r),...i.map(e=>Rl(e,r))],location:r},location:r}},Vl=(e,t)=>e.instantiation.isParameterized(t)?Wl(e,t):void 0,Hl=(e,t,n)=>{let i=e=>Hl(e,t,n),a=t.instantiation,o=a.params,s=t=>!n.has(t)&&!A(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:Hl(e.expression,Pl(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:i(e.subscript),action:i(e.action),enabled:Hl(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Pl(t,`Enabled`),n)};let c=Ll(e,t,n);if(c)return c;if(e.kind===`Identifier`&&s(e.name)){let n=a.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!Tl(n,a)))return ml(n,[e]);if(n&&r){let t=Cl(e.name);return r.set(t,n),Rl(t,e.location)}let i=Vl(t,e.name);if(i===void 0)return e;if(o.length===0)return{...e,name:i};let s=a.getDefinition(e.name);return s&&tc(s)>0?Bl(i,o,tc(s),e.location):{kind:`Apply`,operator:i,args:zl(o,e.location),location:e.location}}if(e.kind===`Apply`&&s(e.operator)){let n=e.args.map(i),s=a.substitutions.get(e.operator),c=a.substitutions.size>0||o.length>0||fl.has(e),l=e=>(c&&fl.add(e),e);if(s?.kind===`Identifier`||s?.kind===`OperatorReference`){let t=s.kind===`Identifier`?s.name:s.operator;return l({...e,operator:t,args:n,resolution:s.kind===`Identifier`?s.resolution:void 0})}if(s?.kind===`Apply`)return l({...e,operator:s.operator,args:[...s.args,...n],resolution:s.resolution});if(s?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Sl,params:s.params.map(e=>({name:e,arity:0})),body:s.body,isLocal:!0,isRecursive:!1,location:s.location}],body:{...e,operator:Sl,args:n,resolution:Js},location:e.location};if(s)throw new r(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=Vl(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...zl(o,e.location),...n]}}if(e.kind===`OperatorReference`&&s(e.operator)){let n=Vl(t,e.operator);if(n===void 0)return e;let r=a.getDefinition(e.operator);return o.length>0&&r?Bl(n,o,tc(r),e.location):{...e,operator:n}}let l=Dl(t),u=xl(e,(e,r)=>r.length===0?i(e):Hl(e,t,Ol(n,r,l)));return Ml(u,n,l)},Ul=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Rl(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},Wl=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Dl(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o}:e,c=jl(bl(i,(e,t)=>Hl(e,s,Ol(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(([e,t])=>({kind:`Operator`,name:e,params:[],body:t,isLocal:!0,isRecursive:!1,location:t.location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&pl.set(l,[u,...pl.get(i.body)??[]]),Ul({...c,body:l},r.params,i.location)}):t},Gl=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>El(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>Vl(i,e)??e,getQualifiedKey:t=>{let n=Vl(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>Ul(r,e.params,r.location)):t}}},Kl=e=>e.kind===`Let`&&e.instances!==void 0||ht(e).some(Kl),ql=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=xl(e,e=>ql(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>ec(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},Jl=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,Yl=(e,t)=>e.definitions.some(e=>Kl(e.body))||e.assumptions.some(e=>Kl(e.expression))||e.theorems.some(e=>{let t=Jl(e);return t!==void 0&&Kl(t)})?{...e,definitions:e.definitions.map(e=>bl(e,e=>ql(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:ql(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=Jl(e);return n===void 0?e:{...e,statement:ql(n,t,[])}})}:e,Xl=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]]].map(e=>[e[0],{name:e[0],level:e[1],params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),Zl={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},Ql=(e,t)=>{let n=Zl[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},$l=(e,t)=>`${e}${t}`,eu=(e,t,n)=>`${e}${t}${n}`,tu=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},nu=(e,t,n)=>`${e},${t},${n}`,ru=(e=0)=>({level:e,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),iu=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),au=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),ou=(e,t,n,r)=>({...ru(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),su=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,cu=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,lu=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(([e,t,n,r])=>[e,{...ou(e,t,[...n],[...r]),nonLeibniz:new Set(t>1?[0,1]:[])}])),uu=ou(`$Set`,0,[2],[1]),du=ou(`$Junction`,0,[3],[1]),fu=ou(`$Choose`,0,[2],[1]),pu=ou(`$Function`,0,[3],[1]),mu=ou(`$FcnApply`,0,[2,2],[1,1]),hu=ou(`$RcdSelect`,0,[2,0],[1,1]),gu=ou(`'`,2,[1],[0]),_u=ou(`ENABLED`,1,[2],[0]),vu=ou(`[]`,3,[3],[0]),yu=ou(`$SquareAct`,2,[2,1],[0,0]),bu=ou(`$WF`,3,[1,2],[0,0]),xu=ou(`$TemporalExists`,3,[3],[0]),Su=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity}])]),Cu=e=>e.map(e=>({name:e,arity:0})),wu=(e,t)=>t.location.range?a(`${e}.`,t.location.range):new r(`${e} at line ${t.location.line}, column ${t.location.column}`),Tu=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),Eu=e=>e.kind!==`Let`&&e.kind!==`Label`,Du=e=>{let t=/* @__PURE__ */ new Map,n=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:0,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:_(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=_(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=lu.get(t)??Xl.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},i=(e,t,n)=>{let r=ru(Math.max(t,...n.map(e=>e.data.level)));return r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(eu(e,n,t))}),t.data.constraints.forEach((e,t)=>iu(r.constraints,t,e)),au(r.argConstraints,$l(e,n),t.data.level),t.data.argConstraints.forEach((e,t)=>au(r.argConstraints,t,e)),t.data.argParams.forEach(e=>r.argParams.add(e))}),r},a=(e,t,n=[],i=[])=>{let a=e=>i.includes(e);if(t.forEach((t,n)=>{if(!(t.operator||t.declared)&&t.data.level>su(e,n))throw new r(`Level error in applying operator ${e.name}:\nThe level of argument ${n+1} exceeds the maximum level allowed by the operator`)}),n.some(e=>e.level>2))throw new r(`Level error in applying operator ${e.name}:\nThe level of the range for a bounded variable exceeds the maximum level allowed by the operator`);let o=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},s=(t,n,r)=>e.conditions.has(nu(t,n,r)),c=ru(Math.max(e.level,...t.filter((t,n)=>cu(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return e.params.forEach(e=>c.params.add(e)),t.forEach((t,n)=>{cu(e,n)===1&&t.data.params.forEach(e=>c.params.add(e))}),n.forEach(e=>e.params.forEach(e=>c.params.add(e))),i.forEach(e=>c.params.delete(e)),e.constraints.forEach((e,t)=>iu(c.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||iu(c.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>iu(c.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||iu(c.constraints,t,su(e,n))})),t.forEach((e,n)=>{let r=e.operator;r&&t.forEach((e,t)=>r.formals.forEach((i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>iu(c.constraints,e,su(r,a)))}))}),e.argParams.forEach(e=>{let t=tu(e),n=o(t.operator)?.operator;n&&iu(c.constraints,t.param,su(n,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>au(c.argConstraints,t,e))),t.forEach((n,r)=>{let i=n.declared;i&&(Array.from({length:i.arity},(t,n)=>au(c.argConstraints,$l(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{s(r,t,a)&&au(c.argConstraints,$l(i.name,a),e.data.level)})))}),e.argParams.forEach(e=>{let t=tu(e),n=o(t.operator);n&&au(c.argConstraints,$l(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(tu(e).param)||c.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>c.argParams.add(e))),e.argParams.forEach(e=>{let t=tu(e),n=o(t.operator);if(n)n.declared&&c.argParams.add(eu(n.declared.name,t.index,t.param));else{let n=o(t.param);if(!n){c.argParams.add(e);return}n.data.params.forEach(e=>c.argParams.add(eu(t.operator,t.index,e)))}}),t.forEach((e,n)=>{let r=e.declared;r&&t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{s(n,t,a)&&e.data.params.forEach(e=>c.argParams.add(eu(r.name,a,e)))}))}),c},o=(e,t)=>{if(e.kind===`Lambda`){let n=ee(`LAMBDA`,Cu(e.params),e.body,t);return{data:n,operator:n}}let r=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(r!==void 0){let i=n(r,t);if(i.kind===`Defined`&&(i.levels.formals.length>0||e.kind===`OperatorReference`))return{data:i.levels,operator:i.levels};if(i.kind===`Declared`&&i.arity>0){let e=ru();return e.params.add(r),{data:e,declared:{name:r,arity:i.arity}}}if(e.kind===`OperatorReference`)return{data:ru()}}return{data:m(e,t)}},s=(e,t)=>e.map(e=>o(e,t)),c=(e,t,n,r=[],i=[])=>{let o=Su(n,Cu(i));return a(e,s(t,o),r.map(e=>m(e,n)),i)},l=(e,t)=>e.kind===`Declared`?i(e.name,e.level,t):a(e.levels,t),u=(e,t)=>{let n=e.map(e=>e.data.level);if(n.includes(2)&&n.includes(3))throw wu(`Formula has both temporal formula and action as arguments`,t)},d=(e,t)=>{if((e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2))throw wu(`Action used where only temporal formula or state predicate allowed`,e);Tu.has(e.operator)&&u(t,e)},f=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;if(t===2&&Eu(n)&&n.kind!==r)throw wu(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`,e)},p=(e,t)=>{let n=new Map(t);e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n}));let r=m(e.body,n),i={level:r.level,params:new Set(r.params),constraints:new Map(r.constraints),argConstraints:new Map(r.argConstraints),argParams:new Set(r.argParams)};return e.definitions.forEach(e=>{let t=_(e,n);t.constraints.forEach((e,t)=>iu(i.constraints,t,e)),t.argConstraints.forEach((e,t)=>au(i.argConstraints,t,e)),t.argParams.forEach(e=>i.argParams.add(e))}),i},m=(e,t)=>{try{return h(e,t)}catch(t){throw!(t instanceof r)||t.sany?t:wu(t.message,e)}},h=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return ru();case`Identifier`:return l(n(e.name,t),[]);case`Apply`:{let r=s(e.args,t);return d(e,r),l(n(e.operator,t),r)}case`OperatorReference`:case`Lambda`:return o(e,t).data;case`And`:case`Or`:{let n=s(e.operands,t);return u(n,e),a(du,n)}case`Prime`:case`Unchanged`:return c(gu,[e.expression],t);case`Enabled`:return c(_u,[e.expression],t);case`Always`:case`Eventually`:{let n=o(e.expression,t);return f(e,n.data.level),a(vu,[n])}case`If`:return c(du,[e.condition,e.consequent,e.alternative],t);case`Case`:return c(du,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return p(e,t);case`Forall`:case`Exists`:{let n=c(du,[e.body],t,e.bounds.map(e=>e.set),pc(e.bounds)),r=n.level===3?e.bounds.find(e=>m(e.set,t).level===2):void 0;if(r)throw wu(`Action-level bound of quantified temporal formula`,r.set);return n}case`UnboundedQuantifier`:return c(e.isTemporal?xu:du,[e.body],t,[],e.names);case`Choose`:return c(fu,[e.body],t,e.set?[e.set]:[],fc(e.pattern));case`SetEnumeration`:case`Tuple`:case`FunctionSet`:case`Product`:return c(uu,e.kind===`FunctionSet`?[e.domain,e.range]:e.kind===`Product`?e.factors:e.elements,t);case`SetFilter`:return c(uu,[e.predicate],t,[e.bound.set],fc(e.bound.pattern));case`SetMap`:return c(uu,[e.expression],t,e.bounds.map(e=>e.set),pc(e.bounds));case`FunctionConstruction`:return c(pu,[e.body],t,e.bounds.map(e=>e.set),pc(e.bounds));case`Record`:return c(pu,e.fields.map(e=>e.value),t);case`RecordSet`:return c(uu,e.fields.map(e=>e.value),t);case`Except`:return c(uu,[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])],t);case`FunctionApplication`:return a(mu,[o(e.function,t),e.args.length===1?o(e.args[0],t):{data:c(uu,e.args,t)}]);case`Bracket`:return ru();case`FieldAccess`:return a(hu,[o(e.record,t),{data:ru()}]);case`BoxAction`:case`AngleAction`:return c(yu,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return c(bu,[e.subscript,e.action],t);case`Label`:return m(e.body,t);case`Subexpression`:return ru()}},g=(e,t,r=!1,i=/* @__PURE__ */ new Set)=>{let a=(e,n=r,a=t)=>g(e,a,n,i),o=(e,o)=>{let s=n(e,t);s.kind===`Declared`?(r&&i.add(e),o.forEach(e=>a(e))):o.forEach((e,t)=>a(e,r||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),i;case`Apply`:return o(e.operator,e.args),i;case`Lambda`:case`Let`:return i;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return ht(e).forEach(e=>a(e,!0)),i;case`UnboundedQuantifier`:return a(e.body,r||e.isTemporal===!0,Su(t,Cu(e.names))),i;default:return xl(e,(e,n)=>(a(e,r,Su(t,Cu(n))),e)),i}},ee=(e,t,n,r)=>{let i=Su(r,t),a=m(n,i),o=e=>t.some(t=>t.name===e),s=g(n,i),c={...ru(a.level),name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get($l(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(eu(e.name,n,t.name))).map(e=>nu(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(tu(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=tu(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},_=(e,n)=>{let r=t.get(e);if(r)return r;let i=e.kind===`Operator`?e.params:[];t.set(e,{...ru(),name:e.name,formals:i,maxLevels:i.map(()=>3),weights:i.map(()=>0),minMaxLevels:i.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set});let a=e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,o=ee(e.name,i,a,n);return t.set(e,o),o};return{analyze:m,analyzeDefinition:_,toOperand:o}},Ou=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r);return r.set(e.name,{kind:`Formal`,arity:e.arity}),t?[t]:[]}return[e.kind===`AssumeProve`?Ou(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=ru(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),e.constraints.forEach((e,t)=>iu(a.constraints,t,e)),e.argConstraints.forEach((e,t)=>au(a.argConstraints,t,e)),e.argParams.forEach(e=>a.argParams.add(e))}),a},ku=(e,t,n,r)=>{let i=Du(t),a=e=>Math.max(0,...e.map(e=>i.analyze(e,/* @__PURE__ */ new Map).level)),o=e=>{let t=e.body;return t.kind===`Have`||t.kind===`Case`?a([t.expression]):t.kind===`Witness`?a(t.expressions):t.kind===`Take`?a(t.bounds.map(e=>e.set)):t.kind===`Pick`?a([t.body,...t.bounds.map(e=>e.set)]):t.kind===`Assert`?t.statement.kind===`AssumeProve`?Ou(t.statement,/* @__PURE__ */ new Map,i).level:a([t.statement]):0},s=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=h(e.statement),n=()=>o(e)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...s(e.proof)]:e.body.kind===`Qed`?s(e.proof):[]}):[],c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=e.body,n=()=>o(e)===3,r=t.kind===`Pick`&&t.bounds.length>0&&n()?t.bounds.filter(e=>a([e.set])!==0).flatMap(e=>e.set.location.range?[{location:h(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...c(e.proof),...r,...e.proof?.kind===`Steps`&&n()?s(e.proof):[]]}):[],l=ul([...e.definitions.filter(e=>!e.name.includes(`!`)).map(e=>({location:e.location,check:()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map)})),...e.assumptions.map(e=>({location:e.location,check:()=>i.analyze(e.expression,/* @__PURE__ */ new Map)})),...e.theorems.map(e=>({location:e.location,check:()=>{let t=e.statement.kind===`AssumeProve`?Ou(e.statement,/* @__PURE__ */ new Map,i):i.analyze(e.statement,/* @__PURE__ */ new Map),n=[...c(e.proof),...t.level===3?s(e.proof):[]];if(n.length>0)throw re(n)}})),...n],r);if(l.length>0)throw re(l,!1,void 0,r)},Au=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),ju=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Mu=/* @__PURE__ */ new Set([...Au,...ju,`Enabled`]),Nu=/* @__PURE__ */ new Set([`~>`,`-+->`]),Pu=/* @__PURE__ */ new Set([...Nu,`\\cdot`]),Fu=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),Iu=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Lu=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},Ru=(e,t)=>Fu.has(e)||t.builtins.get(e)?.isStateLevel===!0,zu=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Au.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(ju.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Nu.has(e.operator))return 224},o=(e,n)=>{let s=e.kind;(Mu.has(s)||s===`UnboundedQuantifier`&&e.isTemporal===!0||s===`Apply`&&Pu.has(e.operator))&&(r[0]|=1),Mu.has(s)&&(r[0]|=16);let c=a(e);n&&c!==void 0&&(r[0]|=c);let l=n&&c===void 0,u=Lu(e);if(u!==void 0&&!A(e)){let e=t.substitutions.get(u)??u,n=t.definitions.get(e),a=t.constants.has(u),o=t.variableIndex.get(u);if((o!==void 0||t.builtins.get(u)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=1),o!==void 0&&(l&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:l});else{Ru(u,t)&&(r[0]|=2|(u===`Assert`?0:4)),Iu.has(u)&&(r[0]|=8),!a&&Ru(e,t)&&(r[0]|=16);let n=t.builtins.get(e);l&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}ht(e).forEach(e=>o(e,l))};return e.forEach(e=>o(e,!0)),{row:r,edges:i}},Bu=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],Vu=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Hu=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&1),Uu=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=zu(Bu(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&14,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Vu(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Vu(i,r,u,224),f=o.map(e=>new Int32Array(e.map(s).filter(e=>!Hu(t[e],l[e*r])))),p=Vu(a,r,f,14);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|d[t]&224|p[t]&14:e),words:r}},Wu=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Gu(Bu(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Gu=(e,t)=>{let n=t.facts.words,r=zu(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Wu(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Hu(e.callee,r[0])||(i[0]|=r[0]&14)}),i},Ku=(e,t)=>!(Wu(e,t)[0]&1),qu={any:2,repeated:4,streamed:8},Ju=(e,t,n=`any`)=>(Wu(e,t)[0]&qu[n])!==0,Yu=(e,t)=>{let n=Wu(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Xu=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},Zu=(e,t)=>{let n=Gu([e],t);return n[0]&16?void 0:Xu(n)},Qu=(e,t)=>!!(Gu([e],t)[0]&1),$u=(e,t,n)=>new c(`Applying ${e} to the following value,\nwhich is not ${t}:\n${L(n)}`),ed=e=>ln(e)?I(e):void 0,td=`a function with a finite domain`,nd=(e,t,n)=>{let r=R(e,t,n),i=ed(r);if(!i)throw $u(n,td,r);return i},rd=(e,t)=>{let n=R(e,1,t),r=ed(n),i=r&&sd(r,R(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw es(`second`,t,`bag`,n);return i},id=(e,t,n)=>{let r=t[n];if(!r||!od(r))throw es(n===0?`first`:`second`,`(+)`,`bag`,R(e,n,`(+)`));return r},ad=(e,t)=>{if(!M(e)||!N(e))throw t();return P(e).elements},od=e=>e.range.every(e=>typeof e==`number`&&e>0),sd=(e,t)=>{let n=e.domain.findIndex(e=>Kr(t,e));return n===-1?void 0:e.range[n]},cd=e=>{if(typeof e==`number`)return e;let t=`tlc2.value.impl.${hs(e)}`;throw new v(`class ${t} cannot be cast to class tlc2.value.impl.IntValue (${t} and tlc2.value.impl.IntValue are in unnamed module of loader 'app')`)},ld=(e,t)=>{let n=cd(e)+cd(t);if(ls(n))throw us(`${e}+${t}`);return n},ud=(e,t,n)=>{let r=cd(e.range[t]),i=sd(n,e.domain[t]);if(i===void 0)return r;let a=r-cd(i);if(ls(a))throw us(`${r}-${i}`);return a},dd=(e,t,n,r=e.length)=>{let i=e.slice(0,r).find(e=>Kr(t,e[0]));i?i[1]=ld(i[1],n):e.push([t,n])},fd=e=>e.domain.map((t,n)=>[t,e.range[n]]),pd=tr([],[]),md=e=>[as(`EmptyBag`,pd),z(`IsABag`,1,e=>{let t=ed(R(e,0,`IsABag`));return t!==void 0&&od(t)}),z(`BagCardinality`,1,e=>{let t=R(e,0,`BagCardinality`);return nd(e,0,`BagCardinality`).range.reduce((e,n)=>{if(typeof n!=`number`||n<=0)throw $u(`BagCardinality`,`a bag`,t);return ld(e,n)},0)}),z(`BagIn`,2,e=>{let t=rd(e,`BagIn`);return t!==void 0&&t>0}),z(`CopiesIn`,2,e=>rd(e,`CopiesIn`)??0),z(`\\oplus`,2,e=>{let t=[0,1].map(t=>ed(R(e,t,`(+)`))),n=id(e,t,0),r=id(e,t,1),i=fd(n);return r.domain.forEach((e,t)=>dd(i,e,r.range[t],n.domain.length)),ti(i)}),z(`\\ominus`,2,e=>{let t=R(e,0,`(-)`),n=R(e,1,`(-)`),r=ed(t),i=ed(n);if(!r)throw es(`first`,`(-)`,`bag`,t);if(!i)throw es(`second`,`(-)`,`bag`,n);return ti(r.domain.flatMap((e,t)=>{let n=ud(r,t,i);return n>0?[[e,n]]:[]}))}),z(`BagUnion`,1,e=>{let t=R(e,0,`BagUnion`),n=ad(t,()=>$u(`BagUnion`,`a finite enumerable set`,t));if(n.length<2)return n[0]??pd;let r=e=>{let n=ed(e);if(!n)throw new c(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${L(t)}`);return n},i=fd(r(n[0]));return n.slice(1).forEach(e=>{let t=r(e);t.domain.forEach((e,n)=>dd(i,e,t.range[n]))}),ti(i)}),z(`\\sqsubseteq`,2,e=>{let t=R(e,0,`\\sqsubseteq`),n=R(e,1,`\\sqsubseteq`),r=ed(t),i=ed(n);if(!r)throw $u(`\\sqsubseteq`,td,t);if(!i)throw $u(`\\sqsubseteq`,td,n);return r.domain.every((e,t)=>{let n=sd(i,e);return cd(r.range[t])<=(n===void 0?0:cd(n))})}),os(`BagOfAll`,2,e=>{let t=is(e,0,`BagOfAll`),n=R(e,1,`BagOfAll`),r=ed(n);if(!r)throw es(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[];return r.domain.forEach((e,n)=>dd(i,t.call([e]),r.range[n])),ti(i)}),z(`SubBag`,1,t=>{let n=R(t,0,`SubBag`);if(!ln(n))throw new v(`Attempted to apply the operator DOMAIN to a non-function\n(${gs(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=I(n),i=P(Xr(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new v(`Attempted to apply a function to ${L(r)}, which is not in its domain`);return Yr(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>tr(e.map(e=>e[0]),e.map(e=>e[1]))))}),z(`BagToSet`,1,e=>fa(nd(e,0,`BagToSet`))),z(`SetToBag`,1,e=>{let t=R(e,0,`SetToBag`),n=ad(t,()=>$u(`BagToSet`,td,t));return tr([...n],n.map(()=>1))})],hd={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},V={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},gd={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},_d=[{lower:`true`,upper:`TRUE`,token:V.true},{lower:`false`,upper:`FALSE`,token:V.false},{lower:`null`,upper:`NULL`,token:V.null}],vd=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
79
|
-
`],[`r`,`\r`],[`f`,`\f`]]),yd=1024,bd=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=V.none,s=0,c=[hd.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===hd.emptyArray||e===hd.nonemptyArray?`[${u[t]}]`:e===hd.emptyDocument||e===hd.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new v(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
80
|
-
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new v(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
81
|
-
`.includes(e),ee=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
82
|
-
`){r++,i=n;return}if(t===`\r`)return}},_=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
|
|
83
|
-
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},y=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
84
|
-
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)ee();else if(_(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),ee();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},b=()=>{let e=y();if(e===void 0)throw m();return e},te=()=>{let t=_d.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return V.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return V.none}return n+r<e.length&&g(e[n+r])?V.none:(n+=r,t.token)},x=()=>{let t=gd.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===yd)return V.none;let a=e[n+i];if(a===`-`){if(t===gd.none)t=gd.sign;else if(t===gd.exponentE)t=gd.exponentSign;else return V.none}else if(a===`+`){if(t!==gd.exponentE)return V.none;t=gd.exponentSign}else if(a===`e`||a===`E`){if(t!==gd.digit&&t!==gd.fractionDigit)return V.none;t=gd.exponentE}else if(a===`.`){if(t!==gd.digit)return V.none;t=gd.decimal}else if(a<`0`||a>`9`){if(g(a))return V.none;break}else if(t===gd.sign||t===gd.none)r=a===`0`,t=gd.digit;else if(t===gd.digit){if(r)return V.none}else t===gd.decimal?t=gd.fractionDigit:(t===gd.exponentE||t===gd.exponentSign)&&(t=gd.exponentDigit)}return i===yd||t!==gd.digit&&t!==gd.fractionDigit&&t!==gd.exponentDigit?V.none:(s=i,V.number)},ne=()=>{let t=c.length-1,r=c[t];if(r===hd.emptyArray)c[t]=hd.nonemptyArray;else if(r===hd.nonemptyArray){let e=b();if(e===`]`)return V.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===hd.emptyObject||r===hd.nonemptyObject){if(c[t]=hd.danglingName,r===hd.nonemptyObject){let e=b();if(e===`}`)return V.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=b();if(e===`"`)return V.doubleQuotedName;if(e===`'`)return h(),V.singleQuotedName;if(e===`}`){if(r!==hd.nonemptyObject)return V.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return V.unquotedName;throw p(`Expected name`)}else if(r===hd.danglingName){c[t]=hd.nonemptyObject;let r=b();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===hd.emptyDocument){if(y()===void 0)return V.eof;n--,e.startsWith(`)]}'
|
|
85
|
-
`,n)&&(n+=5),c[t]=hd.nonemptyDocument}else if(r===hd.nonemptyDocument){if(y()===void 0)return V.eof;h(),n--}let i=y();if(i===void 0){if(r===hd.emptyDocument)return V.eof;throw m()}if(i===`]`&&r===hd.emptyArray)return V.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==hd.emptyArray&&r!==hd.nonemptyArray)throw p(`Unexpected value`);return h(),n--,V.null}if(i===`'`)return h(),V.singleQuoted;if(i===`"`)return V.doubleQuoted;if(i===`[`)return V.beginArray;if(i===`{`)return V.beginObject;n--;let a=te();if(a!==V.none)return a;let o=x();if(o!==V.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),V.unquoted},re=()=>(o===V.none&&(o=ne()),o),ie=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=vd.get(t);if(a!==void 0)return a;if(t===`
|
|
86
|
-
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},ae=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+ie(),o=n):s===`
|
|
87
|
-
`&&(r++,i=n)}throw p(`Unterminated string`)},oe=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},se=e=>{if(c.length-1>=255)throw new v(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=V.none},ce=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=V.none},le=()=>{let e=re();return e!==V.endObject&&e!==V.endArray&&e!==V.eof},ue=()=>{let e=re(),t=e===V.unquotedName?oe():ae(e===V.singleQuotedName?`'`:`"`);return o=V.none,l[c.length-1]=t,t},de=t=>t===V.true||t===V.false?t===V.true:t===V.null?null:t===V.number?(n+=s,{literal:e.slice(n-s,n)}):t===V.unquoted?oe():ae(t===V.singleQuoted?`'`:`"`),fe=()=>{let e=re();if(e===V.beginArray){se(hd.emptyArray);let e=[];for(;le();)e.push(fe());return ce(),e}if(e===V.beginObject){se(hd.emptyObject);let e=/* @__PURE__ */ new Map;for(;le();)e.set(ue(),fe());return ce(),e}let t=de(e);return o=V.none,u[c.length-1]++,t};if(re()===V.eof)return null;let S=fe();return a=!1,S!==null&&re(),S},xd=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),Sd=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Cd=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),wd=e=>{if(!ln(e))return;let t=I(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?pi(n):void 0},Td=(e,t)=>{let n=`tlc2.value.impl.${hs(e)}`,r=`tlc2.value.impl.${t}`;return new v(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Ed=e=>new v(`Cannot convert value: unsupported value type tlc2.value.impl.${hs(e)}`),Dd=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Od=e=>`[${e.map(Md).join(`,`)}]`,kd=e=>`{${vn(e).map(e=>`${Dd(typeof e[0]==`string`?e[0]:L(e[0]))}:${Md(e[1])}`).join(`,`)}}`,Ad=e=>{let t=I(e),n=Hi(t);return n?Od(n):kd(t)},jd=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Md=e=>typeof e==`string`?Dd(e):typeof e==`object`?e.kind===`ModelValue`?Dd(e.name):hs(e)===`RecordValue`?kd(I(e)):Nd(e):String(e),Nd=e=>{let t=hs(e);if(t===`TupleValue`)return Od(I(e).range);if(jd(t))return Ad(e);if(hi(e))return Od(P(e).elements);throw Ed(e)},Pd=e=>{let t=hs(e);if(t===`RecordValue`)return kd(I(e));if(t===`TupleValue`)return`{${I(e).range.map((e,t)=>`"${t}":${Md(e)}`).join(`,`)}}`;if(jd(t))return Ad(e);throw Ed(e)},Fd=e=>{if(e===null)throw new v(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return Rn(e);if(Array.isArray(e))return fi(e.map(Fd));if(e instanceof Map)return pi([...e].map(e=>[Rn(e[0]),Fd(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||ls(t))throw new v(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},Id=e=>{if(typeof e!=`string`)throw new v(`Cannot cast tlc2.value.impl.${hs(e)} to tlc2.value.impl.StringValue`);return e},Ld=(e,t)=>{let n=ua(e,t);if(typeof n!=`string`)throw Td(n,`StringValue`);return n},Rd=e=>{if(!Sd.has(e.toLowerCase()))throw Cd.has(e.toLowerCase())?new t(`IOUtils!Serialize does not support the charset ${e}`):new v(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},zd=(e,n,r,i)=>{let a=r.find(e=>!xd.has(e));if(a!==void 0)throw new v(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${a}`);if(r.includes(`READ`))throw new v(`java.lang.IllegalArgumentException: READ not allowed`);let o=new Set(r.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:r);if(o.has(`APPEND`)&&o.has(`TRUNCATE_EXISTING`))throw new v(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(o.has(`DELETE_ON_CLOSE`))throw new t(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let s=e.readFile?.(n);if(s===void 0&&!o.has(`CREATE`)&&!o.has(`CREATE_NEW`))throw new v(`java.nio.file.NoSuchFileException: ${n}`);if(s!==void 0&&o.has(`CREATE_NEW`))throw new v(`java.nio.file.FileAlreadyExistsException: ${n}`);s===void 0||o.has(`TRUNCATE_EXISTING`)?e.writeFile?.(n,i):e.writeFile?.(n,o.has(`APPEND`)?s+i:i+s.slice(i.length))},Bd=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},Vd=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new v(`${t} (No such file or directory)`);return n},Hd=e=>[ys(ss(`ToJson`,1,e=>Rn(Md(R(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),ys(ss(`ToJsonArray`,1,e=>Rn(Nd(R(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),ys(ss(`ToJsonObject`,1,e=>Rn(Pd(R(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),ys(ss(`JsonSerialize`,2,t=>{let n=Id(R(t,0,`JsonSerialize`)),r=R(t,1,`JsonSerialize`);if(!Hi(r)&&!wd(r))throw es(`second`,`JsonSerialize`,`sequence or record`,r);return Bd(e,n),e.writeFile?.(n,Md(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),ys(ss(`ndJsonSerialize`,2,t=>{let n=Id(R(t,0,`ndJsonSerialize`)),r=R(t,1,`ndJsonSerialize`),i=Hi(r);if(!i)throw es(`second`,`ndJsonSerialize`,`sequence`,r);return Bd(e,n),e.writeFile?.(n,i.map(e=>`${Md(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),ys(ss(`JsonDeserialize`,1,t=>Fd(bd(Vd(e,Id(R(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),ys(ss(`ndJsonDeserialize`,1,t=>fi(Vd(e,Id(R(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>Fd(bd(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],Ud=(e,t)=>[ys(Ts(`Serialize`,3,(n,r)=>{let i=Es(n,2,`Serialize`)(),a=wd(i);if(!a)throw es(`third`,`ndJsonSerialize`,`sequence`,i);if(Ld(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=Es(n,0,`Serialize`)(),s=Hi(o);if(!s)throw es(`first`,`Serialize`,`sequence`,o);let c=Es(n,1,`Serialize`)();if(typeof c!=`string`)throw es(`second`,`ndJsonSerialize`,`sequence`,c);let l=ua(a,`openOptions`);if(hs(l)!==`TupleValue`)throw Td(l,`TupleValue`);let u=Ld(a,`charset`),d=I(l).range.map(e=>{if(typeof e!=`string`)throw Td(e,`StringValue`);return e});return Rd(u),zd(e,c,d,s.map(e=>`${Md(e)}\n`).join(``)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],Wd={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},Gd=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=Qn(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(Wd.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(Wd.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(Wd.boolean),o(+!!e);return}if(typeof e==`number`){o(Wd.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(Wd.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(Wd.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),M(e)){let t=P(e).elements;o(Wd.set),c(t.length),t.forEach(f);return}let p=I(e),m=ir(e);m===`tuple`?(o(Wd.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(Wd.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(Wd.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ue(Uint8Array.from(t))},Kd=e=>[ys(ss(`_TLCTraceSerialize`,2,t=>{let n=Id(R(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,Gd(R(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],qd=25214903917n,Jd=(1n<<48n)-1n,Yd=2147483647,Xd=e=>{let t=(BigInt.asUintN(64,e)^qd)&Jd,n=e=>(t=t*qd+11n&Jd,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^qd)&Jd},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=Yd)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},Zd=[],Qd=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},$d=()=>{for(let e=1277011;Zd.length<1341;e++)Qd(e)&&Zd.push(e);return Zd},ef=e=>{let t=$d(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},tf=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},nf=e=>{for(let t=Math.max(e,9);;t++){let e=tf(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},rf=(e,t,n)=>{if(t<=0)return[];let r=nf(t),i=BigInt(n.nextInt(t)),a=BigInt(ef(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},af=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Yd),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},of=(1n<<63n)-1n-24n,sf=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(of*BigInt(n)+i)%t;return r<0n?r+t:r})},cf=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,lf=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=ui(e.domain),n=P(e.range).elements;return{lists:t.map(()=>n),create:e=>tr(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>P(e).elements),create:t=>pi(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>P(e).elements),create:fi}}},uf=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,df=(e,t,n,r)=>{if(F(t))return[];let i=r===`1.7.4`?af:rf;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=uf(t,r)?void 0:lf(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(Yd)?sf(e,t,n):i(e,Number(t),n)).map(e=>a.create(cf(a.lists,e)))}let o=P(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},ff=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...ts(e.domain,`RandomElement`,e).elements];return tr(n,n.map(()=>ff(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return pi(e.names.map((n,r)=>[n,ff(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return fi(e.factors.map(e=>ff(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new v(`Attempted to retrieve out-of-bounds element from the interval value ${L(e)}.`);return e.low+r}let n=ts(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new v(`Index ${r} out of bounds for length ${n.length}`);return n[r]},pf=(e,t,n)=>{if(typeof e!=`number`||e<0)throw es(t,n,`nonnegative integer`,e);return e},mf=(e,t,n,r)=>Yr(Array.from({length:t},()=>Yr(e.filter(()=>r.nextDouble()<n)))),hf=(e,t)=>{let n=`RandomSetOfSubsets`,r=pf(R(e,0,n),`first`,n),i=pf(R(e,1,n),`second`,n),a=R(e,2,n);if(!M(a)||!N(a))throw es(`third`,n,`finite set`,a);let o=P(a).elements;if(o.length<31&&r>2**o.length)throw es(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw es(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return mf(o,r,o.length===0?0:i/o.length,t.getRandom())},gf=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,_f=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,vf=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(gf.test(t))return Number(t.replace(/[fFdD]$/,``));let n=_f.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},yf=e=>z(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=pf(R(t,0,n),`first`,n),i=R(t,1,n);if(typeof i!=`string`)throw es(`second`,n,`string literal representing a probability`,i);let a=vf(i);if(a===void 0||a<0||a>1)throw es(`second`,n,`string literal does not represent a parsable probability`,i);let o=R(t,2,n);if(!M(o)||Vn(o)||!zi(o))throw es(`third`,n,`finite set`,o);let s=Li(o);if(32-Math.clz32(r)>s&&r>1<<s)throw es(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return mf(P(o).elements,r,a,e.getRandom())}),bf=e=>[ys(z(`RandomSubset`,2,t=>{let n=pf(R(t,0,`RandomSubset`),`first`,`RandomSubset`),r=R(t,1,`RandomSubset`);if(!hi(r)||!zi(r))throw es(`second`,`RandomSubset`,`a finite set`,r);let i=uf(r,e.version);if(i&&i.reduce((e,t)=>e*P(t).elements.length,1)>nn())throw new v(rn());return Yr(df(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),z(`RandomSetOfSubsets`,3,t=>hf(t,e)),z(`TestRandomSetOfSubsets`,3,t=>fi(Array.from({length:5},()=>P(hf(t,e)).elements.length)))],xf=(e,t=0n)=>{let n=Xd(t),r=Xd(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>pi([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,getSuccessorAction:()=>void 0,setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:mo,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},Sf=e=>ti([...e.possibleCounts].map(([e,t])=>[e,t])),Cf=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,Sf(e)]]),wf=e=>pi([[`name`,e??`UnnamedAction`],[`location`,pi([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),Tf=/* @__PURE__ */ new WeakSet,Ef=(e,t)=>{let n=pi([[`action`,Yr(e)],[`state`,Yr(t)]]);return Tf.add(n),n},Df=(e,t,n)=>{let r=e.map((e,t)=>fi([t+1,pi(Object.entries(e))])),i=r.slice(1).map((e,n)=>fi([r[n],t[n],e])),a=n?[fi([r[r.length-1],n.action,r[n.start]])]:[];return Ef([...i,...a],r)},Of=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return Cf(e).get(t)},kf=(e,t,n,r)=>{if(typeof n==`number`&&n>=0)e.registers.set(n,r);else if(n===`exit`)r===!0&&(e.isStopped=!0);else if(n===`pause`){if(r!==!0||!e.pause)return;t(`Press enter to resume model checking.`),e.pause()}else if(typeof n==`string`&&n.startsWith(`s:`))e.namedRegisters.set(n,r);else if(typeof n==`string`&&n.startsWith(`-D`))e.properties.set(n.slice(2),L(r));else throw new c(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${L(n)}`)},Af=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:H(e),jf=e=>e.every(e=>e!==void 0),Mf=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!A(e);if(i&&t.variableIndex.has(r))return 1;let a=ht(e).map(e=>Mf(e,t,n)),o=i?ig(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Mf(o.body,t,n))),Math.max(0,...a)},Nf=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new WeakMap,i=e=>{let t=r.get(e)??/* @__PURE__ */ new Map;return r.set(e,t),t};return[Ts(`AssertError`,2,e=>{let n=is(e,0,`AssertError`).expression;if(n&&n.kind!==`String`)throw new v(`In computing AssertError, a non-string expression (${Af(n)}) was used as the err of an AssertError(err, exp).`);let r=Es(e,0,`AssertError`)();try{Es(e,1,`AssertError`)()}catch(e){if(e instanceof v)return It(e.message,t.isTool)===r;throw e}return!1}),ss(`TLCGetOrDefault`,2,e=>Of(t,R(e,0,`TLCGetOrDefault`))??R(e,1,`TLCGetOrDefault`)),ss(`Trace`,0,(e,n)=>{let r=n?.environment.variables??[],i=n?.state??r.map(()=>void 0);if(!n||!jf(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new v(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return n.state?fi(t.getBehavior(i).map(e=>{let r=n.environment.variables.map((t,n)=>[t,e[n]]),i=t.getSimulationValue?.(`action`,e);return pi(i===void 0?r:[[`_action`,i],...r])})):fi([pi([])])}),ss(`CounterExample`,0,()=>t.counterExample??Ef([],[])),z(`ToTrace`,1,e=>{let t=R(e,0,`ToTrace`);if(typeof t!=`object`||!Tf.has(t))throw new c(`The argument of ToTrace should be a CounterExample, but instead it is:\n${L(t)}`);let n=P(ua(t,`state`)).elements.map(e=>Hi(e)??[]);return fi(n.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),z(`TLCModelValue`,1,e=>{let t=R(e,0,`TLCModelValue`);if(typeof t!=`string`)throw new c(`The argument of ModelValue should be a string, but instead it is:\n${L(t)}`);return Zn(t)}),Ts(`TLCDefer`,1,(e,n)=>{let r=is(e,0,`TLCDefer`).expression;return n&&r&&(t.deferred=e=>{W(r,{...n,next:e})}),!0}),z(`TLCNoOp`,1,e=>R(e,0,`TLCNoOp`)),{...Ts(`PickSuccessor`,1,(n,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(!jf(i)||r?.next&&t.isSeen(i))return!0;let a=is(n,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new v(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${gs(o)}) was used as the condition of an IF.\n${a.expression?Af(a.expression):``}`);if(o||!r?.next||!r.state||!jf(r.state))return!0;let s=t.getSuccessorAction(r.state,i);throw e(Tt(t.isTool,St.moduleOverrideStdout,Ct.none,`Extend behavior of length ${t.getLevel(r.state)} with a "${s?.name}" step [<Action ${s?.location.range&&h(s.location.range)}>]? (Yes/no/explored/states/diff):`)),new oe}),isActionLevel:!0},Ts(`TLCCache`,2,(e,r)=>{let a=is(e,0,`TLCCache`),o=ja(Es(e,1,`TLCCache`)()),s=a.expression;if(!s||!r)return a.call([]);let c=Mf(s,r.environment,/* @__PURE__ */ new Set);if(c===2)return a.call([]);let l=c===1;if(l&&r.state&&t.getSimulationValue===void 0)return a.call([]),a.call([]);let u=l&&r.state?i(r.state):n,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=a.call([]);return d.set(o,p),p}),z(`TLCFP`,1,e=>{let t=R(e,0,`TLCFP`),n=Sa(t);if(n)throw n;return Number(BigInt.asIntN(32,mo([t])))}),Ts(`TLCEvalDefinition`,1,(e,t)=>{let n=Es(e,0,`TLCEvalDefinition`)();if(typeof n!=`string`)throw new c(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${L(n)}`);let r=t?ig(n,t.environment):void 0,i=r?void 0:t?.environment.builtins.get(n);if(i?.arity===0)return i.evaluate([],t);if(!r||!t)throw new c(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${L(n)}`);if(r.kind===`Operator`&&r.params.length>0){let e=r.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new c(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${n}(${e.join(`, `)})`)}return r.kind===`Operator`?W(r.body,t):W({kind:`Identifier`,name:n,location:r.location},t)})]},Pf=(e,t)=>[ss(`_Track`,2,e=>{let n=String(R(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,R(e,0,`_Track`)===!0?r+1:r),!0}),ss(`_Counts`,0,()=>Sf(t)),ss(`_CheckName`,1,n=>{let r=String(R(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(L(Sf(t),!0)),!1)}),ss(`_PrintCounts`,0,()=>(e(L(Sf(t),!0)),!0))],Ff=e=>String(e).padStart(2,`0`),If=e=>`${e.getUTCFullYear()}.${Ff(e.getUTCMonth()+1)}.${Ff(e.getUTCDate())}.${Ff(e.getUTCHours())}${Ff(e.getUTCMinutes())}${Ff(e.getUTCSeconds())}`,Lf=e=>ti([...e].map(([e,t])=>[e,fi([t])])),Rf=e=>rr(ni(e),`record`),zf=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),Bf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),Vf=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),Hf=(e,t,n)=>{if(e.version===`1.7.4`?!Bf.has(t)||!e.isStarted&&Vf.has(t):!e.isStarted&&zf.has(t))throw new c(`TLCGet(${t}) was undefined.`);let r=e.getSimulationValue?.(t,n);if(r!==void 0)return r;let i=Math.floor((Date.now()-e.startedAt)/1e3);switch(t){case`level`:return n===void 0?0:e.getLevel(n);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return i;case`stats`:return Rf([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,i],[`worker`,0]]);case`config`:return Rf([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,Ya()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return Rf([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,Rn(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,Rn(If(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return wf(void 0);case`all`:return Lf(e.registers);case`all:named`:return Lf(Cf(e))}if(t.startsWith(`s:`)){let n=Cf(e).get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(t.startsWith(`-D`))return Rn(e.properties.get(t.slice(2))??t);throw new c(`TLCGet(${t}) was undefined.`)},Uf=(e,t,n)=>{if(typeof t==`number`&&t>=0){let n=e.registers.get(t);if(n===void 0)throw new c(`TLCGet(${t}) was undefined.`);return n}if(typeof t!=`string`)throw new c(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${L(t)}`);return Hf(e,t,n?.state)},Wf=e=>e.length===0?[[]]:e.flatMap((t,n)=>Wf([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),Gf=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&P(e).elements.forEach(Gf),e.kind===`Function`&&e.range.forEach(Gf))},Kf=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`ModelValue`:case`Function`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return I(e);default:return P(e)}},qf=(e,t)=>[z(`Print`,2,t=>(e(Ha([R(t,0,`Print`),R(t,1,`Print`)]).map(j).join(` `)),R(t,1,`Print`))),z(`PrintT`,1,t=>(e(j(Ha([R(t,0,`PrintT`)])[0])),!0)),z(`Assert`,2,e=>{if(R(e,0,`Assert`)!==!0)throw new c(`The first argument of Assert evaluated to FALSE; the second argument was:\n${j(L(R(e,1,`Assert`)))}`,ie.assertViolation);return!0}),z(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),z(`:>`,2,e=>ti([[R(e,0,`:>`),R(e,1,`:>`)]])),z(`@@`,2,e=>{let t=R(e,0,`@@`),n=R(e,1,`@@`),r=ln(t)?I(t):void 0,i=ln(n)?I(n):void 0;if(!r)throw es(`first`,`@@`,`function`,t);if(!i)throw es(`second`,`@@`,`function`,n);let a=_n(r),o=_n(i).filter(e=>!a.some(t=>Kr(e[0],t[0])));return ni([...a,...o])}),z(`ToString`,1,e=>Rn(L(R(e,0,`ToString`),!0))),{...Ts(`TLCEval`,1,(e,t)=>{let n=Kf(Es(e,0,`TLCEval`)());return t===void 0&&Gf(n),n}),isStateLevel:!1},z(`Permutations`,1,e=>{let t=ts(R(e,0,`Permutations`),`Permutations`).elements;return Yr(Wf(t).map(e=>ti(t.map((t,n)=>[t,e[n]]))))}),os(`SortSeq`,2,e=>{let t=R(e,0,`SortSeq`),n=Hi(t);if(!n)throw es(`first`,`SortSeq`,`natural number`,t);let r=is(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw es(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),fi(a)}),t.version===`1.7.4`?ys({...ss(`TLCGet`,1,(e,n)=>Uf(t,R(e,0,`TLCGet`),n)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):ys(Ts(`TLCGet`,1,(e,n)=>Uf(t,Es(e,0,`TLCGet`)(),n)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),ss(`TLCSet`,2,n=>(kf(t,e,R(n,0,`TLCSet`),R(n,1,`TLCSet`)),!0)),as(`Any`,Gn),z(`RandomElement`,1,e=>ff(R(e,0,`RandomElement`),t.getRandom()))],Jf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),Yf=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],Xf=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Zf=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),Qf=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),$f=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
19
|
+
`);s(e===-1?i:i.slice(0,e));continue}if(i.startsWith(`(*`)){let e=j(i);if(e===void 0)return s(i),o(``),t;s(i.slice(0,e));continue}let l=r,u=et(e,n),d=u>0?i.slice(0,u):/^\d+(?![A-Za-z_])/.exec(i)?.[0];if(d){t.push({kind:`Number`,text:d,line:l}),s(d);continue}let f=/^[A-Za-z0-9_]+/.exec(i)?.[0];if(f){t.push({kind:`Word`,text:f,line:l}),s(f);continue}if(i.startsWith(`"`)){let r=/^"((?:[^"\\\n]|\\[^\n])*)("?)/.exec(i),c=r?.[0]??`"`;if(r?.[2]!==`"`)return s(c),n===e.length?o(`${c}\n`):a(n,c),t;t.push({kind:`String`,text:c,line:l}),s(c);continue}let p=qe(e,n)??Ge(e,n),m=ot.find(e=>i.startsWith(e));if(m&&m.length>=(p?.length??0))t.push({kind:`Symbol`,text:m,line:l}),s(m);else{if(!p)return a(n,``),t;t.push({kind:`Word`,text:p.text,line:l}),s(e.slice(n,n+p.length))}}return t.push({kind:`End`,text:``,line:r}),t},ct=(e,t)=>new C(`TLC found an error in the configuration file at line ${e}\n${t}`),lt=(e,t)=>ct(e,`The keyword ${t} appeared twice.`),ut=/* @__PURE__ */ new Map([[`INIT`,`init`],[`NEXT`,`next`],[`SPECIFICATION`,`specification`],[`VIEW`,`view`],[`SYMMETRY`,`symmetry`],[`ALIAS`,`alias`],[`_PERIODIC`,`periodic`],[`_RL_REWARD`,`rlReward`]]),dt=/* @__PURE__ */ new Map([[`INVARIANT`,`invariants`],[`INVARIANTS`,`invariants`],[`PROPERTY`,`properties`],[`PROPERTIES`,`properties`],[`CONSTRAINT`,`constraints`],[`CONSTRAINTS`,`constraints`],[`ACTION_CONSTRAINT`,`actionConstraints`],[`ACTION_CONSTRAINTS`,`actionConstraints`],[`POSTCONDITION`,`postconditions`],[`POSTCONDITIONS`,`postconditions`],[`_POSSIBLE`,`possible`]]),ft=(t,n=`master`)=>{let r=n===`1.7.4`?at:rt,i=st(t),a=0,o={init:void 0,next:void 0,specification:void 0,invariants:[],properties:[],constraints:[],actionConstraints:[],constants:[],substitutions:[],rawConstants:[],checkDeadlock:!0,symmetry:void 0,view:void 0,alias:void 0,postconditions:[],possible:[],periodic:void 0,rlReward:void 0},s=!1,c=/* @__PURE__ */ new Set,l=()=>{let e=i[Math.min(a++,i.length-1)];if(e.kind===`Error`)throw new C(`TLC found an error in the configuration file:\n${e.text}`);return e},u=t=>{if(t.kind===`Number`&&t.text.startsWith(`\\`))throw v(new C(`${e(`java.lang.NumberFormatException`)}For input string: "${t.text}"`),b.error);if(t.kind===`Number`)return{kind:`Number`,value:Number(t.text)};if(t.kind===`String`&&t.text.includes(`\\`))throw new C(`TLC found an error in the configuration file:\nescape sequences are not supported in strings at line ${t.line}`);if(t.kind===`String`)return{kind:`String`,value:t.text.slice(1,-1)};if(t.text===`TRUE`||t.text===`FALSE`)return{kind:`Boolean`,value:t.text===`TRUE`};if(t.text===`{`){let e=[],t=l();if(t.text!==`}`)for(;e.push(u(t)),t=l(),t.text===`,`;)t=l();if(t.text!==`}`)throw ct(t.line,`It was expecting }, but did not find it.`);return{kind:`Set`,elements:e}}if(t.kind!==`End`)return{kind:`ModelValue`,name:t.text};throw ct(t.line,`It was expecting a value, but did not find it.`)},d=e=>{let t=l();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after ${e}[.`);let n=l();if(n.text!==`]`)throw ct(n.line,`It was expecting ], but did not find it.`);return t.text},f=(e,t)=>{let n=e.text,r=l();for(;r.text===`!`;)n=`${n}!${l().text}`,r=l();if(r.text===`<-`){if(r=l(),r.text===`[`){let e=d(`<-`),t=l();if(t.kind===`End`)throw ct(t.line,`Expected an identifier after <-[mod].`);o.substitutions.push({name:n,target:t.text,module:e});return}if(r.kind===`End`)throw ct(r.line,`Expected an identifier after <-.`);o.substitutions.push({name:n,target:r.text});return}let i=[],a=r.text===`(`;if(a){for(;i.push(u(l())),r=l(),r.text===`,`;);if(r.text!==`)`)throw ct(t,``);r=l()}if(r.text!==`=`)throw ct(r.line,`It was expecting = or <-, but did not find it.`);r=l();let s=r.text===`[`?d(`=`):void 0,c=u(s===void 0?r:l());o.constants.push({name:n,value:c,...a&&{args:i},...s!==void 0&&{module:s}})},p=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;let n=a-1;f(t,e),o.rawConstants.push(i.slice(n,a).map(e=>e.text).join(` `))}},m=e=>{for(;;){let t=l();if(t.kind===`End`||r.has(t.text))return t;e.push(t.text)}},h=l();for(;h.kind!==`End`;){let e=h.text,t=h.line,n=r.has(e)?ut.get(e):void 0,i=r.has(e)?dt.get(e):void 0,a=()=>{let n=l();if(n.kind===`End`)throw ct(t,`The keyword ${e} was not followed by an identifier.`);return n};if(n!==void 0){let r=a();if(o[n]!==void 0)throw lt(t,e);o[n]=r.text,h=l()}else if(i!==void 0)h=m(o[i]);else if(e===`CONSTANT`||e===`CONSTANTS`)h=p(t);else if(e===`CHECK_DEADLOCK`){let n=a();if(n.text!==`TRUE`&&n.text!==`FALSE`)throw ct(n.line,`It was expecting TRUE or FALSE, but did not find it.`);if(s)throw lt(t,e);s=!0,o.checkDeadlock=n.text===`TRUE`,h=l()}else{if(!r.has(e)||!it.includes(e))throw ct(t,`It was expecting a keyword, but did not find it.`);if(a(),c.has(e))throw lt(t,e);c.add(e),h=l()}}return o},pt=/* @__PURE__ */ new WeakMap,mt=(e,t)=>{let n=pt.get(e);if(n)return n;let r={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:t};return pt.set(e,r),r},ht=e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body],gt=e=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return[];case`Apply`:return e.args;case`Lambda`:return[e.body];case`And`:case`Or`:return e.operands;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return[e.expression];case`If`:return[e.condition,e.consequent,e.alternative];case`Case`:return[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]];case`Let`:return[...e.definitions.flatMap(ht),e.body];case`Forall`:case`Exists`:return[...e.bounds.map(e=>e.set),e.body];case`UnboundedQuantifier`:return[e.body];case`Choose`:return[...e.set?[e.set]:[],e.body];case`SetEnumeration`:case`Tuple`:return e.elements;case`SetFilter`:return[e.bound.set,e.predicate];case`SetMap`:return[e.expression,...e.bounds.map(e=>e.set)];case`FunctionConstruction`:return[...e.bounds.map(e=>e.set),e.body];case`FunctionSet`:return[e.domain,e.range];case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`Except`:return[e.function,...e.updates.flatMap(e=>[...e.path.flatMap(e=>e.kind===`Index`?e.args:[]),e.value])];case`FunctionApplication`:return[e.function,...e.args];case`Bracket`:return e.args;case`FieldAccess`:return[e.record];case`Product`:return e.factors;case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`Label`:return[e.body];case`Subexpression`:return e.selectors.flatMap(e=>`args`in e?e.args:[]);case`Selection`:return[e.expression]}},_t=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Apply`||e.kind===`OperatorReference`)return e.operator},M=e=>(e.kind===`Identifier`||e.kind===`Apply`)&&e.resolution?.kind===`Local`,vt=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices`.split(`,`),yt=[[`\\lnot`,`~`,`\\neg`,`¬`],[`[]`,`□`],[`<>`,`◇`],[`\\land`,`/\\`,`∧`],[`\\lor`,`\\/`,`∨`],[`\\equiv`,`<=>`,`≡`,`⇔`],[`/=`,`#`,`≠`],[`\\leq`,`<=`,`=<`,`≤`],[`\\geq`,`>=`,`≥`],[`\\times`,`\\X`,`×`],[`\\intersect`,`\\cap`,`∩`],[`\\union`,`\\cup`,`∪`],[`\\o`,`\\circ`,`∘`],[`\\oplus`,`(+)`,`⊕`],[`\\ominus`,`(-)`,`⊖`],[`\\odot`,`(.)`,`⊙`],[`\\oslash`,`(/)`,`⊘`],[`\\otimes`,`(\\X)`,`⊗`],[`\\approx`,`≈`],[`:=`,`≔`],[`\\asymp`,`≍`],[`\\bigcirc`,`◯`],[`::=`,`⩴`],[`\\bullet`,`●`],[`\\cdot`,`⋅`],[`\\cong`,`≅`],[`\\div`,`÷`],[`\\doteq`,`≐`],[`..`,`‥`],[`...`,`…`],[`!!`,`‼`],[`\\gg`,`≫`],[`=>`,`⇒`],[`\\in`,`∈`],[`=|`,`⫤`],[`~>`,`↝`],[`\\ll`,`≪`],[`-|`,`⊣`],[`\\notin`,`∉`],[`-+->`,`⇸`],[`\\prec`,`≺`],[`\\preceq`,`⪯`],[`\\propto`,`∝`],[`??`,`⁇`],[`|=`,`⊨`],[`|-`,`⊢`],[`\\sim`,`∼`],[`\\simeq`,`≃`],[`\\sqcap`,`⊓`],[`\\sqcup`,`⊔`],[`\\sqsubset`,`⊏`],[`\\sqsubseteq`,`⊑`],[`\\sqsupset`,`⊐`],[`\\sqsupseteq`,`⊒`],[`\\star`,`⋆`],[`\\subset`,`⊂`],[`\\subseteq`,`⊆`],[`\\succ`,`≻`],[`\\succeq`,`⪰`],[`\\supset`,`⊃`],[`\\supseteq`,`⊇`],[`\\uplus`,`⊎`],[`||`,`‖`],[`\\wr`,`≀`],[`^+`,`⁺`]],bt=new Map(yt.flatMap(e=>e.slice(1).map(t=>[t,e[0]]))),xt=e=>e.split(`!`).map(e=>bt.get(e)??(e===`~`?`\\lnot`:e)).join(`!`),St=/* @__PURE__ */ `STRING,FALSE,TRUE,BOOLEAN,=,/=,.,',\\lnot,\\neg,\\land,\\lor,\\equiv,=>,SUBSET,UNION,DOMAIN,\\subseteq,\\in,\\notin,\\,\\intersect,\\union,\\times,~>,[],<>,ENABLED,UNCHANGED,\\cdot,-+->,$AngleAct,$BoundedChoose,$BoundedExists,$BoundedForall,$CartesianProd,$Case,$ConjList,$DisjList,$Except,$FcnApply,$FcnConstructor,$IfThenElse,$NonRecursiveFcnSpec,$Pair,$RcdConstructor,$RcdSelect,$RecursiveFcnSpec,$Seq,$SetEnumerate,$SetOfAll,$SetOfFcns,$SetOfRcds,$SF,$SquareAct,$SubsetOf,$TemporalExists,$TemporalForall,$TemporalWhile,$Tuple,$UnboundedChoose,$UnboundedExists,$UnboundedForall,$WF,$Nop,$Qed,$Pfcase,$Have,$Take,$Pick,$Witness,$Suffices,***I do not exist***,--TLA+ BUILTINS--,Formal_0,Formal_1,Formal_2,[,^,/,*,-,-.,+,^+,^*,^#,<,\\leq,>,\\geq,...,..,|,||,&&,&,$$,$,??,%%,%,##,++,--,**,//,^^,@@,!!,|-,|=,-|,=|,<:,:>,:=,::=,\\oplus,\\ominus,\\odot,\\oslash,\\otimes,\\uplus,\\sqcap,\\sqcup,\\div,\\wr,\\star,\\o,\\bigcirc,\\bullet,\\prec,\\succ,\\preceq,\\succeq,\\sim,\\simeq,\\ll,\\gg,\\asymp,\\subset,\\supset,\\supseteq,\\approx,\\cong,\\sqsubset,\\sqsubseteq,\\sqsupset,\\sqsupseteq,\\doteq,\\propto,~,¬,□,◇,/\\,∧,\\/,∨,<=>,≡,⇔,#,≠,<=,=<,≤,>=,≥,\\X,×,\\cap,∩,\\cup,∪,\\circ,∘,(+),⊕,(-),⊖,(.),⊙,(/),⊘,(\\X),⊗,≈,≔,≍,◯,⩴,●,⋅,≅,÷,≐,‥,…,‼,≫,⇒,∈,⫤,↝,≪,⊣,∉,⇸,≺,⪯,∝,⁇,⊨,⊢,∼,≃,⊓,⊔,⊏,⊑,⊐,⊒,⋆,⊂,⊆,≻,⪰,⊃,⊇,⊎,‖,≀,⁺,@`.split(`,`),Ct=/* @__PURE__ */ `exit.pause.config.spec.coverage.action.install.id.behavior.all.mode.deadlock.seed.fingerprint.worker.traces.depth.aril.sched.revision.timestamp.date.count.tag.calver.impliedinits.impliedactions.invariants.impliedtemporals.temporals.actions.inits.variables.actionconstraints.constraints.stats.duration.generated.diameter.distinct.initial.queue.retries.distinctvalues.levelmean.levelvariance.bfs.beginLine.beginColumn.endLine.endColumn.module.name.location.context.parameters._action`.split(`.`),wt=/* @__PURE__ */ `Not a node.N_ActDecl.N_ActionExpr.N_AssumeDecl.N_AssumeProve.N_Assumption.N_BeginModule.N_Body.N_BoundedQuant.N_Case.N_CaseArm.N_CaseStatement.N_ChooseStatement.N_ConjItem.N_ConjList.N_ConsDecl.N_DisjItem.N_DisjList.N_EndModule.N_Except.N_ExceptComponent.N_ExceptSpec.N_Times.N_Extends.N_FairnessExpr.N_FcnAppl.N_FcnConst.N_FieldSet.N_FieldVal.N_FunctionDefinition.N_FunctionParam.N_GeneralId.N_GenInfixOp.N_GenNonExpPrefixOp.N_GenPostfixOp.N_GenPrefixOp.N_IdentDecl.N_Real.N_IdentifierTuple.N_IdentLHS.N_IdPrefix.N_IdPrefixElement.N_IfThenElse.N_InfixDecl.N_InfixExpr.N_InfixLHS.N_InfixOp.N_InnerProof.N_Instance.N_NonLocalInstance.N_Integer.N_LeafProof.N_LetDefinitions.N_LetIn.N_MaybeBound.N_Module.N_ModuleDefinition.N_NonExpPrefixOp.N_Number.N_NumberedAssumeProve.N_OpApplication.N_OpArgs.N_OperatorDefinition.N_OtherArm.N_ParamDecl.N_ParamDeclaration.N_ParenExpr.N_PostfixDecl.N_PostfixExpr.N_PostfixLHS.N_PostfixOp.N_PrefixDecl.N_PrefixExpr.N_PrefixLHS.N_PrefixOp.N_Proof.N_ProofLet.N_ProofName.N_ProofStatement.N_ProofStep.N_QEDStep.N_QuantBound.N_RcdConstructor.N_RecordComponent.N_SetEnumerate.N_SetOfAll.N_SetOfFcns.N_SetOfRcds.N_String.N_SubsetOf.N_Substitution.N_TempDecl.N_Theorem.N_Tuple.N_UnBoundedOrBoundedChoose.N_UnboundedQuant.N_VariableDeclaration.Token =.Token \\in.N_NewSymb.N_Lambda.N_Recursive.N_Label.N_StructOp.N_NumerableStep.N_TerminalProof.N_UseOrHide.N_NonExprBody.N_DefStep.N_HaveStep.N_TakeStep.N_WitnessStep.N_PickStep.N_CaseStep.N_AssertStep`.split(`.`),Tt=/* @__PURE__ */ new Map([[`Naturals`,`-------------------------------- MODULE Naturals ----------------------------
|
|
88
20
|
Nat == { }
|
|
89
21
|
a+b == {a, b}
|
|
90
22
|
a-b == CHOOSE n : b + n = a
|
|
@@ -400,7 +332,85 @@ _CheckName(name) ==
|
|
|
400
332
|
=> (PrintT(counts) /\\ FALSE)
|
|
401
333
|
_PrintCounts == PrintT(_Counts)
|
|
402
334
|
=============================================================================
|
|
403
|
-
`]]),ep=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),tp=`----------------------------- MODULE Bags --------------------------------
|
|
335
|
+
`]]),Et=/* @__PURE__ */ new Map([[`Bags`,/* @__PURE__ */ new Map([[`IsABag`,`public static tlc2.value.IBoolValue tlc2.module.Bags.IsABag(tlc2.value.impl.Value)`],[`BagCardinality`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.BagCardinality(tlc2.value.impl.Value)`],[`BagIn`,`public static tlc2.value.IBoolValue tlc2.module.Bags.BagIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`CopiesIn`,`public static tlc2.value.impl.IntValue tlc2.module.Bags.CopiesIn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\oplus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagCup(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\ominus`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagDiff(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagUnion`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagUnion(tlc2.value.impl.Value)`],[`\\sqsubseteq`,`public static tlc2.value.IBoolValue tlc2.module.Bags.SqSubseteq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagOfAll`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagOfAll(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`BagToSet`,`public static tlc2.value.impl.Value tlc2.module.Bags.BagToSet(tlc2.value.impl.Value)`],[`SetToBag`,`public static tlc2.value.impl.Value tlc2.module.Bags.SetToBag(tlc2.value.impl.Value)`]])],[`FiniteSets`,/* @__PURE__ */ new Map([[`IsFiniteSet`,`public static tlc2.value.IBoolValue tlc2.module.FiniteSets.IsFiniteSet(tlc2.value.impl.Value)`],[`Cardinality`,`public static tlc2.value.impl.IntValue tlc2.module.FiniteSets.Cardinality(tlc2.value.impl.Value)`]])],[`Sequences`,/* @__PURE__ */ new Map([[`Seq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Seq(tlc2.value.impl.Value)`],[`Len`,`public static tlc2.value.impl.IntValue tlc2.module.Sequences.Len(tlc2.value.impl.Value)`],[`Head`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Head(tlc2.value.impl.Value)`],[`Tail`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Tail(tlc2.value.impl.Value)`],[`Append`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Append(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`\\o`,`public static tlc2.value.impl.Value tlc2.module.Sequences.Concat(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SubSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SubSeq(tlc2.value.impl.Value,tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SelectSeq`,`public static tlc2.value.impl.Value tlc2.module.Sequences.SelectSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])],[`TLC`,/* @__PURE__ */ new Map([[`Print`,`public static tlc2.value.impl.Value tlc2.module.TLC.Print(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`PrintT`,`public static tlc2.value.impl.Value tlc2.module.TLC.PrintT(tlc2.value.impl.Value)`],[`ToString`,`public static tlc2.value.impl.Value tlc2.module.TLC.ToString(tlc2.value.impl.Value)`],[`Assert`,`public static tlc2.value.impl.Value tlc2.module.TLC.Assert(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`:>`,`public static tlc2.value.impl.Value tlc2.module.TLC.MakeFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`@@`,`public static tlc2.value.impl.Value tlc2.module.TLC.CombineFcn(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`SortSeq`,`public static tlc2.value.impl.Value tlc2.module.TLC.SortSeq(tlc2.value.impl.Value,tlc2.value.impl.Value)`],[`Permutations`,`public static tlc2.value.impl.Value tlc2.module.TLC.Permutations(tlc2.value.impl.Value)`],[`RandomElement`,`public static tlc2.value.impl.Value tlc2.module.TLC.RandomElement(tlc2.value.impl.Value)`],[`TLCEval`,`public static tlc2.value.impl.Value tlc2.module.TLCEval.tlcEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`]])],[`TLCExt`,/* @__PURE__ */ new Map([[`AssertError`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.assertError(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`PickSuccessor`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.pickSuccessor(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`ToTrace`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.lassoOrdinal(tlc2.value.impl.Value)`],[`CounterExample`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.error(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`Trace`,`public static tlc2.value.impl.TupleValue tlc2.module.TLCExt.getTrace(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel) throws java.io.IOException`],[`TLCDefer`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefer(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCNoOp`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcNoOp(tlc2.value.impl.Value)`],[`TLCModelValue`,`public static synchronized tlc2.value.impl.Value tlc2.module.TLCExt.tlcModelValue(tlc2.value.impl.Value)`],[`TLCCache`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcEval2(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCFP`,`public static synchronized tlc2.value.impl.IntValue tlc2.module.TLCExt.tlcFingerprint(tlc2.value.impl.Value)`],[`TLCEvalDefinition`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcDefByName(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`],[`TLCGetOrDefault`,`public static tlc2.value.impl.Value tlc2.module.TLCExt.tlcGetOrDefault(tlc2.value.impl.Value,tlc2.value.impl.Value)`]])]]),Dt=E(`EOF`),Ot=E(`IDENTIFIER`),kt=E(`DEFBREAK`),At=(e,t)=>Array.from({length:E(t)-E(e)+1},(t,n)=>E(e)+n),jt=new Set(At(`op_57`,`op_119`)),Mt=new Set(At(`op_1`,`op_119`)),Nt=new Set(At(`op_57`,`op_70`)),Pt=/* @__PURE__ */ new Set([...At(`ACTION`,`EXCEPT`),E(`EXTENDS`),...At(`IF`,`SF`),E(`STATE`),...At(`THEN`,`WITH`),E(`US`),...At(`op_112`,`op_116`)]),Ft=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),It=new Map([...Ft(`postfix`,160,160,!0,`[`),...Ft(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...Ft(`prefix`,120,120,!1,`-.`),...Ft(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...Ft(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...Ft(`prefix`,40,40,!0,`\\lnot`),...Ft(`nfix`,100,130,!0,`\\times`),...Ft(`infix`,140,140,!1,`^`,`^^`),...Ft(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...Ft(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...Ft(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...Ft(`infix`,100,110,!0,`|`,`||`,`%%`),...Ft(`infix`,100,110,!1,`%`),...Ft(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...Ft(`infix`,90,140,!1,`\\wr`),...Ft(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...Ft(`infix`,90,130,!1,`!!`),...Ft(`infix`,90,90,!1,`...`,`..`),...Ft(`infix`,80,80,!0,`\\intersect`,`\\union`),...Ft(`infix`,80,80,!1,`\\`),...Ft(`infix`,70,70,!1,`<:`,`:>`),...Ft(`infix`,60,60,!0,`@@`),...Ft(`infix`,50,140,!0,`\\cdot`),...Ft(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...Ft(`infix`,30,30,!0,`\\land`,`\\lor`),...Ft(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...Ft(`infix`,10,10,!1,`=>`)]),Lt=new Map([...It,...yt.flatMap(e=>e.slice(1).map(t=>[t,It.get(e[0])]))]),Rt=Lt.get(`[`),zt={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},Bt=e=>({type:`tokens`,kinds:new Set(e)}),Vt=e=>typeof e==`string`?e.startsWith(`<`)?Bt([E(e.slice(1,-1))]):{type:`call`,name:e}:e,N=(...e)=>({type:`sequence`,units:e.map(Vt)}),P=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:N(e))}),Ht=e=>(...t)=>({type:e,body:N(...t)}),F=Ht(`zeroOrMore`),Ut=Ht(`oneOrMore`),I=Ht(`optional`),L=e=>({type:`action`,run:t=>e(t)??void 0}),R=e=>L(t=>{t.expecting=e}),z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&N(...e.expansion),semantic:e.semantic}),Wt=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),Gt=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=Wt(e,n);return n},Kt=(...e)=>{let t=e.map(E);return e=>t.includes(Gt(e,1).kind)},qt=(e,t=Gt(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Jt=e=>{let t=Gt(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Yt=e=>Kt(`CASESEP`)(e)&&qt(e),Xt=e=>{let t=Gt(e,1);Pt.has(t.kind)&&(t.kind=Ot)},Zt=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Qt=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),$t=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},en=e=>e.operatorStacks[e.operatorStacks.length-1],tn=(e,t)=>e.low>t.high,nn=(e,t)=>e.high<t.low,rn=e=>e.fix===`prefix`?e:Lt.get(`${e.name}.`),an=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===Rt?Qt(`FcnAppl`,[n,...r.node.heirs]):Qt(`PostfixExpr`,[n,r.node]),operator:void 0})},on=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Qt(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Qt(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},sn=e=>{let t=en(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return an(t,n),sn(e);if(i.operator!==void 0){let t=rn(r.operator);return t!==void 0&&tn(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Zt(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Zt(e,a.node.first,a.node.last)} and expression at location ${Zt(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return nn(a.operator,r.operator)?void 0:tn(a.operator,r.operator)?(on(t,a.operator),sn(e)):`Precedence conflict between ops ${a.operator.name} in block ${Zt(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=rn(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(nn(s,r.operator))return;if(!tn(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Zt(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return on(t,s),sn(e);let c=Zt(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===zt?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},cn=e=>L(t=>{let n=en(t),r=$t(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:sn(t)}),ln=cn(()=>!1),un=cn(()=>!0),dn=L(e=>{e.lastOperator=Lt.get(e.token.image)}),fn=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},pn=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?fn(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},mn=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!qt(e,n.first.beginColumn))return n;let t=mn(e,n);if(t!==void 0)return t}},hn=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(E),n=(e,...t)=>t.some(t=>e.kind===E(t)),r=e=>e!==void 0&&jt.has(e.kind),i=e.token,a=Wt(e,i);i.next=void 0;let o=Wt(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===Ot&&(e=e.next)}else if(e.kind===Ot){let t=e.next;!r(t)||Nt.has(t.kind)||Mt.has(t.kind)&&t.next?.kind!==Ot||(e=t.next?.kind===E(`SUBSTITUTE`)?i:Mt.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==kt&&(e.next={kind:kt,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=Wt(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},gn=e=>{let t=Gt(e,1);if(t.kind===E(`LAB`)){let n=1;for(;n!==0;)if(t=Wt(e,t),t.kind===E(`LAB`)&&n++,t.kind===E(`RAB`)&&n--,t.kind===Dt)return!1;return Wt(e,t).kind===E(`IN`)}if(t.kind!==Ot)return!1;for(t=Wt(e,t);t.kind===E(`COMMA`);){if(t=Wt(e,t),t.kind!==Ot)return!1;t=Wt(e,t)}return t.kind===E(`IN`)},_n=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),vn=e=>e.proofLevels.at(-1)??-1,yn=e=>{let t=Gt(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:Kt(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||vn(e)>=0&&_n(t)>vn(e):Kt(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},bn=(e,t)=>{let n=_n(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},xn=e=>L(t=>bn(t,t.token)?void 0:`${Zt(t,t.token)}: ${e}`),Sn=Bt([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(E)),Cn=Bt([...Sn.kinds,E(`op_76`)]),wn=Bt(Mt),Tn=Bt(Nt),En=Bt([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(E)),Dn=()=>F(z({expansion:[P(Sn,`<op_77>`)],semantic:qt}),P(`PrefixOp`,`InfixOp`),un),On=()=>P(N(z({expansion:[`OpenStart`],semantic:qt}),`OpenExpression`,ln),N(z({semantic:qt}),`ExtendableExpr`)),kn=()=>P(N(`<MODULE>`,R(`identifier`),`Identifier`),`Expression`),An=()=>P(N(z({semantic:e=>Kt(`ASSUME`,`BOXASSUME`)(e)||Gt(e,2).kind===E(`COLONCOLON`)&&[E(`ASSUME`),E(`BOXASSUME`)].includes(Gt(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),jn=()=>[`JuncItem`,F(z({semantic:Jt}),`JuncItem`)],Mn=e=>L(t=>{t.expecting=e,Xt(t)}),Nn=e=>L(t=>{t.isTerminalProof=e}),Pn=(e,...t)=>N(...t.slice(0,-1),R(`==`),`<DEF>`,L(t=>{hn(t),t.expecting=e}),t[t.length-1]),B=(e,t,n)=>({message:e,body:N(...t),exit:n}),Fn={CompilationUnit:B(void 0,[L(hn),I(`Prelude`),`Module`]),Prelude:B(void 0,[`<BEGIN_PRAGMA>`,F(P(`<NUMBER>`,`<IDENTIFIER>`))]),Module:B(`Module definition`,[R(`---- MODULE`),`BeginModule`,R(`EXTENDS clause or module body`),`Extends`,R(`Module body`),`Body`,R(`==== or more Module body`),`EndModule`]),BeginModule:B(`Begin module`,[R(`---- MODULE (beginning of module)`),P(`<_BM0>`,`<_BM1>`,`<_BM2>`),Mn(`Identifier`),`Identifier`,L(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:B(void 0,[`<END_MODULE>`]),Extends:B(`Extends`,[I(`<EXTENDS>`,Mn(`Identifier`),`Identifier`,R(`comma or module body`),F(`<COMMA>`,Mn(`Identifier`),`Identifier`))]),Body:B(`Module body`,[R(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),F(P(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,N(z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,N(z({amount:2}),`Instance`),N(z({amount:2}),`Assumption`),N(z({amount:2}),`Theorem`),N(z({amount:1}),`Module`,L(hn)),N(z({semantic:e=>Kt(`USE`)(e)&&Gt(e,2).kind!==E(`ONLY`)||Kt(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:B(`variable declaration`,[`<VARIABLE>`,R(`Identifier`),`Identifier`,R(`comma or module body`),F(`<COMMA>`,R(`Identifier`),`Identifier`)]),ParamDeclaration:B(`Parameter declaration`,[R(`CONSTANT`),`ParamSubDecl`,R(`Identifier, operator or _`),`ConstantDeclarationItems`,R(`,`),F(`<COMMA>`,R(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:B(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:B(`Recursive`,[R(`RECURSIVE`),`<RECURSIVE>`,R(`Identifier, operator or _`),`ConstantDeclarationItems`,R(`,`),F(`<COMMA>`,R(`Identifier, operator or _`),`ConstantDeclarationItems`,R("`,' or `)'"))]),ConstantDeclarationItems:B(`Constant declaration items`,[R(`Identifier, _ or prefix op`),P(N(`Identifier`,R(`(, comma, or Module Body`),I(z({amount:2}),`<LBR>`,R(`_`),`<US>`,R(`comma or )`),F(`<COMMA>`,R(`_`),`<US>`,R(`comma or )`)),`<RBR>`)),N(`NonExpPrefixOp`,R(`_`),`<US>`),N(`<US>`,R(`prefix or postfix operator`),P(N(`InfixOp`,R(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:B(`Definition`,[R(`LOCAL, Identifier or Operator Symbol`),I(`<LOCAL>`),`<DEFBREAK>`,R(`LOCAL, Identifier or Operator Symbol`),P(Pn(`Expression`,z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,R(`[`),`<LSB>`,R(`Identifier`),`QuantBound`,R(`COMMA or ]`),F(`<COMMA>`,R(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),Pn(`Expression`,z({expansion:[`<IDENTIFIER>`,Tn]}),`PostfixLHS`,`Expression`),Pn(`Expression`,z({expansion:[`<IDENTIFIER>`,wn]}),`InfixLHS`,`Expression`),Pn(`Expression or Instance`,z({expansion:[`<IDENTIFIER>`,P(`<LBR>`,`<DEF>`)]}),`IdentLHS`,P(`Expression`,`Instantiation`)),Pn(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:B(`Identifier tuple`,[`<LAB>`,R(`Identifier or >>`),I(`Identifier`,R(`COMMA or >>`),F(`<COMMA>`,R(`COMMA or >>`),`Identifier`,R(`COMMA or >>`))),`<RAB>`]),IdentLHS:B(`Identifier LHS`,[`Identifier`,R(`( or ==`),I(`<LBR>`,R(`Identifier Declaration, prefix op, _ or )`),P(`IdentDecl`,`SomeFixDecl`),R(`COMMA or )`),F(`<COMMA>`,R(`Identifier Declaration, prefix op or _`),P(`IdentDecl`,`SomeFixDecl`),R(`COMMA or )`)),`<RBR>`)]),PrefixLHS:B(`Prefix LHS`,[Cn,R(`Identifier`),`Identifier`]),InfixLHS:B(`Infix LHS`,[`Identifier`,wn,`Identifier`]),PostfixLHS:B(`Postfix LHS`,[`Identifier`,Tn]),IdentDecl:B(`Identifier Declation`,[`Identifier`,R(`( or ...`),I(`<LBR>`,R(`_`),`<US>`,R(`COMMA or )`),F(`<COMMA>`,R(`_`),`<US>`,R(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:B(`Op. Symbol Declaration`,[P(N(`NonExpPrefixOp`,R(`_`),`<US>`),N(`<US>`,R(`infix or postfix operator`),P(N(`InfixOp`,R(`_`),`<US>`),`PostfixOp`)))]),Instance:B(`Instance`,[R(`LOCAL or instance`),I(`<LOCAL>`),`Instantiation`,R(`COMMA or Module Body`)]),Instantiation:B(`NonLocalInstance`,[`<INSTANCE>`,Mn(`Module identifier`),`Identifier`,R(`WITH or another definition.`),I(`<WITH>`,R(``),`Substitution`,R(``),F(z({amount:3}),`<COMMA>`,R(``),`Substitution`,R(``)))]),Substitution:B(`Substitution`,[P(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),R(`<-`),`<SUBSTITUTE>`,R(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:B(void 0,[Sn,dn]),NonExpPrefixOp:B(void 0,[Cn,dn]),InfixOp:B(`Infix Op`,[wn,dn]),PostfixOp:B(void 0,[Tn,dn]),Identifier:B(void 0,[`<IDENTIFIER>`]),Assumption:B(`Assumption`,[R(`ASSUM...`),P(`<ASSUMPTION>`,`<ASSUME>`),I(z({amount:2}),I(`<DEFBREAK>`),`Identifier`,R(`==`),`<DEF>`),L(e=>{hn(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:B(`Assume-Prove`,[P(N(`Identifier`,`<COLONCOLON>`,`AssumeProve`),N(P(`<ASSUME>`,`<BOXASSUME>`),R(`Expression, Declaration, or AssumeProve`),An(),R("PROVE or `,'"),F(`<COMMA>`,R(`Expression, Declaration, or AssumeProve`),An(),R("PROVE or `,'")),P(`<PROVE>`,`<BOXPROVE>`),R(`Expression`),`Expression`))]),NewSymb:B(`NEW symbol declaration`,[R(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),P(N(z({amount:2}),P(N(z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),R(`Constant declaration`),P(N(z({amount:2}),`IdentDecl`,I(`<IN>`,L(e=>{let t=$t(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Zt(e,t.first,t.last)}`:void 0}),R(`Expression`),`Expression`)),`SomeFixDecl`)),N(z({amount:2}),I(`<NEW>`),`<VARIABLE>`,R(`Identifier`),`Identifier`),N(z({amount:2}),I(`<NEW>`),P(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),R(`Declaration`),P(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:B(`Domain binding`,[I(`<IN>`,R(`Expression`),`Expression`)]),Theorem:B(`Theorem`,[R(`THEOREM, PROPOSITION`),P(`<THEOREM>`,`<PROPOSITION>`),R(`Identifier, Assume-Prove or Expression`),I(z({amount:2}),`Identifier`,R(`==`),`<DEF>`),L(hn),P(N(z({amount:3}),z({semantic:Kt(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),I(z({semantic:yn}),`Proof`)]),Proof:B(`Proof`,[L(e=>{e.proofLevels.push(-1)}),P(N(z({semantic:e=>Kt(`BY`)(e)||Gt(e,2).kind===E(`BY`)}),`UseOrHideOrBy`),N(z({amount:2}),I(`<PROOF>`),P(`<OBVIOUS>`,`<OMITTED>`)),N(I(z({amount:2}),`<PROOF>`),F(z({semantic:e=>Gt(e,2).kind!==E(`QED`)}),`Step`,R(`a proof step`)),`QEDStep`)),L(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:B(`UseOrHideOrBy`,[P(N(I(`<PROOF>`),`<BY>`,Nn(!0),I(`<ONLY>`)),N(`<USE>`,Nn(!1),I(`<ONLY>`)),N(`<HIDE>`,Nn(!1))),R("an expression, `MODULE' or `DEF'"),I(kn(),F(`<COMMA>`,R(`MODULE or expression`),kn(),L(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),I(`<DF>`,R(`MODULE or expression`),kn(),F(`<COMMA>`,R(`MODULE or expression`),kn(),L(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),L(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:B(`QED step`,[R(`Step number`),En,xn(`QED step's number has bad level.`),R(`QED`),`<QED>`,I(z({semantic:yn}),`Proof`)]),Step:B(`Step`,[R(`Step number`),En,xn(`step's number has bad level.`),R(`proof step`),P(N(z({semantic:Kt(`USE`,`HIDE`)}),`UseOrHideOrBy`),N(z({semantic:Kt(`INSTANCE`)}),`Instantiation`),N(z({semantic:Kt(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),I(z({semantic:yn}),L(e=>{let t=$t(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Zt(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:B(`DefStep`,[I(`<DEFINE>`),Ut(z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:B(`HaveStep`,[`<HAVE>`,R(`expression`),`Expression`]),TakeStep:B(`TakeStep`,[`<TAKE>`,R(`identifier`),P(N(z({expansion:[P(N(`<IDENTIFIER>`,F(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,R(`comma or step`),F(`<COMMA>`,R(`identifier or tuple of identifiers`),`QuantBound`,R(`comma or proof step`))),N(`Identifier`,R(`comma or proof step`),F(`<COMMA>`,R(`identifier`),`Identifier`,R(`comma or proof step`))))]),WitnessStep:B(`WitnessStep`,[`<WITNESS>`,R(`expression`),`Expression`,F(`<COMMA>`,R(`expression`),`Expression`,R(`comma or colon`))]),PickStep:B(`PickStep`,[`<PICK>`,R(`identifier`),P(N(z({expansion:[`<IDENTIFIER>`,F(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,R(`comma, or colon`),F(`<COMMA>`,R(`identifier`),`Identifier`,R(`comma or colon`))),N(`QuantBound`,R(`comma or colon`),F(`<COMMA>`,R(`identifier or tuple of identifiers`),`QuantBound`,R(`comma or colon`)))),`<COLON>`,R(`expression`),`Expression`]),CaseStep:B(`CaseStep`,[`<CASE>`,R(`expression`),`Expression`]),AssertStep:B(`AssertStep`,[I(`<SUFFICES>`,R(`expression or ASSUME/PROVE`)),P(`Expression`,N(z({semantic:Kt(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:B(void 0,[P(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:B(void 0,[P(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:B(`String`,[`<STRING_LITERAL>`]),Number:B(void 0,[`<NUMBER_LITERAL>`,I(z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:B(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,F(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:B(void 0,[P(N(z({amount:2,expansion:[P(Cn,wn,Tn),Bt([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(E))],semantic:qt}),P(`NonExpPrefixOp`,N(`InfixOp`,L(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Zt(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),N(z({expansion:[`<LAMBDA>`],semantic:qt}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:B(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:B(`Quantified form`,[P(`<EXISTS>`,`<FORALL>`),P(N(z({expansion:[`<IDENTIFIER>`,F(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,F(`<COMMA>`,`Identifier`)),N(`QuantBound`,F(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:B(`Bound Quantified Expression`,[P(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,F(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:B(`Quant Bound`,[P(`IdentifierTuple`,N(`Identifier`,F(`<COMMA>`,`Identifier`,R(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:B(`Some { } form`,[`<LBC>`,I(P(N(z({semantic:gn}),P(`IdentifierTuple`,`Identifier`),R(`\\in`),`<IN>`,`Expression`,R(`':', ',' or '}'`),I(P(N(`<COLON>`,`Expression`),Ut(`<COMMA>`,`Expression`)))),N(z({expansion:[P(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,F(`<COMMA>`,`Expression`)),N(z({expansion:[P(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,F(`<COMMA>`,`QuantBound`)),N(`Expression`,I(P(N(`<COLON>`,L(e=>{let t=$t(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,F(`<COMMA>`,`QuantBound`)),Ut(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:B(`Some [] Form`,[`<LSB>`,P(N(z({semantic:gn}),`QuantBound`,F(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),N(z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,F(`<COMMA>`,`FieldVal`),`<RSB>`),N(z({semantic:e=>Gt(e,2).kind===E(`MAPTO`)&&Pt.has(Gt(e,1).kind)}),L(e=>{Gt(e,1).kind=Ot}),`FieldVal`,F(`<COMMA>`,`FieldVal`),`<RSB>`),N(z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,F(`<COMMA>`,`FieldSet`),`<RSB>`),N(`Expression`,P(N(F(`<COMMA>`,`Expression`),`<RSB>`,L(e=>{let t=e.frames[e.frames.length-1];t.node=Qt(`FcnAppl`,t.heirs),e.lastOperator=Rt})),N(`<ARROW>`,`Expression`,`<RSB>`),N(`<EXCEPT>`,`ExceptSpec`,F(`<COMMA>`,`ExceptSpec`),`<RSB>`),N(`<ARSB>`,`ReducedExpression`))))]),FieldVal:B(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:B(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:B(`Except Spec`,[`<BANG>`,Ut(`ExceptComponent`,R(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:B(`Except Component`,[P(N(`<DOT>`,L(Xt),`Identifier`,L(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),N(`<LSB>`,`Expression`,F(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:B(`Some << -- >> or >>_ Form`,[`<LAB>`,I(`Expression`,F(`<COMMA>`,`Expression`)),P(`<RAB>`,N(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:B(void 0,[`Identifier`,I(z({amount:2}),`OpArgs`),P(N(`<BANG>`,`NoOpExtension`),L(e=>{e.isFairnessHooked=e.token.kind===E(`RBR`)}))]),ReducedExpression:B(`restricted form of expression`,[P(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:B(`Fairness Expression`,[L(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),P(`<WF>`,`<SF>`),`ReducedExpression`,I(z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,L(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:B(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:B(`CASE Expression`,[`<CASE>`,`CaseArm`,F(z({semantic:e=>Yt(e)&&Gt(e,2).kind!==E(`OTHER`)}),`<CASESEP>`,`CaseArm`),I(z({semantic:Yt}),`<CASESEP>`,`OtherArm`)]),CaseArm:B(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:B(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:B(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:B(`Let Definitions`,[Ut(P(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:B(`AND-OR Junction`,[L(e=>{let t=Gt(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),P(N(z({expansion:[`<OR>`]}),...jn()),N(z({expansion:[`<AND>`]}),...jn())),L(e=>{e.junctions.pop()})]),JuncItem:B(`Junction Item`,[P(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=mn(t,e.heirs[1]);return n&&`Item at ${Zt(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Zt(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:B(`(Un)Bounded Choose`,[`<CHOOSE>`,P(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:B(`Lambda`,[`<LAMBDA>`,R(`Identifier`),`Identifier`,R("`,' or `:'"),F(`<COMMA>`,R(`Identifier`),`Identifier`,R("`,' or `:'")),`<COLON>`,R(`Expression`),`Expression`]),Expression:B(`Expression`,[L(e=>{e.operatorStacks.push([])}),Dn(),On()],(e,t)=>{let n=en(t);n.push({node:e.heirs[0],operator:zt});let r=sn(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:B(`ExtendableExpr`,[P(N(z({expansion:[P(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),ln,F(P(N(z({expansion:[`PostfixOp`],semantic:qt}),`PostfixOp`,un),N(z({expansion:[`<DOT>`],semantic:qt}),`<DOT>`,L(Xt),z({semantic:qt}),`Identifier`,L(e=>{let t=en(e);t[t.length-1].operator!==void 0&&an(t,t.length),t[t.length-1]={node:Qt(`RecordComponent`,[t[t.length-1].node,$t(e,2),$t(e,1)]),operator:void 0}})),N(z({expansion:[`<LSB>`],semantic:qt}),R(`function argument`),`SBracketCases`,cn(e=>e.kind===`FcnAppl`)))),I(P(N(z({expansion:[`InfixOp`],semantic:qt}),`InfixOp`,un,Dn(),On()),N(z({expansion:[`<COLONCOLON>`],semantic:qt}),`<COLONCOLON>`,L(e=>{let t=en(e);if(!pn(t[t.length-1].node))return`\`::' at ${Zt(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,L(e=>{let t=en(e),n=$t(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!nn(r,e.lastOperator)){let t=$t(e,3);return`Removing label at ${Zt(e,t.first,t.last)} would change expression parsing.`}t.push({node:Qt(`Label`,[$t(e,3),$t(e,2),n]),operator:void 0})}))))]),PrimitiveExp:B(`Primitive expression`,[P(N(z({expansion:[`String`],semantic:qt}),`String`),N(z({expansion:[`<NUMBER_LITERAL>`],semantic:qt}),`Number`),N(P(`Identifier`,N(P(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),L(e=>vn(e)<0&&e.proofLevels.length<=1?`${Zt(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Zt(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,N(z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),I(z({amount:2}),`OpArgs`),F(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:fn(e.heirs)===void 0?e.heirs.length===1?Qt(`GeneralId`,e.heirs):void 0:Qt(`OpApplication`,e.heirs)}),BangExt:B(`Bang Extension`,[`<BANG>`,P(N(P(N(z({expansion:[`Identifier`],semantic:e=>Gt(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),I(z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:B(`StructOp`,[R("`<<' , `>>' , `:' , `@' , or number"),P(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,N(z({semantic:e=>Gt(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Zt(t,n.first,n.last)}`:void 0}),OpenStart:B(void 0,[P(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},In=/* @__PURE__ */ new Map,Ln=e=>{let t=In.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=Ln(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,Ln(Fn[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return In.set(e,n),n},Rn=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},zn=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=Wt(e,e.scanPosition)),e.scanPosition=Wt(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},Bn=(e,t)=>{if(t.type===`tokens`)return zn(e,t.kinds);if(t.type===`call`)return Bn(e,Fn[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||Rn(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=Bn(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||Rn(e,t.semantic)?Bn(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=Bn(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=Bn(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},Vn=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=Bn(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},Hn=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||Ln(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!Ln(a).hasSemanticStart?Ln(a).first.has(Gt(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):Vn(e,i,a)&&(o===void 0||o(e))}),Un=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,Bn(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=Wt(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===Dt){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=Wt(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${Oe(e.token.image)}" `},Wn=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??Un(e)}\n\nResidual stack trace follows:\n${r}`,!1},Gn=(e,t)=>{let n=Wt(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,Wn(e))},Kn=(e,t)=>{let n=Fn[t];n.message!==void 0&&(e.messages.push({name:n.message,token:Gt(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!qn(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return Wn(e,i);let a=r.node??(r.heirs.length===0?void 0:Qt(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},qn=(e,t)=>{if(t.type===`tokens`)return Gn(e,t.kinds);if(t.type===`call`)return Kn(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||Wn(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||Wn(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||qn(e,t));if(t.type===`choice`){let n=Hn(e,t.alternatives);return n===-1?Wn(e):qn(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!qn(e,t.body))return!1;if(t.type===`optional`)return Hn(e,[t.body])===-1||qn(e,t.body);for(;Hn(e,[t.body])===0;)if(!qn(e,t.body))return!1;return!0},Jn=e=>{let t=Ee(e),n={kind:Dt,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=qn(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
336
|
+
`)},Yn=/* @__PURE__ */ new Map([[`(`,`)`],[`[`,`]`],[`{`,`}`],[`<<`,`>>`]]),Xn=(e,t)=>`${e}:${t}`,Zn=(e,t)=>{let n=tt(t).filter(e=>e.kind!==`End`).map(Xe),r=[0,0];for(let e=0;e<t.length;e++)t[e]===`
|
|
337
|
+
`&&r.push(e+1);return{name:e,source:t,tokens:n,lineOffsets:r,tokenIndexes:new Map(n.map((e,t)=>[Xn(e.line,e.column),t]))}},Qn=(e,t,n)=>e.tokens[t]!==void 0&&e.tokens[t].text===n&&e.tokens[t].kind!==`String`,$n=(e,t,n)=>{let r=0,i=e.tokens.length;for(;r<i;){let a=r+i>>>1,o=e.tokens[a];o.line<t.line||o.line===t.line&&(n?o.column<=t.column:o.column<t.column)?r=a+1:i=a}return r},er=(e,t)=>e.tokenIndexes.get(Xn(t.line,t.column))??Math.min($n(e,t,!1),e.tokens.length-1),tr=(e,t)=>Math.max($n(e,t,!0)-1,0),nr=(e,t)=>{let n=e.tokens[t].text,r=Yn.get(n);if(r===void 0)return t;let i=0;for(let a=t;a<e.tokens.length;a++)if(Qn(e,a,n))i++;else if(Qn(e,a,r)&&(i--,i===0))return a;return t},rr=(e,t)=>({start:er(e,t.start),end:tr(e,t.end)}),ir=(e,t)=>{let n=t.location.range;if(n)return rr(e,n);let r=er(e,t.location);return{start:r,end:nr(e,r)}},ar=(e,t)=>{let n=t.start-1,r=t.end+1;return Qn(e,n,`(`)&&Qn(e,r,`)`)&&nr(e,n)===r?ar(e,{start:n,end:r}):t},or=(e,t)=>{let n=t.start-1,r=t.end+1;return Qn(e,n,`(`)&&nr(e,n)===r&&(Qn(e,n-1,`(`)||Qn(e,n-1,`,`))?or(e,{start:n,end:r}):t},sr=(e,t)=>({file:e.name,beginLine:e.tokens[t.start].line,beginColumn:e.tokens[t.start].column,endLine:e.tokens[t.end].line,endColumn:e.tokens[t.end].endColumn}),cr=(e,t)=>sr(e,{start:t,end:t}),lr=(e,t,n)=>{let r=0,i=e.lineOffsets[t];for(;i<e.source.length;){if(r=e.source[i]===` `?be(r):r+1,r>=n)return i;i++}return i},ur=(e,t)=>{let n=e.tokens[t],r=lr(e,n.line,n.column);return e.source.slice(r,lr(e,n.line,n.endColumn)+1)},dr=(e,t)=>{let n=e.tokens[t],r=e.tokens[t+1];return n?.kind===`Operator`&&n.text===`[]`&&r?.kind===`Keyword`&&(r.text===`ASSUME`||r.text===`PROVE`)&&r.line===n.line&&r.column===n.endColumn+1},fr=e=>{let t=Zn(``,e),n=t.tokens.reduce((e,n,r)=>{if(!dr(t,r))return e;let i=lr(t,n.line,n.column);return`${e.slice(0,i)} ${e.slice(i+2)}`},e);if(n!==e&&Jn(e)!==void 0)throw new s(`SANY rejects a []ASSUME or []PROVE outside an ASSUME/PROVE`);return n},pr=(e,t)=>{let n=e.tokens[t-1],r=e.tokens[t],i=n===void 0?0:lr(e,n.line,n.endColumn)+1,a=e.source.slice(i,lr(e,r.line,r.column)),o=[],s=0;for(;s<a.length;)if(a.startsWith(`\\*`,s)){let e=a.indexOf(`
|
|
338
|
+
`,s),t=e===-1?a.length:e+1;o.push(a.slice(s,t)),s=t}else if(a.startsWith(`(*`,s)){let e=1,t=s,n=s+2;for(;e>0&&n<a.length;){let r=a.startsWith(`(*`,n),i=a.startsWith(`*)`,n);r||i?(e+=r?1:-1,n+=2,o.push(a.slice(t,n)),t=n):n++}t<n&&o.push(a.slice(t,n)),s=n}else s++;return o},mr=(e,t,n,r)=>{let i=[];for(let a=t;a<n&&i.length<r.length;a++){let t=e.tokens[a];t.kind===`Identifier`&&t.text===r[i.length]&&i.push(a)}return i},hr=(e,t,n,r)=>{for(let i=t;i<=n;i++)if(Qn(e,i,r))return i;return-1},gr=/* @__PURE__ */ new Map([[`Identifier`,`N_GeneralId`],[`Subexpression`,`N_GeneralId`],[`Number`,`N_Number`],[`Decimal`,`N_Real`],[`SetEnumeration`,`N_SetEnumerate`],[`SetFilter`,`N_SubsetOf`],[`SetMap`,`N_SetOfAll`],[`Tuple`,`N_Tuple`],[`Product`,`N_Times`],[`FunctionApplication`,`N_FcnAppl`],[`FunctionConstruction`,`N_FcnConst`],[`FunctionSet`,`N_SetOfFcns`],[`Record`,`N_RcdConstructor`],[`RecordSet`,`N_SetOfRcds`],[`FieldAccess`,`N_RecordComponent`],[`Except`,`N_Except`],[`Prime`,`N_PostfixExpr`],[`Always`,`N_PrefixExpr`],[`Eventually`,`N_PrefixExpr`],[`Enabled`,`N_PrefixExpr`],[`Unchanged`,`N_PrefixExpr`],[`Forall`,`N_BoundedQuant`],[`Exists`,`N_BoundedQuant`],[`UnboundedQuantifier`,`N_UnboundedQuant`],[`Choose`,`N_UnBoundedOrBoundedChoose`],[`If`,`N_IfThenElse`],[`Case`,`N_Case`],[`Let`,`N_LetIn`],[`BoxAction`,`N_ActionExpr`],[`AngleAction`,`N_ActionExpr`],[`WeakFairness`,`N_FairnessExpr`],[`StrongFairness`,`N_FairnessExpr`]]),_r=/* @__PURE__ */ new Set([`N_GeneralId`,`N_OpApplication`,`N_PrefixExpr`,`N_InfixExpr`,`N_PostfixExpr`,`N_FcnAppl`,`N_RecordComponent`]),vr=(e,t)=>Qn(e,t.start,`(`)&&nr(e,t.start)===t.end,yr=(e,t)=>ar(e,ir(e,t)),br=(e,t,n)=>yr(e,t.args[0]).start===n.start?t.args.length===2?`N_InfixExpr`:`N_PostfixExpr`:e.tokens[n.start].kind===`Identifier`?`N_OpApplication`:`N_PrefixExpr`,xr=(e,t,n)=>vr(e,n)?`N_ParenExpr`:t.kind===`String`?ur(e,n.start):t.kind===`Apply`?br(e,t,n):t.kind===`And`||t.kind===`Or`?t.isBulleted?t.kind===`And`?`N_ConjList`:`N_DisjList`:`N_InfixExpr`:gr.get(t.kind),Sr=(e,t,n)=>{if(t.kind===`String`&&!vr(e,n))return!1;if(t.kind===`Identifier`&&!t.name.includes(`!`))return!0;let r=xr(e,t,n);return r===void 0||_r.has(r)?void 0:!0},Cr=(e,t,n)=>{let r=(t,n=t)=>sr(e,{start:t,end:n}),i=(t,n=yr(e,t))=>({last:sr(e,n),lastKind:xr(e,t,n)}),a=(e,t)=>({hasChildlessFirstChild:!1,last:r(n.start+1,e),lastKind:t}),o=(t,n)=>{let i=yr(e,t);return{hasChildlessFirstChild:Sr(e,t,i),last:r(i.end+1),lastKind:n}};if(vr(e,n))return{hasChildlessFirstChild:!1,...i(t,{start:n.start+1,end:n.end-1})};switch(t.kind){case`If`:case`BoxAction`:case`AngleAction`:return{hasChildlessFirstChild:!1,...i(t.kind===`If`?t.condition:t.action)};case`Tuple`:case`SetEnumeration`:{let a=t.elements[0];return a===void 0?{hasChildlessFirstChild:!1,last:r(n.end),lastKind:e.tokens[n.end].text}:{hasChildlessFirstChild:!1,...i(a)}}case`Except`:return{hasChildlessFirstChild:!1,...i(t.function)};case`FunctionSet`:return{hasChildlessFirstChild:!1,...i(t.domain)};case`SetMap`:return{hasChildlessFirstChild:!1,...i(t.expression)};case`WeakFairness`:case`StrongFairness`:return{hasChildlessFirstChild:!1,...i(t.subscript)};case`Case`:return a(yr(e,t.arms[0].body).end,`N_CaseArm`);case`Record`:case`RecordSet`:return a(yr(e,t.fields[0].value).end,t.kind===`Record`?`N_FieldVal`:`N_FieldSet`);case`FunctionConstruction`:case`Forall`:case`Exists`:return a(yr(e,t.bounds[0].set).end,`N_QuantBound`);case`Choose`:case`SetFilter`:return(t.kind===`Choose`?t.pattern:t.bound.pattern).kind===`Tuple`?a(nr(e,n.start+1),`N_IdentifierTuple`):void 0;case`Decimal`:{let t=e.tokens[n.start],i=t.column+t.text.indexOf(`.`);return{hasChildlessFirstChild:!1,last:{...r(n.start),beginColumn:i,endColumn:i},lastKind:`.`}}case`Let`:return a(yr(e,t.body).start-2,`N_LetDefinitions`);case`Product`:return o(t.factors[0],`N_GenInfixOp`);case`And`:case`Or`:{if(t.operands.length===1)return;if(!t.isBulleted&&t.operands.length>2)return{hasChildlessFirstChild:void 0,last:r(yr(e,t.operands[t.operands.length-1]).start-1),lastKind:`N_GenInfixOp`};if(!t.isBulleted)return o(t.operands[0],`N_GenInfixOp`);let n=yr(e,t.operands[1]);return{hasChildlessFirstChild:!0,last:r(n.start-1,n.end),lastKind:t.kind===`And`?`N_ConjItem`:`N_DisjItem`}}case`Always`:case`Eventually`:case`Enabled`:case`Unchanged`:return{hasChildlessFirstChild:!0,...i(t.expression,{start:n.start+1,end:n.end})};case`Prime`:return{hasChildlessFirstChild:Sr(e,t.expression,yr(e,t.expression)),last:r(n.end),lastKind:`N_GenPostfixOp`};case`FunctionApplication`:case`FieldAccess`:{let n=t.kind===`FunctionApplication`?t.function:t.record,i=yr(e,n),a=i.end+1;return{hasChildlessFirstChild:Sr(e,n,i),last:r(a),lastKind:e.tokens[a].text}}case`Apply`:{let a=br(e,t,n);return a===`N_OpApplication`?t.operator.includes(`!`)?void 0:{hasChildlessFirstChild:!0,last:r(n.start+1,n.end),lastKind:`N_OpArgs`}:a===`N_PrefixExpr`?{hasChildlessFirstChild:!0,...i(t.args[0],{start:n.start+1,end:n.end})}:o(t.args[0],a===`N_InfixExpr`?`N_GenInfixOp`:`N_GenPostfixOp`)}}},wr=(e,t)=>{let n=yr(e,t),r=sr(e,n),i=Cr(e,t,n),a=t.kind===`Number`||t.kind===`String`||(t.kind===`And`||t.kind===`Or`)&&t.operands.length===1;return i===void 0&&a||i!==void 0&&i.hasChildlessFirstChild===void 0?[{location:r,message:`DEF clause entry should describe a defined operator.`}]:i?.hasChildlessFirstChild===void 0||i.lastKind===void 0?[]:[...i.hasChildlessFirstChild?[{location:r,message:`Was expecting a GeneralId.`}]:[],...i.lastKind===`N_OpArgs`?[{location:i.last,message:"Selector `!(...)' should not have argument(s)."}]:[{location:i.last,message:`Unexpected token found.`},{location:i.last,message:`Need name or step number here, not \`${i.lastKind}'.`}],{location:r,message:`DEF clause entry should describe a defined operator.`}]},Tr={low:15,high:15},Er={low:16,high:16},V=(e,t,n)=>({low:e,high:t,isAssociative:n}),Dr=new Map([[`=>`,V(1,1,!1)],[`<=>`,V(2,2,!1)],[`~>`,V(2,2,!1)],[`-+->`,V(2,2,!1)],[`/\\`,V(3,3,!0)],[`\\/`,V(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,V(5,5,!1)]),[`\\cdot`,V(5,14,!0)],[`@@`,V(6,6,!0)],[`:>`,V(7,7,!1)],[`<:`,V(7,7,!1)],[`\\cup`,V(8,8,!0)],[`\\cap`,V(8,8,!0)],[`\\`,V(8,8,!1)],[`..`,V(9,9,!1)],[`...`,V(9,9,!1)],[`##`,V(9,13,!0)],[`$`,V(9,13,!0)],[`$$`,V(9,13,!0)],[`??`,V(9,13,!0)],[`!!`,V(9,13,!1)],[`\\sqcap`,V(9,13,!0)],[`\\sqcup`,V(9,13,!0)],[`\\uplus`,V(9,13,!0)],[`\\wr`,V(9,14,!1)],[`+`,V(10,10,!0)],[`++`,V(10,10,!0)],[`(+)`,V(10,10,!0)],[`\\oplus`,V(10,10,!0)],[`%`,V(10,11,!1)],[`%%`,V(10,11,!0)],[`|`,V(10,11,!0)],[`||`,V(10,11,!0)],[`\\X`,V(10,13,!1)],[`-`,V(11,11,!0)],[`--`,V(11,11,!0)],[`(-)`,V(11,11,!0)],[`\\ominus`,V(11,11,!0)],[`*`,V(13,13,!0)],[`**`,V(13,13,!0)],[`/`,V(13,13,!1)],[`//`,V(13,13,!1)],[`\\div`,V(13,13,!1)],[`\\o`,V(13,13,!0)],[`(.)`,V(13,13,!0)],[`\\odot`,V(13,13,!0)],[`(/)`,V(13,13,!1)],[`\\oslash`,V(13,13,!1)],[`(\\X)`,V(13,13,!0)],[`\\otimes`,V(13,13,!0)],[`&`,V(13,13,!0)],[`&&`,V(13,13,!0)],[`\\star`,V(13,13,!0)],[`\\bullet`,V(13,13,!0)],[`\\bigcirc`,V(13,13,!0)],[`^`,V(14,14,!1)],[`^^`,V(14,14,!1)]]),Or=(e,t)=>t.isAssociative||e===`%`||e===`\\X`,kr=/* @__PURE__ */ new Map([[`~`,{low:4,high:4}],[`[]`,{low:4,high:15}],[`<>`,{low:4,high:15}],[`ENABLED`,{low:4,high:15}],[`UNCHANGED`,{low:4,high:15}],[`SUBSET`,{low:8,high:8}],[`UNION`,{low:8,high:8}],[`DOMAIN`,{low:9,high:9}],[`-`,{low:12,high:12}],[`-.`,{low:12,high:12}]]),Ar={low:17,high:17},jr=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`,`@`,`\\A`,`\\E`,`\\AA`,`\\EE`,`IF`,`CASE`,`LET`,`CHOOSE`,`LAMBDA`,`WF_`,`SF_`]),Mr=/* @__PURE__ */ new Set([`(`,`{`,`<<`]),Nr=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Pr=/* @__PURE__ */ new Set([...Nr,`'`]),Fr=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Ir=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),Lr=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Rr=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),zr=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Pr]),Br=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Vr=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Hr=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Ur=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Wr=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Gr=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Kr=/* @__PURE__ */ new Set([``,`*`,`-`]),qr={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},Jr=(e,t)=>e.line-t.line||e.column-t.column,Yr=(e,t)=>({start:Jr(e.start,t.start)<=0?e.start:t.start,stop:Jr(e.stop,t.stop)>=0?e.stop:t.stop}),Xr=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),Zr={printed:``,set:``},Qr={printed:`
|
|
339
|
+
`,set:``},$r={printed:`
|
|
340
|
+
`,set:`
|
|
341
|
+
`},ei=(e,t,n,r=`Proof.Parser`)=>new s(e,void 0,{reason:`${e}${n.set}`,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:r,printed:`${e}${n.printed}`}}),ti=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),ni=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),ri=/* @__PURE__ */ new Set([`NEW`,...ni.keys()]),ii=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),ai=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),oi=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),si=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?Dr.has(e.operator):Nr.has(e.operator)),ci=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,li=e=>Dr.has(e)||Nr.has(e)||e===`-.`,ui=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},di=/* @__PURE__ */ new WeakMap,fi=/* @__PURE__ */ new WeakMap,pi=e=>{if(di.has(e))return;let t=e.kind===`UnboundedQuantifier`?{name:e.names[0],range:e.nameRanges?.[0]}:e.kind===`Choose`&&e.pattern.kind===`Name`?{name:e.pattern.name,range:e.pattern.ranges?.[0]}:e.kind===`SetFilter`&&e.bound.pattern.kind===`Name`?{name:e.bound.pattern.name,range:e.bound.pattern.ranges?.[0]}:void 0,n=t?.range;return t&&n?{kind:`Identifier`,name:t.name,location:{...n.start,range:n}}:void 0},mi=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
342
|
+
`)}\n`},hi=(e,t,n=tt(e,t===`tlapm`))=>{let r=t===`tlapm`,i=r?n:n.map(Xe),a=0,o=[],c,l,u=[],d=[],f,p=0,m=[],h=/* @__PURE__ */ new WeakMap,g=e=>u[u.length-1].has(e),_=e=>({line:e.line,column:r&&e.kind===`String`?e.endColumn:e.column,range:void 0}),v=[],y=[],ee=[],b=(e,t=a-1)=>{let n=e===t?ee[e]:void 0;if(n)return n;let r=i[t];v[e]??=_(i[e]),y[t]??={line:r.line,column:r.endColumn};let o={module:d[0].name,start:v[e],end:y[t]};return e===t&&(ee[e]=o),o},x=(e,t)=>(e.location.range=b(t),e),te=(e=0)=>i[Math.min(a+e,i.length-1)],S=(e=0)=>{let t=te(e),n=o[o.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},C=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ne=e=>r&&(e.kind===`Keyword`||oi.has(e.text)),w=e=>{let t=i.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},re=e=>e.kind===`End`?`EOF`:/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Gr.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:ne(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,T=(e,t=te(),n)=>{let r=i[i.length-1],a=t.line===r.line&&t.column===r.column,o=new s(`${e} at line ${t.line}, column ${t.column}`,void 0,ie(e,t,a,n));return f!==void 0&&h.set(o,f),o},ie=(e,t,n,a)=>{if(!r)return{reason:e,line:t.line,column:t.column,isEnd:n};let o=i[m[0]-1],s=a?`Unexpected ${re(a)}`:e;if(o)return{reason:s,line:o.line,column:o.endColumn+1,isEnd:n};let c=a?w(a):t;return{reason:s,line:c.line,column:c.column,isEnd:n}},ae=(e,t=te())=>T(e,t,t),oe=e=>{let t={cursor:a,frame:f,restorePoints:m.length,offsideColumns:o.length,recursiveScopes:u.length},n=++p;f=n;try{let n=e();return f=t.frame,n}catch(e){if(!(e instanceof s)||h.get(e)!==n)throw e;a=t.cursor,f=t.frame,m.length=t.restorePoints,o.length=t.offsideColumns,u.length=t.recursiveScopes;return}},se=e=>{let t=f;f=void 0;let n=e();return f=t,n},E=e=>{m.push(a);let t=e();return m.pop(),t},ce=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!ne(e),D=(e,t=0)=>{let n=S(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},O=()=>{let e=S();if(e.kind===`End`)throw ae(`Unexpected end of expression`);return a++,e},k=e=>D(e)?(a++,!0):!1,A=e=>{if(!D(e))throw ae(`Expected ${JSON.stringify(e)} but found ${C(S())}`);return O()},le=()=>{let e=S();if(e.kind!==`Identifier`)throw ae(`Expected an identifier but found ${C(e)}`);if(ne(e))throw ae(`Unexpected keyword ${e.text}`);return a++,e.text},ue=()=>{let e=a;return{name:le(),range:b(e)}},de=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),fe=()=>{let e=S();return e.kind!==`String`&&(Ir.has(e.text)||Dr.has(e.text)||Pr.has(e.text))?(a++,e.text):le()},pe=!1,me=()=>S().kind===`Identifier`||!ce(S())?le():(pe=!0,O().text),he=e=>{if(!r)return e();o.push(-1);let t=e();return o.pop(),t},ge=(e,t=`,`)=>{let n=[e()];for(;k(t);)n.push(e());return n},_e=(e=0)=>{if(D(`<<`,e)){let t=e+1;for(;S(t).kind===`Identifier`||D(`,`,t);)t++;return D(`>>`,t)&&D(`\\in`,t+1)}let t=e;for(;S(t).kind===`Identifier`;){if(D(`\\in`,t+1))return!0;if(!D(`,`,t+1))return!1;t+=2}return!1},ve=()=>{if(D(`::`))return!0;if(!D(`(`))return!1;let e=1;for(;S(e).kind===`Identifier`&&D(`,`,e+1);)e+=2;return S(e).kind===`Identifier`&&D(`)`,e+1)&&D(`::`,e+2)},ye=()=>{if(!k(`<<`)){let e=ue();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=de(D(`>>`)?[]:ge(ue));return A(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},be=()=>{let e=()=>{let e=ge(ye);A(`\\in`);let t=se(j);return e.map(e=>({pattern:e,set:t}))},t=[e()];for(;D(`,`)&&(!r||_e(1));)O(),t.push(e());return t.flat()},xe=()=>{let e=S();if(r&&oi.has(e.text)){let t=a;O();let n={kind:`Identifier`,name:e.text,location:_(e)};return{subscript:x(n,t),lastArgs:[]}}let t=r&&(e.kind===`Number`||e.kind===`String`||D(`@`));if(e.kind===`Identifier`){let t=a,n=[],i=[],o=e=>(i.push(b(a,a)),n.push(le()),e&&D(`(`)?Ee():[]),s=[o(!r)];for(;D(`!`)&&S(1).kind===`Identifier`;)O(),s.push(o(!0));let c=s.slice(0,-1),l=_(e);l.range={...b(t),end:i[i.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:i,location:l},lastArgs:s[s.length-1]}}if(D(`<<`)||D(`(`)||D(`{`)||D(`[`)||t){let e=a,t=Re();return{subscript:t.location.range?t:x(t,e),lastArgs:[]}}throw ae(`Expected a subscript but found ${C(e)}`)},Se=e=>{let t=S(1),n=S(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&D(`==`,Pr.has(n.text)?3:4))},Ce=e=>{let t=S(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||D(`,`,1)||D(`)`,1)||t.kind===`Keyword`&&Vr.has(t.text)||Se(e)},we=()=>{let e=S(),t=e.kind===`Operator`&&(Dr.has(e.text)||Fr.has(e.text))&&Ce(e);if(r&&e.kind!==`String`&&(Fr.has(e.text)||zr.has(e.text)&&e.text!==`'`&&!Nr.has(e.text)||Rr.has(e.text)&&S(-1).text===`(`&&S(-1).line===e.line&&S(-1).endColumn+1===e.column&&S(1).text===`)`&&S(1).line===e.line&&S(1).column===e.endColumn+1)&&Ce(e))throw T(`incomplete expression`,e);if(t&&!r&&e.text===`\\X`&&e.spelling!==`×`)throw T(`\\X may not be used as an infix operator`,e);if(t)return a++,x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:_(e)},a-1);if(e.kind!==`String`&&zr.has(e.text)&&Ce(e)){a++;let t=_(e);if(Nr.has(e.text))return x({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},a-1);let n={kind:`Identifier`,name:`argument`,location:t};return x({kind:`Lambda`,params:[n.name],body:ui(e.text,n,t),operator:e.text,location:_(e)},a-1)}if(D(`LAMBDA`)){let t=a;O();let n=de(ge(ue));A(`:`);let r=j();return x({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:_(e)},t)}if(!r)return j();let n=oe(j);if(n)return n;throw ae(`Unexpected ${C(S())}`)},Te,Ee=()=>he(()=>{let e=a;A(`(`);let t=ge(we);return A(`)`),Te=b(e),t}),De=()=>{let e=O();o.push(e.column);let t=[j()],n=()=>{for(;ci(te())&&te().text===e.text&&te().column===e.column;)a++,t.push(j())};return r?se(n):n(),o.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:_(e)}},Oe=e=>he(()=>{let t=_(e),n=S().kind===`Identifier`,i=D(`|->`,1)&&(n||ce(S()));if(i||n&&D(`:`,1)){let e=i?`Record`:`RecordSet`,r=e=>{let t=a,n=_(S()),r=e();return n.range=b(t),A(i?`|->`:`:`),{name:r,value:j(),location:n}},o=[r(()=>n?le():O().text),...k(`,`)?ge(()=>r(le)):[]];return A(`]`),{kind:e,fields:o,location:t}}if(_e()){let e=a,n=be();if(!r||D(`|->`)){A(`|->`);let e=j();return A(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}a=e}let o=j();if(k(`->`)){let e=j();return A(`]`),{kind:`FunctionSet`,domain:o,range:e,location:t}}if(k(`EXCEPT`)){let e=ge(()=>{let e=[a];A(`!`);let t=[];for(;D(`.`)||D(`[`);)if(e.push(a),k(`.`)){if(!ce(S()))throw ae(`Expected a field name but found ${C(S())}`);if(!r&&D(`@`))throw ae(`@ used in !.@`);t.push(O().text)}else A(`[`),t.push(ge(()=>j())),A(`]`);e.push(a,a+1),A(`=`);let n=j();e.push(a);let i=t=>b(e[t],e[t+1]-1);return{path:t.map((t,n)=>typeof t==`string`?{kind:`Field`,name:t}:{kind:`Index`,args:t,tupleRange:i(2*n+1<e.length-1?2*n+1:n+1)}),value:n,range:b(e[0])}});return A(`]`),{kind:`Except`,function:o,updates:e,location:t}}if(!r&&!D(`]_`)){let e=[o];for(;k(`,`);)e.push(j());return A(`]`),{kind:`Bracket`,args:e,location:t}}return A(`]_`),{kind:`BoxAction`,action:o,subscript:xe().subscript,location:t}}),ke=()=>{let e=a,t=x(Be(),e),n=_(O());return x({kind:`Apply`,operator:`\\in`,args:[t,se(j)],location:n},e)},Ae=e=>he(()=>{let t=_(e);if(k(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(_e()&&(S(1).text===`\\in`||D(`<<`))){let e=a,n=ye();A(`\\in`);let r=se(j);if(k(`:`)){let e=se(j);return A(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}a=e}let n=S().kind===`Identifier`&&D(`\\in`,1)?ke():j();if(k(`:`)){let e=be();return A(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;k(`,`);)r.push(j());return A(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),je=e=>{let t=_(e),n=he(()=>D(`>>`)||D(`>>_`)?[]:ge(()=>j()));if(k(`>>_`)){if(n.length!==1)throw T(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:se(xe).subscript,location:t}}return A(`>>`),{kind:`Tuple`,elements:n,location:t}},Me=e=>{let t=_(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&_e()){let e=be();return A(`:`),{kind:n,bounds:e,body:j(),location:t}}let i=de(ge(ue));return A(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:j(),isTemporal:r,location:t}},Ne=e=>{let t=[];do{let n=a;if(k(`OTHER`))return A(`->`),{kind:`Case`,arms:t,other:j(),otherRange:b(n),location:_(e)};let r=j();A(`->`),t.push({condition:r,body:j()})}while(k(`[]`));return{kind:`Case`,arms:t,other:void 0,location:_(e)}},Pe=()=>{let e=S(1);return D(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||Br.has(e.text)||e.kind===`Operator`&&(Dr.has(e.text)||Pr.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Ir.has(e.text))},Fe=()=>{let e=O();if(e.kind===`Number`)return{kind:`Operand`,operand:Le(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return a--,{kind:`Bound`,args:Ee()}}return{kind:`Name`,name:e.text,args:D(`(`)?Ee():[]}},Ie=(e,t,n,r,i)=>{let o=[{kind:`Name`,name:e,args:t}],s=[b(r,r)],c=[n];for(;Pe();){O();let e=a;Te=void 0;let t=Fe();s.push(t.kind===`Bound`?b(e):b(e,e)),o.push(t),c.push(Te)}let l=o.flatMap(e=>e.kind===`Name`?[e.name]:[]),u=l.join(`!`),d=o.flatMap(e=>`args`in e?e.args:[]),f=o.map(e=>`args`in e?e.args.length:0);return l.length<o.length?{kind:`Subexpression`,selectors:o,selectorRanges:s,argumentRanges:c,location:i}:d.length===0?{kind:`Identifier`,name:u,selectorRanges:s,location:i}:{kind:`Apply`,operator:u,args:d,...f.slice(0,-1).some(e=>e>0)&&{argumentCounts:f},argumentsRange:c.at(-1)??b(r),selectorRanges:s,argumentRanges:c,location:i}},Re=e=>{let n=a,i=O(),o=_(i);if(r&&i.kind===`Keyword`&&i.text===`LAMBDA`){let e=ge(le);return A(`:`),{kind:`Lambda`,params:e,body:j(),location:o}}if(i.kind===`Number`)return{kind:`Number`,value:Le(i.text),text:i.text,location:o};if(i.kind===`Decimal`)return{kind:`Decimal`,text:i.text,location:o};if(i.kind===`String`)return{kind:`String`,value:i.text,location:o};let s=i.kind===`Step`&&St(i);if(!r&&s&&yt()<0&&vt.length<=1)throw T(`Step number used outside proof`,i);if(s&&i.text[1]===`+`)throw T(`<+> step number used in an expression`,i);if(i.kind===`Identifier`||s){let t=s?Ct(i)??i.text:i.text;if(ve()){let a=de(k(`(`)?ge(ue):[]);a.names.length>0&&A(`)`),A(`::`);let s=b(n),l=j();if(!r&&e!==void 0&&c!==void 0&&si(l)&&e.high>=c.low)throw T(`Removing the label would change expression parsing`,i);return{kind:`Label`,name:t,params:a.names,paramRanges:a.ranges,head:s,body:l,location:o}}let a=D(`(`);if(t===`@`&&!a&&!Pe())return{kind:`ExceptAt`,location:o};let l=a?Ee():[];return Pe()?Ie(t,l,a?Te:void 0,n,o):a?{kind:`Apply`,operator:t,args:l,argumentsRange:Te,location:o}:{kind:`Identifier`,name:t,location:o}}let l=i.kind===`Operator`&&(li(i.text)||i.text===`'`&&!r);if(l&&D(`(`)){let e=Ee();return!r&&Pe()?Ie(i.text,e,Te,n,o):t===`tlc`&&i.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:o}:i.text===`'`&&e.length===1?{kind:`Prime`,expression:e[0],location:o}:{kind:`Apply`,operator:i.text,spelling:i.spelling,args:e,argumentsRange:Te,location:o}}if(l&&!r)return Pe()?Ie(i.text,[],void 0,n,o):{kind:`Identifier`,name:i.text,spelling:i.spelling,location:o};switch(i.text){case`(`:{let e=he(()=>j());return A(`)`),di.set(e,b(n)),e}case`[`:return Oe(i);case`{`:return Ae(i);case`<<`:return je(i);case`@`:return{kind:`ExceptAt`,location:o};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Me(i);case`IF`:{let e=j();A(`THEN`);let t=j();return A(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:j(),location:o}}case`CASE`:return Ne(i);case`LET`:{let e=[],t=[],n=[];for(u.push(/* @__PURE__ */ new Set);!k(`IN`);){if(r&&D(`RECURSIVE`))throw ae(`Unexpected keyword RECURSIVE`);if(k(`RECURSIVE`)){n.push(...gt()),d[d.length-1].hasRecursiveLet=!0;continue}let i=lt(!r&&k(`LOCAL`));i.kind===`Instance`?t.push(i):e.push(i)}return u.pop(),{kind:`Let`,definitions:e,...t.length>0&&{instances:t},...n.length>0&&{recursive:n},body:j(),location:o}}case`CHOOSE`:{let e=ye(),t=k(`\\in`)?j():void 0;return A(`:`),{kind:`Choose`,pattern:e,set:t,body:j(),location:o}}case`WF_`:case`SF_`:{let e=xe(),t=!D(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:he(()=>{A(`(`);let e=j();return A(`)`),e});return{kind:i.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:o}}}throw ae(`Unexpected ${C(i)}`,i)},ze=(e,t,n)=>{c=l={low:t,high:n};let r=j(n+1),i=S(),a=Pr.has(i.text)?Tr.high:Dr.get(i.text)?.high;if(i.kind===`Operator`&&a!==void 0&&a>=t)throw T(`Precedence conflict between ${e.text} and ${i.text}`,i);return r},Be=()=>{let e=l;l=void 0;let t=S(),n=_(t);if(t.kind===`Operator`&&ci(t))return De();if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return O(),{kind:`Apply`,operator:`~`,args:[ze(t,4,4)],location:n};case`-`:return O(),{kind:`Apply`,operator:`-.`,args:[ze(t,12,12)],location:n};case`[]`:case`<>`:case`ENABLED`:case`UNCHANGED`:return O(),ui(t.text,ze(t,4,15),n);case`SUBSET`:case`UNION`:case`DOMAIN`:return O(),{kind:`Apply`,operator:t.text,args:[ze(t,10,13)],location:n}}return Re(e)},Ve=(e,t,n,r,i)=>{let a=_(e);if(e.text===`/\\`||e.text===`\\/`){let o=e.text===`/\\`?`And`:`Or`;return t.kind===o&&r?{...t,operands:[...t.operands,n],prefixEnds:[...t.prefixEnds??[],i]}:{kind:o,operands:[t,n],prefixEnds:[i],location:a}}return e.text===`\\X`?t.kind===`Product`&&r?{...t,factors:[...t.factors,n]}:{kind:`Product`,factors:[t,n],location:a}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t,n],location:a}},He=(e,t)=>e.text===`'`?{kind:`Prime`,expression:t,location:_(e)}:{kind:`Apply`,operator:e.text,spelling:e.spelling,args:[t],location:_(e)},Ue=()=>{O();let e=he(()=>ge(()=>j()));return he(()=>A(`]`)),e},We=e=>{let t=a,n=Be(),r=n.location.range?n:x(n,t),i;for(;;){let n=S();if(n.kind!==`Operator`)break;let a=_(n);if(Pr.has(n.text)&&e<=15){O(),c=Tr,r=x(He(n,r),t);continue}if(n.text===`[`){let e=Ue();c=Er,r=x({kind:`FunctionApplication`,function:r,args:e,location:a},t);continue}if(n.text===`.`&&ce(S(1))){O();let e=O().text;r=x({kind:`FieldAccess`,record:r,field:e,location:a},t);continue}let o=Dr.get(n.text);if(!o||o.low<e)break;if(i){let e=!(i.low>o.high||i.high<o.low),t=i.text===n.text&&o.isAssociative;if(e&&!t&&(i.text!==`\\X`||n.text!==`\\X`))throw T(`Precedence conflict between ${i.text} and ${n.text}`,n)}if(O(),o.low>12&&D(`-`))throw T(`Precedence conflict between ${n.text} and -`,S());c=l=o;let s=j(o.high+1),u=i?.text===n.text;r=x(Ve(n,r,s,u,b(t).end),t),i={...o,text:n.text}}return r},Ge=e=>e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`||e.kind===`Identifier`||e.kind===`Step`&&St(e)&&/^<\d/.test(e.text)||(e.kind===`Operator`||e.kind===`Keyword`)&&jr.has(e.text),Ke=(e,t)=>({start:t,end:a-1,expression:e.location.range?e:x(e,t)}),qe=(e,t,n,r)=>({...n,start:e,end:a-1,fixity:t,isLeft:!1,apply:r}),Je=e=>e.kind===`Operator`&&Pr.has(e.text)&&D(`(`,1)?oe(()=>he(()=>{O(),O();let t=j(),n=a-1;return A(`)`),{end:n,expression:He(e,t)}})):void 0,Ye=()=>{let e=0;for(let t=a+1;t<i.length;t++){let n=i[t];if(n.kind===`Operator`){if(e===1&&n.text===`,`)return!0;if(i[t-1].text!==`!`&&(ii.has(n.text)&&e++,ai.has(n.text)&&--e===0))return!1}}return!1},Ze=e=>D(`(`,1)&&Ye()?oe(()=>he(()=>{O(),O();let t=j();A(`,`);let n=j();return A(`)`),{kind:`Apply`,operator:e.text,args:[t,n],location:_(e)}})):void 0,Qe=e=>{let t=a,n=S(),r=_(n),i=n.kind===`Operator`||n.kind===`Keyword`,o=i?Dr.get(n.text):void 0;if(!e){if(D(`[`)){let e=Ue();return qe(t,`Postfix`,Ar,t=>({kind:`FunctionApplication`,function:t[0].expression,args:e,location:r}))}if(D(`.`)&&ce(S(1))){O();let e=O().text;return qe(t,`Postfix`,Ar,t=>({kind:`FieldAccess`,record:t[0].expression,field:e,location:r}))}if(o){if(Ze(n)){a=t;return}return O(),{...qe(t,`Infix`,o,e=>Ve(n,e[0].expression,e[1].expression,e[0].joinedBy===n.text,b(e[0].start,e[1].end).end)),isLeft:Or(n.text,o),joins:n.text}}if(n.kind!==`Operator`||!Pr.has(n.text))return;if(Je(n)){a=t;return}return O(),qe(t,`Postfix`,Tr,e=>He(n,e[0].expression))}if(n.kind===`Operator`&&ci(n))return Ke(De(),t);let s=o?Ze(n):void 0;if(s)return Ke(s,t);let c=Je(n);if(c)return c.expression.location.range=b(t,c.end),{start:t,end:c.end,expression:c.expression};let l=i?kr.get(n.text):void 0;if(l)return O(),qe(t,`Prefix`,l,e=>ui(n.text===`-`?`-.`:n.text,e[0].expression,r));if(!Ge(n))return;let u=n.kind===`Operator`&&Mr.has(n.text);return Ke(u?Re():se(Re),t)},$e=e=>e!==void 0&&`fixity`in e,et=e=>e!==void 0&&!(`fixity`in e),nt=(e,t)=>{let n=Math.min(e.start,t[0].start),r=Math.max(e.end,t[t.length-1].end),i=e.apply(t);return i.location.range=b(n,r),{start:n,end:r,expression:i,joinedBy:e.joins}},rt=e=>{let t=e.pop(),n=e.pop();if(!et(t)||!$e(n))throw T(`incomplete expression`);let r=n.fixity===`Infix`?e.pop():void 0;e.push(nt(n,et(r)?[r,t]:[t]))},it=e=>{let t=e[e.length-2];return $e(t)?t:void 0},at=(e,t)=>t!==void 0&&e.high<t.low,ot=()=>E(()=>{let e=oe(()=>Qe(!0));if(e===void 0){let e=te();throw e.kind===`End`?ae(`Unexpected end of expression`,e):T(`required expressions(s) missing before '${re(e)}'`,e)}return se(()=>{let t=[e];for(;;){let e=oe(()=>Qe($e(t[t.length-1])));if(e===void 0)break;if(et(e)||e.fixity===`Prefix`){t.push(e);continue}for(;at(e,it(t));)rt(t);let n=t[t.length-1];if(e.fixity===`Postfix`&&et(n)){t.splice(-1,1,nt(e,[n]));continue}let r=it(t);r?.fixity===`Infix`&&r.isLeft&&e.isLeft&&!at(r,e)&&rt(t),t.push(e)}for(;t.length>1;)rt(t);let n=t[0];if(!et(n))throw T(`incomplete expression`);return n.expression})}),j=(e=0)=>r?ot():We(e),st=()=>{if(!k(`(`))return[];let e=ht();return A(`)`),e},ct=()=>{let e=_(S()),t=j(),n=i[a-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:d[0].name,start:e,end:r}}},lt=e=>{let t=a;return x(dt(e),t)},ut=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),dt=e=>{let t=S(),n=a,r=_(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:b(n,a-2),...ct(),isLocal:e,isRecursive:g(t),location:r});if(t.kind===`Identifier`&&S(1).kind===`Operator`&&Dr.has(S(1).text)&&S(2).kind===`Identifier`&&D(`==`,3)){let e=ue(),t=O().text,n=ue();return A(`==`),i(t,[ut(e),ut(n)])}let o=t.kind!==`String`&&Ir.has(t.text),s=t.kind===`Identifier`&&Pr.has(S(1).text)&&D(`==`,2);if(o||s){let e=o?t.text:S(1).text;o&&O();let n=ue();return s&&O(),A(`==`),i(e,[ut(n)])}let c=le();if(k(`[`)){let t=he(()=>be());return A(`]`),A(`==`),{kind:`Function`,name:c,bounds:t,body:j(),isLocal:e,isRecursive:g(c),location:r}}let l=a,u=st();return A(`==`),D(`INSTANCE`)?{...ft(c,u,e,r),definitionRange:b(l)}:i(c,u)},ft=(e,t,n,r)=>{let i=a;return A(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:me(),substitutions:k(`WITH`)?ge(()=>{let e=a,t=fe(),n=b(e);return A(`<-`),{name:t,nameRange:n,expression:we()}}):[],isLocal:n,location:r,instanceRange:b(i)}},pt=()=>{let e=a;return x(mt(),e)},mt=()=>{let e=_(S());if(D(`_`)&&S(1).kind===`Operator`&&(Dr.has(S(1).text)||Pr.has(S(1).text)))return O(),{name:O().text,arity:k(`_`)?2:1,location:e};if(S().kind!==`String`&&(Ir.has(S().text)||r&&S().kind===`Operator`)&&D(`_`,1)){let t=O().text;return O(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=le();if(!k(`(`))return{name:t,arity:0,location:e};let n=ge(()=>A(`_`));return A(`)`),{name:t,arity:n.length,location:e}},ht=()=>ge(pt),gt=()=>{let e=ht();return e.forEach(e=>u[u.length-1].add(e.name)),e},_t=e=>{let t=0,n=e;do{let e=S(n);if(e.kind===`End`)return n;e.kind===`Operator`&&ii.has(e.text)&&t++,e.kind===`Operator`&&ai.has(e.text)&&t--,n++}while(t>0);return n},M=()=>{let e=S(),t=S(1);return e.kind===`Identifier`?D(`(`,1)||D(`[`,1)?D(`==`,_t(1)):t.kind===`Operator`&&Pr.has(t.text)?D(`==`,2):t.kind===`Operator`&&Dr.has(t.text)?S(2).kind===`Identifier`&&D(`==`,3):D(`==`,1):e.kind!==`String`&&Ir.has(e.text)&&t.kind===`Identifier`&&D(`==`,2)},vt=[],yt=()=>vt[vt.length-1]??-1,bt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),xt=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},St=e=>!e.text.endsWith(`.`)&&!Kr.has(xt(e)),Ct=e=>{let t=xt(e);if(Kr.has(t))return;let n=bt(e);if(n>=0)return`<${n}>${t}`;let r=yt(),i=vt[vt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},wt=e=>{if(e.kind===`Keyword`)return Ur.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return vt.length===0;if(e.text[1]===`+`||vt.length===0)return!0;let t=yt();return t>=0&&bt(e)>t},Tt=e=>{let t=bt(e),n=vt.length-1,r=vt[n-1]??-1,i=vt[n]<0;return i&&(vt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:vt[n]===t},Et=()=>{let e=S();return e.kind===`Step`?St(e):e.kind===`Keyword`?ti.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!M()},Dt=()=>{let e=a,t=S();return t.kind===`Operator`&&!Lr.has(t.text)&&li(t.text)?(a++,x({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:_(t)},e)):k(`MODULE`)?x({kind:`ModuleFact`,name:le(),location:_(t)},e):j()},Ot=()=>{let e=a,t=S(),n=ge(()=>{let e=S();if((e.kind!==`Identifier`||ne(e))&&e.kind!==`Operator`)throw ae(`Expected a definition name but found ${C(e)}`,e);return a++,e.text},`!`),r=_(t);return x(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},kt=()=>ge(()=>{if(r)return Ot();let t=Dt(),n=(t.kind===`Identifier`||t.kind===`Subexpression`||t.kind===`OperatorReference`)&&!di.has(t);return t.kind!==`ModuleFact`&&!n&&fi.set(t,wr(Zn(d[0].name,e),t)),t}),At=()=>{let e=oe(j);if(!e)return[];let t=[e];return E(()=>{for(;D(`,`);){let e=oe(()=>(O(),j()));if(!e)return;t.push(e)}}),t},jt=()=>{let e=r?At():Et()?ge(Dt):[],t=k(`DEF`)||k(`DEFS`);if(r&&e.length===0&&!t)throw ae(`Expected a fact`);return{facts:e,defs:t?kt():[]}},Mt=()=>{let e=a,t=O(),n=t.text===`USE`&&k(`ONLY`),r=b(e);return x({kind:t.text===`USE`?`Use`:`Hide`,isOnly:n,...jt(),keyword:r,location:_(t)},e)},Nt=()=>{let e=a,t=_(S()),n=k(`NEW`),i=r?a:e,o=r?_(S()):t,s=S().kind===`Keyword`?ni.get(S().text):void 0;if(!n&&s===void 0)throw ae(`Expected a declaration but found ${C(S())}`);if(s!==void 0&&O(),s===`Variable`){let e=ue();return x({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:o},i)}let c=pt(),l=(s??`Constant`)===`Constant`&&D(`\\in`);if(l&&c.arity>0)throw T(`declared symbol with arguments before \\in`);return l&&O(),x({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?j():void 0,nameRange:c.location.range,location:o},i)},Pt=()=>{if(S().kind===`Identifier`&&D(`::`,1)&&D(`ASSUME`,2)&&(O(),O()),D(`ASSUME`))return It();if(S().kind===`Keyword`&&ri.has(S().text))return r?se(Nt):Nt();if(!r)return j();let e=oe(j);if(e===void 0)throw ae(`Expected a hypothesis`);return e},Ft=()=>{let e=[Pt()];return E(()=>{for(;;){let t=oe(()=>(A(`,`),Pt()));if(t===void 0)break;e.push(t)}}),e},It=()=>{let e=a,t=_(A(`ASSUME`)),n=()=>{let n=r?Ft():ge(Pt);return A(`PROVE`),x({kind:`AssumeProve`,assumptions:n,conclusion:j(),location:t},e)};return r?se(n):n()},Lt=e=>{let t=0;for(;S(t).kind===`Identifier`&&D(`,`,t+1);)t+=2;return S(t).kind===`Identifier`&&D(e,t+1)},Rt=()=>{let e=S();if(D(`USE`)||D(`HIDE`))return Mt();if(!r&&D(`INSTANCE`)){let t=a;return x(ft(void 0,[],!1,_(e)),t)}if(D(`DEFINE`)||M()){let t=a;k(`DEFINE`);let n=[lt(!1)];for(;M();)n.push(lt(!1));let r={kind:`Define`,definitions:n,location:_(e)};return x(r,t)}if(k(`HAVE`))return{kind:`Have`,expression:j()};if(k(`TAKE`)){let e=_e(),t=de(e?[]:ge(ue)),n=e?be():[];return{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(k(`WITNESS`))return{kind:`Witness`,expressions:ge(()=>j())};if(k(`PICK`)){let e=Lt(`:`),t=de(e?ge(ue):[]),n=e?[]:be();return A(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:j()}}return k(`CASE`)?{kind:`Case`,expression:j()}:{kind:`Assert`,isSuffices:k(`SUFFICES`),statement:D(`ASSUME`)?It():j()}},zt=e=>{let n=S();if(n.kind!==`Step`)throw ae(`Expected a step number but found ${C(n)}`,n);if(!Tt(n))throw T(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&bt(n)<0&&Ct(n)!==void 0)throw T(`<*> and <+> cannot be used for a named step`,n);return a++,{name:Ct(n),token:n.text,location:_(n)}},Bt=()=>{let e=a,t=zt(D(`QED`,1)),n=a,r=k(`QED`)?{kind:`Qed`}:Rt(),i=b(e),o=b(n),s=wt(S());if(s&&!Wr.has(r.kind))throw T(`Proof of a step that does not take a proof`);let c=s?P():void 0;return x({...t,body:r,head:i,statement:o,proof:c},e)},Vt=e=>{if(k(`BY`)){let t=b(a-1);return{kind:`By`,isOnly:k(`ONLY`),...jt(),keyword:t,location:e}}let t=S();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;O();let n=b(a-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},N=()=>{let e=_(S());k(`PROOF`);let t=Vt(e);if(t)return t;let n=[Bt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(Bt());return{kind:`Steps`,level:yt(),steps:n,location:e}},P=()=>{let e=a;vt.push(-1);let t=N();return vt.pop(),x(t,e)},Ht=()=>S().kind===`Step`||S().kind===`Keyword`&&Ur.has(S().text),F=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Xr(e);let n=t.defs[t.defs.length-1]?.location.range;return Yr(Xr({...e,end:e.start}),Xr(n??t.keyword))},Ut=()=>{let e=a,t=_(S()),n=k(`PROOF`),r=Vt(t);if(r){let t=x(r,e);return{kind:`Leaf`,proof:t,span:Xr(t.keyword),first:e,end:a-1}}let i=S();if(i.kind!==`Step`)throw ae(`Expected a step number but found ${C(i)}`);let o=a;O();let s=a,c=k(`QED`)?{kind:`Qed`}:Rt(),l=b(o);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:b(s),span:F(l,c),first:e,start:o,end:a-1}},I=(e,t,n,r)=>{let a=e[t];if(!a)return{proof:void 0,span:r,next:t,end:void 0};if(a.kind===`Leaf`)return{proof:a.proof,span:a.span,next:t+1,end:a.end};let o=L(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={..._(i[a.first]),range:b(a.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},L=(e,t,n,r,i)=>{let a=e[t];if(!a)throw ei(`Unexpected end of (sub)proof at level ${n} before QED step`,r,$r);if(a.kind===`Leaf`)throw ei(`Expecting a proof step but found a${qr[a.proof.kind]} leaf proof`,a.span,$r);if(!i&&a.isProof)throw ei(`PROOF keyword found in step that does not begin subproof`,a.span,Qr);let o=a.token.text[1];if(o===`+`&&!i)throw ei(`<+> used but no subproof expected`,a.span,Qr);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:bt(a.token);if(s<n||!i&&s>n)return;let c=Wr.has(a.body.kind)?I(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:Ct(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{..._(a.token),range:b(a.start,l)}},d=Yr(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=L(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Yr(d,f.span)}},R=()=>{if(!Ht())return;let e=[];for(;Ht();)e.push(Ut());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=I(e,0,0,t.span),r=e[n.next];if(r)throw ei(`extra step(s) after finished proof`,r.span,Zr,`Proof.Parser.toplevel`);return n.proof},z=(e,t,n,r)=>{e.definitions.some(e=>e.name===t)||e.definitions.push({kind:`Operator`,name:t,params:[],body:n,isLocal:!1,isRecursive:!1,location:r})},Wt=()=>{if(S().kind!==`Identifier`||!D(`==`,1))return;let e=le();return O(),e},Gt=()=>{if(!r)return j();let e=te(),t=oe(j);if(t)return t;throw ae(`Expected "====" but found ${C(e)}`,e)},Kt=e=>{let t=a,n=O(),i=Wt(),o=D(`ASSUME`)?It():Gt(),s=r?R():wt(S())?P():void 0,c=x({name:i,statement:o,proof:s,location:_(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),i!==void 0&&o.kind!==`AssumeProve`&&z(e,i,o,c.location)},qt=()=>{let e=a,t=O(),n=Wt();return x({name:n,expression:j(),isAxiom:t.text===`AXIOM`,location:_(t)},e)},Jt=()=>{let e=_(A(`----`));A(`MODULE`);let t=me();A(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[],hasRecursiveLet:!1};for(d.push(n),u.push(/* @__PURE__ */ new Set),k(`EXTENDS`)&&ge(()=>{let e=a;n.extends.push(me()),n.extendsRanges.push(b(e))});;){let t=a,r=S();if(r.kind===`ModuleEnd`)return e.range={module:d[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},d.pop(),u.pop(),n;if(r.kind===`Separator`){if(D(`MODULE`,1)){let e=Jt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),A(`====`);continue}O()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=_(O()),r=ht();n.constants.push(...r),e.range=b(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=_(O()),r=ge(()=>{let e=a,t=_(S());return x({name:le(),arity:0,location:t},e)});n.variables.push(...r),e.range=b(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=qt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&z(n,e.name,e.expression,e.location);continue}case`USE`:case`HIDE`:{if(D(`USE`)&&D(`ONLY`,1))throw ae(`Expected a module unit but found ${C(r)}`);let e=Mt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=_(O()),r=gt();e.range=b(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:Yt(n,x(ft(void 0,[],!1,_(r)),t));continue;case`LOCAL`:if(O(),D(`INSTANCE`)){Yt(n,x(ft(void 0,[],!0,_(r)),t));continue}Yt(n,x(dt(!0),t));continue}r.kind===`Keyword`&&Hr.has(r.text)?Kt(n):Yt(n,lt(!1))}}},Yt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Xt=Jt(),Zt=pe?Jn(e):void 0;if(Zt!==void 0)throw new s(Zt);return Xt},gi=e=>hi(e,`tlc`),_i=(e,t)=>hi(e,`tlc`,t),vi=e=>hi(e,`tlapm`),yi=e=>hi(e,`sany`),bi=e=>{let t=0;for(let n=0;n<e.length;n++)t=Math.imul(t,31)+e.charCodeAt(n)|0;return t},xi=e=>{let t=bi(e);return t^t>>>16},Si=e=>{let t=[...new Set(e)],n=2**Math.max(4,Math.ceil(Math.log2(t.length/.75)));return t.map((e,t)=>({name:e,index:t,bucket:xi(e)&n-1})).sort((e,t)=>e.bucket-t.bucket||e.index-t.index).map(e=>e.name)},Ci=(e,t)=>{let n=JSON.stringify(t);e.some(e=>JSON.stringify(e)===n)||e.push(t)},wi=e=>e===void 0?`Unknown location`:typeof e==`string`?`In module ${e}`:e.beginLine===0&&e.beginColumn===0&&e.endLine===0&&e.endColumn===0?`In module ${e.file}`:`line ${e.beginLine}, col ${e.beginColumn} to line ${e.endLine}, col ${e.endColumn} of module ${e.file}`,Ti=e=>e?.kind===`OpAppl`&&e.nullKind===`absent`,Ei=()=>({buckets:Array.from({length:11},()=>[]),count:0,threshold:8}),Di=(e,t)=>(e&2147483647)%t,Oi=e=>{let t=e.buckets.length*2+1,n=Array.from({length:t},()=>[]);for(let r=e.buckets.length-1;r>=0;r--)e.buckets[r].forEach(e=>n[Di(e.hash,t)].unshift(e));e.buckets=n,e.threshold=Math.floor(t*.75)},ki=(e,t,n=t)=>e.buckets[Di(bi(n),e.buckets.length)].find(e=>e.key===t)?.value,Ai=(e,t,n,r=t)=>{let i=bi(r),a=e.buckets[Di(i,e.buckets.length)].find(e=>e.key===t);a?a.value=n:(e.count>=e.threshold&&Oi(e),e.buckets[Di(i,e.buckets.length)].unshift({hash:i,key:t,value:n}),e.count++)},ji=e=>e.buckets.toReversed().flatMap(e=>e.map(e=>e.value)),Mi=`\0module `,Ni=()=>({table:Ei(),symbols:[]}),Pi=e=>e.kind===`Module`?Mi+e.name:e.name,Fi=(e,t)=>{Ai(e.table,Pi(t),t,t.name),e.symbols.push(t)},Ii=e=>e.kind===`ThmOrAssumpDef`?e.params.length:e.kind===`Module`?0:e.arity,Li=(e,t)=>ki(e.table,t),Ri=(e,t)=>ki(e.table,Mi+t,t),zi=e=>e.context.symbols.filter(e=>e.kind===`OpDef`&&e.defKind===`UserDefined`),Bi=(e,t)=>ji(e.context.table).filter(e=>e.kind===`OpDecl`&&e.declKind===t).toReversed(),Vi=e=>e.context.symbols.filter(e=>e.kind===`ThmOrAssumpDef`),Hi={kind:`Local`},Ui=`$subexpression`,Wi=/* @__PURE__ */ new WeakMap,Gi=/* @__PURE__ */ new WeakMap,Ki=/* @__PURE__ */ new WeakMap,qi=/* @__PURE__ */ new WeakMap,Ji=/* @__PURE__ */ new WeakMap,Yi=/* @__PURE__ */ new WeakMap,Xi=/* @__PURE__ */ new WeakMap,Zi=/* @__PURE__ */ new WeakSet,Qi=/* @__PURE__ */ new WeakSet,$i=e=>Qi.has(e)||ta(Yi.get(e))!==void 0,ea=e=>e?.find(e=>e.isEmpty?$i(e.node):Zi.has(e.node)),ta=e=>ea(e)?.error,na=/* @__PURE__ */ new WeakMap,ra=e=>{let t=e.lastIndexOf(`@`);return t>0&&t<e.length-1},ia=new Map([...[`~>`,`-+->`,`\\cdot`,`\\X`].map(e=>[e,{key:e,arity:2,kind:`Builtin`}]),[`'`,{key:`'`,arity:1,kind:`Builtin`}]]),aa=(e,t)=>e.line<t.line||e.line===t.line&&e.column<t.column,oa=(e,t)=>aa(e,t)?-1:+!!aa(t,e),sa=e=>e.kind===`Operator`?e.params.length:0,ca=e=>e.kind===`Operator`?e.params.map(e=>e.arity):[],la=e=>e.name.includes(`!`),ua=e=>e.kind===`Function`&&!la(e)?e.bounds.length:void 0,da=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n},fa=(e,t,n)=>{let r=t.bindings.get(e);return r&&aa(r.position,t.location)&&(!n||aa(r.position,n.start))?r:void 0},pa=(e,t)=>e!==void 0&&t!==void 0&&m(e)===m(t),ma=(e,t,n,r)=>{if(t===void 0)return!0;if(pa(t.range,n.range))return!1;let i=n.range;if(i===void 0||r.isGenerated||t.kind!==`Builtin`&&!t.range)return!0;let a=m(i),o=t.range&&m(t.range);return t.kind===`Builtin`?r.errors.push({location:a,message:`Symbol ${xt(e)} is a built-in operator, and cannot be redefined.`}):n.kind===`Parameter`||t.kind!==n.kind||t.arity!==n.arity?r.errors.push({location:a,message:`Multiply-defined symbol '${xt(e)}': this definition or declaration conflicts \nwith the one at ${o}.`}):r.warnings.push({location:a,message:`Multiple declarations or definitions for symbol ${xt(e)}. \nThis duplicates the one at ${o}.`}),!1},ha=(e,t,n,r)=>ma(t,da(e,t)??fa(t,r,n.range),n,r)?{...n,name:t,parent:e}:e,ga=(e,t,n)=>{ma(e,n.bindings.get(e),t,n)&&n.bindings.set(e,{...t,position:n.location})},_a=(e,t,n,r)=>t.reduce((e,t,i)=>ha(e,t,{kind:`Parameter`,arity:0,range:n?.[i]},r),e),va=(e,t,n)=>t.reduce((e,t)=>ha(e,t.name,{kind:`Parameter`,arity:t.arity,range:t.location?.range},n),e),ya=e=>e.kind===`Name`?[e.name]:e.names,ba=e=>e.flatMap(e=>ya(e.pattern)),xa=(e,t)=>{let n=t.definitions.get(e),r=fa(e,t,void 0);return n!==void 0&&(n===t.self?n.isRecursive:n.isRecursive?r!==void 0:aa(n.location,t.location)&&(r===void 0||!aa(r.position,n.location)))?n:void 0},Sa=(e,t)=>{let n=xa(e,t);if(n){let r=n.isRecursive?t.bindings.get(e):void 0;return{key:t.getKey(n),arity:r?.arity??sa(n),params:r?.params??ca(n),kind:`Definition`,range:n.location.range,functionArity:ua(n)}}let r=fa(e,t,void 0);return r?.isPending?{key:e,arity:r.arity,params:r.params,kind:r.kind}:r?t.imported.get(e):void 0},Ca=(e,t)=>t.facts.has(e)||t.bindings.get(e)?.kind===`Theorem`,wa=(e,t)=>t.bindings.get(e)?.kind===`Theorem`?t.goals.get(e):void 0,Ta=(e,t,n)=>da(t,e)??Sa(e,n),Ea=(e,t)=>({module:e.range?.module??``,start:e,end:{line:e.line,column:e.column+t.length-1}}),Da=(e,t)=>{let n=e.kind===`OperatorReference`?void 0:e.selectorRanges?.at(-1);return n?{module:n.module,start:e.location,end:n.end}:Ea(e.location,e.spelling??t)},Oa=e=>{if(!(e.kind!==`Apply`||e.argumentsRange)){if(e.args.length===2)return`infix`;if(e.args.length===1)return e.operator===`-.`?`prefix`:`postfix`}},ka=`In module --TLA+ BUILTINS--`,Aa=/* @__PURE__ */ new Set([`Definition`,`Instance`,`Theorem`]),ja=(e,t,n)=>n.errors.push({location:m(t),message:`Cannot take subexpression of \`${xt(e)}'.`}),Ma=e=>!/^[\p{L}\d_]/u.test(e),Na=e=>e.startsWith(`<`)&&(e[1]>=`0`&&e[1]<=`9`||e[1]===`*`),Pa=(e,t)=>typeof e==`number`?e>=1&&e<=t?e-1:-1:e===`<<`?t>0?0:-1:t===2?1:-1,Fa=(e,t,n)=>{let r=e.split(`!`),i=n??r.map((e,n)=>n===r.length-1?t.length:0);return r.map((e,n)=>{let r=i.slice(0,n).reduce((e,t)=>e+t,0);return{kind:`Name`,name:e,args:t.slice(r,r+i[n])}})},Ia=e=>e.kind===`Subexpression`?e.selectors:e.kind===`Identifier`?Fa(e.name,[],void 0):Fa(e.operator,e.args,e.argumentCounts),La=e=>e.filter((t,n)=>n===0||e[n-1].set!==t.set).map(e=>e.set),Ra=e=>{switch(e.kind){case`Forall`:case`Exists`:case`FunctionConstruction`:return{names:ba(e.bounds),body:e.body,sets:La(e.bounds)};case`SetMap`:return{names:ba(e.bounds),body:e.expression,sets:La(e.bounds)};case`SetFilter`:return{names:ya(e.bound.pattern),body:e.predicate,sets:[e.bound.set]};case`Choose`:return{names:ya(e.pattern),body:e.body,sets:e.set?[e.set]:[]};case`UnboundedQuantifier`:case`Lambda`:return{names:e.kind===`Lambda`?e.params:e.names,body:e.body,sets:[]};default:return}},za=e=>{switch(e.kind){case`Apply`:return e.args;case`And`:case`Or`:return e.operands;case`If`:return[e.condition,e.consequent,e.alternative];case`Tuple`:case`SetEnumeration`:return e.elements;case`Record`:case`RecordSet`:return e.fields.map(e=>e.value);case`FunctionApplication`:return[e.function,e.args.length===1?e.args[0]:{kind:`Tuple`,elements:e.args,location:e.location}];case`FieldAccess`:return[e.record,{kind:`String`,value:e.field,location:e.location}];case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`Selection`:return[e.expression];case`BoxAction`:case`AngleAction`:return[e.action,e.subscript];case`WeakFairness`:case`StrongFairness`:return[e.subscript,e.action];case`FunctionSet`:return[e.domain,e.range];case`Product`:return e.factors;case`Except`:return[e.function];default:return}},Ba=e=>e.kind===`Identifier`||e.kind===`Apply`||e.kind===`Subexpression`,Va=(e,t)=>e.assumptions.slice(0,t).some(e=>e.kind===`NewSymbol`),Ha=(e,t)=>{if(e.kind===`Label`)return e.name===t?e:void 0;if(e.kind===`Lambda`||e.kind===`Selection`)return;if(e.kind===`Let`)return Ha(e.body,t);let n=Xi.get(e);if(!(e.kind===`Apply`&&n===void 0&&$i(e)))return e.kind===`FunctionApplication`&&$i(e)?Ha(e.function,t):gt(e).slice(0,n).reduce((e,n)=>e??Ha(n,t),void 0)},Ua=(e,t,n)=>{if(e.kind===`AssumeProve`)return[...e.assumptions,e.conclusion].reduce((r,i,a)=>r??Ua(i,t,n||Va(e,a)),void 0);if(!n)return e.kind===`NewSymbol`?e.set&&Ha(e.set,t):Ha(e,t)},Wa=e=>e.kind===`Label`?Wa(e.body):e,Ga=e=>typeof e==`number`?`argument selector ${e}`:e,Ka=`within the scope of a declaration
|
|
343
|
+
from outside that declaration's scope.`,qa=(e,t,n,r,i)=>{let a=(t,n)=>{let i=(t===void 0?void 0:e.selectorRanges?.[t])??e.location.range;i&&r.errors.push({location:m(i),message:n})},o=n.isSuffices===n.isInProof,s=n.statement,c={node:s,isGoal:!0,isSufficesOpen:n.isSuffices},l=0,u=0;for(let[e,n]of t.slice(1).entries()){let r=e+1,i=c.node;if(n.kind===`Name`){if(t[r-1].kind!==`Name`)return i.kind!==`NewSymbol`&&i.kind!==`AssumeProve`&&Wa(i).kind===`Let`?i:a(r-1,`A name selector here must be from a LET clause.`);let e=s.kind===`AssumeProve`?[...s.assumptions,s.conclusion]:[s],l=r===1?e.map((e,t)=>({position:t,label:Ua(e,n.name,!1)})).find(e=>e.label!==void 0):{position:0,label:i.kind===`Label`?Ha(i.body,n.name):void 0};if(!l?.label)return a(r,`Cannot find label \`${n.name}'.`);if(r===1&&s.kind===`AssumeProve`&&Va(s,l.position)&&o)return a(1,`Accessing subexpression labeled \`${n.name}' of ASSUME/PROVE clause ${Ka}`);if(n.args.length!==l.label.params.length)return a(r,`Label \`${n.name}' used with wrong number of arguments.`);c.node=l.label,c.isGoal=!1,c.isSufficesOpen=!1;continue}if(n.kind===`Colon`){if(t[r-1].kind!==`Name`)return a(r-1,`!: should not follow an operand selector.`);let e=t[r+1];if(e===void 0?r!==1:e.kind!==`Name`)return a(r,`\`!:' can be used only after a name and either at the end after an
|
|
344
|
+
operator name or before an operator name.`);continue}let d=n.kind===`Operand`?Ga(n.operand):n.kind===`At`?`@`:`!(...)`,f=e=>n.kind===`Operand`?Pa(n.operand,e):-1,p=`An unexpected null node specified by '${d}'.\nThis is probably due to a previous error.`;if(c.isSufficesOpen){if(f(1)!==0)return a(r,i.kind===`AssumeProve`?`Accessing non-existent subexpression of a SUFFICES`:`Nonexistent operand specified by \`${d}'.`);c.isSufficesOpen=!1;continue}if(i.kind===`NewSymbol`)return i;if(i.kind!==`AssumeProve`){let e=Wa(i);if(Zi.has(e))return a(r,`Subexpression selection failed, probably due to an error in the selected expression.`);if([`Number`,`Decimal`,`String`].includes(e.kind))return a(r,`Selecting subexpression of expression that has none.`);if($i(e))return a(r,`Choosing operand \`${d}' of subexpression with no operands.`);let t=Ra(e);if(t&&n.kind!==`Operand`){let e=n.kind===`Bound`?n.args.length:0;if(n.kind===`Bound`&&e!==t.names.length)return a(r,`Selector with ${e} argument(s) used for quantifier with ${t.names.length} bound identifier(s).`);l+=t.names.length,u+=e,c.node=t.body,c.isGoal=!1;continue}let o=t?.sets,s=e.kind===`Identifier`?[]:o?o.length>0?o:void 0:za(e);if(!s)return i;let m=e.kind===`Except`,h=f(m?e.updates.length+1:s.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(m&&h>0)return a(r,`Selecting subexpression of an EXCEPT not yet implemented.`);if(c.node=s[h],c.isGoal=!1,Zi.has(c.node))return a(r,p);continue}let m=[...i.assumptions,i.conclusion],h=f(m.length);if(h===-1)return a(r,`Nonexistent operand specified by \`${d}'.`);if(Va(i,h)&&(!c.isGoal||o))return a(r,`Accessing ASSUME/PROVE clause ${Ka}`);let g=m[h];if(g.kind===`NewSymbol`&&r!==t.length-1)return a(r,`Selected a subexpression of a NEW clause of an ASSUME.`);if(c.node=g,c.isGoal=!1,g.kind!==`NewSymbol`&&g.kind!==`AssumeProve`&&Zi.has(g))return a(r,p)}return c.node.kind===`AssumeProve`?i?c.node:a(void 0,`Selected ASSUME/PROVE instead of expression.`):c.node.kind===`NewSymbol`?i?c.node:a(void 0,`Selected a NEW declaration as an expression or operator.`):l===u?c.node:a(void 0,`Expected ${l} arguments but found ${u}.`)},Ja=(e,t)=>{let n=t.isGenerated?void 0:t.hasLabelScope?t.isLabelForbidden?`Label not allowed within scope of declaration in nested ASSUME/PROVE.`:t.isInExcept?`Labels inside EXCEPT clauses are not yet implemented.`:void 0:`Label not in definition or proof step.`;return n===void 0||!e.location.range?!1:(t.errors.push({location:m(e.location.range),message:n}),!0)},Ya=(e,t,n)=>{let r=e.location.range;if(!r||n.isGenerated)return;let i=m(r),a=e.params.filter((r,i)=>{let a=da(t,r)?.kind===`Parameter`,o=e.paramRanges?.[i];return!a&&o&&n.errors.push({location:m(o),message:`Illegal parameter ${r} of label \`${e.name}'.`}),a});a.filter((e,t)=>a.indexOf(e)!==t).forEach(t=>n.errors.push({location:i,message:`Repeated formal parameter ${t} \nin label \`${e.name}'.`})),n.labelParams.filter(e=>!a.includes(e)).forEach(t=>n.errors.push({location:i,message:`Label ${e.name} must contain formal parameter \`${t}'.`}));let o=[...new Set(a.filter(e=>!n.labelParams.includes(e))),...e.params.filter(e=>!a.includes(e))];o.length>0&&n.errors.push({location:i,message:`Label ${e.name} declares extra parameter(s) ${o.map(e=>`${e} `).join(``)}`}),n.labels.has(e.name)&&n.errors.push({location:i,message:`Duplicate label \`${e.name}'.`}),n.labels.add(e.name)},Xa=(e,t,n,r)=>{if(!Ba(e))return!1;let i=Ia(e),a=i[0],o=i.length>1&&a.kind===`Name`?da(t,a.name)?.goal??wa(a.name,n):void 0;return o&&{node:qa(e,i,o,n,r)}},Za=(e,t,n)=>{let r=da(t,e)??fa(e,n,void 0);return r?r.kind===`Instance`:io(e,t,n)!==void 0&&[...n.bindings.keys()].some(t=>t.startsWith(`${e}!`))},Qa=(e,t,n,r)=>{let i=e.location;if(mo(e,n,r))return;let a=na.get(e);if(a!==void 0)return a;if(ra(t))return e.kind===`Apply`?e.args.length:0;let o=da(n,t);if(o?.nonFactStep){r.errors.push({location:m(Da(e,t)),message:`Step number of non-expression step used as an expression.`});return}let s=o?.goal?.keyword;if(s){r.errors.push({location:m(Da(e,t)),message:`${s} proof step selected instead of expression.`});return}if(Xa(e,n,r,!1)||Na(t)&&o)return e.kind===`Apply`?e.args.length:0;if(Za(t,n,r)){let i=da(n,t)??fa(t,r,void 0),a=e.kind===`Apply`?e.args.length:0;if(i?.kind===`Instance`&&i.arity!==a){r.errors.push({location:m(e.kind===`Apply`&&e.argumentsRange||Da(e,t)),message:`The operator ${t} requires ${i.arity} arguments.`});return}let o=Da(e,t);r.errors.push({location:m({...o,start:{line:o.end.line,column:o.end.column-t.slice(t.lastIndexOf(`!`)+1).length+1}}),message:`Operator name ${t} is incomplete.`});return}if(o&&e.kind!==`OperatorReference`&&(e.resolution=Hi),o)return o.arity;if(wa(t,r)?.statement.kind===`AssumeProve`)return 0;let c=Sa(t,r);if(c)return e.kind===`Identifier`?e.name=c.key:e.operator=c.key,na.set(e,c.arity),c.arity;let l=t.includes(`!`)?t.slice(0,t.indexOf(`!`)):``,u=l===``?void 0:da(n,l)??Sa(l,r);if(u&&(!Aa.has(u.kind)||da(n,l)?.nonFactStep)){ja(l,e.kind!==`OperatorReference`&&e.selectorRanges?.[0]||Da(e,t),r);return}if(e.kind!==`OperatorReference`&&l!==``&&go(l,e.kind===`Apply`&&e.argumentCounts?e.args.slice(0,e.argumentCounts[0]):[],e.selectorRanges?.[0],(e.kind===`Apply`?e.argumentRanges?.[0]:void 0)??i.range,n,r))return;if(u||l!==``&&Ca(l,r))return e.kind===`Apply`?e.args.length:0;let d=Oa(e),f=e.kind===`OperatorReference`||d!==void 0;if(!Ma(t)||Na(t)||!f){r.errors.push({location:m(Da(e,t)),message:`Unknown operator: \`${xt(t)}'.`});return}let p=e.spelling??t;r.errors.push({location:m(d===`prefix`&&p===`-.`?Ea(i,`-`):Da(e,t)),message:`Could not find declaration or definition of symbol '${p}'.`}),d&&Zi.add(e),d&&i.range&&r.errors.push({location:m(i.range),message:`Couldn't resolve ${d} operator symbol \`${p}'.`})},$a=(e,t,n)=>(e.forEach(e=>H(e.set,t,n)),e.reduce((e,t)=>_a(e,ya(t.pattern),t.pattern.ranges,n),t)),eo=(e,t)=>e.kind===`Identifier`&&e.name===t&&M(e)||gt(e).some(e=>eo(e,t)),to=(e,t)=>{e.kind===`FunctionConstruction`&&eo(e.body,t)&&(e.isRecursive=!0),gt(e).forEach(e=>to(e,t))},no=(e,t,n,r)=>{let i={...n,hasLabelScope:!0,labelParams:e.kind===`Function`?ba(e.bounds):[],labels:/* @__PURE__ */ new Set},a=e.name,o=e.location.range,s=e=>{o&&!i.isGenerated&&i.errors.push({location:m(o),message:e})},c=e.kind===`Function`?$a(e.bounds,t,i):va(t,e.params,i),l=da(c,a)??fa(a,i,o),u=l?.isPending===!0&&r.has(l);return l?.isPending&&!u?s(`Recursive ${e.kind===`Function`?`function`:`operator`} ${xt(a)} defined at wrong LET/IN level.`):l&&!u?s(e.kind===`Function`?`Function name \`${a}' already defined or declared.`:`Operator ${xt(a)} already defined or declared.`):l&&e.kind===`Function`&&l.arity>0?s(`Function ${xt(a)} has operator arguments in its RECURSIVE declaration.`):l&&e.kind===`Operator`&&(l.arity!==e.params.length||e.params.some(e=>e.arity>0))&&s(`Definition of ${xt(a)} has different arity than its RECURSIVE declaration.`),l&&u&&e.kind===`Operator`&&(l.params=ca(e)),e.kind===`Function`?(H(e.body,{name:a,kind:`Parameter`,arity:0,range:o,parent:c},i),to(e.body,a),e.isSelfReferential=eo(e.body,a)):H(e.body,c,i),l&&u?((e.kind===`Operator`||l.arity===0)&&(l.isPending=!1,l.range=o),!1):e.kind===`Function`?l===void 0:ma(a,da(t,a)??fa(a,i,o),{kind:`Definition`,arity:sa(e),range:o},i)},ro=(e,t,n,r=[],i=[])=>{let a=/* @__PURE__ */ new Set,o=e.filter(e=>e.isRecursive&&i.every(t=>t.name!==e.name)).reduce((e,t)=>{if(da(e,t.name)?.isPending)return e;let n={name:t.name,arity:sa(t),params:ca(t),kind:`Definition`,parent:e,isPending:!0};return a.add(n),n},t),s=/* @__PURE__ */ new Map,c=(e,t)=>{let r={kind:`Definition`,arity:t.arity,params:Array(t.arity).fill(0),range:t.location.range},i=ma(t.name,da(e,t.name)??fa(t.name,n,r.range),r,n)?{...r,name:t.name,parent:e,isPending:!0}:void 0;return i&&a.add(i),s.set(t,i),i??e},l=[...n.isGenerated?[]:r,...i].toSorted((e,t)=>oa(e.location,t.location)),u=(e,t)=>{let r=l.findIndex(e=>!t(e));return l.splice(0,r===-1?l.length:r).reduce((e,t)=>`kind`in t?ko(t,e,n):c(e,t),e)},d=u(e.reduce((e,t)=>{let i=ra(t.name)?e:u(e,e=>!aa(t.location,e.location)),o={name:t.name,arity:sa(t),kind:`Definition`,range:t.location.range,parent:i,functionArity:ua(t)};if(la(t))return{...o,params:ca(t),functionArity:da(i,t.name)?.functionArity};let s=r.some(e=>e.location===t.location),c=n.isGenerated||t.isLocal||ra(t.name),l=s?{...n,isGenerated:!0,errors:[],warnings:[]}:c?{...n,isGenerated:c}:n;return no(t,i,l,a)?{...o,params:ca(t)}:i},o),()=>!0);return s.forEach((e,t)=>{let r=t.location.range;r&&!n.isGenerated&&(!e||e.isPending)&&n.errors.push({location:m(r),message:`Symbol ${xt(t.name)} declared in RECURSIVE statement but not defined.`})}),d},io=(e,t,n)=>{let r=e.split(`!`)[0],i=r===e?void 0:da(t,r)??fa(r,n,void 0);return i?.kind===`Instance`?{name:r,arity:i.arity,range:i.range}:void 0},ao=(e,t,n)=>{if(!Ba(e))return!1;let r=Ia(e),i=r.findIndex(e=>e.kind!==`Name`),a=io(r.slice(0,i===-1?r.length:i).flatMap(e=>e.kind===`Name`?[e.name]:[]).join(`!`),t,n),o=r[0],s=o.kind===`Name`?o.args.length:0;if(!a||s===a.arity)return!1;let c=(e.kind===`Identifier`?void 0:e.argumentRanges?.[0])??e.location.range;return c&&n.errors.push({location:m(c),message:`The operator ${a.name} requires ${a.arity} arguments.`}),!0},oo=(e,t,n,r,i)=>{let a=e?.kind===`Definition`?e.params:void 0;return!e||!a||a.length===e.arity?!1:(r&&!i.isGenerated&&i.errors.push({location:m(r),message:`Wrong number of arguments (${n}) given to operator '${xt(t)}', \nwhich requires ${a.length} arguments.`}),!0)},so=(e,t,n)=>{let r=e.location.range,i=e=>{r&&n.errors.push({location:m(r),message:e})},a=Ki.get(e);if(e.kind===`Lambda`&&e.operator!==void 0)i(`The operator ${xt(e.operator)} requires 1 arguments.`);else if(a)n.errors.push(a);else if(e.kind===`Lambda`&&r)Zi.add(e),i(`LAMBDA expression used where an expression is required.`);else if(e.kind===`OperatorReference`){let r=Qa(e,e.operator,t,n);r!==void 0&&i(`The operator ${xt(e.operator)} requires ${r} arguments.`)}else H(e,t,n)},co=e=>{let t=e.kind===`Subexpression`||e.kind===`Apply`&&e.argumentCounts?.at(-1)===0?Ia(e):[],n=t.findIndex(e=>`args`in e&&e.args.length>0);if(n===-1||!Ba(e))return;let r=t[n];return{index:n,range:e.selectorRanges?.[n],message:`Selector \`${r.kind===`Name`?r.name:`!(...)`}' should not have argument(s).`}},lo=(e,t,n,r,i,a,o)=>{let s=(e,t)=>{e&&o.errors.push({location:m(e),message:t})},c=(e,c)=>{let l=io(r,a,o)?.range??Ta(r,a,o)?.range;l&&s(i,`Operator with incorrect arity passed as argument. \nOperator '${xt(e)}' of arity ${c} is argument number ${n+1} (counting from 1) to operator \`${m(l)}', \nbut an operator of arity ${t} was expected.`)},l=e.location.range;if(t===0)return so(e,a,o),!0;let u=di.get(e);if(u)return s(u,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let d=Wi.get(e)??e,f=co(d);if(f)return s(f.range,f.message),!1;if(e.kind===`Lambda`){if(Wi.has(e)?H(e,a,o):ho(e,a,o),ta(Yi.get(e)))return!1;let u=e.params.length===t;return!u&&Wi.has(e)?s(l,`Expected arity ${t} but found operator of arity ${e.params.length}.`):!u&&l&&e.operator===void 0?s(i,`Lambda expression with arity ${e.params.length} used as argument ${n+1} of operator \`${r}', \nbut an operator of arity ${t} is required.`):!u&&e.operator!==void 0&&c(e.operator,e.params.length),u}if(d!==e){let n=ta(Yi.get(e));return n&&o.errors.push(n),n||s(d.location.range,`Expected arity ${t} but found operator of arity 0.`),!1}if(e.kind===`Subexpression`)return H(e,a,o),!1;if(e.kind!==`Identifier`&&e.kind!==`OperatorReference`)return s(l,`An expression appears as argument number ${n+1} (counting from 1) to operator '${r}', in a position an operator is required.`),!1;let p=e.kind===`Identifier`?e.name:e.operator,h=Ta(p,a,o)?.params??[],g=Qa(e,p,a,o);return e.kind===`Identifier`&&g!==void 0&&g!==t&&s(Da(e,p),`Expected arity ${t} but found operator of arity ${g}.`),e.kind===`OperatorReference`&&g!==void 0&&g!==t&&c(p,g),g===t&&h.every(e=>e===0)},uo=(e,t,n)=>{let r=e.operator,i=Ta(r,t,n),a=ao(e,t,n)?void 0:Qa(e,r,t,n);if(a!==void 0&&a!==e.args.length&&n.errors.push({location:m(e.argumentsRange??Da(e,r)),message:`The operator ${xt(r)} requires ${a-(io(r,t,n)?.arity??0)} arguments.`}),a!==e.args.length){Qi.add(e);return}let o=i&&(i.kind===`Definition`?i.params:e.args.map(()=>0));if(o===void 0){e.args.forEach(e=>fo(e,t,n));return}let s=e.selectorRanges?.at(-1)??Da(e,r),c=r===Ui,l=e.args.slice(0,o.length).map((e,i)=>{let a=c?Ji.get(e):void 0;return lo(e,o[i],a?.index??i,a?.operator??r,a?.range??s,t,c?{...n,isGenerated:!1}:n)});oo(i,r,e.args.length,e.location.range,n)||l.forEach((t,i)=>{!t&&e.location.range&&n.errors.push({location:m(e.location.range),message:`Argument number ${i+1} to operator '${c?`LAMBDA`:r}' \nshould be a ${o[i]}-parameter operator.`})})},fo=(e,t,n)=>{e.kind===`Identifier`?Qa(e,e.name,t,n):H(e,t,n)},po=(e,t,n)=>e.forEach(e=>e.args.slice(0,e.params.length).forEach((r,i)=>lo(r,e.params[i],i,e.operator,e.range,t,n))),mo=(e,t,n)=>{let r=Gi.get(e);return r?(po(r.applications,t,n),n.errors.push(ta(r.nulls)??r.error),!0):!1},ho=(e,t,n)=>H(e.body,_a(t,e.params,e.paramRanges,n),{...n,labelParams:[...n.labelParams,...e.params]}),H=(e,t,n)=>{if(Wi.has(e)&&!n.isGenerated){let r=ea(Yi.get(e));if(r){po(r.applications,t,n),n.errors.push(r.error);return}H(e,t,{...n,isGenerated:!0});return}let r=e=>e.forEach(e=>H(e,t,n)),i=e=>({...n,labelParams:[...n.labelParams,...e]});switch(e.kind){case`Number`:case`Decimal`:case`String`:return;case`ExceptAt`:!n.isInExcept&&e.location.range&&(Qi.add(e),n.errors.push({location:m(e.location.range),message:`@ used where its meaning is not defined.`}));return;case`Identifier`:{let r=e.name,i=ao(e,t,n)?void 0:Qa(e,r,t,n);if(i===0){let i=Ta(r,t,n),a=i?.kind;(a===`Variable`||a===`Theorem`||a?.startsWith(`New`)||Ca(r,n))&&Qi.add(e);let o=da(t,r);if((o?o.goal:wa(r,n))?.statement.kind===`AssumeProve`){n.errors.push({location:m(Da(e,r)),message:`ASSUME/PROVE used where an expression is required.`});return}oo(i,r,0,Da(e,r),n);return}i!==void 0&&n.errors.push({location:m(Da(e,r)),message:`The operator ${xt(r)} requires ${i} arguments.`}),Qi.add(e);return}case`OperatorReference`:Qa(e,e.operator,t,n);return;case`Apply`:uo(e,t,n);return;case`Lambda`:Wi.has(e)?ho(e,t,n):e.location.range&&(Zi.add(e),n.errors.push({location:m(e.location.range),message:`LAMBDA expression used where an expression is required.`}));return;case`And`:case`Or`:r(e.operands);return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:H(e.expression,t,n);return;case`If`:r([e.condition,e.consequent,e.alternative]);return;case`Case`:r(e.arms.flatMap(e=>[e.condition,e.body])),e.other&&H(e.other,t,n);return;case`Let`:H(e.body,ro(e.definitions,t,n,e.instances,e.recursive),n);return;case`Forall`:case`Exists`:case`FunctionConstruction`:H(e.body,$a(e.bounds,t,n),i(ba(e.bounds)));return;case`UnboundedQuantifier`:H(e.body,_a(t,e.names,e.nameRanges,n),i(e.names));return;case`Choose`:e.set&&H(e.set,t,n),H(e.body,_a(t,ya(e.pattern),e.pattern.ranges,n),i(ya(e.pattern)));return;case`SetEnumeration`:case`Tuple`:r(e.elements);return;case`SetFilter`:H(e.predicate,$a([e.bound],t,n),i(ya(e.bound.pattern)));return;case`SetMap`:H(e.expression,$a(e.bounds,t,n),i(ba(e.bounds)));return;case`FunctionSet`:r([e.domain,e.range]);return;case`Record`:case`RecordSet`:e.fields.forEach((r,i)=>{e.fields.slice(0,i).some(e=>e.name===r.name)&&n.errors.push({location:m(r.location.range??Ea(r.location,r.name)),message:`Non-unique fields in constructor.`}),H(r.value,t,n)});return;case`Except`:H(e.function,t,n),e.updates.forEach(e=>{r(e.path.flatMap(e=>e.kind===`Index`?e.args:[])),H(e.value,t,{...n,isInExcept:!0})});return;case`FunctionApplication`:{let i=e.function,a=i.kind===`Identifier`?i.name:i.kind===`Apply`?i.operator:void 0,o=a===void 0?void 0:Ta(a,t,n)?.functionArity;H(i,t,n);let s=e.args.length;if(o===void 0||s<2||o===s||$i(i)){r(e.args);return}Qi.add(e),e.location.range&&n.errors.push({location:m(e.location.range),message:`Function '${a}' is defined with ${o} parameters, but is applied to ${s} arguments.`});return}case`FieldAccess`:H(e.record,t,n);return;case`Product`:r(e.factors);return;case`BoxAction`:case`AngleAction`:r([e.action,e.subscript]);return;case`WeakFairness`:case`StrongFairness`:r([e.subscript,e.action]);return;case`Label`:if(Ja(e,n))return;H(e.body,t,{...n,labelParams:[],labels:/* @__PURE__ */ new Set}),Ya(e,t,n);return;case`Subexpression`:_o(e,t,n)&&Qi.add(e);return;case`Selection`:return}},go=(e,t,n,r,i,a)=>{let o=da(i,e)??fa(e,a,void 0);return!o?.isPending||!n||!r?!1:t.length===o.arity?(t.forEach(e=>H(e,i,a)),a.errors.push({location:m(n),message:`Subexpression of \`${e}' used inside the operator's definition.`}),!0):(a.errors.push({location:m(r),message:`The operator ${e} requires ${o.arity} arguments.`}),!0)},_o=(e,t,n)=>{if(ao(e,t,n)||mo(e,t,n))return!0;let r=e.selectors[0],i=e.selectorRanges?.[0],a=e.selectors.findIndex(e=>e.kind!==`Name`),o=e.selectors.slice(0,a).flatMap(e=>e.kind===`Name`?[e.name]:[]),s=o.findIndex((e,t)=>t>0&&(Sa(o.slice(0,t+1).join(`!`),n)?.kind??`Instance`)!==`Instance`),c=o.length>1&&(da(t,o[0])??fa(o[0],n,void 0))?.kind===`Instance`,l=e.selectorRanges?.[a-1];if(c&&s===-1&&i&&l)return n.errors.push({location:m({module:i.module,start:i.start,end:l.end}),message:`Unknown operator: \`${xt(o.join(`!`))}'.`}),!0;let u=o.slice(0,s+1).join(`!`),d=s>0?Sa(u,n):void 0,f=e.selectors.slice(0,s+1).flatMap(e=>`args`in e?e.args:[]).length,p=e.argumentRanges?.[s]??e.location.range;if(d&&d.arity!==f&&p)return n.errors.push({location:m(p),message:`The operator ${xt(u)} requires ${d.arity} arguments.`}),!0;if(r.kind===`Name`&&e.selectors[1].kind!==`Name`&&i){let e=da(t,r.name),a=e??Sa(r.name,n);if(a===void 0&&!Ca(r.name,n)||a?.kind===`Instance`)return n.errors.push({location:m(i),message:`Unknown operator: \`${xt(r.name)}'.`}),!0;if(a&&(!Aa.has(a.kind)||e?.nonFactStep))return ja(r.name,i,n),!0}if(r.kind===`Name`&&go(r.name,r.args,i,e.argumentRanges?.[0]??e.location.range,t,n))return!0;e.selectors.flatMap(e=>`args`in e?e.args:[]).forEach(e=>fo(e,t,n));let h=Xa(e,t,n,!1);return h?h.node===void 0:!1},vo=(e,t)=>{let n=e.location.range;!t.isModuleKnown(e.name,e.location)&&n&&t.errors.push({location:m({...n,start:{line:n.end.line,column:n.end.column-e.name.length+1}}),message:`Module \`${e.name}' used without being extended or instantiated.`})},yo=(e,t,n,r)=>{if(e.kind===`ModuleFact`){vo(e,r);return}if(e.kind===`ExceptAt`&&e.location.range)return r.errors.push({location:m(e.location.range),message:"Unknown operator: `@'."}),ka;let i=Co(e,t,n,r);if(Wi.has(e))return H(e,n,r),i;if(ao(e,n,r))return i;let a=Xa(e,n,r,!0);if(a){let t=a.node?.kind;return t===void 0?ka:t===`AssumeProve`||t===`NewSymbol`?void 0:e.location.range&&m(e.location.range)}if(e.kind===`Subexpression`)return _o(e,n,r)?ka:i;let o=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:``;return e.kind===`Identifier`&&da(n,o)?.nonFactStep?(r.errors.push({location:m(Da(e,o)),message:`Step number of non-fact used as a fact`}),ka):(Ca(o,r)||da(n,o)?.goal||e.kind===`Identifier`&&Za(o,n,r)||H(e,n,r),i)},bo=(e,t,n)=>{if(e.kind===`ModuleFact`)return vo(e,n),n.isModuleKnown(e.name,e.location);let r=fi.get(e)??[];if(n.errors.push(...r.map(e=>({location:wi(e.location),message:e.message}))),r.length>0)return!1;let i=pi(e),a=i??Wi.get(e)??e,o=a.location.range;if(!o)return!0;let s=a.kind===`Identifier`?a.name:a.kind===`Apply`||a.kind===`OperatorReference`?a.operator:``,c=da(t,s),l=c??Sa(s,n)??fa(s,n,o);return l===void 0&&Ca(s,n)||(Ba(a)&&Ia(a).length>1&&(l===void 0||co(a))?So(e,a,t,n):s===``||xo(s,c,l,o,n))?!0:(n.errors.push({location:m((i?e:a).location.range??o),message:`DEF clause entry should describe a defined operator.`}),!1)},xo=(e,t,n,r,i)=>(n===void 0&&i.errors.push({location:m(r),message:`Unknown operator: \`${xt(e)}'.`}),t?.nonFactStep===`Define`||(t?.nonFactStep&&i.errors.push({location:m(r),message:`DEF clause entry refers to a non-definition step.`}),n!==void 0&&Aa.has(n.kind)&&!Na(e))),So=(e,t,n,r)=>{let i=(e,t)=>(e&&r.errors.push({location:m(e),message:t}),!1),a=co(t);if(a?.index===0)return i(a.range,a.message);let o=Ia(t),s=t.selectorRanges,c=Gi.get(e);if(!c&&!Wi.has(e)){let e=o[0],c=e.kind===`Name`?e.name:``,l=da(n,c),u=l??Sa(c,r);if(u&&(!Aa.has(u.kind)||l?.nonFactStep)&&s?.[0])return ja(c,s[0],r),!1;if(a)return i(a.range,a.message);if(Xa(t,n,r,!1))return!1;let d=s?.[0],f=s?.[o.findLastIndex(e=>e.kind===`Name`)],p=o.flatMap(e=>e.kind===`Name`?[e.name]:[]);return i(d&&f&&{...d,end:f.end},`Unknown operator: \`${xt(p.join(`!`))}'.`)}if(a)return i(a.range,a.message);let l=c?ta(c.nulls)??c.error:ta(Yi.get(e));return l?(r.errors.push(l),!1):o.at(-1)?.kind===`Name`&&o.at(-2)?.kind!==`Name`},Co=(e,t,n,r)=>{let i=e.location.range&&m(e.location.range);if(Wi.has(e))return ta(Yi.get(e))?ka:t.location.range&&m(t.location.range);if(Gi.has(e)||e.kind===`ExceptAt`)return ka;switch(e.kind){case`Number`:case`String`:case`Decimal`:case`Let`:case`Label`:return;case`Identifier`:case`Apply`:case`Subexpression`:{let t=Ia(e)[0];if(e.kind===`Subexpression`||t.kind!==`Name`)return;let a=e.kind===`Identifier`?e.name:e.operator,o=da(n,t.name)?.goal??wa(t.name,r);if(Ca(a,r)||o||Na(a)&&da(n,a)||e.kind===`Identifier`&&Za(a,n,r))return;let s=Ta(a,n,r),c=e.kind===`Apply`?e.args.length:0;return s?.arity===c?i:ka}default:return i}},wo=(e,t,n)=>{let r=qi.get(e.facts)??e.facts,i=e.facts.map((e,i)=>yo(e,r[i],t,n)),a=e.facts.filter(e=>e.kind!==`ModuleFact`||n.isModuleKnown(e.name,e.location)).length,o=e.defs.filter(e=>bo(e,t,n)).length;i.forEach(t=>{t&&e.kind===`Hide`&&n.errors.push({location:t,message:`The only expression allowed as a fact in a HIDE is
|
|
345
|
+
the name of a theorem, assumption, or step.`})});let s=e.location.range;a+o===0&&s&&n.errors.push({location:m(s),message:e.kind===`By`?`Empty BY`:`Empty USE or HIDE statement.`})},To=(e,t,n)=>(e.set&&H(e.set,t,n),ha(t,e.name,{kind:`New${e.level}`,arity:e.arity,range:e.nameRange},n)),Eo=(e,t,n,r=!1)=>{let i=e.assumptions.reduce((e,t)=>t.kind===`NewSymbol`?{scope:To(t,e.scope,e.unit),unit:r?{...e.unit,isLabelForbidden:!0}:e.unit}:(t.kind===`AssumeProve`?Eo(t,e.scope,e.unit,!0):H(t,e.scope,e.unit),e),{scope:t,unit:n});return H(e.conclusion,i.scope,i.unit),i.scope},Do=(e,t,n)=>e.kind===`AssumeProve`?Eo(e,t,n):(H(e,t,n),t),Oo=(e,t,n)=>{let r=n.hasLabelScope?{...n,hasLabelScope:!1}:n;e?.kind===`By`&&wo(e,t,r),e?.kind===`Steps`&&e.steps.reduce((e,t)=>jo(t,e,r),t)},ko=(e,t,n)=>{let r=Lo(e,t,n);return e.name===void 0?r:ha(r,e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)},Ao=(e,t)=>{let n=(e,t)=>({statement:t,isSuffices:!1,isInProof:!1,keyword:e});switch(e.kind){case`Have`:return n(`HAVE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Case`:return n(`CASE`,{kind:`Tuple`,elements:[e.expression],location:t});case`Witness`:return n(`WITNESS`,{kind:`Tuple`,elements:e.expressions,location:t});case`Take`:return n(`TAKE`,{kind:`Tuple`,elements:La(e.bounds),location:t});case`Pick`:return n(`PICK`,e.bounds.length>0?{kind:`Exists`,bounds:e.bounds,body:e.body,location:t}:{kind:`UnboundedQuantifier`,quantifier:`Exists`,names:e.names,body:e.body,location:t});case`Qed`:return n(`QED step`,{kind:`Tuple`,elements:[],location:t});default:return}},jo=(e,t,n)=>{let r=e.body,i=e.name===void 0?n:{...n,hasLabelScope:!0,labelParams:[],labels:/* @__PURE__ */ new Set},a=Ao(r,e.location),o=t=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,goal:a},s=(t,n)=>e.name===void 0?t:{name:e.name,arity:0,kind:`Theorem`,parent:t,nonFactStep:n};switch(r.kind){case`Assert`:{let a=Do(r.statement,t,i),o=r.isSuffices?t:a,s=e.name;if(s===void 0)return Oo(e.proof,o,n),r.isSuffices?a:t;let c={statement:r.statement,isSuffices:r.isSuffices,isInProof:!0,keyword:r.isSuffices&&r.statement.kind!==`AssumeProve`?`SUFFICES`:void 0};return Oo(e.proof,{name:s,arity:0,kind:`Theorem`,parent:o,goal:c},n),c.isInProof=!1,{name:s,arity:0,kind:`Theorem`,parent:r.isSuffices?a:t,goal:c}}case`Use`:case`Hide`:return wo(r,t,n),s(t,r.kind);case`Instance`:return s(ko(r,t,i),r.kind);case`Define`:return s(r.definitions.reduce((e,t)=>t.kind===`Instance`?ko(t,e,i):ro([t],e,n),t),r.kind);case`Have`:case`Case`:return H(r.expression,t,i),Oo(e.proof,o(t),n),o(t);case`Witness`:return r.expressions.forEach(e=>H(e,t,i)),o(t);case`Take`:return o(_a($a(r.bounds,t,i),r.names,r.nameRanges,i));case`Pick`:{let a=_a($a(r.bounds,t,i),r.names,r.nameRanges,i);return H(r.body,a,{...i,labelParams:[...i.labelParams,...ba(r.bounds),...r.names]}),Oo(e.proof,o(t),n),o(a)}default:return Oo(e.proof,o(t),n),o(t)}},Mo=(e,t)=>{let n=e.name!==void 0&&e.statement.kind!==`AssumeProve`?void 0:Do(e.statement,void 0,t);e.name!==void 0&&ga(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t);let r=t.goals.get(e.name??``);r&&(r.isInProof=!0),Oo(e.proof,n,t),r&&(r.isInProof=!1)},No={line:0,column:0},Po=(e,t)=>[...e.theorems,...e.assumptions].some(e=>e.name===t.name&&e.location.line===t.location.line&&e.location.column===t.location.column),Fo=(e,t)=>{let n=new Map([...ia,...t]);return e.constants.forEach(e=>n.set(e.name,{key:e.name,arity:e.arity,kind:`Constant`})),e.variables.forEach(e=>n.set(e.name,{key:e.name,arity:0,kind:`Variable`})),n},Io=(e,t,n,r,i)=>{let a=e.params.reduce((e,t)=>({name:t.name,arity:t.arity,kind:`Parameter`,parent:e}),r),o=(e,t)=>i.errors.push({location:t,message:`An operator must be substituted for symbol '${xt(e.name)}', and it must have arity ${e.arity}.`}),s=(e,t)=>{let n=t.location.range;if(e.arity===0){so(t,a,i);return}let r=di.get(t),s=r?void 0:Wi.get(t);if(s){let n=t.kind===`Lambda`?t.params.length:0,r=ta(Yi.get(t));t.kind===`Lambda`?H(t,a,i):r&&i.errors.push(r),!r&&n!==e.arity&&s.location.range&&i.errors.push({location:m(s.location.range),message:`Expected arity ${e.arity} but found operator of arity ${n}.`}),(r||n!==e.arity)&&o(e,ka);return}if(t.kind===`Subexpression`&&!r){H(t,a,i),o(e,ka);return}if(t.kind===`Lambda`&&!r){ho(t,a,i),t.params.length!==e.arity&&n&&o(e,m(n));return}if(t.kind===`OperatorReference`&&!r){let r=Qa(t,t.operator,a,i);r===void 0?o(e,ka):r!==e.arity&&n&&o(e,m(n));return}if(t.kind!==`Identifier`||r){let t=r??n;t&&i.errors.push({location:m(t),message:`Arity ${e.arity} operator (not an expression) is expected \nto substitute for CONSTANT '${xt(e.name)}'.`}),o(e,ka);return}let c=Qa(t,t.name,a,i);c!==void 0&&c!==e.arity&&i.errors.push({location:m(Da(t,t.name)),message:`Expected arity ${e.arity} but found operator of arity ${c}.`}),c!==e.arity&&o(e,ka)},c=e.location.range,l=t.filter(e=>da(a,e.name)!==void 0||Sa(e.name,i)!==void 0).map(t=>({declaration:t,expression:{kind:`Identifier`,name:t.name,location:e.location}}));l.filter(e=>e.declaration.arity===0).forEach(e=>{let t=Qa(e.expression,e.declaration.name,a,i);t&&c&&i.errors.push({location:m(c),message:`Wrong number of arguments (0) given to operator '${xt(e.declaration.name)}', \nwhich requires ${t} arguments.`})});let u=/* @__PURE__ */ new Map;return e.substitutions.forEach(e=>{let n=e.name,r=t.find(e=>e.name===n);if(!r){i.errors.push({location:m(e.nameRange),message:`Identifier '${n}' is not a legal target of a substitution. \nA legal target must be a declared CONSTANT or VARIABLE in the module being instantiated. \n(Also, check for warnings about multiple declarations of this same identifier.)`});return}let a=e.expression;s(r,a);let o=a.location.range;u.has(n)?o&&i.errors.push({location:m(o),message:`Multiple substitutions for symbol '${n}' in substitution.`}):u.set(n,a)}),l.filter(e=>!u.has(e.declaration.name)).forEach(e=>{(e.declaration.arity===0?0:Qa(e.expression,e.declaration.name,a,i))!==e.declaration.arity&&c&&o(e.declaration,m(c)),u.set(e.declaration.name,e.expression)}),t.filter(e=>!u.has(e.name)).forEach(e=>{let t=e.location.range;c&&t&&i.errors.push({location:m(c),message:`Substitution missing for symbol ${xt(e.name)} declared at ${m(t)} \nand instantiated in module ${n}.`})}),u},Lo=(e,t,n)=>{let r=n.getInstance(e);return Io(e,r.declarations,r.instancer,t,n),[...r.symbols].reduce((e,t)=>ha(e,t[0],t[1],n),t)},Ro=(e,t,n,r)=>{let i=Fo(n,r.imported),a=new Map([...n.constants,...n.variables].map(e=>[e.name,e.location])),o={location:e.location,errors:[],warnings:[]};return r.reports.push(o),Io(e,t,n.name,void 0,{imported:i,getInstance:r.getInstance,definitions:r.definitions,getKey:r.getKey,isModuleKnown:r.isModuleKnown,location:e.location,self:void 0,facts:/* @__PURE__ */ new Set,goals:/* @__PURE__ */ new Map,bindings:new Map([...i].map(e=>[e[0],{...e[1],position:a.get(e[0])??No}])),errors:o.errors,warnings:o.warnings,hasLabelScope:!1,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})},zo=(e,t)=>{let n=[],r=(e,t)=>{e.every(e=>e.location!==t.location||e.message!==t.message)&&e.push(t)};return e.toSorted((e,t)=>oa(e.location,t.location)).forEach(e=>{let i=[],a=[];try{e.check(i,a)}catch(e){if(!(e instanceof s)||!e.sany&&i.length===0)throw e;i.push(...e.sany?.errors??[])}i.forEach(e=>r(n,e)),a.forEach(e=>r(t,e))}),n},Bo=(e,t)=>{let n=Fo(e,t.imported),r=new Map(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[[e.name,{statement:e.statement,isSuffices:!1,isInProof:!1,keyword:void 0}]]:[])),i=new Map([...ia,...t.bound].map(e=>[e[0],{...e[1],position:No}])),a=/* @__PURE__ */ new Set,o=[],s=(e,a,o,s)=>({location:e,check:(c,l)=>s({imported:n,getInstance:t.getInstance,definitions:t.definitions,getKey:t.getKey,isModuleKnown:t.isModuleKnown,location:e,self:a,facts:t.facts,goals:r,bindings:i,errors:c,warnings:l,hasLabelScope:o,isLabelForbidden:!1,isInExcept:!1,labelParams:[],labels:/* @__PURE__ */ new Set,isGenerated:!1})}),c=(e,t)=>e.map(e=>s(e.location,void 0,!1,n=>ga(e.name,{kind:t,arity:e.arity,range:e.location.range},n)));return zo([...e.units.flatMap(e=>{let t=e.kind===`Variables`?{type:`A VARIABLE declaration`,location:e.location}:e.kind===`Constants`?{type:`A declaration`,location:e.location}:e.kind===`Module`?{type:`A MODULE `,location:e.module.location}:e.kind===`Theorem`?{type:`A THEOREM`,location:e.theorem.location}:e.kind===`Assumption`?{type:`An ASSUME`,location:e.assumption.location}:e.kind===`Use`?{type:`A USE or HIDE`,location:e.use.location}:void 0,n=t?.location.range;return!t||!n?[]:[{location:t.location,check:e=>{o.some(e=>e.binding?.isPending)&&e.push({location:m(n),message:`${t.type} may not appear within a recursive definition section.`})}}]}),...t.reports.map(e=>({location:e.location,check:(t,n)=>{t.push(...e.errors),n.push(...e.warnings)}})),...c(e.constants,`Constant`),...c(e.variables,`Variable`),...e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]).map(e=>s(e.location,void 0,!1,t=>{let n={kind:`Definition`,arity:e.arity,params:Array(e.arity).fill(0),range:e.location.range,position:e.location,isPending:!0},r=ma(e.name,i.get(e.name),n,t);r&&(i.set(e.name,n),a.add(n)),o.push({declaration:e,binding:r?n:void 0})})),...e.definitions.map(t=>s(t.location,t,!0,n=>{Po(e,t)?H(t.body,void 0,n):no(t,void 0,n,a)&&i.set(t.name,{kind:`Definition`,arity:sa(t),range:t.location.range,position:t.location})})),...e.instances.map(e=>s(e.location,void 0,!1,n=>{va(void 0,e.params,n),t.instanced.get(e)?.forEach((e,t)=>ga(t,e,n)),e.name!==void 0&&ga(e.name,{kind:`Instance`,arity:e.params.length,range:e.location.range},n)})),...e.assumptions.map(e=>s(e.location,void 0,e.name!==void 0,t=>{H(e.expression,void 0,t),e.name!==void 0&&ga(e.name,{kind:`Theorem`,arity:0,range:e.location.range},t)})),...e.theorems.map(e=>s(e.location,void 0,e.name!==void 0,t=>Mo(e,t))),...e.uses.map(e=>s(e.location,void 0,!1,t=>wo(e,void 0,t))),{location:e.location.range?.end??e.location,check:e=>o.forEach(t=>{let n=t.declaration.location.range;n&&(!t.binding||t.binding.isPending)&&e.push({location:m(n),message:`Symbol ${xt(t.declaration.name)} declared in RECURSIVE statement but not defined.`})})}],t.warnings)},Vo={Set:{open:`{ `,close:` }`,pad:` `,separator:`,`,divider:``,dividerPad:``},Sequence:{open:`<< `,close:` >>`,pad:` `,separator:`,`,divider:``,dividerPad:``},Subset:{open:`SUBSET `,close:` `,pad:` `,separator:`,`,divider:``,dividerPad:``},Function:{open:`( `,close:` )`,pad:` `,separator:` @@`,divider:` :>`,dividerPad:` `},Record:{open:`[ `,close:` ]`,pad:` `,separator:`,`,divider:` |->`,dividerPad:` `}},Ho=e=>{if(e===void 0)return!1;let t=e.charCodeAt(0);return t>=9&&t<=13||t>=28&&t<=32||t===5760||t>=8192&&t<=8202&&t!==8199||t===8232||t===8233||t===8287||t===12288},Uo=e=>e!==void 0&&/^\p{Nd}$/u.test(e),Wo=e=>e!==void 0&&/^[\p{L}\p{Nd}]$/u.test(e),Go=e=>{let t=t=>{let n=Je(e,t,Ho);return e[n]===void 0?void 0:n},n=(n,r,i,a,o,s)=>{let c={kind:n,first:r,last:r,children:[]},l=t(i);for(;l!==void 0&&e[l]!==a;){let n=o(l);if(!n)return;c.children.push(n);let r=t(n.last+1);if(r===void 0)return;let i=e.startsWith(s,r)?r+s.length:r;l=t(i)}if(l!==void 0)return c.last=l,c},r=(n,r)=>{let i=o(n);if(!i)return;let a=t(i.last+1);if(a===void 0||!e.startsWith(r,a))return;let s=t(a+r.length),c=s===void 0?void 0:o(s);if(c)return{kind:`Pair`,first:n,last:c.last,children:[i,c]}},i=t=>{let n=Je(e,t,Uo);if(e.startsWith(`..`,n)&&Uo(e[n+2]))return{kind:`Constant`,first:t,last:Je(e,n+2,Uo)-1,children:[]}},a=t=>{let n=e[t];if(n===`"`){let n=e.indexOf(`"`,t+1);return n===-1?void 0:{kind:`Constant`,first:t,last:n,children:[]}}let r=Uo(n)?i(t):void 0;if(r)return r;if(n===`-`)return t+1>=e.length?void 0:{kind:`Constant`,first:t,last:Je(e,t+1,Uo)-1,children:[]};if(Wo(n))return{kind:`Constant`,first:t,last:Je(e,t,Wo)-1,children:[]}},o=i=>{let s=t(i);if(s!==void 0)switch(e[s]){case`{`:return n(`Set`,s,s+1,`}`,o,`,`);case`<`:{let t=n(`Sequence`,s,s+2,`>`,o,`,`);return!t||t.last+1>=e.length?void 0:{...t,last:t.last+1}}case`[`:return n(`Record`,s,s+1,`]`,e=>r(e,`|->`),`,`);case`(`:return n(`Function`,s,s+1,`)`,e=>r(e,`:>`),`@@`);default:{if(!e.startsWith(`SUBSET`,s))return a(s);let n=t(s+6),r=n===void 0?void 0:o(n);return r?{kind:`Subset`,first:s,last:r.last,children:[r]}:void 0}}};return o(0)},U=e=>{let t=e.length===0?void 0:Go(e);if(!t||t.last<e.length-1)return e;let n=t=>e.slice(t.first,t.last+1),r=e=>e.last-e.first+1,i=(e,t,i,s)=>{if(r(e)<=t-i||e.kind===`Constant`)return n(e);if(e.kind===`Pair`)return;let c=Vo[e.kind],l=t-Math.max(c.open.length,c.pad.length),u=i+c.close.length,d=s+c.pad,f=e.kind===`Function`||e.kind===`Record`?o(e.children,l,u,d,c):a(e.children,l,u,d,c.separator);return f===void 0?void 0:c.open+f+c.close},a=(e,t,n,r,a)=>{let o=e.map((o,s)=>{let c=s===e.length-1,l=i(o,t,c?n:a.length,r);return l===void 0||c?l:`${l}${a}\n${r}`});return o.includes(void 0)?void 0:o.join(``)},o=(e,t,a,o,s)=>{let c=e.map((c,l)=>{let u=l===e.length-1,d=c.children[0],f=c.children[1],p=u?``:`${s.separator}\n${o}`,m=r(d)+s.divider.length+1+r(f);if(u?m<=t-a:m+s.separator.length<=t)return`${n(d)}${s.divider} ${n(f)}${p}`;let h=r(d)+s.divider.length<=t?n(d):i(d,t,a+s.divider.length,o),g=i(f,t-s.dividerPad.length,u?a:s.separator.length,o+s.dividerPad);return h===void 0||g===void 0?void 0:`${h}${s.divider}\n${o}${s.dividerPad}${g}${p}`});return c.includes(void 0)?void 0:c.join(``)};return i(t,80,0,``)??e},Ko={general:1e3,stackOverflow:1005,commandLineError:1102,initialState:2102,nestedExpression:2103,assumptionFalse:2104,assumptionEvaluationError:2105,unchangedVariableChanged:2143,exceptAppliedToUnknownField:2144,fingerprintFailed:2147,initialStateIncomplete:2106,invariantViolatedInitial:2107,incompleteSuccessor:2109,propertyViolatedInitial:2108,invariantViolatedBehavior:2110,invariantEvaluationFailed:2111,actionPropertyViolatedBehavior:2112,actionPropertyEvaluationFailed:2113,deadlockReached:2114,temporalPropertyViolated:2116,noInitialStates:2118,errorState:2120,behaviorUpToThisPoint:2121,backToState:2122,subscriptUndetermined:2139,subscriptMissingVariable:2140,constantLevelInvariant:2149,javaOverrideLoaded:2168,starting:2185,modelChecking:2187,simulating:2188,finished:2186,traceSpecWritten:2501,traceSpecFailed:2502,computingInit:2189,initGenerated1:2190,initGenerated2:2191,checkingTemporal:2192,success:2193,searchDepth:2194,stats:2199,progress:2200,coverageStart:2201,coverageEnd:2202,coverageValue:2221,depthFirstStats:2204,depthFirstLevel:2205,depthFirstProgress:2206,depthFirstInitGenerated:2208,simulationProgress:2209,simulationStats:2210,temporalBranches:2212,statePrint1:2216,statePrint2:2217,statePrint3:2218,sanyFinished:2219,startingSany:2220,stateLevelProperty:2255,noInitialStatesInModel:2256,version:2262,depthFirstModelChecking:2271,noSpecificationButProperty:2257,fairnessTautology:2258,noFairnessButProperty:2259,counterExample:2264,checkingTemporalEnd:2267,stateGraphOutdegree:2268,computingInitProgress:2269,livenessSymmetry:2279,livenessConstraints:2284,symmetrySetTooSmall:2300,javaOverrideMismatch:2400,postconditionFalse:2404,postconditionFailed:2405,coverageNext:2772,coverageInit:2773,coverageProperty:2774,coverageValueCost:2775,coverageEndOverhead:2777,coverageConstraint:2778,coverageVariable:2779,possibleUnwitnessed:2780,parsingFailed:3002,configFileError:5001,moduleOverrideStdout:2e4},qo={none:0,error:1,warning:3,state:4},Jo={0:``,1:`Error: `,3:`Warning: `,4:`State `},Yo=(e,t,n,r)=>e?`@!@!@STARTMSG ${t}:${n} @!@!@\n${r}\n@!@!@ENDMSG ${t} @!@!@`:`${Jo[n]}${r}`,Xo=e=>{let t=/* @__PURE__ */ new Set;return{isTool:e.isTool,isDiffTrace:e.isDiffTrace??!1,version:e.version??`master`,print:(n,r,i)=>{let a=r===qo.warning;if(a&&e.errorCodes?.includes(n))throw new o(n,i);if(a&&e.isWarningEnabled===!1||r!==qo.error&&e.suppressedCodes?.includes(n))return;let s=a&&!e.isTool&&t.size===0?`
|
|
346
|
+
(Use the -nowarning option to disable this warning.)`:``,c=Yo(e.isTool,n,r,`${i}${s}`);a&&t.has(c)||(a&&t.add(c),console.log(c))}}},Zo=`The configuration file did not specify the initial state predicate.
|
|
347
|
+
Can also be caused by trying to run TLC on a specification from
|
|
348
|
+
a module imported with a parameterized INSTANCE statement.`,Qo=[[1005,S,!1],[1e3,`In evaluating TLCExt!Trace, the state is not completely specified yet (variable%1% %2% undefined).`,!1],[1e3,`Could not find operator: %1% in module: %2%`,!1],[2117,`Failed to recover the next state from its fingerprint.`,!0],[2123,`Failed to recover the initial state from its fingerprint.`,!0],[2132,`The first argument of Assert evaluated to FALSE; the second argument was:
|
|
349
|
+
%1%`,!0],[2143,`The variable %1% was changed while it is specified as UNCHANGED at
|
|
350
|
+
%2%`,!1],[2144,`The EXCEPT was applied to non-existing fields of the value at
|
|
351
|
+
%1%`,!1],[2145,`TLCGet(%1%) was undefined.`,!0],[2154,`Attempted to apply the operator overridden by the Java method
|
|
352
|
+
%1%,
|
|
353
|
+
but it produced the following error:
|
|
354
|
+
%2%`,!1],[2148,`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable %1% occurring in the state formula v.
|
|
355
|
+
`,!1],[2155,`Attempted to compare %1% with the value
|
|
356
|
+
%2%`,!0],[2158,`Attempted to check if the value:
|
|
357
|
+
%1%
|
|
358
|
+
is an element of %2%.`,!0],[2157,`Attempted to apply TransitiveClosure to a set containing
|
|
359
|
+
the following value:
|
|
360
|
+
%1%`,!0],[2156,`TLC supports at most %1% model values, but model value %2% exceeds this limit.`,!1],[2156,`tla-ts can't recover a model check from the checkpoint in %1%.`,!1],[2165,`Choose can only deal with numbers up to %1%`,!1],[2169,`The %1% argument of %2% should be a %3%, but instead it is:
|
|
361
|
+
%4%`,!0],[2170,`Argument mismatch in operator application.%1%`,!1],[2171,`Parsing or semantic analysis failed.%1%`,!1],[2172,ee,!1],[2176,`Applying %1% to the following value,
|
|
362
|
+
which is not %2%:
|
|
363
|
+
%3%`,!0],[2177,`Attempted to apply BagUnion to the following set, whose
|
|
364
|
+
element is not a bag:
|
|
365
|
+
%1%`,!0],[2178,`Overflow when computing %1%`,!1],[2179,`The second argument of \\div is 0.`,!0],[2180,`0^0 is undefined.`,!0],[2181,`Attempted to compute cardinality of the value
|
|
366
|
+
%1%`,!0],[2182,`Evaluating an expression of the form %1% when s is not a %2%:
|
|
367
|
+
%3%`,!0],[2183,`The %1% argument of %2% must be in the domain of its %3% argument:
|
|
368
|
+
%4%
|
|
369
|
+
, but instead it is
|
|
370
|
+
%5%`,!0],[2184,`Attempted to apply %1% to the empty sequence.`,!0],[2115,`No next state actions defined to generate successor states from.`,!1],[2146,`The invariant %1% is not a state predicate (one with no primes or temporal operators).%2%`,!1],[2213,`TLC cannot handle the temporal formula %1%`,!1],[2214,`Temporal formulas containing actions must be of forms <>[]A or []<>A.`,!1],[2215,`TLC expected a %1% value, but did not find one. %2%`,!1],[2222,`The constant parameter %1% is not assigned a value by the configuration file.`,!1],[2223,`In the configuration file, the identifier %1% appears
|
|
371
|
+
on the right-hand side of a <- after already appearing on the
|
|
372
|
+
left-hand side of one.`,!1],[2224,`The configuration file substitutes for %1% with the undefined identifier %2%.`,!1],[2225,`The configuration file substitutes for %1% with %2% of different number of arguments.`,!1],[2226,`In the configuration file, the identifier %1% does not appear in the specification.`,!1],[2227,`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`,!1],[2228,`TLC requires %1% not to take any argument.`,!1],[2228,`TLC requires %1% not to take any argument, but one was given: %2%`,!1],[2229,`The %1% %2% specified in the configuration file
|
|
373
|
+
is not defined in the specification.`,!1],[2230,`The %1% of %2% is equal to %3%`,!1],[2231,`The configuration file did not specify the initial state predicate.`,!1],[2231,Zo,!1],[2232,`The configuration file did not specify the next state predicate.`,!1],[2233,`The %1% %2% cannot be a constant.`,!1],[2234,`The operator %1% cannot take any argument.`,!1],[2235,`The operator %1% is not defined in the spec.`,!1],[2236,`The operator %1%, which equals %2%,
|
|
374
|
+
cannot be used as a %3%`,!1],[2237,`The spec is trivially false because %1% is false.`,!1],[2238,`TLC cannot handle subscript %1%`,!1],[2239,`TLC cannot handle this conjunct of the spec:
|
|
375
|
+
%1%`,!1],[2240,`The specification contains more than one conjunct of the form [][Next]_v,
|
|
376
|
+
but TLC can handle only specifications with one next-state relation.`,!1],[2241,`The property %1% is not correctly defined.`,!1],[2242,`The arity of the operator %1% is inconsistent in the configuration file.`,!1],[2244,`TLC can't handle real numbers.
|
|
377
|
+
%1%`,!1],[2245,`In the configuration file, the module name %1% is not a module in the specification.`,!1],[2247,`In computing %1%, TLC expected a %2% expression,
|
|
378
|
+
but instead found %3%.
|
|
379
|
+
%4%`,!1],[2248,`In computing %1%, TLC expected a %2% expression,
|
|
380
|
+
but didn't find one.
|
|
381
|
+
%3%`,!1],[2260,`In computing ENABLED, TLC encountered a temporal formula (%1%).
|
|
382
|
+
%2%`,!1],[2261,`TLC encountered a temporal formula (%1%) when evaluating a predicate or action.
|
|
383
|
+
%2%`,!1],[2265,`TLC can't handle a number this big.
|
|
384
|
+
%1%`,!1],[2266,`The %1% argument of %2% should be an %3%, but instead it is:
|
|
385
|
+
%4%`,!0],[2272,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property: Let A be the formula at %2%; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2273,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that action %1% holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at %2% (compare page 90 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2274,`The formula %1% at %2% is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. To check that infinitely many %1% steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at %2% (compare page 91 of Specifying Systems at https://lamport.azurewebsites.net/tla/book.html).`,!1],[2280,`In evaluation, the identifier %1% is either undefined or not an operator.
|
|
386
|
+
%2%`,!1],[2281,`The configuration file substitutes constant %1% with non-constant %2%%3%`,!1],[2283,`The argument of %1% should be a %2%, but instead it is:
|
|
387
|
+
%3%`,!0],[5003,`TLC found an error in the configuration file at line %1%
|
|
388
|
+
The keyword %2% was not followed by an identifier.`,!1],[5004,`TLC found an error in the configuration file at line %1%
|
|
389
|
+
The keyword %2% appeared twice.`,!1],[5005,`TLC found an error in the configuration file at line %1%
|
|
390
|
+
Expected an identifier after %2%.`,!1],[5006,`TLC found an error in the configuration file at line %1%
|
|
391
|
+
It was expecting %2%, but did not find it.`,!1],[5007,`TLC found an error in the configuration file:
|
|
392
|
+
%1%`,!1],[5002,`TLC found an error in the configuration file at line %1%
|
|
393
|
+
`,!1],[2250,`A state predicate was evaluated to a non-boolean value.`,!1],[2252,`Encountered an action predicate that's not a boolean.`,!1],[2253,`Temporal formula is a tautology (its negation is unsatisfiable).`,!1],[2301,`TLC does not support temporal existential, nor universal, quantification over state variables.`,!1]];let $o;const es=()=>$o??=Qo.map(e=>({pattern:RegExp(`^${e[1].split(/%\d+%/).map(e=>e.replace(/[.*+?^${}()|[\]\\]/g,`\\$&`)).join(`[\\s\\S]*`)}$`),message:{code:e[0],isEvalException:e[2]}})),ts=/^Overflow when computing the number of elements in( |:\n\[(?![A-Za-z0-9_]+: ))|\nis an element of a set of \d+-tuples\.$|^In computing ENABLED, TLC encountered a temporal formula \(a (~> b|-\+-> formula)\)\./,ns=e=>ts.test(e)?void 0:es().find(t=>t.pattern.test(e))?.message,rs=e=>e instanceof t||ns(e.message)?.isEvalException===!0,is=/* @__PURE__ */ new Map([[1e3,`
|
|
394
|
+
: `],[2105,`failed.
|
|
395
|
+
`],[2154,`but it produced the following error:
|
|
396
|
+
`],[2171,`Parsing or semantic analysis failed.`],[2213,`:
|
|
397
|
+
`],[2281,` - specifically: `],[2405,`failed.
|
|
398
|
+
`]]),as=(e,t,n)=>{let r=n?is.get(e):void 0,i=r===void 0?-1:t.indexOf(r);if(r===void 0||i===-1)return t;let a=i+r.length;return`${t.slice(0,a)}${os(t.slice(a),n)}`},os=(e,t)=>{let n=t?ns(e)?.code:void 0;return n===void 0?e:`@!@!@STARTMSG ${n}:${qo.none} @!@!@\n${as(n,e,t)}\n@!@!@ENDMSG ${n} @!@!@`},ss=(e,t=2)=>String(e).padStart(t,`0`),cs=e=>{let t=Math.floor(e/1e3)%60,n=Math.floor(e/6e4)%60,r=Math.floor(e/36e5);return e>864e5?`${Math.floor(r/24)}d ${ss(r%24)}h`:e>36e5?`${ss(r%24)}h ${ss(n)}min`:e>6e4?`${ss(n)}min ${ss(t)}s`:`${ss(t)}s`},ls=e=>`${e.getFullYear()}-${ss(e.getMonth()+1)}-${ss(e.getDate())} ${ss(e.getHours())}:${ss(e.getMinutes())}:${ss(e.getSeconds())}`,us=/* @__PURE__ */ new WeakMap,ds=(e,t,n)=>{if(!(e instanceof w))return e;let r=v(new w(`${n}\n${e.message}`,e),d(e));return us.set(r,{code:t,headline:n,inner:e}),r},fs=e=>us.has(e),ps=e(`util.WrongInvocationException`),ms=l.slice(0,l.indexOf(`
|
|
399
|
+
`)),hs=`${l}tlc2.tool.EvalException: `,gs=`${l}util.Assert$TLCRuntimeException: `,_s=e=>rs(e)?hs:gs,vs=e=>{try{return e()}catch(e){throw e instanceof w?rs(e)?new w(`${a}${e.message}`):ns(e.message)?e:new w(`${l}${e.message}`):e}},ys=[hs,gs,l,a],bs=(e,t)=>{let r=us.get(e);if(r)return`${r.headline}\n${bs(r.inner,t)}`;let i=e.message;if(e instanceof n)return i;let a=ys.find(e=>i.startsWith(e))??``;return`${a}${os(i.slice(a.length),t)}`},xs=(e,t)=>{let r=us.get(e),a=e.message;if(r)return{code:r.code,message:a,toolMessage:bs(e,!0)};if(e instanceof i)return{code:t?Ko.stackOverflow:Ko.general,message:a,toolMessage:a};if(t&&rs(e))return{code:ns(a)?.code??Ko.general,message:a,toolMessage:a};let o=t&&!a.startsWith(ms)&&!(e instanceof n),s=e instanceof u?ps:l,c=o?s:``;return{code:Ko.general,message:`${c}${a}`,toolMessage:`${c}${bs(e,!0)}`}},Ss=e=>e.kind!==`ModelValue`&&e.kind!==`Set`&&e.kind!==`Function`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&e.kind!==`LazyFunction`,Cs=2147483647,ws=1e6;let Ts=ws;const Es=()=>Ts,Ds=()=>Math.max(Ts,10),Os=()=>`Attempted to construct a set with too many elements (>${Ts}).`,ks=(e,t)=>{if(e.length===Ds())throw new u(Os());e.push(t)},As=e=>typeof e==`object`&&e.kind===`Interval`&&e.high-e.low>=Ds(),js=(e,t)=>{if(Array.isArray(e))return e.forEach(t);for(let n=e.low;n<=e.high;n++)t(n)},Ms=e=>typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Function`&&e.kind!==`LazyFunction`,Ns=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`||e.kind===`Interval`),Ps=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`),Fs=e=>typeof e==`object`&&e.kind===`ModelValue`,Is=e=>typeof e==`object`&&(e.kind===`Set`||e.kind===`MixedSet`),Ls=e=>typeof e==`boolean`?`boolean`:typeof e==`number`?`integer`:typeof e==`string`?`string`:e.kind===`ModelValue`?`model value`:Ms(e)?`set`:`function`,Rs=e=>Number.isInteger(e)&&e<=2147483647&&e>=-2147483648;let zs=!1;const Bs=(e,t)=>(zs=!0,e.writtenKeys=t,e),Vs=e=>(e.hash!==0||e.fingerprint!==0?void 0:e.writtenKeys)??e.domain,Hs=e=>Vs(e).map(t=>[t,e.range[e.domain.indexOf(t)]]),Us=e=>e.domain.every(e=>typeof e==`number`)?e.domain.map((t,n)=>[t,e.range[n]]):Hs(e),Ws=(e,t,n,r)=>Bs(Il(e,t.map(e=>n[e])),r),Gs=e=>{if(!(typeof e!=`object`||e.kind!==`Function`&&e.kind!==`Set`)&&e.hash===0&&e.fingerprint===0){if(e.kind===`Set`)return e.elements.forEach(Gs);e.writtenKeys=void 0,e.range.forEach(Gs)}},Ks=e=>{zs&&typeof e==`object`&&e.kind===`Function`&&(e.writtenKeys=void 0)},qs=e=>e.every(e=>typeof e==`string`),Js=(e,t)=>e.length>0&&t.length>0&&qs(e)!==qs(t),Ys=(e,t)=>{zs&&(e.writtenKeys=void 0,t.writtenKeys=void 0);let n=e.domain,r=t.domain;if(n.length!==r.length)return Js(n,r)?al(e,t):n.length-r.length;if(n!==r)for(let e=0;e<n.length;e++){let t=xc(n[e],r[e]);if(t!==0)return t}let i=e.range,a=t.range;if(i===a)return 0;for(let e=0;e<i.length;e++){let t=i[e],n=a[e],r=typeof t==`number`&&typeof n==`number`?t-n:xc(t,n);if(r!==0)return r}return 0},Xs=(e,t)=>{let n=e.elements,r=t.elements;if(n.length!==r.length)return n.length-r.length;if(n===r)return 0;for(let e=0;e<n.length;e++){let t=xc(n[e],r[e]);if(t!==0)return t}return 0},Zs=e=>Fs(e)?e.type:void 0,Qs=(e,t,n)=>{let r=Zs(e),i=Zs(t);if(r===void 0&&i===void 0)return;let a=n?`check equality of`:`compare`;if(Fs(e)&&Fs(t)){if(r===void 0||i===void 0||r===i)return;throw new w(`Attempted to ${a} the differently-typed model values ${U(q(e))} and ${U(q(t))}`)}throw r===void 0?new w(`Attempted to ${a} the typed model value ${U(q(t))} and the non-model value\n${U(q(e))}`):new w(`Attempted to ${a}${n?``:` the`} typed model value ${U(q(e))} and non-model value\n${U(q(t))}`)},$s=()=>({ranks:Object.create(null),size:0,searchRank:void 0,unorderedString:void 0}),ec=$s(),tc=e=>{Object.assign(ec,$s()),Sc.clear();for(let t of e)dc(t)},nc=()=>{ec.searchRank=ec.size},rc=()=>ec.unorderedString;let ic=!1;const ac={isExpanded:!0,isViewPrinted:!1},oc=e=>{ic=e.version===`1.7.4`,Ts=e.maxSetSize??ws,ac.isExpanded=e.isLazyValueExpanded??!0,ac.isViewPrinted=e.isViewPrinted??!1},sc=/* @__PURE__ */ new WeakMap,cc=(e,t)=>(ac.isViewPrinted&&sc.set(e,t),e),lc=/* @__PURE__ */ new WeakMap,uc=(e,t)=>(lc.set(e,t),e),dc=e=>(ec.ranks[e]===void 0&&(ec.ranks[e]=ec.size++),e),fc=e=>ec.ranks[dc(e)],pc=(e,t)=>{if(e===t)return 0;let n=ec.ranks,r=n[e],i=n[t],a=ec.searchRank;return a!==void 0&&(r===void 0||r>=a)&&(i===void 0||i>=a)&&(ec.unorderedString??=e),r!==void 0&&i!==void 0?r-i:r===void 0?i===void 0&&e<t?-1:1:-1},mc=e=>typeof e==`object`&&(e.kind===`InfiniteSet`||e.kind===`SequenceSet`),hc=(e,t)=>(mc(e)||mc(t))&&(typeof e!=`object`||e.kind!==`SequenceSet`||typeof t!=`object`||t.kind!==`SequenceSet`),gc=(e,t)=>new w(mc(e)?`Attempted to compare overridden value ${U(q(e,!0))} with non-overridden value:\n${U(q(t))}`:`Attempted to compare ${Ls(e)} ${q(e)} with ${Ls(t)} ${q(t)}`),_c=(e,n,r)=>{if(!mc(e))throw new w(`Attempted to ${r} the set ${U(q(W(e)?G(e):e,!0))} with the value:\n${U(q(n,!0))}`);if(!mc(n))throw gc(e,n);let i=e.kind===`InfiniteSet`?e.name:void 0,a=n.kind===`InfiniteSet`?n.name:void 0;if(i!==void 0&&i===a)return 0;if(i===`Nat`&&a===`Int`||i===`Int`&&a===`Nat`)return i===`Nat`?-1:1;throw new t(`Attempted to compare ${U(q(e,!0))} with the value\n${U(q(n,!0))}`)},vc={kind:`InfiniteSet`,name:`Any`},yc=e=>{throw new t(`Attempted to compare ANY with the value\n${U(q(e))}`)},bc=e=>{zs&&Gs(e),e===vc&&yc(e),typeof e==`object`&&e.kind===`LazyFunction`&&K(e)},xc=(e,t)=>{if(e===t)return bc(e),0;if(typeof e==`object`&&typeof t==`object`){let n=e.kind,r=t.kind;if(n===`Function`&&r===`Function`)return Ys(e,t);if(n===`Set`&&r===`Set`)return Xs(e,t);if(n===`Interval`&&r===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.max(0,t.high-t.low+1);return n!==r||n===0?n-r:e.low-t.low}if(n===`ModelValue`&&r===`ModelValue`)return e.type!==void 0&&t.type!==void 0&&Qs(e,t,!1),e.rank-t.rank;if(n===`ModelValue`||r===`ModelValue`)return Qs(e,t,!1),n===`ModelValue`?-1:1;if(e===vc||t===vc)return yc(e===vc?t:e);if(Ms(e)&&Ms(t)&&hc(e,t))return _c(e,t,`compare`);let i=Ms(e);if(i!==Ms(t))throw gc(e,t);if(n===`Interval`&&r===`Set`){let n=ou(e)-t.elements.length;if(n!==0)return n}if(n===`Set`&&r===`Interval`){let n=e.elements.length-ou(t);if(n!==0)return n}return i?Xs(G(e),G(t)):Ys(K(e),K(t))}if(typeof e==`number`&&typeof t==`number`)return e-t;if(typeof e==`string`&&typeof t==`string`)return pc(e,t);if(typeof e==`boolean`&&typeof t==`boolean`)return e<t?-1:1;if(Qs(e,t,!1),Fs(e))return-1;if(Fs(t))return 1;throw gc(e,t)},Sc=/* @__PURE__ */ new Map,Cc=32768,wc=e=>{let t=Sc.get(e);if(t)return t;if(Sc.size===Cc)throw new f(`TLC supports at most ${Cc} model values, but model value ${e} exceeds this limit.`);let n={kind:`ModelValue`,name:e,type:e.length>2&&e[1]===`_`?e[0]:void 0,rank:fc(e),hash:zu(Bu(Vu(e),109)),fingerprint:Xu(Zu(e)^60)};return Sc.set(e,n),n},Tc=()=>[...Sc.values()],Ec=e=>({kind:`Set`,elements:e,writtenElements:void 0,isNormalized:!1,hash:0,fingerprint:0,isFingerprinted:!1}),Dc=e=>{let t=Ec(e);return t.isNormalized=!0,t},Oc=(e,t)=>({kind:`Function`,domain:e,range:t,hash:0,fingerprint:0,writtenKeys:void 0,functionClass:void 0,lambdaDomain:void 0,isFingerprinted:!1});let kc=!1;const Ac=(e,t)=>(t===`lambda`&&(kc=!0),t!==void 0&&(e.functionClass=t),e),jc=e=>typeof e==`object`&&(e.kind===`Function`||e.kind===`LazyFunction`)?e.functionClass:void 0,Mc=e=>Ac(e,`lambda`),Nc=e=>Ss(e)&&e.isCached===!0;let Pc=!1;const Fc=e=>(Pc=!0,e),Ic=/* @__PURE__ */ new Set([`Union`,`SetOperation`,`FilteredSet`,`ProductSet`,`RecordSet`,`FunctionSet`]),Lc=e=>{Pc&&typeof e==`object`&&Ss(e)&&Ic.has(e.kind)&&(e.isCached=!0)},Rc=e=>{(kc||Pc)&&typeof e==`object`&&e.kind!==`ModelValue`&&e.kind!==`Interval`&&e.kind!==`InfiniteSet`&&(e.isFingerprinted||(e.isFingerprinted=!0,e.kind===`Function`?(e.functionClass===`lambda`&&(e.functionClass=void 0),e.domain.forEach(Rc),e.range.forEach(Rc)):e.kind===`Set`||e.kind===`MixedSet`?e.elements.forEach(Rc):Ms(e)&&W(e)&&(Lc(e),G(e).elements.forEach(Rc))))},zc=(e,t)=>{if(Lc(e),e===t)return bc(e),!0;if(typeof e!=`object`||typeof t!=`object`)return typeof e!=typeof t&&((typeof e==`object`||typeof t==`object`)&&Qs(e,t,!0),xc(e,t)===0);if(e.kind===`Function`&&t.kind===`Function`)return Ys(e,t)===0;if(e.kind===`Set`&&t.kind===`Set`)return Xs(e,t)===0;if(e.kind===`Interval`&&t.kind===`Set`&&ou(e)!==t.elements.length||e.kind===`Set`&&t.kind===`Interval`&&e.elements.length!==ou(t))return!1;if(Fs(e)||Fs(t))return e.kind===`LazyFunction`&&K(e),Qs(e,t,!0),Fs(e)&&Fs(t)&&e.name===t.name;if(e.kind===`Subset`&&t.kind===`Subset`)return zc(e.base,t.base);if(e.kind===`FunctionSet`&&t.kind===`FunctionSet`){let n=ru(e.domain),r=ru(t.domain);if(n||r)return n===r;let i=ru(e.range),a=ru(t.range);return i||a?i===a:zc(e.domain,t.domain)&&zc(e.range,t.range)}if(e.kind===`RecordSet`&&t.kind===`RecordSet`){if(ru(e))return ru(t);if(ru(t))return!1;let n=e=>e.names.map((t,n)=>[t,e.sets[n]]).sort((e,t)=>e[0]<t[0]?-1:1),r=n(t);return e.names.length===t.names.length&&n(e).every((e,t)=>e[0]===r[t][0]&&zc(e[1],r[t][1]))}if(e.kind===`ProductSet`&&t.kind===`ProductSet`)return ru(e)?ru(t):!ru(t)&&e.factors.length===t.factors.length&&e.factors.every((e,n)=>zc(e,t.factors[n]));let n=Ms(e)&&Ms(t)&&!(W(e)&&W(t));if(n&&hc(e,t))return _c(e,t,`check equality of`)===0;if(n){if(!mc(e)){let n=G(e);if(!mc(t))return Xs(n,G(t))===0}return nd(e)===nd(t)}return xc(e,t)===0},Bc=e=>{let t=(e,t)=>{if(e===t)return!0;if(e.length!==t.length)return!1;for(let r=0;r<e.length;r++)if(!n(e[r],t[r]))return!1;return!0},n=(n,r)=>n===r?!0:typeof n!=`object`||typeof r!=`object`?!1:n.kind===`Set`&&r.kind===`Set`?(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.elements,r.elements):n.kind===`Function`&&r.kind===`Function`?(!e||n.functionClass===r.functionClass)&&(n.hash===0||r.hash===0||n.hash===r.hash)&&t(n.domain,r.domain)&&t(n.range,r.range):nd(n)===nd(r);return n},Vc=Bc(!1),Hc=Bc(!0),Uc=(e,t)=>{for(let n=0;n<e.length;n++)e[n]=t(e[n])},Wc=()=>{let e=/* @__PURE__ */ new Map,t=n=>{if(typeof n!=`object`||n.kind!==`Set`&&n.kind!==`Function`)return n;let r=Yu(n),i=e.get(r);if(i!==void 0&&!Array.isArray(i)&&(i===n||Hc(i,n)))return i;if(Array.isArray(i)){for(let e=0;e<i.length;e++)if(i[e]===n||Hc(i[e],n))return i[e]}return n.kind===`Set`?Uc(n.elements,t):(Uc(n.domain,t),Uc(n.range,t)),i===void 0?e.set(r,n):Array.isArray(i)?i.push(n):e.set(r,[i,n]),n};return e=>{for(let n=0;n<e.length;n++)e[n]=t(e[n]);return e}},Gc=(e,t)=>t.length===0||jc(e)===`tuple`?1:Iu(t)?.low,Kc=e=>{if(!Ps(e))return;let t=K(e);return{domain:t.domain,range:t.range,low:Gc(e,t.domain)}},qc=e=>{if(!Ps(e))return;let t=K(e);return qs(t.domain)?t:void 0},Jc=(e,t,n)=>(Qs(t,e,n),1),Yc={number:{name:`integer`,other:`non-integer`,equality:`check equality of`},string:{name:`string`,other:`non-string`,equality:`check equality of`},boolean:{name:`boolean`,other:`non-boolean`,equality:`compare equality of`}},Xc=(e,t,n)=>{let r=Yc[typeof e==`number`?`number`:typeof e==`string`?`string`:`boolean`];return`Attempted to ${n?r.equality:`compare`} ${r.name} ${U(q(e))} with ${r.other}:\n${U(q(t))}`},Zc=e=>e?`check equality of`:`compare`,Qc=(e,t,n,r)=>{let i=Kc(n);if(!i){if(Fs(n))return Jc(n,t,r);throw new w(`Attempted to ${Zc(r)} the function ${U(q(t))} with the value:\n${U(q(n))}`)}if(e.range.length!==i.range.length)return e.range.length-i.range.length;let a=()=>$c(e.range,i.range,r);if(e.low!==void 0&&e.range.length===0)return 0;if(e.low!==void 0&&i.low!==void 0)return e.low===i.low?a():e.low-i.low;let o=e.low??i.low;if(o===void 0)return $c(e.domain,i.domain,r)||a();let s=e.low===void 0?e.domain:i.domain;for(let t=0;t<s.length;t++){let n=s[t];if(typeof n!=`number`)throw new w(`Attempted to compare ${r?`an `:``}integer with non-integer${r||e.low!==void 0?`:`:``}\n${U(q(n))}.`);let i=e.low===void 0?n-(o+t):o+t-n;if(i!==0)return i}return a()},$c=(e,t,n)=>{for(let r=0;r<e.length;r++){let i=il(e[r],t[r],n);if(i!==0)return i}return 0},el=(e,t,n)=>{let r=K(e);if(jc(e)===`tuple`){let i=Ps(t)?du(t):void 0;return i?r.range.length-i.length||$c(r.range,i,n):Qc({...r,low:1},e,t,n)}if(jc(e)===`record`){let i=qc(t);if(!i){if(Fs(t))return Jc(t,e,n);throw new w(`Attempted to ${Zc(n)} record:\n${U(q(e))}\nwith non-record\n${U(q(t))}`)}return r.domain.length-i.domain.length||$c(r.domain,i.domain,n)||$c(r.range,i.range,n)}return Qc({...r,low:Gc(e,r.domain)},e,t,n)},tl=(e,t)=>mc(e)||mc(t)||typeof t==`object`&&e.kind===t.kind&&(e.kind===`Interval`||e.kind===`Subset`||e.kind===`FunctionSet`||e.kind===`RecordSet`||e.kind===`ProductSet`),nl=(e,t)=>{let n=Is(t)?t:G(t);return{elements:G(e).elements,otherElements:G(n).elements}},rl=(e,t,n)=>{if(tl(e,t))return n?+!zc(e,t):xc(e,t);if(!Is(e))return rl(G(e),t,n);if(!Ms(t)){if(Fs(t))return Jc(t,e,n);throw new w(`Attempted to ${Zc(n)} the set ${U(q(e))} with the value:\n${U(q(t))}`)}let r=nl(e,t);return r.elements.length-r.otherElements.length||$c(r.elements,r.otherElements,n)},il=(e,t,n)=>{if(typeof e!=`object`){if(typeof t==typeof e)return n?e===t?0:1:xc(e,t);if(Fs(t))return Jc(t,e,n);throw new w(Xc(e,t,n))}return e.kind===`ModelValue`?(e.type!==void 0&&Qs(e,t,n),Fs(t)?n?e.name===t.name?0:1:e.rank-t.rank:-1):Ps(e)?el(e,t,n):rl(e,t,n)},al=(e,t)=>il(e,t,!1),ol=(e,t)=>il(e,t,!0)===0,sl=e=>{let t=[];for(let n of e){let e=ll(n,t);e.isFound||t.splice(e.index,0,n)}return t},cl=(e,t)=>{let n=pu.sets;if(n===void 0)return t();n.push(e);let r=t();return n.pop(),r},ll=(e,t)=>{let n=0,r=t.length;for(;n<r;){let i=n+(r-n>>1),a=cl(e,()=>al(e,t[i]));if(a===0)return{index:i,isFound:!0};a<0?r=i:n=i+1}return{index:n,isFound:!1}},ul=(e,t)=>t.some(t=>cl(t,()=>ol(t,e))),dl=e=>e.kind===`MixedSet`||e.isNormalized?e.elements:e.writtenElements??e.elements,fl=e=>{typeof e==`object`&&(e.kind===`Set`&&(e.isNormalized=!0,e.elements.forEach(fl)),e.kind===`Function`&&(e.writtenKeys=void 0,e.domain.forEach(fl),e.range.forEach(fl)))},pl=e=>{if(!(typeof e!=`object`||Nc(e)))switch(e.kind){case`Set`:e.isNormalized=!0;return;case`MixedSet`:G(e);return;case`FilteredSet`:case`Subset`:return pl(e.base);case`SetOperation`:return e.operator===`\\cup`?void 0:(pl(e.left),pl(e.right));case`FunctionSet`:return pl(e.domain),pl(e.range);case`RecordSet`:return e.sets.forEach(pl);case`ProductSet`:return e.factors.forEach(pl)}},ml=(e,t)=>mu(zc,ol,e,t),hl=e=>{for(let t=1;t<e.length;t++)if(xc(e[t-1],e[t])>=0)return!1;return!0},gl=e=>{for(let t=0;t<e.length;t++){let n=e[t],r=t>0?e[t-1]:void 0;if(typeof n!=`number`||typeof r==`number`&&r>=n)return!1}return!0},_l=e=>{for(let t=1;t<e.length;t++)Lc(e[t]);if(e.length<2||hl(e))return Ec(e);let t=[...e].sort(xc),n=[t[0]];for(let e=1;e<t.length;e++)xc(n[n.length-1],t[e])!==0&&n.push(t[e]);return Ec(n)},vl=e=>{if(gl(e))return Ec(e);let t=mu(_l,e=>({kind:`MixedSet`,elements:e}),e,void 0);return t.kind===`Set`&&t.elements!==e&&(t.writtenElements=e),t},yl=Ec([]),bl=(e,t)=>{if(e.elements.length===0||t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&xc(r[a],t)<0;)a++;a<r.length&&xc(r[a],t)===0||i.push(t)}return i.length===n.length?e:Ec(i)},xl=(e,t)=>{let n=e.elements,r=t.elements,i=[],a=0;for(let e=0;e<n.length;e++){let t=n[e];for(;a<r.length&&xc(r[a],t)<0;)a++;a<r.length&&xc(r[a],t)===0&&i.push(t)}return i.length===n.length?e:Ec(i)},Sl=(e,t)=>{if(e.elements.length===0)return t;if(t.elements.length===0)return e;let n=e.elements,r=t.elements,i=[],a=[],o=0,s=0;for(;o<n.length&&s<r.length;){let e=xc(n[o],r[s]);e<0?i.push(n[o++]):e>0?(a.push(r[s]),i.push(r[s++])):(i.push(n[o++]),s++)}for(;o<n.length;)i.push(n[o++]);for(;s<r.length;)a.push(r[s]),i.push(r[s++]);if(a.length===0)return e;let c=Ec(i);if(e.hash!==0&&e.hash!==Wu){let t=e.hash,n=0;for(;n<a.length;n++){let e=Yu(a[n]);if(e===Wu)break;t=t+Hu(e)|0}n===a.length&&(c.hash=t)}if(e.fingerprint!==0){let t=e.fingerprint;for(let e=0;e<a.length;e++)t=t+Qu(a[e])|0;c.fingerprint=t}return c},Cl=e=>{let t=e.length<2?e:[...e].sort((e,t)=>xc(e[0],t[0])),n=[],r=[];for(let e of t)n.length>0&&xc(n[n.length-1],e[0])===0||(n.push(e[0]),r.push(e[1]));return Oc(n,r)},wl=e=>{let t=Cl(e);return t.domain.length!==e.length||e.every((e,n)=>e[0]===t.domain[n])?t:Bs(t,e.map(e=>e[0]))},Tl=[],El=/* @__PURE__ */ new Map,Dl=[],Ol=/* @__PURE__ */ new WeakMap,kl=e=>{let t=Tl[e]??El.get(e)?.deref();if(t)return t;let n=Array.from({length:e},(e,t)=>t+1);return e>1024?El.set(e,new WeakRef(n)):Tl[e]=n,n},Al=e=>{if(ou(e),e.low===1&&e.high>=1)return kl(e.high);let t=[];for(let n=e.low;n<=e.high;n++)t.push(n);return t},jl=e=>e.length>0&&(e===Tl[e.length]||e===El.get(e.length)?.deref())||Ol.has(e),Ml=e=>{let t=G(e).elements;return jl(t)&&(typeof e!=`object`||e.kind!==`Interval`)?[...t]:t},Nl=e=>{let t=Dl[e];if(t)return t;let n={kind:`Interval`,low:1,high:e};return Dl[e]=n,n},Pl=e=>Ac(Oc(kl(e.length),e),`tuple`),Fl=e=>Ac(Cl(e),`record`),Il=(e,t)=>Ac(Oc(e,t),`record`),Ll=e=>Ms(e)&&!mc(e),Rl=(e,t=!1)=>`UNION(${q(e.base,t)})`,zl=(e,t=e=>G(e).elements)=>{if(!Ll(e.base))throw new w(`Attempted to enumerate the nonenumerable set:\n${Rl(e)}`);return t(e.base)},Bl=(e,t,n)=>{if(Ll(e))return e;throw new w(t===0?`Attempted to enumerate UNION(s), but some element of s is nonenumerable.`:`Attempted to enumerate the nonenumerable set:\n${U(q(e))}\nwhen enumerating:\n${U(Rl(n))}`)},W=e=>{if(typeof e!=`object`)return!1;switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:return!0;case`InfiniteSet`:case`SequenceSet`:return!1;case`Subset`:case`FilteredSet`:return W(e.base);case`FunctionSet`:return W(e.domain)&&W(e.range)||Vl(e.domain)===!0||Vl(e)===!0;case`RecordSet`:return e.sets.every(W)||Vl(e)===!0;case`ProductSet`:return e.factors.every(W)||Vl(e)===!0;case`Union`:return W(e.base)&&(Is(e.base)?dl(e.base):Ql(e.base)).every(W);case`SetOperation`:return e.operator===`\\cup`?W(e.left)&&W(e.right):e.operator===`\\cap`?W(e.left)||W(e.right):W(e.left);default:return!1}},Vl=e=>{if(typeof e==`object`)switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:return e.name===`Any`&&void 0;case`Subset`:case`SequenceSet`:return!1;case`FunctionSet`:{let t=Vl(e.domain);return t===void 0?void 0:!t&&Vl(e.range)}case`RecordSet`:case`ProductSet`:for(let t of e.kind===`RecordSet`?e.sets:e.factors){let e=Vl(t);if(e!==!1)return e}return!1;case`SetOperation`:case`FilteredSet`:case`Union`:return W(e)?G(e).elements.length===0:void 0;default:return}},Hl=e=>{let t=e.reduce((e,t)=>e*t.length,1),n=[],r=e.map(()=>0);for(let i=0;i<t;i++){n.push(e.map((e,t)=>e[r[t]]));for(let t=e.length-1;t>=0&&(r[t]++,!(r[t]<e[t].length));t--)r[t]=0}return n},Ul=(e,t)=>{for(let n=e.length-1;n>=0;n--)if(e[n]<t-e.length+n){e[n]++;for(let t=n+1;t<e.length;t++)e[t]=e[t-1]+1;return!0}return!1},Wl=e=>{if(typeof e!=`object`||e.kind!==`Subset`||mc(e.base))return;let t=G(e.base).elements;if(t.length<=20)return;let n=-1,r=[0],i=e=>{for(e<=n&&(n=-1);n<e;)n===-1?r=[]:Ul(r,t.length)||(r=Array.from({length:r.length+1},(e,t)=>t)),n++;return Ec(r.map(e=>t[e]))},a=2**t.length,o=e=>typeof e==`string`&&/^\d+$/.test(e)&&Number(e)<a;return new Proxy([],{get:(e,t,n)=>t===`length`?a:o(t)?i(Number(t)):Reflect.get(e,t,n),has:(e,t)=>o(t)||Reflect.has(e,t)})},Gl=e=>{let t=[];for(let n=0;n<=e.length;n++){let r=Array.from({length:n},(e,t)=>t);do t.push(Ec(r.map(t=>e[t])));while(Ul(r,e.length))}return t},Kl=(e,t,n)=>{let r=[];for(let i=0;i<e.length;i++){let a=e[i];if(mc(a))throw new w(n(a,i));let o=t(a);if(o.length===0)return[[]];r.push(o)}return r},ql=(e,t=e=>G(e).elements)=>{if(typeof e!=`object`)throw new w(`Expected a set but found ${q(e)}`);switch(e.kind){case`Set`:return e.elements;case`MixedSet`:return sl(e.elements);case`Interval`:{let t=Al(e);return t!==Tl[t.length]&&Ol.set(t,e),t}case`Subset`:{if(ou(e.base)===0)return Gl([]);if(!Ms(e.base))throw new w(`Attempted to compute the value of an expression of form\nSUBSET S, but S is a non-enumerable value:\n${U(q(e.base))}`);let t=G(e.base).elements;if(t.length>30)throw new w(au(e));return Gl(t)}case`FunctionSet`:{if(!ic&&ru(e))return[];if(mc(e.domain))throw new w(`Attempted to enumerate a set of the form [D -> R],but the domain D:\n${U(q(e.domain))}\ncannot be enumerated.`);let n=Ml(e.domain);if((n.length>0||ic)&&mc(e.range))throw new w(`Attempted to enumerate a set of the form [D -> R],but the range R:\n${U(q(e.range))}\ncannot be enumerated.`);let r=n.length===0?[]:t(e.range);return Hl(n.map(()=>r)).map(e=>Oc(n,e))}case`RecordSet`:{if(!ic&&ru(e))return[];let n=Kl(e.sets,t,(t,n)=>`Attempted to enumerate a set of the form [l1 : v1, ..., ln : vn],\nbut can't enumerate the value of the \`${e.names[n]}' field:\n${U(q(t))}`);return Hl(n).map(t=>Fl(e.names.map((e,n)=>[e,t[n]])))}case`ProductSet`:{if(!ic&&ru(e))return[];let n=Kl(e.factors,t,(e,t)=>`Attempted to enumerate a set of the form s1 \\X s2 ... \\X sn,\nbut can't enumerate s${t}:\n${U(q(e))}`);return Hl(n).map(Pl)}case`FilteredSet`:if(!Ms(e.base)||mc(e.base))throw new w(`Attempted to enumerate { x \\in S : p(x) } when S:\n${U(q(e.base))}\nis not enumerable`);return G(vl(Ql(e.base).filter(e.startPass?.(!0)??(t=>e.test(t,!1))))).elements;case`Union`:{let t=[];return zl(e).forEach((n,r)=>{let i=Bl(n,r,e);if(As(i))throw new u(Os());Ql(i).forEach(e=>ks(t,e))}),G(vl(t)).elements}case`SetOperation`:{if(e.operator===`\\cap`&&!Ll(e.left)&&!Ll(e.right))throw new w(`Attempted to enumerate S \\cap T when neither S:\n${U(q(e.left))}\nnor T:\n${U(q(e.right))}\nis enumerable`);if(e.operator===`\\`&&!Ll(e.left))throw new w(`Attempted to enumerate S \\ T when S:\n${U(q(e.left))}\nis not enumerable.`);if(e.operator===`\\cup`)return G(vl(Yl(e))).elements;let t=e.operator===`\\`||Ll(e.left),n=t?e.left:e.right,r=t?e.right:e.left,i=[];return js(typeof n==`object`&&n.kind===`Interval`?n:Ql(n),t=>{gu(t,r)===(e.operator===`\\cap`)&&ks(i,t)}),G(vl(i)).elements}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to enumerate the non-enumerable set ${q(e)}`);default:throw new w(`Expected a set but found ${q(e)}`)}},G=e=>{if(typeof e==`object`&&e.kind===`Set`)return e;if(typeof e==`object`&&e.kind===`Interval`)return Ec(ql(e));let t=typeof e==`object`&&Ss(e)?e:void 0;if(t?.enumerated)return t.enumerated;let n=pu.sets;n?.push(e);let r=ql(e);n?.pop();let i=typeof e==`object`&&(e.kind===`MixedSet`||e.kind===`Union`||e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`ProductSet`||e.kind===`FunctionSet`||e.kind===`Subset`)?Ec(r):_l(r);return t&&(t.enumerated=i),i},Jl=e=>{if(!(typeof e!=`object`||Nc(e)))switch(e.kind){case`MixedSet`:G(e);return;case`FilteredSet`:return Ll(e.base)||G(e),Jl(e.base);case`Union`:if(!Is(e.base)&&Ll(e.base))return Jl(e.base);zl(e).slice(0,1).forEach(t=>Jl(Bl(t,0,e)));return;case`SetOperation`:e.operator===`\\`&&!Ll(e.left)&&G(e),e.operator!==`\\cup`||Ll(e.left)&&Ll(e.right)||G(e),e.operator!==`\\cap`||Ll(e.left)?Jl(e.left):Jl(e.right),e.operator===`\\cup`&&Jl(e.right)}},Yl=e=>{if(!Ll(e.left)||!Ll(e.right))throw new w(`Attempted to enumerate S \\cup T when S:\n${U(q(e.left))}\nand T:\n${U(q(e.right))}\nare not both enumerable`);if(Jl(e.left),Jl(e.right),As(e.left))throw new u(Os());let t=Ql(e.left),n=As(e.right)?void 0:Ql(e.right);if(!n||t.length+n.length>Ds())throw new u(Os());return[...t,...n]},Xl=e=>{if(typeof e!=`object`||e.kind!==`SetOperation`||e.operator!==`\\cup`||e.enumerated)return G(e).elements;let t=cl(e,()=>Yl(e)),n=G(vl(t)).elements;return e.enumerated=Ec(n),n},Zl=(e,t)=>{if(typeof e!=`object`||Nc(e))return G(e).elements.some(t);let n=pu.sets;n?.push(e),Jl(e);let r=nu(e,r=>{n?.pop();let i=t(r);return n?.push(e),i});return n?.pop(),r},Ql=e=>{let t=[];return Zl(e,e=>(t.push(e),!1)),t},$l=e=>e.kind===`ProductSet`?e.factors:e.kind===`RecordSet`?e.sets:e.kind===`FunctionSet`?[e.range]:void 0,eu=e=>{if(typeof e!=`object`)return!0;switch(e.kind){case`ModelValue`:case`Interval`:return!0;case`Set`:return e.elements.every(eu);case`Function`:return e.functionClass!==`lambda`&&e.writtenKeys===void 0&&e.domain.every(eu)&&e.range.every(eu);case`SetOperation`:return e.operator!==`\\cup`&&eu(e.left)&&eu(e.right);case`FilteredSet`:return eu(e.base);case`ProductSet`:return e.factors.every(eu);default:return!1}},tu=e=>typeof e!=`object`||Nc(e)?!1:e.kind===`Union`?!0:e.kind===`FilteredSet`?tu(e.base):e.kind===`SetOperation`?e.operator===`\\cup`||tu(e.left)||tu(e.right):$l(e)?.some(tu)??!1,nu=(e,t)=>{if(e.kind===`Union`)return zl(e,Ql).some((n,r)=>Zl(Bl(n,r,e),t));if(e.kind===`FilteredSet`&&Ll(e.base)){let n=e.startPass?.(!1);return n?Zl(e.base,e=>n(e)&&t(e)):Zl(e.base,n=>e.test(n,!1)&&t(n))}if($l(e)?.some(tu))return ql(e,Ql).some(t);if(e.kind!==`SetOperation`)return G(e).elements.some(t);if(e.operator===`\\cup`)return!Ll(e.left)||!Ll(e.right)?G(e).elements.some(t):Zl(e.left,t)||Zl(e.right,t);let n=e.operator===`\\`||Ll(e.left),r=n?e.left:e.right,i=n?e.right:e.left;return Ll(r)?Zl(r,n=>gu(n,i)===(e.operator===`\\cap`)&&t(n)):G(e).elements.some(t)},ru=e=>{if(typeof e!=`object`||!Ms(e))throw pu.sets?.push(e),new w(`Shouldn't call isEmpty() on value ${q(e)}`);switch(e.kind){case`Set`:case`MixedSet`:return e.elements.length===0;case`Interval`:return e.low>e.high;case`InfiniteSet`:if(e.name===`Any`)throw new w(`Shouldn't call isEmpty() on value ANY`);return!1;case`Subset`:case`SequenceSet`:return!1;case`ProductSet`:return e.factors.some(ru);case`RecordSet`:return e.sets.some(ru);case`FunctionSet`:return!ru(e.domain)&&ru(e.range);case`Union`:return zl(e).every((t,n)=>ru(Bl(t,n,e)));default:return G(e).elements.length===0}},iu=(e,t,n)=>e.reduce((e,r)=>{let i=e*ou(r,t);if(i>2147483647)throw new w(n());return i},1),au=e=>`Overflow when computing the number of elements in:\n${U(q(e))}`,ou=(e,t)=>{if(typeof e!=`object`)throw new w(`Attempted to compute the number of elements in the ${Ls(e)} ${U(q(e))}.`);switch(e.kind){case`ModelValue`:throw new w(`Attempted to compute the number of elements in the model value ${U(q(e))}.`);case`Function`:return e.domain.length;case`LazyFunction`:return ou(e.domain,t);case`Interval`:{let t=Math.max(0,e.high-e.low+1);if(t>2147483647)throw new w(`Size of interval value exceeds the maximum representable size (32bits): ${e.low}..${e.high}.`);return t}case`InfiniteSet`:case`SequenceSet`:throw new w(`Attempted to compute the number of elements in the overridden value ${U(q(e))}.`);case`Subset`:{let n=ou(e.base,t);if(n>=31)throw new w(au(e));return 2**n}case`FunctionSet`:{if(t!==`1.7.4`){if(ru(e.domain))return 1;if(ru(e.range))return 0;if(ou(e.range,t)===1)return 1}let n=ou(e.domain,t),r=ou(e.range,t);if(r<=1)return n===0?1:r;let i=1;for(let t=0;t<n;t++)if(i*=r,i>2147483647)throw new w(au(e));return i}case`RecordSet`:return t!==`1.7.4`&&ru(e)?0:iu(e.sets,t,()=>au(e));case`ProductSet`:return t!==`1.7.4`&&ru(e)?0:iu(e.factors,t,()=>`Overflow when computing the number of elements in ${U(q(e))}`);default:return Lc(e),G(e).elements.length}},su=e=>`Attempted to check if the set ${U(q(e))}is finite.`,cu=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)throw new w(`Attempted to check if the ${Ls(e)} ${U(q(e))} is a finite set.`);switch(e.kind){case`Set`:case`MixedSet`:case`Interval`:case`Function`:return!0;case`LazyFunction`:throw new w(`Attempted to check if the function:\n${U(q(e))}\nis a finite set.`);case`InfiniteSet`:return!1;case`SequenceSet`:return cu(e.base)&&ru(e.base);case`Subset`:return cu(e.base);case`FunctionSet`:{let t=cu(e.domain);if(t&&ru(e.domain))return!0;let n=cu(e.range);return n&&ru(e.range)?!0:n&&(t||ou(e.range)===1)}case`RecordSet`:case`ProductSet`:{let t=e.kind===`RecordSet`?e.sets:e.factors,n=!0;for(let e of t)if(!cu(e))n=!1;else if(ru(e))return!0;return n}case`Union`:if(!Ll(e.base))throw new w(`Attempted to check if the nonenumerable set:\n${Rl(e)}\nis a finite set.`);return G(e.base).elements.every(cu);case`SetOperation`:if(e.operator===`\\cup`)return cu(e.left)&&cu(e.right);if(e.operator===`\\cap`){if(!cu(e.left)&&!cu(e.right))throw new w(su(e));return!0}if(cu(e.left))return!0;if(!cu(e.right))throw new w(su(e));return!1;case`FilteredSet`:if(!cu(e.base))throw new w(`Attempted to check if expression of form {x \\in S : p(x)} is a finite set, but cannot check if S:\n${U(q(e.base))}\nis finite.`);return!0}},lu=(e,t,n=xc)=>{let r=0,i=e.length-1;for(;r<=i;){let a=r+i>>1,o=n(e[a],t);if(o===0)return a;o<0?r=a+1:i=a-1}return-1},uu=(e,t)=>{let n=e.elements;if(n.length>Ds())throw new u(Os());let r=Array.from({length:n.length},()=>!1),i=t.filter(e=>{let t=lu(n,e);return!r[t]&&(r[t]=!0,!0)}),a=Ec(n);return i.some((e,t)=>e!==n[t])&&(a.writtenElements=i),a},du=e=>{if(typeof e!=`object`||!Ps(e))return;if(e.kind===`LazyFunction`&&(!Ms(e.domain)||mc(e.domain)))throw new w(`To convert a function of form [x \\in S |-> f(x)] to a tuple, the set S must be enumerable.`);let t=K(e);return t.domain.every((e,t)=>e===t+1)?t.range:void 0},fu=(e,t)=>{let n=`Attempted to check if the value:\n${U(q(e))}\nis an element of the`;if(!Ps(t))return`${n} ${Ls(t)} ${U(q(t))}`;let r=jc(t);return r===`record`?`Attempted to check if element:\n${U(q(e))}\nis in the record:\n${U(q(t))}`:r===`tuple`?`Attempted to check set membership in a tuple value.`:`${n} function ${U(q(t))}`},pu={sets:void 0},mu=(e,t,n,r)=>{let i=pu.sets,a=pu.callStack,o=i?.length??0,s=a&&{...a,length:a.expressions.length};try{return e(n,r)}catch(e){if(!(e instanceof w))throw e;return i&&(i.length=o),a&&s&&(a.expressions.length=s.length,a.isFrozen=s.isFrozen,a.fingerprint=s.fingerprint),t(n,r,e)}},hu=e=>(pu.sets??[]).slice(e).some(e=>typeof e==`object`&&pu.callStack?.sources.has(e)===!0),gu=(e,t)=>{let n=pu.sets;if(n===void 0)return xu(e,t);n.push(t);let r=xu(e,t);return n.pop(),r},_u=(e,t)=>{let n=t.elements,r=0,i=n.length-1;for(;r<=i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;if(a===e)return!0;a<e?r=t+1:i=t-1}return!1},vu=(e,t)=>lu(t.elements,e)!==-1,yu=(e,t)=>t.isNormalized?ll(e,t.elements).isFound:ul(e,dl(t)),bu=(e,t)=>{if(e.type!==void 0)throw new w(`Attempted to check if the typed model value ${U(q(e))} is an element of\n${U(q(t))}`);return!1},xu=(e,t)=>{if(typeof e==`number`&&typeof t==`object`){if(t.kind===`Set`)return _u(e,t)??Su(e,t);if(t.kind===`Interval`)return e>=t.low&&e<=t.high}return Su(e,t)},Su=(e,n)=>{if(!Ms(n))throw new w(fu(e,n));switch(n.kind){case`Set`:return Lc(e),mu(vu,yu,e,n);case`MixedSet`:return ul(e,n.elements);case`Interval`:if(typeof e==`number`)return e>=n.low&&e<=n.high;if(n.low<=n.high&&(!Fs(e)||e.type!==void 0))throw new w(`Attempted to check if the value:\n${U(q(e))}\nis in the integer interval ${U(q(n))}`);return!1;case`InfiniteSet`:if(n.name===`Any`)return!0;if(Fs(e))return bu(e,n);if(!(n.name===`STRING`?typeof e==`string`:typeof e==`number`))throw new t(`Attempted to check if the value:\n${U(q(e))}\nis an element of ${n.name}.`);return n.name!==`Nat`||typeof e==`number`&&e>=0;case`Subset`:if(!Ms(e)||mc(e))throw new w(`Attempted to check if the non-enumerable value\n${U(q(e))}\nis element of\n${U(q(n))}`);return G(e).elements.every(e=>gu(e,n.base));case`FunctionSet`:{if(!Ps(e)){if(Fs(e))return bu(e,n);throw new w(`Attempted to check if \n${q(e)}\nwhich is not a TLC function value, is in the set of functions:\n${U(q(n))}`)}Ks(e);let t=K(e),r=Gc(e,t.domain);return(r===void 0?ml(n.domain,Ec(t.domain)):ml({kind:`Interval`,low:r,high:r+t.domain.length-1},n.domain))&&t.range.every(e=>gu(e,n.range))}case`RecordSet`:{Ks(e);let t=Ps(e)?K(e):void 0;if(!t||!qs(t.domain)){if(Fs(e))return bu(e,n);throw new w(`Attempted to check if non-record\n${q(e)}\nis in the set of records:\n${U(q(n))}`)}return t.domain.length===n.names.length&&n.names.every((e,r)=>{let i=lu(t.domain,e);return i!==-1&&gu(t.range[i],n.sets[r])})}case`ProductSet`:{let t=Ps(e)?du(e):void 0;if(t===void 0){let t=Ps(e)&&K(e).domain.every(e=>typeof e==`number`);if(Fs(e))return bu(e,n);if(t)return!1;throw new w(`Attempted to check if non-tuple\n${U(q(e))}\nis in the set of tuples:\n${U(q(n))}`)}return t.length===n.factors.length&&t.every((e,t)=>gu(e,n.factors[t]))}case`FilteredSet`:try{return gu(e,n.base)&&n.test(e,!0)}catch(t){throw!(t instanceof w)||!rs(t)?t:new w(`Cannot decide if element:\n${U(q(e))}\n is element of:\n${U(q(n.base))}\nand satisfies the predicate ${n.source?.predicate}`)}case`Union`:{if(!Ll(n.base))throw new w(`Attempted to check if:\n ${U(q(e))}\nis an element of the non-enumerable set:\n ${U(Rl(n))}`);let t=G(n.base).elements;return t.length>1&&t.forEach(e=>{typeof e==`object`&&e.kind===`Set`&&(e.isNormalized=!0)}),t.some(t=>gu(e,t))}case`SetOperation`:return n.operator===`\\cup`?gu(e,n.left)||gu(e,n.right):gu(e,n.left)&&gu(e,n.right)===(n.operator===`\\cap`);case`SequenceSet`:{let r=du(e);if(r===void 0){if(Fs(e))return bu(e,n);throw new t(`Attempted to check if the value:\n${U(q(e))}\nis an element of ${U(q(n))}.`)}return r.every(e=>gu(e,n.base))}default:throw new w(fu(e,n))}},Cu=(e,t,n)=>e===t?!0:typeof e!=`object`||typeof t!=`object`||typeof n!=`object`||e.kind!==`Function`||t.kind!==`Function`||n.kind!==`FunctionSet`||e.domain!==t.domain?gu(e,n):e.range.every((e,r)=>Cu(e,t.range[r],n.range)),K=e=>{if(typeof e==`object`&&e.kind===`Function`)return e;if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return e.enumerated;if(W(e.domain)||ou(e.domain),!Ms(e.domain))throw new w(`The domains of formal parameters must be enumerable.`);let t=Ml(e.domain);return e.enumerated=Oc(t,t.map(t=>e.apply(t))),e.enumerated}throw new w(`Expected a function but found ${q(e)}`)},wu=(e,t,n)=>{let r=U(q(e)),i=U(q(t)),a=n===`1.7.4`;switch(jc(e)){case`lambda`:return`In applying the function\n${r},\nthe first argument is:\n${i}\nwhich is not in its domain.\n`;case`tuple`:return typeof t==`number`?a?`Attempted to apply tuple\n${r}\nto integer ${t} which is out of domain.`:`Attempted to access index ${t} of tuple\n${r}\nwhich is out of bounds.`:a?`Attempted to apply tuple to a non-integer argument.`:`Attempted to access tuple at a non integral index: ${i}`;case`record`:return typeof t==`string`?a?`Attempted to apply the record\n${r}\nto nonexistent record field ${t}.`:`Attempted to access nonexistent field '${t}' of record\n${r}`:a?`Attempted to apply record to a non-string value ${i}.`:`Attempted to access record by a non-string argument: ${i}`;default:return`Attempted to apply function:\n${r}\nto argument ${i}, which is not in the domain of the function.`}},Tu=(e,t)=>{if(!ic)return wu(e,t);let n=U(q(t));return jc(e)===`tuple`?`Attempted to apply tuple to a non-integer argument ${n}.`:`Attempted to apply record to a non-string argument ${n}.`},Eu=(e,t)=>{let n=e[0];if(typeof t==`number`&&typeof n==`number`){let r=t-n;if(e[r]===t)return r}return e.length<=8?e.indexOf(t):-1},Du=e=>new w(`Attempted to apply function with integer domain to the non-integer argument ${U(q(e))}`),Ou=(e,t)=>lu(e.domain,t),ku=(e,t,n)=>{let r=Vs(e);throw ic||r!==e.domain||r.length<32?r.forEach(e=>ol(e,t)):lu(r,t,al),n},Au=(e,t,n)=>{let r=e.domain;if(typeof t!=typeof r[0]){let i=jc(e),a=i===`tuple`?`number`:i===`record`?`string`:void 0;if(a!==void 0&&typeof t!==a)throw new w(n(e,t));if(a===void 0&&!ic&&typeof t!=`number`&&jl(r))throw Du(t)}let i=Eu(r,t);return i===-1?mu(Ou,ku,e,t):i},ju=(e,t,n,r)=>`In applying the function\n${U(q(e))},\nthe ${t} is:\n${U(q(n))}\nwhich ${r}.\n`,Mu=(e,t)=>new w(ju(e,`argument list`,t,`does not match its formal parameter`)),Nu=(e,t,n)=>{let r=e.domain,i=du(n);if(i===void 0)throw Mu(e,n);if(typeof r!=`object`||r.kind!==`ProductSet`)throw new w(`Attempted to apply a function to ${q(n)}, which is not in its domain`);if(t.forEach((t,a)=>{if(a>=i.length)throw Mu(e,n);let o=i[a],s=`argument number ${a+1}`;if(!gu(o,r.factors[a]))throw new w(ju(e,s,o,t===void 0?`is not in the function's domain ${q(r)}`:`is not in its domain`));if(t!==void 0&&du(o)?.length!==t)throw new w(ju(e,s,o,`does not match its formal parameter`))}),i.length>t.length)throw Mu(e,n)},Pu=(e,t)=>e.lambdaDomain!==void 0&&e.hash===0&&e.fingerprint===0&&!gu(t,e.lambdaDomain),Fu=(e,t,n)=>{if(typeof e==`object`&&e.kind===`LazyFunction`){if(e.enumerated)return Fu(e.enumerated,t,n);let r=e.boundTupleLengths;if(r!==void 0)return Nu(e,r,t),e.apply(t);if(!gu(t,e.domain))throw new w(jc(e)===`lambda`?wu(e,t):`Attempted to apply a function to ${q(t)}, which is not in its domain`);return e.apply(t)}if(typeof e!=`object`||e.kind!==`Function`)throw new w(`Attempted to apply ${q(e)}, which is not a function`);let r=n??wu;if(Pu(e,t))throw new w(r(e,t));let i=Au(e,t,r);if(i===-1)throw new w(r(e,t));return e.range[i]},Iu=e=>jl(e)?Ol.get(e)??Nl(e.length):void 0,Lu=e=>{if(typeof e==`object`&&e.kind===`LazyFunction`)return e.domain;let t=K(e);if(t.functionClass===`lambda`&&t.lambdaDomain)return t.lambdaDomain;let n=Iu(t.domain);if(n)return n;let r=Ec(t.domain);return t.functionClass===`record`?(t.writtenKeys&&(r.writtenElements=t.writtenKeys),r):(r.isNormalized=!0,r)},Ru=(e,t,n,r=!1)=>{if(typeof e==`object`&&e.kind===`LazyFunction`&&(r||e.enumerated===void 0)){if(e.boundTupleLengths!==void 0&&du(t)===void 0)throw Mu(e,t);if(!gu(t,e.domain))return e;let r=n(e.apply(t));return Ac({kind:`LazyFunction`,domain:e.domain,apply:n=>ml(t,n)?r:e.apply(n),source:e.source,boundTupleLengths:e.boundTupleLengths},jc(e))}if(!Ps(e))throw new w(`Attempted to apply EXCEPT construct to the value ${U(q(e))}.`);let i=K(e);if(Pu(i,t))return i;let a=Au(i,t,Tu);if(a===-1)return i;let o=[...i.range],s=i.range[a],c=n(s);o[a]=c;let l=Ac(Oc(i.domain,o),jc(i));if(l.writtenKeys=i.writtenKeys,l.lambdaDomain=i.lambdaDomain,i.hash!==0&&i.hash!==Wu){let e=Yu(c);if(e!==Wu){let t=Yu(i.domain[a]);l.hash=s===c?i.hash:i.hash-Uu(t,Yu(s))+Uu(t,e)|0}}if(i.fingerprint!==0){let e=i.domain[a];l.fingerprint=s===c?i.fingerprint:i.fingerprint-$u(e,s)+$u(e,c)|0}return l},zu=e=>{let t=Math.imul(e^e>>>16,2246822507),n=Math.imul(t^t>>>13,3266489909);return n^n>>>16},Bu=(e,t)=>Math.imul(e^t,16777619),Vu=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),16777619);return zu(t)},Hu=e=>zu(e+2654435769|0),Uu=(e,t)=>zu(Math.imul(e,668265261)+t|0),Wu=795548749,Gu=e=>{if(e.kind===`Set`){let t=e.elements,n=1940243425;for(let e=0;e<t.length;e++){let r=Yu(t[e]);if(r===Wu)return Wu;n=n+Hu(r)|0}return n}let t=1725019383;for(let n=0;n<e.domain.length;n++){let r=Yu(e.domain[n]),i=Yu(e.range[n]);if(r===Wu||i===Wu)return Wu;t=t+Uu(r,i)|0}return t},Ku=e=>{if(typeof e!=`object`||e.kind===`ModelValue`)return;if(e.kind===`InfiniteSet`||e.kind===`SequenceSet`)throw new w(`TLC has found a state in which the value of a variable contains ${U(q(e))}`);if(Ms(e)){G(e).elements.forEach(Ku);return}let t=K(e);t.domain.forEach(Ku),t.range.forEach(Ku)},qu=e=>{if(typeof e==`object`&&e.kind!==`ModelValue`)try{Yu(e)===Wu&&Ku(e);return}catch(e){if(!(e instanceof w))throw e;return e}},Ju=e=>{switch(e.kind){case`Set`:case`MixedSet`:return e.elements;case`Function`:return[...e.domain,...e.range];case`Subset`:case`SequenceSet`:case`FilteredSet`:case`Union`:return[e.base];case`FunctionSet`:return[e.domain,e.range];case`RecordSet`:return e.sets;case`ProductSet`:return e.factors;case`SetOperation`:return[e.left,e.right];case`LazyFunction`:return[e.domain];default:return[]}},Yu=e=>typeof e==`number`?zu(e^1540483477):typeof e==`boolean`?e?729683222:682545830:typeof e==`string`?Vu(e):e.kind===`Set`||e.kind===`Function`?(e.hash===0&&(e.hash=Gu(e)),e.hash):e.kind===`ModelValue`?e.hash:e.kind===`LazyFunction`?W(e.domain)?Yu(K(e)):Wu:W(e)?Yu(G(e)):Wu,Xu=e=>{let t=Math.imul(e^e>>>15,739982445),n=Math.imul(t^t>>>12,695872825);return n^n>>>15},Zu=e=>{let t=2538058380;for(let n=0;n<e.length;n++)t=Math.imul(t^e.charCodeAt(n),1540483477);return Xu(t)},Qu=e=>Xu(td(e)+2135587861|0),$u=(e,t)=>Xu(Math.imul(td(e),374761393)+td(t)|0),ed=e=>{if(e.kind===`Set`){let t=e.elements,n=461845907;for(let e=0;e<t.length;e++)n=n+Qu(t[e])|0;return n}let t=1291169091;for(let n=0;n<e.domain.length;n++)t=t+$u(e.domain[n],e.range[n])|0;return t},td=e=>typeof e==`number`?Xu(e^1759714724):typeof e==`boolean`?e?1000000007:521288629:typeof e==`string`?Zu(e):e.kind===`Set`||e.kind===`Function`?(e.fingerprint===0&&(e.fingerprint=ed(e)),e.fingerprint):e.kind===`ModelValue`?e.fingerprint:e.kind===`LazyFunction`?td(K(e)):W(e)?td(G(e)):Zu(nd(e)),nd=e=>typeof e==`boolean`?e?`T`:`F`:typeof e==`number`?String(e):typeof e==`string`?JSON.stringify(e):rd(e),rd=e=>{if(e.kind===`ModelValue`)return`@${e.name}`;if(e.kind===`InfiniteSet`)return`<${e.name}>`;if(e.kind===`SequenceSet`)return`<Seq ${nd(e.base)}>`;if(e.kind===`FilteredSet`&&!W(e))throw new w(`Attempted to compare the non-enumerable set ${q(e)} with another value`);if(Ms(e))return W(e)?`{${G(e).elements.map(nd).join(`,`)}}`:`<${e.kind} ${q(e)}>`;let t=K(e);return`(${t.domain.map((e,n)=>`${nd(e)}:${nd(t.range[n])}`).join(`,`)})`},id={'"':`\\"`,"\\":`\\\\`," ":`\\t`,"\n":`\\n`,"\f":`\\f`,"\r":`\\r`},ad=e=>`"${e.replace(/["\\\t\n\f\r]/g,e=>id[e])}"`,od=1999,sd=e=>e.reduce((e,t)=>e===0?0:e*ou(t),1),cd=e=>{if(e.kind===`Subset`)return ou(e.base)<=6?G(e):void 0;if(e.kind===`SetOperation`||e.kind===`FilteredSet`||e.kind===`Union`)return G(e);if(e.kind===`FunctionSet`){let t=ru(e.domain)?0:ou(e.domain);return(t===0?1:ou(e.range)**t)<=od?G(e):void 0}return sd(e.kind===`RecordSet`?e.sets:e.factors)<=od?G(e):void 0},ld=(e,t)=>{if(t||e.kind===`Union`||e.kind===`Subset`&&Ps(e.base)&&(e.base.kind===`Function`||W(e.base.domain)))return cd(e);if(W(e))try{return cd(e)}catch(e){if(e instanceof w)return;throw e}},ud=(e,t)=>{let n=e=>q(e,t);switch(e.kind){case`Subset`:return typeof e.base==`object`&&e.base.kind===`Interval`?`SUBSET (${n(e.base)})`:`SUBSET ${n(e.base)}`;case`FunctionSet`:return`[${n(e.domain)} -> ${n(e.range)}]`;case`RecordSet`:return`[${e.names.map((t,r)=>`${t}: ${n(e.sets[r])}`).join(`, `)}]`;case`ProductSet`:return`(${e.factors.map(n).join(` \\X `)})`;case`SetOperation`:return`${n(e.left)} ${e.operator} ${n(e.right)}`;case`FilteredSet`:return e.source?`{${e.source.names} \\in ${n(e.base)} : <expression ${e.source.predicate}> }`:`{x \\in ${n(e.base)} : ...}`;case`Union`:return Rl(e,t)}},dd=e=>/^[\p{L}\p{Nd}_]*$/u.test(e)&&/\p{L}/u.test(e)&&(e.length<4||!/^[WS]F_/.test(e)),fd=e=>{if(W(e.domain))try{return K(e)}catch(e){if(e instanceof w||te(e))return;throw e}},pd=e=>{let t=[],n=[],r=[],i=(e,a,o)=>{if(typeof e!=`object`)return;let s=e=>i(e,a,!1);switch(e.kind){case`Set`:if(e.elements.forEach(s),e.isNormalized)return;e.isNormalized=!0,t.push(e);return;case`MixedSet`:e.elements.forEach(s),G(e);return;case`Function`:{let t=a||jc(e)===`lambda`;if(e.range.forEach(e=>i(e,t,o)),a||e.writtenKeys===void 0)return;n.push([e,e.writtenKeys]),e.writtenKeys=void 0;return}case`LazyFunction`:if(e.enumerated)return i(e.enumerated,!0,o);o&&r.push(e),s(e.domain);return;case`SetOperation`:s(e.left),s(e.right);return;case`FunctionSet`:s(e.domain),s(e.range);return;case`RecordSet`:e.sets.forEach(s);return;case`ProductSet`:e.factors.forEach(s);return;case`Subset`:case`Union`:case`FilteredSet`:case`SequenceSet`:s(e.base);return;default:return}};try{return e.forEach(e=>i(e,!1,!0)),e.map(e=>q(e,!0,!0))}finally{t.forEach(e=>{e.isNormalized=!1}),r.forEach(e=>{e.enumerated=void 0}),n.forEach(e=>{e[0].writtenKeys=e[1]})}},q=(e,t=!1,n=!1)=>{let r=e=>q(e,t,n);if(typeof e==`boolean`)return e?`TRUE`:`FALSE`;if(typeof e==`number`)return String(e);if(typeof e==`string`)return ad(e);switch(e.kind){case`ModelValue`:return e.name;case`Set`:return`{${e.elements.map(r).join(`, `)}}`;case`MixedSet`:return r(G(e));case`Interval`:return e.low<=e.high?`${e.low}..${e.high}`:`{}`;case`InfiniteSet`:return e.name===`Any`?`ANY`:e.name;case`Subset`:case`FunctionSet`:case`RecordSet`:case`ProductSet`:case`SetOperation`:case`FilteredSet`:case`Union`:{let n=ac.isExpanded?ld(e,t):void 0;return n?r(n):ud(e,t)}case`SequenceSet`:return`Seq(${r(e.base)})`;case`Function`:case`LazyFunction`:{let i=e.kind===`LazyFunction`?ac.isExpanded||!e.source?fd(e):void 0:e;if(i===void 0){let t=e.kind===`LazyFunction`?e.source:void 0;return t?`[${t.parameters.map(e=>`${e.name} \\in ${q(e.domain)}`).join(`, `)} |-> <expression ${t.body}>]`:`<function>`}if(i.domain.length===0&&ic&&jc(e)!==`tuple`)return`<< >>`;let a=r=>q(r,t,n&&jc(e)!==`lambda`);if(i.domain.length===0&&jc(e)===`record`)return`[]`;if(i.domain.every((e,t)=>e===t+1))return`<<${i.range.map(a).join(`, `)}>>`;let o=n?i.domain.map((e,t)=>[e,i.range[t]]):Us(i);return jc(e)===`record`||i.domain.every(e=>typeof e==`string`&&dd(e))?`[${o.map(e=>`${String(e[0])} |-> ${a(e[1])}`).join(`, `)}]`:`(${o.map(e=>`${r(e[0])} :> ${a(e[1])}`).join(` @@ `)})`}}},md=(e,t)=>{if(e===void 0)return!1;try{return zc(e,t)}catch(e){if(e instanceof w)return!1;throw e}},hd=/%(\d+\$)?([-#+ 0,(<]*)(\d+)?(\.\d+)?(.?)/gs,gd=(e,t)=>{let n=0,r=-1,i=!0,a=e.replace(hd,(e,a,o=``,s,c,l=``)=>{let u=e=>o.includes(`-`)?e.padEnd(Number(s)):e.padStart(Number(s??0)),d=o.includes(`<`),f=o.replace(`<`,``);if(l===`n`&&e===`%n`)return`
|
|
400
|
+
`;if(l===`%`&&c===void 0&&/^-?$/.test(f))return f===`-`&&s===void 0&&(i=!1),u(`%`);let p=d?r:a===void 0?n++:Number(a.slice(0,-1))-1;r=p;let m=t[p];if(!`sSbBhH`.includes(l)||l===``||!/^-?$/.test(f)||f===`-`&&s===void 0||m===void 0)return i=!1,e;let h=l.toLowerCase(),g=h===`s`?m:h===`b`?`true`:(bi(m)>>>0).toString(16),_=u(c===void 0?g:g.slice(0,Number(c.slice(1))));return l===h?_:_.toUpperCase()});return i?a:void 0},_d=(e,t)=>{let n=t?void 0:sc.get(e);if(n)return n();let r=Object.entries(e),i=lc.get(e),a=i!==void 0&&`_format`in e,o=a?e._format:r.length===1?`%s = %s
|
|
401
|
+
`:`/\\ %s = %s
|
|
402
|
+
`;if(typeof o!=`string`)throw new _(`The _format field of the ALIAS ${i} is ${q(o)}, but it must be a string.`);return r.filter(e=>!(a&&e[0]===`_format`)).filter(e=>!t||!md(t[e[0]],e[1])).map(e=>{let t=gd(o,[e[0],U(q(e[1]))]);if(t===void 0)throw new _(`The _format field of the ALIAS ${i} is ${q(o)}, but it must format two strings, the name and the value of a field.`);return t}).join(``)},vd=[10454148508367108822n,15747411856486957441n,13848313129918172575n,15427004735118145554n,14338780731064426356n,15931650522396165332n,17670238537108149059n,12816660938095048951n,13192168525635896882n,16119298732711755075n,13564417994159519395n,15831473429641889162n,17671735485712653535n,14582471876431321160n,9288673424107444897n,12345523232675890545n,13774063780198914517n,10636128657019767374n,13227535641082688945n,10085966873248490402n,17056045221983369811n,18027133543548002442n,13033986364717636900n,12663388180492401538n,11007194744055901935n,16251515628090973732n,18046429724439772544n,9876734796024595817n,14949643787442512870n,16960057143726945461n,10590203213448744021n,12248592797044284137n,9558805810925624286n,16993321702164258530n,11754329512098378960n,12074934892440206921n,15696745233288286746n,10531590977001201739n,18107999685377398317n,12149369488538049728n,12923655455904407421n,10507099144397364930n,17322088528956367024n,14653973644796244054n,15165509594857513400n,13554280709034297251n,16228911470502883382n,17115369786458865383n,11179220607102683830n,16708422618246866334n,12295941796329322556n,18336630348474106240n,13989616001589685348n,14822072159597151759n,14264172520427195041n,11642530518213145397n,11877331515501935358n,13913116192159715440n,17054474839259161580n,13461230878584418056n,16058025410470398786n,11100471369705097435n,11133782763824505275n,13192312712502684421n,17456091706045076157n,13237272598629075916n,12914531898895761383n,15801841604014567326n,16446055517513626294n,16780923767715884464n,15104658705803254918n,10882049990920163451n,12728112724252049190n,11720209067562733740n,16476221075563830086n,16602801460297162326n,16206898064012585915n,12158475401238648099n,13742285336487677729n,15543703592025073839n,9615783578189153721n,16710542608962839044n,11960730242263336692n,13328718558362718101n,12971616006464047952n,17057853503483465676n,16180230282101315295n,15483523553568578902n,17773465781871025571n,18047252642493037509n,11580640560664688668n,10121963531818974651n,14218267149826330657n,12715294421139777506n,10584764766358778171n,12666843443693621286n,17403948736867619210n,17907955559063099692n,15179434392748515198n,15413469521140985247n,13455040338347572751n,15419348191054617477n,12340568220039846914n,13236419189535069162n,18074463254581147189n,10818750974828329405n,9859349269386152082n,15035006154709018396n,13627907273947709876n,9549035931546940138n,16199589727945564820n,10285831968679942330n,17737018494601061698n,15477896647372134857n,13595764249822586512n,10556855812148546550n,12421897615105552821n,15477767459253848096n,17421607461439241175n,12409061346569762725n,13621778224251023638n,10680972825126675886n,16494492050207190715n,16801324317763555620n,12664650400804916358n,16134230614391269483n,10027806175083075147n,9259037851175017999n,11803214621941906429n,9537357587847606069n,10517495000576890277n];let yd=vd[0];const bd=()=>yd,xd=/* @__PURE__ */ new Int32Array(256),Sd=/* @__PURE__ */ new Int32Array(256),Cd=/* @__PURE__ */ new Int32Array(256),wd=/* @__PURE__ */ new Int32Array(256),Td=/* @__PURE__ */ new Int32Array(256),Ed=/* @__PURE__ */ new Int32Array(256),Dd=/* @__PURE__ */ new Int32Array(256),Od=/* @__PURE__ */ new Int32Array(256);let kd=0,Ad=0,jd=0,Md=0;const Nd=e=>{let t=(e^Md)&255;Md=(Md>>>8|jd<<24)^Td[t],jd=jd>>>8^xd[t]},Pd=e=>{let t=vd[e];yd=t;let n=[];for(let e=1n<<63n;n.length<72;)n.push(e),e=e>>1n^((e&1n)==0n?0n:t);let r=n.slice(64,72).reverse();for(let e=0;e<256;e++){let t=r.reduce((t,n,r)=>e>>r&1?t^n:t,0n);xd[e]=Number(BigInt.asIntN(32,t>>32n)),Td[e]=Number(BigInt.asIntN(32,t))}let i=[xd,Sd,Cd,wd],a=[Td,Ed,Dd,Od];for(let e=1;e<4;e++){let t=i[e-1],n=a[e-1];for(let r=0;r<256;r++){let o=n[r]&255;a[e][r]=(n[r]>>>8|t[r]<<24)^Td[o],i[e][r]=t[r]>>>8^xd[o]}}kd=Number(BigInt.asIntN(32,t>>32n)),Ad=Number(BigInt.asIntN(32,t))};Pd(0);const Fd=e=>{let t=Md^e,n=t&255,r=t>>>8&255,i=t>>>16&255,a=t>>>24;Md=jd^Od[n]^Dd[r]^Ed[i]^Td[a],jd=wd[n]^Cd[r]^Sd[i]^xd[a]},Id=e=>{if(typeof e==`boolean`)return Nd(0),Nd(e?116:102),2;if(typeof e==`number`)return Nd(1),Fd(e),5;if(typeof e==`string`){Nd(3),Fd(e.length);let t=e.length&-4;for(let n=0;n<t;n+=4)Fd(e.charCodeAt(n)&255|(e.charCodeAt(n+1)&255)<<8|(e.charCodeAt(n+2)&255)<<16|(e.charCodeAt(n+3)&255)<<24);for(let n=t;n<e.length;n++)Nd(e.charCodeAt(n));return 5+e.length}return Nd(21),Fd(fc(e.name)+1),5},Ld=e=>{let t=jd,n=Md;jd=0,Md=0;let r=[Id(e),jd,Md];return jd=t,Md=n,r},Rd=e=>`m = (${e} ^ l) & 255; l = ((l >>> 8) | (h << 24)) ^ L0[m]; h = (h >>> 8) ^ H0[m];`,zd=e=>`m = l ^ ${e}; l = h ^ L3[m & 255] ^ L2[(m >>> 8) & 255] ^ L1[(m >>> 16) & 255] ^ L0[m >>> 24]; h = H3[m & 255] ^ H2[(m >>> 8) & 255] ^ H1[(m >>> 16) & 255] ^ H0[m >>> 24];`,Bd={integer:e=>`${Rd(`1`)} ${zd(e)}`,boolean:e=>`${Rd(`0`)} ${Rd(`(${e} ? 116 : 102)`)}`,set:e=>`${Rd(`5`)} ${zd(e)}`,function:e=>`${Rd(`9`)} ${zd(e)}`,scalar:(e,t,n)=>`{ let r = ${e}; for (; r >= 4; r -= 4) { ${zd(`0`)} } for (; r > 0; r--) { ${Rd(`0`)} } h ^= ${t}; l ^= ${n}; }`},Vd=()=>({H0:xd,H1:Sd,H2:Cd,H3:wd,L0:Td,L1:Ed,L2:Dd,L3:Od,initialHigh:kd,initialLow:Ad}),Hd=(e,t)=>{let n=jd,r=Md;Md=e[0],jd=e[1],Gd(t),e[0]=Md,e[1]=jd,jd=n,Md=r},Ud=e=>{Nd(5),Fd(e)},Wd=e=>{Nd(9),Fd(e)},Gd=e=>{if(typeof e!=`object`||Fs(e))Id(e);else if(Ps(e)){let t=K(e);Wd(t.domain.length);for(let e=0;e<t.domain.length;e++)Gd(t.domain[e]),Gd(t.range[e])}else{let t=G(e).elements;Ud(t.length);for(let e of t)Gd(e)}},Kd=e=>{let t=jd,n=Md;jd=kd,Md=Ad;for(let t of e)Gd(t);let r=BigInt(jd>>>0)<<32n|BigInt(Md>>>0);return jd=t,Md=n,r},qd=(e,t)=>{let n=new BigInt64Array(e),r=new Int32Array(n.buffer),i=jd,a=Md;for(let n=0;n<e;n++)jd=kd,Md=Ad,t(n),r[2*n]=Md,r[2*n+1]=jd;return jd=i,Md=a,n},Jd=(e,t)=>qd(e.length,n=>{for(let r of t)Gd(e[n][r])}),Yd=/* @__PURE__ */ new WeakMap,Xd=/* @__PURE__ */ new Set([`FiniteSets`,`Sequences`,`Bags`,`Naturals`,`Integers`,`Reals`,`RealTime`,`Randomization`,`TLC`]),Zd=1024,Qd=e=>({current:-1,expressions:[],ranges:[],firstChild:[],lastChild:[],nextSibling:[],prefixes:[],isPart:[],isPrimed:[],isUnchanged:[],recursive:[],lets:[],roots:[],primary:[],secondary:[],covered:/* @__PURE__ */ new WeakSet,values:/* @__PURE__ */ new WeakMap,registers:new Uint8Array(e*Zd),relations:[]}),$d=(e,t)=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,coverage:t}),ef=(e,t,n,r,i)=>{let a=e.expressions.length;if(e.expressions.push(t),e.ranges.push(n),e.firstChild.push(-1),e.lastChild.push(-1),e.nextSibling.push(-1),e.prefixes.push(-1),e.isPart.push(i),e.isPrimed.push(!1),e.isUnchanged.push(t?.kind===`Unchanged`),e.recursive.push(-1),e.lets.push(void 0),e.roots.push(r===-1?a:e.roots[r]),e.primary.push(0),e.secondary.push(0),t&&e.covered.add(t),r===-1)return a;let o=e.lastChild[r];return o===-1&&(e.firstChild[r]=a),o!==-1&&(e.nextSibling[o]=a),e.lastChild[r]=a,a},tf=(e,t,n)=>e.relations.find(e=>e.kind===t&&e.expression===n)?.node,nf=e=>e.location.range??(e.kind===`Let`?e.body.location.range:void 0),rf=(e,t,n,r,i)=>{let a=t===`next`?tf(e,t,r):void 0;if(a!==void 0)return a;let o=ef(e,void 0,nf(r),-1,!1);return e.relations.push({kind:t,label:n,expression:r,scope:i,node:o}),o},af=(e,t)=>e!==void 0&&t!==void 0&&e.module===t.module&&e.start.line===t.start.line&&e.start.column===t.start.column&&e.end.line===t.end.line&&e.end.column===t.end.column,of=(e,t,n)=>{let r=e===void 0?void 0:n.definitions.get(e),i=r?.kind===`Operator`?r.head:void 0,a=nf(t);return!r||!i?`Action ${a?m(a):`Unknown location`}`:af(nf(r.body),a)||!a?`${r.name} ${m(i)}`:`${r.name} ${m(i)} (${a.start.line} ${a.start.column} ${a.end.line} ${a.end.column})`},sf=e=>`${e.module}:${e.start.line}:${e.start.column}:${e.end.line}:${e.end.column}`,cf=(e,t)=>e&&t?{module:e.module,start:e.start,end:t.end}:void 0,lf=(e,t)=>t&&{module:t.module,start:e.range?.start??{line:e.line,column:e.column},end:t.end},uf=e=>{let t=Array.from({length:11},()=>[]);return e.forEach((e,n)=>{if(n>=Math.floor(t.length*.75)){let e=Array.from({length:t.length*2+1},()=>[]);for(let n=t.length-1;n>=0;n--)t[n].forEach(t=>e[(bi(t.name)&2147483647)%e.length].unshift(t));t=e}t[(bi(e.name)&2147483647)%t.length].unshift(e)}),t.toReversed().flat()},df=e=>e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[t.set]),ff=(e,t)=>e.reduce((e,t)=>({name:t,definition:void 0,scope:void 0,parent:e}),t),pf=(e,t)=>{let n=e.reduce((e,t)=>({name:t.name,definition:t,scope:void 0,parent:e}),t);for(let e=n;e!==t&&e;e=e.parent)e.scope=n;return n},mf=e=>e.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names),hf=(e,t,n)=>{let r=new Set(n.map(sf)),i=[],a=[],o=[],s=/* @__PURE__ */ new Map,c=(e,n,r)=>{if(M(e)){for(let e=r;e;e=e.parent)if(e.name===n)return e.definition&&{definition:e.definition,scope:e.scope};return}let i=t.substitutions.get(n)??n;if(t.variableIndex.has(i)||t.constants.has(i))return;let a=t.definitions.get(i),o=a?.location.range?.module??a?.body.location.range?.module;return a&&!Xd.has(o??``)?{definition:a,scope:void 0}:void 0},l=(t,n,o,c=!1,l)=>{let u=ef(e,t,n,i.at(-1)??-1,c);e.isPrimed[u]=n!==void 0&&r.has(sf(n));let d=t&&s.get(t);if(d&&i.forEach(t=>{e.expressions[t]===d&&(e.lets[t]??=[]).push(u)}),l?.kind===`Operator`&&l.isRecursive){let t=i.findLast(e=>a[e]===l);t!==void 0&&(e.recursive[u]=t)}return a[u]=l,i.push(u),o(),i.pop(),u},u=e=>{let t=e.definition;if(o.includes(t))return;o.push(t);let n=t.kind===`Function`?mf(t.bounds):t.params.map(e=>e.name);if(t.kind===`Function`){let r=e.scope!==void 0;l(mt(t,r),t.location.range,()=>{m(t.body,ff(n,e.scope)),df(t.bounds).forEach(t=>m(t,e.scope))})}else m(t.body,ff(n,e.scope));o.pop()},d=e=>e?.definition.kind===`Operator`&&e.definition.params.length>0,f=(e,t,n,r)=>{if(e.kind===`Lambda`)m(e.body,ff(e.params,r));else{if(e.kind===`Identifier`){let i=c(e,e.name,r);if(n?.kind===`Operator`&&(n.params[t]?.arity??0)>0||d(i)){i&&u(i);return}}m(e,r)}},p=(t,n,r,a)=>l(n===t.operands.length?t:void 0,r,()=>{let o=t.operands;if(n>2&&!t.isBulleted){let s=t.prefixEnds?.[n-3],c=p(t,n-1,r&&s?{...r,end:s}:r,a);e.prefixes[i.at(-1)??-1]=c,m(o[n-1],a)}else o.slice(0,n).forEach(e=>m(e,a))},n<t.operands.length),m=(e,t)=>{let n=e.location.range,r=e=>e.forEach(e=>m(e,t));switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:case`Bracket`:case`Subexpression`:case`OperatorReference`:return;case`Label`:case`Lambda`:m(e.body,ff(e.params,t));return;case`Selection`:n===void 0?m(e.expression,t):l(e,n,()=>m(e.expression,t));return;case`Let`:{let n=pf(e.definitions,t);e.definitions.forEach(t=>{t.kind===`Operator`&&s.set(t.body,e.body)}),uf(e.definitions).forEach(e=>{e.name!==`$subexpression`&&u({definition:e,scope:n})}),m(e.body,n);return}case`Identifier`:{let r=c(e,e.name,t);l(e,n,()=>{r&&u(r)},!1,r?.definition);return}case`Apply`:{let r=c(e,e.operator,t);l(e,n,()=>{r&&u(r),e.args.forEach((e,n)=>f(e,n,r?.definition,t))},!1,r?.definition);return}case`And`:case`Or`:p(e,e.operands.length,n,t);return;case`Case`:l(e,n,()=>{e.arms.forEach(e=>l(void 0,cf(e.condition.location.range,e.body.location.range),()=>r([e.condition,e.body]),!0));let n=e.other;n&&l(void 0,e.otherRange,()=>m(n,t),!0)});return;case`Record`:case`RecordSet`:l(e,n,()=>e.fields.forEach(e=>l(void 0,lf(e.location,e.value.location.range),()=>m(e.value,t),!0)));return;case`FunctionApplication`:l(e,n,()=>{m(e.function,t);let n=e.args;n.length===1?m(n[0],t):l(void 0,cf(n[0]?.location.range,n.at(-1)?.location.range),()=>r(n),!0)});return;case`Forall`:case`Exists`:case`FunctionConstruction`:l(e,n,()=>{m(e.body,ff(mf(e.bounds),t)),r(df(e.bounds))});return;case`SetMap`:l(e,n,()=>{m(e.expression,ff(mf(e.bounds),t)),r(df(e.bounds))});return;case`SetFilter`:l(e,n,()=>{m(e.predicate,ff(mf([e.bound]),t)),m(e.bound.set,t)});return;case`Choose`:l(e,n,()=>{let n=e.pattern;m(e.body,ff(n.kind===`Name`?[n.name]:n.names,t)),e.set&&m(e.set,t)});return;case`UnboundedQuantifier`:l(e,n,()=>m(e.body,ff(e.names,t)));return;case`Except`:l(e,n,()=>{m(e.function,t),e.updates.forEach(e=>{e.path.forEach(e=>{e.kind===`Index`&&r(e.args)}),m(e.value,t)})});return;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:l(e,n,()=>m(e.expression,t));return;case`If`:l(e,n,()=>r([e.condition,e.consequent,e.alternative]));return;case`SetEnumeration`:case`Tuple`:l(e,n,()=>r(e.elements));return;case`Product`:l(e,n,()=>r(e.factors));return;case`FunctionSet`:l(e,n,()=>r([e.domain,e.range]));return;case`FieldAccess`:l(e,n,()=>m(e.record,t));return;case`BoxAction`:case`AngleAction`:l(e,n,()=>r([e.action,e.subscript]));return;case`WeakFairness`:case`StrongFairness`:l(e,n,()=>r([e.subscript,e.action]))}},h=e=>{let t=[];for(let n=e;n;n=n.parent){let e=Yd.get(n);e&&t.unshift(e)}return pf(t,void 0)};e.relations.forEach(e=>{i.push(e.node),m(e.expression,h(e.scope)),i.pop()})},gf=(e,t,n)=>{for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r]){if(e.expressions[r]===n)return r;if(e.isPart[r]){let t=gf(e,r,n);if(t!==-1)return t}}return-1},_f=(e,t,n)=>{if(e.expressions[t]===n)return t;let r=gf(e,t,n);if(r!==-1)return r;let i=e.recursive[t],a=i===-1?-1:gf(e,i,n);return a===-1?e.lets[t]?.find(t=>e.expressions[t]===n)??t:a},vf=(e,t)=>{for(let n=t;n!==-1;n=e.prefixes[n])e.primary[n]++},yf=(e,t,n)=>{let r=e.current;e.current=t;try{return n()}finally{e.current=r}},bf=(e,t,n)=>{let r=typeof t==`object`?e.values.get(t):void 0;r!==void 0&&(e.secondary[r]+=n)},xf=(e,t,n,r,i)=>{let a=Ns(n)?n:t!==`\\`&&Ns(r)?r:void 0;if(a===void 0||typeof i!=`object`)return i;let o=a===n?r:n;if(t===`\\cup`){if(ru(a)||!Ns(o))return i;let t=e.values.get(o);t!==void 0&&(e.secondary[t]+=ou(o)+1)}let s=t===`\\cup`?void 0:e.values.get(a);if(e.values.get(i)===s)return i;let c=i===n||i===r||e.values.has(i)?{...i}:i;return s!==void 0&&e.values.set(c,s),c},Sf=(e,t,n)=>{let r=0;return{next:()=>(t!==void 0&&e.secondary[t]++,r++<n),reset:()=>{r=0}}},Cf=(e,t,n)=>{if(n.some(e=>ru(e)))return{next:()=>!1,reset:()=>void 0};let r=n.map(t=>Tf(e,t,ou(t),!1)),i=()=>{for(let e=r.length-1;e>0;e--){if(r[e].next())return!0;r[e].reset(),r[e].next()}return r.length>0&&r[0].next()},a=!r.every(e=>e.next());return{next:()=>!a&&(e.secondary[t]+=Math.max(r.length,1),a=!i(),!0),reset:()=>{r.forEach(e=>{e.reset(),e.next()}),a=!1}}},wf=(e,t)=>{let n=typeof t==`object`?e.values.get(t):void 0;if(n!==void 0&&typeof t==`object`){if(t.kind===`RecordSet`)return Cf(e,n,t.sets);if(t.kind===`FunctionSet`)return Cf(e,n,Array.from({length:ou(t.domain)},()=>t.range))}},Tf=(e,t,n,r)=>{let i=typeof t==`object`?e.values.get(t):void 0;if(typeof t==`object`&&(t.kind===`Subset`||!r&&t.kind===`FilteredSet`))return Sf(e,void 0,n);let a=wf(e,t);if(!a||i===void 0)return Sf(e,i,n);if(!r)return a;let o=0;for(;a.next();)o++;return e.secondary[i]+=o,Sf(e,i,o)},Ef=(e,t,n)=>{let r=typeof t==`object`&&t.kind===`Subset`?e.values.get(t):void 0;r!==void 0&&typeof n==`object`&&e.values.set(n,r)},Df=/* @__PURE__ */ new Set([`Set`,`MixedSet`,`Interval`,`FunctionSet`,`RecordSet`,`ProductSet`]),Of=(e,t,n,r)=>{if(typeof t!=`object`||Df.has(t.kind))return;if(t.kind!==`Subset`){let r=Tf(e,t,n,!1);for(let e=0;e<=n;e++)r.next();return}let i=e.values.get(t);i!==void 0&&(e.secondary[i]+=n);for(let n=0;n<r.length;n++)Ef(e,t,r[n])},kf=(e,t,n,r)=>{let i=Array.isArray(n)?n.length:n.high-n.low+1;return typeof t!=`object`||t.kind!==`Subset`||!Array.isArray(n)?Tf(e,t,i,r):(n.forEach(n=>Ef(e,t,n)),Sf(e,void 0,i))},Af=e=>(e.every(e=>e.next()),()=>{for(let t=0;t<e.length;t++){if(e[t].next()||t===e.length-1)return;e[t].reset(),e[t].next()}}),jf=(e,t,n)=>Af(t.map((t,r)=>kf(e,t,n[r],!0))),Mf=(e,t,n)=>{let r=n.map(e=>ou(e)),i=Af(n.map((t,n)=>Tf(e,t,r[n],!1))),a=r.reduce((e,t)=>e*t,1);for(let e=0;e<a;e++)i();e.secondary[t]+=a},Nf=e=>{let t=Number(e>>32n);return t===0?32+Math.clz32(Number(e&4294967295n)):Math.clz32(t)},Pf=(e,t)=>t.forEach((t,n)=>{let r=Kd([t]),i=Number(r>>BigInt(54)),a=BigInt.asUintN(64,r<<BigInt(10)|1n<<9n),o=n*Zd+i;e.registers[o]=Math.max(e.registers[o],Nf(a)+1)}),Ff=(e,t)=>{let n=e.registers.subarray(t*Zd,(t+1)*Zd),r=n.reduce((e,t)=>e+2**-t,0),i=.7205407583220416*Zd*Zd/r,a=n.filter(e=>e===0).length;return Math.trunc(i<=2.5*Zd?a===0?i:Zd*Math.log(Zd/a):i>2**64/30?-(2**64)*Math.log(1-i/2**64):i)},If=e=>{let t=Math.imul(31,31+e.primary)+e.secondary|0;return t^t>>>16},Lf=e=>{let t=16;for(;e.length>t*.75;)t*=2;let n=e=>If(e)&t-1;return e.reduce((e,t)=>n(t)<n(e)?t:e)},Rf=(e,t)=>{e.some(e=>e.primary===t.primary&&e.secondary===t.secondary)||e.push(t)},zf=(e,t)=>e.isPrimed[t]||e.isUnchanged[t],Bf=(e,t)=>{let n=[];for(let r=e.firstChild[t];r!==-1;r=e.nextSibling[r])n.push(r);return n},Vf=(e,t)=>{let n=e.primary[t.node],r=e.secondary[t.node];return t.kind===`init`?{distinct:n,generated:n+r}:t.kind===`next`?{distinct:r,generated:n}:t.kind===`constraint`?{distinct:r,generated:n+r}:{distinct:0,generated:0}},Hf=(e,t)=>{let n=[],r=/* @__PURE__ */ new Map,i=t=>{let n=[],a={primary:e.primary[t],secondary:e.secondary[t]};return(a.primary>0||a.secondary>0||zf(e,t))&&Rf(n,a),Bf(e,t).forEach(e=>i(e).forEach(e=>Rf(n,e))),r.set(t,n),n},a=(t,r,i,a)=>{let o=e.ranges[t];n.push({location:o?m(o):`Unknown location`,depth:r,count:i,cost:a})},o=(t,n)=>a(t,n,e.primary[t],e.secondary[t]),s=(t,n)=>{let c=Bf(e,t),l=[];c.forEach(e=>(r.get(e)??i(e)).forEach(e=>Rf(l,e)));let u={primary:e.primary[t],secondary:e.secondary[t]},d=zf(e,t),f=e=>c.forEach(t=>s(t,e));if(e.isUnchanged[t]){let e=l.filter(e=>e.primary!==0||e.secondary!==0);e.length===0?o(t,n):a(t,n,Math.max(u.primary,Lf(e).primary),0);return}if(l.length===0){(u.primary!==0||d)&&o(t,n);return}let p=u.primary===0&&u.secondary===0;if(l.length===1){let e=l[0],r=e.primary===0&&e.secondary===0;if(e.primary<u.primary){o(t,n),f(n+1);return}if(!d&&p&&!r){a(t,n,e.primary,e.secondary);return}if(p&&r){d&&o(t,n),f(d?n+1:n);return}if(u.primary===e.primary&&u.secondary===e.secondary){o(t,n);return}}let m=!p||d;m&&o(t,n),f(m?n+1:n)};return Bf(e,t).forEach(e=>{i(e),s(e,0)}),n},Uf=[`init`,`next`,`invariant`,`constraint`,`implied`],Wf=(e,t)=>!e||!t?e?1:t?-1:0:e.module===t.module?e.start.line-t.start.line||e.start.column-t.start.column||e.end.line-t.end.line||e.end.column-t.end.column:e.module<t.module?-1:1,Gf=e=>Uf.flatMap(t=>{let n=e.relations.filter(e=>e.kind===t);return t===`next`?n.toSorted((e,t)=>Wf(e.expression.location.range,t.expression.location.range)).filter((e,t,n)=>t===0||Wf(n[t-1].expression.location.range,e.expression.location.range)!==0):n}),Kf=(e,t,n,r)=>({variables:r.map(r=>{let i=n[r]?.range;return{label:`${t.variables[r]} ${i?m(i):`Unknown location`}`,distinct:Ff(e,r)}}),relations:Gf(e).map(t=>({kind:t.kind,label:t.label,...Vf(e,t),expressions:Hf(e,t.node)}))}),qf=(e,t,n)=>{let r=tf(e,t,n);if(r===void 0)return;let i=e.primary[r],a=e.secondary[r];if(t===`init`)return[[`generated`,i+a],[`distinct`,i]];if(t===`next`)return[[`generated`,i],[`distinct`,a]];let o=e.firstChild[r];return[[`count`,o===-1?i:e.primary[o]]]},Jf=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`+`,`-`,`*`,`^`,`\\div`,`%`,`..`,`Seq`,`IsFiniteSet`]),Yf=(e,n)=>Jf.has(e)?new w(n):new t(n),Xf=(e,n,r,i)=>new t(`The ${e} argument of ${n} should be a ${r}, but instead it is:\n${U(q(i))}`),Zf=(e,n,r=e)=>{if(!Ms(e)||mc(e))throw new t(`Applying ${n} to the following value,\nwhich is not a finite set:\n${U(q(r))}`);return G(e)},Qf=e=>typeof e==`object`&&e.kind===`Operator`,J=(e,t,n)=>{let r=e[t];if(r===void 0||Qf(r))throw Yf(n,`${n} expects a value as argument ${t+1}`);return r},$f=(e,t,n)=>{let r=J(e,t,n);if(typeof r!=`boolean`)throw Yf(n,`${n} expects a boolean but received ${q(r)}`);return r},ep=(e,t,n)=>{let r=e[t];if(r===void 0||!Qf(r))throw Yf(n,`${n} expects an operator as argument ${t+1}`);return r},tp=(e,t)=>({kind:`Builtin`,name:e,arity:0,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0}),Y=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:t===1?e=>n([e]):void 0,evaluateBinary:t===2?(e,t)=>n([e,t]):void 0}),np=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0}),rp=(e,t,n)=>({kind:`Builtin`,name:e,arity:t,evaluate:n,evaluateUnary:void 0,evaluateBinary:void 0,isStateLevel:!0}),ip=(e,t)=>({kind:`Builtin`,name:e,arity:2,evaluate:n=>t(J(n,0,e),J(n,1,e)),evaluateUnary:void 0,evaluateBinary:t}),ap=e=>e>2147483647||e<-2147483648,op=e=>new t(`Overflow when computing ${e}`),sp={ModelValue:`ModelValue`,Set:`SetEnumValue`,Interval:`IntervalValue`,InfiniteSet:`UserValue`,SequenceSet:`UserValue`,Subset:`SubsetValue`,FunctionSet:`SetOfFcnsValue`,RecordSet:`SetOfRcdsValue`,ProductSet:`SetOfTuplesValue`,FilteredSet:`SetPredValue`,LazyFunction:`FcnLambdaValue`,Union:`UnionValue`,MixedSet:`SetEnumValue`},cp={"\\cup":`SetCupValue`,"\\cap":`SetCapValue`,"\\":`SetDiffValue`},lp={BoolValue:`a Boolean value`,IntValue:`an integer`,StringValue:`a string`,RecordValue:`a record`,SetEnumValue:`a set of the form {e1, ... ,eN}`,SetPredValue:`a set of the form {x \\in S : expr}`,TupleValue:`a tuple`,FcnLambdaValue:`a function of the form [x \\in S |-> expr]`,FcnRcdValue:`a function of the form (d1 :> e1 @@ ... @@ dN :> eN)`,SetOfFcnsValue:`a set of the form [S -> T]`,SetOfRcdsValue:`a set of the form [d1 : S1, ... , dN : SN]`,SetOfTuplesValue:`a cartesian product`,SubsetValue:`a set of the form SUBSET S`,SetDiffValue:`a set of the form S \\ T`,SetCapValue:`a set of the form S \\cap T`,SetCupValue:`a set of the form S \\cup T`,ModelValue:`a model value`,UserValue:`a special set constant`,IntervalValue:`a set of the form i..j`,UnionValue:`a set of the form UNION S`},up={lambda:`FcnLambdaValue`,tuple:`TupleValue`,record:`RecordValue`},dp=e=>{if(typeof e==`number`)return`IntValue`;if(typeof e==`string`)return`StringValue`;if(typeof e==`boolean`)return`BoolValue`;if(e.kind===`SetOperation`)return cp[e.operator];if(e.kind!==`Function`)return sp[e.kind];let t=jc(e);return t===void 0?`FcnRcdValue`:up[t]},fp=e=>lp[dp(e)],pp=(e,t)=>new w(`Attempted to apply the operator overridden by the Java method\n${e},\nbut it produced the following error:\n${t}`),mp=(e,n)=>{let r=r=>(...i)=>{let a=pu.sets?.length??0;try{return r(...i)}catch(r){if(!(r instanceof w)||r instanceof re)throw r;let i=hu(a);throw pu.sets&&(pu.sets.length=a),e.isLazy!==!0&&r instanceof t&&!i?r:pp(n,r.message)}},i=r(e.evaluate);return{...e,evaluate:(t,r)=>{if(t.length!==e.arity)throw pp(n,`array is not of length ${e.arity}`);return i(t,r)},evaluateUnary:e.evaluateUnary&&r(e.evaluateUnary),evaluateBinary:e.evaluateBinary&&r(e.evaluateBinary)}},hp=(e,t)=>{if(typeof e!=`number`)throw pp(t,`Cannot cast tlc2.value.impl.${dp(e)} to tlc2.value.impl.IntValue`);return e},gp=(e,t,n,r)=>`public static tlc2.value.impl.${n} tlc2.module.${e}.${t}(${Array.from({length:r},()=>`tlc2.value.impl.IntValue`).join(`,`)})`,_p=(e,t,n,r)=>{let i=gp(e,n,`IntValue`,2);return ip(t,(e,n)=>{let a=hp(n,i),o=hp(e,i),s=r(o,a);if(ap(s))throw op(`${o}${t}${a}`);return s})},vp=(e,n,r)=>{if(typeof e!=`number`)throw new t(`The ${n} argument of ${r} should be an integer, but instead it is:\n${U(q(e))}`);return e},yp=(e,t,n=e)=>ip(e,(e,r)=>t(vp(e,`first`,n),vp(r,`second`,n))),bp=(e,t,n)=>({...rp(e,t,n),isLazy:!0}),xp=(e,t,n)=>{let r=ep(e,t,n);return()=>r.call([])},Sp=/* @__PURE__ */ new WeakSet,Cp=/* @__PURE__ */ new WeakMap,wp=(e,t)=>{if(t.length===0)return e;let n={...e};return Sp.has(e)&&Sp.add(n),Cp.set(n,[...t,...Cp.get(e)??[]]),n},Tp=(e,t,n=/* @__PURE__ */ new Set)=>{let r=jp(e,(e,r)=>Tp(e,t,r.length===0?n:/* @__PURE__ */ new Set([...n,...r])));return r.kind===`Identifier`&&M(r)&&!n.has(r.name)?{...r,name:t.get(r.name)??r.name}:r.kind===`Apply`&&M(r)&&!n.has(r.operator)||r.kind===`OperatorReference`&&!n.has(r.operator)?{...r,operator:t.get(r.operator)??r.operator}:r},Ep=(e,t)=>e.map(e=>({pattern:e.pattern,set:t(e.set)})),Dp=/* @__PURE__ */ new WeakMap,Op=e=>Dp.get(e)??e.name,kp=(e,t)=>(Op(t)!==e.name&&Dp.set(e,Op(t)),e),Ap=(e,t)=>kp(e.kind===`Function`?{...e,bounds:Ep(e.bounds,e=>t(e,[])),body:t(e.body,ba(e.bounds))}:{...e,body:t(e.body,e.params.map(e=>e.name))},e),jp=(e,t)=>{let n=e=>t(e,[]);switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return e;case`Apply`:return{...e,args:e.args.map(n)};case`Lambda`:return{...e,body:t(e.body,e.params)};case`And`:case`Or`:return{...e,operands:e.operands.map(n)};case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:return{...e,expression:n(e.expression)};case`If`:return{...e,condition:n(e.condition),consequent:n(e.consequent),alternative:n(e.alternative)};case`Case`:return{...e,arms:e.arms.map(e=>({condition:n(e.condition),body:n(e.body)})),other:e.other?n(e.other):void 0};case`Let`:{let n=e.definitions.map(e=>e.name);return{...e,definitions:e.definitions.map(e=>Ap(e,(e,r)=>t(e,[...n,...r]))),body:t(e.body,n)}}case`Forall`:case`Exists`:case`FunctionConstruction`:return{...e,bounds:Ep(e.bounds,n),body:t(e.body,ba(e.bounds))};case`UnboundedQuantifier`:return{...e,body:t(e.body,e.names)};case`Choose`:return{...e,set:e.set?n(e.set):void 0,body:t(e.body,ya(e.pattern))};case`SetEnumeration`:case`Tuple`:return{...e,elements:e.elements.map(n)};case`SetFilter`:return{...e,bound:{pattern:e.bound.pattern,set:n(e.bound.set)},predicate:t(e.predicate,ya(e.bound.pattern))};case`SetMap`:return{...e,bounds:Ep(e.bounds,n),expression:t(e.expression,ba(e.bounds))};case`FunctionSet`:return{...e,domain:n(e.domain),range:n(e.range)};case`Record`:case`RecordSet`:return{...e,fields:e.fields.map(e=>({...e,value:n(e.value)}))};case`Except`:return{...e,function:n(e.function),updates:e.updates.map(e=>({...e,path:e.path.map(e=>e.kind===`Index`?{...e,args:e.args.map(n)}:e),value:n(e.value)}))};case`FunctionApplication`:return{...e,function:n(e.function),args:e.args.map(n)};case`Bracket`:return{...e,args:e.args.map(n)};case`FieldAccess`:return{...e,record:n(e.record)};case`Product`:return{...e,factors:e.factors.map(n)};case`BoxAction`:case`AngleAction`:return{...e,action:n(e.action),subscript:n(e.subscript)};case`WeakFairness`:case`StrongFairness`:return{...e,subscript:n(e.subscript),action:n(e.action)};case`Label`:return{...e,body:n(e.body)};case`Selection`:return{...e,expression:n(e.expression)};case`Subexpression`:return{...e,selectors:e.selectors.map(e=>`args`in e?{...e,args:e.args.map(n)}:e)}}},Mp=[],Np=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n],Mp)},Pp=(e,t)=>{for(let n=0;n<e.length;n++)t(e[n].set,Mp)},Fp=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`Identifier`:case`OperatorReference`:case`ExceptAt`:return;case`Apply`:case`Bracket`:return Np(e.args,t);case`Lambda`:return t(e.body,e.params);case`And`:case`Or`:return Np(e.operands,t);case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`Selection`:return t(e.expression,Mp);case`If`:return t(e.condition,Mp),t(e.consequent,Mp),t(e.alternative,Mp);case`Case`:for(let n=0;n<e.arms.length;n++)t(e.arms[n].condition,Mp),t(e.arms[n].body,Mp);e.other&&t(e.other,Mp);return;case`Let`:{let n=e.definitions.map(e=>e.name);return e.definitions.forEach(e=>{e.kind===`Function`?(Pp(e.bounds,e=>t(e,n)),t(e.body,[...n,...ba(e.bounds)])):t(e.body,[...n,...e.params.map(e=>e.name)])}),t(e.body,n)}case`Forall`:case`Exists`:case`FunctionConstruction`:return Pp(e.bounds,t),t(e.body,ba(e.bounds));case`UnboundedQuantifier`:return t(e.body,e.names);case`Choose`:return e.set&&t(e.set,Mp),t(e.body,ya(e.pattern));case`SetEnumeration`:case`Tuple`:return Np(e.elements,t);case`SetFilter`:return t(e.bound.set,Mp),t(e.predicate,ya(e.bound.pattern));case`SetMap`:return Pp(e.bounds,t),t(e.expression,ba(e.bounds));case`FunctionSet`:return t(e.domain,Mp),t(e.range,Mp);case`Record`:case`RecordSet`:for(let n=0;n<e.fields.length;n++)t(e.fields[n].value,Mp);return;case`Except`:t(e.function,Mp);for(let n=0;n<e.updates.length;n++){let r=e.updates[n];for(let e=0;e<r.path.length;e++){let n=r.path[e];n.kind===`Index`&&Np(n.args,t)}t(r.value,Mp)}return;case`FunctionApplication`:return t(e.function,Mp),Np(e.args,t);case`FieldAccess`:return t(e.record,Mp);case`Product`:return Np(e.factors,t);case`BoxAction`:case`AngleAction`:return t(e.action,Mp),t(e.subscript,Mp);case`WeakFairness`:case`StrongFairness`:return t(e.subscript,Mp),t(e.action,Mp);case`Label`:return t(e.body,Mp);case`Subexpression`:e.selectors.forEach(e=>{`args`in e&&Np(e.args,t)})}},Ip=`LAMBDA`,Lp=e=>`${e}@SUBSTITUTION`,Rp=e=>e.kind===`Identifier`||e.kind===`Tuple`&&e.elements.every(Rp),zp=(e,t)=>{if(e.kind!==`Identifier`)return!Rp(e)&&e.kind!==`OperatorReference`&&e.kind!==`Lambda`&&e.kind!==`Number`&&e.kind!==`String`;let n=M(e)?void 0:t.getOuterDefinition(e.name);return n?.kind===`Operator`&&n.params.length===0&&!Rp(n.body)},Bp=(e,t=/* @__PURE__ */ new Set)=>{let n=_t(e),r=n===void 0||t.has(n)?[]:[n];return Fp(e,(e,n)=>r.push(...Bp(e,n.length===0?t:/* @__PURE__ */ new Set([...t,...n])))),r},Vp=e=>{let t=/* @__PURE__ */ new Map;return n=>{if(!e.substitutedNames.has(n))return n;let r=t.get(n)??e.instantiation.createName(n);return t.set(n,r),r}},Hp=(e,t,n)=>new Map([...e,...t.map(e=>[e,n(e)])]),Up=(e,t)=>e.kind===`Name`?{kind:`Name`,name:t(e.name)}:{kind:`Tuple`,names:e.names.map(t)},Wp=(e,t)=>e.map(e=>({pattern:Up(e.pattern,t),set:e.set})),Gp=(e,t)=>e.kind===`Function`?{...e,bounds:Wp(e.bounds,t)}:{...e,params:e.params.map(e=>({name:t(e.name),arity:e.arity}))},Kp=(e,t,n)=>{let r=e=>t.get(e)??e;switch(e.kind){case`Identifier`:return{...e,name:r(e.name)};case`Apply`:case`OperatorReference`:return{...e,operator:r(e.operator)};case`Label`:return{...e,params:e.params.map(r)};case`Lambda`:return{...e,params:e.params.map(n)};case`Let`:return{...e,definitions:e.definitions.map(e=>kp({...Gp(e,n),name:n(e.name)},e))};case`Forall`:case`Exists`:case`FunctionConstruction`:case`SetMap`:return{...e,bounds:Wp(e.bounds,n)};case`UnboundedQuantifier`:return{...e,names:e.names.map(n)};case`Choose`:return{...e,pattern:Up(e.pattern,n)};case`SetFilter`:return{...e,bound:{pattern:Up(e.bound.pattern,n),set:e.bound.set}};default:return e}},qp=e=>`${e}@ENABLED`,Jp=(e,t)=>e.modes.get(t)??e,Yp=(e,t,n)=>e.kind===`Identifier`&&!n.has(e.name)&&!M(e)&&t.instantiation.variables.has(e.name),Xp=(e,t,n)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Xp(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`)return;if(Yp(e,t,n))return[e.name];let r=M(e)?void 0:t.instantiation.getDefinition(e.name);return r?.kind===`Operator`&&r.params.length===0?Xp(r.body,t,/* @__PURE__ */ new Map):void 0},Zp=(e,t,n)=>{if(t.mode===`Normal`)return;if(t.mode===`Primed`)return Yp(e,t,n)&&e.kind===`Identifier`?{kind:`Identifier`,name:qp(e.name),location:e.location}:void 0;if(e.kind===`Prime`)return{...e,expression:rm(e.expression,Jp(t,`Primed`),n)};if(e.kind===`AngleAction`){let r=e.location;return{kind:`And`,operands:[rm(e.action,t,n),{kind:`Apply`,operator:`#`,args:[{kind:`Prime`,expression:rm(e.subscript,Jp(t,`Primed`),n),location:r},rm(e.subscript,t,n)],location:r}],location:r}}if(e.kind!==`Unchanged`)return;let r=Xp(e.expression,t,n);if(r!==void 0)return{kind:`And`,operands:r.map(r=>({kind:`Apply`,operator:`=`,args:[{kind:`Prime`,expression:{kind:`Identifier`,name:qp(r),location:e.location},location:e.location},rm({kind:`Identifier`,name:r,location:e.location},t,n)],location:e.location})),location:e.location}},Qp=(e,t)=>({kind:`Identifier`,name:e,location:t,resolution:Hi}),$p=(e,t)=>e.map(e=>Qp(e.name,t)),em=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:$p(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),tm=(e,t,n,r)=>{let i=Array.from({length:n},(e,t)=>`argument${t}`);return{kind:`Lambda`,params:i,body:{kind:`Apply`,operator:e,args:[...$p(t,r),...i.map(e=>Qp(e,r))],location:r},location:r}},nm=(e,t)=>e.instantiation.isParameterized(t)?am(e,t):void 0,rm=(e,t,n)=>{let r=e=>rm(e,t,n);if(e.kind===`Selection`&&[...n].every(e=>e[0]===e[1])){let n=e.expression,i=t.selections.get(n)??r(n);return t.selections.set(n,i),{...e,expression:i}}let i=t.instantiation,a=i.params,o=t=>!n.has(t)&&!M(e);if(e.kind===`Enabled`&&t.mode===`Normal`)return{...e,expression:rm(e.expression,Jp(t,`Enabled`),n)};if((e.kind===`WeakFairness`||e.kind===`StrongFairness`)&&t.mode===`Normal`)return{...e,subscript:r(e.subscript),action:r(e.action),enabled:rm(e.enabled??{kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.location},Jp(t,`Enabled`),n)};let c=Zp(e,t,n);if(c)return c;if(e.kind===`Identifier`&&o(e.name)){let n=i.substitutions.get(e.name),r=t.bindings;if(n&&(r===void 0||!zp(n,i)))return wp(n,[e]);if(n&&r){let t=Lp(e.name);return r.set(t,n),Qp(t,e.location)}let o=nm(t,e.name);if(o===void 0)return e;if(a.length===0)return{...e,name:o};let s=i.getDefinition(e.name);return s&&sa(s)>0?tm(o,a,sa(s),e.location):{kind:`Apply`,operator:o,args:$p(a,e.location),location:e.location}}if(e.kind===`Apply`&&o(e.operator)){let n=e.args.map(r),o=i.substitutions.get(e.operator),c=i.substitutions.size>0||a.length>0||Sp.has(e),l=e=>(c&&Sp.add(e),e);if(o?.kind===`Identifier`||o?.kind===`OperatorReference`){let t=o.kind===`Identifier`?o.name:o.operator;return l({...e,operator:t,args:n,resolution:o.kind===`Identifier`?o.resolution:void 0})}if(o?.kind===`Apply`)return l({...e,operator:o.operator,args:[...o.args,...n],resolution:o.resolution});if(o?.kind===`Lambda`)return{kind:`Let`,definitions:[{kind:`Operator`,name:Ip,params:o.params.map(e=>({name:e,arity:0})),body:o.body,isLocal:!0,isRecursive:!1,location:o.location}],body:{...e,operator:Ip,args:n,resolution:Hi},location:e.location};if(o)throw new s(`The operator ${e.operator} can only be substituted by an operator at line ${e.location.line}, column ${e.location.column}`);let u=nm(t,e.operator);return u===void 0?l({...e,args:n}):{...e,operator:u,args:[...$p(a,e.location),...n]}}if(e.kind===`OperatorReference`&&o(e.operator)){let n=i.substitutions.get(e.operator);if(n?.kind===`Identifier`||n?.kind===`OperatorReference`||n?.kind===`Lambda`)return wp(n,[e]);let r=nm(t,e.operator);if(r===void 0)return e;let o=i.getDefinition(e.operator);return a.length>0&&o?tm(r,a,sa(o),e.location):{...e,operator:r}}let l=Vp(t),u=jp(e,(e,i)=>i.length===0?r(e):rm(e,t,Hp(n,i,l)));return Kp(u,n,l)},im=(e,t,n)=>t.length===0?e:e.kind===`Operator`?{...e,params:[...t,...e.params]}:{kind:`Operator`,name:e.name,params:t,body:{kind:`Let`,definitions:[e],body:Qp(e.name,n),location:n},isLocal:e.isLocal,isRecursive:!1,location:e.location},am=(e,t)=>{let n=e.copies.get(t);if(n!==void 0)return n;let r=e.instantiation,i=r.getDefinition(t);return i?r.addDefinition(t,i.name,n=>{e.copies.set(t,n);let a=Vp(e),o=/* @__PURE__ */ new Map,s=i.kind===`Operator`&&e.mode===`Normal`?{...e,bindings:o,selections:/* @__PURE__ */ new Map}:e,c=Gp(Ap(i,(e,t)=>rm(e,s,Hp(/* @__PURE__ */ new Map,t,a))),a),l=c.kind!==`Operator`||o.size===0?c.body:{kind:`Let`,definitions:[...o].map(e=>({kind:`Operator`,name:e[0],params:[],body:e[1],isLocal:!0,isRecursive:!1,location:e[1].location})),body:c.body,location:{line:c.body.location.line,column:c.body.location.column}},u=r.frame;return u&&Cp.set(l,[u,...Cp.get(i.body)??[]]),im({...c,body:l},r.params,i.location)}):t},om=e=>{let t=/* @__PURE__ */ new Map,n=new Set([...e.substitutions.values()].flatMap(e=>Bp(e))),r=r=>{let i={instantiation:e,substitutedNames:n,copies:/* @__PURE__ */ new Map,mode:r,modes:t,selections:/* @__PURE__ */ new Map};return t.set(r,i),i},i=r(`Normal`);return r(`Enabled`),r(`Primed`),{getKey:e=>nm(i,e)??e,getQualifiedKey:t=>{let n=nm(i,t);if(n!==void 0)return n;let r=e.getDefinition(t);return r?e.addDefinition(t,r.name,()=>im(r,e.params,r.location)):t}}},sm=e=>e.kind===`Let`&&e.instances!==void 0||gt(e).some(sm),cm=(e,t,n)=>{let r=e.kind===`Let`?[...n,...e.definitions]:n,i=jp(e,e=>cm(e,t,r));if(i.kind!==`Let`||!i.instances)return i;let a=i.instances.reduce((e,n)=>{let i=e.findIndex(e=>aa(n.location,e.location)),a=i===-1?e.length:i;return[...e.slice(0,a),...t(n,r),...e.slice(a)]},i.definitions);return{...i,definitions:a}},lm=e=>e.name===void 0&&e.statement.kind!==`AssumeProve`?e.statement:void 0,um=(e,t)=>e.definitions.some(e=>sm(e.body))||e.assumptions.some(e=>sm(e.expression))||e.theorems.some(e=>{let t=lm(e);return t!==void 0&&sm(t)})?{...e,definitions:e.definitions.map(e=>Ap(e,e=>cm(e,t,[]))),assumptions:e.assumptions.map(e=>({...e,expression:cm(e.expression,t,[])})),theorems:e.theorems.map(e=>{let n=lm(e);return n===void 0?e:{...e,statement:cm(n,t,[])}})}:e,dm=new Map([[`Nat`,0,[],[],[]],[`+`,0,[0,0],[2,2],[1,1]],[`-`,0,[0,0],[2,2],[1,1]],[`*`,0,[0,0],[3,3],[0,0]],[`^`,0,[0,0],[2,2],[1,1]],[`<`,0,[0,0],[2,2],[1,1]],[`>`,0,[0,0],[2,2],[1,1]],[`<=`,0,[0,0],[2,2],[1,1]],[`>=`,0,[0,0],[2,2],[1,1]],[`%`,0,[0,0],[2,2],[1,1]],[`\\div`,0,[0,0],[2,2],[1,1]],[`..`,0,[0,0],[2,2],[1,1]],[`Int`,0,[],[],[]],[`-.`,0,[0],[2],[1]],[`Seq`,0,[0],[2],[1]],[`Len`,0,[0],[2],[1]],[`\\o`,0,[0,0],[2,2],[1,1]],[`Append`,0,[0,0],[2,2],[1,1]],[`Head`,0,[0],[2],[1]],[`Tail`,0,[0],[2],[1]],[`SubSeq`,0,[0,0,0],[2,2,2],[1,1,1]],[`SelectSeq`,0,[0,1],[2,2],[1,1],[],[`1,0,0`]],[`IsFiniteSet`,0,[0],[2],[1]],[`Cardinality`,0,[0],[2],[1]],[`IsABag`,0,[0],[2],[1]],[`BagToSet`,0,[0],[2],[1]],[`SetToBag`,0,[0],[3],[1]],[`BagIn`,0,[0,0],[2,2],[1,1]],[`EmptyBag`,0,[],[],[]],[`\\oplus`,0,[0,0],[2,2],[1,1]],[`\\ominus`,0,[0,0],[2,2],[1,1]],[`BagUnion`,0,[0],[2],[1]],[`\\sqsubseteq`,0,[0,0],[2,2],[1,1]],[`SubBag`,0,[0],[2],[1]],[`BagOfAll`,0,[1,0],[2,2],[1,1]],[`BagCardinality`,0,[0],[2],[1]],[`CopiesIn`,0,[0,0],[2,2],[1,1]],[`Print`,0,[0,0],[3,3],[0,1]],[`PrintT`,0,[0],[3],[0]],[`Assert`,0,[0,0],[2,3],[1,0]],[`JavaTime`,0,[],[],[]],[`TLCGet`,0,[0],[3],[0]],[`TLCSet`,0,[0,0],[3,3],[0,0]],[`:>`,0,[0,0],[2,3],[1,1]],[`@@`,0,[0,0],[2,2],[1,1]],[`Permutations`,0,[0],[2],[1]],[`SortSeq`,0,[0,2],[2,2],[1,1],[],[`1,0,0`,`1,0,1`]],[`RandomElement`,0,[0],[3],[1]],[`Any`,0,[],[],[]],[`ToString`,0,[0],[2],[1]],[`TLCEval`,0,[0],[3],[1]],[`AssertEq`,0,[0,0],[2,2],[1,1]],[`AssertError`,0,[0,0],[2,3],[1,0]],[`TLCGetOrDefault`,0,[0,0],[3,3],[0,0]],[`TLCGetAndSet`,0,[0,2,0,0],[3,3,3,3],[0,0,0,0],[],[`1,2,1`]],[`Trace`,0,[],[],[]],[`CounterExample`,0,[],[],[]],[`ToTrace`,0,[0],[3],[0]],[`TLCModelValue`,0,[0],[2],[1]],[`TLCDefer`,0,[0],[3],[0]],[`TLCNoOp`,0,[0],[3],[1]],[`PickSuccessor`,0,[0],[3],[1]],[`TLCCache`,0,[0,0],[3,3],[1,0]],[`TLCFP`,0,[0],[3],[0]],[`TLCEvalDefinition`,0,[0],[3],[0]],[`ToJson`,0,[0],[2],[1]],[`ToJsonArray`,0,[0],[2],[1]],[`ToJsonObject`,0,[0],[2],[1]],[`JsonSerialize`,0,[0,0],[3,3],[0,0]],[`JsonDeserialize`,0,[0],[3],[0]],[`ndJsonSerialize`,0,[0,0],[3,3],[0,0]],[`ndJsonDeserialize`,0,[0],[3],[0]],[`RandomSubset`,0,[0,0],[2,2],[1,1]],[`RandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`TestRandomSetOfSubsets`,0,[0,0,0],[2,3,2],[1,0,1]],[`_Track`,0,[0,0],[3,2],[0,0]],[`_Counts`,0,[],[],[]],[`_CheckName`,0,[0],[2],[1]],[`_PrintCounts`,0,[],[],[]]].map(e=>[e[0],{name:e[0],level:e[1],isCorrect:!0,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set,formals:e[2].map((e,t)=>({name:`$${t}`,arity:e})),maxLevels:e[3],weights:e[4],minMaxLevels:e[5]??[],conditions:new Set(e[6]),nonLeibniz:/* @__PURE__ */ new Set}])),fm={Naturals:{Nat:[14,1,14,16],"+":[15,1,15,19],"-":[17,1,17,33],"*":[18,1,18,17],"^":[19,1,19,19],"<":[20,1,20,19],">":[21,1,21,19],"<=":[22,1,22,19],">=":[23,1,23,19],"%":[33,1,33,20],"\\div":[34,1,34,20],"..":[35,1,35,20]},Integers:{Int:[18,1,18,12],"-.":[22,1,22,13]},Sequences:{Seq:[20,1,20,41],Len:[25,1,25,44],"\\o":[30,1,31,76],Append:[36,1,36,26],Head:[41,1,41,15],Tail:[42,1,42,61],SubSeq:[48,1,48,50],SelectSeq:[53,1,65,14]},FiniteSets:{IsFiniteSet:[14,1,19,68],Cardinality:[21,1,27,11]},Bags:{IsABag:[20,1,24,41],BagToSet:[26,1,26,23],SetToBag:[31,1,31,30],BagIn:[36,1,36,31],EmptyBag:[41,1,41,24],"\\oplus":[43,1,49,46],"\\ominus":[51,1,60,50],BagUnion:[74,1,79,58],"\\sqsubseteq":[81,1,87,42],SubBag:[89,1,110,11],BagOfAll:[122,1,130,66],BagCardinality:[132,1,138,8],CopiesIn:[140,1,145,33]},TLC:{Print:[17,1,17,22],PrintT:[18,1,18,19],Assert:[24,1,25,54],JavaTime:[26,1,26,32],TLCGet:[75,1,75,28],TLCSet:[76,1,76,20],":>":[78,1,78,27],"@@":[79,1,80,50],Permutations:[81,1,82,54],SortSeq:[88,1,92,40],RandomElement:[110,1,110,41],Any:[119,1,119,22],ToString:[121,1,121,58],TLCEval:[145,1,145,15]},TLCExt:{AssertEq:[14,1,20,14],AssertError:[23,1,26,72],TLCGetOrDefault:[30,1,31,17],TLCGetAndSet:[33,1,35,57],Trace:[41,1,57,6],CounterExample:[61,1,75,8],ToTrace:[77,1,87,12],TLCModelValue:[91,1,120,29],TLCDefer:[122,1,134,6],TLCNoOp:[138,1,145,5],PickSuccessor:[148,1,162,37],TLCCache:[166,1,173,12],TLCFP:[175,1,181,24],TLCEvalDefinition:[185,1,190,6]},Randomization:{RandomSubset:[30,1,30,64],RandomSetOfSubsets:[48,1,49,67],TestRandomSetOfSubsets:[61,1,62,71]},Json:{ToJson:[46,1,55,37],ToJsonArray:[57,1,64,42],ToJsonObject:[66,1,73,43],JsonSerialize:[75,1,80,6],JsonDeserialize:[82,1,87,19],ndJsonSerialize:[89,1,95,6],ndJsonDeserialize:[97,1,103,19]},_Possible:{_Track:[10,1,17,38],_Counts:[24,1,30,14],_CheckName:[32,1,35,35],_PrintCounts:[37,1,37,31]}},pm=(e,t)=>{let n=fm[e]?.[t];return n&&{module:e,start:{line:n[0],column:n[1]},end:{line:n[2],column:n[3]}}},mm={Constant:0,Variable:1,State:1,Action:2,Temporal:3},hm=(e,t)=>`${e}${t}`,gm=(e,t,n)=>`${e}${t}${n}`,_m=e=>{let t=e.split(`\0`);return{operator:t[0],index:Number(t[1]),param:t[2]}},vm=(e,t,n)=>`${e},${t},${n}`,ym=(e=0)=>({level:e,isCorrect:!0,params:/* @__PURE__ */ new Set,constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set}),bm=(e,t,n)=>e.set(t,Math.min(n,e.get(t)??3)),xm=(e,t,n)=>e.set(t,Math.max(n,e.get(t)??0)),Sm=(e,t)=>{t.constraints.forEach((t,n)=>bm(e.constraints,n,t)),t.argConstraints.forEach((t,n)=>xm(e.argConstraints,n,t)),t.argParams.forEach(t=>e.argParams.add(t))},X=(e,t,n,r)=>({...ym(t),name:e,formals:[],maxLevels:n,weights:r,minMaxLevels:[],conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}),Cm=(e,t)=>e.formals.length===0&&e.maxLevels.length>0?e.maxLevels[Math.min(t,e.maxLevels.length-1)]:e.maxLevels[t]??3,wm=(e,t)=>e.formals.length===0&&e.weights.length>0?e.weights[Math.min(t,e.weights.length-1)]:e.weights[t]??1,Tm=new Map([[`=`,0,[2,2],[1,1]],[`#`,0,[2,2],[1,1]],[`\\in`,0,[2,2],[1,1]],[`\\notin`,0,[2,2],[1,1]],[`\\subseteq`,0,[2,2],[1,1]],[`\\cup`,0,[2,2],[1,1]],[`\\cap`,0,[2,2],[1,1]],[`\\`,0,[2,2],[1,1]],[`=>`,0,[3,3],[1,1]],[`<=>`,0,[3,3],[1,1]],[`/\\`,0,[3,3],[1,1]],[`\\/`,0,[3,3],[1,1]],[`~`,0,[3],[1]],[`SUBSET`,0,[2],[1]],[`UNION`,0,[2],[1]],[`DOMAIN`,0,[2],[1]],[`~>`,3,[3,3],[0,0]],[`-+->`,3,[3,3],[0,0]],[`\\cdot`,2,[2,2],[0,0]],[`TRUE`,0,[],[]],[`FALSE`,0,[],[]],[`BOOLEAN`,0,[],[]],[`STRING`,0,[],[]]].map(e=>[e[0],{...X(e[0],e[1],[...e[2]],[...e[3]]),nonLeibniz:new Set(e[1]>1?[0,1]:[])}])),Em=X(`'`,2,[1],[0]),Dm=X(`UNCHANGED`,2,[1],[0]),Om=X(`ENABLED`,1,[2],[0]),km=X(`[]`,3,[3],[0]),Am=X(`<>`,3,[3],[0]),jm=X(`$ConjList`,0,[3],[1]),Mm=X(`$DisjList`,0,[3],[1]),Nm=X(`$IfThenElse`,0,[3],[1]),Pm=X(`$Case`,0,[3],[1]),Fm=X(`$BoundedForall`,0,[3],[1]),Im=X(`$BoundedExists`,0,[3],[1]),Lm=X(`$UnboundedForall`,0,[3],[1]),Rm=X(`$UnboundedExists`,0,[3],[1]),zm=X(`$TemporalForall`,3,[3],[0]),Bm=X(`$TemporalExists`,3,[3],[0]),Vm=X(`$BoundedChoose`,0,[2],[1]),Hm=X(`$UnboundedChoose`,0,[2],[1]),Um=X(`$SetEnumerate`,0,[2],[1]),Wm=X(`$Tuple`,0,[2],[1]),Gm=X(`$SetOfFcns`,0,[2],[1]),Km=X(`$CartesianProd`,0,[2],[1]),qm=X(`$SubsetOf`,0,[2],[1]),Jm=X(`$SetOfAll`,0,[2],[1]),Ym=X(`$FcnConstructor`,0,[3],[1]),Xm=X(`$RcdConstructor`,0,[3],[1]),Zm=X(`$SetOfRcds`,0,[2],[1]),Qm=X(`$Except`,0,[2],[1]),$m=X(`$Pair`,0,[3],[1]),eh=X(`$Seq`,0,[2],[1]),th=X(`$FcnApply`,0,[2,2],[1,1]),nh=X(`$RcdSelect`,0,[2,0],[1,1]),rh=X(`$SquareAct`,2,[2,1],[0,0]),ih=X(`$AngleAct`,2,[2,1],[0,0]),ah=X(`$WF`,3,[1,2],[0,0]),oh=X(`$SF`,3,[1,2],[0,0]),sh=(e,t)=>t.length===0?e:new Map([...e,...t.map(e=>[e.name,{kind:`Formal`,arity:e.arity,level:0}])]),ch=e=>e.map(e=>({name:e,arity:0})),lh=e=>e.kind===`Operator`?e.params:[],uh=e=>e.kind===`Function`?{kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}:e.body,dh=(e,t)=>{let n=new Map(t);return e.definitions.forEach(e=>n.set(e.name,{kind:`Let`,definition:e,scope:n})),n},fh=(e,t,n)=>{let r=lh(e);return{...ym(),name:e.name,formals:r,maxLevels:r.map(()=>t),weights:r.map(()=>n),minMaxLevels:r.map(()=>[]),conditions:/* @__PURE__ */ new Set,nonLeibniz:/* @__PURE__ */ new Set}},ph=(e,t,n=!0)=>{let r=[],i=[],a=[],o=[],s=0,c=0,l=()=>{let t=a.length;for(;t>0&&o[t-1]===void 0;)t--;let n=o[t-1]??e;for(let e=t;e<a.length;e++){let t=a[e];n=Array.isArray(t)?sh(n,ch(t)):t.kind===`Let`?dh(t,n):t.kind===`Function`?sh(n,ch(ba(t.bounds))):sh(n,t.params),o[e]=n}return n},u=(e,t)=>{a.push(e),o.push(void 0),f(t),a.pop(),o.pop()},d=(e,t)=>t.length===0?f(e):u(t,e),f=e=>{if(e.kind!==`Let`)return Fp(e,d);if(a.push(e),o.push(void 0),c++,e.recursive)h(mh(e));else for(let t=0;t<e.definitions.length;t++)p(e.definitions[t]);c--,f(e.body),a.pop(),o.pop()},p=e=>{if(e.kind===`Function`)for(let t=0;t<e.bounds.length;t++)f(e.bounds[t].set);if(u(e,e.body),s===0)return;let t=i[c]??=/* @__PURE__ */ new Set;e.isRecursive&&t.delete(e.name)?s--:r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:t.size>0})},m=(e,t)=>{s===0&&r.push({location:t,members:[]});let n=i[c]??=/* @__PURE__ */ new Set;e.forEach(e=>{n.has(e.name)||(n.add(e.name),s++)}),e.forEach(e=>r.at(-1)?.members.push({definition:e,scope:l(),isRechecked:!0}))},h=e=>{let t=/* @__PURE__ */ new Map;e.forEach(e=>{if(e.kind!==`Definition`||!e.definition.isRecursive)return;let n=t.get(e.definition.name);n?n.push(e.definition):t.set(e.definition.name,[e.definition])}),e.forEach(e=>{e.kind===`Recursive`?m(e.declarations.flatMap(e=>t.get(e.name)??[]),e.location):(s!==0||n)&&(e.kind===`Assumption`?f(e.assumption.expression):e.kind===`Theorem`&&e.theorem.statement.kind!==`AssumeProve`?f(e.theorem.statement):e.kind===`Definition`&&p(e.definition))})};return Array.isArray(t)?h(t):f(t),r},mh=e=>[...(e.recursive??[]).map(e=>({location:e.location,unit:{kind:`Recursive`,declarations:[e],location:e.location}})),...e.definitions.map(e=>({location:e.location,unit:{kind:`Definition`,definition:e}}))].toSorted((e,t)=>aa(e.location,t.location)?-1:1).map(e=>e.unit),hh=/* @__PURE__ */ new Set([`/\\`,`\\/`,`=>`,`<=>`]),gh=e=>e.includes(2)&&e.includes(3),_h=e=>di.get(e)??e.location.range,vh=e=>e.kind!==`Let`&&e.kind!==`Label`,yh=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=[],i=[],a=(t,n)=>{let r=n.get(t);if(r?.kind===`Formal`)return{kind:`Declared`,name:t,level:r.level,arity:r.arity};if(r?.kind===`Let`)return{kind:`Defined`,levels:S(r.definition,r.scope)};if(e.constants.has(t))return{kind:`Declared`,name:t,level:0,arity:0};if(e.variables.has(t))return{kind:`Declared`,name:t,level:1,arity:0};let i=e.getDefinition(t);if(i){let n=S(i,/* @__PURE__ */ new Map),r=e.getQualifiedName?.(t);return{kind:`Defined`,levels:r?{...n,name:r}:n}}let a=Tm.get(t)??dm.get(t);return a?{kind:`Defined`,levels:a}:{kind:`Declared`,name:t,level:0,arity:0}},o=(e,t,n)=>{let r=ym(Math.max(t,...n.map(e=>e.data.level)));return r.isCorrect=n.every(e=>e.data.isCorrect),r.params.add(e),n.forEach((t,n)=>{t.data.params.forEach(t=>{r.params.add(t),r.argParams.add(gm(e,n,t))}),xm(r.argConstraints,hm(e,n),t.data.level),Sm(r,t.data)}),r},s=(e,t,n=[],r=[])=>{let a=e=>r.includes(e),o=t.flatMap((t,n)=>t.kind===`Value`&&t.data.level>Cm(e,n)?[{operand:t,index:n}]:[]);o.filter(t=>e.isCorrect&&t.operand.data.isCorrect).forEach(t=>i.push(`Level error in applying operator ${xt(e.name)}:\nThe level of argument ${t.index+1} exceeds the maximum level allowed by the operator`));let s=n=>{let r=e.formals.findIndex(e=>e.name===n);return r===-1?void 0:t[r]},c=(t,n,r)=>e.conditions.has(vm(t,n,r)),l=ym(Math.max(e.level,...t.filter((t,n)=>wm(e,n)===1).map(e=>e.data.level),...n.map(e=>e.level)));return l.isCorrect=o.length===0&&t.every(e=>e.data.isCorrect)&&n.every(e=>e.isCorrect),e.params.forEach(e=>l.params.add(e)),t.forEach((t,n)=>{wm(e,n)===1&&t.data.params.forEach(e=>l.params.add(e))}),n.forEach(e=>e.params.forEach(e=>l.params.add(e))),r.forEach(e=>l.params.delete(e)),e.constraints.forEach((e,t)=>bm(l.constraints,t,e)),t.forEach(e=>e.data.constraints.forEach((e,t)=>{a(t)||bm(l.constraints,t,e)})),n.forEach(e=>e.constraints.forEach((e,t)=>bm(l.constraints,t,e))),t.forEach((t,n)=>t.data.params.forEach(t=>{a(t)||bm(l.constraints,t,Cm(e,n))})),t.forEach((e,n)=>{if(e.kind!==`Operator`)return;let r=e.data;t.forEach((e,t)=>r.formals.forEach((i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>bm(l.constraints,e,Cm(r,a)))}))}),e.argParams.forEach(e=>{let t=_m(e),n=s(t.operator);n?.kind===`Operator`&&bm(l.constraints,t.param,Cm(n.data,t.index))}),[e.argConstraints,...t.map(e=>e.data.argConstraints),...n.map(e=>e.argConstraints)].forEach(e=>e.forEach((e,t)=>xm(l.argConstraints,t,e))),t.forEach((n,r)=>{if(n.kind!==`Declared`)return;let i=n.declared;Array.from({length:i.arity},(t,n)=>xm(l.argConstraints,hm(i.name,n),e.minMaxLevels[r]?.[n]??0)),t.forEach((e,t)=>Array.from({length:i.arity},(n,a)=>{c(r,t,a)&&xm(l.argConstraints,hm(i.name,a),e.data.level)}))}),e.argParams.forEach(e=>{let t=_m(e),n=s(t.operator);n&&xm(l.argConstraints,hm(t.operator,t.index),n.data.level)}),t.forEach(e=>e.data.argParams.forEach(e=>{a(_m(e).param)||l.argParams.add(e)})),n.forEach(e=>e.argParams.forEach(e=>l.argParams.add(e))),e.argParams.forEach(e=>{let t=_m(e),n=s(t.operator);if(n)n.kind===`Declared`&&l.argParams.add(gm(n.declared.name,t.index,t.param));else{let n=s(t.param);if(!n){l.argParams.add(e);return}n.data.params.forEach(e=>l.argParams.add(gm(t.operator,t.index,e)))}}),t.forEach((e,n)=>{if(e.kind!==`Declared`)return;let r=e.declared;t.forEach((e,t)=>Array.from({length:r.arity},(i,a)=>{c(n,t,a)&&e.data.params.forEach(e=>l.argParams.add(gm(r.name,a,e)))}))}),l},c=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Operator`,data:x(`LAMBDA`,ch(e.params),e.body,t)};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0;if(n!==void 0){let r=a(n,t);if(r.kind===`Defined`&&(r.levels.formals.length>0||e.kind===`OperatorReference`))return{kind:`Operator`,data:r.levels};if(r.kind===`Declared`&&r.arity>0){let e=ym();return e.params.add(n),{kind:`Declared`,data:e,declared:{name:n,arity:r.arity}}}if(e.kind===`OperatorReference`)return{kind:`Value`,data:ym()}}return{kind:`Value`,data:y(e,t)}},l=(e,t)=>e.map(e=>c(e,t)),u=(e,t,n,r=[],a=ba(r))=>{let o=l(t,sh(n,ch(a))),c=r.map(e=>y(e.set,n)),u=s(e,o,c,a);return c.forEach((t,n)=>{if(t.level<=2||(u.isCorrect=!1,!t.isCorrect))return;let a=r[n].pattern,o=a.ranges?.[0];i.push(`Level error in applying operator ${e.name}:\nThe level of the range for the bounded variable ${o?m(o):ya(a)[0]} \nexceeds the maximum level allowed by the operator`)}),u},d=(e,t)=>e.kind===`Declared`?o(e.name,e.level,t):s(e.levels,t),f=(e,t)=>{gh(e)&&i.push(`${t} has both temporal formula and action as arguments`)},p=(e,t)=>{(e.operator===`~>`||e.operator===`-+->`)&&t.some(e=>e.data.level===2)&&i.push(`Action used where only temporal formula or state predicate allowed`),hh.has(e.operator)&&f(t.map(e=>e.data.level),xt(e.operator))},h=(e,t)=>{let n=e.expression,r=e.kind===`Always`?`BoxAction`:`AngleAction`;t===2&&vh(n)&&n.kind!==r&&i.push(e.kind===`Always`?`[] followed by action not of form [A]_v`:`<> followed by action not of form <<A>>_v`)},g=(e,t)=>{let n=dh(e,t);e.recursive&&ph(t,e).forEach(e=>ne(e.members));let r=e.definitions.map(e=>S(e,n)),i=y(e.body,n),a={level:i.level,isCorrect:i.isCorrect&&r.every(e=>e.isCorrect),params:new Set(i.params),constraints:new Map(i.constraints),argConstraints:new Map(i.argConstraints),argParams:new Set(i.argParams)};return r.forEach(e=>Sm(a,e)),a},_=(e,t,n)=>i.length===e?n:(t&&i.splice(e).forEach(e=>r.push({location:m(t),message:`${e}.`})),{...n,isCorrect:!1}),v=(e,t)=>{let n=i.length;return _(n,e,t())},y=(e,t)=>{let n=i.length;return _(n,e.location.range,ee(e,t))},ee=(e,t)=>{switch(e.kind){case`Number`:case`Decimal`:case`String`:case`ExceptAt`:return ym();case`Identifier`:return d(a(e.name,t),[]);case`Apply`:{let n=l(e.args,t);return p(e,n),d(a(e.operator,t),n)}case`OperatorReference`:case`Lambda`:return c(e,t).data;case`And`:case`Or`:{let n=e.kind===`And`;if(e.isBulleted){let r=l(e.operands,t);return f(r.map(e=>e.data.level),`${n?`Conjunction`:`Disjunction`} list`),s(n?jm:Mm,r)}let i=n?`\\land`:`\\lor`,a=_h(e.operands[0]),o=[],u=0,d=!1;e.operands.forEach((n,s)=>{let l=c(n,t);o.push(l);let p=[u,l.data.level];if(u=Math.max(u,l.data.level),s===0)return;let h=_h(n);s===e.operands.length-1||!a||!h?f(p,i):gh(p)&&(r.push({location:m({...a,end:h.end}),message:`${i} has both temporal formula and action as arguments.`}),d=!0)});let p=s(n?jm:Mm,o);return d?{...p,isCorrect:!1}:p}case`Prime`:return u(Em,[e.expression],t);case`Unchanged`:return u(Dm,[e.expression],t);case`Enabled`:return u(Om,[e.expression],t);case`Always`:case`Eventually`:{let n=c(e.expression,t);return h(e,n.data.level),s(e.kind===`Always`?km:Am,[n])}case`If`:return u(Nm,[e.condition,e.consequent,e.alternative],t);case`Case`:return u(Pm,[...e.arms.flatMap(e=>[e.condition,e.body]),...e.other?[e.other]:[]],t);case`Let`:return g(e,t);case`Forall`:case`Exists`:{let n=u(e.kind===`Forall`?Fm:Im,[e.body],t,e.bounds),i=n.level===3?e.bounds.find(e=>y(e.set,t).level===2):void 0,a=i?.set.location.range;return a&&r.push({location:m(a),message:`Action-level bound of quantified temporal formula.`}),i?{...n,isCorrect:!1}:n}case`UnboundedQuantifier`:return u(e.isTemporal?e.quantifier===`Forall`?zm:Bm:e.quantifier===`Forall`?Lm:Rm,[e.body],t,[],e.names);case`Choose`:return u(e.set?Vm:Hm,[e.body],t,e.set?[{pattern:e.pattern,set:e.set}]:[],ya(e.pattern));case`SetEnumeration`:return u(Um,e.elements,t);case`Tuple`:return u(Wm,e.elements,t);case`FunctionSet`:return u(Gm,[e.domain,e.range],t);case`Product`:return u(Km,e.factors,t);case`SetFilter`:return u(qm,[e.predicate],t,[e.bound]);case`SetMap`:return u(Jm,[e.expression],t,e.bounds);case`FunctionConstruction`:return u(Ym,[e.body],t,e.bounds);case`Record`:return u(Xm,e.fields.map(e=>e.value),t);case`RecordSet`:return u(Zm,e.fields.map(e=>e.value),t);case`Except`:return s(Qm,[c(e.function,t),...e.updates.map(e=>({kind:`Value`,data:s($m,[{kind:`Value`,data:v(e.range,()=>s(eh,e.path.map(e=>e.kind===`Field`?{kind:`Value`,data:ym()}:e.args.length===1?c(e.args[0],t):{kind:`Value`,data:v(e.tupleRange,()=>u(Wm,e.args,t))})))},c(e.value,t)])}))]);case`FunctionApplication`:return s(th,[c(e.function,t),e.args.length===1?c(e.args[0],t):{kind:`Value`,data:u(Wm,e.args,t)}]);case`Bracket`:return ym();case`FieldAccess`:return s(nh,[c(e.record,t),{kind:`Value`,data:ym()}]);case`BoxAction`:case`AngleAction`:return u(e.kind===`BoxAction`?rh:ih,[e.action,e.subscript],t);case`WeakFairness`:case`StrongFairness`:return u(e.kind===`WeakFairness`?ah:oh,[e.subscript,e.action],t);case`Label`:return y(e.body,t);case`Selection`:{let r=e.expression,i=n.get(r);if(i)return i;let a=y(r,t);return n.set(r,a),a}case`Subexpression`:return ym()}},b=(e,t,n=!1,r=/* @__PURE__ */ new Set)=>{let i=(e,i=n,a=t)=>b(e,a,i,r),o=(e,o)=>{let s=a(e,t);s.kind===`Declared`?(n&&r.add(e),o.forEach(e=>i(e))):o.forEach((e,t)=>i(e,n||s.levels.nonLeibniz.has(t)))};switch(e.kind){case`Identifier`:return o(e.name,[]),r;case`Apply`:return o(e.operator,e.args),r;case`Lambda`:case`Let`:case`Selection`:return r;case`Prime`:case`Unchanged`:case`Enabled`:case`Always`:case`Eventually`:case`BoxAction`:case`AngleAction`:case`WeakFairness`:case`StrongFairness`:return gt(e).forEach(e=>i(e,!0)),r;case`UnboundedQuantifier`:return i(e.body,n||e.isTemporal===!0,sh(t,ch(e.names))),r;default:return Fp(e,(e,r)=>i(e,n,sh(t,ch(r)))),r}},x=(e,t,n,r)=>{let i=sh(r,t),a=y(n,i),o=e=>t.some(t=>t.name===e),s=b(n.kind===`Selection`?n.expression:n,i),c={...ym(a.level),isCorrect:a.isCorrect,name:e,formals:t,nonLeibniz:new Set(t.flatMap((e,t)=>s.has(e.name)?[t]:[])),maxLevels:t.map(e=>Math.min(3,a.constraints.get(e.name)??3)),weights:t.map(e=>+!!a.params.has(e.name)),minMaxLevels:t.map(e=>Array.from({length:e.arity},(t,n)=>a.argConstraints.get(hm(e.name,n))??0)),conditions:new Set(t.flatMap((e,n)=>t.flatMap((t,r)=>Array.from({length:e.arity},(e,t)=>t).filter(n=>a.argParams.has(gm(e.name,n,t.name))).map(e=>vm(n,r,e)))))};return a.params.forEach(e=>{o(e)||c.params.add(e)}),a.constraints.forEach((e,t)=>{o(t)||c.constraints.set(t,e)}),a.argConstraints.forEach((e,t)=>{o(_m(t).operator)||c.argConstraints.set(t,e)}),a.argParams.forEach(e=>{let t=_m(e);o(t.operator)&&o(t.param)||c.argParams.add(e)}),c},te=/* @__PURE__ */ new Set,S=(e,n)=>{let r=t.get(e);if(r&&!te.delete(e))return r;let i=r??fh(e,3,0);t.set(e,i);let a=x(e.name,lh(e),uh(e),n),o={...a,level:Math.max(i.level,a.level),params:/* @__PURE__ */ new Set([...i.params,...a.params]),argParams:/* @__PURE__ */ new Set([...i.argParams,...a.argParams]),maxLevels:a.maxLevels.map((e,t)=>Math.min(e,i.maxLevels[t])),weights:a.weights.map((e,t)=>Math.max(e,i.weights[t])),nonLeibniz:/* @__PURE__ */ new Set([...i.nonLeibniz,...a.nonLeibniz])};return t.set(e,o),o},C=e=>e.forEach(e=>{let t=e.definition.location.range;e.definition.isRecursive&&t&&S(e.definition,e.scope).maxLevels.forEach((n,i)=>{n>=2||r.push({location:m(t),message:`Argument ${i+1} of recursive operator ${xt(e.definition.name)} is primed`})})}),ne=e=>{if(e.length===0||t.has(e[0].definition))return;let n=e.filter(e=>e.definition.isRecursive);n.forEach(e=>t.set(e.definition,fh(e.definition,2,1)));let r=e=>(e.definition.isRecursive&&te.add(e.definition),S(e.definition,e.scope));e.forEach(e=>{r(e),C([e])});let i=n.map(e=>S(e.definition,e.scope)),a=Math.max(0,...i.map(e=>e.level)),o=i.flatMap(e=>[...e.params]);e.forEach(e=>{let n=S(e.definition,e.scope);t.set(e.definition,{...n,level:Math.max(n.level,a),params:/* @__PURE__ */ new Set([...n.params,...o])}),e.isRechecked&&!e.definition.isRecursive&&te.add(e.definition)}),e.forEach(r)};return{analyze:y,analyzeDefinition:S,checkPrimedArguments:C,checkRecursiveSection:ne,toOperand:c,errors:r}},bh=(e,t,n)=>{let r=new Map(t),i=e.assumptions.flatMap(e=>{if(e.kind===`NewSymbol`){let t=e.set&&n.analyze(e.set,r),i=e.location.range;return t?.level===3&&i&&n.errors.push({location:m(i),message:`Level error:
|
|
403
|
+
Temporal formula used as set.`}),r.set(e.name,{kind:`Formal`,arity:e.arity,level:mm[e.level]}),t?[t]:[]}return[e.kind===`AssumeProve`?bh(e,r,n):n.analyze(e,r)]});i.push(n.analyze(e.conclusion,r));let a=ym(Math.max(...i.map(e=>e.level)));return i.forEach(e=>{e.params.forEach(e=>a.params.add(e)),Sm(a,e)}),a},xh=(e,t,n,r)=>{let i=yh(t),a=(e,t)=>Math.max(0,...e.map(e=>i.analyze(e,t).level)),o=(e,t)=>{let n=e.body;return n.kind===`Have`||n.kind===`Case`?a([n.expression],t):n.kind===`Witness`?a(n.expressions,t):n.kind===`Take`?a(n.bounds.map(e=>e.set),t):n.kind===`Pick`?a([n.body,...n.bounds.map(e=>e.set)],t):n.kind===`Assert`?n.statement.kind===`AssumeProve`?bh(n.statement,t,i).level:a([n.statement],t):0},s=(e,t)=>e.forEach(e=>{e.kind!==`ModuleFact`&&i.analyze(e,t)}),c=e=>e?.kind===`Steps`?e.steps.flatMap(e=>{let t=m(e.statement),n=()=>o(e,/* @__PURE__ */ new Map)===0;return e.body.kind===`Have`||e.body.kind===`Take`||e.body.kind===`Witness`?n()?[]:[{location:t,message:`Non-constant TAKE, WITNESS, or HAVE for temporal goal.`}]:e.body.kind===`Case`?[...n()?[]:[{location:t,message:`Non-constant CASE for temporal goal.`}],...c(e.proof)]:e.body.kind===`Qed`?c(e.proof):[]}):[],l=(e,t)=>{if(e?.kind===`By`)return s(e.facts,t),i.errors.splice(0);if(e?.kind!==`Steps`)return[];let n=new Map(t);return e.steps.flatMap(e=>{let t=e.body;(t.kind===`Use`||t.kind===`Hide`)&&s(t.facts,n),t.kind===`Define`&&t.definitions.forEach(e=>{e.kind!==`Instance`&&(n.set(e.name,{kind:`Let`,definition:e,scope:n}),i.analyzeDefinition(e,n))});let r=o(e,n)===3,u=t.kind===`Pick`&&t.bounds.length>0&&r?t.bounds.filter(e=>a([e.set],n)!==0).flatMap(e=>e.set.location.range?[{location:m(e.set.location.range),message:`Non-constant bound of temporal PICK.`}]:[]):[];return[...i.errors.splice(0),...l(e.proof,n),...u,...e.proof?.kind===`Steps`&&r?c(e.proof):[]]})},u=/* @__PURE__ */ new Map,d=e=>{let t=u.get(e);if(t!==void 0)return t;let n=e.kind===`AssumeProve`?bh(e,/* @__PURE__ */ new Map,i).level:i.analyze(e,/* @__PURE__ */ new Map).level;return u.set(e,n),n},f=[...e.theorems,...e.assumptions.map(e=>({...e,statement:e.expression}))],p=new Set(f.map(e=>e.statement)),h=ph(/* @__PURE__ */ new Map,e.units,e.hasRecursiveLet),g=(e,t)=>({location:e,check:e=>{t(),e.push(...i.errors.splice(0))}});return{sections:h.map(e=>g(e.location,()=>i.checkRecursiveSection(e.members))),check:t=>[(t?h:[]).map(e=>g(e.location,()=>i.checkPrimedArguments(e.members))),e.definitions.filter(e=>!e.name.includes(`!`)&&!p.has(e.body)).map(e=>g(e.location,()=>i.analyzeDefinition(e,/* @__PURE__ */ new Map))),f.filter(e=>e.name!==void 0).map(e=>g(e.location,()=>d(e.statement))),[...e.assumptions.map(e=>({location:e.location,check:t=>{let n=d(e.expression);t.push(...i.errors.splice(0));let r=e.location.range;n!==0&&r&&t.push({location:m(r),message:`Level error: assumptions must be level 0 (Constant), \nbut this one has level ${n}.`})}})),...e.theorems.map(e=>({location:e.location,check:t=>{let n=d(e.statement);t.push(...i.errors.splice(0),...l(e.proof,/* @__PURE__ */ new Map),...n===3?c(e.proof):[],...i.errors.splice(0))}})),...e.uses.map(e=>g(e.location,()=>s(e.facts,/* @__PURE__ */ new Map))),...n]].flatMap(e=>zo(e,r))}},Sh=1024,Ch=/* @__PURE__ */ new Set([`Prime`,`Unchanged`,`BoxAction`,`AngleAction`]),wh=/* @__PURE__ */ new Set([`Always`,`Eventually`,`WeakFairness`,`StrongFairness`]),Th=/* @__PURE__ */ new Set([...Ch,...wh,`Enabled`]),Eh=/* @__PURE__ */ new Set([`~>`,`-+->`]),Dh=/* @__PURE__ */ new Set([...Eh,`\\cdot`]),Oh=/* @__PURE__ */ new Set([`Print`,`PrintT`,`Assert`,`JavaTime`,`RandomElement`,`TLCGet`,`TLCSet`]),kh=/* @__PURE__ */ new Set([`UNION`,`\\cup`]),Ah=/* @__PURE__ */ new Set([`RandomSubset`,`RandomSetOfSubsets`,`TestRandomSetOfSubsets`,`RandomSubsetSet`]),jh=(e,t)=>Oh.has(e)||t.builtins.get(e)?.isStateLevel===!0,Mh=(e,t,n)=>{let r=new Uint32Array(n),i=[],a=e=>{let t=e.kind;if(Ch.has(t)||t===`Apply`&&e.operator===`\\cdot`)return 96;if(t===`Enabled`)return 32;if(wh.has(t)||t===`UnboundedQuantifier`&&e.isTemporal===!0||t===`Apply`&&Eh.has(e.operator))return 224},o=/* @__PURE__ */ new Map,s=(e,n,c)=>{let l=e.kind;if(l===`Selection`){let t=o.get(e.expression)??0,r=n?c?1:2:c?4:8;if((t&r)!==0)return;o.set(e.expression,t|r)}let u=c?1:513;(Th.has(l)||l===`UnboundedQuantifier`&&e.isTemporal===!0||l===`Apply`&&Dh.has(e.operator))&&(r[0]|=u),Th.has(l)&&(r[0]|=16);let d=a(e);n&&d!==void 0&&(r[0]|=d);let f=n&&d===void 0,p=_t(e);if(p!==void 0&&M(e)&&t.variableIndex.has(p)&&(c||(r[0]|=512),f&&(r[0]|=32)),p!==void 0&&!M(e)){let e=t.substitutions.get(p)??p,n=t.definitions.get(e),a=t.constants.has(p),o=t.variableIndex.get(p);if((o!==void 0||t.builtins.get(e)?.isStateLevel||n&&t.variableIndex.has(n.name))&&(r[0]|=u),o!==void 0&&(f&&(r[0]|=32),a||(r[1+(o>>>5)]|=1<<(o&31))),n)i.push({callee:n,isOverridden:a,isLevelCounted:f,isOperatorArgument:c||l===`OperatorReference`||l===`Identifier`&&n.kind===`Operator`&&n.params.length>0});else{jh(e,t)&&(r[0]|=2|(e===`Assert`?0:4)),kh.has(e)&&(r[0]|=8),Ah.has(e)&&(r[0]|=256),e===`TLCEval`&&(r[0]|=Sh),!a&&jh(e,t)&&(r[0]|=16);let n=t.builtins.get(e);f&&!a&&o===void 0&&n?.isStateLevel&&!n.isLevelConstant&&(r[0]|=n.isActionLevel?96:32)}}gt(e).forEach(e=>s(e,f,c||l===`Lambda`))};return e.forEach(e=>s(e,!0,!1)),{row:r,edges:i}},Nh=(e,t,n,r)=>{let i=n.length,a=e.slice(),o=new Int32Array(i).fill(-1),s=new Int32Array(i),c=new Int32Array(i).fill(-1),l=[],u=[],d=0,f=0,p=(e,n)=>{for(let i=0;i<t;i++){let o=a[n*t+i];a[e*t+i]|=i===0?o&r:o}},m=e=>{u.push(e,0),o[e]=s[e]=d++,l.push(e)};for(let e=0;e<i;e++)if(o[e]===-1)for(m(e);u.length>0;){let e=u[u.length-2],t=u[u.length-1],r=n[e];if(t<r.length){u[u.length-1]=t+1;let n=r[t];o[n]===-1?m(n):c[n]===-1&&(s[e]=Math.min(s[e],o[n]));continue}if(u.length-=2,u.length>0){let t=u[u.length-2];s[t]=Math.min(s[t],s[e])}if(s[e]!==o[e])continue;let i=[];for(;;){let t=l.pop()??e;if(c[t]=f,i.push(t),t===e)break}f++;let a=i[0];i.forEach(e=>{e!==a&&p(a,e),n[e].forEach(e=>{c[e]!==c[a]&&p(a,e)})}),i.forEach(e=>{e!==a&&p(e,a)})}return a},Ph=1294,Fh=(e,t)=>e.kind===`Operator`&&e.params.length===0&&!(t&513),Ih=e=>{let t=[...new Set(e.definitions.values())],n=new Map(t.map((e,t)=>[e,t])),r=1+(e.variables.length+31>>>5),i=new Uint32Array(t.length*r),a=new Uint32Array(t.length*r),o=t.map((t,n)=>{let o=Mh(ht(t),e,r);return i.set(o.row,n*r),a[n*r]=o.row[0]&Ph,o.edges}),s=e=>n.get(e.callee)??-1,c=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden).map(s))),l=Nh(i,r,c,17),u=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&e.isLevelCounted).map(s))),d=Nh(i,r,u,224),f=o.map(e=>new Int32Array(e.filter(e=>!e.isOverridden&&!e.isOperatorArgument).map(s))),p=Nh(i,r,f,512),m=o.map(e=>new Int32Array(e.map(s).filter(e=>!Fh(t[e],l[e*r]|p[e*r])))),h=Nh(a,r,m,Ph);return{ids:n,rows:l.map((e,t)=>t%r===0?e&17|p[t]&512|d[t]&224|h[t]&Ph:e),words:r}},Lh=(e,t)=>{let n=t.facts,r=n.ids.get(e);return r===void 0?Rh(ht(e),t):n.rows.subarray(r*n.words,(r+1)*n.words)},Rh=(e,t)=>{let n=t.facts.words,r=Mh(e,t,n),i=r.row;return r.edges.forEach(e=>{let r=Lh(e.callee,t);if(!e.isOverridden){i[0]|=r[0]&17,e.isOperatorArgument||(i[0]|=r[0]&512),e.isLevelCounted&&(i[0]|=r[0]&224);for(let e=1;e<n;e++)i[e]|=r[e]}Fh(e.callee,r[0])||(i[0]|=r[0]&Ph)}),i},zh=(e,t)=>!(Lh(e,t)[0]&513),Bh=(e,t)=>!(Lh(e,t)[0]&512),Vh={any:2,repeated:4,streamed:8,replayed:260,varying:258},Hh=(e,t,n)=>(Rh(e,t)[0]&Vh[n])!==0,Uh=(e,t,n=`any`)=>(Lh(e,t)[0]&Vh[n])!==0,Wh=(e,t)=>!!(Rh([e],t)[0]&Sh),Gh=(e,t)=>{let n=Lh(e,t)[0]&224;return n===224?3:n===96?2:+(n===32)},Kh=e=>{let t=[];for(let n=1;n<e.length;n++)for(let r=e[n];r!==0;r&=r-1)t.push((n-1<<5)+(31-Math.clz32(r&-r)));return t},qh=(e,t)=>{let n=Rh([e],t);return n[0]&16?void 0:Kh(n)},Jh=(e,t)=>!!(Rh([e],t)[0]&1),Yh=/* @__PURE__ */ new Set([`Apply`,`And`,`Or`,`If`,`FunctionApplication`,`FieldAccess`,`Record`,`Tuple`,`SetEnumeration`,`Prime`,`Unchanged`,`Forall`,`Exists`,`Choose`,`SetFilter`,`FunctionConstruction`]),Xh=()=>({implication:fx,negate:px,equivalent:mx,body:hx,condition:(e,t)=>{if(typeof e!=`boolean`)throw Yb(t,e);return e},junct:(e,t,n)=>{if(typeof e!=`boolean`)throw Xb(t,n,e);return e},apply:Fu,expectFunction:cx,tuple:Pl,set:vl,record:Il,writtenRecord:Ws,equal:zc,enumerate:Sx,choiceElements:eC,noChoice:e=>{throw tC(e)},filterPredicate:$S,isReducible:Ns,finiteElements:e=>G(e).elements,addBounded:ks,normalizedSet:Dc,isBeyondBound:As,cardinality:ou,functionDomain:Ml,sortedFunction:Oc,unassigned:(e,t)=>{throw rx(e,t)},prime:yS,keepLazyContext:lx,extend:(e,t,n)=>({environment:e.environment,scope:t.reduce((e,t,r)=>ox(e,t,n[r]),e.scope),state:e.state,next:e.next,isKeepLazy:e.isKeepLazy})});let Zh,Qh;const $h=()=>{try{return!!Function(``)}catch(e){if(e instanceof EvalError)return!1;throw e}},eg=(e,t)=>(e.references.push(t),`reference${e.references.length-1}`),tg=e=>`local${e.counter++}`,ng=(e,t=/* @__PURE__ */ new Set)=>{let n=_t(e);return n!==void 0&&t.add(n),e.kind!==`Selection`&>(e).forEach(e=>ng(e,t)),t},rg=(e,t,n)=>{if(n.locals.size===0)return n.context;let r=Wh(t,e.environment),i=ng(t),a=[...n.locals].filter(e=>r||i.has(e[0]));if(a.length===0)return n.context;let o=eg(e,a.map(e=>e[0]));return`extend(${n.context}, ${o}, [${a.map(e=>e[1]).join(`, `)}])`},ig=(e,t,n)=>`${eg(e,OS(t,e.environment))}(${rg(e,t,n)})`,ag=(e,t,n)=>{let r=`helper${e.counter++}`,i=[...t.locals.values()],a={context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:new Map(t.locals)},o=i.map(e=>`, ${e}`).join(``);return e.helpers.push(`function ${r}(context, state, next${o}) { let primed; let applied; ${n(a)} }`),`${r}(${t.context}, ${t.state}, ${t.isPrimed?`undefined`:t.next}${o})`},og=(e,t,n,r)=>{let i=tg(e),a=tg(e),o=tg(e);return`for (let ${i} = 0, ${a} = ${t}.low, ${o} = ${a} === undefined ? ${t}.length : ${t}.high - ${a} + 1; ${i} < ${o}; ${i}++) { const ${n} = ${a} === undefined ? ${t}[${i}] : ${a} + ${i}; ${r} }`},sg=(e,t,n)=>{let r=t.kind===`Forall`;return ag(e,n,n=>{let i=t.bounds.map(()=>tg(e)),a=t.bounds.map((r,a)=>a>0&&t.bounds[a-1].set===r.set?`const ${i[a]} = ${i[a-1]};`:`const ${i[a]} = enumerate(${mg(e,r.set,n)}, ${eg(e,r.set)}, ${JSON.stringify(e.environment.runtime.version)});`),o=t.bounds.map(t=>{let r=tg(e);return t.pattern.kind===`Name`&&n.locals.set(t.pattern.name,r),r}),s=`if (body(${mg(e,t.body,n)}, ${eg(e,t)}) !== ${r}) return ${!r};`,c=o.reduce((t,n,r)=>og(e,i[r],n,t),s);return`${a.join(` `)} ${c} return ${r};`})},cg=(e,t,n,r,i)=>ag(e,i,i=>{let a=tg(e),o=tg(e),s=eg(e,t),c=`choiceElements(${mg(e,n,i)}, ${s}, ${eg(e,n)}, ${JSON.stringify(e.environment.runtime.version)})`;i.locals.set(r,o);let l=`if (body(${mg(e,t.body,i)}, ${s})) return ${o};`;return`const ${a} = ${c}; ${og(e,a,o,l)} return noChoice(${s});`}),lg=(e,t,n,r)=>ag(e,r,r=>{let i=tg(e),a=tg(e),o=tg(e),s=tg(e),c=eg(e,t),l=`if (!isReducible(${i})) return ${eg(e,XS(t,e.environment))}(${i}, ${rg(e,t,r)});`,u=mg(e,t.bound.set,r);r.locals.set(n,s);let d=QS(t,e.environment)?` else break;`:``,f=`if (filterPredicate(${mg(e,t.predicate,r)}, ${c})) addBounded(${o}, ${s});${d}`;return`const ${i} = ${u}; ${l} const ${a} = ${i}.kind === "Interval" ? ${i} : finiteElements(${i}); const ${o} = []; ${og(e,a,s,f)} return normalizedSet(${o});`}),ug=(e,t,n,r)=>ag(e,r,r=>{let i=tg(e),a=tg(e),o=tg(e),s=tg(e),c=tg(e),l=tg(e),u=eg(e,qS(t,e.environment)),d=rg(e,t,r),f=`if (context.isKeepLazy || !isReducible(${i})) return ${u}.build(${i}, ${d});`,p=mg(e,t.bounds[0].set,r);r.locals.set(n,c);let m=`const ${l} = ${mg(e,t.body,r)}; if (!${a}) ${s}.push(${l});`;return`const ${i} = ${p}; ${f} const ${a} = isBeyondBound(${i}); const ${o} = ${a} ? ${i} : functionDomain(${i}); if (${a}) cardinality(${i}); const ${s} = []; ${og(e,o,c,m)} return ${a} ? ${u}.createLazy(${i}, ${d}) : sortedFunction(${o}, ${s});`}),dg=(e,t,n)=>{let r=t.args;if(t.operator===`=>`){let i=mg(e,r[0],n),a=mg(e,r[1],n),o=eg(e,t);return`(implication(${i}, ${o}, "P") ? implication(${a}, ${o}, "Q") : true)`}if(t.operator===`~`&&r.length===1)return`negate(${mg(e,r[0],n)}, ${eg(e,t)})`;if(t.operator===`<=>`)return`equivalent(${mg(e,r[0],n)}, ${mg(e,r[1],n)}, ${eg(e,t)})`;if(M(t))return ig(e,t,n);let i=Xx(t.operator,e.environment);if(i?.kind!==`Builtin`)return ig(e,t,n);if(i.name===`DOMAIN`)return`${eg(e,$b(t))}(${mg(e,r[0],n)})`;if(i.name===`\\subseteq`&&i.evaluateBinary&&r.length===2)return`${eg(e,ex(t,i.evaluateBinary))}(${mg(e,r[0],n)}, ${mg(e,r[1],n)})`;let a=e.environment;if(i.evaluateUnary&&r.length===1&&jS(r[0],a))return`${eg(e,i.evaluateUnary)}(${mg(e,r[0],n)})`;let o=r.length===2&&jS(r[0],a)&&jS(r[1],a);return i.evaluateBinary&&o?`${eg(e,i.evaluateBinary)}(${mg(e,r[0],n)}, ${mg(e,r[1],n)})`:ig(e,t,n)},fg=(e,t,n)=>{switch(e.kind){case`Identifier`:{if(t.locals.has(e.name))return!0;if(M(e))return!1;let r=sS(e.name,n);return r?.kind===`Variable`||r?.kind===`Value`}case`Prime`:return fg(e.expression,t,n);case`FieldAccess`:return fg(e.record,t,n);case`FunctionApplication`:return[e.function,...e.args].every(e=>fg(e,t,n));default:return!1}},pg=e=>{switch(e.kind){case`Identifier`:case`Number`:case`String`:return!0;case`FieldAccess`:return pg(e.record);case`FunctionApplication`:return[e.function,...e.args].every(pg);default:return!1}},mg=(e,t,n)=>{let r=(t,r=n)=>mg(e,t,r);switch(t.kind){case`Number`:return Rs(t.value)?String(t.value):ig(e,t,n);case`String`:return JSON.stringify(t.value);case`Identifier`:{let r=n.locals.get(t.name);if(r)return r;if(M(t))return ig(e,t,n);let i=sS(t.name,e.environment);if(i?.kind===`Variable`){let r=JSON.stringify(t.name),a=eg(e,t);return`(${n.state}?.[${i.index}] ?? unassigned(${r}, ${a}))`}return i?.kind===`Value`?eg(e,i.value):ig(e,t,n)}case`Apply`:return dg(e,t,n);case`And`:case`Or`:{if(t.operands.length===0)return String(t.kind===`And`);let n=eg(e,t),i=t.kind===`And`?` && `:` || `;return`(${t.operands.map((e,t)=>`junct(${r(e)}, ${n}, ${t})`).join(i)})`}case`If`:return`(condition(${r(t.condition)}, ${eg(e,t)}) ? ${r(t.consequent)} : ${r(t.alternative)})`;case`FunctionApplication`:{HS(t.function);let i={...n,context:`keepLazyContext(${n.context})`},a=`(applied = ${fg(t.function,n,e.environment)?r(t.function):pg(t.function)?r(t.function,i):ig(e,t.function,i)}, typeof applied === "object" && (applied.kind === "Function" || applied.kind === "LazyFunction") ? applied : expectFunction(applied, ${eg(e,t)}))`,o=Qb(e.environment.runtime.version),s=o?`, ${eg(e,o)}`:``;return t.args.length===1?`apply(${a}, ${r(t.args[0])}${s})`:`apply(${a}, tuple([${t.args.map(e=>r(e)).join(`, `)}])${s})`}case`FieldAccess`:return`${eg(e,Zb(t))}(${r(t.record)})`;case`Record`:{let i=rC(t.fields);if(iC(i))return ig(e,t,n);let a=eg(e,i.map(e=>e.name)),o=`[${t.fields.map(e=>r(e.value)).join(`, `)}]`,s=t.fields.map(e=>e.name);return s.every((e,t)=>e===i[t].name)?`record(${a}, ${o})`:`writtenRecord(${a}, ${eg(e,i.map(e=>t.fields.indexOf(e)))}, ${o}, ${eg(e,s)})`}case`Tuple`:return`tuple([${t.elements.map(e=>r(e)).join(`, `)}])`;case`SetEnumeration`:return`set([${t.elements.map(e=>r(e)).join(`, `)}])`;case`Prime`:return n.isPrimed?ig(e,t,n):r(t.expression,{context:`(primed ??= prime(${n.context}))`,state:n.next,next:`undefined`,isPrimed:!0,locals:n.locals});case`Unchanged`:return`equal(${r({kind:`Prime`,expression:t.expression,location:t.location})}, ${r(t.expression)})`;case`Forall`:case`Exists`:return t.bounds.every(e=>e.pattern.kind===`Name`)?sg(e,t,n):ig(e,t,n);case`Choose`:return t.set&&t.pattern.kind===`Name`?cg(e,t,t.set,t.pattern.name,n):ig(e,t,n);case`FunctionConstruction`:{let r=t.bounds[0];return t.bounds.length===1&&r.pattern.kind===`Name`&&!t.isRecursive&&!KS(t)?ug(e,t,r.pattern.name,n):ig(e,t,n)}case`SetFilter`:return t.bound.pattern.kind===`Name`?lg(e,t,t.bound.pattern.name,n):ig(e,t,n);default:return ig(e,t,n)}},hg=(e,t)=>{if(!Yh.has(e.kind)||(Qh??=$h(),!Qh))return;let n={environment:t,references:[],helpers:[],counter:0},r=mg(n,e,{context:`context`,state:`state`,next:`next`,isPrimed:!1,locals:/* @__PURE__ */ new Map}),i=n.references.map((e,t)=>`reference${t}`),a=`${n.helpers.join(`
|
|
404
|
+
`)}\nreturn (context) => { const state = context.state; const next = context.next; let primed; let applied; return ${r}; };`;return Zh??=Xh(),Function(...Object.keys(Zh),...i,a)(...Object.values(Zh),...n.references)},gg=(e,n,r)=>new t(`Applying ${e} to the following value,\nwhich is not ${n}:\n${U(q(r))}`),_g=e=>Ps(e)?K(e):void 0,vg=`a function with a finite domain`,yg=(e,t,n)=>{let r=J(e,t,n),i=_g(r);if(!i)throw gg(n,vg,r);return i},bg=(e,t)=>{let n=J(e,1,t),r=_g(n),i=r&&wg(r,J(e,0,t));if(!r||i!==void 0&&typeof i!=`number`)throw Xf(`second`,t,`bag`,n);return i},xg=(e,t,n)=>{let r=t[n];if(!r||!Cg(r))throw Xf(n===0?`first`:`second`,`(+)`,`bag`,J(e,n,`(+)`));return r},Sg=(e,t)=>{if(!Ms(e)||!W(e))throw t();return G(e).elements},Cg=e=>e.range.every(e=>typeof e==`number`&&e>0),wg=(e,t)=>{let n=e.domain.findIndex(e=>ml(t,e));return n===-1?void 0:e.range[n]},Tg=(e,t)=>{if(typeof e==`number`)return e;throw t()},Eg=(e,t,n)=>{let r=Tg(e,n)+Tg(t,n);if(ap(r))throw op(`${e}+${t}`);return r},Dg=(e,t,n,r,i)=>{let a=Tg(e.range[t],r),o=wg(n,e.domain[t]);if(o===void 0)return a;let s=a-Tg(o,i);if(ap(s))throw op(`${a}-${o}`);return s},Og=(e,t,n,r,i=e.length)=>{let a=e.slice(0,i).find(e=>ml(t,e[0]));a?a[1]=Eg(a[1],n,r):e.push([t,n])},kg=e=>e.domain.map((t,n)=>[t,e.range[n]]),Ag=Oc([],[]),jg=e=>[tp(`EmptyBag`,Ag),Y(`IsABag`,1,e=>{let t=_g(J(e,0,`IsABag`));return t!==void 0&&Cg(t)}),Y(`BagCardinality`,1,e=>{let t=J(e,0,`BagCardinality`),n=yg(e,0,`BagCardinality`),r=()=>gg(`BagCardinality`,`a bag`,t);return n.range.reduce((e,t)=>{if(typeof t!=`number`||t<=0)throw r();return Eg(e,t,r)},0)}),Y(`BagIn`,2,e=>{let t=bg(e,`BagIn`);return t!==void 0&&t>0}),Y(`CopiesIn`,2,e=>bg(e,`CopiesIn`)??0),Y(`\\oplus`,2,e=>{let t=[0,1].map(t=>_g(J(e,t,`(+)`))),n=xg(e,t,0),r=xg(e,t,1),i=kg(n),a=()=>Xf(`second`,`(+)`,`bag`,J(e,1,`(+)`));return r.domain.forEach((e,t)=>Og(i,e,r.range[t],a,n.domain.length)),Cl(i)}),Y(`\\ominus`,2,e=>{let t=J(e,0,`(-)`),n=J(e,1,`(-)`),r=_g(t),i=_g(n);if(!r)throw Xf(`first`,`(-)`,`bag`,t);if(!i)throw Xf(`second`,`(-)`,`bag`,n);let a=()=>Xf(`first`,`(-)`,`bag`,t),o=()=>Xf(`second`,`(-)`,`bag`,n);return Cl(r.domain.flatMap((e,t)=>{let n=Dg(r,t,i,a,o);return n>0?[[e,n]]:[]}))}),Y(`BagUnion`,1,e=>{let n=J(e,0,`BagUnion`),r=Sg(n,()=>gg(`BagUnion`,`a finite enumerable set`,n));if(r.length<2)return r[0]??Ag;let i=()=>new t(`Attempted to apply BagUnion to the following set, whose\nelement is not a bag:\n${U(q(n))}`),a=e=>{let t=_g(e);if(!t)throw i();return t},o=kg(a(r[0]));return r.slice(1).forEach(e=>{let t=a(e);t.domain.forEach((e,n)=>Og(o,e,t.range[n],i))}),Cl(o)}),Y(`\\sqsubseteq`,2,e=>{let t=J(e,0,`\\sqsubseteq`),n=J(e,1,`\\sqsubseteq`),r=_g(t),i=_g(n);if(!r)throw gg(`\\sqsubseteq`,vg,t);if(!i)throw gg(`\\sqsubseteq`,vg,n);let a=()=>gg(`\\sqsubseteq`,`a bag`,t),o=()=>gg(`\\sqsubseteq`,`a bag`,n);return r.domain.every((e,t)=>{let n=wg(i,e);return Tg(r.range[t],a)<=(n===void 0?0:Tg(n,o))})}),np(`BagOfAll`,2,e=>{let t=ep(e,0,`BagOfAll`),n=J(e,1,`BagOfAll`),r=_g(n);if(!r)throw Xf(`second`,`BagOfAll`,`function with a finite domain`,n);let i=[],a=()=>Xf(`second`,`BagOfAll`,`bag`,n);return r.domain.forEach((e,n)=>Og(i,t.call([e]),r.range[n],a)),Cl(i)}),Y(`SubBag`,1,t=>{let n=J(t,0,`SubBag`);if(!Ps(n))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${fp(n)})\nline 106, col 58 to line 106, col 65 of module Bags`);let r=K(n),i=G(vl(r.range)).elements,a=i.find(e=>typeof e!=`number`);a!==void 0&&e.get(`>=`)?.evaluateBinary?.(i[0],a);let o=r.range.filter(e=>typeof e==`number`);if(o.some(e=>e<1))throw new w(`Attempted to apply a function to ${q(r)}, which is not in its domain`);return _l(r.domain.reduce((e,t,n)=>e.flatMap(e=>[e,...Array.from({length:o[n]},(n,r)=>[...e,[t,r+1]])]),[[]]).map(e=>Oc(e.map(e=>e[0]),e.map(e=>e[1]))))}),Y(`BagToSet`,1,e=>Lu(yg(e,0,`BagToSet`))),Y(`SetToBag`,1,e=>{let t=J(e,0,`SetToBag`),n=Sg(t,()=>gg(`BagToSet`,vg,t));return Oc([...n],n.map(()=>1))})],Mg={emptyArray:1,nonemptyArray:2,emptyObject:3,danglingName:4,nonemptyObject:5,emptyDocument:6,nonemptyDocument:7},Z={none:0,beginObject:1,endObject:2,beginArray:3,endArray:4,true:5,false:6,null:7,singleQuoted:8,doubleQuoted:9,unquoted:10,singleQuotedName:12,doubleQuotedName:13,unquotedName:14,number:16,eof:17},Ng={none:0,sign:1,digit:2,decimal:3,fractionDigit:4,exponentE:5,exponentSign:6,exponentDigit:7},Pg=[{lower:`true`,upper:`TRUE`,token:Z.true},{lower:`false`,upper:`FALSE`,token:Z.false},{lower:`null`,upper:`NULL`,token:Z.null}],Fg=/* @__PURE__ */ new Map([[`t`,` `],[`b`,`\b`],[`n`,`
|
|
405
|
+
`],[`r`,`\r`],[`f`,`\f`]]),Ig=1024,Lg=e=>{let t=+!!e.startsWith(``),n=t,r=0,i=t,a=!0,o=Z.none,s=0,c=[Mg.emptyDocument],l=[void 0],u=[0],d=()=>`$${c.map((e,t)=>e===Mg.emptyArray||e===Mg.nonemptyArray?`[${u[t]}]`:e===Mg.emptyDocument||e===Mg.nonemptyDocument?``:`.${l[t]??``}`).join(``)}`,f=()=>` at line ${r+1} column ${n-i+1} path ${d()}`,p=e=>new w(`com.google.gson.stream.MalformedJsonException: ${e}${f()}
|
|
406
|
+
See https://github.com/google/gson/blob/main/Troubleshooting.md#malformed-json`),m=()=>new w(`java.io.EOFException: End of input${f()}`),h=()=>{if(!a)throw p(`Use JsonReader.setStrictness(Strictness.LENIENT) to accept malformed JSON`)},g=e=>`/\\;#=`.includes(e)?(h(),!1):!`{}[]:, \f\r
|
|
407
|
+
`.includes(e),_=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
408
|
+
`){r++,i=n;return}if(t===`\r`)return}},v=t=>{for(;n+t.length<=e.length;n++)if(e[n]===`
|
|
409
|
+
`)r++,i=n+1;else if(e.startsWith(t,n))return!0;return!1},y=()=>{for(;n<e.length;){let t=e[n++];if(t===`
|
|
410
|
+
`)r++,i=n;else if(t===`/`){if(n===e.length)return t;h();let r=e[n];if(r!==`*`&&r!==`/`)return t;if(n++,r===`/`)_();else if(v(`*/`))n+=2;else throw p(`Unterminated comment`)}else if(t===`#`)h(),_();else if(t!==` `&&t!==`\r`&&t!==` `)return t}},ee=()=>{let e=y();if(e===void 0)throw m();return e},b=()=>{let t=Pg.find(t=>e[n]===t.lower[0]||e[n]===t.upper[0]);if(!t)return Z.none;let r=t.lower.length;for(let i=0;i<r;i++){let r=e[n+i];if(r!==t.lower[i]&&r!==t.upper[i])return Z.none}return n+r<e.length&&g(e[n+r])?Z.none:(n+=r,t.token)},x=()=>{let t=Ng.none,r=!1,i=0;for(;n+i<e.length;i++){if(i===Ig)return Z.none;let a=e[n+i];if(a===`-`){if(t===Ng.none)t=Ng.sign;else if(t===Ng.exponentE)t=Ng.exponentSign;else return Z.none}else if(a===`+`){if(t!==Ng.exponentE)return Z.none;t=Ng.exponentSign}else if(a===`e`||a===`E`){if(t!==Ng.digit&&t!==Ng.fractionDigit)return Z.none;t=Ng.exponentE}else if(a===`.`){if(t!==Ng.digit)return Z.none;t=Ng.decimal}else if(a<`0`||a>`9`){if(g(a))return Z.none;break}else if(t===Ng.sign||t===Ng.none)r=a===`0`,t=Ng.digit;else if(t===Ng.digit){if(r)return Z.none}else t===Ng.decimal?t=Ng.fractionDigit:(t===Ng.exponentE||t===Ng.exponentSign)&&(t=Ng.exponentDigit)}return i===Ig||t!==Ng.digit&&t!==Ng.fractionDigit&&t!==Ng.exponentDigit?Z.none:(s=i,Z.number)},te=()=>{let t=c.length-1,r=c[t];if(r===Mg.emptyArray)c[t]=Mg.nonemptyArray;else if(r===Mg.nonemptyArray){let e=ee();if(e===`]`)return Z.endArray;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated array`)}else if(r===Mg.emptyObject||r===Mg.nonemptyObject){if(c[t]=Mg.danglingName,r===Mg.nonemptyObject){let e=ee();if(e===`}`)return Z.endObject;if(e===`;`)h();else if(e!==`,`)throw p(`Unterminated object`)}let e=ee();if(e===`"`)return Z.doubleQuotedName;if(e===`'`)return h(),Z.singleQuotedName;if(e===`}`){if(r!==Mg.nonemptyObject)return Z.endObject;throw p(`Expected name`)}if(h(),n--,g(e))return Z.unquotedName;throw p(`Expected name`)}else if(r===Mg.danglingName){c[t]=Mg.nonemptyObject;let r=ee();if(r===`=`)h(),e[n]===`>`&&n++;else if(r!==`:`)throw p(`Expected ':'`)}else if(r===Mg.emptyDocument){if(y()===void 0)return Z.eof;n--,e.startsWith(`)]}'
|
|
411
|
+
`,n)&&(n+=5),c[t]=Mg.nonemptyDocument}else if(r===Mg.nonemptyDocument){if(y()===void 0)return Z.eof;h(),n--}let i=y();if(i===void 0){if(r===Mg.emptyDocument)return Z.eof;throw m()}if(i===`]`&&r===Mg.emptyArray)return Z.endArray;if(i===`]`||i===`;`||i===`,`){if(r!==Mg.emptyArray&&r!==Mg.nonemptyArray)throw p(`Unexpected value`);return h(),n--,Z.null}if(i===`'`)return h(),Z.singleQuoted;if(i===`"`)return Z.doubleQuoted;if(i===`[`)return Z.beginArray;if(i===`{`)return Z.beginObject;n--;let a=b();if(a!==Z.none)return a;let o=x();if(o!==Z.none)return o;if(!g(e[n]))throw p(`Expected value`);return h(),Z.unquoted},S=()=>(o===Z.none&&(o=te()),o),C=()=>{if(n===e.length)throw p(`Unterminated escape sequence`);let t=e[n++];if(t===`u`){if(n+4>e.length)throw p(`Unterminated escape sequence`);let t=e.slice(n,n+4);if(!/^[\da-fA-F]{4}$/.test(t))throw p(`Malformed Unicode escape \\u${t}`);return n+=4,String.fromCharCode(Number.parseInt(t,16))}let a=Fg.get(t);if(a!==void 0)return a;if(t===`
|
|
412
|
+
`)return r++,i=n,t;if(`'"\\/`.includes(t))return t;throw p(`Invalid escape sequence`)},ne=t=>{let a=``,o=n;for(;n<e.length;){let s=e[n++];if(s===t)return a+e.slice(o,n-1);s===`\\`?(a+=e.slice(o,n-1)+C(),o=n):s===`
|
|
413
|
+
`&&(r++,i=n)}throw p(`Unterminated string`)},re=()=>{let t=n;for(;n<e.length&&g(e[n]);)n++;return e.slice(t,n)},T=e=>{if(c.length-1>=255)throw new w(`com.google.gson.stream.MalformedJsonException: Nesting limit 255 reached${f()}`);c.push(e),l.push(void 0),u.push(0),o=Z.none},ie=()=>{c.pop(),l.pop(),u.pop(),u[c.length-1]++,o=Z.none},ae=()=>{let e=S();return e!==Z.endObject&&e!==Z.endArray&&e!==Z.eof},oe=()=>{let e=S(),t=e===Z.unquotedName?re():ne(e===Z.singleQuotedName?`'`:`"`);return o=Z.none,l[c.length-1]=t,t},se=t=>t===Z.true||t===Z.false?t===Z.true:t===Z.null?null:t===Z.number?(n+=s,{literal:e.slice(n-s,n)}):t===Z.unquoted?re():ne(t===Z.singleQuoted?`'`:`"`),E=()=>{let e=S();if(e===Z.beginArray){T(Mg.emptyArray);let e=[];for(;ae();)e.push(E());return ie(),e}if(e===Z.beginObject){T(Mg.emptyObject);let e=/* @__PURE__ */ new Map;for(;ae();)e.set(oe(),E());return ie(),e}let t=se(e);return o=Z.none,u[c.length-1]++,t};if(S()===Z.eof)return null;let ce=E();return a=!1,ce!==null&&S(),ce},Rg=/* @__PURE__ */ new Set([`READ`,`WRITE`,`APPEND`,`TRUNCATE_EXISTING`,`CREATE`,`CREATE_NEW`,`DELETE_ON_CLOSE`,`SPARSE`,`SYNC`,`DSYNC`]),zg=/* @__PURE__ */ new Set([`utf-8`,`utf8`,`unicode-1-1-utf-8`]),Bg=/* @__PURE__ */ new Set([`us-ascii`,`iso-8859-1`,`utf-16`,`utf-16be`,`utf-16le`]),Vg=e=>{if(!Ps(e))return;let t=K(e),n=t.domain.flatMap((e,n)=>typeof e==`string`?[[e,t.range[n]]]:[]);return n.length===t.domain.length?Fl(n):void 0},Hg=(e,t)=>{let n=`tlc2.value.impl.${dp(e)}`,r=`tlc2.value.impl.${t}`;return new w(`class ${n} cannot be cast to class ${r} (${n} and ${r} are in unnamed module of loader 'app')`)},Ug=e=>new w(`Cannot convert value: unsupported value type tlc2.value.impl.${dp(e)}`),Wg=e=>JSON.stringify(e).replaceAll(`\u2028`,`\\u2028`).replaceAll(`\u2029`,`\\u2029`),Gg=e=>`[${e.map(Yg).join(`,`)}]`,Kg=e=>`{${Us(e).map(e=>`${Wg(typeof e[0]==`string`?e[0]:q(e[0]))}:${Yg(e[1])}`).join(`,`)}}`,qg=e=>{let t=K(e),n=du(t);return n?Gg(n):Kg(t)},Jg=e=>e===`FcnRcdValue`||e===`FcnLambdaValue`,Yg=e=>typeof e==`string`?Wg(e):typeof e==`object`?e.kind===`ModelValue`?Wg(e.name):dp(e)===`RecordValue`?Kg(K(e)):Xg(e):String(e),Xg=e=>{let t=dp(e);if(t===`TupleValue`)return Gg(K(e).range);if(Jg(t))return qg(e);if(Ll(e))return Gg(G(e).elements);throw Ug(e)},Zg=e=>e.map(e=>`${Yg(e)}\n`).join(``),Qg=e=>{let t=dp(e);if(t===`RecordValue`)return Kg(K(e));if(t===`TupleValue`)return`{${K(e).range.map((e,t)=>`"${t}":${Yg(e)}`).join(`,`)}}`;if(Jg(t))return qg(e);throw Ug(e)},$g=e=>{if(e===null)throw new w(`Cannot convert value: unsupported JSON value null`);if(typeof e==`boolean`)return e;if(typeof e==`string`)return dc(e);if(Array.isArray(e))return Pl(e.map($g));if(e instanceof Map)return Fl([...e].map(e=>[dc(e[0]),$g(e[1])]));let t=Number(e.literal);if(!/^-?\d+$/.test(e.literal)||ap(t))throw new w(`Cannot convert value: expected a 32-bit integer JSON number, but found ${e.literal}`);return t||0},e_=e=>{if(typeof e!=`string`)throw new w(`Cannot cast tlc2.value.impl.${dp(e)} to tlc2.value.impl.StringValue`);return e},t_=(e,t)=>{let n=Fu(e,t);if(typeof n!=`string`)throw Hg(n,`StringValue`);return n},n_=e=>{if(!zg.has(e.toLowerCase()))throw Bg.has(e.toLowerCase())?new p(`IOUtils!Serialize does not support the charset ${e}`):new w(/^[a-zA-Z\d][\w.:+-]*$/.test(e)?`java.nio.charset.UnsupportedCharsetException: ${e}`:`java.nio.charset.IllegalCharsetNameException: ${e}`)},r_=(e,t,n,r)=>{let i=n.find(e=>!Rg.has(e));if(i!==void 0)throw new w(`java.lang.IllegalArgumentException: No enum constant java.nio.file.StandardOpenOption.${i}`);if(n.includes(`READ`))throw new w(`java.lang.IllegalArgumentException: READ not allowed`);let a=new Set(n.length===0?[`CREATE`,`TRUNCATE_EXISTING`]:n);if(a.has(`APPEND`)&&a.has(`TRUNCATE_EXISTING`))throw new w(`java.lang.IllegalArgumentException: APPEND + TRUNCATE_EXISTING not allowed`);if(a.has(`DELETE_ON_CLOSE`))throw new p(`IOUtils!Serialize does not support DELETE_ON_CLOSE`);let o=e.readFile?.(t);if(o===void 0&&!a.has(`CREATE`)&&!a.has(`CREATE_NEW`))throw new w(`java.nio.file.NoSuchFileException: ${t}`);if(o!==void 0&&a.has(`CREATE_NEW`))throw new w(`java.nio.file.FileAlreadyExistsException: ${t}`);o===void 0||a.has(`TRUNCATE_EXISTING`)?e.writeFile?.(t,r):e.writeFile?.(t,a.has(`APPEND`)?o+r:r+o.slice(r.length))},i_=(e,t)=>{let n=t.lastIndexOf(`/`);n!==-1&&e.makeDirectory?.(t.slice(0,Math.max(n,1)))},a_=(e,t)=>{let n=e.readFile?.(t);if(n===void 0)throw new w(`${t} (No such file or directory)`);return n},o_=e=>[mp(rp(`ToJson`,1,e=>dc(Yg(J(e,0,`ToJson`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJson(tlc2.value.IValue) throws java.io.IOException`),mp(rp(`ToJsonArray`,1,e=>dc(Xg(J(e,0,`ToJsonArray`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonArray(tlc2.value.IValue) throws java.io.IOException`),mp(rp(`ToJsonObject`,1,e=>dc(Qg(J(e,0,`ToJsonObject`)))),`public static tlc2.value.impl.StringValue tlc2.module.Json.toJsonObject(tlc2.value.IValue) throws java.io.IOException`),mp(rp(`JsonSerialize`,2,t=>{let n=e_(J(t,0,`JsonSerialize`)),r=J(t,1,`JsonSerialize`);if(!du(r)&&!Vg(r))throw Xf(`second`,`JsonSerialize`,`sequence or record`,r);return i_(e,n),e.writeFile?.(n,Yg(r)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.serialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),mp(rp(`ndJsonSerialize`,2,t=>{let n=e_(J(t,0,`ndJsonSerialize`)),r=J(t,1,`ndJsonSerialize`),i=du(r);if(!i)throw Xf(`second`,`ndJsonSerialize`,`sequence`,r);return i_(e,n),e.writeFile?.(n,Zg(i)),!0}),`public static synchronized tlc2.value.impl.BoolValue tlc2.module.Json.ndSerialize(tlc2.value.impl.StringValue,tlc2.value.impl.Value) throws java.io.IOException`),mp(rp(`JsonDeserialize`,1,t=>$g(Lg(a_(e,e_(J(t,0,`JsonDeserialize`)))))),`public static tlc2.value.IValue tlc2.module.Json.deserialize(tlc2.value.impl.StringValue) throws java.io.IOException`),mp(rp(`ndJsonDeserialize`,1,t=>Pl(a_(e,e_(J(t,0,`ndJsonDeserialize`))).split(/\r\n|\r|\n/).map(e=>e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``)).filter(e=>e!==``).map(e=>$g(Lg(e))))),`public static tlc2.value.IValue tlc2.module.Json.ndDeserialize(tlc2.value.impl.StringValue) throws java.io.IOException`)],s_=(e,t)=>[mp(bp(`Serialize`,3,(n,r)=>{let i=xp(n,2,`Serialize`)(),a=Vg(i);if(!a)throw Xf(`third`,`ndJsonSerialize`,`sequence`,i);if(t_(a,`format`)!==`NDJSON`)return t(`Serialize`,n,r);let o=xp(n,0,`Serialize`)(),s=du(o);if(!s)throw Xf(`first`,`Serialize`,`sequence`,o);let c=xp(n,1,`Serialize`)();if(typeof c!=`string`)throw Xf(`second`,`ndJsonSerialize`,`sequence`,c);let l=Fu(a,`openOptions`);if(dp(l)!==`TupleValue`)throw Hg(l,`TupleValue`);let u=t_(a,`charset`),d=K(l).range.map(e=>{if(typeof e!=`string`)throw Hg(e,`StringValue`);return e});return n_(u),r_(e,c,d,Zg(s)),!0}),`public static synchronized tlc2.value.impl.Value tlc2.module.Json.textSerialize(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`)],c_={boolean:0,integer:1,string:3,record:4,set:5,tuple:7,function:9,modelValue:21,interval:23,handle:26},l_=e=>{let t=[],n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=0,a=Tc(),o=e=>t.push(e&255),s=e=>{o(e>>8),o(e)},c=e=>{s(e>>16),s(e)},l=e=>e>32767?c(-e):s(e),u=e=>{o(c_.string),c(0),c(-1),c(e.length),e.split(``).forEach(e=>o(e.charCodeAt(0)))},d=e=>{o(c_.handle),l(e)},f=e=>{if(typeof e==`boolean`){o(c_.boolean),o(+!!e);return}if(typeof e==`number`){o(c_.integer),c(e);return}if(typeof e==`string`){i++,u(e);return}if(e.kind===`ModelValue`){o(c_.modelValue),s(a.indexOf(e));return}if(e.kind===`Interval`){o(c_.interval),c(e.low),c(e.high);return}let t=n.get(e);if(t!==void 0){d(t);return}if(n.set(e,i++),Ms(e)){let t=G(e).elements;o(c_.set),c(t.length),t.forEach(f);return}let p=K(e),m=jc(e);m===`tuple`?(o(c_.tuple),l(p.range.length),p.range.forEach(f)):m===`record`?(o(c_.record),c(p.domain.length),p.domain.forEach((e,t)=>{let n=String(e),a=r.get(n);a===void 0?(r.set(n,i++),u(n)):d(a),f(p.range[t])})):(o(c_.function),l(p.domain.length),o(1),p.domain.forEach((e,t)=>{f(e),f(p.range[t])}))};return f(e),ie(Uint8Array.from(t))},u_=e=>[mp(rp(`_TLCTraceSerialize`,2,t=>{let n=e_(J(t,1,`_TLCTraceSerialize`));return e.writeFile?.(n,l_(J(t,0,`_TLCTraceSerialize`))),!0}),`public static final tlc2.value.IValue tlc2.module._TLCTrace.ioSerialize(tlc2.value.IValue,tlc2.value.impl.StringValue) throws java.io.IOException`)],d_=25214903917n,f_=(1n<<48n)-1n,p_=e=>{let t=(BigInt.asUintN(64,e)^d_)&f_,n=e=>(t=t*d_+11n&f_,Number(BigInt.asIntN(32,t>>BigInt(48-e))));return{setSeed:e=>{t=(BigInt.asUintN(64,e)^d_)&f_},nextInt:e=>{let t=n(31),r=e-1;if((e&r)===0)return Number(BigInt(e)*BigInt(t)>>31n);for(let i=t;;i=n(31)){let t=i%e;if(i-t+r<=2147483647)return t}},nextLong:()=>BigInt.asIntN(64,(BigInt(n(32))<<32n)+BigInt(n(32))),nextDouble:()=>(n(26)*2**27+n(27))*2**-53}},m_=[],h_=e=>{for(let t=2;t*t<=e;t++)if(e%t===0)return!1;return!0},g_=()=>{for(let e=1277011;m_.length<1341;e++)h_(e)&&m_.push(e);return m_},__=e=>{let t=g_(),n=t.length;for(;n===t.length;)n=Math.floor(e.nextDouble()*t.length);return t[n]},v_=e=>{let t=[],n=e;for(let e=2;e*e<=n;e++)for(;n%e===0;)t.push(e),n/=e;return n>1&&t.push(n),t},y_=e=>{for(let t=Math.max(e,9);;t++){let e=v_(t),n=new Set(e);if(t%4!=0&&n.size!==e.length)return{modulus:BigInt(t),multiplier:BigInt([...n].reduce((e,t)=>e*t,1)+1)}}},b_=(e,t,n)=>{if(t<=0)return[];let r=y_(t),i=BigInt(n.nextInt(t)),a=BigInt(__(n));return Array.from({length:e},()=>{do i=(r.multiplier*i+a)%r.modulus;while(i>=t);return i})},x_=(e,t,n)=>{if(t<=0)return[];let r=BigInt(t<191?191:Cs),i=BigInt(n.nextInt(t));return Array.from({length:Math.min(e,t)},(e,n)=>(r*BigInt(n)+i)%BigInt(t))},S_=(1n<<63n)-1n-24n,C_=(e,t,n)=>{let r=n.nextLong(),i=BigInt.asIntN(64,r<0n?-r:r);return Array.from({length:e},(e,n)=>{let r=(S_*BigInt(n)+i)%t;return r<0n?r+t:r})},w_=(e,t)=>e.reduceRight((e,t)=>({remaining:e.remaining/BigInt(t.length),elements:[t[Number(e.remaining%BigInt(t.length))],...e.elements]}),{remaining:t,elements:[]}).elements,T_=e=>{if(typeof e==`object`){if(e.kind===`FunctionSet`){let t=Ml(e.domain),n=G(e.range).elements;return{lists:t.map(()=>n),create:e=>Oc(t,e)}}if(e.kind===`RecordSet`)return{lists:e.sets.map(e=>G(e).elements),create:t=>Fl(e.names.map((e,n)=>[e,t[n]]))};if(e.kind===`ProductSet`)return{lists:e.factors.map(e=>G(e).elements),create:Pl}}},E_=(e,t)=>t===`1.7.4`&&typeof e==`object`&&e.kind===`ProductSet`?e.factors:void 0,D_=(e,t,n,r)=>{if(ru(t))return[];let i=r===`1.7.4`?x_:b_;if(typeof t==`object`&&t.kind===`Interval`)return i(e,Math.max(0,t.high-t.low+1),n).map(e=>t.low+Number(e));let a=E_(t,r)?void 0:T_(t);if(a){let t=a.lists.reduce((e,t)=>e*BigInt(t.length),1n);return(t>BigInt(2147483647)?C_(e,t,n):i(e,Number(t),n)).map(e=>a.create(w_(a.lists,e)))}let o=G(t).elements;return i(e,o.length,n).map(e=>o[Number(e)])},O_=(e,t)=>{if(typeof e==`object`&&e.kind===`FunctionSet`){let n=[...Zf(e.domain,`RandomElement`,e).elements];return Oc(n,n.map(()=>O_(e.range,t)))}if(typeof e==`object`&&e.kind===`RecordSet`)return Fl(e.names.map((n,r)=>[n,O_(e.sets[r],t)]));if(typeof e==`object`&&e.kind===`ProductSet`)return Pl(e.factors.map(e=>O_(e,t)));if(typeof e==`object`&&e.kind===`Interval`){let n=Math.max(0,e.high-e.low+1),r=Math.floor(t.nextDouble()*n);if(r>=n)throw new w(`Attempted to retrieve out-of-bounds element from the interval value ${U(q(e))}.`);return e.low+r}let n=Zf(e,`RandomElement`).elements,r=Math.floor(t.nextDouble()*n.length);if(r>=n.length)throw new w(`Index ${r} out of bounds for length ${n.length}`);return n[r]},k_=(e,t,n)=>{if(typeof e!=`number`||e<0)throw Xf(t,n,`nonnegative integer`,e);return e},A_=(e,t,n,r)=>_l(Array.from({length:t},()=>_l(e.filter(()=>r.nextDouble()<n)))),j_=(e,t)=>{let n=`RandomSetOfSubsets`,r=k_(J(e,0,n),`first`,n),i=k_(J(e,1,n),`second`,n),a=J(e,2,n);if(!Ms(a)||!W(a))throw Xf(`third`,n,`finite set`,a);let o=G(a).elements;if(o.length<31&&r>2**o.length)throw Xf(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${o.length}`,r);if(o.length<i)throw Xf(`second`,n,`nonnegative integer in range 0..Cardinality(S)`,i);return A_(o,r,o.length===0?0:i/o.length,t.getRandom())},M_=/^[+-]?(?:NaN|Infinity|(?:\d+\.?\d*|\.\d+)(?:[eE][+-]?\d+)?[fFdD]?)$/,N_=/^([+-]?)0[xX]([0-9a-fA-F]*)(?:\.([0-9a-fA-F]*))?[pP]([+-]?\d+)[fFdD]?$/,P_=e=>{let t=e.replace(/^[^!-\uffff]+|[^!-\uffff]+$/g,``);if(M_.test(t))return Number(t.replace(/[fFdD]$/,``));let n=N_.exec(t);if(!n)return;let r=n[3]??``,i=`${n[2]}${r}`;if(i===``)return;let a=Number.parseInt(i,16)*2**(Number(n[4])-4*r.length);return n[1]===`-`?-a:a},F_=e=>Y(`RandomSubsetSet`,3,t=>{let n=`RandomSubsetSetProbability`,r=k_(J(t,0,n),`first`,n),i=J(t,1,n);if(typeof i!=`string`)throw Xf(`second`,n,`string literal representing a probability`,i);let a=P_(i);if(a===void 0||a<0||a>1)throw Xf(`second`,n,`string literal does not represent a parsable probability`,i);let o=J(t,2,n);if(!Ms(o)||mc(o)||!cu(o))throw Xf(`third`,n,`finite set`,o);let s=ou(o);if(32-Math.clz32(r)>s&&r>1<<s)throw Xf(`first`,n,`nonnegative integer that is smaller than the subset's size of 2^${s}`,r);return A_(G(o).elements,r,a,e.getRandom())}),I_=e=>[mp(Y(`RandomSubset`,2,t=>{let n=k_(J(t,0,`RandomSubset`),`first`,`RandomSubset`),r=J(t,1,`RandomSubset`);if(!Ll(r)||!cu(r))throw Xf(`second`,`RandomSubset`,`a finite set`,r);let i=E_(r,e.version);if(i&&i.reduce((e,t)=>e*G(t).elements.length,1)>Ds())throw new w(Os());return _l(D_(n,r,e.getRandom(),e.version))}),`public static tlc2.value.impl.Value tlc2.module.Randomization.RandomSubset(tlc2.value.impl.Value,tlc2.value.impl.Value)`),Y(`RandomSetOfSubsets`,3,t=>j_(t,e)),Y(`TestRandomSetOfSubsets`,3,t=>Pl(Array.from({length:5},()=>G(j_(t,e)).elements.length)))],L_=(e,t=0n)=>{let n=p_(t),r=p_(t),i,a=!1,o={getLevel:()=>0,getBehavior:()=>[],getSpecification:()=>Fl([]),counterExample:void 0,deferred:void 0,isSeen:()=>!1,markExplored:void 0,getSuccessorAction:()=>void 0,toRecord:()=>({}),setLivenessSource:()=>{},getCurrentState:()=>void 0,getFingerprint:Kd,getSimulationValue:void 0,getRandom:()=>{let e=a?void 0:o.getCurrentState();return e===void 0?n:(e!==i&&(r.setSeed(o.getFingerprint(e)^BigInt.asUintN(64,t)),i=e),r)},reseedRandom:()=>{i=void 0},runWithNewRandom:e=>{let n=r,a=i;r=p_(t),i=void 0;try{return e()}finally{r=n,i=a}},evaluateAtStartup:e=>{let t=a;a=!0;try{return e()}finally{a=t}},pause:void 0,readLine:void 0,warn:()=>{},isWarningEnabled:!0,isTool:!1,version:`master`,seed:t,generatedStates:0,distinctStates:0,initialStates:0,queueSize:0,diameter:1,registers:/* @__PURE__ */ new Map,namedRegisters:/* @__PURE__ */ new Map,properties:/* @__PURE__ */ new Map,possibleCounts:/* @__PURE__ */ new Map,isStopped:!1,isStarted:!1,checkDeadlock:e,startedAt:Date.now()};return o},R_=e=>Cl([...e.possibleCounts].map(e=>[e[0],e[1]])),z_=e=>e.possibleCounts.size===0?e.namedRegisters:new Map([...e.namedRegisters,[`s:_possible`,R_(e)]]),B_=e=>Fl([[`name`,e??`UnnamedAction`],[`location`,Fl([[`beginLine`,0],[`beginColumn`,0],[`endLine`,0],[`endColumn`,0],[`module`,`--TLA+ BUILTINS--`]])]]),V_=/* @__PURE__ */ new WeakSet,H_=e=>Ac(wl(e),`record`),U_=(e,t,n=!0)=>{[`state`,`action`,`console`].forEach(dc);let r=[[`action`,_l(e)],[`state`,_l(t)]],i=H_(n?r:[...r,[`console`,!1]]);return V_.add(i),i},W_=(e,t,n,r=!0)=>{let i=e.map((e,t)=>Pl([t+1,Fl(Object.entries(e))])),a=i.slice(1).map((e,n)=>Pl([i[n],t[n],e])),o=n?[Pl([i[i.length-1],n.action,i[n.start]])]:[];return U_([...a,...o],i,r)},G_=(e,t)=>{if(typeof t==`number`)return e.registers.get(t);if(typeof t==`string`&&t.startsWith(`s:`))return z_(e).get(t)},K_=(e,n,r,i)=>{if(typeof r==`number`&&r>=0)e.registers.set(r,i);else if(r===`exit`)i===!0&&(e.isStopped=!0);else if(r===`pause`){if(i!==!0||!e.pause)return;n(`Press enter to resume model checking.`),e.pause()}else if(typeof r==`string`&&r.startsWith(`s:`))e.namedRegisters.set(r,i);else if(typeof r==`string`&&r.startsWith(`-D`))e.properties.set(r.slice(2),q(i));else throw new t(`The first argument of TLCSet should be a nonnegative integer, but instead it is:\n${U(q(r))}`)},q_=e=>e.kind===`Number`?e.text??String(e.value):e.kind===`Decimal`?e.text:Q(e),J_=e=>e.every(e=>e!==void 0),Y_=(e,t,n)=>{if(e.kind===`Prime`||e.kind===`Unchanged`)return 2;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r!==void 0&&!M(e);if(i&&t.variableIndex.has(r))return 1;let a=gt(e).map(e=>Y_(e,t,n)),o=i?gx(r,t):void 0;return o&&!n.has(o)&&(n.add(o),a.push(Y_(o.body,t,n))),Math.max(0,...a)},X_=(e,n)=>{let r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new WeakMap,a=e=>{let t=i.get(e)??/* @__PURE__ */ new Map;return i.set(e,t),t};return[bp(`AssertError`,2,e=>{let t=ep(e,0,`AssertError`).expression;if(t&&t.kind!==`String`)throw new w(`In computing AssertError, a non-string expression (${q_(t)}) was used as the err of an AssertError(err, exp).`);let r=xp(e,0,`AssertError`)();try{xp(e,1,`AssertError`)()}catch(e){if(e instanceof w)return os(e.message,n.isTool)===r;throw e}return!1}),rp(`TLCGetOrDefault`,2,e=>G_(n,J(e,0,`TLCGetOrDefault`))??J(e,1,`TLCGetOrDefault`)),rp(`Trace`,0,(e,t)=>{let r=t?.environment.variables??[],i=t?.state??r.map(()=>void 0);if(!t||!J_(i)){let e=r.filter((e,t)=>i[t]===void 0);throw new w(`In evaluating TLCExt!Trace, the state is not completely specified yet (variable${e.length>1?`s`:``} ${e.join(`, `)} undefined).`)}return t.state?Pl(n.getBehavior(i).map(e=>{let r=t.environment.variables.map((t,n)=>[t,e[n]]),i=n.getSimulationValue?.(`action`,e);return Fl(i===void 0?r:[[`_action`,i],...r])})):Pl([Fl([])])}),rp(`CounterExample`,0,()=>n.counterExample??U_([],[])),Y(`ToTrace`,1,e=>{let n=J(e,0,`ToTrace`);if(typeof n!=`object`||!V_.has(n))throw new t(`The argument of ToTrace should be a CounterExample, but instead it is:\n${U(q(n))}`);let r=G(Fu(n,`state`)).elements.map(e=>du(e)??[]);return Pl(r.sort((e,t)=>Number(e[0])-Number(t[0])).map(e=>e[1]))}),Y(`TLCModelValue`,1,e=>{let n=J(e,0,`TLCModelValue`);if(typeof n!=`string`)throw new t(`The argument of ModelValue should be a string, but instead it is:\n${U(q(n))}`);return wc(n)}),bp(`TLCDefer`,1,(e,t)=>{let r=ep(e,0,`TLCDefer`).expression;return t&&r&&(n.deferred=e=>{$(r,{...t,next:e})}),!0}),Y(`TLCNoOp`,1,e=>J(e,0,`TLCNoOp`)),{...bp(`PickSuccessor`,1,(t,r)=>{let i=r?.next??(r?.environment.variables??[]).map(()=>void 0);if(n.getSimulationValue===void 0&&(!J_(i)||r?.next&&n.isSeen(i)))return!0;let a=ep(t,0,`PickSuccessor`),o=a.call([]);if(typeof o!=`boolean`)throw new w(`In evaluating TLCExt!PickSuccessor, a non-boolean expression (${fp(o)}) was used as the condition of an IF.\n${a.expression?q_(a.expression):``}`);if(o||!r?.next||!J_(i)||!r.state||!J_(r.state))return!0;let s=r.state,c=n.getSuccessorAction(s,i),l=t=>e(Yo(n.isTool,Ko.moduleOverrideStdout,qo.none,t));for(;;){l(`Extend behavior of length ${n.getLevel(s)} with a "${c?.name}" step [<Action ${c?.location.range&&m(c.location.range)}>]? (Yes/no/explored/states/diff):`);let e=n.readLine?.();if(e===void 0)throw new re;if(/^[\0-\x20]*$/.test(e)||e.toLowerCase().startsWith(`y`))return!0;if(e[0]===`s`)l(`${_d(n.toRecord(s)).trimEnd()}\n~>\n${_d(n.toRecord(i)).trimEnd()}`);else if(e[0]===`d`)l(_d(n.toRecord(i),n.toRecord(s)));else if(e[0]===`e`){if(n.markExplored)return n.markExplored(i),!0;if(n.getSimulationValue===void 0)throw new p(`tla-ts can't mark a state explored while it searches depth first.`);l(`Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?`)}else if(e[0]===`n`)return!1}}),isActionLevel:!0},bp(`TLCCache`,2,(e,t)=>{let i=ep(e,0,`TLCCache`),o=nd(xp(e,1,`TLCCache`)()),s=i.expression;if(!s||!t)return i.call([]);let c=Y_(s,t.environment,/* @__PURE__ */ new Set);if(c===2)return i.call([]);let l=c===1;if(l&&t.state&&n.getSimulationValue===void 0)return i.call([]),i.call([]);let u=l&&t.state?a(t.state):r,d=u.get(s)??/* @__PURE__ */ new Map;u.set(s,d);let f=d.get(o);if(f!==void 0)return f;let p=i.call([]);return d.set(o,p),p}),Y(`TLCFP`,1,e=>{let t=J(e,0,`TLCFP`),n=qu(t);if(n)throw n;return Number(BigInt.asIntN(32,Kd([t])))}),bp(`TLCEvalDefinition`,1,(e,n)=>{let r=xp(e,0,`TLCEvalDefinition`)();if(typeof r!=`string`)throw new t(`The argument of TLCEvalDefinition should be a string, but instead it is:\n${U(q(r))}`);let i=n?gx(r,n.environment):void 0,a=i?void 0:n?.environment.builtins.get(r);if(a?.arity===0)return a.evaluate([],n);if(!i||!n)throw new t(`The argument of TLCEvalDefinition should be a name of a definition reachable from the root module, but instead it is:\n${U(q(r))}`);if(i.kind===`Operator`&&i.params.length>0){let e=i.params.map(e=>e.arity===0?e.name:`${e.name}(${Array.from({length:e.arity},()=>`_`).join(`,`)})`);throw new t(`The argument of TLCEvalDefinition should be a a zero-arity definition, but instead it is:\n${r}(${e.join(`, `)})`)}return i.kind===`Operator`?$(i.body,n):$({kind:`Identifier`,name:r,location:i.location},n)})]},Z_=(e,t)=>[rp(`_Track`,2,e=>{let n=String(J(e,1,`_Track`)),r=t.possibleCounts.get(n)??0;return t.possibleCounts.set(n,J(e,0,`_Track`)===!0?r+1:r),!0}),rp(`_Counts`,0,()=>R_(t)),rp(`_CheckName`,1,n=>{let r=String(J(n,0,`_CheckName`));return t.possibleCounts.get(r)?!0:(e(q(R_(t),!0)),!1)}),rp(`_PrintCounts`,0,()=>(e(q(R_(t),!0)),!0))],Q_=e=>`${e.getUTCFullYear()}.${ss(e.getUTCMonth()+1)}.${ss(e.getUTCDate())}.${ss(e.getUTCHours())}${ss(e.getUTCMinutes())}${ss(e.getUTCSeconds())}`,$_=e=>Cl([...e].map(e=>[e[0],Pl([e[1]])])),ev=/* @__PURE__ */ new Set([`diameter`,`generated`,`distinct`,`queue`,`stats`,`config`]),tv=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`duration`,`level`]),nv=/* @__PURE__ */ new Set([`diameter`,`distinct`,`queue`,`level`]),rv=(e,n,r)=>{if(e.version===`1.7.4`?!tv.has(n)||!e.isStarted&&nv.has(n):!e.isStarted&&ev.has(n))throw new t(`TLCGet(${n}) was undefined.`);let i=e.getSimulationValue?.(n,r);if(i!==void 0)return i;let a=Math.floor((Date.now()-e.startedAt)/1e3);switch(n){case`level`:return r===void 0?0:e.getLevel(r);case`diameter`:return e.diameter;case`generated`:return e.generatedStates;case`distinct`:return e.distinctStates;case`queue`:return e.queueSize;case`duration`:return a;case`stats`:return H_([[`queue`,e.queueSize],[`distinct`,e.distinctStates],[`initial`,e.initialStates],[`generated`,e.generatedStates],[`diameter`,e.diameter],[`duration`,a],[`worker`,0]]);case`config`:return H_([[`mode`,`bfs`],[`deadlock`,e.checkDeadlock],[`worker`,1],[`seed`,String(e.seed)],[`fingerprint`,String(BigInt.asIntN(64,bd()))],[`install`,`unknown`]]);case`revision`:{let t=/* @__PURE__ */ new Date;return H_([[`count`,0],[`timestamp`,Math.floor(t.getTime()/1e3)],[`date`,dc(`${t.toISOString().slice(0,19)}.${t.getUTCMilliseconds()}Z`)],[`tag`,`development`],[`calver`,dc(Q_(new Date(e.startedAt)))]])}case`spec`:return e.getSpecification();case`action`:return B_(void 0);case`all`:return $_(e.registers);case`all:named`:return $_(z_(e))}if(n.startsWith(`s:`)){let r=z_(e).get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(n.startsWith(`-D`))return dc(e.properties.get(n.slice(2))??n);throw new t(`TLCGet(${n}) was undefined.`)},iv=(e,n,r)=>{if(typeof n==`number`&&n>=0){let r=e.registers.get(n);if(r===void 0)throw new t(`TLCGet(${n}) was undefined.`);return r}if(typeof n!=`string`)throw new t(`The argument of TLCGet should be a nonnegative integer, but instead it is:\n${U(q(n))}`);return rv(e,n,r?.state)},av=e=>e.length===0?[[]]:e.flatMap((t,n)=>av([...e.slice(0,n),...e.slice(n+1)]).map(e=>[t,...e])),ov=e=>{typeof e==`object`&&((e.kind===`Set`||e.kind===`MixedSet`)&&G(e).elements.forEach(ov),e.kind===`Function`&&e.range.forEach(ov))},sv=e=>{if(typeof e!=`object`)return e;switch(e.kind){case`Function`:return e.functionClass===void 0?e:Oc(e.domain,e.range);case`ModelValue`:case`MixedSet`:case`InfiniteSet`:case`SequenceSet`:return e;case`LazyFunction`:return K(e);default:return G(e)}},cv=(e,n)=>[Y(`Print`,2,t=>(e(pd([J(t,0,`Print`),J(t,1,`Print`)]).map(U).join(` `)),J(t,1,`Print`))),Y(`PrintT`,1,t=>(e(U(pd([J(t,0,`PrintT`)])[0])),!0)),Y(`Assert`,2,e=>{if(J(e,0,`Assert`)!==!0)throw new t(`The first argument of Assert evaluated to FALSE; the second argument was:\n${U(q(J(e,1,`Assert`)))}`,b.assertViolation);return!0}),Y(`JavaTime`,0,()=>Math.floor(Date.now()/1e3)&2147483647),Y(`:>`,2,e=>Cl([[J(e,0,`:>`),J(e,1,`:>`)]])),Y(`@@`,2,e=>{let t=J(e,0,`@@`),n=J(e,1,`@@`),r=Ps(t)?K(t):void 0,i=Ps(n)?K(n):void 0;if(!r)throw Xf(`first`,`@@`,`function`,t);if(!i)throw Xf(`second`,`@@`,`function`,n);let a=Hs(r),o=Hs(i).filter(e=>!a.some(t=>ml(e[0],t[0])));return wl([...a,...o])}),Y(`ToString`,1,e=>dc(q(J(e,0,`ToString`),!0))),{...bp(`TLCEval`,1,(e,t)=>{let n=sv(xp(e,0,`TLCEval`)());return t===void 0&&ov(n),n}),isStateLevel:!1},Y(`Permutations`,1,e=>{let t=Zf(J(e,0,`Permutations`),`Permutations`).elements;return _l(av(t).map(e=>Cl(t.map((t,n)=>[t,e[n]]))))}),np(`SortSeq`,2,e=>{let t=J(e,0,`SortSeq`),n=du(t);if(!n)throw Xf(`first`,`SortSeq`,`natural number`,t);let r=ep(e,1,`SortSeq`),i=(e,t)=>{let n=r.call([e,t]);if(typeof n==`boolean`)return n;throw Xf(`second`,`SortSeq`,`boolean function`,n)},a=n.slice(0,1);return n.slice(1).forEach(e=>{let t=a.length;for(;t>0&&i(e,a[t-1]);)t--;a.splice(t,0,e)}),Pl(a)}),n.version===`1.7.4`?mp({...rp(`TLCGet`,1,(e,t)=>iv(n,J(e,0,`TLCGet`),t)),isLevelConstant:!0},`public static tlc2.value.impl.Value tlc2.module.TLC.TLCGet(tlc2.value.impl.Value)`):mp(bp(`TLCGet`,1,(e,t)=>iv(n,xp(e,0,`TLCGet`)(),t)),`public static tlc2.value.impl.Value tlc2.module.TLCGetSet.TLCGetEval(tlc2.tool.impl.Tool,tla2sany.semantic.ExprOrOpArgNode[],tlc2.util.Context,tlc2.tool.TLCState,tlc2.tool.TLCState,int,tlc2.tool.coverage.CostModel)`),rp(`TLCSet`,2,t=>(K_(n,e,J(t,0,`TLCSet`),J(t,1,`TLCSet`)),!0)),tp(`Any`,vc),Y(`RandomElement`,1,e=>O_(J(e,0,`RandomElement`),n.getRandom()))],lv=`----------------------------- MODULE Bags --------------------------------
|
|
404
414
|
(**************************************************************************)
|
|
405
415
|
(* A bag, also called a multiset, is a set that can contain multiple *)
|
|
406
416
|
(* copies of the same element. A bag can have infinitely many elements, *)
|
|
@@ -553,7 +563,7 @@ CopiesIn(e, B) ==
|
|
|
553
563
|
7 Dec 98 : Corrected error found by Stephan Merz.
|
|
554
564
|
6 Dec 98 : Modified comments based on suggestions by Lyle Ramshaw.
|
|
555
565
|
5 Dec 98 : Initial version.
|
|
556
|
-
`,
|
|
566
|
+
`,uv=/* @__PURE__ */ new Map([[`Bags`,lv],[`FiniteSets`,`---------------------------- MODULE FiniteSets -----------------------------
|
|
557
567
|
(***************************************************************************)
|
|
558
568
|
(* The two definitions in this standard module are overridden by TLC in *)
|
|
559
569
|
(* the Java class tlc2.module.FiniteSets. Each operator is overridden by *)
|
|
@@ -1685,7 +1695,7 @@ _TLCTrace ==
|
|
|
1685
1695
|
/\\ PrintT("CounterExample written: " \\o _TLCTraceFile)
|
|
1686
1696
|
|
|
1687
1697
|
=============================================================================
|
|
1688
|
-
`]]),
|
|
1698
|
+
`]]),dv=new Map([...[...uv].filter(e=>[`FiniteSets`,`Integers`,`Naturals`,`RealTime`,`Reals`,`Sequences`,`TLC`].includes(e[0])),[`Bags`,lv.replace(`
|
|
1689
1699
|
LOCAL INSTANCE Naturals
|
|
1690
1700
|
`,`
|
|
1691
1701
|
EXTENDS TLC
|
|
@@ -1777,14 +1787,12 @@ _TEPosition ==
|
|
|
1777
1787
|
ELSE TLCGet("level") + 1
|
|
1778
1788
|
|
|
1779
1789
|
=============================================================================
|
|
1780
|
-
`]]),ip=(e=`master`)=>e===`1.7.4`?rp:np,ap=(e,t)=>e.every(e=>qi(e,t)),op=Yr([!1,!0]);Wr(op);const sp=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return ei(sp(e,t,r),sp(e,r,n))},cp=[`\\cup`,`\\cap`,`\\`],lp=e=>typeof e==`object`&&e.kind===`MixedSet`,up=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,dp=(e,t,n)=>{t.kind===`Interval`&&Li(t);let r=t.kind===`Interval`?t:Ur(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return sn(r,e=>{qi(e,n)===i&&an(a,e)}),up(t)?er(a):Xr(a)}if(F(t))return n;if(!cn(n))return cr({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return sn(r,e=>an(i,e)),sn(n.kind===`Interval`?n:P(n).elements,e=>{qi(e,t)||an(i,e)}),Xr(i)},fp=(e,t)=>{let n=(t,n)=>rs([Es(t,n,e)()],0,e);return{...z(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},pp=[as(`TRUE`,!0),as(`FALSE`,!1),as(`BOOLEAN`,op),as(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),cs(`=`,Kr),cs(`#`,(e,t)=>!Kr(e,t)),z(`~`,1,e=>!rs(e,0,`~`)),z(`<=>`,2,e=>rs(e,0,`<=>`)===rs(e,1,`<=>`)),fp(`/\\`,(e,t)=>e&&t()),fp(`\\/`,(e,t)=>e||t()),fp(`=>`,(e,t)=>!e||t()),z(`\\in`,2,e=>qi(R(e,0,`\\in`),R(e,1,`\\in`))),z(`\\notin`,2,e=>!qi(R(e,0,`\\notin`),R(e,1,`\\notin`))),cs(`\\subseteq`,(e,t)=>{if(!M(e))throw new v(`\\subseteq expects a set but received ${L(e)}`);if(typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&N(e.base))return ap(P(e.base).elements,t.base);if(typeof e==`object`&&e.kind===`Interval`){if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;for(let n=e.low;n<=e.high;n++)if(!qi(n,t))return!1;return!0}return!ki(e,e=>!qi(e,t))}),...cp.map(e=>z(e,2,t=>{let n=R(t,0,e),r=R(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(cn(n)&&cn(r)&&!lp(n)&&!lp(r)&&!i&&!on(n)&&!on(r)){if(e===`\\cup`&&F(n))return r;let t=e===`\\cup`?ei:e===`\\cap`?$r:Qr;return Gi((n,r)=>{let i=P(n),a=P(r),o=t(i,a);if(e===`\\cup`){let e=Ur(i),t=Qr(a,i).elements,n=e===i.elements&&(t.length===0||Jn(e[e.length-1],t[0])<0);if(e.length+t.length>nn())throw new s(rn());if(n&&!i.isNormalized)return o;let r=o===i?$n(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=up(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>qi(e,o)))),o},(t,n)=>dp(e,t,n),n,r)}return cn(n)?dp(e,n,r):e!==`\\`&&cn(r)?dp(e,r,n):cr({kind:`SetOperation`,operator:e,left:n,right:r})})),z(`SUBSET`,1,e=>({kind:`Subset`,base:R(e,0,`SUBSET`)})),z(`UNION`,1,e=>{let t=R(e,0,`UNION`),n=dn(t)?Ur(t):[],r=n.filter(dn);if(!dn(t)||r.length!==n.length)return cr({kind:`Union`,base:t});let i=r.flatMap(Ur),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{qi(t,e)||an(e.elements,t)}),Xr(e.elements)};return lp(t)||r.some(lp)?a():r.length===0?Zr:Gi(e=>Vi(sp(e,0,e.length),i),a,r.map(P),void 0)}),z(`DOMAIN`,1,e=>{let t=R(e,0,`DOMAIN`);if(!ln(t))throw new v(`DOMAIN expects a function but received ${L(t)}`);return fa(t)})],mp=xs(`Integers`,`Neg`,`IntValue`,1),hp=e=>{let t=xs(e,`DotDot`,`IntervalValue`,2);return[Ss(e,`+`,`Plus`,(e,t)=>e+t),Ss(e,`-`,`Minus`,(e,t)=>e-t),Ss(e,`*`,`Times`,(e,t)=>e*t),Ss(e,`^`,`Expt`,(e,t)=>{if(t<0)throw new c(`The second argument of ^ should be a natural number, but instead it is:\n${t}`);if(e===0&&t===0)throw new c(`0^0 is undefined.`);return e**t}),Ss(e,`\\div`,`Divide`,(e,t)=>{if(t===0)throw new c(`The second argument of \\div is 0.`);let n=Math.floor(e/t);if(ls(n))throw us(`${e} \\div ${t}`);return n}),Ss(e,`%`,`Mod`,(e,t)=>{if(t<=0)throw new c(`The second argument of % should be a positive number, but instead it is:\n${t}`);return(e%t+t)%t}),z(`..`,2,e=>{let n=R(e,0,`..`),r=bs(R(e,1,`..`),t);return{kind:`Interval`,low:bs(n,t),high:r}})]},gp=hp(`Naturals`),_p=hp(`Integers`),vp=e=>{let t=gp.indexOf(e);return t===-1?void 0:_p[t]},yp=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[ys(ws(`<`,(e,t)=>e<t),t(`LT`)),ys(ws(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),ys(ws(`<=`,(e,t)=>e<=t),t(`LE`)),ys(ws(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},bp=[as(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...gp,...yp(`Naturals`)],xp=[as(`Int`,{kind:`InfiniteSet`,name:`Int`}),..._p,...yp(`Integers`),z(`-.`,1,e=>{let t=bs(R(e,0,`-`),mp);if(ls(-t))throw us(`-${t}`);return-t})],Sp=(e,t,n)=>{let r=R(e,t,n),i=Hi(r);if(!i)throw new c(`${n}\n${L(r)}`);return i},Cp=(e,t,n)=>{let r=R(e,t,n);return typeof r==`string`?r:Sp(e,t,n)},wp=(e,t,n)=>{let r=R(e,t,`SubSeq`);if(typeof r!=`number`)throw es(n,`SubSeq`,`natural number`,r);return r},Tp=(e,t,n)=>typeof e==`string`?Rn(e.slice(t,n)):fi(e.slice(t,n)),Ep=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Dp=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Op=(e,t)=>{let n=ep.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?ys(e,t):e}):t},kp=e=>Op(`Sequences`,[z(`Seq`,1,e=>({kind:`SequenceSet`,base:R(e,0,`Seq`)})),z(`Len`,1,e=>Cp(e,0,Ep(``,`Len`)).length),z(`\\o`,2,e=>{let t=Cp(e,0,Dp(`s \\o t`,`sequence`));if(typeof t!=`string`){let n=Sp(e,1,Dp(`t \\o s`,`sequence`));return fi([...t,...n])}let n=R(e,1,`\\o`);if(typeof n!=`string`)throw new c(`${Dp(`t \\o s`,`string`)}\n${L(n)}`);return Rn(t+n)}),z(`Append`,2,t=>fi([...Sp(t,0,Dp(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),R(t,1,`Append`)])),z(`Head`,1,e=>{let t=Sp(e,0,Ep(``,`Head`));if(t.length===0)throw new c(`Attempted to apply Head to the empty sequence.`);return t[0]}),z(`Tail`,1,e=>{let t=Cp(e,0,Ep(``,`Tail`));if(t.length===0)throw new c(`Attempted to apply Tail to the empty sequence.`);return Tp(t,1)}),z(`SubSeq`,3,e=>{let t=Cp(e,0,Ep(`first `,`SubSeq`)),n=wp(e,1,`second`),r=wp(e,2,`third`);if(n>r)return Tp(t,0,0);let i=n<1||n>t.length?{position:`second`,value:n}:r>t.length?{position:`third`,value:r}:void 0;if(i)throw new c(`The ${i.position} argument of SubSeq must be in the domain of its first argument:\n${L(R(e,0,`SubSeq`))}\n, but instead it is\n${i.value}`);return Tp(t,n-1,r)}),os(`SelectSeq`,2,e=>{let t=is(e,1,`SelectSeq`);return fi(Sp(e,0,Ep(`first `,`SelectSeq`)).filter(e=>{let n=t.call([e]);if(typeof n!=`boolean`)throw new c(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${t.name}>`);return n}))})]),Ap=e=>Op(`FiniteSets`,[z(`IsFiniteSet`,1,e=>{let t=R(e,0,`IsFiniteSet`);if(M(t))return zi(t);if(typeof t==`object`&&t.kind===`Function`)return!0;throw new v(typeof t==`object`&&t.kind===`LazyFunction`?`Attempted to check if the function:\n${L(t)}\nis a finite set.`:`Attempted to check if the ${fn(t)} ${L(t)} is a finite set.`)}),z(`Cardinality`,1,t=>{let n=R(t,0,`Cardinality`);if(!M(n)||typeof n==`object`&&(n.kind===`InfiniteSet`||n.kind===`SequenceSet`))throw new c(`Attempted to compute cardinality of the value\n${L(n)}`);return Li(n,e)})]),jp=[ys(z(`Warshall`,1,e=>{let t=R(e,0,`Warshall`);if(!M(t)||Vn(t))throw new c(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${L(t)}`);Li(t);let n=[],r=/* @__PURE__ */ new Map,i=e=>{let t=ja(e),i=r.get(t)??n.length;return i===n.length&&(r.set(t,i),n.push(e)),i},a=P(t).elements.map(e=>{let t=Hi(e);if(t?.length!==2)throw new c(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${L(e)}`);return[i(t[0]),i(t[1])]}),o=n.map(()=>n.map(()=>!1));a.forEach(e=>{o[e[0]][e[1]]=!0});for(let e=0;e<n.length;e++)for(let t=0;t<n.length;t++)if(o[t][e])for(let r=0;r<n.length;r++)o[e][r]&&(o[t][r]=!0);return Xr(n.flatMap((e,t)=>n.flatMap((n,r)=>o[t][r]?[fi([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Mp=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return jp;if(e===`AnySet`)return[as(`ANY`,Gn)];if(e===`IOUtils`)return Ud(r,a);if(e===`_TLCTrace`)return Kd(r);if(!ip(n.version).has(e))return;let o=Pp(e,t,n,r,i)?.operators;return e===`Randomization`&&o?[...o,yf(n)]:o},Np=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Pp=(e,t,n,r,i)=>{switch(e){case`Naturals`:return{extends:[],operators:bp};case`Integers`:return{extends:[`Naturals`],operators:xp};case`Sequences`:return{extends:[],operators:kp(n.version)};case`FiniteSets`:return{extends:[],operators:Ap(n.version)};case`TLC`:return{extends:[],operators:Op(`TLC`,qf(t,n))};case`Randomization`:return{extends:[],operators:bf(n)};case`_Possible`:return{extends:[],operators:Pf(t,n)};case`Json`:return{extends:[],operators:Hd(r)};case`Bags`:return{extends:[],operators:Op(`Bags`,md(i))};case`TLCExt`:return{extends:[],operators:Op(`TLCExt`,Nf(t,n))};default:return}},Fp=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&pl.get(t)||[];r.expressions.push(...i,t);let a=Wi.sets,o=a??[],s=o.length;Wi.sets=o;try{return n()}catch(e){throw l_(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,Wi.sets=a}},Ip=(e,t,n)=>e.coverage?No(e.coverage,t,n):-1,Lp=(e,t,n)=>e.coverage?Fo(e.coverage,t,n):n(),Rp=(e,t,n,r)=>Lp(e,t,()=>W(n,r)),zp=(e,t,n,r)=>{let i=Rp(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Bp=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Vp=e=>!e.includes(void 0),Hp=e=>e.variables.map(()=>void 0),Up=(e,t,n)=>{let r=[...e];return r[t]=n,r},Wp=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},Gp=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,Kp=e=>e.kind===`Identifier`?e.name:void 0,qp=(e,t,n)=>{if(t.kind===`Label`)return qp(e,t.body,n);let r=Kp(t);if(r===void 0)return;let i=qh(n,r);if(i?.kind===`Thunk`)return qp(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=Lg(r,e);return o?.kind===`Closure`&&o.params.length===0?qp(e,o.body,o.scope):void 0},Jp=(e,t,n)=>{if(t.kind===`Prime`)return qp(e,t.expression,n);if(t.kind===`Label`)return Jp(e,t.body,n);let r=Kp(t);if(r===void 0)return;let i=qh(n,r);if(i?.kind===`Thunk`)return Jp(e,i.expression,i.scope);if(i)return;let a=Lg(r,e);return a?.kind===`Closure`&&a.params.length===0?Jp(e,a.body,a.scope):void 0},Yp=e=>{if(typeof e!=`boolean`)throw new v(`TLC expected a boolean expression.`);return e},Xp=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),Zp=(e,t,n,r)=>{let i=$p(e,t,n,r);return i&&e.coverage&&!e.isInit&&Po(e.coverage,r),i},Qp=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(Po(r,n),Po(r,r.roots[n])),e.onState(t),!0},$p=(e,t,n,r)=>t===void 0?Vp(n)?Qp(e,n,r):(e.onIncomplete?.(n),!1):Vp(n)&&Xp(e)?tm(e,t,n,r):t.kind===`Predicate`?nm(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?vm(e,t.expression,t.rest,t.scope,n,t.node):em(e,t,n)&&Zp(e,t.rest,n,t.node),em=(e,t,n)=>{let r=e.environment,i=Rp(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Rp(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?Kh(t,r.runtime.version):t}})();try{return!Kr(i,a)}catch(t){throw e.callStack&&l_(e.callStack,[i],t),t}},tm=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return vm(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?em(e,i,n):Yp(Rp(e,i.node,i.expression,Bp(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return Qp(e,n,r)},nm=(e,t,n,r,i,a)=>rm(e,t,n,r,i,Ip(e,a,t)),rm=(e,t,n,r,i,a)=>Fp(e,t,()=>{switch(t.kind){case`Let`:{let o=Bp(e,r,i),s=t.definitions,c=e.coverage?e_(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):e_(s,o);return nm(e,t.body,n,c,i,a)}case`Label`:return nm(e,t.body,n,r,i,a);default:if(fm.has(t.kind))throw new v(`The state relation is not a boolean expression.`);return Fp(e,t,()=>gm(e,t,n,r,i,a))}}),im=(e,t,n,r,i)=>Yp(t)&&Zp(e,n,r,i),am=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),om=(e,t,n,r,i,a)=>{let o=Bp(e,r,i);if(t.kind===`Identifier`){let s=qh(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return nm(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return nm(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:Lg(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&Ku(c,e.environment))?nm(e,l.body,n,l.scope,i,a):im(e,zp(e,a,t,o),n,i,a)}let s=Rg(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Lp(e,a,()=>Xg(s,t.args,o));return nm(e,s.body,n,r,i,a)}let c=am.has(t.operator)?Rp(e,a,t,o):zp(e,a,t,o);return im(e,c,n,i,a)},sm=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?Zp(e,t,Up(n,r,i),a):Kr(o,i)&&Zp(e,t,n,a)},cm=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),lm=(e,t,n)=>(e.coverage&&Io(e.coverage,t,n.length+1),n),um=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?qp(e.environment,o,r):Jp(e.environment,o,r),l=Bp(e,r,i);if(c===void 0)return Rp(e,a,t,l)===!0&&Zp(e,n,i,a);let u=Rp(e,a,s,l),d=i[c];if(t.operator===`=`)return sm(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&e.callStack?.sources.set(f,s),d!==void 0)return Rp(e,a,t,l)===!0&&Zp(e,n,i,a);if(!hi(f))throw new v(`The right side of \\IN is not enumerable.`);return lm(e,f,Ai(f)).reduce((t,r)=>Zp(e,n,Up(i,c,r),a)||t,!1)},dm=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),fm=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),pm={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},mm=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:pm[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${H(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${H(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${H(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(e)}`},hm=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Lp(e,r,()=>pg(t.bounds,t=>{let r=W(t,n),i=ug(r,t,a);return Array.isArray(i)&&lm(e,r,i),i}));return hg(t.bounds,o,n.scope,e=>(i.push(e),!1)),i},gm=(e,t,n,r,i,a)=>{let o=Bp(e,r,i);switch(t.kind){case`Identifier`:return om(e,t,n,r,i,a);case`Apply`:return dm.has(t.operator)&&t.args.length===2?um(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?Yp(Rp(e,a,t.args[0],o))?nm(e,t.args[1],n,r,i,a):Zp(e,n,i,a):om(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>cm(`Predicate`,t,r,a,e),n);return nm(e,o[0],t,r,i,a)}let s=o[o.length-1];return rm(e,Wp(t,o.length-1),cm(`Predicate`,s,r,a,n),r,i,Gp(e,a))}case`Or`:{let o=t.operands;if(t.isBulleted||o.length===2)return o.reduce((t,o)=>nm(e,o,n,r,i,a)||t,!1);let s=rm(e,Wp(t,o.length-1),n,r,i,Gp(e,a)),c=nm(e,o[o.length-1],n,r,i,a);return s||c}case`Exists`:return hm(e,t,o,a).reduce((r,o)=>nm(e,t.body,n,o,i,a)||r,!1);case`Forall`:{let r=hm(e,t,o,a);if(r.length===0)return Zp(e,n,i,a);let s=r.slice(1).reduce((e,n)=>cm(`Predicate`,t.body,n,a,e),n);return nm(e,t.body,s,r[0],i,a)}case`If`:return nm(e,Yp(Rp(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>Yp(Rp(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new v(`TLC encountered a CASE with no conditions true.`);return nm(e,s,n,r,i,a)}case`FunctionApplication`:{let r=xg(Rp(e,a,t.function,e.isInit?o:Zh(o)));if(r){let s=Lp(e,a,()=>Sg(r,t,o));return nm(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return vm(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=nm(e,t.action,n,r,i,a);return vm(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return nm(e,t.action,cm(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?mm(t):void 0;if(s!==void 0)throw new v(s);return im(e,Rp(e,a,t,o),n,i,a)},_m=(e,t,n)=>e.runtime.warn(St.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${H(n)}`),vm=(e,t,n,r,i,a)=>Fp(e,t,()=>{let o=Ip(e,a,t),s=qp(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;let a=i[s];return a!==void 0&&!Kr(a,r)?(_m(e.environment,s,t),!1):sm(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return Zp(e,n,i,o);let c=s.reduceRight((e,t)=>cm(`Unchanged`,t,r,o,e),n);return vm(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=qh(r,t.name);if(a?.kind===`Thunk`)return vm(e,a.expression,n,a.scope,i,o);let s=a?void 0:Lg(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return vm(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Bp(e,r,i),s=Rg(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return vm(e,s.body,n,Xg(s,t.args,a),i,o)}let c=e.environment,l=Rp(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Rp(e,o,t,{environment:c,scope:r,state:i,next:void 0});return Kr(l,u)&&Zp(e,n,i,o)}),ym=(e,t,n,r,i=!1,a)=>({environment:e,callStack:e.callStack,coverage:e.coverage,isInit:t,isEnabled:i,current:n,onState:r,onIncomplete:a}),bm=/* @__PURE__ */ Error(`The replay found a successor`),xm=(e,t,n,r)=>{let i=ym(r,!1,n,()=>{throw bm},!0),a=i.callStack,o=a?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=cm(`Changed`,e.subscript,t,-1,void 0);nm(i,e.action,n,t,Hp(r),-1)}else nm(i,e,void 0,t,Hp(r),-1);return!1}catch(e){if(e!==bm)throw e;return a&&(a.expressions.length=o,a.isFrozen=!1),!0}},Sm=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=ym(t,!0,void 0,n,!1,r),s=a.reduceRight((e,t)=>cm(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);nm(o,i.expression,s,i.scope,Hp(t),i.node??-1)},Cm=(e,t,n,r)=>{e.some(e=>fm.has(e.expression.kind))||e.forEach(e=>{let i=[];wm(e,-1,t,n,e=>i.push(e)),i.forEach(t=>r(t,e))})},wm=(e,t,n,r,i,a)=>{let o=ym(r,!1,n,i,!1,a);nm(o,e.expression,void 0,e.scope,Hp(r),t)},Tm=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(qp(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=qh(r,e.name)?void 0:Lg(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,e_(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){Jp(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=qh(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Rg(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:Lg(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,Xg(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Em=/* @__PURE__ */ new WeakMap,Dm=/* @__PURE__ */ new WeakMap,Om=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},km=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Am=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,jm=(e,t)=>{let n=new v(t);return e.isInit?n:x(n,ie.error)},Mm=(e,t,n,r)=>{let i=Ih(n);return r&&fm.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Am(e)}, TLC expected a boolean expression,\nbut instead found ${L(t)}.\n${i}`},Nm=(e,t,n)=>{let r=gs(t),i=H(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Am(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1781
|
-
`:``}${i}`},Pm=(e,t,n)=>Lm(e,t,W(t,n)),Fm=new Set(pp.map(e=>e.name)),Im=e=>e.kind===`Apply`?Fm.has(e.operator):e.kind!==`Identifier`&&!fm.has(e.kind),Lm=(e,t,n,r=!0)=>{if(typeof n==`boolean`)return n;let i=Mm(e,n,t,r);throw e.isInit&&r&&Im(t)?new le(i):jm(e,i)},Rm=(e,t,n,r)=>r.environment.callStack?W(n,r):(e[t]??=m_(n,r.environment))(r),zm=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Bm=(e,t,n)=>{let r=n?Em:Dm,i=r.get(e);if(i)return i;let a=bh(e,t,n),o=n?void 0:yh(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Vm=(e,t)=>{if(t.constants.has(e))return;let n=ig(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},Hm=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return Hm(e.expression,t,!1,r);if(e.kind!==`Identifier`||A(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Vm(e.name,t);if(a&&!r.has(a))return r.add(a),Hm(a.body,t,n,r)},Um=(e,t,n)=>Hm(e,t,!n),Wm=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return Wm(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=e_(e.definitions,Om(r,t,n));return Wm(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=qh(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return Wm(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=Vm(e.name,r.environment);if(s)return Wm(s.body,void 0,n,r,i)},Gm=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||A(e))||!t&&e.kind===`Prime`,Km=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>Km(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Vm(e.name,t);if(i)return n.add(e.name),Km(i.body,t,n)},qm=/* @__PURE__ */ new Set([`Label`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),Jm=(e,t,n)=>qm.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||zm(e.operator)&&(Gm(e.args[0],n)||Um(e.args[0],t,n)!==void 0)||A(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,Ym=/* @__PURE__ */ new Set,Xm=(e,t)=>{if(A(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return xl(e,(e,i)=>{let a=r?Xm(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];return a?n.push(...a):r=!1,e}),r?n:void 0},Zm=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||A(e)?void 0:ig(r,t);return i&&!n.has(i)&&(n.add(i),Zm(i.body,t,n))?!0:ht(e).some(e=>Zm(e,t,n))},Qm=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=Um(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=Km(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return Jm(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Bm(e,t,n)}},$m=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(Zu(e,t)===void 0||Zm(e,t,/* @__PURE__ */ new Set))return!0;let n=Xm(e,Ym);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},eh=(e,t,n)=>{let r=e.map(e=>Qm(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=Xp(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Sh(u)){d??=Om(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!Kr(t,i[e.index])}):void 0;if(o){_m(t.environment,o.index,o.expression);return}let s=n.expression,c=Rm(a,e,s,d);if(!Lm(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=Om(t,n,u);let r=Rm(i,s,e.expression,d);if(!Lm(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=Om(t,n,u);let r=Rm(i,s,e.value,d),a=u[e.index];if(a===void 0)u=km(u,e.index,r),d=void 0;else if(!Kr(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!Kr(e,n[i.index])){_m(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},th=e=>{let t=mm(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw jm(n,t);Pm(n,e,Om(n,r,i))&&s(i,a)}},nh=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=Om(r,i,a);if(a[l]!==void 0){Pm(r,e,u)&&c(a,o);return}let d=W(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!hi(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Am(r)}, the right side of \\IN is not enumerable.`;throw jm(r,`${t}\n${H(e)}`)}let p=Ai(f);if(r.generator){for(let e of df(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(km(a,l,e),o),r.successors>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(km(a,l,p[e]),o)}},rh=/* @__PURE__ */ new WeakMap,ih=e=>{let t=rh.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(ih),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return rh.set(e,n),n},ah=(e,t)=>{let n=e.args[0],r=th(e),i=(e,r,i)=>Wm(n,r,i,e,!t)??-1,a=nh(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=W(e.args[1],Om(t,n,o));l(km(o,u,d),s)}},oh=(e,t,n)=>{let r=H(e);return(i,a,o,s,c,l)=>{let u=Om(i,a,o),d=W(e.function,n?u:Zh(u)),f=xg(d);if(f!==void 0){Bm(f.body,t,n)(i,Sg(f,e,u),o,s,c,l);return}if(!ln(d))throw jm(i,`In computing ${Am(i)}, a non-function (${gs(d)}) was applied as a function.\n${r}`);let p=W(e,u);if(typeof p!=`boolean`)throw jm(i,`In computing ${Am(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},sh=(e,t)=>{if(Km(e,t))return eh([ih(e)],t,!1);if(e.kind===`Tuple`)return Bm(ih(e),t,!1);let n=ih(e);return(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?qh(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Bm(ih(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=Om(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Rg(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Bm(ih(n.body),t,!1)(r,Xg(n,e.args,u),a,o,s,c);return}}Pm(r,n,u)&&c(a,o)}},ch=(e,t,n)=>{let r=e.operator,i=th(e),a=A(e)?void 0:Lg(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=y_(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Bm(a.body,t,n),o(e,i(Om(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=Om(a,o,s),f=Rg(e,d);f?.kind===`Closure`?Bm(f.body,t,n)(a,Xg(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},lh=(e,t,n)=>{let r=th(e),i=A(e)?void 0:Vm(e.name,t),a;return(o,s,c,l,u,d)=>{let f=qh(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Bm(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Mg(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Bm(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},uh=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||A(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!A(i))return;let a=Hm(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},dh=e=>e.kind===`And`?e.operands.flatMap(dh):[e],fh=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&Jm(e,t,!1),ph=e=>{let t=[];return(n,r,i)=>{let a=Om(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Lm(n,i,Rm(t,r,i,a)))return}}},mh=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=dh(e),r=n.findIndex(e=>!fh(e,t)||uh(e,t)),i=r===-1?void 0:uh(n[r],t);return i?{...i,before:r===0?void 0:ph(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>mh(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||A(e))return;let r=Lg(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=mh(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!A(o))return;let s=i.before,c=s&&y_(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(Om(e,t,n)),n))}},hh=(e,t,n)=>{let r=qh(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},gh=(e,t,n)=>{let r=e.map(e=>Bm(e,t,n)),i=n?[]:e.map(e=>mh(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&hh(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},_h=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.nextDouble()*e.length),l=ef(s);for(let s=0;s<e.length;s++)if(e[(c+s*l)%e.length](t,n,r,i,a,o),t.successors>0||t.isStopped)return},vh=(e,t)=>{let n=Bm(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=Om(r,i,a),u=t.runtime.version,d=pg(e.bounds,e=>W(e,l)).map((n,r)=>df(cg(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),r.successors>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,Yh(i,l,e)))};f(d.length-1,i)}},yh=(e,t)=>{if(e.kind===`Exists`)return vh(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Bm(e,t,!1));return e.isBulleted?_h(n):n.reduce((e,t)=>_h([e,t]))},bh=(e,t,n)=>{let r=e=>Bm(e,t,n);switch(e.kind){case`And`:return eh(e.operands,t,n);case`Or`:return gh(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=cg(W(a.set,Om(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,Jh(r,e,u[t]),o,s,c,l)}}let o=n?void 0:$m(e,t);if(o){let r=eh(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=Om(n,i,a),d=pg(e.bounds,e=>cg(W(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=Jh(t,o.names[e],r);if(e===d.length-1){let e=Om(n,i,a);if(!o.guards.every(t=>Pm(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{gg(e.bounds,Om(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&Zu(e,t)!==void 0&&!Zm(e.body,t,/* @__PURE__ */ new Set)?Xm(e,Ym):void 0;return(t,n,r,o,s,c)=>{let l=[];gg(e.bounds,Om(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>qh(n,e)?.kind===`Value`)){u.every(n=>Pm(t,e.body,Om(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Sh(r)?u.slice(n).every(n=>Pm(t,e.body,Om(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=W(e.condition,Om(r,i,a));if(typeof l!=`boolean`)throw jm(r,Nm(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=Om(r,i,a),u=t.find(e=>{let t=W(e.condition,l);if(typeof t==`boolean`)return t;throw jm(r,`In computing ${Am(r)}, a non-boolean expression${r.isEnabled?``:` `}(${gs(t)}) was used as a guard condition of a CASE.\n${Ih(e.source)}`)})?.body??n;if(!u)throw jm(r,`In computing ${Am(r)}, TLC encountered a CASE with no conditions true.\n${H(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=n_(e.definitions,t);return(t,r,a,o,s,c)=>n(t,e_(e.definitions,Om(t,r,a),i),a,o,s,c)}case`Unchanged`:return n?()=>{throw new v(`UNCHANGED appears in an initial predicate at ${Nh(e)}`)}:sh(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Pm(e,i,Om(e,n,r))}catch(n){throw e.isEnabled?Kh(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return gh([e.action,ih(e.subscript)],t,n);case`Label`:return r(e.body);case`Identifier`:return lh(e,t,n);case`FunctionApplication`:return oh(e,t,n);case`Apply`:{let i=e.args;if(zm(e.operator)){let r=Um(i[0],t,n);if(r!==void 0)return e.operator===`=`?eh([e],t,n):nh(e,()=>r);if(Gm(i[0],n))return ah(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=W(i[0],Om(n,r,a));if(typeof l!=`boolean`){let t=gs(l),r=H(e);throw jm(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return ch(e,t,n)}default:return th(e)}},xh=e=>e.variables.map(()=>void 0),Sh=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Ch=(e,t)=>{let n=t.state;if(!n||!Sh(n))throw new v(`ENABLED needs a complete state at ${Nh(e)}`);let r=t.environment;if(r.callStack)return xm(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Bm(e,r,!1)(i,t.scope,xh(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},wh=(e,t,n,r,i)=>{let a={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Bm(e,t,!0)(a,r,xh(t),void 0,!1,e=>{if(!a.isStopped){if(!Sh(e)){if(i){a.isStopped=i([...e]);return}throw x(new f([...e]),ie.error)}a.isStopped=n(e)}})},Th=(e,t,n)=>{let r=[];return wh(e,t,e=>(r.push(e),!1),n),r},Eh=(e,t,r,i,a,o,s)=>{let c={environment:r,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:o,successors:0,onUnsatisfied:s};return Bm(e,r,!1)(c,a,xh(r),void 0,!1,(e,t)=>{if(!c.isStopped){if(!Sh(e)){let i=r.variables.filter((t,n)=>e[n]===void 0);throw new n(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${i.join(`, `)}`,e,t,i)}c.successors++,c.isStopped=i({state:e,action:t})}}),c.successors},Dh=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Bm(e,n,!1)(i,r,xh(n),void 0,!1,e=>{Sh(e)||(i.isStopped=!0)}),i.isStopped},Oh=(e,t,n,r)=>{let i=[];return Eh(e,t,n,e=>(i.push(e),!1),r),i},kh=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Ah=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),jh=e=>Ah.has(e.kind)||e.kind===`Apply`&&kh.has(e.operator),Mh=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&cn(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Nh=e=>`line ${e.location.line}, column ${e.location.column}`,H=e=>{let t=e.location.range;return t?h(t):Nh(e)},Ph={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},Fh=(e,t)=>new v(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${H(t)}`),Ih=e=>e.kind===`Number`?e.text??String(e.value):H(e),Lh=(e,t)=>new v(`A non-boolean expression (${gs(t)}) was used as the condition of an IF.\n${H(e)}`),Rh=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new v(`A non-boolean expression (${gs(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Ih(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new v(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${gs(n)}.\n${H({...e,location:{...e.location,range:{...r,end:i}}})}`)},zh=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${j(L(n))}\n${H(e)}`,r=e=>`Attempted to apply function:\n${j(L(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!ln(i))throw new v(`Attempted to select field "${t}" from a non-record value ${j(L(i))}\n${H(e)}`);let a=ir(i);if(a===`tuple`)throw ia(t);return ua(i.kind===`LazyFunction`?I(i):i,t,a===`record`?n:r)}},Bh=e=>e===`1.7.4`?(t,n)=>ta(t,n,e):void 0,Vh=e=>t=>{if(!ln(t))throw new v(`Attempted to apply the operator DOMAIN to a non-function\n(${gs(t)})\n${H(e)}`);return fa(t)},Hh=(e,t)=>(n,r)=>{if(!M(n)||Vn(n))throw new v(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${H(e)}`);return t.evaluateBinary?t.evaluateBinary(n,r):t.evaluate([n,r])},Uh=e=>x(new v(`TLC can't handle real numbers.\n${e.text}`),ie.configParseError),Wh=e=>x(new v(`TLC can't handle a number this big.\n${e.text??e.value}`),ie.error),Gh=(e,t)=>new d(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${H(t)}`,e),Kh=(e,t)=>e instanceof d&&t!==`1.7.4`?new v(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,qh=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},Jh=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),Yh=(e,t,n)=>{if(t.kind===`Name`)return Jh(e,t.name,n);let r=Hi(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new v(`Argument mismatch in operator application.${e?h(e):``}`)}return t.names.reduce((e,t,n)=>Jh(e,t,r[n]),e)},Xh=(e,t)=>{if(ln(e))return e;throw new v(`A non-function (${gs(e)}) was applied as a function.\n${H(t)}`)},Zh=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},Qh=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),$h=(e,t)=>{if(typeof e!=`boolean`)throw new v(`Expected ${t} to be a boolean but found ${L(e)}`);return e},eg=(e,t,n)=>{if(typeof e!=`boolean`)throw new v(`Attempted to evaluate an expression of form P => Q when ${n} was\n${gs(e)}.\n${H(t)}`);return e},tg=(e,t)=>{if(typeof e!=`boolean`)throw new v(`Attempted to apply the operator ~ to a non-boolean\n(${gs(e)})\n${H(t)}`);return!e},ng=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new v(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${H(n)}`);return e===t},rg=(e,t)=>{if(typeof e!=`boolean`)throw new v(`TLC expected a boolean value, but did not find one. ${Ih(t)}`);return e},ig=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),ag=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},og=(e,t,n)=>{if(!M(e)||Vn(e)){let r=L(e),i=n===`1.7.4`?void 0:ag(e,r);throw new v(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Ih(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Ih(t)}\n${i}`)}},sg=(e,t,n)=>(og(e,t,n),typeof e==`object`&&e.kind===`Interval`?ci(e):Si(e)??Oi(e)),cg=(e,t,n)=>n===`1.7.4`?(og(e,t,n),Si(e)??Ai(e)):sg(e,t,n),lg=e=>{if(typeof e==`object`&&e.kind===`Interval`)return Li(e),e},ug=(e,t,n)=>lg(e)??cg(e,t,n),dg=(e,t,n)=>lg(e)??sg(e,t,n),fg=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},pg=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set)),n),[]),mg=(e,t)=>pg(e,e=>ug(W(e,t),e,t.environment.runtime.version)),hg=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):fg(t[n],t=>i(n-1,Yh(a,e[n].pattern,t)));return i(e.length-1,n)},gg=(e,t,n)=>hg(e,mg(e,t),t.scope,n),_g=(e,t)=>{let n=pg(e,e=>W(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},vg=(e,t,n)=>{if(e.length===1)return Yh(t,e[0].pattern,n);let r=Hi(n)??[];return e.reduce((e,t,n)=>Yh(e,t.pattern,r[n]),t)},yg=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,bg=e=>Object.assign(e.value,{lambda:e}),xg=e=>yg(e)?e.lambda:void 0,Sg=(e,t,n)=>{let r=e.value,i=t.args.map(e=>W(e,n)),a=i.length===1?i[0]:fi(i),o=(e,n,i)=>`In applying the function\n${j(L(r))},\nthe ${e} is:\n${j(L(n))}${i}.\n${H(t.function)}`,s=e.bounds;if(s.length===1){if(!qi(a,r.domain))throw new v(o(`first argument`,a,`which is not in its domain`));return vg(s,e.scope,a)}let c=Hi(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[],u=()=>new v(`In applying the function\n${j(L(r))},\nthe argument list is:\n${j(L(a))}\nwhich does not match its formal parameter.\n`);if(c===void 0||(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!qi(n,l[t]))throw new v(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1782
|
-
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&Hi(n)?.length!==e.pattern.names.length)throw new v(o(r,n,`which does not match its formal parameter`))}),c.length>s.length))throw u();return vg(s,e.scope,a)},Cg=(e,t)=>{let n=t.location.range;if(n)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:h(n)}},wg=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Tg=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},Eg=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Dg=e=>({kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location}),Og=(e,t)=>{let n=_g(e.bounds,t),r=Tg(n,(n,r)=>W(e.body,Qh(t,vg(e.bounds,Jh(void 0,e.name,r),n))),wg(Cg(e.bounds,e.body),e.bounds,n),Eg(e.bounds));bg({value:r,bounds:e.bounds,body:e.body,scope:Jh(void 0,e.name,r)});let i=Object.assign(r,{rebind:n=>{let i=Og(e,{...t,environment:n});return i.enumerated=r.enumerated,i}});return e.bounds.length===1?ar(i):i},kg=(e,t)=>{if(typeof t!=`object`||ir(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!cn(t.domain))return t;try{let e=I(t);return tr(e.domain,e.range)}catch(e){if(e instanceof v)return t;throw e}},Ag=(e,t)=>e.kind===`Operator`&&e.params.length>0?()=>{throw new v(`Operator ${e.name} requires ${e.params.length} arguments`)}:e.kind===`Function`?e.isSelfReferential?t=>Og(e,t):m_(Dg(e),t):m_(e.body,t),jg=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Ag(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=i===void 0?e=>r(Qh(e,void 0)):e=>a[i]??r(Qh(e,void 0));return t.definitionEvaluators.set(e,o),o},Mg=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Ng=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!Ku(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>kg(e,Ag(e,t)(i)));Wr(n),t.startupValues[r]=n}catch(e){if(!(e instanceof v)&&!y(e))throw e}}),Pg=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&fr(e[n],t))}catch(e){if(e instanceof v)return!1;throw e}},Fg=(e,t)=>{let n=e.cache;if(n!==void 0&&Pg(t.state,e.state)&&Pg(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?Fo(r,i,()=>W(e.expression,Qh(t,e.scope))):W(e.expression,Qh(t,e.scope));return(!e.isStreamed||Mi(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Ig=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Lg=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Lg(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Ig(r):t.builtins.get(e)},Rg=(e,t)=>A(e)?zg(e.operator,t):Lg(e.operator,t.environment)??zg(e.operator,t),zg=(e,t)=>{let n=qh(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Lg(e,t.environment)},Bg=e=>e.kind===`Closure`?e.params.length:e.arity,Vg=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:zg(n,t);if(!r)throw new v(`Expected an operator argument at ${Nh(e)}`);return r},Hg=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>Jh(e,n.name,t[r]),e.scope);return W(e.body,Qh(n,r))},Ug=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:Bg(e),call:n=>Hg(e,n,t)},Wg=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=zg(e.name,t);return n!==void 0&&Bg(n)>0},Gg=(e,t)=>e.map(e=>Wg(e,t)?Ug(Vg(e,t),t):W(e,t)),Kg=(e,t)=>new v(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),qg=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),Jg=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return Jg(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},Yg=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&pn(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=qg(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=A(e)?void 0:Jg(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=qh(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:qg(e,t)}}return t=>qg(e,t)},Xg=(e,t,n,r)=>{if(t.length!==e.params.length)throw Kg(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:Vg(t[a],n)}:(r?.[a]??Yg(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},Zg=(e,t,n,r)=>e.kind===`Closure`?W(e.body,Qh(n,Xg(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>W(e,n))):e.isLazy?e.evaluate(__(t,n),n):e.evaluate(Gg(t,n),n),Qg=/* @__PURE__ */ new WeakMap,$g=e=>{let t=Qg.get(e);if(t)return t;let n={kind:`FunctionConstruction`,bounds:e.bounds,body:e.body,location:e.location,isRecursive:!0};return Qg.set(e,n),n},e_=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=r.reduce((e,t)=>(t.parent=e,t),t.scope);e.forEach((e,a)=>{r[a].binding=e.kind===`Function`?{kind:`Thunk`,expression:$g(e),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:e.params.length>0||n?.impure.has(e)?{kind:`Operator`,operator:{kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:i}}:{kind:`Thunk`,expression:e.body,scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(e)??!1}});let a=t.environment.coverage;return a&&a.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&a.values.set(e.binding,a.current)}),i},t_=(e,t,n)=>{let r=qh(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Fg(r,n);if(r?.kind===`Operator`){if(Bg(r.operator)===0)return Hg(r.operator,[],n);throw new v(`Operator ${e} is used without arguments`)}let i=Jg(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw Gh(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return jg(i.definition,n.environment)(n);let a=n.environment.builtins.get(e);if(a?.arity===0)return a.evaluate([],n);throw new v(`Unknown identifier ${e} at ${Nh(t)}`)},n_=(e,t)=>({impure:new Set(e.filter(e=>Ju(e,t))),streamed:new Set(e.filter(e=>Ju(e,t,`streamed`)))}),r_=e=>[...e.facts.ids.keys()].some(t=>Ju(t,e)),i_=e=>[...e.facts.ids.keys()].some(t=>Ju(t,e,`repeated`)),a_=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,o_=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),s_=e=>t=>{let n=e(t);return fr(n,e(o_(t)))},c_=(e,t,n,r)=>i=>{r.expressions.push(e);let a=Wi.sets,o=Wi.callStack,c=a??[],l=c.length;Wi.sets=c,Wi.callStack=r;try{let a=t(i),o=a_(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&jh(e)&&r.sources.set(o,e),o}catch(t){t instanceof s&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Mh(e,r.values),a=i&&!ht(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!ln(a)?void 0:a;throw l_(r,[o,...c.slice(l).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),c.length=l,Wi.sets=a,Wi.callStack=o}},l_=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof v){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},u_=(e,t,n)=>{if(!(n instanceof v))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},d_=e=>({...e,coverage:void 0,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),f_=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},p_=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=No(n,i,e);Po(n,a),n.current=a;try{let i=t(r);return typeof i==`object`&&e.kind===`SetEnumeration`&&n.values.set(i,a),i}finally{n.current=i}},U=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=V_(e,t),i=t.callStack,a=i&&pl.get(e),o=i?c_(e,r,t,i):r,s=i&&a?f_(e,a,o,i):o,c=t.coverage,l=c?p_(e,s,c):s;return t.evaluators.set(e,l),l},m_=(e,t)=>{if(t.callStack||t.coverage)return U(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=qs(e,t)??U(e,t);return t.entryEvaluators.set(e,r),r},W=(e,t)=>m_(e,t.environment)(t),h_=(e,t)=>{let n=e.name,r=A(e)?void 0:Jg(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw Gh(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=jg(e,t))(r)}return t=>t_(n,e,t)},g_=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||A(e))return!0;let n=Lg(e.name,t);return n===void 0||Bg(n)===0},__=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>W(e,t),expression:e})),v_=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(__(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&g_(t[0],n)){let e=U(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&g_(t[0],n)&&g_(t[1],n);if(i&&a){let e=U(t[0],n),r=U(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(Gg(t,n),n)},y_=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw Kg(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:Yg(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:Vg(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},b_=(e,t,n)=>{let r=y_(e,t,n),i;return t=>(i??=m_(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},x_=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=U(n[0],t),i=U(n[1],t);return t=>!eg(r(t),e,`P`)||eg(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=U(n[0],t);return t=>tg(r(t),e)}if(e.operator===`<=>`){let r=U(n[0],t),i=U(n[1],t);return t=>ng(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw Fh(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=A(e)?void 0:Lg(e.operator,t);if(r?.kind===`Closure`)return b_(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=U(n[0],t),i=Vh(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!fl.has(e)&&!Qu(n[0],t);return e=>r.evaluate(__(n,e),i&&e.scope===void 0?void 0:e)}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&n.length===2){let i=U(n[0],t),a=U(n[1],t),o=Hh(e,r);return e=>o(i(e),a(e))}if(r?.kind===`Builtin`)return v_(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new v(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let i=n.map(e=>Yg(e,t));return r=>{let a=zg(e.operator,r);if(a)return Zg(a,n,r,i);throw t.definitions.get(e.operator)?.kind===`Function`?new v(`${e.operator} is a function; apply it with brackets`):new v(`Unknown operator ${e.operator} at ${Nh(e)}`)}},S_=(e,t)=>{let n=e.kind===`Forall`,r=U(e.body,t),i=e.bounds[0];if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=U(i.set,t);return s=>fg(ug(o(s),i.set,t.runtime.version),t=>rg(r(Qh(s,Jh(s.scope,a,t))),e)!==n)?!n:n}let a=e.bounds;if(a.every(e=>e.pattern.kind===`Name`)){let i=a.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return o=>{let s=pg(a,e=>ug(U(e,t)(o),e,t.runtime.version)),c=(t,a)=>t<0?rg(r(Qh(o,a)),e)!==n:fg(s[t],e=>c(t-1,Jh(a,i[t],e)));return c(a.length-1,o.scope)?!n:n}}return t=>gg(a,t,i=>rg(r(Qh(t,i)),e)!==n)?!n:n},C_=(e,t)=>{if(e.kind===`Tuple`)return fi(e.names.map(e=>{let n=qh(t,e);return n?.kind===`Value`&&n.value}));let n=qh(t,e.name);return n?.kind===`Value`?n.value:void 0},w_=/* @__PURE__ */ new WeakSet,T_=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&w_.add(e)},E_=/* @__PURE__ */ new WeakMap,D_=e=>{if(E_.has(e))return E_.get(e);let t=/* @__PURE__ */ new Set,n=e=>e.kind!==`Subexpression`&&(e.kind===`Identifier`&&t.add(e.name),(e.kind===`Apply`||e.kind===`OperatorReference`)&&t.add(e.operator),e.kind===`ExceptAt`&&t.add(`@`),ht(e).every(n)),r=n(e)?[...t]:void 0;return E_.set(e,r),r},O_=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=qh(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),k_=e=>w_.has(e),A_=(e,t)=>{let n=k_(e),r=U(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(Qh(t,Jh(t.scope,n,e)));if(on(e))return Li(e),sn(e,i),d(e,t);let o=ui(e),s=tr(o,o.map(i));return cn(e)?s:(s.lambdaDomain=e,ar(s))}let n=[],s=pg(i,e=>dg(W(e,t),e,t.environment.runtime.version));return hg(i,s,t.scope,e=>{let o=i.length===1?C_(a.pattern,e)??!1:fi(i.map(t=>C_(t.pattern,e)??!1));return n.push([o,r(Qh(t,e))]),!1}),ti(n)},c=Cg(i,e.body),l=Eg(i),u=D_(e.body),d=(t,n)=>{let a=O_(n.scope,u),o=Qh(n,a),s=bg({value:Tg(t,e=>r(Qh(o,vg(i,a,e))),wg(c,i,t),l),bounds:i,body:e.body,scope:a});return i.length===1?ar(s):s},f=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!N(t))return d(t,r);if(!(i.length===1?cn(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(cn))){if(f)return d(t,r);try{return s(t,r)}catch(e){if(!(e instanceof v))throw e;return d(t,r)}}if(!f)return s(t,r);try{return s(t,r)}catch(t){throw u_(f,e,t),t}},createLazy:d}},j_=(e,t)=>{let n=A_(e,t).build,r=e.bounds;if(r.length===1&&r[0].pattern.kind===`Name`){let e=U(r[0].set,t);return t=>n(e(t),t)}return e=>n(_g(r,e),e)},M_=(e,t)=>{let n=w_.has(e);n&&T_(e.function);let r=U(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>U(e,t))}),value:U(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):fi(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(Qh(i,Jh(i.scope,`@`,e))):pa(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(St.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${H(e.function)}`)}return n}},N_=(e,t)=>{let n=U(e.predicate,t),r=e.bound.pattern,i=e.predicate.location.range,a=i&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:h(i)},o=Ih(e.predicate),s=t.coverage,c=(e,t,n)=>{if(!s||e===-1)return n();t||s.secondary[e]++;let r=Fo(s,t?-1:e,n);return!t&&r===!0&&s.secondary[e]++,r},l=(t,n,i,s)=>({kind:`FilteredSet`,base:t,test:(e,t)=>{if(r.kind===`Tuple`&&Hi(e)?.length!==r.names.length)throw new v(`Attempted to check if the value:\n${j(L(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(s,t,()=>i(Qh(n,Yh(n.scope,r,e))));if(typeof a!=`boolean`)throw new v(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${o} yielded non-Boolean value.`);return a},source:a,rebind:r=>l(t,{...n,environment:r},U(e.predicate,r),-1)});return(e,t,r=-1)=>l(e,t,n,r)},P_=(e,t)=>{if(typeof e!=`boolean`)throw new v(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${gs(e)}.\n${Ih(t.predicate)}`);return e},F_=(e,t,n,r)=>{if(!M(e)||Vn(e))throw new v(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${H(t)}`);return Gr(e),dg(e,n,r)},I_=e=>new v(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${H(e)}`),L_=(e,t)=>{if(e.kind===`SetFilter`){let n=U(e.predicate,t),r=U(e.bound.set,t),i=N_(e,t),a=e.bound.pattern,o=t.coverage;return t=>{let s=r(t);if(!cn(s))return i(s,t,o?.current);let c=[],l=r=>{let i=n(Qh(t,Yh(t.scope,a,r)));P_(i,e)&&an(c,r)},u=s.kind===`Interval`?s:P(s).elements;return sn(u,l),o&&o.current!==-1&&(o.secondary[o.current]+=(Array.isArray(u)?u.length:u.high-u.low+1)+c.length),er(c)}}if(e.kind===`SetMap`){let n=U(e.expression,t);return t=>{let r=[];return gg(e.bounds,t,e=>(an(r,n(Qh(t,e))),!1)),Xr(r)}}let n=e.set;if(!n)return()=>{throw new v(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${H(e)}`)};let r=U(e.body,t),i=U(n,t);return t=>{let a=F_(i(t),e,n,t.environment.runtime.version),o,s=e.pattern;if(fg(a,n=>{if(s.kind===`Tuple`&&Hi(n)?.length!==s.names.length)throw new v(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${H(e)}`);let i=Yh(t.scope,s,n);return rg(r(Qh(t,i)),e)?(o=C_(s,i),!0):!1}),o===void 0)throw I_(e);return o}},R_=e=>[...e].sort((e,t)=>Jn(e.name,t.name)),z_=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),B_=(e,t)=>{let n=R_(e),r=z_(n),i=n.map(e=>U(e.value,t));if(r)return e=>pi(n.map((t,n)=>[t.name,i[n](e)]));let a=n.map(e=>e.name),o=e.map(e=>e.name);return o.some((e,t)=>e!==a[t])?e=>yn(a,i.map(t=>t(e)),o):e=>mi(a,i.map(t=>t(e)))},V_=(e,t)=>{let n=e=>U(e,t);switch(e.kind){case`Number`:{let t=e.value;return pn(t)?()=>t:()=>{throw Wh(e)}}case`Decimal`:return()=>{throw Uh(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return h_(e,t);case`Apply`:return x_(e,t);case`Bracket`:return()=>{throw new v(`A bracket without a function or subscript is not an expression at ${Nh(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new v(`An operator cannot be used as a value at ${Nh(e)}`)};case`And`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw Rh(e,r,i);if(!i)return!1}return!0}}case`Or`:{let t=e.operands.map(n);return n=>{for(let r=0;r<t.length;r++){let i=t[r](n);if(typeof i!=`boolean`)throw Rh(e,r,i);if(i)return!0}return!1}}case`Prime`:{let t=n(e.expression);return e=>t(o_(e))}case`Unchanged`:return s_(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Lh(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new v(`A non-boolean expression (${gs(t)}) was used as a condition of a CASE. ${Ih(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new v(`Attempted to evaluate a CASE with no conditions true.\n${H(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(Qh(n,e_(e.definitions,n)))}case`Forall`:case`Exists`:return S_(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?Fh(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new v(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${H(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return L_(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>Xr(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>fi(t.map(t=>t(e)))}case`FunctionConstruction`:return j_(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return B_(e.fields,t);case`RecordSet`:{let t=R_(e.fields),r=t.map(e=>e.name),i=t.map(e=>n(e.value));return e=>({kind:`RecordSet`,names:r,sets:i.map(t=>t(e))})}case`Except`:return M_(e,t);case`ExceptAt`:return t=>{let n=qh(t.scope,`@`);if(n?.kind!==`Value`)throw new v(`@ appears outside an EXCEPT at ${Nh(e)}`);return n.value};case`FunctionApplication`:{T_(e.function);let r=n(e.function),i=t=>Xh(r(Zh(t)),e),a=e.args.map(n),o=Bh(t.runtime.version);if(a.length===1){let e=a[0];return t=>ua(i(t),e(t),o)}return e=>ua(i(e),fi(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=zh(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=s_(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new v(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${H(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Ch(t,e)}case`Label`:return n(e.body);case`Subexpression`:return()=>{throw new v(`The subexpression reference at ${Nh(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw Fh(Ph[e.kind],e)}}},H_=`tlc2/value/impl/`,U_={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},W_={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},G_=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},K_=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),q_=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],J_=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??K_.get(e[3])}${`[]`.repeat(e[1].length)}`),Y_=(e,t)=>e[e[t].first].text,X_=(e,t)=>Y_(e,t).replaceAll(`/`,`.`),Z_=e=>{let t=G_(e);if(t.readUint32()!==3405691582)throw new r(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],i=t.readUint16(),a=new TextDecoder;for(let e=1;e<i;e++){let r=t.readUint8(),i={tag:r,text:``,value:0,first:0,second:0};n[e]=i,r===U_.utf8?i.text=a.decode(t.readBytes(t.readUint16())):r===U_.integer?i.value=t.readInt32():r===U_.float?t.readUint32():r===U_.long||r===U_.double?(t.readBytes(8),e++):r===U_.class||r===U_.string||r===U_.methodType||r===U_.module||r===U_.package?i.first=t.readUint16():r===U_.methodHandle?(t.readUint8(),i.first=t.readUint16()):(i.first=t.readUint16(),i.second=t.readUint16())}t.readUint16();let o=X_(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let s=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,a=i.indexOf(`)`),c=J_(i.slice(1,a)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:G_(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>X_(n,d.readUint16())):[],p=q_.filter(([t])=>(e&t)!==0).map(([,e])=>e),m=J_(i.slice(a+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;s.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${o}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:s}},Q_=(e,t)=>{let n=e[t],r=e[n.second];return{className:Y_(e,n.first),name:e[r.first].text}},$_=(e,n,r,i)=>{let a=()=>new t(`The Java override ${r}.${e.name} computes its value, which tla-ts cannot run`),o=e.code;if(!o)throw a();let s=[],c=()=>{let e=s.pop();if(e===void 0)throw a();return e},l=e=>{let t=n[e];if(t.tag===U_.integer)return t.value;if(t.tag===U_.string)return n[t.first].text;throw a()};for(let e=0;e<o.length;){let t=o[e],r=()=>o[e+1]<<8|o[e+2];if(t>=W_.iconstM1&&t<=W_.iconst5)s.push(t-W_.iconst0),e+=1;else if(t===W_.bipush)s.push(o[e+1]<<24>>24),e+=2;else if(t===W_.sipush)s.push(r()<<16>>16),e+=3;else if(t===W_.ldc)s.push(l(o[e+1])),e+=2;else if(t===W_.ldcW)s.push(l(r())),e+=3;else if(t===W_.dup){let t=c();s.push(t,t),e+=1}else if(t===W_.getstatic){let t=Q_(n,r());if(t.className!==`${H_}BoolValue`||t.name!==`ValTrue`&&t.name!==`ValFalse`)throw a();s.push({kind:`Identifier`,name:t.name===`ValTrue`?`TRUE`:`FALSE`,location:i}),e+=3}else if(t===W_.invokestatic){let t=Q_(n,r()),o=c();if(t.className!==`${H_}IntValue`||t.name!==`gen`||typeof o!=`number`)throw a();s.push({kind:`Number`,value:o,location:i}),e+=3}else if(t===W_.new)s.push({className:Y_(n,r()),value:void 0}),e+=3;else if(t===W_.invokespecial){let t=Q_(n,r()),o=c(),s=c();if(!(t.className===`${H_}StringValue`&&t.name===`<init>`&&typeof o==`string`&&typeof s==`object`&&`className`in s))throw a();s.value={kind:`String`,value:o,location:i},e+=3}else if(t===W_.areturn){let e=c();if(typeof e!=`object`)throw a();if(`className`in e){if(!e.value)throw a();return e.value}return e}else throw a()}throw a()},ev=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=Z_(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:$_(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},tv=O(`EOF`),nv=O(`IDENTIFIER`),rv=O(`DEFBREAK`),iv=(e,t)=>Array.from({length:O(t)-O(e)+1},(t,n)=>O(e)+n),av=new Set(iv(`op_57`,`op_119`)),ov=new Set(iv(`op_1`,`op_119`)),sv=new Set(iv(`op_57`,`op_70`)),cv=/* @__PURE__ */ new Set([...iv(`ACTION`,`EXCEPT`),O(`EXTENDS`),...iv(`IF`,`SF`),O(`STATE`),...iv(`THEN`,`WITH`),O(`US`),...iv(`op_112`,`op_116`)]),lv=(e,t,n,r,...i)=>i.map(i=>[i,{name:i,low:t,high:n,isLeftAssociative:r,fix:e}]),uv=new Map([...lv(`postfix`,160,160,!0,`[`),...lv(`postfix`,150,150,!1,`'`,`^+`,`^*`,`^#`),...lv(`prefix`,120,120,!1,`-.`),...lv(`prefix`,100,130,!1,`SUBSET`,`UNION`,`DOMAIN`),...lv(`prefix`,40,150,!1,`[]`,`<>`,`ENABLED`,`UNCHANGED`),...lv(`prefix`,40,40,!0,`\\lnot`),...lv(`nfix`,100,130,!0,`\\times`),...lv(`infix`,140,140,!1,`^`,`^^`),...lv(`infix`,130,130,!1,`/`,`//`,`\\oslash`,`\\div`),...lv(`infix`,130,130,!0,`*`,`&&`,`&`,`**`,`\\odot`,`\\otimes`,`\\star`,`\\o`,`\\bigcirc`,`\\bullet`),...lv(`infix`,110,110,!0,`-`,`--`,`\\ominus`),...lv(`infix`,100,110,!0,`|`,`||`,`%%`),...lv(`infix`,100,110,!1,`%`),...lv(`infix`,100,100,!0,`+`,`++`,`\\oplus`),...lv(`infix`,90,140,!1,`\\wr`),...lv(`infix`,90,130,!0,`$$`,`$`,`??`,`##`,`\\uplus`,`\\sqcap`,`\\sqcup`),...lv(`infix`,90,130,!1,`!!`),...lv(`infix`,90,90,!1,`...`,`..`),...lv(`infix`,80,80,!0,`\\intersect`,`\\union`),...lv(`infix`,80,80,!1,`\\`),...lv(`infix`,70,70,!1,`<:`,`:>`),...lv(`infix`,60,60,!0,`@@`),...lv(`infix`,50,140,!0,`\\cdot`),...lv(`infix`,50,50,!1,`=`,`/=`,`<`,`>`,`\\in`,`\\notin`,`\\leq`,`\\geq`,`\\subseteq`,`\\subset`,`\\supseteq`,`\\supset`,`\\sqsubseteq`,`\\sqsubset`,`\\sqsupseteq`,`\\sqsupset`,`\\prec`,`\\preceq`,`\\succ`,`\\succeq`,`\\sim`,`\\simeq`,`\\approx`,`\\cong`,`\\asymp`,`\\doteq`,`\\propto`,`\\ll`,`\\gg`,`|-`,`|=`,`-|`,`=|`,`:=`,`::=`),...lv(`infix`,30,30,!0,`\\land`,`\\lor`),...lv(`infix`,20,20,!1,`~>`,`\\equiv`,`-+->`),...lv(`infix`,10,10,!1,`=>`)]),dv=new Map([...uv,...Yf.flatMap(e=>e.slice(1).map(t=>[t,uv.get(e[0])]))]),fv=dv.get(`[`),pv={name:`$$_void`,low:0,high:0,isLeftAssociative:!1,fix:`infix`},mv=e=>({type:`tokens`,kinds:new Set(e)}),hv=e=>typeof e==`string`?e.startsWith(`<`)?mv([O(e.slice(1,-1))]):{type:`call`,name:e}:e,G=(...e)=>({type:`sequence`,units:e.map(hv)}),K=(...e)=>({type:`choice`,alternatives:e.map(e=>typeof e!=`string`&&e.type===`sequence`?e:G(e))}),gv=e=>(...t)=>({type:e,body:G(...t)}),q=gv(`zeroOrMore`),_v=gv(`oneOrMore`),J=gv(`optional`),Y=e=>({type:`action`,run:t=>e(t)??void 0}),X=e=>Y(t=>{t.expecting=e}),Z=e=>({type:`lookahead`,amount:e.amount??(e.expansion?2147483647:0),expansion:e.expansion&&G(...e.expansion),semantic:e.semantic}),vv=(e,t)=>(t.next===void 0&&(t.next=e.readToken()),t.next),yv=(e,t)=>{let n=e.isLookingAhead?e.scanPosition:e.token;for(let r=0;r<t;r++)n=vv(e,n);return n},bv=(...e)=>{let t=e.map(O);return e=>t.includes(yv(e,1).kind)},xv=(e,t=yv(e,1).beginColumn)=>{let n=e.junctions.at(-1);return n===void 0||n.column<t},Sv=e=>{let t=yv(e,1),n=e.junctions.at(-1);return n?.column===t.beginColumn&&n.kind===t.kind},Cv=e=>bv(`CASESEP`)(e)&&xv(e),wv=e=>{let t=yv(e,1);cv.has(t.kind)&&(t.kind=nv)},Tv=(e,t,n=t)=>`line ${t.beginLine}, col ${t.beginColumn} to line ${n.beginLine}, col ${n.beginColumn+n.image.length-1} of module ${e.moduleName}`,Ev=(e,t)=>({kind:e,heirs:t,first:t[0].first,last:t[t.length-1].last}),Dv=(e,t)=>{let n=e.frames[e.frames.length-1].heirs;return n[n.length-t]},Ov=e=>e.operatorStacks[e.operatorStacks.length-1],kv=(e,t)=>e.low>t.high,Av=(e,t)=>e.high<t.low,jv=e=>e.fix===`prefix`?e:dv.get(`${e.name}.`),Mv=(e,t)=>{let n=e[t-2].node,r=e[t-1];e.splice(t-2,2,{node:r.operator===fv?Ev(`FcnAppl`,[n,...r.node.heirs]):Ev(`PostfixExpr`,[n,r.node]),operator:void 0})},Nv=(e,t)=>{let n=e.length-1;if(t.fix!==`infix`&&t.fix!==`nfix`){e.splice(n-2,2,{node:Ev(`PrefixExpr`,[e[n-2].node,e[n-1].node]),operator:void 0});return}let r=e[n-3].node,i=t.fix===`nfix`;e.splice(n-3,3,{node:Ev(i?`Times`:`InfixExpr`,[...i&&r.kind===`Times`?r.heirs:[r],e[n-2].node,e[n-1].node]),operator:void 0})},Pv=e=>{let t=Ov(e),n=t.length-1,r=t[n],i=t[n-1],a=t[n-2];if(r.operator===void 0||r.operator.fix===`prefix`)return;if(i.operator?.fix===`postfix`)return Mv(t,n),Pv(e);if(i.operator!==void 0){let t=jv(r.operator);return t!==void 0&&kv(i.operator,t)?`\n Precedence conflict between ops ${i.operator.name} in block ${Tv(e,i.node.first,i.node.last)} and ${t.name}.`:void 0}if(a===void 0)return;if(a.operator===void 0)return`Expression at location ${Tv(e,a.node.first,a.node.last)} and expression at location ${Tv(e,i.node.first,i.node.last)} follow each other without any intervening operator.`;if(r.operator.fix===`postfix`)return Av(a.operator,r.operator)?void 0:kv(a.operator,r.operator)?(Nv(t,a.operator),Pv(e)):`Precedence conflict between ops ${a.operator.name} in block ${Tv(e,r.node.first,r.node.last)} and ${r.operator.name}.`;let o=jv(a.operator),s=o!==void 0&&(n===2||t[n-3].operator!==void 0)?o:a.operator;if(Av(s,r.operator))return;if(!kv(s,r.operator)&&!(s===r.operator&&s.isLeftAssociative))return`\n Precedence conflict between ops ${s.name} in block ${Tv(e,a.node.first,a.node.last)} and ${r.operator.name}.`;if(s.fix!==`postfix`)return Nv(t,s),Pv(e);let c=Tv(e,a.node.first,a.node.last);return a.node.first.beginLine<i.node.first.beginLine&&r.operator.name===`=`?`\n *** Hint *** You may have mistyped ==\n Illegal combination of operators ${s.name} in block ${c} and =.`:r.operator===pv?`\n Error following expression at ${c}, missing operator or separator.`:`\n Illegal combination of operators ${s.name} in block ${c} and ${r.operator.name}.`},Fv=e=>Y(t=>{let n=Ov(t),r=Dv(t,1);if(!e(r))n.push({node:r,operator:void 0});else return n.push({node:r,operator:t.lastOperator}),n.length===1?void 0:Pv(t)}),Iv=Fv(()=>!1),Lv=Fv(()=>!0),Rv=Y(e=>{e.lastOperator=dv.get(e.token.image)}),zv=e=>{let t=e[e.length-1],n=t.kind===`BangExt`?t.heirs[t.heirs.length-1]:t;return n.kind===`OpArgs`?n:void 0},Bv=e=>{if(e.kind===`GeneralId`)return!0;let t=e.kind===`OpApplication`&&e.heirs.length===2?zv(e.heirs):void 0;return t!==void 0&&t.heirs.every((e,t)=>t%2==0||e.kind===`GeneralId`)},Vv=(e,t)=>{for(let n of t.heirs){if(n.kind===`Junctions`)continue;if(!xv(e,n.first.beginColumn))return n;let t=Vv(e,n);if(t!==void 0)return t}},Hv=e=>{let t=[`EOF`,`THEOREM`,`PROPOSITION`,`ASSUMPTION`,`END_MODULE`].map(O),n=(e,...t)=>t.some(t=>e.kind===O(t)),r=e=>e!==void 0&&av.has(e.kind),i=e.token,a=vv(e,i);i.next=void 0;let o=vv(e,a);for(a.next=i;!t.includes(o.kind)&&!n(a,`THEOREM`,`PROPOSITION`);){if(n(a,`DEF`)){let e=i;if(n(e,`RBR`,`RSB`)){let t=1;for(;e.next!==void 0&&(e=e.next,!(n(e,`LBR`,`LSB`)&&t===1));)n(e,`LBR`,`LSB`)&&t>1&&t--,n(e,`RBR`,`RSB`)&&t++;e.next===void 0?e=void 0:e.next.kind===nv&&(e=e.next)}else if(e.kind===nv){let t=e.next;!r(t)||sv.has(t.kind)||ov.has(t.kind)&&t.next?.kind!==nv||(e=t.next?.kind===O(`SUBSTITUTE`)?i:ov.has(t.kind)?t.next:t)}else r(e)&&(e=e.next);e!==void 0&&e.next?.kind!==rv&&(e.next={kind:rv,image:`Beginning of definition`,beginLine:e.beginLine,beginColumn:e.beginColumn,next:e.next});break}i=a,a=o,o=vv(e,a),a.next=i}for(;i!==void 0;)a.next=o,o=a,a=i,i=a.next;a.next=o},Uv=e=>{let t=yv(e,1);if(t.kind===O(`LAB`)){let n=1;for(;n!==0;)if(t=vv(e,t),t.kind===O(`LAB`)&&n++,t.kind===O(`RAB`)&&n--,t.kind===tv)return!1;return vv(e,t).kind===O(`IN`)}if(t.kind!==nv)return!1;for(t=vv(e,t);t.kind===O(`COMMA`);){if(t=vv(e,t),t.kind!==nv)return!1;t=vv(e,t)}return t.kind===O(`IN`)},Wv=e=>e.image[1]===`*`?-1:e.image[1]===`+`?-2:Number.parseInt(e.image.slice(1)),Gv=e=>e.proofLevels.at(-1)??-1,Kv=e=>{let t=yv(e,1);return t.image.length<2?!1:t.image[1]===`*`?e.proofLevels.length===0:t.image[1]===`+`?!0:bv(`ProofStepLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`,`ProofStepDotLexeme`)(e)?e.proofLevels.length===0||Gv(e)>=0&&Wv(t)>Gv(e):bv(`BY`,`PROOF`,`OBVIOUS`,`OMITTED`)(e)},qv=(e,t)=>{let n=Wv(t),r=e.proofLevels.length-1,i=e.proofLevels[r-1]??-1,a=e.proofLevels[r]<0;return a&&(e.proofLevels[r]=n<0?i+1:n),n===-1?!0:n===-2?a:a?n>i:e.proofLevels[r]===n},Jv=e=>Y(t=>qv(t,t.token)?void 0:`${Tv(t,t.token)}: ${e}`),Yv=mv([`op_26`,`op_29`,`op_58`,`CASESEP`,`op_61`,`op_112`,`op_113`,`op_114`,`op_115`,`op_116`].map(O)),Xv=mv([...Yv.kinds,O(`op_76`)]),Zv=mv(ov),Qv=mv(sv),$v=mv([`ProofStepLexeme`,`ProofImplicitStepLexeme`,`ProofStepDotLexeme`,`BareLevelLexeme`,`UnnumberedStepLexeme`].map(O)),ey=()=>q(Z({expansion:[K(Yv,`<op_77>`)],semantic:xv}),K(`PrefixOp`,`InfixOp`),Lv),ty=()=>K(G(Z({expansion:[`OpenStart`],semantic:xv}),`OpenExpression`,Iv),G(Z({semantic:xv}),`ExtendableExpr`)),ny=()=>K(G(`<MODULE>`,X(`identifier`),`Identifier`),`Expression`),ry=()=>K(G(Z({semantic:e=>bv(`ASSUME`,`BOXASSUME`)(e)||yv(e,2).kind===O(`COLONCOLON`)&&[O(`ASSUME`),O(`BOXASSUME`)].includes(yv(e,3).kind)}),`AssumeProve`),`NewSymb`,`Expression`),iy=()=>[`JuncItem`,q(Z({semantic:Sv}),`JuncItem`)],ay=e=>Y(t=>{t.expecting=e,wv(t)}),oy=e=>Y(t=>{t.isTerminalProof=e}),sy=(e,...t)=>G(...t.slice(0,-1),X(`==`),`<DEF>`,Y(t=>{Hv(t),t.expecting=e}),t[t.length-1]),Q=(e,t,n)=>({message:e,body:G(...t),exit:n}),cy={CompilationUnit:Q(void 0,[Y(Hv),J(`Prelude`),`Module`]),Prelude:Q(void 0,[`<BEGIN_PRAGMA>`,q(K(`<NUMBER>`,`<IDENTIFIER>`))]),Module:Q(`Module definition`,[X(`---- MODULE`),`BeginModule`,X(`EXTENDS clause or module body`),`Extends`,X(`Module body`),`Body`,X(`==== or more Module body`),`EndModule`]),BeginModule:Q(`Begin module`,[X(`---- MODULE (beginning of module)`),K(`<_BM0>`,`<_BM1>`,`<_BM2>`),ay(`Identifier`),`Identifier`,Y(e=>{e.moduleName??=e.token.image,e.expecting=`----`}),`<SEPARATOR>`]),EndModule:Q(void 0,[`<END_MODULE>`]),Extends:Q(`Extends`,[J(`<EXTENDS>`,ay(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,ay(`Identifier`),`Identifier`))]),Body:Q(`Module body`,[X(`LOCAL, INSTANCE, PROOF, ASSUMPTION, THEOREM, RECURSIVE, declaration, or definition`),q(K(`<SEPARATOR>`,`VariableDeclaration`,`ParamDeclaration`,G(Z({amount:2}),`OperatorOrFunctionDefinition`),`Recursive`,G(Z({amount:2}),`Instance`),G(Z({amount:2}),`Assumption`),G(Z({amount:2}),`Theorem`),G(Z({amount:1}),`Module`,Y(Hv)),G(Z({semantic:e=>bv(`USE`)(e)&&yv(e,2).kind!==O(`ONLY`)||bv(`HIDE`)(e)}),`UseOrHideOrBy`)))]),VariableDeclaration:Q(`variable declaration`,[`<VARIABLE>`,X(`Identifier`),`Identifier`,X(`comma or module body`),q(`<COMMA>`,X(`Identifier`),`Identifier`)]),ParamDeclaration:Q(`Parameter declaration`,[X(`CONSTANT`),`ParamSubDecl`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`)]),ParamSubDecl:Q(`Parameter declaration item`,[`<CONSTANT>`]),Recursive:Q(`Recursive`,[X(`RECURSIVE`),`<RECURSIVE>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X(`,`),q(`<COMMA>`,X(`Identifier, operator or _`),`ConstantDeclarationItems`,X("`,' or `)'"))]),ConstantDeclarationItems:Q(`Constant declaration items`,[X(`Identifier, _ or prefix op`),K(G(`Identifier`,X(`(, comma, or Module Body`),J(Z({amount:2}),`<LBR>`,X(`_`),`<US>`,X(`comma or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`comma or )`)),`<RBR>`)),G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`prefix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),OperatorOrFunctionDefinition:Q(`Definition`,[X(`LOCAL, Identifier or Operator Symbol`),J(`<LOCAL>`),`<DEFBREAK>`,X(`LOCAL, Identifier or Operator Symbol`),K(sy(`Expression`,Z({expansion:[`<IDENTIFIER>`,`<LSB>`]}),`Identifier`,X(`[`),`<LSB>`,X(`Identifier`),`QuantBound`,X(`COMMA or ]`),q(`<COMMA>`,X(`Identifier`),`QuantBound`),`<RSB>`,`Expression`),sy(`Expression`,Z({expansion:[`<IDENTIFIER>`,Qv]}),`PostfixLHS`,`Expression`),sy(`Expression`,Z({expansion:[`<IDENTIFIER>`,Zv]}),`InfixLHS`,`Expression`),sy(`Expression or Instance`,Z({expansion:[`<IDENTIFIER>`,K(`<LBR>`,`<DEF>`)]}),`IdentLHS`,K(`Expression`,`Instantiation`)),sy(`Expression`,`PrefixLHS`,`Expression`))]),IdentifierTuple:Q(`Identifier tuple`,[`<LAB>`,X(`Identifier or >>`),J(`Identifier`,X(`COMMA or >>`),q(`<COMMA>`,X(`COMMA or >>`),`Identifier`,X(`COMMA or >>`))),`<RAB>`]),IdentLHS:Q(`Identifier LHS`,[`Identifier`,X(`( or ==`),J(`<LBR>`,X(`Identifier Declaration, prefix op, _ or )`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`),q(`<COMMA>`,X(`Identifier Declaration, prefix op or _`),K(`IdentDecl`,`SomeFixDecl`),X(`COMMA or )`)),`<RBR>`)]),PrefixLHS:Q(`Prefix LHS`,[Xv,X(`Identifier`),`Identifier`]),InfixLHS:Q(`Infix LHS`,[`Identifier`,Zv,`Identifier`]),PostfixLHS:Q(`Postfix LHS`,[`Identifier`,Qv]),IdentDecl:Q(`Identifier Declation`,[`Identifier`,X(`( or ...`),J(`<LBR>`,X(`_`),`<US>`,X(`COMMA or )`),q(`<COMMA>`,X(`_`),`<US>`,X(`COMMA or )`)),`<RBR>`)]),SomeFixDecl:Q(`Op. Symbol Declaration`,[K(G(`NonExpPrefixOp`,X(`_`),`<US>`),G(`<US>`,X(`infix or postfix operator`),K(G(`InfixOp`,X(`_`),`<US>`),`PostfixOp`)))]),Instance:Q(`Instance`,[X(`LOCAL or instance`),J(`<LOCAL>`),`Instantiation`,X(`COMMA or Module Body`)]),Instantiation:Q(`NonLocalInstance`,[`<INSTANCE>`,ay(`Module identifier`),`Identifier`,X(`WITH or another definition.`),J(`<WITH>`,X(``),`Substitution`,X(``),q(Z({amount:3}),`<COMMA>`,X(``),`Substitution`,X(``)))]),Substitution:Q(`Substitution`,[K(`Identifier`,`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),X(`<-`),`<SUBSTITUTE>`,X(`Expression or Op. Symbol`),`OpOrExpr`]),PrefixOp:Q(void 0,[Yv,Rv]),NonExpPrefixOp:Q(void 0,[Xv,Rv]),InfixOp:Q(`Infix Op`,[Zv,Rv]),PostfixOp:Q(void 0,[Qv,Rv]),Identifier:Q(void 0,[`<IDENTIFIER>`]),Assumption:Q(`Assumption`,[X(`ASSUM...`),K(`<ASSUMPTION>`,`<ASSUME>`),J(Z({amount:2}),J(`<DEFBREAK>`),`Identifier`,X(`==`),`<DEF>`),Y(e=>{Hv(e),e.expecting=`Expression`}),`Expression`]),AssumeProve:Q(`Assume-Prove`,[K(G(`Identifier`,`<COLONCOLON>`,`AssumeProve`),G(K(`<ASSUME>`,`<BOXASSUME>`),X(`Expression, Declaration, or AssumeProve`),ry(),X("PROVE or `,'"),q(`<COMMA>`,X(`Expression, Declaration, or AssumeProve`),ry(),X("PROVE or `,'")),K(`<PROVE>`,`<BOXPROVE>`),X(`Expression`),`Expression`))]),NewSymb:Q(`NEW symbol declaration`,[X(`NEW, CONSTANT, VARIABLE, STATE, ACTION, or TEMPORAL`),K(G(Z({amount:2}),K(G(Z({amount:2}),`<NEW>`,`<CONSTANT>`),`<NEW>`,`<CONSTANT>`),X(`Constant declaration`),K(G(Z({amount:2}),`IdentDecl`,J(`<IN>`,Y(e=>{let t=Dv(e,2);return t.heirs.length>1?`declared symbol with arguments before \\in at ${Tv(e,t.first,t.last)}`:void 0}),X(`Expression`),`Expression`)),`SomeFixDecl`)),G(Z({amount:2}),J(`<NEW>`),`<VARIABLE>`,X(`Identifier`),`Identifier`),G(Z({amount:2}),J(`<NEW>`),K(`<STATE>`,`<ACTION>`,`<TEMPORAL>`),X(`Declaration`),K(`IdentDecl`,`SomeFixDecl`)))]),MaybeBound:Q(`Domain binding`,[J(`<IN>`,X(`Expression`),`Expression`)]),Theorem:Q(`Theorem`,[X(`THEOREM, PROPOSITION`),K(`<THEOREM>`,`<PROPOSITION>`),X(`Identifier, Assume-Prove or Expression`),J(Z({amount:2}),`Identifier`,X(`==`),`<DEF>`),Y(Hv),K(G(Z({amount:3}),Z({semantic:bv(`ASSUME`,`BOXASSUME`)}),`AssumeProve`),`Expression`),J(Z({semantic:Kv}),`Proof`)]),Proof:Q(`Proof`,[Y(e=>{e.proofLevels.push(-1)}),K(G(Z({semantic:e=>bv(`BY`)(e)||yv(e,2).kind===O(`BY`)}),`UseOrHideOrBy`),G(Z({amount:2}),J(`<PROOF>`),K(`<OBVIOUS>`,`<OMITTED>`)),G(J(Z({amount:2}),`<PROOF>`),q(Z({semantic:e=>yv(e,2).kind!==O(`QED`)}),`Step`,X(`a proof step`)),`QEDStep`)),Y(e=>{e.proofLevels.pop()})]),UseOrHideOrBy:Q(`UseOrHideOrBy`,[K(G(J(`<PROOF>`),`<BY>`,oy(!0),J(`<ONLY>`)),G(`<USE>`,oy(!1),J(`<ONLY>`)),G(`<HIDE>`,oy(!1))),X("an expression, `MODULE' or `DEF'"),J(ny(),q(`<COMMA>`,X(`MODULE or expression`),ny(),Y(e=>{e.expecting=e.isTerminalProof?`comma, DEF, or [.]`:`comma, DEF, or proof step`}))),J(`<DF>`,X(`MODULE or expression`),ny(),q(`<COMMA>`,X(`MODULE or expression`),ny(),Y(e=>{e.expecting=e.isTerminalProof?`comma or [.]`:`comma or proof step`}))),Y(e=>{e.isTerminalProof&&(e.expecting=`[.]`)})]),QEDStep:Q(`QED step`,[X(`Step number`),$v,Jv(`QED step's number has bad level.`),X(`QED`),`<QED>`,J(Z({semantic:Kv}),`Proof`)]),Step:Q(`Step`,[X(`Step number`),$v,Jv(`step's number has bad level.`),X(`proof step`),K(G(Z({semantic:bv(`USE`,`HIDE`)}),`UseOrHideOrBy`),G(Z({semantic:bv(`INSTANCE`)}),`Instantiation`),G(Z({semantic:bv(`DEFBREAK`,`DEFINE`)}),`DefStep`),`HaveStep`,`TakeStep`,`WitnessStep`,`PickStep`,`CaseStep`,`AssertStep`),J(Z({semantic:Kv}),Y(e=>{let t=Dv(e,1);return[`PickStep`,`CaseStep`,`AssertStep`].includes(t.kind)?void 0:`${Tv(e,t.first,t.last)}: proof of step that does not take a proof.`}),`Proof`)]),DefStep:Q(`DefStep`,[J(`<DEFINE>`),_v(Z({amount:2}),`OperatorOrFunctionDefinition`)]),HaveStep:Q(`HaveStep`,[`<HAVE>`,X(`expression`),`Expression`]),TakeStep:Q(`TakeStep`,[`<TAKE>`,X(`identifier`),K(G(Z({expansion:[K(G(`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<IN>`),`<LAB>`)]}),`QuantBound`,X(`comma or step`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or proof step`))),G(`Identifier`,X(`comma or proof step`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or proof step`))))]),WitnessStep:Q(`WitnessStep`,[`<WITNESS>`,X(`expression`),`Expression`,q(`<COMMA>`,X(`expression`),`Expression`,X(`comma or colon`))]),PickStep:Q(`PickStep`,[`<PICK>`,X(`identifier`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,X(`comma, or colon`),q(`<COMMA>`,X(`identifier`),`Identifier`,X(`comma or colon`))),G(`QuantBound`,X(`comma or colon`),q(`<COMMA>`,X(`identifier or tuple of identifiers`),`QuantBound`,X(`comma or colon`)))),`<COLON>`,X(`expression`),`Expression`]),CaseStep:Q(`CaseStep`,[`<CASE>`,X(`expression`),`Expression`]),AssertStep:Q(`AssertStep`,[J(`<SUFFICES>`,X(`expression or ASSUME/PROVE`)),K(`Expression`,G(Z({semantic:bv(`ASSUME`,`BOXASSUME`)}),`AssumeProve`))]),ParenthesesExpression:Q(void 0,[K(`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`,`FairnessExpr`)]),OpenExpression:Q(void 0,[K(`SomeQuant`,`SomeTQuant`,`IfThenElse`,`Case`,`LetIn`,`UnboundOrBoundChoose`)]),String:Q(`String`,[`<STRING_LITERAL>`]),Number:Q(void 0,[`<NUMBER_LITERAL>`,J(Z({amount:2}),`<DOT>`,`<NUMBER_LITERAL>`)]),OpArgs:Q(`Optional Arguments`,[`<LBR>`,`OpOrExpr`,q(`<COMMA>`,`OpOrExpr`),`<RBR>`]),OpOrExpr:Q(void 0,[K(G(Z({amount:2,expansion:[K(Xv,Zv,Qv),mv([`COMMA`,`RBR`,`DEFBREAK`,`LOCAL`,`INSTANCE`,`THEOREM`,`ASSUME`,`END_MODULE`,`SEPARATOR`,`_BM0`,`ASSUMPTION`,`CONSTANT`,`VARIABLE`,`RECURSIVE`].map(O))],semantic:xv}),K(`NonExpPrefixOp`,G(`InfixOp`,Y(e=>e.token.image===`\\X`||e.token.image===`\\times`?`${Tv(e,e.token)}: \\X may not be used as an infix operator.`:void 0)),`PostfixOp`)),G(Z({expansion:[`<LAMBDA>`],semantic:xv}),`Lambda`),`Expression`)],e=>{e.node=e.heirs[0]}),ParenExpr:Q(void 0,[`<LBR>`,`Expression`,`<RBR>`]),SomeQuant:Q(`Quantified form`,[K(`<EXISTS>`,`<FORALL>`),K(G(Z({expansion:[`<IDENTIFIER>`,q(`<COMMA>`,`<IDENTIFIER>`),`<COLON>`]}),`Identifier`,q(`<COMMA>`,`Identifier`)),G(`QuantBound`,q(`<COMMA>`,`QuantBound`))),`<COLON>`,`Expression`]),SomeTQuant:Q(`Bound Quantified Expression`,[K(`<T_EXISTS>`,`<T_FORALL>`),`Identifier`,q(`<COMMA>`,`Identifier`),`<COLON>`,`Expression`]),QuantBound:Q(`Quant Bound`,[K(`IdentifierTuple`,G(`Identifier`,q(`<COMMA>`,`Identifier`,X(`, or \\in`)))),`<IN>`,`Expression`]),BraceCases:Q(`Some { } form`,[`<LBC>`,J(K(G(Z({semantic:Uv}),K(`IdentifierTuple`,`Identifier`),X(`\\in`),`<IN>`,`Expression`,X(`':', ',' or '}'`),J(K(G(`<COLON>`,`Expression`),_v(`<COMMA>`,`Expression`)))),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COMMA>`]}),`Expression`,q(`<COMMA>`,`Expression`)),G(Z({expansion:[K(`IdentifierTuple`,`<IDENTIFIER>`),`<COLON>`]}),`Expression`,`<COLON>`,`QuantBound`,q(`<COMMA>`,`QuantBound`)),G(`Expression`,J(K(G(`<COLON>`,Y(e=>{let t=Dv(e,2);return t.kind===`InfixExpr`&&t.heirs[1].first.image===`\\in`?`Form {a \\in b : c \\in d }, at line ${e.token.beginLine}, is not allowed`:void 0}),`QuantBound`,q(`<COMMA>`,`QuantBound`)),_v(`<COMMA>`,`Expression`)))))),`<RBC>`]),SBracketCases:Q(`Some [] Form`,[`<LSB>`,K(G(Z({semantic:Uv}),`QuantBound`,q(`<COMMA>`,`QuantBound`),`<MAPTO>`,`Expression`,`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<MAPTO>`]}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({semantic:e=>yv(e,2).kind===O(`MAPTO`)&&cv.has(yv(e,1).kind)}),Y(e=>{yv(e,1).kind=nv}),`FieldVal`,q(`<COMMA>`,`FieldVal`),`<RSB>`),G(Z({expansion:[`<IDENTIFIER>`,`<COLON>`]}),`FieldSet`,q(`<COMMA>`,`FieldSet`),`<RSB>`),G(`Expression`,K(G(q(`<COMMA>`,`Expression`),`<RSB>`,Y(e=>{let t=e.frames[e.frames.length-1];t.node=Ev(`FcnAppl`,t.heirs),e.lastOperator=fv})),G(`<ARROW>`,`Expression`,`<RSB>`),G(`<EXCEPT>`,`ExceptSpec`,q(`<COMMA>`,`ExceptSpec`),`<RSB>`),G(`<ARSB>`,`ReducedExpression`))))]),FieldVal:Q(`Field Value`,[`Identifier`,`<MAPTO>`,`Expression`]),FieldSet:Q(`Field Set`,[`Identifier`,`<COLON>`,`Expression`]),ExceptSpec:Q(`Except Spec`,[`<BANG>`,_v(`ExceptComponent`,X(`= or ,`)),`<EQUALS>`,`Expression`]),ExceptComponent:Q(`Except Component`,[K(G(`<DOT>`,Y(wv),`Identifier`,Y(e=>{e.token.image===`@`&&e.pushedErrors.push(`@ used in !.@`)})),G(`<LSB>`,`Expression`,q(`<COMMA>`,`Expression`),`<RSB>`))]),TupleOrAction:Q(`Some << -- >> or >>_ Form`,[`<LAB>`,J(`Expression`,q(`<COMMA>`,`Expression`)),K(`<RAB>`,G(`<ARAB>`,`ReducedExpression`))]),NoOpExtension:Q(void 0,[`Identifier`,J(Z({amount:2}),`OpArgs`),K(G(`<BANG>`,`NoOpExtension`),Y(e=>{e.isFairnessHooked=e.token.kind===O(`RBR`)}))]),ReducedExpression:Q(`restricted form of expression`,[K(`NoOpExtension`,`ParenExpr`,`BraceCases`,`SBracketCases`,`TupleOrAction`)]),FairnessExpr:Q(`Fairness Expression`,[Y(e=>{e.isFairnessHooked=!1,e.isFairnessParenthesized.push(!1)}),K(`<WF>`,`<SF>`),`ReducedExpression`,J(Z({amount:2}),`<LBR>`,`Expression`,`<RBR>`,Y(e=>{e.isFairnessParenthesized[e.isFairnessParenthesized.length-1]=!0}))],(e,t)=>t.isFairnessParenthesized.pop()||t.isFairnessHooked?void 0:`Ill-structured fairness expression at line ${e.heirs[0].first.beginLine}, column ${e.heirs[0].first.beginColumn}`),IfThenElse:Q(`IF THEN ELSE`,[`<IF>`,`Expression`,`<THEN>`,`Expression`,`<ELSE>`,`Expression`]),Case:Q(`CASE Expression`,[`<CASE>`,`CaseArm`,q(Z({semantic:e=>Cv(e)&&yv(e,2).kind!==O(`OTHER`)}),`<CASESEP>`,`CaseArm`),J(Z({semantic:Cv}),`<CASESEP>`,`OtherArm`)]),CaseArm:Q(`Case Arm`,[`Expression`,`<ARROW>`,`Expression`]),OtherArm:Q(`Case Other Arm`,[`<OTHER>`,`<ARROW>`,`Expression`]),LetIn:Q(`Case Other Arm`,[`<LET>`,`LetDefinitions`,`<LETIN>`,`Expression`]),LetDefinitions:Q(`Let Definitions`,[_v(K(`OperatorOrFunctionDefinition`,`Recursive`))]),Junctions:Q(`AND-OR Junction`,[Y(e=>{let t=yv(e,1);e.junctions.push({kind:t.kind,column:t.beginColumn})}),K(G(Z({expansion:[`<OR>`]}),...iy()),G(Z({expansion:[`<AND>`]}),...iy())),Y(e=>{e.junctions.pop()})]),JuncItem:Q(`Junction Item`,[K(`<OR>`,`<AND>`),`Expression`],(e,t)=>{let n=Vv(t,e.heirs[1]);return n&&`Item at ${Tv(t,n.first,n.last)} is not properly indented inside conjunction or disjunction list item at ${Tv(t,e.heirs[0].first,e.heirs[1].last)}`}),UnboundOrBoundChoose:Q(`(Un)Bounded Choose`,[`<CHOOSE>`,K(`Identifier`,`IdentifierTuple`),`MaybeBound`,`<COLON>`,`Expression`]),Lambda:Q(`Lambda`,[`<LAMBDA>`,X(`Identifier`),`Identifier`,X("`,' or `:'"),q(`<COMMA>`,X(`Identifier`),`Identifier`,X("`,' or `:'")),`<COLON>`,X(`Expression`),`Expression`]),Expression:Q(`Expression`,[Y(e=>{e.operatorStacks.push([])}),ey(),ty()],(e,t)=>{let n=Ov(t);n.push({node:e.heirs[0],operator:pv});let r=Pv(t);return e.node=n[0].node,t.operatorStacks.pop(),r}),ExtendableExpr:Q(`ExtendableExpr`,[K(G(Z({expansion:[K(`<AND>`,`<OR>`)],semantic:e=>{let t=e.operatorStacks.at(-1)?.at(-1);return t===void 0||t.operator!==void 0&&t.operator.fix!==`postfix`}}),`Junctions`),`ParenthesesExpression`,`PrimitiveExp`),Iv,q(K(G(Z({expansion:[`PostfixOp`],semantic:xv}),`PostfixOp`,Lv),G(Z({expansion:[`<DOT>`],semantic:xv}),`<DOT>`,Y(wv),Z({semantic:xv}),`Identifier`,Y(e=>{let t=Ov(e);t[t.length-1].operator!==void 0&&Mv(t,t.length),t[t.length-1]={node:Ev(`RecordComponent`,[t[t.length-1].node,Dv(e,2),Dv(e,1)]),operator:void 0}})),G(Z({expansion:[`<LSB>`],semantic:xv}),X(`function argument`),`SBracketCases`,Fv(e=>e.kind===`FcnAppl`)))),J(K(G(Z({expansion:[`InfixOp`],semantic:xv}),`InfixOp`,Lv,ey(),ty()),G(Z({expansion:[`<COLONCOLON>`],semantic:xv}),`<COLONCOLON>`,Y(e=>{let t=Ov(e);if(!Bv(t[t.length-1].node))return`\`::' at ${Tv(e,e.token)} does not follow a label.`;t.pop()}),`Expression`,Y(e=>{let t=Ov(e),n=Dv(e,1),r=t.at(-1)?.operator;if((n.kind===`InfixExpr`||n.kind===`PostfixExpr`)&&r!==void 0&&e.lastOperator!==void 0&&!Av(r,e.lastOperator)){let t=Dv(e,3);return`Removing label at ${Tv(e,t.first,t.last)} would change expression parsing.`}t.push({node:Ev(`Label`,[Dv(e,3),Dv(e,2),n]),operator:void 0})}))))]),PrimitiveExp:Q(`Primitive expression`,[K(G(Z({expansion:[`String`],semantic:xv}),`String`),G(Z({expansion:[`<NUMBER_LITERAL>`],semantic:xv}),`Number`),G(K(`Identifier`,G(K(`<ProofStepLexeme>`,`<ProofImplicitStepLexeme>`),Y(e=>Gv(e)<0&&e.proofLevels.length<=1?`${Tv(e,e.token)}: Step number used outside proof.`:e.token.image[1]===`+`?`${Tv(e,e.token)}: <+> step number used in an expression.`:void 0)),`InfixOp`,`PostfixOp`,G(Z({expansion:[`<op_76>`]}),`NonExpPrefixOp`)),J(Z({amount:2}),`OpArgs`),q(`BangExt`)))],e=>{let t=e.heirs[0];e.node=t.kind===`String`||t.kind===`Number`?t:zv(e.heirs)===void 0?e.heirs.length===1?Ev(`GeneralId`,e.heirs):void 0:Ev(`OpApplication`,e.heirs)}),BangExt:Q(`Bang Extension`,[`<BANG>`,K(G(K(G(Z({expansion:[`Identifier`],semantic:e=>yv(e,1).image!==`@`}),`Identifier`),`NonExpPrefixOp`,`InfixOp`,`PostfixOp`),J(Z({amount:2}),`OpArgs`)),`OpArgs`,`StructOp`)]),StructOp:Q(`StructOp`,[X("`<<' , `>>' , `:' , `@' , or number"),K(`<LAB>`,`<RAB>`,`<COLON>`,`Number`,G(Z({semantic:e=>yv(e,1).image===`@`}),`<IDENTIFIER>`))],(e,t)=>{let n=e.heirs[0];return n.kind===`Number`&&n.heirs.length>1?`Illegal structural term at ${Tv(t,n.first,n.last)}`:void 0}),OpenStart:Q(void 0,[K(`<CASE>`,`<CHOOSE>`,`<EXISTS>`,`<FORALL>`,`<IF>`,`<LET>`,`<T_EXISTS>`,`<T_FORALL>`)])},ly=/* @__PURE__ */ new Map,uy=e=>{let t=ly.get(e);if(t)return t;let n={first:/* @__PURE__ */ new Set,isNullable:!0,hasSemanticStart:!1},r=e=>{let t=uy(e);for(let e of t.first)n.first.add(e);return n.hasSemanticStart||=t.hasSemanticStart,t.isNullable};if(e.type===`tokens`)n.first=e.kinds,n.isNullable=!1;else if(e.type===`call`)Object.assign(n,uy(cy[e.name].body));else if(e.type===`lookahead`)n.hasSemanticStart=e.semantic!==void 0;else if(e.type===`sequence`){let t=e.units[0];n.hasSemanticStart=t?.type===`lookahead`&&t.semantic!==void 0,n.isNullable=e.units.every((e,t)=>t===0&&e.type===`lookahead`||r(e))}else e.type===`choice`?n.isNullable=e.alternatives.map(r).some(Boolean):e.type!==`action`&&(n.isNullable=r(e.body)||e.type!==`oneOrMore`);return ly.set(e,n),n},dy=(e,t)=>{e.isLookingAhead=!0;let n=t(e);return e.isLookingAhead=!1,n},fy=(e,t)=>{if(e.scanPosition===e.lastPosition&&(e.remaining--,e.lastPosition=vv(e,e.scanPosition)),e.scanPosition=vv(e,e.scanPosition),e.isRescanning){let t=0,n=e.token;for(;n!==void 0&&n!==e.scanPosition;)t++,n=n.next;n!==void 0&&t<100&&(e.farthestRescan=Math.max(e.farthestRescan,t))}return t.has(e.scanPosition.kind)?e.remaining===0&&e.scanPosition===e.lastPosition?`done`:`matched`:`failed`},py=(e,t)=>{if(t.type===`tokens`)return fy(e,t.kinds);if(t.type===`call`)return py(e,cy[t.name].body);if(t.type===`action`)return`matched`;if(t.type===`lookahead`)return t.semantic===void 0||dy(e,t.semantic)?`matched`:`failed`;if(t.type===`sequence`){for(let[n,r]of t.units.entries()){if(n===0&&r.type===`lookahead`)continue;let t=py(e,r);if(t!==`matched`)return t}return`matched`}let n=e.scanPosition;if(t.type===`choice`){for(let r of t.alternatives){let t=r.units[0],i=t?.type!==`lookahead`||t.semantic===void 0||dy(e,t.semantic)?py(e,r):`failed`;if(i!==`failed`)return i;e.scanPosition=n}return`failed`}let r=py(e,t.body);if(r===`failed`)return e.scanPosition=n,t.type===`oneOrMore`?`failed`:`matched`;if(r===`done`||t.type===`optional`)return r;for(;;){let n=e.scanPosition,r=py(e,t.body);if(r===`done`)return r;if(r===`failed`)return e.scanPosition=n,`matched`}},my=(e,t,n)=>{e.remaining=t,e.scanPosition=e.token,e.lastPosition=e.token;let r=py(e,n)!==`failed`,i={generation:e.generation+t-e.remaining,first:e.token,amount:t},a=e.calls.get(n)??[],o=a.findIndex(t=>t.generation<=e.generation);return o===-1?a.push(i):a[o]=i,e.calls.set(n,a),r},hy=(e,t)=>t.findIndex(t=>{let n=t.units[0],r=n?.type===`lookahead`?n:void 0,i=r?.amount??1,a=r?.expansion??t,o=r?.semantic;return i===0||uy(a).isNullable?o===void 0||o(e):i===1&&o===void 0&&!uy(a).hasSemanticStart?uy(a).first.has(yv(e,1).kind)?!0:(e.failedSwitchGeneration=e.generation,!1):my(e,i,a)&&(o===void 0||o(e))}),gy=e=>{e.isRescanning=!0;for(let[t,n]of e.calls)for(let r of n.filter(t=>t.generation>e.generation))if(e.remaining=r.amount,e.scanPosition=r.first,e.lastPosition=r.first,py(e,t)===`done`)break;e.isRescanning=!1;let t=Math.max(+(e.failedSwitchGeneration===e.generation),e.farthestRescan),n=[],r=vv(e,e.token),i=r;for(let r=0;r<t;r++){if(i.kind===tv){n.push(`<EOF>`);break}n.push(i.image),r<t-1&&(i=vv(e,i))}return`Encountered "${n.join(` `)}" at line ${r.beginLine}, column ${r.beginColumn} and token "${et(e.token.image)}" `},_y=(e,t)=>{let n=e.expecting===``?``:`Was expecting "${e.expecting}"\n`,r=e.messages.slice(-5).reverse().map(e=>`${e.name} starting at line ${e.token.beginLine}, column ${e.token.beginColumn}.\n`).join(``);return e.report=`${n}${t??gy(e)}\n\nResidual stack trace follows:\n${r}`,!1},vy=(e,t)=>{let n=vv(e,e.token);return t.has(n.kind)?(e.token=n,e.generation++,e.frames[e.frames.length-1].heirs.push({kind:`token`,heirs:[],first:n,last:n}),!0):(e.failedSwitchGeneration=e.generation,_y(e))},yy=(e,t)=>{let n=cy[t];n.message!==void 0&&(e.messages.push({name:n.message,token:yv(e,1)}),e.expecting=``);let r={heirs:[],node:void 0};if(e.frames.push(r),!by(e,n.body))return!1;e.frames.pop(),n.message!==void 0&&(e.messages.pop(),e.expecting=``);let i=n.exit?.(r,e);if(typeof i==`string`)return _y(e,i);let a=r.node??(r.heirs.length===0?void 0:Ev(t,r.heirs));return a!==void 0&&e.frames.at(-1)?.heirs.push(a),!0},by=(e,t)=>{if(t.type===`tokens`)return vy(e,t.kinds);if(t.type===`call`)return yy(e,t.name);if(t.type===`action`){let n=t.run(e);return n===void 0||_y(e,n)}if(t.type===`lookahead`)return t.semantic===void 0||t.semantic(e)||_y(e);if(t.type===`sequence`)return t.units.every((t,n)=>n===0&&t.type===`lookahead`||by(e,t));if(t.type===`choice`){let n=hy(e,t.alternatives);return n===-1?_y(e):by(e,t.alternatives[n])}if(t.type===`oneOrMore`&&!by(e,t.body))return!1;if(t.type===`optional`)return hy(e,[t.body])===-1||by(e,t.body);for(;hy(e,[t.body])===0;)if(!by(e,t.body))return!1;return!0},xy=e=>{let t=Qe(e),n={kind:tv,image:``,beginLine:0,beginColumn:0,next:void 0},r={readToken:()=>{let e=t();return typeof e==`string`?(r.lexicalError??=e,{...n,next:void 0}):e},lexicalError:void 0,token:n,generation:0,failedSwitchGeneration:-1,scanPosition:n,lastPosition:n,remaining:0,isLookingAhead:!1,isRescanning:!1,farthestRescan:0,calls:/* @__PURE__ */ new Map,expecting:`nothing`,messages:[],pushedErrors:[],moduleName:void 0,junctions:[],frames:[],operatorStacks:[],lastOperator:void 0,proofLevels:[],isTerminalProof:!1,isFairnessHooked:!1,isFairnessParenthesized:[],report:void 0},i=by(r,{type:`call`,name:`CompilationUnit`});if(r.lexicalError!==void 0)return r.lexicalError;let a=[...r.pushedErrors,...i||r.report===void 0?[]:[`***Parse Error***\n${r.report}`]];return a.length===0?void 0:a.join(`
|
|
1783
|
-
`)},Sy={low:15,high:15},Cy={low:16,high:16},$=(e,t,n)=>({low:e,high:t,isAssociative:n}),wy=new Map([[`=>`,$(1,1,!1)],[`<=>`,$(2,2,!1)],[`~>`,$(2,2,!1)],[`-+->`,$(2,2,!1)],[`/\\`,$(3,3,!0)],[`\\/`,$(3,3,!0)],...(/* @__PURE__ */ `=.#.<.>.<=.>=.\\in.\\notin.\\subseteq.\\subset.\\supseteq.\\supset.\\sqsubseteq.\\sqsupseteq.\\sqsubset.\\sqsupset.\\prec.\\preceq.\\succ.\\succeq.\\sim.\\simeq.\\approx.\\cong.\\asymp.\\doteq.\\propto.\\ll.\\gg.|-.-|.|=.=|.:=.::=`.split(`.`)).map(e=>[e,$(5,5,!1)]),[`\\cdot`,$(5,14,!0)],[`@@`,$(6,6,!0)],[`:>`,$(7,7,!1)],[`<:`,$(7,7,!1)],[`\\cup`,$(8,8,!0)],[`\\cap`,$(8,8,!0)],[`\\`,$(8,8,!1)],[`..`,$(9,9,!1)],[`...`,$(9,9,!1)],[`##`,$(9,13,!0)],[`$`,$(9,13,!0)],[`$$`,$(9,13,!0)],[`??`,$(9,13,!0)],[`!!`,$(9,13,!1)],[`\\sqcap`,$(9,13,!0)],[`\\sqcup`,$(9,13,!0)],[`\\uplus`,$(9,13,!0)],[`\\wr`,$(9,14,!1)],[`+`,$(10,10,!0)],[`++`,$(10,10,!0)],[`(+)`,$(10,10,!0)],[`\\oplus`,$(10,10,!0)],[`%`,$(10,11,!1)],[`%%`,$(10,11,!0)],[`|`,$(10,11,!0)],[`||`,$(10,11,!0)],[`\\X`,$(10,13,!1)],[`-`,$(11,11,!0)],[`--`,$(11,11,!0)],[`(-)`,$(11,11,!0)],[`\\ominus`,$(11,11,!0)],[`*`,$(13,13,!0)],[`**`,$(13,13,!0)],[`/`,$(13,13,!1)],[`//`,$(13,13,!1)],[`\\div`,$(13,13,!1)],[`\\o`,$(13,13,!0)],[`(.)`,$(13,13,!0)],[`\\odot`,$(13,13,!0)],[`(/)`,$(13,13,!1)],[`\\oslash`,$(13,13,!1)],[`(\\X)`,$(13,13,!0)],[`\\otimes`,$(13,13,!0)],[`&`,$(13,13,!0)],[`&&`,$(13,13,!0)],[`\\star`,$(13,13,!0)],[`\\bullet`,$(13,13,!0)],[`\\bigcirc`,$(13,13,!0)],[`^`,$(14,14,!1)],[`^^`,$(14,14,!1)]]),Ty=/* @__PURE__ */ new Set([`^+`,`^*`,`^#`]),Ey=/* @__PURE__ */ new Set([...Ty,`'`]),Dy=/* @__PURE__ */ new Set([`-`,`~`,`-.`]),Oy=/* @__PURE__ */ new Set([`-.`,`~`,`[]`,`<>`,`ENABLED`,`UNCHANGED`,`SUBSET`,`UNION`,`DOMAIN`]),ky=/* @__PURE__ */ new Set([`-`,`~`,`/\\`,`\\/`,`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`]),Ay=/* @__PURE__ */ new Set([`+`,`-`,`/`,`\\X`]),jy=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`ENABLED`,`UNCHANGED`,`[]`,`<>`,...Ey]),My=/* @__PURE__ */ new Set([`<<`,`>>`,`:`,`@`,`(`]),Ny=/* @__PURE__ */ new Set([`ASSUME`,`ASSUMPTION`,`AXIOM`,`CONSTANT`,`CONSTANTS`,`COROLLARY`,`INSTANCE`,`LEMMA`,`LOCAL`,`PROPOSITION`,`RECURSIVE`,`THEOREM`,`VARIABLE`,`VARIABLES`]),Py=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),Fy=/* @__PURE__ */ new Set([`BY`,`PROOF`,`OBVIOUS`,`OMITTED`]),Iy=/* @__PURE__ */ new Set([`Qed`,`Pick`,`Case`,`Assert`]),Ly=/* @__PURE__ */ new Set(/* @__PURE__ */ `, . _ ( ) [ ] { } << >> ]_ >>_ == ! @ : :: ; -> <- |-> \\A \\AA \\E \\EE \\forall \\exists WF_ SF_ (*{ }*)`.split(` `)),Ry=/* @__PURE__ */ new Set([``,`*`,`-`]),zy={Obvious:`n OBVIOUS`,Omitted:`n OMITTED`,By:` BY`},By=(e,t)=>e.line-t.line||e.column-t.column,Vy=(e,t)=>({start:By(e.start,t.start)<=0?e.start:t.start,stop:By(e.stop,t.stop)>=0?e.stop:t.stop}),Hy=e=>({start:{line:e.start.line,column:e.start.column},stop:{line:e.end.line,column:e.end.column+1}}),Uy=(e,t,n=`Proof.Parser`)=>new r(e,void 0,{reason:e,line:t.start.line,column:t.start.column,isEnd:!1,proof:{stop:t.stop,exception:n}}),Wy=/* @__PURE__ */ new Set([`CASE`,`CHOOSE`,`DOMAIN`,`ENABLED`,`IF`,`LAMBDA`,`LET`,`MODULE`,`SF_`,`SUBSET`,`UNCHANGED`,`UNION`,`WF_`]),Gy=/* @__PURE__ */ new Map([[`CONSTANT`,`Constant`],[`CONSTANTS`,`Constant`],[`VARIABLE`,`Variable`],[`VARIABLES`,`Variable`],[`STATE`,`State`],[`ACTION`,`Action`],[`ACTIONS`,`Action`],[`TEMPORAL`,`Temporal`],[`TEMPORALS`,`Temporal`]]),Ky=/* @__PURE__ */ new Set([`NEW`,...Gy.keys()]),qy=/* @__PURE__ */ new Set([`(`,`[`,`{`,`<<`]),Jy=/* @__PURE__ */ new Set([`)`,`]`,`}`,`>>`,`]_`,`>>_`]),Yy=/* @__PURE__ */ new Set([`TRUE`,`FALSE`,`BOOLEAN`,`STRING`]),Xy=e=>e.kind===`Prime`||e.kind===`Product`||(e.kind===`And`||e.kind===`Or`)&&!e.isBulleted||e.kind===`Apply`&&(e.args.length===2?wy.has(e.operator):Ty.has(e.operator)),Zy=e=>(e.text===`/\\`||e.text===`\\/`)&&e.spelling!==`\\land`&&e.spelling!==`\\lor`,Qy=e=>wy.has(e)||Ty.has(e)||e===`-.`,$y=(e,t,n)=>{switch(e){case`ENABLED`:return{kind:`Enabled`,expression:t,location:n};case`UNCHANGED`:return{kind:`Unchanged`,expression:t,location:n};case`[]`:return{kind:`Always`,expression:t,location:n};case`<>`:return{kind:`Eventually`,expression:t,location:n};case`'`:return{kind:`Prime`,expression:t,location:n};default:return{kind:`Apply`,operator:e,args:[t],location:n}}},eb=(e,t)=>{let n=RegExp(`^-{4,}\\s*MODULE\\s+${t}\\s*-{3,}$`),r=e.replace(/\r?\n$/,``).split(/\r?\n/),i=r.findIndex(e=>n.test(e));if(i===-1)return;let a=r.findIndex((e,t)=>t>i&&e.startsWith(`====`));return`${r.slice(i,a===-1?void 0:a+1).join(`
|
|
1784
|
-
`)}\n`},tb=(e,t,n=ke(e,t===`tlapm`))=>{let i=t===`tlapm`,a=i?n:n.map(we),o=0,s=[],c,l,u=[],d=/* @__PURE__ */ new Set,f=[],p=[],m=e=>u[u.length-1].has(e),g=e=>({line:e.line,column:i&&e.kind===`String`?e.endColumn:e.column,range:void 0}),ee=[],_=[],v=[],y=(e,t=o-1)=>{let n=e===t?v[e]:void 0;if(n)return n;let r=a[t];ee[e]??=g(a[e]),_[t]??={line:r.line,column:r.endColumn};let i={module:p[0].name,start:ee[e],end:_[t]};return e===t&&(v[e]=i),i},b=(e,t)=>(e.location.range=y(t),e),te=(e=0)=>a[Math.min(o+e,a.length-1)],x=(e=0)=>{let t=te(e),n=s[s.length-1];return n===void 0||n===-1||t.kind===`End`?t:t.column<=n?{...t,kind:`End`,text:``}:t},ne=e=>e.kind===`End`?`end of input`:JSON.stringify(e.text),ie=0,ae=e=>{let t=a.slice(ie,o).find(e=>e.text===`==`&&e.kind!==`String`);return t?{line:t.line,column:t.endColumn+1}:e},oe=e=>i&&(e.kind===`Keyword`||Yy.has(e.text)),se=e=>{let t=a.findLast(t=>t.kind!==`End`&&(t.line<e.line||t.line===e.line&&t.column<e.column));return t?{line:t.line,column:t.endColumn+1}:e},ce=e=>/^-{4,}$/.test(e.text)?`----`:/^={4,}$/.test(e.text)?`====`:Ly.has(e.text)||e.kind===`Number`||e.kind===`Decimal`?e.text:e.kind===`String`?JSON.stringify(e.text):e.kind===`Step`?e.text:oe(e)?`keyword ${e.text}`:e.kind===`Identifier`?`identifier ${e.text}`:`operator ${e.text}`,le=(e,t=te(),n)=>{let i=a[a.length-1],o=t.line===i.line&&t.column===i.column;return new r(`${e} at line ${t.line}, column ${t.column}`,void 0,ue(e,t,o,n))},ue=(e,t,n,r)=>{if(i&&n){let e=a[a.length-1];return{reason:`Unexpected EOF`,...ae(se(e)),isEnd:n}}return i&&r?{reason:`Unexpected ${ce(r)}`,...se(r),isEnd:n}:{reason:e,line:t.line,column:t.column,isEnd:n}},de=(e,t=te())=>le(e,t,t),fe=e=>(e.kind===`Identifier`||e.kind===`Keyword`||e.kind===`Operator`&&e.text===`_`)&&!oe(e),S=(e,t=0)=>{let n=x(t);return n.text===e&&n.kind!==`String`&&n.kind!==`End`},C=()=>{let e=x();if(e.kind===`End`)throw le(`Unexpected end of expression`);return o++,e},w=e=>S(e)?(o++,!0):!1,T=e=>{if(!S(e))throw de(`Expected ${JSON.stringify(e)} but found ${ne(x())}`);return C()},me=()=>{let e=x();if(e.kind!==`Identifier`)throw de(`Expected an identifier but found ${ne(e)}`);if(oe(e))throw de(`Unexpected keyword ${e.text}`);return o++,e.text},he=()=>{let e=o;return{name:me(),range:y(e)}},ge=e=>({names:e.map(e=>e.name),ranges:e.map(e=>e.range)}),_e=()=>{let e=x();return e.kind!==`String`&&(Oy.has(e.text)||wy.has(e.text)||Ey.has(e.text))?(o++,e.text):me()},ve=!1,ye=()=>x().kind===`Identifier`||!fe(x())?me():(ve=!0,C().text),be=e=>{if(!i)return e();s.push(-1);let t=e();return s.pop(),t},E=(e,t=`,`)=>{let n=[e()];for(;w(t);)n.push(e());return n},xe=()=>{if(S(`<<`)){let e=1;for(;x(e).kind===`Identifier`||S(`,`,e);)e++;return S(`>>`,e)&&S(`\\in`,e+1)}let e=0;for(;x(e).kind===`Identifier`;){if(S(`\\in`,e+1))return!0;if(!S(`,`,e+1))return!1;e+=2}return!1},Se=()=>{if(S(`::`))return!0;if(!S(`(`))return!1;let e=1;for(;x(e).kind===`Identifier`&&S(`,`,e+1);)e+=2;return x(e).kind===`Identifier`&&S(`)`,e+1)&&S(`::`,e+2)},D=()=>{if(!w(`<<`)){let e=he();return{kind:`Name`,name:e.name,ranges:[e.range]}}let e=ge(S(`>>`)?[]:E(he));return T(`>>`),{kind:`Tuple`,names:e.names,ranges:e.ranges}},Ce=()=>E(()=>{let e=E(D);T(`\\in`);let t=k();return e.map(e=>({pattern:e,set:t}))}).flat(),Te=()=>{let e=x();if(i&&Yy.has(e.text)){let t=o;C();let n={kind:`Identifier`,name:e.text,location:g(e)};return{subscript:b(n,t),lastArgs:[]}}let t=i&&(e.kind===`Number`||e.kind===`String`||S(`@`));if(e.kind===`Identifier`){let t=o,n=[],r=[],a=e=>(r.push(y(o,o)),n.push(me()),e&&S(`(`)?je():[]),s=[a(!i)];for(;S(`!`)&&x(1).kind===`Identifier`;)C(),s.push(a(!0));let c=s.slice(0,-1),l=g(e);l.range={...y(t),end:r[r.length-1].end};let u=n.join(`!`);return{subscript:c.every(e=>e.length===0)?{kind:`Identifier`,name:u,location:l}:{kind:`Apply`,operator:u,args:c.flat(),argumentCounts:[...c.map(e=>e.length),0],argumentsRange:l.range,selectorRanges:r,location:l},lastArgs:s[s.length-1]}}if(S(`<<`)||S(`(`)||S(`{`)||S(`[`)||t){let e=o,t=Be();return{subscript:t.location.range?t:b(t,e),lastArgs:[]}}throw de(`Expected a subscript but found ${ne(e)}`)},Ee=e=>{let t=x(1),n=x(2);return t.kind===`Identifier`&&n.text===`==`?!0:t.line===e.line?!1:t.text===`-.`||t.kind===`Identifier`&&(n.text===`(`||n.text===`[`||n.kind===`Operator`&&S(`==`,Ey.has(n.text)?3:4))},De=e=>{let t=x(1);return t.kind===`End`||t.kind===`ModuleEnd`||t.kind===`Separator`||S(`,`,1)||S(`)`,1)||t.kind===`Keyword`&&Ny.has(t.text)||Ee(e)},Oe=()=>{let e=x(),t=e.kind===`Operator`&&(wy.has(e.text)||Dy.has(e.text))&&De(e);if(i&&e.kind!==`String`&&(Dy.has(e.text)||jy.has(e.text)&&e.text!==`'`&&!Ty.has(e.text)||Ay.has(e.text)&&x(-1).text===`(`&&x(-1).line===e.line&&x(-1).endColumn+1===e.column&&x(1).text===`)`&&x(1).line===e.line&&x(1).column===e.endColumn+1)&&De(e))throw le(`incomplete expression`,e);if(t&&!i&&e.text===`\\X`&&e.spelling!==`×`)throw le(`\\X may not be used as an infix operator`,e);if(t)return o++,b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:g(e)},o-1);if(e.kind!==`String`&&jy.has(e.text)&&De(e)){o++;let t=g(e);if(Ty.has(e.text))return b({kind:`OperatorReference`,operator:e.text,spelling:e.spelling,location:t},o-1);let n={kind:`Identifier`,name:`argument`,location:t};return b({kind:`Lambda`,params:[n.name],body:$y(e.text,n,t),operator:e.text,location:g(e)},o-1)}if(S(`LAMBDA`)){let t=o;C();let n=ge(E(he));T(`:`);let r=k();return b({kind:`Lambda`,params:n.names,paramRanges:n.ranges,body:r,location:g(e)},t)}return k()},Ae,je=()=>be(()=>{let e=o;T(`(`);let t=E(Oe);return T(`)`),Ae=y(e),t}),Me=()=>{let e=C();s.push(e.column);let t=[k()];for(;Zy(te())&&te().text===e.text&&te().column===e.column;)o++,t.push(k());return s.pop(),{kind:e.text===`/\\`?`And`:`Or`,operands:t,isBulleted:!0,location:g(e)}},O=e=>be(()=>{let t=g(e),n=x().kind===`Identifier`,r=S(`|->`,1)&&(n||fe(x()));if(r||n&&S(`:`,1)){let e=r?`Record`:`RecordSet`,i=e=>{let t=o,n=g(x()),i=e();return n.range=y(t),T(r?`|->`:`:`),{name:i,value:k(),location:n}},a=[i(()=>n?me():C().text),...w(`,`)?E(()=>i(me)):[]];return T(`]`),{kind:e,fields:a,location:t}}if(xe()){let e=o,n=Ce();if(!i||S(`|->`)){T(`|->`);let e=k();return T(`]`),{kind:`FunctionConstruction`,bounds:n,body:e,location:t}}o=e}let a=k();if(w(`->`)){let e=k();return T(`]`),{kind:`FunctionSet`,domain:a,range:e,location:t}}if(w(`EXCEPT`)){let e=E(()=>{T(`!`);let e=[];for(;S(`.`)||S(`[`);)if(w(`.`)){if(!fe(x()))throw de(`Expected a field name but found ${ne(x())}`);if(!i&&S(`@`))throw de(`@ used in !.@`);e.push({kind:`Field`,name:C().text})}else T(`[`),e.push({kind:`Index`,args:E(()=>k())}),T(`]`);return T(`=`),{path:e,value:k()}});return T(`]`),{kind:`Except`,function:a,updates:e,location:t}}if(!i&&!S(`]_`)){let e=[a];for(;w(`,`);)e.push(k());return T(`]`),{kind:`Bracket`,args:e,location:t}}return T(`]_`),{kind:`BoxAction`,action:a,subscript:Te().subscript,location:t}}),Ne=()=>{let e=o,t=b(He(),e),n=g(C());return b({kind:`Apply`,operator:`\\in`,args:[t,k()],location:n},e)},Pe=e=>be(()=>{let t=g(e);if(w(`}`))return{kind:`SetEnumeration`,elements:[],location:t};if(xe()&&(x(1).text===`\\in`||S(`<<`))){let e=o,n=D();T(`\\in`);let r=k();if(w(`:`)){let e=k();return T(`}`),{kind:`SetFilter`,bound:{pattern:n,set:r},predicate:e,location:t}}o=e}let n=x().kind===`Identifier`&&S(`\\in`,1)?Ne():k();if(w(`:`)){let e=Ce();return T(`}`),{kind:`SetMap`,expression:n,bounds:e,location:t}}let r=[n];for(;w(`,`);)r.push(k());return T(`}`),{kind:`SetEnumeration`,elements:r,location:t}}),Fe=e=>{let t=g(e),n=be(()=>S(`>>`)||S(`>>_`)?[]:E(()=>k()));if(w(`>>_`)){if(n.length!==1)throw le(`Expected a single action inside <<A>>_v`,e);return{kind:`AngleAction`,action:n[0],subscript:Te().subscript,location:t}}return T(`>>`),{kind:`Tuple`,elements:n,location:t}},Ie=e=>{let t=g(e),n=e.text===`\\A`?`Forall`:`Exists`,r=e.text===`\\AA`||e.text===`\\EE`;if(!r&&xe()){let e=Ce();return T(`:`),{kind:n,bounds:e,body:k(),location:t}}let i=ge(E(he));return T(`:`),{kind:`UnboundedQuantifier`,quantifier:e.text===`\\A`||e.text===`\\AA`?`Forall`:`Exists`,names:i.names,nameRanges:i.ranges,body:k(),isTemporal:r,location:t}},Le=e=>{let t=[];do{let n=o;if(w(`OTHER`))return T(`->`),{kind:`Case`,arms:t,other:k(),otherRange:y(n),location:g(e)};let r=k();T(`->`),t.push({condition:r,body:k()})}while(w(`[]`));return{kind:`Case`,arms:t,other:void 0,location:g(e)}},Re=()=>{let e=x(1);return S(`!`)&&(e.kind===`Identifier`||e.kind===`Number`||My.has(e.text)||e.kind===`Operator`&&(wy.has(e.text)||Ey.has(e.text))||(e.kind===`Operator`||e.kind===`Keyword`)&&Oy.has(e.text))},ze=()=>{let e=C();if(e.kind===`Number`)return{kind:`Operand`,operand:pe(e.text)};switch(e.text){case`<<`:case`>>`:return{kind:`Operand`,operand:e.text};case`:`:return{kind:`Colon`};case`@`:return{kind:`At`};case`(`:return o--,{kind:`Bound`,args:je()}}return{kind:`Name`,name:e.text,args:S(`(`)?je():[]}},Be=e=>{let n=o,r=C(),a=g(r);if(i&&r.kind===`Keyword`&&r.text===`LAMBDA`){let e=E(me);return T(`:`),{kind:`Lambda`,params:e,body:k(),location:a}}if(r.kind===`Number`){if(i&&/^\\[BOH]/.test(r.text))throw le(`incomplete expression`,r);return{kind:`Number`,value:pe(r.text),text:r.text,location:a}}if(r.kind===`Decimal`)return{kind:`Decimal`,text:r.text,location:a};if(r.kind===`String`)return{kind:`String`,value:r.text,location:a};let s=r.kind===`Step`&&at(r);if(!i&&s&&nt()<0&&tt.length<=1)throw le(`Step number used outside proof`,r);if(s&&r.text[1]===`+`)throw le(`<+> step number used in an expression`,r);if(r.kind===`Identifier`||s){let t=s?ot(r)??r.text:r.text;if(Se()){let o=ge(w(`(`)?E(he):[]);o.names.length>0&&T(`)`),T(`::`);let s=y(n),l=k();if(!i&&e!==void 0&&c!==void 0&&Xy(l)&&e.high>=c.low)throw le(`Removing the label would change expression parsing`,r);return{kind:`Label`,name:t,params:o.names,paramRanges:o.ranges,head:s,body:l,location:a}}let l=S(`(`);if(t===`@`&&!l&&!Re())return{kind:`ExceptAt`,location:a};let u=l?je():[],d=[l?Ae:void 0];if(!Re())return l?{kind:`Apply`,operator:t,args:u,argumentsRange:Ae,location:a}:{kind:`Identifier`,name:t,location:a};let f=[{kind:`Name`,name:t,args:u}],p=[y(n,n)];for(;Re();)C(),p.push(y(o,o)),Ae=void 0,f.push(ze()),d.push(Ae);let m=f.flatMap(e=>e.kind===`Name`?[e.name]:[]),h=m.join(`!`),g=f.flatMap(e=>`args`in e?e.args:[]),ee=f.map(e=>`args`in e?e.args.length:0),_=d.at(-1)??y(n);return m.length<f.length?{kind:`Subexpression`,selectors:f,selectorRanges:p,argumentRanges:d,location:a}:g.length===0?{kind:`Identifier`,name:h,selectorRanges:p,location:a}:{kind:`Apply`,operator:h,args:g,...ee.slice(0,-1).some(e=>e>0)&&{argumentCounts:ee},argumentsRange:_,selectorRanges:p,argumentRanges:d,location:a}}if(r.kind===`Operator`&&Qy(r.text)&&S(`(`)){let e=je();return t===`tlc`&&r.text===`\\X`&&e.length===2?{kind:`Product`,factors:e,location:a}:{kind:`Apply`,operator:r.text,spelling:r.spelling,args:e,location:a}}if(r.kind===`Operator`&&Qy(r.text)&&!i)return{kind:`Identifier`,name:r.text,spelling:r.spelling,location:a};switch(r.text){case`(`:{let e=be(()=>k());return T(`)`),e}case`[`:return O(r);case`{`:return Pe(r);case`<<`:return Fe(r);case`@`:return{kind:`ExceptAt`,location:a};case`\\A`:case`\\E`:case`\\AA`:case`\\EE`:return Ie(r);case`IF`:{let e=k();T(`THEN`);let t=k();return T(`ELSE`),{kind:`If`,condition:e,consequent:t,alternative:k(),location:a}}case`CASE`:return Le(r);case`LET`:{let e=[],t=[];for(u.push(/* @__PURE__ */ new Set);!w(`IN`);){if(i&&S(`RECURSIVE`))throw le(`Unexpected keyword RECURSIVE`,ae(te()));if(w(`RECURSIVE`)){Qe();continue}let n=Ge(!i&&w(`LOCAL`));n.kind===`Instance`?t.push(n):e.push(n)}u.pop();let n=k();return t.length===0?{kind:`Let`,definitions:e,body:n,location:a}:{kind:`Let`,definitions:e,instances:t,body:n,location:a}}case`CHOOSE`:{let e=D(),t=w(`\\in`)?k():void 0;return T(`:`),{kind:`Choose`,pattern:e,set:t,body:k(),location:a}}case`WF_`:case`SF_`:{let e=Te(),t=!S(`(`)&&e.lastArgs.length===1?e.lastArgs[0]:be(()=>{T(`(`);let e=k();return T(`)`),e});return{kind:r.text===`WF_`?`WeakFairness`:`StrongFairness`,subscript:e.subscript,action:t,location:a}}}throw de(`Unexpected ${ne(r)}`,r)},Ve=(e,t,n)=>{c=l={low:t,high:n};let r=k(i?Math.min(n+1,Sy.low):n+1),a=x(),o=Ey.has(a.text)?Sy.high:wy.get(a.text)?.high;if(!i&&a.kind===`Operator`&&o!==void 0&&o>=t)throw le(`Precedence conflict between ${e.text} and ${a.text}`,a);return r},He=()=>{let e=l;l=void 0;let t=x(),n=g(t);if(t.kind===`Operator`&&Zy(t))return Me();if(i&&wy.has(t.text)&&S(`(`,1)){let e=o,r=be(()=>{C(),C();let r=k();if(!w(`,`))return;let i=k();T(`)`);let a={kind:`Apply`,operator:t.text,args:[r,i],location:n};return b(a,e)});if(r!==void 0)return r;o=e}if(t.kind===`Operator`||t.kind===`Keyword`)switch(t.text){case`~`:return C(),{kind:`Apply`,operator:`~`,args:[Ve(t,4,4)],location:n};case`-`:case`-.`:if(t.text===`-.`&&!i)break;return C(),{kind:`Apply`,operator:`-.`,args:[Ve(t,12,12)],location:n};case`[]`:return C(),{kind:`Always`,expression:Ve(t,4,15),location:n};case`<>`:return C(),{kind:`Eventually`,expression:Ve(t,4,15),location:n};case`ENABLED`:return C(),{kind:`Enabled`,expression:Ve(t,4,15),location:n};case`UNCHANGED`:return C(),{kind:`Unchanged`,expression:Ve(t,4,15),location:n};case`SUBSET`:case`UNION`:case`DOMAIN`:return C(),{kind:`Apply`,operator:t.text,args:[i?k(9):Ve(t,10,13)],location:n}}return Be(e)},k=(e=0)=>{let t=o,n=He(),r=n.location.range?n:b(n,t),a;for(;;){let n=x();if(n.kind!==`Operator`)break;let o=g(n);if(n.text===`'`&&e<=15){C(),c=Sy,r=b({kind:`Prime`,expression:r,location:o},t);continue}if(Ty.has(n.text)&&e<=15){C(),c=Sy,r=b({kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r],location:o},t);continue}if(n.text===`[`){C();let e=be(()=>E(()=>k()));be(()=>T(`]`)),c=Cy,r=b({kind:`FunctionApplication`,function:r,args:e,location:o},t);continue}if(n.text===`.`&&fe(x(1))){C();let e=C().text;r=b({kind:`FieldAccess`,record:r,field:e,location:o},t);continue}let s=wy.get(n.text);if(!s||s.low<e)break;if(a){let e=!(a.low>s.high||a.high<s.low),t=a.text===n.text&&s.isAssociative;if(e&&!t&&(a.text!==`\\X`||n.text!==`\\X`))throw le(`Precedence conflict between ${a.text} and ${n.text}`,n)}if(C(),!i&&s.low>12&&S(`-`))throw le(`Precedence conflict between ${n.text} and -`,x());c=l=s;let u=k(s.high+1);if(n.text===`/\\`||n.text===`\\/`){let e=n.text===`/\\`?`And`:`Or`,i=[y(t).end];r=r.kind===e&&a?.text===n.text?{...r,operands:[...r.operands,u],prefixEnds:[...r.prefixEnds??[],...i]}:{kind:e,operands:[r,u],prefixEnds:i,location:o}}else r=n.text===`\\X`?r.kind===`Product`&&a?.text===`\\X`?{...r,factors:[...r.factors,u]}:{kind:`Product`,factors:[r,u],location:o}:{kind:`Apply`,operator:n.text,spelling:n.spelling,args:[r,u],location:o};r=b(r,t),a={...s,text:n.text}}return r},Ue=()=>{if(!w(`(`))return[];let e=Ze();return T(`)`),e},We=()=>{let e=g(x()),t=k(),n=a[o-1],r={line:n.line,column:n.endColumn};return{body:t,bodyRange:{module:p[0].name,start:e,end:r}}},Ge=e=>{let t=o;return b(qe(e),t)},Ke=e=>({name:e.name,arity:0,location:{line:e.range.start.line,column:e.range.start.column,range:e.range}}),qe=e=>{let t=x(),n=o,r=g(t),i=(t,i)=>({kind:`Operator`,name:t,params:i,head:y(n,o-2),...We(),isLocal:e,isRecursive:m(t),location:r});if(t.kind===`Identifier`&&x(1).kind===`Operator`&&wy.has(x(1).text)&&x(2).kind===`Identifier`&&S(`==`,3)){let e=he(),t=C().text,n=he();return T(`==`),i(t,[Ke(e),Ke(n)])}let a=t.kind!==`String`&&Oy.has(t.text),s=t.kind===`Identifier`&&Ey.has(x(1).text)&&S(`==`,2);if(a||s){let e=a?t.text:x(1).text;a&&C();let n=he();return s&&C(),T(`==`),i(e,[Ke(n)])}let c=me();if(w(`[`)){let t=be(()=>Ce());return T(`]`),T(`==`),{kind:`Function`,name:c,bounds:t,body:k(),isLocal:e,isRecursive:m(c),location:r}}let l=o,u=Ue();return T(`==`),S(`INSTANCE`)?{...Je(c,u,e,r),definitionRange:y(l)}:i(c,u)},Je=(e,t,n,r)=>{let i=o;return T(`INSTANCE`),{kind:`Instance`,name:e,params:t,module:ye(),substitutions:w(`WITH`)?E(()=>{let e=o,t=_e(),n=y(e);return T(`<-`),{name:t,nameRange:n,expression:Oe()}}):[],isLocal:n,location:r,instanceRange:y(i)}},Ye=()=>{let e=o;return b(Xe(),e)},Xe=()=>{let e=g(x());if(S(`_`)&&x(1).kind===`Operator`)return C(),{name:C().text,arity:w(`_`)?2:1,location:e};if(x().kind!==`String`&&(Oy.has(x().text)||i&&x().kind===`Operator`)&&S(`_`,1)){let t=C().text;return C(),{name:t===`-`?`-.`:t,arity:1,location:e}}let t=me();if(!w(`(`))return{name:t,arity:0,location:e};let n=E(()=>T(`_`));return T(`)`),{name:t,arity:n.length,location:e}},Ze=()=>E(Ye),Qe=()=>{let e=Ze();return e.forEach(e=>u[u.length-1].add(e.name)),e},$e=e=>{let t=0,n=e;do{let e=x(n);if(e.kind===`End`)return n;e.kind===`Operator`&&qy.has(e.text)&&t++,e.kind===`Operator`&&Jy.has(e.text)&&t--,n++}while(t>0);return n},et=()=>{let e=x(),t=x(1);return e.kind===`Identifier`?S(`(`,1)||S(`[`,1)?S(`==`,$e(1)):t.kind===`Operator`&&Ey.has(t.text)?S(`==`,2):t.kind===`Operator`&&wy.has(t.text)?x(2).kind===`Identifier`&&S(`==`,3):S(`==`,1):e.kind!==`String`&&Oy.has(e.text)&&t.kind===`Identifier`&&S(`==`,2)},tt=[],nt=()=>tt[tt.length-1]??-1,rt=e=>e.text[1]===`*`?-1:e.text[1]===`+`?-2:Number(e.text.slice(1,e.text.indexOf(`>`))),it=e=>{let t=e.text.slice(e.text.indexOf(`>`)+1),n=t.length;for(;t[n-1]===`.`;)n--;return t.slice(0,n)},at=e=>!e.text.endsWith(`.`)&&!Ry.has(it(e)),ot=e=>{let t=it(e);if(Ry.has(t))return;let n=rt(e);if(n>=0)return`<${n}>${t}`;let r=nt(),i=tt[tt.length-2];return`<${r<0&&i!==void 0?i:r}>${t}`},st=e=>{if(e.kind===`Keyword`)return Fy.has(e.text);if(e.kind!==`Step`)return!1;if(e.text[1]===`*`)return tt.length===0;if(e.text[1]===`+`||tt.length===0)return!0;let t=nt();return t>=0&&rt(e)>t},ct=e=>{let t=rt(e),n=tt.length-1,r=tt[n-1]??-1,i=tt[n]<0;return i&&(tt[n]=t<0?r+1:t),t===-1?!0:t===-2?i:i?t>r:tt[n]===t},lt=e=>!d.has(e)&&p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)||t.definitions.some(t=>t.name===e)),ut=e=>e.kind===`ModuleFact`||e.kind===`Subexpression`?!0:e.kind===`Apply`?e.operator.includes(`!`):e.kind===`Identifier`?e.name.startsWith(`<`)||e.name.includes(`!`)?!0:!Yy.has(e.name)&&!lt(e.name):!1,dt=()=>{let e=x();return e.kind===`Step`?at(e):e.kind===`Keyword`?Wy.has(e.text):e.kind===`End`||e.kind===`ModuleEnd`||e.kind===`Separator`?!1:!et()},ft=()=>{let e=o,t=x();return t.kind===`Operator`&&!ky.has(t.text)&&Qy(t.text)?(o++,b({kind:`OperatorReference`,operator:t.text,spelling:t.spelling,location:g(t)},e)):w(`MODULE`)?b({kind:`ModuleFact`,name:me(),location:g(t)},e):k()},pt=e=>f[f.length-1]?.add(e),mt=e=>{f.push(/* @__PURE__ */ new Set);let t=e();return f.pop(),t},ht=e=>f.some(t=>t.has(e))||p.some(t=>t.constants.some(t=>t.name===e)||t.variables.some(t=>t.name===e)),A=()=>{let e=o,t=x(),n=E(()=>{let e=x();if((e.kind!==`Identifier`||oe(e))&&e.kind!==`Operator`)throw de(`Expected a definition name but found ${ne(e)}`,e);return o++,e.text},`!`),r=g(t);return b(n.length===1&&t.kind===`Operator`?{kind:`OperatorReference`,operator:t.text,location:r}:{kind:`Identifier`,name:n.join(`!`),location:r},e)},gt=()=>{if(i)return E(A);let e=E(ft),n=t===`tlc`?e.find(e=>e.kind===`Identifier`&&ht(e.name)):void 0;if(n)throw le(`DEF clause entry should describe a defined operator`,n.location);return e},_t=()=>{let e=dt()?E(ft):[],t=w(`DEF`)||w(`DEFS`);if(i&&e.length===0&&!t)throw de(`Expected a fact`);return{facts:e,defs:t?gt():[]}},vt=()=>{let e=o,n=C(),r=n.text===`USE`&&w(`ONLY`),i=y(e),a={kind:n.text===`USE`?`Use`:`Hide`,isOnly:r,..._t(),keyword:i,location:g(n)},s=a.kind===`Hide`&&t===`tlc`?a.facts.filter(e=>!ut(e)):[];if(s.length>0)throw re(s.map(t=>({location:h(t.location.range??y(e)),message:`The only expression allowed as a fact in a HIDE is
|
|
1785
|
-
the name of a theorem, assumption, or step.`})));return b(a,e)},yt=()=>{let e=o,t=g(x()),n=w(`NEW`),r=i?o:e,a=i?g(x()):t,s=x().kind===`Keyword`?Gy.get(x().text):void 0;if(!n&&s===void 0)throw de(`Expected a declaration but found ${ne(x())}`);if(s!==void 0&&C(),s===`Variable`){let e=he();return pt(e.name),b({kind:`NewSymbol`,name:e.name,arity:0,level:s,set:void 0,nameRange:e.range,location:a},r)}let c=Ye();pt(c.name);let l=(s??`Constant`)===`Constant`&&S(`\\in`);if(l&&c.arity>0)throw le(`declared symbol with arguments before \\in`);return l&&C(),b({kind:`NewSymbol`,name:c.name,arity:c.arity,level:s??`Constant`,set:l?k():void 0,nameRange:c.location.range,location:a},r)},bt=()=>{let e=o,t=g(T(`ASSUME`)),n=E(()=>(x().kind===`Identifier`&&S(`::`,1)&&S(`ASSUME`,2)&&(C(),C()),S(`ASSUME`)?mt(bt):x().kind===`Keyword`&&Ky.has(x().text)?yt():k()));return T(`PROVE`),b({kind:`AssumeProve`,assumptions:n,conclusion:k(),location:t},e)},xt=e=>{let t=0;for(;x(t).kind===`Identifier`&&S(`,`,t+1);)t+=2;return x(t).kind===`Identifier`&&S(e,t+1)},j=(e,t)=>{e.forEach(pt),t.forEach(e=>(e.pattern.kind===`Name`?[e.pattern.name]:e.pattern.names).forEach(pt))},St=()=>{let e=x();if(S(`USE`)||S(`HIDE`))return vt();if(S(`INSTANCE`)){let t=o;return b(Je(void 0,[],!1,g(e)),t)}if(S(`DEFINE`)||et()){let t=o;w(`DEFINE`);let n=[Ge(!1)];for(;et();)n.push(Ge(!1));let r={kind:`Define`,definitions:n,location:g(e)};return b(r,t)}if(w(`HAVE`))return{kind:`Have`,expression:k()};if(w(`TAKE`)){let e=xe(),t=ge(e?[]:E(he)),n=e?Ce():[];return j(t.names,n),{kind:`Take`,names:t.names,nameRanges:t.ranges,bounds:n}}if(w(`WITNESS`))return{kind:`Witness`,expressions:E(()=>k())};if(w(`PICK`)){let e=xt(`:`),t=ge(e?E(he):[]),n=e?[]:Ce();return j(t.names,n),T(`:`),{kind:`Pick`,names:t.names,nameRanges:t.ranges,bounds:n,body:k()}}return w(`CASE`)?{kind:`Case`,expression:k()}:{kind:`Assert`,isSuffices:w(`SUFFICES`),statement:S(`ASSUME`)?bt():k()}},Ct=e=>{let n=x();if(n.kind!==`Step`)throw de(`Expected a step number but found ${ne(n)}`,n);if(!ct(n))throw le(`${e?`QED step`:`step`}'s number has bad level`,n);if(t!==`sany`&&rt(n)<0&&ot(n)!==void 0)throw le(`<*> and <+> cannot be used for a named step`,n);return o++,{name:ot(n),token:n.text,location:g(n)}},wt=()=>{let e=o,t=Ct(S(`QED`,1)),n=o,r=/* @__PURE__ */ new Set;f.push(r);let i=w(`QED`)?{kind:`Qed`}:St(),a=y(e),s=y(n),c=st(x());if(c&&!Iy.has(i.kind))throw le(`Proof of a step that does not take a proof`);let l=c?Dt():void 0;return f.pop(),(i.kind!==`Assert`||i.isSuffices)&&r.forEach(pt),b({...t,body:i,head:a,statement:s,proof:l},e)},Tt=e=>{if(w(`BY`)){let t=y(o-1);return{kind:`By`,isOnly:w(`ONLY`),..._t(),keyword:t,location:e}}let t=x();if(t.kind!==`Keyword`||t.text!==`OBVIOUS`&&t.text!==`OMITTED`)return;C();let n=y(o-1);return{kind:t.text===`OBVIOUS`?`Obvious`:`Omitted`,keyword:n,location:e}},Et=()=>{let e=g(x());w(`PROOF`);let t=Tt(e);if(t)return t;let n=[wt()];for(;n[n.length-1].body.kind!==`Qed`;)n.push(wt());return{kind:`Steps`,level:nt(),steps:n,location:e}},Dt=()=>{let e=o;tt.push(-1);let t=mt(Et);return tt.pop(),b(t,e)},Ot=()=>x().kind===`Step`||x().kind===`Keyword`&&Fy.has(x().text),kt=(e,t)=>{if(t.kind!==`Use`&&t.kind!==`Hide`)return Hy(e);let n=t.defs[t.defs.length-1]?.location.range;return Vy(Hy({...e,end:e.start}),Hy(n??t.keyword))},At=()=>{let e=o,t=g(x()),n=w(`PROOF`),r=Tt(t);if(r){let t=b(r,e);return{kind:`Leaf`,proof:t,span:Hy(t.keyword),first:e,end:o-1}}let i=x();if(i.kind!==`Step`)throw de(`Expected a step number but found ${ne(i)}`);let a=o;C();let s=o,c=w(`QED`)?{kind:`Qed`}:St(),l=y(a);return{kind:`Step`,token:i,isProof:n,body:c,head:l,statement:y(s),span:kt(l,c),first:e,start:a,end:o-1}},jt=(e,t,n,r)=>{let i=e[t];if(!i)return{proof:void 0,span:r,next:t,end:void 0};if(i.kind===`Leaf`)return{proof:i.proof,span:i.span,next:t+1,end:i.end};let o=Mt(e,t,n,r,!0);if(!o)return{proof:void 0,span:r,next:t,end:void 0};let s={...g(a[i.first]),range:y(i.first,o.end)};return{proof:{kind:`Steps`,level:o.level,steps:o.steps,location:s},span:o.span,next:o.next,end:o.end}},Mt=(e,t,n,r,i)=>{let a=e[t];if(!a)throw Uy(`Unexpected end of (sub)proof at level ${n} before QED step`,r);if(a.kind===`Leaf`)throw Uy(`Expecting a proof step but found a${zy[a.proof.kind]} leaf proof`,a.span);if(!i&&a.isProof)throw Uy(`PROOF keyword found in step that does not begin subproof`,a.span);let o=a.token.text[1];if(o===`+`&&!i)throw Uy(`<+> used but no subproof expected`,a.span);let s=o===`*`?n-(i&&!a.isProof?1:0):o===`+`?n:rt(a.token);if(s<n||!i&&s>n)return;let c=Iy.has(a.body.kind)?jt(e,t+1,s+1,a.span):{proof:void 0,span:a.span,next:t+1,end:void 0},l=c.end??a.end,u={name:ot(a.token),token:a.token.text,body:a.body,head:a.head,statement:a.statement,proof:c.proof,location:{...g(a.token),range:y(a.start,l)}},d=Vy(a.span,c.span);if(a.body.kind===`Qed`)return{level:s,steps:[u],span:d,next:c.next,end:l};let f=Mt(e,c.next,s,{start:d.stop,stop:d.stop},!1);return f&&{...f,level:s,steps:[u,...f.steps],span:Vy(d,f.span)}},Nt=()=>{if(!Ot())return;let e=[];for(;Ot();)e.push(At());let t=e[0];t.kind===`Step`&&(e[0]={...t,isProof:!0});let n=jt(e,0,0,t.span),r=e[n.next];if(r)throw Uy(`extra step(s) after finished proof`,r.span,`Proof.Parser.toplevel`);return n.proof},Pt=(e,t)=>{e.definitions.some(e=>e.name===t.name)||e.definitions.push(t)},Ft=()=>{if(x().kind!==`Identifier`||!S(`==`,1))return;let e=me();return d.add(e),C(),e},It=e=>{let t=o,n=C(),r=Ft(),a=mt(()=>{let e=S(`ASSUME`)?bt():k();return i?{statement:e,proof:Nt()}:{statement:e,proof:st(x())?Dt():void 0}}),s=a.statement,c=b({name:r,statement:s,proof:a.proof,location:g(n)},t);e.theorems.push(c),e.units.push({kind:`Theorem`,theorem:c}),r!==void 0&&s.kind!==`AssumeProve`&&Pt(e,b({kind:`Operator`,name:r,params:[],body:s,isLocal:!1,isRecursive:!1,location:g(n)},t))},Lt=()=>{let e=o,t=C(),n=Ft();return b({name:n,expression:k(),isAxiom:t.text===`AXIOM`,location:g(t)},e)},Rt=()=>{let e=g(T(`----`));T(`MODULE`);let t=ye();T(`----`);let n={name:t,modules:[],extends:[],extendsRanges:[],constants:[],variables:[],definitions:[],instances:[],assumptions:[],location:e,theorems:[],uses:[],units:[]};for(p.push(n),u.push(/* @__PURE__ */ new Set),w(`EXTENDS`)&&E(()=>{let e=o;n.extends.push(ye()),n.extendsRanges.push(y(e))});;){let t=o;ie=t;let r=x();if(r.kind===`ModuleEnd`)return e.range={module:p[0].name,start:{line:e.line,column:e.column},end:{line:r.line,column:r.endColumn}},p.pop(),u.pop(),n;if(r.kind===`Separator`){if(S(`MODULE`,1)){let e=Rt();n.modules.push(e),n.units.push({kind:`Module`,module:e}),T(`====`);continue}C()}else{switch(r.text){case`CONSTANT`:case`CONSTANTS`:{let e=g(C()),r=Ze();n.constants.push(...r),e.range=y(t),n.units.push({kind:`Constants`,declarations:r,location:e});continue}case`VARIABLE`:case`VARIABLES`:{let e=g(C()),r=E(()=>{let e=o,t=g(x());return b({name:me(),arity:0,location:t},e)});n.variables.push(...r),e.range=y(t),n.units.push({kind:`Variables`,declarations:r,location:e});continue}case`ASSUME`:case`ASSUMPTION`:case`AXIOM`:{let e=Lt();n.assumptions.push(e),n.units.push({kind:`Assumption`,assumption:e}),e.name!==void 0&&Pt(n,{kind:`Operator`,name:e.name,params:[],body:e.expression,isLocal:!1,isRecursive:!1,location:e.location});continue}case`USE`:case`HIDE`:{if(S(`USE`)&&S(`ONLY`,1))throw de(`Expected a module unit but found ${ne(r)}`);let e=vt();n.uses.push(e),n.units.push({kind:`Use`,use:e});continue}case`RECURSIVE`:{let e=g(C()),r=Qe();e.range=y(t),n.units.push({kind:`Recursive`,declarations:r,location:e});continue}case`INSTANCE`:zt(n,b(Je(void 0,[],!1,g(r)),t));continue;case`LOCAL`:if(C(),S(`INSTANCE`)){zt(n,b(Je(void 0,[],!0,g(r)),t));continue}zt(n,b(qe(!0),t));continue}r.kind===`Keyword`&&Py.has(r.text)?It(n):zt(n,Ge(!1))}}},zt=(e,t)=>{t.kind===`Instance`?(e.instances.push(t),e.units.push({kind:`Instance`,instance:t})):(e.definitions.push(t),e.units.push({kind:`Definition`,definition:t}))},Bt=Rt(),Vt=ve?xy(e):void 0;if(Vt!==void 0)throw new r(Vt);return Bt},nb=e=>tb(e,`tlc`),rb=(e,t)=>tb(e,`tlc`,t),ib=e=>tb(e,`tlapm`),ab=e=>tb(e,`sany`),ob=`$subexpression`,sb=(e,t)=>new r(`${e} at line ${t.line}, column ${t.column}`),cb=(e,t,n)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n}:void 0;if(e.kind===`Let`)return cb(e.body,t,[...n,e.definitions]);if(e.kind!==`Lambda`)for(let r of ht(e)){let e=cb(r,t,n);if(e)return e}},lb=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:n}),e),ub=(e,t)=>{let n=e.location,r=lb(t,e.lets,n);if(e.params.length===0)return r;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw sb(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:r,location:n}}if(e.args.length!==e.params.length)throw sb(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:ob,params:e.params,body:r,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:ob,args:e.args,location:n,resolution:Js},location:n}},db=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Js})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Js}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Js};return ub({...t,params:[...t.params,...r]},a)},fb=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s,c=!1,l=(t,r)=>{if(!t)throw sb(r,i);Xs.set(n,{args:e.slice(0,o).flatMap(e=>`args`in e?e.args:[]),error:{location:h(t),message:r}}),c=!0},u=n=>{let r=[],a=[];for(;o<e.length;){let s=e[o];if(s.kind!==`Name`)throw sb(`Expected an operator name`,i);r.push(s.name),a.push(...s.args);let c=r.join(`!`),l=n?n.find(e=>vl(e)===c):t(c);if(l)return{definition:l,name:c,args:a,earlier:a.length-s.args.length};o++}throw sb(`Unknown operator ${r.join(`!`)}`,i)},d=t=>{let c=u(t),d=c.definition,f=tc(d),p=o===e.length-1;if(c.args.length!==f&&(!r||c.args.length!==0))return l(n.argumentRanges?.[o]??i.range,`The operator ${c.name} requires ${f-c.earlier} arguments.`);if(p)return{definition:d,args:c.args};if(d.kind!==`Operator`)throw sb(`Cannot select a subexpression of ${d.name}`,i);a.params.push(...d.params),a.args.push(...c.args),s=d.body,o++},f=()=>{for(;o<e.length&&!c;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],c=s&&cb(s,t.name,[]);if(!c)return l(i,`Cannot find label \`${t.name}'.`);let u=c.label.params;if(!r&&t.args.length!==u.length)return l(i,`Label \`${t.name}' used with wrong number of arguments.`);a.lets.push(...c.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),s=c.label.body,o++}},p=t=>{if(!s)throw sb(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;if(s.kind===`Label`){s=s.body,p(t);return}if(s.kind===`Let`){if(t.kind!==`Operand`||Sc(t.operand,1)!==0)throw sb(`A LET/IN expression has only one operand`,i);a.lets.push(s.definitions),s=s.body;return}let n=Ec(s);if(n&&(t.kind===`Bound`||t.kind===`At`)){a.params.push(...n.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&a.args.push(...t.args),s=n.body;return}if(s.kind===`Case`&&t.kind===`Operand`){let n=[...s.arms,...s.other?[{condition:void 0,body:s.other}]:[]],r=n[Sc(t.operand,n.length)],a=e[o+1];if(!r||a?.kind!==`Operand`)throw sb(`A subexpression of CASE must have the form !i!j`,i);o++;let c=Sc(a.operand,2),l=c===0?r.condition:c===1?r.body:void 0;if(!l)throw sb(`Nonexistent CASE operand`,i);s=l;return}if(t.kind!==`Operand`)throw sb(`Unexpected subexpression selector`,i);let r=n?n.sets:Dc(s),c=r?.[Sc(t.operand,r.length)];if(!c)throw sb(`Nonexistent operand specified by the selector`,i);s=c},m=d(void 0);if(c)return n;if(m)return db(m.definition,{...a,args:m.args});for(f();o<e.length&&!c;){let t=e[o];if(t.kind===`Name`){for(;s?.kind===`Label`;)s=s.body;if(s?.kind!==`Let`)throw sb(`A name selector here must be from a LET clause`,i);a.lets.push(s.definitions);let e=d(s.definitions);if(c)return n;if(e)return db(e.definition,{...a,args:[...a.args,...e.args]});f()}else p(t),o++}if(c)return n;if(!s)throw sb(`Subexpression selection failed`,i);return ub(a,s)},pb=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return Cc(e,t,n)},mb=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||ht(e).some(mb),hb=(e,t,n,r=!1)=>{if(!mb(e))return e;if(e.kind===`Let`){let r=n=>e.definitions.find(e=>e.name===n)??t(n),i=xl(e,e=>hb(e,r,n));return i.kind===`Let`&&i.instances?{...i,instances:i.instances.map(e=>gb(e,r,n))}:i}let i=e.kind===`Apply`?t(e.operator):void 0,a=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>hb(e,t,n,i?.kind!==`Operator`||i.params[r]?.arity!==0))}:xl(e,e=>hb(e,t,n)),o=a.kind===`Subexpression`?a.selectors:a.kind===`Identifier`?pb(a.name,[],void 0,t):a.kind===`Apply`?pb(a.operator,a.args,a.argumentCounts,t):void 0,s=o?.[0];if(!o||s?.kind===`Name`&&n(s.name))return a;let c=fb(o,t,a,r);return c!==a&&Ys.add(c),c},gb=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:hb(e.expression,t,n,!0)}))}),_b=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},vb=(e,t)=>gb(e,_b(t.definitions),()=>!1),yb=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=_b([...t,...e.definitions]),a=e=>n.has(e),o=_b([...t,...e.definitions,...r]),s=e=>hb(e,o,e=>a(e)&&r.every(t=>t.name!==e)),c=e=>a(e)||!i(e),l=e=>hb(e,i,c),u=e=>e.map(e=>e.kind===`ModuleFact`?e:l(e)),d=e=>e.map(e=>({...e,set:l(e.set)})),f=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&l(e.set)}:f(e)),conclusion:l(e.conclusion)}:l(e),p=e=>{switch(e.kind){case`Use`:case`Hide`:return{...e,facts:u(e.facts)};case`Instance`:return gb(e,i,c);case`Define`:return{...e,definitions:e.definitions.map(e=>e.kind===`Instance`?gb(e,i,c):bl(e,l))};case`Have`:case`Case`:return{...e,expression:l(e.expression)};case`Witness`:return{...e,expressions:e.expressions.map(l)};case`Take`:return{...e,bounds:d(e.bounds)};case`Pick`:return{...e,bounds:d(e.bounds),body:l(e.body)};case`Assert`:return{...e,statement:f(e.statement)};default:return e}},m=e=>e?.kind===`By`?{...e,facts:u(e.facts)}:e?.kind===`Steps`?{...e,steps:e.steps.map(e=>({...e,body:p(e.body),proof:m(e.proof)}))}:e,h={...e,theorems:e.theorems.map(e=>({...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:f(e.statement),proof:m(e.proof)})),uses:e.uses.map(e=>({...e,facts:u(e.facts)}))};return e.definitions.some(e=>mb(e.body))||e.assumptions.some(e=>mb(e.expression))?{...h,definitions:e.definitions.map(e=>bl(e,s)),assumptions:e.assumptions.map(e=>({...e,expression:s(e.expression)}))}:h},bb=(e,t)=>e.maxLevels[t]??3,xb=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=Du({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>iu(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>iu(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>au(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=tu(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&iu(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(Ou(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=h(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),c=i(t.module),l=n(t.instancer),u=/* @__PURE__ */ new Map;t.lets.forEach(e=>u.set(e.name,{kind:`Let`,definition:e,scope:u}));let d=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=l.analyze(n,u);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=l.toOperand(n,u);return[{...e,level:r.data.level,operator:r.operator,isLeibniz:r.operator===void 0||r.operator.nonLeibniz.size===0}]}),f=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(d.forEach(e=>{!c.isConstant&&e.level>e.maximumLevel&&o(f(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),d.forEach(e=>{let n=c.constraints.get(e.name);n!==void 0&&e.level>n&&o(f(e.name,n));let r=e.operator;r&&Array.from({length:e.arity},(n,i)=>{let a=c.argConstraints.get($l(e.name,i));a!==void 0&&bb(r,i)<a&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${i+1} of the operator ${r.name} \nmust be at least ${a}.`)})}),c.argParams.forEach(e=>{let n=tu(e),r=d.find(e=>e.name===n.operator)?.operator,i=d.find(e=>e.name===n.param);if(!r||!i)return;let a=bb(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw re([...r.values()])}},Sb=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],Cb=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),wb=new Map(Yf.flatMap(e=>e.map(t=>[t,e[0]]))),Tb=e=>wb.get(e)??e,Eb=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},Db=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:gt(e)&2147483647,kind:t,isLocal:n}),Ob=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:Tb(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:Tb(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},kb=(e,t)=>{let n=[];for(let r=t;;){let t=Ob(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},Ab=e=>({line:e.line,column:e.column}),jb=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=kb(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}}return{references:s,end:e.length}};return i(0,t??``).references},Mb=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,Nb={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},Pb=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&Mb(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&Mb(e[n+1],e[n+2])?n+=Mb(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>Nb[e])}"`:r.text)}return t},Fb=e=>e[2]?.text,Ib=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},Lb=(e,t)=>e.find(e=>e.name===t)??e.map(e=>Lb(e.modules,t)).find(Boolean),Rb=e=>{let t=e===void 0?[]:ke(e),n;return{tokens:t,ranges:Ib(t),getModule:()=>n??=e===void 0?nb(``):rb(e,t)}},zb=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=Rb(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??$f.get(i)??np.get(i)??eb(e,i),c=a(s),l=c.tokens,u=c.ranges.get(Fb(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>Lb(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},Bb=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=kb(t,e+1);i.push({location:Ab(t[e]),apply:e=>r.forEach(t=>e.put(Db(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:Ab(n),apply:t=>t.put(Db(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&kb(t,u+1).every(e=>s.has(e))&&o(u,`definition`),Cb.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(Ab(n)),i.push({location:Ab(n),apply:e=>e.put(Db(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(Db(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=Tb(e.name);i.push({location:e.location,apply:n=>n.put(Db(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(Db(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(Db(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>ec(e.location,t.location)?-1:+!!ec(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=Eb();n.set(i??``,o),Jf.toReversed().forEach(e=>o.put(Db(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},Vb=(e,t)=>{let n=/* @__PURE__ */ new Set,r=e=>{n.add(e)},i=e=>{e.kind===`ModelValue`&&r(e.name),e.kind===`String`&&r(e.value),e.kind===`Set`&&e.elements.forEach(i)};t.constants.forEach(e=>{e.args?.forEach(i),i(e.value)}),Xf.forEach(r);let a=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=jb(a(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),ee=/* @__PURE__ */ new Set([void 0]),_=/* @__PURE__ */ new Map;Pb(a(void 0)).forEach((e,t)=>{t===3&&Qf.forEach(r),r(e)});let v=l(void 0);for(;;){let t=h(v,/* @__PURE__ */ new Set)??g(v,/* @__PURE__ */ new Set);if(!t)break;let[n,i]=t;if(d.add(`${n.key}>${i}`),_.set(n.unit,[..._.get(n.unit)??[],i]),!ee.has(i)){if(ee.add(i),e(i).tokens.length===0){let t=n.unit??Fb(e(void 0).tokens);throw o(i,t)}Pb(a(i)).forEach(r)}}Sb.forEach(r);let y=/* @__PURE__ */ new Set,b=e=>{if(y.has(e))return;y.add(e);let t=_.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),a(e).forEach(e=>{e.kind===`String`&&r(e.text)})};return b(void 0),Zf.forEach(r),[...n]},Hb=(e,t)=>{let n=zb(e,t),r=n.getParsed,i,a=()=>i??=Bb(r);return{getStringOrder:e=>Vb(r,e),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},Ub=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),Wb=e=>{switch(e.kind){case`Number`:if(!pn(e.value))throw x(new c(`TLC can't handle a number this big.\n${e.value}`),ie.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return Zn(e.name);case`Set`:return P({kind:`MixedSet`,elements:e.elements.map(Wb)})}},Gb=e=>{try{return Wb(e)}catch(e){throw!(e instanceof v)||e instanceof c||e instanceof se?e:x(new v(`${i}${e.message}`),ie.error)}},Kb=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],qb=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof r))throw n;let i=xy(e);throw i===void 0?n:re([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,i)}},Jb=e=>new r(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),Yb=(e,t)=>e.location.range&&t.location.range&&{location:h(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${h(t.location.range)}.`},Xb=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,Zb=e=>e===`Theorem`?`ThmOrAssumpDefNode`:Xb(e),Qb=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Rl(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),$b=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>L(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new v(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&fr(t,r)})});if(t)return t[1];throw new v(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:L(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},ex=(e,t)=>e.kind===`Identifier`&&t.has(e.name)||e.kind===`Apply`&&t.has(e.operator)||ht(e).some(e=>ex(e,t)),tx=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(Nl(e),n.get(e)??n.size)),n},nx=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),rx=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw Uh(e);if(e.kind===`Number`&&!pn(e.value))throw Wh(e);rx(e.kind===`Let`?[...ht(e),...nx(e.instances??[])]:ht(e))}),ix=(e,t)=>{let n=t.order??Hb(t.source,t.loadModule),i=n.parseModule(t.source),a=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(pp.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=xf(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`;let m=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Map,y=[],b=/* @__PURE__ */ new Map,te=[],x=[],ne=(e,t)=>te.forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ie=0,ae=e=>`${e}#${ie++}`,oe=[],se=[],ce=xb(e=>{let t=g.get(e)??pe(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>a.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>a.get(t.visible.get(e)?.key??e)}}),le=/* @__PURE__ */ new Map,ue=/* @__PURE__ */ new Map,de=/* @__PURE__ */ new Map,fe=e=>{let n=f.get(e);if(n)return n;let r=Pp(e,t.print,p,t.files,d);if(!r)return;Np.get(e)?.forEach(fe);let i=/* @__PURE__ */ new Map;return r.extends.forEach(e=>fe(e)?.forEach((e,t)=>i.set(t,e))),r.operators.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:Xl.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:Ql(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},S=e=>{let n=Np.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=fe(e);return r&&ne(e,n),r&&n.includes(`Integers`)&&fe(`Integers`),r},C=e=>(rx([...e.definitions.flatMap(e=>e.kind===`Function`?[...e.bounds.map(e=>e.set),e.body]:[e.body]),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...nx(e.instances)]),e.modules.forEach(C),e);C(i);let w=(e,r)=>{let i=t.loadModule?.(e)??ip(p.version).get(e)??eb(t.source,e);if(i===void 0)throw o(e,r);let a=qb(i,e,n);if(a.name!==e)throw re([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return C(a)},T=e=>{let t=x.indexOf(e.name);if(t!==-1){let n=[...x.slice(t),e.name].map(e=>`${e}.tla`);throw new r(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,i=[],a=[],o=[];x.push(e.name),te.push(n);let s=Se(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:i,errors:a,warnings:se,levelChecks:o});if(te.pop(),x.pop(),a.length>0)throw re(a,!1,void 0,se);let c=i.find(e=>n.has(e.name)),l=c&&m.get(c.name),u=l&&Yb(c,l.module);if(u)throw re([u],!1,void 0,se);if(c)throw Jb(c);return o.forEach(e=>e()),{linked:s,closure:n}},pe=(e,n)=>{let r=m.get(e);if(r)return ne(e,b.get(e)??[]),r;let i=T(w(e,n)),o=/* @__PURE__ */ new Map;return Mp(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new v(`No definition of ${e} to fall back to`);let a={kind:`Closure`,name:r.name,params:r.params,body:r.body,scope:void 0};return W(r.body,{environment:n.environment,scope:Xg(a,i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=i.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&Ub.has(e))return;let r=a.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),a.delete(n.key)}),m.set(e,i.linked),b.set(e,i.closure),ne(e,i.closure),i.linked},me=(e,t,n,r,i)=>{let o=i?void 0:S(e.module);if(o)return he(e,o);let d=i??pe(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=Kb(d),p=`#${ie++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=ll(vb(e,t),f,t,n);oe.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let ee=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,_=Gl({params:g,substitutions:new Map([...h].map(([e,t])=>[e,hl(t,m)])),variables:new Set(d.variables),getDefinition:e=>a.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>s.get(e)===!0,addDefinition:(n,i,o)=>{let u=ae(`${i}@${t.name}`),d=o(u);return a.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&ue.set(u,`${e.name}!${ue.get(n)??i}`),s.set(u,!r),c.set(u,{source:n,prefix:e.params.length}),u},createName:ae,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{...ee.start,range:ee}}}});return ge(e,d.exported,f,(t,n)=>{let r=e.name===void 0?_.getKey(t):_.getQualifiedKey(t);return f.length>0&&le.set(r,{name:n,location:e.location}),e.name!==void 0&&de.set(r,n),r})},he=(e,t)=>e.name===void 0?t:new Map([...t].map(([t,n])=>[`${e.name}!${t}`,{key:n.key,arity:n.arity,params:n.params,kind:n.kind}])),ge=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(([e])=>!i.has(e)).map(([t,n])=>{if(e.name===void 0)return[t,{key:r(n.key,t),arity:n.arity,params:n.params,kind:n.kind,range:s.get(n.key)===!0?e.location.range:n.range}];let i=`${e.name}!${t}`;return[i,{key:r(n.key,i),arity:n.arity+e.params.length,params:n.params&&[...e.params.map(e=>e.arity),...n.params],kind:n.kind}]}))},_e=(e,t,n,r,i)=>({kind:`Operator`,name:e,params:n,body:r.length===0?{kind:`Identifier`,name:t,location:i}:{kind:`Apply`,operator:t,args:zl(r,i),location:i},isLocal:!0,isRecursive:!1,location:i}),ve=e=>Array.from({length:e},(e,t)=>({name:`argument${t}`,arity:0})),ye=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=ve(t.arity);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:zl(r,n),location:n}}},be=(e,t,n,r)=>{let i=e.location,o=r?void 0:S(e.module);if(o)return e.name===void 0?[]:[...o].map(([t,n])=>{let r=ve(n.arity);return _e(`${e.name}!${t}`,n.key,[...e.params,...r],r,i)});let c=r??pe(e.module,n),l=`#${ie++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=Kb(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:i};oe.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:i});let p=new Set(e.params.map(e=>e.name)),m=e=>ex(f(e),p),h=d.map(t=>{let n=ye(f(t),t,i);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:i}}),g=[],ee=Gl({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:zl(e.params,i),location:i,resolution:Js}:Rl(`${t.name}${l}`,i)])),variables:new Set(c.variables),getDefinition:e=>a.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>s.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:Qb(a,i)),i},createName:ae}),_=new Set(d.map(e=>e.name)),v=[...c.exported].filter(([e])=>!_.has(e)).map(([t,n])=>{let r=ee.getKey(n.key),a=ve(n.arity),o=[...e.params,...a];return _e(e.name===void 0?t:`${e.name}!${t}`,r,o,r===n.key?a:o,i)});return[...h,...g,...v]},E=e=>[...e].flatMap(([e,t])=>{let n=a.get(t.key);return n?[{...n,name:e}]:[]}),xe=/* @__PURE__ */ new Map,Se=(e,n)=>{let r=ev(e,t.loadClass?.(e.name),e===i);xe.set(e.name,r.overrides);let o=r.module,c=oe.length,l=new Map([...pp.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:il,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=m.get(t);if(!n){l.set(t,e),m.set(t,e);return}if(!n.range||!e.range||h(n.range)===h(e.range))return;let r=h(e.range),i=h(n.range);Zb(n.kind)===Zb(e.kind)?d.warnings.push({location:r,message:`Warning: the ${Xb(n.kind)} of '${t}' conflicts with \nits ${Xb(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${Xb(e.kind)} of '${t}' conflicts with \nits ${Xb(n.kind)} at ${i}.`})}),m=/* @__PURE__ */ new Map,ee=/* @__PURE__ */ new Set,_=/* @__PURE__ */ new Map,v=[],b=[...o.constants],te=o.variables.filter((e,t)=>o.variables.findIndex(t=>t.name===e.name)===t),x=te.map(e=>e.name),ne=te.map(e=>e.location);o.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:S(e);if(r){p(r);return}let i=t??pe(e,o.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!x.includes(e.name))),i.variables.forEach((e,t)=>{x.includes(e)||b.some(t=>t.name===e)||(x.push(e),ne.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>ee.add(e)),i.modules.forEach((e,t)=>_.set(t,e)),v.push(i)});let re=new Map(l),ie=[...o.constants.map(e=>({...e,kind:`Constant`})),...o.variables.map(e=>({...e,kind:`Variable`}))],ae=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});ie.forEach(e=>m.set(e.name,ae(e)));let le=e=>({key:fe(e),arity:tc(e),params:nc(e),kind:al(o,e)?`Theorem`:`Definition`,range:e.location.range}),ue=b.length===0&&x.length===0,fe=e=>o===i?e.name:`${e.name}@${n.id}`,C=/* @__PURE__ */ new Map,w=()=>new Map([...n.modules,..._]),T=e=>{let t=o.modules.find(t=>t.name===e.module);return t?ec(t.location,e.location)?_.get(t.name):void 0:w().get(e.module)},_e=e=>({imported:l,getInstance:e=>{let t=T(e),n=t?void 0:S(e.module);if(n)return{declarations:[],symbols:he(e,n),instancer:o.name};let r=t??pe(e.module,o.name),i=Kb(r);return{declarations:i,symbols:ge(e,r.exported,i,e=>e),instancer:o.name}},bound:re,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:fe,instanced:C,facts:ee,reports:f,warnings:n.warnings}),ve=e=>[...ie.filter(t=>ec(t.location,e)).map(e=>[e.name,ae(e)]),...o.definitions.filter(t=>ec(t.location,e)).map(e=>[e.name,le(e)])].reduce((e,[t,n])=>e.has(t)?e:e.set(t,n),new Map(l)),ye=e=>{let t=w(),r=t.get(e.name),i=r&&Yb(e,r.module);if(r&&!i)throw Jb(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=Se(e,{id:`${n.id}/${e.name}`,symbols:ve(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||_.set(e.name,o)};[...o.instances.map(e=>({location:e.location,link:()=>{let t=me(e,o,_e(o),ue,w().get(e.module));C.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||m.set(n,t))})}})),...o.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>ec(e.location,t.location)?-1:1).forEach(e=>e.link());let D=yb(Yl(o,(e,t)=>be(e,t,o.name,T(e))),E(l));n.errors.push(...dl(D,_e(D))),D.definitions.forEach(e=>{let t=fe(e);a.set(t,e),s.set(t,!ue);let n=le(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!ec(r,e.location))&&(l.set(e.name,n),e.isLocal||m.set(e.name,n))});let Ce={module:D,constants:b,variables:x,variableLocations:ne,visible:l,exported:m,modules:_,extended:v,facts:/* @__PURE__ */ new Set([...ee,...[...D.theorems,...D.assumptions].flatMap(e=>e.name??[])])};g.has(o.name)||g.set(o.name,Ce);let we=oe.splice(c).map(e=>({location:e.location,check:()=>ce(e)}));return n.levelChecks.push(()=>ku(D,{constants:new Set(b.map(e=>e.name)),variables:new Set(x),getDefinition:e=>a.get(l.get(e)?.key??e),getQualifiedName:e=>de.get(l.get(e)?.key??e)},we,se)),y.push(Ce),Ce},D=T(i).linked,Ce=t.traceFile,we=Ce===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:Ce}}],Te=[...t.moduleOperators??[],...we].map(e=>{let t=pe(e.module,i.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});y.push(...y.splice(y.indexOf(D),1)),se.length>0&&!t.isSanyReported&&t.print(ee(se));let Ee=e=>D.visible.get(e)?.key??e;D.visible.forEach((e,t)=>{let n=a.get(e.key);n&&e.key!==t&&a.set(t,n)}),Te.forEach(e=>{let t=e.key===void 0?void 0:a.get(e.key);e.kind!==`postcondition`&&t&&a.set(e.operator,t)});let De=[],Oe=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Oe(e,t)),De.push(...e.module.assumptions))};Oe(D,/* @__PURE__ */ new Set);let ke=D.constants.map(e=>e.name),Ae=D.variables,je=new Map([...f,...[...m].map(([e,t])=>[e,t.visible]),[i.name,D.visible]]),Me=e=>{let t=je.get(e.module??``)?.get(e.name);return t?.kind===`Definition`?t:void 0},O=e=>{if(e.module===void 0)return[e.name,Ee(e.name)];let t=Me(e);return t?[t.key]:[]},Ne=e=>e.module===i.name?[]:O(e),Pe=e=>{let t=a.get(e);return t?.kind===`Operator`?t.params.length:D.constants.find(t=>t.name===e)?.arity??d.get(e)?.arity??0},Fe=/* @__PURE__ */ new Map,Ie=/* @__PURE__ */ new Set,Le=(e,t)=>{d.set(e,t),a.delete(e),Fe.delete(e),Ie.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=Gb(e.value);Wr(t),Ne(e).forEach(e=>{let n=Pe(e);n===0?Fe.set(e,t):Le(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let Re=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=Re.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new _(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(Wb),Wb(e.value)]),Re.set(t,n)}),Re.forEach(e=>Ne(e).forEach(t=>Le(t,$b(e.name,Pe(t),e.rows))));let ze=new Map(e.substitutions.flatMap(e=>O(e).map(t=>[t,Ee(e.target)])));[...ze.keys()].forEach(e=>Fe.delete(e));let Be=(e,t,n)=>{let r=Ee(t),i=a.get(r);if(!(i!==void 0||d.has(r)||Fe.has(r)||ke.includes(t)||Ae.includes(t)))throw new _(`The configuration file substitutes for ${e} with the undefined identifier ${t}.`);if(i?.kind===`Operator`&&i.params.length!==n)throw new _(`The configuration file substitutes for ${e} with ${t} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(t=>{let n=t.name,r=t.target;if(!ke.includes(n)&&!D.visible.has(n))throw new _(`In the configuration file, the identifier ${n} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===r))throw new _(`In the configuration file, the identifier ${r} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Be(n,r,D.constants.find(e=>e.name===n)?.arity??D.visible.get(n)?.arity)});let Ve=e.substitutions.filter(e=>e.module!==void 0);[...je.keys()].forEach(e=>{let t=Ve.filter(t=>t.module===e);t.forEach(e=>{let n=Me(e);if(n){if(t.some(t=>t.name===e.target))throw new _(`In the configuration file, the identifier ${e.target} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`);Be(e.name,e.target,n.arity)}});let n=t.find(e=>!Me(e));if(n)throw new _(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let He=Ve.find(e=>!je.has(e.module??``));if(He)throw new _(`In the configuration file, the module name ${He.module} is not a module in the specification.`);let k=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(Ne)),Ue=(e,t)=>{if(k.has(e))return{key:e,prefix:t};let n=c.get(e);return n&&Ue(n.source,t+n.prefix)};c.forEach((e,t)=>{let n=Ue(e.source,e.prefix),r=a.get(t);if(!n||!r)return;let i=r.kind===`Operator`?r.params:[],o=_e(t,n.key,i,i.slice(n.prefix),r.location);a.set(t,o),D.visible.forEach((e,n)=>{e.key===t&&n!==t&&a.set(n,o)})}),Te.forEach(e=>pe(e.module,i.name).constants.forEach(t=>{let n=e.constants?.[t.name];n!==void 0&&Fe.set(t.name,n)}));let We=ke.filter(e=>!Fe.has(e)&&!ze.has(e)&&!Ie.has(e));if(We.length>0){let e=n.getDeclarationOrder(`constant`).find(e=>We.includes(e))??We[0];throw new _(`The constant parameter ${e} is not assigned a value by the configuration file.`)}Ce!==void 0&&d.forEach((e,t)=>{let n=vp(e);n&&d.set(t,n)});let Ge=tx(Ae,y.flatMap(e=>e.module.variables.map(e=>e.name))),Ke=Uu({definitions:a,substitutions:ze,constants:Fe,variableIndex:Ge,builtins:d,variables:Ae}),qe={runtime:p,definitions:a,builtins:d,constants:Fe,substitutions:ze,instanceNames:ue,variables:Ae,variableIndex:Ge,facts:Ke,startupValues:Array.from({length:Ke.ids.size},()=>void 0),substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Je=Du({constants:new Set(Fe.keys()),variables:/* @__PURE__ */ new Set([...Ae,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>ig(e,qe)}),Ye=e=>{try{W(e,{environment:qe,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof v)return e;throw e}};ze.forEach((e,t)=>{let n=a.get(e),r=ke.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Je.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Ye(n.body):void 0;if(r){let n=Nt(r)?``:` - specifically: ${r.message}`;throw new _(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Xe=new Set(y.flatMap(e=>e.module.instances.map(e=>e.module))),Ze=n.createDefinitionOrder();return{environment:qe,assumptions:De,variableLocations:D.variableLocations,instanceActions:le,startupDefinitions:y.filter(e=>!Xe.has(e.module.name)||Kb(e).length===0).flatMap(e=>Ze(e===D?void 0:e.module.name).flatMap(t=>{let n=a.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:y.flatMap(e=>xe.get(e.module.name)??[]),moduleOperators:Te,rootName:i.name}},ax={kind:`Boolean`,value:!0},ox={kind:`Boolean`,value:!1},sx=e=>e?ax:ox,cx=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,lx=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,ux=(e,t)=>({kind:e,body:t}),dx=(e,t,n)=>({kind:e,operands:[t,n]}),fx=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?fx(e,t.operands).operands:[t])}),px=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return px(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,px(t)),0)}},mx=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return mx(e.body);case`And`:case`Or`:return e.operands.some(mx)}},hx=/* @__PURE__ */ new WeakMap;let gx=0;const _x=e=>{let t=hx.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${gx++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(_x).join(`,`)})`;default:return`${e.kind}(${_x(e.body)})`}})();return hx.set(e,n),n},vx=(e,t)=>e===t||_x(e)===_x(t),yx=(e,t)=>{let n=_x(t);return e.some(e=>e===t||_x(e)===n)},bx=e=>e===`And`?`Or`:`And`,xx=(e,t)=>{switch(e.kind){case`Boolean`:return t?sx(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?ux(`Not`,e):e;case`Not`:return xx(e.body,!t);case`And`:case`Or`:return fx(t?bx(e.kind):e.kind,e.operands.map(e=>xx(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return ux(n,xx(e.body,t))}}},Sx=e=>{switch(e.kind){case`Boolean`:return sx(!e.value);case`Not`:return e.body;case`And`:case`Or`:return fx(bx(e.kind),e.operands.map(Sx));case`Always`:return ux(`Eventually`,Sx(e.body));case`Eventually`:return ux(`Always`,Sx(e.body));default:return ux(`Not`,e)}},Cx=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=Cx(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return sx(t)}return n.length===0?sx(!t):n.length===1?n[0]:fx(e.kind,n)}case`Not`:{let t=Cx(e.body);return t.kind===`Boolean`?sx(!t.value):ux(`Not`,t)}case`Always`:case`Eventually`:{let t=Cx(e.body);return ux(e.kind,t.kind===e.kind?t.body:t)}default:return e}},wx=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,Tx=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=Tx(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new v(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>fx(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=Tx(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=wx(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:fx(`Or`,t);n.push(ux(`Always`,ux(`Eventually`,e)))}return fx(`Or`,n)}case`Not`:return cx(e.body)?e:Tx(Sx(e.body));default:return e}},Ex=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?Ex(e.operands[0]):fx(e.kind,e.operands.map(Ex));case`Not`:return e.body.kind===`Not`?Ex(e.body.body):ux(`Not`,Ex(e.body));case`Always`:case`Eventually`:case`Next`:return ux(e.kind,Ex(e.body));default:return e}},Dx=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return Dx(e.operands[0]);let t=Math.floor(e.operands.length/2);return dx(e.kind,Dx(fx(e.kind,e.operands.slice(0,t))),Dx(fx(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return ux(e.kind,Dx(e.body));default:return e}},Ox=(e,t)=>{e.kind===`Eventually`&&!yx(t,e)&&t.push(e),`body`in e&&Ox(e.body,t),`operands`in e&&e.operands.forEach(e=>Ox(e,t))},kx=e=>{let t=e.filter(lx),n=e.flatMap(e=>e.kind===`Not`&&lx(e.body)?[e.body]:[]);return!t.some(e=>yx(n,e))},Ax=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,ux(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new v(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},jx=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:ux(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},Mx=(e,t,n)=>e.flatMap(e=>{let r=jx(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),Nx=e=>[...new Set(e.map(_x))].sort().join(`|`),Px=(e,t)=>{let n=new Set(t.map(Nx));return[...e.filter(e=>!n.has(Nx(e))),...t]},Fx=e=>{let t=Ax(e),n=Mx(t,`Always`,`And`),r=Mx(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=jx(t,`Eventually`,`Or`);if(n&&!(yx(e,n.first)||yx(e,n.second)))return Px(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(yx(e,t.first)||yx(e,t.second))&&!yx(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!kx(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=jx(t[e],`Always`,`And`);n&&(yx(t,n.first)||t.push(n.first),yx(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)yx(t,e.first)&&yx(t,e.second)&&!yx(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!kx(t)?[]:i(t)};return a(e)},Ix=e=>({particle:e,successors:[],statePredicates:e.filter(e=>px(e)<=1)}),Lx=e=>{let t=Fx([e]).map(Ix),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=Nx(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of Fx(n)){let n=Nx(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push(Ix(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},Rx=(e,t)=>!yx(e,t)||yx(e,t.body),zx=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&px(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=wx(e);if(n){let e=px(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(mx(e))throw new v(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},Bx=(e,t)=>{let n=e.findIndex(e=>vx(e,t));return n===-1?(e.push(t),e.length-1):n},Vx=e=>{let t=Tx(Cx(xx(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=Ex(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])zx(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:fx(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:vx(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&Dx(e.formula),n=[];t&&Ox(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>Bx(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>Bx(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>Bx(i,e))}));return{tableau:t&&Lx(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},Hx=()=>x(new v(`Temporal formula is a tautology (its negation is unsatisfiable).`),ie.livenessEvaluationFailure),Ux=/* @__PURE__ */ new Set([`~>`,`-+->`]),Wx=/* @__PURE__ */ new WeakSet,Gx=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),Kx=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),qx=(e,t)=>new v(`TLC cannot handle the temporal formula ${H(e)}${t===void 0?``:`:\n${t}`}`),Jx=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=Jx(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=qh(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=ig(e,n);if(t)return Yu(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:A(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return xl(e,(e,o)=>(a=Math.max(a,Jx(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(Ux.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=A(e)?void 0:Lg(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,Xg(o,e.args,Kx(n,t)))}default:return l(e)}},Yx=(e,t)=>{try{return mg(e,t)}catch(e){if(!(e instanceof v))throw e;if(!Nt(e))return;throw x(new v(`${m}${e.message}`),ie.error)}},Xx=(e,t,n,r,i=/* @__PURE__ */ new Set,a=!1,o,s=[])=>{let c=(e,t,c=o,l=i,u)=>Xx(e,t,n,r,l,a||u!==void 0&&n.substitutedDefinitions.has(u),c,u?.kind===`Operator`&&u.params.length===0?[...s,u.name]:s);if(e.kind===`And`)return e.operands.flatMap(e=>c(e,t,H(e)));if(e.kind===`Label`)return c(e.body,t);if(e.kind===`Let`)return c(e.body,Zx(e,t,n));if(e.kind===`Identifier`){let r=A(e)?qh(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return c(r.expression,r.scope,Wx.has(r)?e.name:o);let s=n.constants.has(e.name)?void 0:ig(e.name,n);if(!r&&s?.kind===`Operator`&&s.params.length===0&&(Yu(s,n)>0||Mg(s,n)===void 0)){if(i.has(s))throw g();return c(s.body,void 0,!a&&n.instanceNames.get(e.name)||s.name,/* @__PURE__ */ new Set([...i,s]),s)}}let l=Kx(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||Jx(e,t,n)===3)){let t=Rg(e,l),r=A(e)?void 0:ig(e.operator,n),o=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!a||o))return c(t.body,Xg(t,e.args,l),a&&r?r.name:e.operator,i,r)}let u=r&&e.kind===`Forall`&&e.bounds.every(e=>Jx(e.set,t,n)===0),d=u?Yx(e.bounds,l):void 0;if(u&&d){let n=[];if(hg(e.bounds,d,t,t=>(n.push(...c(e.body,t,H(e.body))),!1)),n.length===0)throw Hx();return n}return[{expression:e,scope:t,name:o,path:s}]},Zx=(e,t,n)=>{let r=e_(e.definitions,Kx(n,t));for(let e=r;e&&e!==t;e=e.parent)e.binding.kind===`Thunk`&&Wx.add(e.binding);return r},Qx=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,i=(e,t,i)=>{let a=i===0&&!r?Jx(e,t,n):i;if(a===0){let r=W(e,Kx(n,t));if(typeof r!=`boolean`)throw new v(`TLC expected a boolean value, but did not find one. ${Ih(e)}`);return sx(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},a=0,o=(e,t,r,o)=>{if(a>=100)throw g();a++;let s=p(e,t);a--;let c=px(s),l=c===0&&Jx(r,o,n)>2;return c>2||l?s:i(r,o,c)},s=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=Kx(n,t),s=A(e)||ig(i,n)===void 0?qh(t,i):void 0;if(s?.kind===`Thunk`&&!s.isReleased&&Wx.has(s))return c(e,()=>o(s.expression,s.scope,e,t));let l=s?.kind===`Operator`?s.operator:s?void 0:A(e)?zg(i,a):Lg(i,n),u=e.kind===`Apply`?e.args:[],f=l?.kind===`Builtin`&&u.length===2?Gx.get(l.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,fx(f,n))}if(l?.kind!==`Closure`)throw qx(e);let m=!A(e)&&ig(i,n)?.isRecursive===!0;return c(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>W(e,a)),o(l.body,Xg(l,u,a),e,t)),m)},c=(e,t,n=!1)=>{try{return t()}catch(t){let i=t instanceof l||n&&!r;throw!(t instanceof v)||i?t:qx(e)}},u=(e,t)=>{let r=Jx(e,t,n),a=[],o=e.kind===`Forall`;try{gg(e.bounds,Kx(n,t),t=>(a.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof v)||n instanceof l)throw n;if(r<=2)return i(e,t,r);throw qx(e,o&&!Nt(n)?n.message:void 0)}return a.length===0?sx(o):d(e,t,fx(o?`And`:`Or`,a))},d=(e,t,n)=>{let r=px(n);return r>2?n:i(e,t,r)},f=e=>e.kind===`Label`||e.kind===`Let`||e.kind===`And`||e.kind===`Or`||e.kind===`Forall`||e.kind===`Exists`||e.kind===`If`||e.kind===`Apply`&&(e.operator===`~`&&!A(e)||e.operator===`=>`),p=(e,t)=>{let a=Jx(e,t,n);if(a<=2&&!f(e))return i(e,t,a);switch(e.kind){case`Label`:return p(e.body,t);case`Let`:return p(e.body,Zx(e,t,n));case`Identifier`:return s(e,t);case`Apply`:{let n=e.args;return e.operator===`~>`?ux(`Always`,dx(`Or`,ux(`Not`,p(n[0],t)),ux(`Eventually`,p(n[1],t)))):e.operator===`~`&&!A(e)?d(e,t,ux(`Not`,p(n[0],t))):e.operator===`=>`?d(e,t,dx(`Or`,ux(`Not`,p(n[0],t)),p(n[1],t))):s(e,t)}case`And`:case`Or`:return d(e,t,fx(e.kind,e.operands.map(e=>p(e,t))));case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&Jx(e.condition,t,n)===0){let r=W(e.condition,Kx(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,dx(`Or`,dx(`And`,i,p(e.consequent,t)),dx(`And`,ux(`Not`,i),p(e.alternative,t))))}case`Always`:case`Eventually`:return ux(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=ux(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?ux(`Always`,ux(`Eventually`,dx(`Or`,i,a))):dx(`Or`,ux(`Eventually`,ux(`Always`,i)),ux(`Always`,ux(`Eventually`,a)))}default:throw qx(e)}};return p(e,t)},$x=(e,t,n,r,i)=>{let a=e=>$x(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a={environment:r,scope:e.scope,state:t,next:void 0},o=e.kind===`State`?W(e.expression,a):Ch(e.step,a);if(typeof o!=`boolean`)throw new v(`A state predicate was evaluated to a non-boolean value.`);return i.set(e,o),o}case`Action`:{if(e.enabled&&i.get(e.enabled)===!1)return!1;let a=e.scope,o=e.subscript;if(o&&Kr(W(o,{environment:r,scope:a,state:t,next:void 0}),W(o,{environment:r,scope:a,state:n,next:void 0})))return!1;let s=W(e.expression,{environment:r,scope:a,state:t,next:n});if(typeof s!=`boolean`)throw new v(`Encountered an action predicate that's not a boolean.`);return s}case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return $x(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new v(`TLC cannot evaluate a temporal formula in a single step`)}},eS=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>eS(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return $x(e,t[r],t[a(r)],i,/* @__PURE__ */ new Map)}},tS=`UnnamedAction`,nS={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},rS=e=>{let t=e.range??nS;return pi([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},iS=(e,t)=>{let n=[[`name`,e.name],[`location`,rS(e.location)]];return e.parameters.length>0&&n.push([`context`,pi(e.parameters)],[`parameters`,fi(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),pi(n)},aS=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),oS=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),sS=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,cS=e=>e.kind===`Apply`?e.args:[],lS=(e,t,n)=>{let r=sS(e);if(r===void 0)return;if(A(e)){let e=qh(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=Lg(r,n);return i?.kind===`Closure`?i:void 0},uS=(e,t)=>{try{return W(e,oS(t,void 0)),!0}catch(e){if(e instanceof ce)return!1;throw e}},dS=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&Ku(e,t)&&uS(e.body,t),fS=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&dS(e,t),pS=(e,t)=>{let n=ig(e.name,t);return n?.body===e.body&&fS(n,t)},mS=(e,t)=>{if(e.kind!==`Identifier`||!A(e))return;let n=qh(t,e.name);return n?.kind===`Thunk`?n:void 0},hS=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:e_(e.definitions,oS(n,t))};let r=mS(e,t);return r&&{expression:r.expression,scope:r.scope}},gS=(e,t)=>(e?.params??[]).flatMap(e=>{let n=qh(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),_S=(e,t)=>{try{return e()}catch(e){if(e instanceof ce)return t();throw e}},vS=(e,t,n,r,i)=>{let a=cS(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>Jx(e,n,i)!==0)?o():_S(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),W(e,oS(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},yS=(e,t,n,r,a)=>{let o=()=>({name:n?.name??tS,location:e.location,parameters:gS(n,t),expression:e,scope:t});if(fm.has(e.kind))throw x(new v(`${i}The next state relation is not a boolean expression.\n${Ih(e)}`),ie.error);switch(e.kind){case`Let`:return yS(e.body,e_(e.definitions,oS(r,t)),n,r,a);case`Label`:return yS(e.body,t,n,r,a);case`Or`:return e.operands.flatMap(e=>yS(e,t,n,r,a));case`Exists`:return _S(()=>{let i=[];return gg(e.bounds,oS(r,t),t=>(i.push(...yS(e.body,t,n,r,a)),!1)),i.length===0?[o()]:i},()=>[o()])}let s=A(e)?void 0:a.get(sS(e)??``),c=lS(e,t,r);if(s)return vS(s,e,t,c,r);if(!c)return[o()];let l=cS(e),u=A(e)?c.name:r.instanceNames.get(sS(e)??``)??c.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return pS(c,r)||l.some(e=>Jx(e,t,r)!==0)?d():_S(()=>{let e=l.reduce((e,n,i)=>({name:c.params[i].name,binding:{kind:`Value`,value:W(n,oS(r,t))},parent:e}),c.scope);return yS(c.body,e,{...c,name:u},r,a)},d)},bS=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>bS(e,t,n,r,i,o),s=(e,t,n)=>aS(e,ml(t,a),n),c=hS(e,t,n);if(c){o(c.expression,c.scope);return}let l=lS(e,t,n);if(l&&pS(l,n))return;let u=l?[...a,...pl.get(l.body)??[]]:a;if(l&&l.params.length===0){if(Jx(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,Xg(l,e.args,oS(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(tS,e,t));return}let d=Jx(e,t,n);d<=1?r.inits.push(s(tS,e,t)):d===3&&r.temporals.push(s(tS,e,t))},xS=(e,t,n,r,i)=>{let a=(t,n)=>xS(e,t,n,r,i),o=hS(t,n,r);if(o){a(o.expression,o.scope);return}let s=lS(t,n,r);if(s&&pS(s,r))return;if(s&&s.params.length===cS(t).length){a(s.body,t.kind===`Apply`?Xg(s,t.args,oS(r,n)):s.scope);return}if(t.kind===`Forall`&&_S(()=>(gg(t.bounds,oS(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(aS(e,a)):Jx(a,n,r)<2?i.invariants.push(aS(e,a)):i.impliedTemporals.push(aS(e,t));return}let c=Jx(t,n,r);c<=1?i.impliedInits.push(aS(e,t)):c===3&&i.impliedTemporals.push(aS(e,t))},SS=(e,t)=>{let n=ig(e,t);return n?.kind===`Operator`&&!fS(n,t)?n:void 0},CS=(e,t,n)=>{let r={inits:[],actions:[],temporals:[],invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]},i=[],a=e.specification===void 0?void 0:SS(e.specification,t);a&&(bS(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:tS,location:e.frames[0].location,parameters:[],expression:ml(e.expression,e.frames),scope:e.scope}]:yS(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Lg(e.init,t);o?.kind===`Closure`&&r.inits.push(aS(e.init??``,o.body));let s=e.next===void 0?void 0:Lg(e.next,t);return s?.kind===`Closure`&&r.actions.push(...yS(s.body,s.scope,s,t,n)),r},wS=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);let a=hS(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&A(e)?qh(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!A(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=lS(e,t,n);if(!s||s.params.length!==cS(e).length)return!0;let c=ig(s.name,n);return c?.body===s.body&&dS(c,n)?!0:i(s.body,e.kind===`Apply`?Xg(s,e.args,oS(n,t)):s.scope)};return i(e,t)?r:void 0},TS=(e,t,n)=>CS(e,t,n).inits,ES=(e,t,n)=>CS(e,t,n).actions,DS=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>L(e[1])).join(`,`)})`,OS=(e,t,n=!1)=>`${e.name===tS?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:DS(e)} ${h(e.location.range??nS)}`,kS=e=>`${e.name}${DS(e)}`,AS=(e,t,n,r)=>{let i=CS(e,t,r);e.invariants.forEach(e=>{let n=SS(e,t);n&&i.invariants.push(aS(e,n.body))}),e.properties.forEach(e=>{let n=SS(e,t);n&&xS(e,n.body,void 0,t,i)});let a=t.coverage,o=(e,t)=>Yr(e.map(e=>{let n=a&&t&&Zo(a,t,e.expression);return iS(e,n&&pi(n))})),s=e=>Yr(e.flatMap(e=>{let n=SS(e,t);return n?[pi([[`name`,n.name],[`location`,rS(n.location)]])]:[]}));return pi([[`inits`,o(i.inits,`init`)],[`actions`,o(i.actions,`next`)],[`temporals`,o(i.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,Yr(t.variables.map((e,t)=>pi([[`name`,e],[`location`,rS(n[t])],...a?[[`coverage`,pi([[`distinct`,zo(a,t)]])]]:[]])))],[`actionconstraints`,s(e.actionConstraints)],[`constraints`,s(e.constraints)]])},jS=e=>[...e].map(([e,t])=>`${e}>${t.name}`).sort().join(`,`),MS=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},NS=e=>x(new v(`${i}${e}`),ie.error),PS=e=>{let t=I(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!un(e)||!un(i))throw NS(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},FS=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${IS(t)}`:n},IS=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map(IS).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${FS(e.pattern,e.set)}:${IS(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map(IS).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${IS(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>FS(e.pattern,e.set)).join(`,`)}|->${IS(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map(IS);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},LS=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,RS=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new _(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw NS(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>W(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!M(a)||!N(a))throw NS(`The symmetry operator must specify a set of functions.`);let o=P(a).elements;if(!o.every(ln))throw NS(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=IS(LS(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(St.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(PS).forEach(e=>{e.size>0&&d.set(jS(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=MS(n,e),r=jS(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!LS(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>un(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},zS=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=VS(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(VS(e[r],t));return a}},BS=(e,t)=>{let n=[],r=[];for(let i of e){let e=VS(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(Jn);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(Jn(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},VS=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=BS(e.elements,t);return n?$n(n):e}if(n===`Function`||n===`LazyFunction`&&N(e.domain)){let n=I(e),r=zS(n.domain,t),i=zS(n.range,t)??n.range;if(r){let e=ti(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?tr(n.domain,e.range):e}return i===n.range?n:tr(n.domain,i)}if(n===`Interval`||!M(e)||!N(e))return e;let r=P(e),i=zS(r.elements,t);return i?Yr(i):r},HS=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=VS(e[o],i),a===0&&(a=Jn(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},US={line:0,column:0},WS=e=>({kind:`Identifier`,name:e,location:US}),GS=/* @__PURE__ */ new Set([`name`,`property`]),KS=(e,t,n)=>{let r=ig(t,n);if(!r)throw new _(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new _(GS.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},qS=e=>e.body.kind===`Number`||e.body.kind===`String`,JS=(e,t,n)=>{if(n.constants.has(e))return n.constants.get(e);if(Ku(t,n)&&!qS(t))try{return W(WS(e),vC(n,void 0,void 0))}catch(e){if(e instanceof v||y(e))return;throw e}},YS=(e,t,n)=>{if(n.constants.has(t))throw new _(`The ${e} ${t} cannot be a constant.`);let r=KS(e,t,n);if(JS(t,r,n)!==void 0)throw new _(`The ${e} ${t} cannot be a constant.`);return r},XS=(e,t,n)=>{let r=n.constants.has(t)?void 0:KS(e,t,n),i=r?JS(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new _(`The ${e} of ${t} is equal to ${L(i)}`);return i===void 0?r:void 0},ZS=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},QS=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Ng(e.startupDefinitions,r),t.invariants.forEach(e=>{XS(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},$S=(e,t)=>{let n=Du({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=XS(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1790
|
+
`]]),fv=(e=`master`)=>e===`1.7.4`?dv:uv,pv=(e,t)=>e.every(e=>gu(e,t)),mv=_l([!1,!0]);fl(mv);const hv=(e,t,n)=>{if(n-t===1)return e[t];let r=t+n>>1;return Sl(hv(e,t,r),hv(e,r,n))},gv=[`\\cup`,`\\cap`,`\\`],_v=e=>typeof e==`object`&&e.kind===`MixedSet`,vv=e=>e.kind===`Interval`||e.kind===`Set`&&e.isNormalized,yv=(e,t,n)=>{t.kind===`Interval`&&ou(t);let r=t.kind===`Interval`?t:dl(t);if(e!==`\\cup`){let i=e===`\\cap`,a=[];return js(r,e=>{gu(e,n)===i&&ks(a,e)}),vv(t)?Dc(a):vl(a)}if(ru(t))return n;if(!Ns(n))return Fc({kind:`SetOperation`,operator:e,left:t,right:n});let i=[];return js(r,e=>ks(i,e)),js(n.kind===`Interval`?n:G(n).elements,e=>{gu(e,t)||ks(i,e)}),vl(i)},bv=(e,t)=>{let n=t.elements,r=0,i=n.length;for(;r<i;){let t=r+i>>1,a=n[t];if(typeof a!=`number`)return;a<e.low?r=t+1:i=t}for(let t=e.low;t<=e.high;t++,r++){if(r===n.length)return!1;let e=n[r];if(e!==t)return typeof e!=`number`&&void 0}return!0},xv=(e,t)=>{if(typeof t==`object`&&t.kind===`Interval`&&t.low<=e.low&&t.high>=e.high)return!0;let n=typeof t==`object`&&t.kind===`Set`?bv(e,t):void 0;if(n!==void 0)return n;for(let n=e.low;n<=e.high;n++)if(!gu(n,t))return!1;return!0},Sv=(e,t)=>{let n=(t,n)=>$f([xp(t,n,e)()],0,e);return{...Y(e,2,e=>t(n(e,0),()=>n(e,1))),evaluateBinary:void 0,isLazy:!0}},Cv=[tp(`TRUE`,!0),tp(`FALSE`,!1),tp(`BOOLEAN`,mv),tp(`STRING`,{kind:`InfiniteSet`,name:`STRING`}),ip(`=`,ml),ip(`#`,(e,t)=>!ml(e,t)),Y(`~`,1,e=>!$f(e,0,`~`)),Y(`<=>`,2,e=>$f(e,0,`<=>`)===$f(e,1,`<=>`)),Sv(`/\\`,(e,t)=>e&&t()),Sv(`\\/`,(e,t)=>e||t()),Sv(`=>`,(e,t)=>!e||t()),Y(`\\in`,2,e=>gu(J(e,0,`\\in`),J(e,1,`\\in`))),Y(`\\notin`,2,e=>!gu(J(e,0,`\\notin`),J(e,1,`\\notin`))),ip(`\\subseteq`,(e,t)=>{if(typeof e==`object`&&e.kind===`Interval`)return xv(e,t);if(!Ms(e))throw new w(`\\subseteq expects a set but received ${q(e)}`);return typeof e==`object`&&e.kind===`Subset`&&typeof t==`object`&&t.kind===`Subset`&&W(e.base)?pv(G(e.base).elements,t.base):!Zl(e,e=>!gu(e,t))}),...gv.map(e=>Y(e,2,t=>{let n=J(t,0,e),r=J(t,1,e),i=e!==`\\cup`&&typeof r==`object`&&r.kind===`Interval`&&typeof n==`object`&&n.kind!==`Interval`;if(Ns(n)&&Ns(r)&&!_v(n)&&!_v(r)&&!i&&!As(n)&&!As(r)){if(e===`\\cup`&&ru(n))return r;let t=e===`\\cup`?Sl:e===`\\cap`?xl:bl;return mu((n,r)=>{let i=G(n),a=G(r),o=t(i,a);if(e===`\\cup`){let e=dl(i),t=bl(a,i).elements,n=e===i.elements&&(t.length===0||xc(e[e.length-1],t[0])<0);if(e.length+t.length>Ds())throw new u(Os());if(n&&!i.isNormalized)return o;let r=o===i?Ec(o.elements):o;return n||(r.writtenElements=[...e,...t]),r}return o===n||(o.isNormalized=vv(n),i.writtenElements&&!i.isNormalized&&(o.writtenElements=i.writtenElements.filter(e=>gu(e,o)))),o},(t,n)=>yv(e,t,n),n,r)}return Ns(n)?yv(e,n,r):e!==`\\`&&Ns(r)?yv(e,r,n):Fc({kind:`SetOperation`,operator:e,left:n,right:r})})),Y(`SUBSET`,1,e=>({kind:`Subset`,base:J(e,0,`SUBSET`)})),Y(`UNION`,1,e=>{let t=J(e,0,`UNION`),n=Is(t)?dl(t):[],r=n.filter(Is);if(!Is(t)||r.length!==n.length)return Fc({kind:`Union`,base:t});let i=r.flatMap(dl),a=()=>{let e={kind:`MixedSet`,elements:[]};return i.forEach(t=>{gu(t,e)||ks(e.elements,t)}),vl(e.elements)};return _v(t)||r.some(_v)?a():r.length===0?yl:mu(e=>uu(hv(e,0,e.length),i),a,r.map(G),void 0)}),Y(`DOMAIN`,1,e=>{let t=J(e,0,`DOMAIN`);if(!Ps(t))throw new w(`DOMAIN expects a function but received ${q(t)}`);return Lu(t)})],wv=gp(`Integers`,`Neg`,`IntValue`,1),Tv=e=>{let n=gp(e,`DotDot`,`IntervalValue`,2);return[_p(e,`+`,`Plus`,(e,t)=>e+t),_p(e,`-`,`Minus`,(e,t)=>e-t),_p(e,`*`,`Times`,(e,t)=>e*t),_p(e,`^`,`Expt`,(e,n)=>{if(n<0)throw new t(`The second argument of ^ should be a natural number, but instead it is:\n${n}`);if(e===0&&n===0)throw new t(`0^0 is undefined.`);return e**n}),_p(e,`\\div`,`Divide`,(e,n)=>{if(n===0)throw new t(`The second argument of \\div is 0.`);let r=Math.floor(e/n);if(ap(r))throw op(`${e} \\div ${n}`);return r}),_p(e,`%`,`Mod`,(e,n)=>{if(n<=0)throw new t(`The second argument of % should be a positive number, but instead it is:\n${n}`);return(e%n+n)%n}),ip(`..`,(e,t)=>{let r=hp(t,n);return{kind:`Interval`,low:hp(e,n),high:r}})]},Ev=Tv(`Naturals`),Dv=Tv(`Integers`),Ov=e=>{let t=Ev.indexOf(e);return t===-1?void 0:Dv[t]},kv=e=>{let t=(t,n=`tlc2.value.IBoolValue`)=>`public static ${n} tlc2.module.${e}.${t}(tlc2.value.impl.Value,tlc2.value.impl.Value)`,n=e===`Integers`;return[mp(yp(`<`,(e,t)=>e<t),t(`LT`)),mp(yp(`>`,(e,t)=>e>t),n?t(`GT`,`tlc2.value.impl.BoolValue`):t(`GT`)),mp(yp(`<=`,(e,t)=>e<=t),t(`LE`)),mp(yp(`>=`,(e,t)=>e>=t,n?`>=`:`>`),t(`GEQ`))]},Av=[tp(`Nat`,{kind:`InfiniteSet`,name:`Nat`}),...Ev,...kv(`Naturals`)],jv=[tp(`Int`,{kind:`InfiniteSet`,name:`Int`}),...Dv,...kv(`Integers`),Y(`-.`,1,e=>{let t=hp(J(e,0,`-`),wv);if(ap(-t))throw op(`-${t}`);return-t})],Mv=(e,n,r)=>{let i=J(e,n,r),a=du(i);if(!a)throw new t(`${r}\n${U(q(i))}`);return a},Nv=(e,t,n)=>{let r=J(e,t,n);return typeof r==`string`?r:Mv(e,t,n)},Pv=(e,t,n)=>{let r=J(e,t,`SubSeq`);if(typeof r!=`number`)throw Xf(n,`SubSeq`,`natural number`,r);return r},Fv=(e,t,n)=>typeof e==`string`?dc(e.slice(t,n)):Pl(e.slice(t,n)),Iv=(e,t)=>`The ${e}argument of ${t} should be a sequence, but instead it is:`,Lv=(e,t)=>`Evaluating an expression of the form ${e} when s is not a ${t}:`,Rv=(e,t)=>{let n=Et.get(e);return n?t.map(e=>{let t=n.get(e.name);return t?mp(e,t):e}):t},zv=e=>Rv(`Sequences`,[Y(`Seq`,1,e=>({kind:`SequenceSet`,base:J(e,0,`Seq`)})),Y(`Len`,1,e=>Nv(e,0,Iv(``,`Len`)).length),Y(`\\o`,2,e=>{let n=Nv(e,0,Lv(`s \\o t`,`sequence`));if(typeof n!=`string`){let t=Mv(e,1,Lv(`t \\o s`,`sequence`)),r=n.length===0?J(e,1,`\\o`):t.length===0?J(e,0,`\\o`):void 0;return r!==void 0&&jc(r)===`tuple`?r:Pl([...n,...t])}let r=J(e,1,`\\o`);if(typeof r!=`string`)throw new t(`${Lv(`t \\o s`,`string`)}\n${U(q(r))}`);return dc(n+r)}),Y(`Append`,2,t=>Pl([...Mv(t,0,Lv(e===`1.7.4`?`Append(v, s)`:`Append(s, v)`,`sequence`)),J(t,1,`Append`)])),Y(`Head`,1,e=>{let n=Mv(e,0,Iv(``,`Head`));if(n.length===0)throw new t(`Attempted to apply Head to the empty sequence.`);return n[0]}),Y(`Tail`,1,e=>{let n=Nv(e,0,Iv(``,`Tail`));if(n.length===0)throw new t(`Attempted to apply Tail to the empty sequence.`);return Fv(n,1)}),Y(`SubSeq`,3,e=>{let n=Nv(e,0,Iv(`first `,`SubSeq`)),r=Pv(e,1,`second`),i=Pv(e,2,`third`);if(r>i)return Fv(n,0,0);let a=r<1||r>n.length?{position:`second`,value:r}:i>n.length?{position:`third`,value:i}:void 0;if(a)throw new t(`The ${a.position} argument of SubSeq must be in the domain of its first argument:\n${U(q(J(e,0,`SubSeq`)))}\n, but instead it is\n${a.value}`);return Fv(n,r-1,i)}),np(`SelectSeq`,2,e=>{let n=ep(e,1,`SelectSeq`);return Pl(Mv(e,0,Iv(`first `,`SelectSeq`)).filter(e=>{let r=n.call([e]);if(typeof r!=`boolean`)throw new t(`The second argument of SelectSeq should be a boolean-valued operator, but instead it is:\n<Operator ${n.name}>`);return r}))})]),Bv=e=>Rv(`FiniteSets`,[Y(`IsFiniteSet`,1,e=>cu(J(e,0,`IsFiniteSet`))),Y(`Cardinality`,1,n=>{let r=J(n,0,`Cardinality`);if(!Ms(r)||typeof r==`object`&&(r.kind===`InfiniteSet`||r.kind===`SequenceSet`))throw new t(`Attempted to compute cardinality of the value\n${U(q(r))}`);return ou(r,e)})]),Vv=[mp(Y(`Warshall`,1,e=>{let n=J(e,0,`Warshall`);if(!Ms(n)||mc(n))throw new t(`Applying TransitiveClosure to the following value,\nwhich is not an enumerable set:\n${U(q(n))}`);ou(n);let r=[],i=/* @__PURE__ */ new Map,a=e=>{let t=nd(e),n=i.get(t)??r.length;return n===r.length&&(i.set(t,n),r.push(e)),n},o=G(n).elements.map(e=>{let n=du(e);if(n?.length!==2)throw new t(`Attempted to apply TransitiveClosure to a set containing\nthe following value:\n${U(q(e))}`);return[a(n[0]),a(n[1])]}),s=r.map(()=>r.map(()=>!1));o.forEach(e=>{s[e[0]][e[1]]=!0});for(let e=0;e<r.length;e++)for(let t=0;t<r.length;t++)if(s[t][e])for(let n=0;n<r.length;n++)s[e][n]&&(s[t][n]=!0);return vl(r.flatMap((e,t)=>r.flatMap((n,r)=>s[t][r]?[Pl([e,n])]:[])))}),`public static tlc2.value.impl.Value tlc2.module.TransitiveClosure.Warshall(tlc2.value.impl.Value)`)],Hv=(e,t,n,r,i,a)=>{if(e===`TransitiveClosure`)return Vv;if(e===`AnySet`)return[tp(`ANY`,vc)];if(e===`IOUtils`)return s_(r,a);if(e===`_TLCTrace`)return u_(r);if(!fv(n.version).has(e))return;let o=Gv(e,t,n,r,i);return e===`Randomization`&&o?[...o,F_(n)]:o},Uv=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]],[`Sequences`,[`Naturals`]],[`FiniteSets`,[`Naturals`,`Sequences`]],[`TLC`,[`Naturals`,`Sequences`,`FiniteSets`]],[`Randomization`,[`Naturals`,`FiniteSets`,`Sequences`]],[`_Possible`,[`TLC`,`TLCExt`,`Naturals`,`Sequences`,`FiniteSets`,`Integers`]],[`Json`,[`Sequences`,`FiniteSets`,`TLC`,`Naturals`]],[`Bags`,[`Naturals`]],[`TLCExt`,[`TLC`,`Integers`,`Naturals`,`Sequences`,`FiniteSets`]]]),Wv=/* @__PURE__ */ new Map([[`Integers`,[`Naturals`]]]),Gv=(e,t,n,r,i)=>{switch(e){case`Naturals`:return Av;case`Integers`:return jv;case`Sequences`:return zv(n.version);case`FiniteSets`:return Bv(n.version);case`TLC`:return Rv(`TLC`,cv(t,n));case`Randomization`:return I_(n);case`_Possible`:return Z_(t,n);case`Json`:return o_(r);case`Bags`:return Rv(`Bags`,jg(i));case`TLCExt`:return Rv(`TLCExt`,X_(t,n));default:return}},Kv=(e,t,n)=>{let r=e.callStack;if(!r)return n();let i=r.expressions.at(-1)!==t&&Cp.get(t)||[];r.expressions.push(...i,t);let a=pu.sets,o=a??[],s=o.length;pu.sets=o;try{return n()}catch(e){throw SS(r,o.slice(s),e),e}finally{r.isFrozen||(r.expressions.length-=i.length+1),o.length=s,pu.sets=a}},qv=(e,t,n)=>e.coverage?_f(e.coverage,t,n):-1,Jv=(e,t,n)=>e.coverage?yf(e.coverage,t,n):n(),Yv=(e,t,n,r)=>Jv(e,t,()=>$(n,r)),Xv=(e,t,n,r)=>{let i=Yv(e,t,n,r),a=e.coverage;if(a?.covered.has(n))for(let e=t;e!==-1;e=a.prefixes[e])a.primary[e]--;return i},Zv=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},Qv=e=>!e.includes(void 0),$v=e=>e.variables.map(()=>void 0),ey=(e,t,n)=>{let r=[...e];return r[t]=n,r},ty=(e,t)=>{let n=e.operands[0].location,r=e.location.range,i=e.prefixEnds?.[t-2],a=r&&i?{...n,range:{...r,end:i}}:e.location;return{...e,operands:e.operands.slice(0,t),location:a}},ny=(e,t)=>e.coverage?e.coverage.prefixes[t]:-1,ry=e=>e.kind===`Identifier`?e.name:void 0,iy=(e,t,n)=>{if(t.kind===`Label`)return iy(e,t.body,n);let r=ry(t);if(r===void 0)return;let i=ax(n,r);if(i?.kind===`Thunk`)return iy(e,i.expression,i.scope);if(i)return;let a=e.variableIndex.get(r);if(a!==void 0)return a;let o=Xx(r,e);return o?.kind===`Closure`&&o.params.length===0?iy(e,o.body,o.scope):void 0},ay=(e,t,n)=>{if(t.kind===`Prime`)return iy(e,t.expression,n);if(t.kind===`Label`)return ay(e,t.body,n);let r=ry(t);if(r===void 0)return;let i=ax(n,r);if(i?.kind===`Thunk`)return ay(e,i.expression,i.scope);if(i)return;let a=Xx(r,e);return a?.kind===`Closure`&&a.params.length===0?ay(e,a.body,a.scope):void 0},oy=e=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean expression.`);return e},sy=e=>!e.isEnabled&&(e.isInit||e.environment.runtime.isWarningEnabled),cy=(e,t,n,r)=>{let i=uy(e,t,n,r);return i&&e.coverage&&!e.isInit&&vf(e.coverage,r),i},ly=(e,t,n)=>{let r=e.coverage;return r&&e.isInit&&(vf(r,n),vf(r,r.roots[n])),e.onState(t),!0},uy=(e,t,n,r)=>t===void 0?Qv(n)?ly(e,n,r):e.onIncomplete?.(n)??!1:Qv(n)&&sy(e)?fy(e,t,n,r):t.kind===`Predicate`?py(e,t.expression,t.rest,t.scope,n,t.node):t.kind===`Unchanged`?ky(e,t.expression,t.rest,t.scope,n,t.node):dy(e,t,n)&&cy(e,t.rest,n,t.node),dy=(e,t,n)=>{let r=e.environment,i=Yv(e,t.node,t.expression,{environment:r,scope:t.scope,state:e.current,next:void 0}),a=(()=>{try{return Yv(e,t.node,t.expression,{environment:r,scope:t.scope,state:n,next:void 0})}catch(t){throw e.isEnabled?ix(t,r.runtime.version):t}})();try{return!ml(i,a)}catch(t){throw e.callStack&&SS(e.callStack,[i],t),t}},fy=(e,t,n,r)=>{for(let i=t;i!==void 0;i=i.rest){if(i.kind===`Unchanged`)return ky(e,i.expression,i.rest,i.scope,n,i.node);if(!(i.kind===`Changed`?dy(e,i,n):oy(Yv(e,i.node,i.expression,Zv(e,i.scope,n))))){let t=e.coverage;return t&&e.isInit&&t.secondary[t.roots[r]]++,!1}}return ly(e,n,r)},py=(e,t,n,r,i,a)=>my(e,t,n,r,i,qv(e,a,t)),my=(e,t,n,r,i,a)=>Kv(e,t,()=>{switch(t.kind){case`Let`:{let o=Zv(e,r,i),s=t.definitions,c=e.coverage&&!e.isEnabled?pS(s,o,{impure:new Set(s),streamed:/* @__PURE__ */ new Set}):pS(s,o);return py(e,t.body,n,c,i,a)}case`Label`:return py(e,t.body,n,r,i,a);case`Selection`:return py(e,t.expression,n,r,i,a);default:if(Sy.has(t.kind))throw new w(`The state relation is not a boolean expression.`);return Kv(e,t,()=>Dy(e,t,n,r,i,a))}}),hy=(e,t,n,r,i)=>oy(t)&&cy(e,n,r,i),gy=/* @__PURE__ */ new Set([`=`,`#`,`~`,`<=>`,`/\\`,`\\/`,`=>`,`\\in`,`\\notin`,`\\subseteq`,`\\cup`,`\\cap`,`\\`,`SUBSET`,`UNION`,`DOMAIN`,`~>`,`-+->`,`\\cdot`]),_y=(e,t,n,r,i,a)=>{let o=Zv(e,r,i);if(t.kind===`Identifier`){let s=ax(r,t.name);if(s?.kind===`Thunk`&&s.cache===void 0){let t=e.coverage?.values.get(s)??a;return py(e,s.expression,n,s.scope,i,t)}if(s?.kind===`Operator`&&s.operator.kind===`Closure`&&s.operator.params.length===0)return py(e,s.operator.body,n,s.operator.scope,i,a);let c=s?void 0:e.environment.definitions.get(t.name),l=s?void 0:Xx(t.name,e.environment);return l?.kind===`Closure`&&l.params.length===0&&!e.environment.variableIndex.has(t.name)&&!(c&&zh(c,e.environment))?py(e,l.body,n,l.scope,i,a):hy(e,Xv(e,a,t,o),n,i,a)}let s=Zx(t,o);if(s?.kind===`Closure`&&s.params.length===t.args.length){let r=Jv(e,a,()=>lS(s,t.args,o));return py(e,s.body,n,r,i,a)}let c=gy.has(t.operator)?Yv(e,a,t,o):Xv(e,a,t,o);return hy(e,c,n,i,a)},vy=(e,t,n,r,i,a)=>{let o=n[r];return o===void 0?cy(e,t,ey(n,r,i),a):ml(o,i)&&cy(e,t,n,a)},yy=(e,t,n,r,i)=>({kind:e,expression:t,scope:n,node:r,rest:i}),by=(e,t,n,r,i,a)=>{let[o,s]=t.args,c=e.isInit?iy(e.environment,o,r):ay(e.environment,o,r),l=Zv(e,r,i);if(c===void 0)return Yv(e,a,t,l)===!0&&cy(e,n,i,a);let u=Yv(e,a,s,l),d=i[c];if(t.operator===`=`)return vy(e,n,i,c,u,a);let f=t.operator===`\\subseteq`?{kind:`Subset`,base:u}:u;if(typeof f==`object`&&f!==u&&(e.callStack?.sources.set(f,s),e.coverage?.values.set(f,a)),d!==void 0)return Yv(e,a,t,l)===!0&&cy(e,n,i,a);if(!Ll(f))throw new w(`The right side of \\IN is not enumerable.`);let p=Ql(f),m=e.generator;if(m){let t=Ty(e,f,p);for(let r=0;r<t.length;r++){let o=cy(e,n,ey(i,c,t[r]),a);if(m.kept>0)return o}}let h=e.coverage&&kf(e.coverage,f,p,!1),g=p.reduce((t,r)=>(h?.next(),cy(e,n,ey(i,c,r),a)||t),!1);return h?.next(),g},xy=/* @__PURE__ */ new Set([`=`,`\\in`,`\\subseteq`]),Sy=/* @__PURE__ */ new Set([`Number`,`Decimal`,`String`]),Cy={Always:`[]`,Eventually:`<>`,WeakFairness:`WF`,StrongFairness:`SF`},wy=e=>{let t=e.kind===`Apply`&&(e.operator===`~>`||e.operator===`-+->`)?e.operator===`~>`?`a ~> b`:`a -+-> formula`:Cy[e.kind];if(t!==void 0)return`In computing ENABLED, TLC encountered a temporal formula (${t}).\n${Q(e)}`;if(e.kind===`UnboundedQuantifier`)return e.isTemporal?`In computing ENABLED, TLC encountered temporal quantifier.\n${Q(e)}`:`In computing ENABLED, TLC encountered unbounded quantifier. Make sure that the expression is of form ${e.quantifier===`Forall`?`\\A`:`\\E`} x \\in S: P(x).\n${Q(e)}`;if(e.kind===`Choose`&&e.set===void 0)return`In computing ENABLED, TLC encountered unbounded CHOOSE. Make sure that the expression is of form CHOOSE x \\in S: P(x).\n${Q(e)}`},Ty=(e,t,n)=>{let r=e.environment.runtime,i=D_(n.length,t,r.getRandom(),r.version);return e.coverage&&Of(e.coverage,t,n.length,i),i},Ey=(e,t,n,r)=>{let i=[],a=e.environment.runtime.version,o=Jv(e,r,()=>Tx(t.bounds,e=>{let t=$(e,n);return{value:t,elements:Sx(t,e,a)}})),s=o.map(e=>e.elements);Dx(t.bounds,s,n.scope,e=>(i.push(e),!1));let c=e.coverage;return{bindings:i,charge:c&&jf(c,o.map(e=>e.value),s)}},Dy=(e,t,n,r,i,a)=>{let o=Zv(e,r,i);switch(t.kind){case`Identifier`:return _y(e,t,n,r,i,a);case`Apply`:return xy.has(t.operator)&&t.args.length===2?by(e,t,n,r,i,a):t.operator===`=>`&&t.args.length===2?oy(Yv(e,a,t.args[0],o))?py(e,t.args[1],n,r,i,a):cy(e,n,i,a):_y(e,t,n,r,i,a);case`And`:{let o=t.operands;if(t.isBulleted||o.length===2){let t=o.slice(1).reduceRight((e,t)=>yy(`Predicate`,t,r,a,e),n);return py(e,o[0],t,r,i,a)}let s=o[o.length-1];return my(e,ty(t,o.length-1),yy(`Predicate`,s,r,a,n),r,i,ny(e,a))}case`Or`:{let o=t.operands,s=t.isBulleted||o.length===2,c=e.generator;if(c){let l=s?o.length:2,u=Math.floor(c.random.nextDouble()*l),d=__(c.random),f=!1;for(let p=0;p<l;p++){let m=(u+p*d)%l;if(f=(s||m===1?py(e,o[s?m:o.length-1],n,r,i,a):my(e,ty(t,o.length-1),n,r,i,ny(e,a)))||f,c.kept>0)return f}return f}if(s)return o.reduce((t,o)=>py(e,o,n,r,i,a)||t,!1);let l=my(e,ty(t,o.length-1),n,r,i,ny(e,a)),u=py(e,o[o.length-1],n,r,i,a);return l||u}case`Exists`:{let r=e.generator;if(r){let s=e.environment.runtime.version,c=Jv(e,a,()=>Tx(t.bounds,e=>$(e,o))).map((n,r)=>Ty(e,n,bx(n,t.bounds[r].set,s))),l=!1;return Dx(t.bounds,c,o.scope,o=>(l=py(e,t.body,n,o,i,a)||l,r.kept>0)),l}let s=Ey(e,t,o,a);return s.bindings.reduce((r,o)=>(s.charge?.(),py(e,t.body,n,o,i,a)||r),!1)}case`Forall`:{let r=Ey(e,t,o,a),s=r.bindings;if(s.forEach(()=>r.charge?.()),s.length===0)return cy(e,n,i,a);let c=s.slice(1).reduce((e,n)=>yy(`Predicate`,t.body,n,a,e),n);return py(e,t.body,c,s[0],i,a)}case`If`:return py(e,oy(Yv(e,a,t.condition,o))?t.consequent:t.alternative,n,r,i,a);case`Case`:{let s=t.arms.find(t=>oy(Yv(e,a,t.condition,o)))?.body??t.other;if(s===void 0)throw new w(`TLC encountered a CASE with no conditions true.`);return py(e,s,n,r,i,a)}case`FunctionApplication`:{let r=Px(Yv(e,a,t.function,e.isInit?o:lx(o)));if(r){let s=Jv(e,a,()=>Fx(r,t,o));return py(e,r.body,n,s,i,a)}break}case`Unchanged`:if(!e.isInit)return ky(e,t.expression,n,r,i,a);break;case`BoxAction`:if(!e.isInit){let o=py(e,t.action,n,r,i,a);return ky(e,t.subscript,n,r,i,a)||o}break;case`AngleAction`:if(!e.isInit)return py(e,t.action,yy(`Changed`,t.subscript,r,a,n),r,i,a)}let s=e.isEnabled?wy(t):void 0;if(s!==void 0)throw new w(s);return hy(e,Yv(e,a,t,o),n,i,a)},Oy=(e,t,n)=>e.runtime.warn(Ko.unchangedVariableChanged,`The variable ${e.variables[t]} was changed while it is specified as UNCHANGED at\n${Q(n)}`),ky=(e,t,n,r,i,a)=>Kv(e,t,()=>{let o=qv(e,a,t),s=iy(e.environment,t,r);if(s!==void 0){let r=e.current?.[s];if(r===void 0)return!1;e.isEnabled&&e.coverage&&vf(e.coverage,o);let a=i[s];return a!==void 0&&!ml(a,r)?(Oy(e.environment,s,t),!1):vy(e,n,i,s,r,o)}if(t.kind===`Tuple`){let[a,...s]=t.elements;if(a===void 0)return cy(e,n,i,o);let c=s.reduceRight((e,t)=>yy(`Unchanged`,t,r,o,e),n);return ky(e,a,c,r,i,o)}if(t.kind===`Identifier`){let a=ax(r,t.name);if(a?.kind===`Thunk`)return ky(e,a.expression,n,a.scope,i,o);let s=a?void 0:Xx(t.name,e.environment);if(s?.kind===`Closure`&&s.params.length===0)return ky(e,s.body,n,s.scope,i,o)}if(e.isEnabled&&t.kind===`Apply`){let a=Zv(e,r,i),s=Zx(t,a);if(s?.kind===`Closure`&&s.params.length===t.args.length)return ky(e,s.body,n,lS(s,t.args,a),i,o)}let c=e.environment,l=Yv(e,o,t,{environment:c,scope:r,state:e.current,next:void 0}),u=Yv(e,o,t,{environment:c,scope:r,state:i,next:void 0});return ml(l,u)&&cy(e,n,i,o)}),Ay=(e,t,n,r,i,a)=>({environment:e,callStack:e.callStack,coverage:t===`enabled`&&e.coverage?.current===-1?void 0:e.coverage,isInit:t===`init`,isEnabled:t===`enabled`,current:n,onState:r,onIncomplete:i,generator:a}),jy=/* @__PURE__ */ Error(`The replay found a successor`),My=(e,t,n,r)=>{let i=()=>{throw jy},a=r.coverage?.current??-1,o=Ay(r,`enabled`,n,i,i),s=o.callStack,c=s?.expressions.length??0;try{if(e.kind===`AngleAction`&&e.location===e.action.location){let n=yy(`Changed`,e.subscript,t,a,void 0);py(o,e.action,n,t,$v(r),a)}else py(o,e,void 0,t,$v(r),a);return!1}catch(e){if(e!==jy)throw e;return s&&(s.expressions.length=c,s.isFrozen=!1),!0}},Ny=(e,t,n,r)=>{let[i,...a]=e;if(i===void 0)return;let o=Ay(t,`init`,void 0,n,r),s=a.reduceRight((e,t)=>yy(`Predicate`,t.expression,t.scope,t.node??-1,e),void 0);py(o,i.expression,s,i.scope,$v(t),i.node??-1)},Py=(e,t,n,r)=>{if(e.some(e=>Sy.has(e.expression.kind)))return;let i=n.coverage;e.forEach(e=>{let a=[],o=e.node??-1;Fy(e,o,t,n,e=>{i&&o!==-1&&i.primary[o]++,a.push(e)}),a.forEach(t=>r(t,e))})},Fy=(e,t,n,r,i,a,o)=>{let s=Ay(r,`next`,n,i,a,o);py(s,e.expression,void 0,e.scope,$v(r),t)},Iy=(e,t)=>{let n=[],r=e=>({environment:t,scope:e,state:void 0,next:void 0}),i=(e,r)=>{if(iy(t,e,void 0)!==void 0&&e.kind===`Identifier`){n.push(e);return}if(e.kind===`Tuple`){e.elements.forEach(e=>i(e,r));return}if(e.kind!==`Identifier`)return;let a=ax(r,e.name)?void 0:Xx(e.name,t);a?.kind===`Closure`&&a.params.length===0&&i(a.body,a.scope)},a=(e,o,s)=>{switch(e.kind){case`Let`:a(e.body,pS(e.definitions,r(o)),s);return;case`Label`:a(e.body,o,s);return;case`Selection`:a(e.expression,o,s);return;case`FunctionApplication`:a(e.function,o,s);return;case`If`:a(e.consequent,o,s),a(e.alternative,o,s);return;case`Case`:e.arms.forEach(e=>a(e.body,o,s)),e.other&&a(e.other,o,s);return;case`And`:case`Or`:e.operands.forEach(e=>a(e,o,s));return;case`Exists`:case`Forall`:a(e.body,o,s);return;case`Unchanged`:i(e.expression,o);return;case`AngleAction`:a(e.action,o,s);return;case`BoxAction`:a(e.action,o,s),n.push(e.subscript);return;case`Identifier`:case`Apply`:{if(e.kind===`Apply`){if(e.operator===`=>`){e.args.forEach(e=>a(e,o,s));return}if(e.operator===`=`||e.operator===`\\in`){ay(t,e.args[0],o)!==void 0&&n.push(e);return}}let i=e.kind===`Identifier`?e.name:e.operator,c=ax(o,i);if(c?.kind===`Thunk`){a(c.expression,c.scope,s);return}let l=e.kind===`Apply`?Zx(e,r(o)):c?.kind===`Operator`?c.operator:c?void 0:Xx(i,t);if(l?.kind!==`Closure`||s.has(l.body)||t.definitions.get(i)?.isRecursive)return;let u=e.kind===`Apply`?e.args:[];if(l.params.length!==u.length)return;s.add(l.body),a(l.body,lS(l,u,r(o)),s),s.delete(l.body)}}};return e.forEach(e=>a(e.expression,e.scope,/* @__PURE__ */ new Set)),n.flatMap(e=>e.location.range??[])},Ly=/* @__PURE__ */ new WeakMap,Ry=/* @__PURE__ */ new WeakMap,zy=(e,t,n)=>e.isInit?{environment:e.environment,scope:t,state:n,next:void 0}:{environment:e.environment,scope:t,state:e.current,next:n},By=(e,t,n)=>{let r=e.slice();return r[t]=n,r},Vy=e=>e.isInit?`initial states`:e.isEnabled?`ENABLED`:`next states`,Hy=(e,t)=>{let n=new w(t);return e.isInit?n:v(n,b.error)},Uy=(e,t,n,r)=>{let i=Jb(n);return r&&Sy.has(n.kind)?e.isEnabled?`Attempted to compute ENABLED on a non-boolean expression.\n${i}`:`The ${e.isInit?`init`:`next`} state relation is not a boolean expression.\n${i}`:`In computing ${Vy(e)}, TLC expected a boolean expression,\nbut instead found ${q(t)}.\n${i}`},Wy=(e,t,n)=>{let r=fp(t),i=Q(n);return e.isEnabled?`In computing ENABLED, a non-boolean expression(${r}) was used as the guard condition of an IF.\n${i}`:`In computing ${Vy(e)}, a non-boolean expression (${r}) was used as the condition of an IF.${e.isInit?`
|
|
1791
|
+
`:``}${i}`},Gy=(e,t,n)=>Jy(e,t,$(t,n)),Ky=new Set(Cv.map(e=>e.name)),qy=e=>e.kind===`Apply`?Ky.has(e.operator):e.kind!==`Identifier`&&!Sy.has(e.kind),Jy=(e,t,r,i=!0)=>{if(typeof r==`boolean`)return r;let a=Uy(e,r,t,i);throw e.isInit&&i&&qy(t)?new n(a):Hy(e,a)},Yy=(e,t,n,r)=>r.environment.callStack?$(n,r):(e[t]??=kS(n,r.environment))(r),Xy=e=>e===`=`||e===`\\in`||e===`\\subseteq`,Zy=(e,t,n)=>{let r=n?Ly:Ry,i=r.get(e);if(i)return i;let a=jb(e,t,n),o=n?void 0:Ab(e,t),s=o?(e,t,n,r,i,s)=>(e.generator?o:a)(e,t,n,r,i,s):a;return r.set(e,s),s},Qy=(e,t)=>{if(t.constants.has(e))return;let n=gx(e,t);return n?.kind===`Operator`&&n.params.length===0?n:void 0},$y=(e,t,n,r=/* @__PURE__ */ new Set)=>{if(e.kind===`Prime`&&n)return $y(e.expression,t,!1,r);if(e.kind!==`Identifier`||M(e))return;let i=t.variableIndex.get(e.name);if(i!==void 0)return n?void 0:i;let a=Qy(e.name,t);if(a&&!r.has(a))return r.add(a),$y(a.body,t,n,r)},eb=(e,t,n)=>$y(e,t,!n),tb=(e,t,n,r,i)=>{if(e.kind===`Prime`&&i)return tb(e.expression,t,n,r,!1);if(e.kind===`Let`){let a=pS(e.definitions,zy(r,t,n));return tb(e.body,a,n,r,i)}if(e.kind!==`Identifier`)return;let a=ax(t,e.name);if(a?.kind===`Thunk`&&!a.isReleased)return tb(a.expression,a.scope,n,r,i);if(a)return;let o=r.environment.variableIndex.get(e.name);if(o!==void 0)return i?void 0:o;let s=Qy(e.name,r.environment);if(s)return tb(s.body,void 0,n,r,i)},nb=(e,t)=>e.kind===`Let`||e.kind===`Identifier`&&(t||M(e))||!t&&e.kind===`Prime`,rb=(e,t,n=/* @__PURE__ */ new Set)=>{if(e.kind===`Tuple`){let r=e.elements.map(e=>rb(e,t,n));return r.every(e=>e!==void 0)?r.flat():void 0}if(e.kind!==`Identifier`||n.has(e.name))return;let r=t.variableIndex.get(e.name);if(r!==void 0)return[{index:r,expression:e}];let i=Qy(e.name,t);if(i)return n.add(e.name),rb(i.body,t,n)},ib=/* @__PURE__ */ new Set([`Label`,`Selection`,`And`,`Or`,`Exists`,`Forall`,`If`,`Case`,`Let`,`Unchanged`,`BoxAction`,`AngleAction`,`FunctionApplication`]),ab=(e,t,n)=>ib.has(e.kind)?!1:e.kind===`Identifier`?t.variableIndex.has(e.name)||t.constants.has(e.name):e.kind===`Apply`?e.operator===`=>`||Xy(e.operator)&&(nb(e.args[0],n)||eb(e.args[0],t,n)!==void 0)||M(e)?!1:t.definitions.get(t.substitutions.get(e.operator)??e.operator)===void 0&&t.builtins.has(e.operator):!0,ob=/* @__PURE__ */ new Set,sb=(e,t)=>{if(M(e))return e.kind===`Identifier`?t.has(e.name)?[]:[e.name]:void 0;let n=[],r=!0;return Fp(e,(e,i)=>{let a=r?sb(e,i.length===0?t:/* @__PURE__ */ new Set([...t,...i])):[];a?n.push(...a):r=!1}),r?n:void 0},cb=(e,t,n)=>{if(e.kind===`Or`||e.kind===`Exists`)return!0;let r=e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,i=r===void 0||M(e)?void 0:gx(r,t);return i&&!n.has(i)&&(n.add(i),cb(i.body,t,n))?!0:gt(e).some(e=>cb(e,t,n))},lb=(e,t,n)=>{if(e.kind===`Apply`&&e.operator===`=`){let r=eb(e.args[0],t,n);if(r!==void 0)return{kind:`Assign`,expression:e,index:r,value:e.args[1]}}if(!n&&e.kind===`Unchanged`){let n=rb(e.expression,t);if(n)return{kind:`Unchanged`,expression:e,variables:n}}return ab(e,t,n)?{kind:`Guard`,expression:e}:{kind:`Branch`,expression:e,runner:Zy(e,t,n)}},ub=(e,t)=>{if(e.bounds.length<2||e.body.kind!==`And`)return;let n=e.bounds.flatMap(e=>e.pattern.kind===`Name`?[e.pattern.name]:[]);if(n.length!==e.bounds.length)return;let r=new Set(n.slice(0,-1)),i=e.body.operands,a=i.findIndex(e=>{if(qh(e,t)===void 0||cb(e,t,/* @__PURE__ */ new Set))return!0;let n=sb(e,ob);return!n||n.some(e=>r.has(e))}),o=a===-1?i.length:a;if(o!==0)return{names:n,guards:i.slice(0,o),rest:i.slice(o)}},db=(e,t,n)=>{let r=e.map(e=>lb(e,t,n)),i=[],a=[],o=(e,t,n,s,c,l)=>{let u=s,d,f=sy(t);for(let s=e;s<r.length;s++){if(s>0&&f&&Nb(u)){d??=zy(t,n,u);for(let e=s;e<r.length;e++){let n=r[e],i=t.current,o=i&&n.kind===`Unchanged`?n.variables.find(e=>{let t=u[e.index];return t!==void 0&&!ml(t,i[e.index])}):void 0;if(o){Oy(t.environment,o.index,o.expression);return}let s=n.expression,c=Yy(a,e,s,d);if(!Jy(t,s,c,!1)){t.onUnsatisfied?.(u,s);return}}l(u,c);return}let e=r[s];if(e.kind===`Guard`){d??=zy(t,n,u);let r=Yy(i,s,e.expression,d);if(!Jy(t,e.expression,r))return;continue}if(e.kind===`Assign`){d??=zy(t,n,u);let r=Yy(i,s,e.value,d),a=u[e.index];if(a===void 0)u=By(u,e.index,r),d=void 0;else if(!ml(a,r))return;continue}if(e.kind===`Unchanged`){let n=t.current;if(!n)return;let r;for(let i of e.variables){let e=(r??u)[i.index];if(e===void 0)r??=u.slice(),r[i.index]=n[i.index];else if(!ml(e,n[i.index])){Oy(t.environment,i.index,i.expression);return}}r&&(u=r,d=void 0);continue}let p=s+1;e.runner(t,n,u,c,!0,(e,r)=>o(p,t,n,e,r,l));return}l(u,c)};return(e,t,n,r,i,a)=>o(0,e,t,n,r,a)},fb=e=>{let t=wy(e);return(n,r,i,a,o,s)=>{if(n.isEnabled&&t!==void 0)throw Hy(n,t);Gy(n,e,zy(n,r,i))&&s(i,a)}},pb=(e,t)=>{let n=e.args[1];return(r,i,a,o,s,c)=>{let l=t(r,i,a),u=zy(r,i,a);if(a[l]!==void 0){Gy(r,e,u)&&c(a,o);return}let d=$(n,u),f=e.operator===`\\subseteq`?{kind:`Subset`,base:d}:d;if(!Ll(f)){let t=r.isEnabled?`The right side of \\IN is not enumerable.`:`In computing ${Vy(r)}, the right side of \\IN is not enumerable.`;throw Hy(r,`${t}\n${Q(e)}`)}let p=Ql(f);if(r.generator){for(let e of D_(p.length,f,r.environment.runtime.getRandom(),r.environment.runtime.version))if(c(By(a,l,e),o),r.generator.kept>0||r.isStopped)return}for(let e=0;e<p.length&&!r.isStopped;e++)c(By(a,l,p[e]),o)}},mb=/* @__PURE__ */ new WeakMap,hb=e=>{let t=mb.get(e);if(t)return t;let n=e.kind===`Tuple`?{kind:`And`,operands:e.elements.map(hb),location:e.location}:{kind:`Unchanged`,expression:e,location:e.location};return mb.set(e,n),n},gb=(e,t)=>{let n=e.args[0],r=fb(e),i=(e,r,i)=>tb(n,r,i,e,!t)??-1,a=pb(e,i);return(t,n,o,s,c,l)=>{let u=i(t,n,o);if(u===-1||o[u]!==void 0){r(t,n,o,s,c,l);return}if(e.operator!==`=`){a(t,n,o,s,c,l);return}let d=$(e.args[1],zy(t,n,o));l(By(o,u,d),s)}},_b=(e,t,n)=>{let r=Q(e);return(i,a,o,s,c,l)=>{let u=zy(i,a,o),d=$(e.function,n?u:lx(u)),f=Px(d);if(f!==void 0){Zy(f.body,t,n)(i,Fx(f,e,u),o,s,c,l);return}if(!Ps(d))throw Hy(i,`In computing ${Vy(i)}, a non-function (${fp(d)}) was applied as a function.\n${r}`);let p=$(e,u);if(typeof p!=`boolean`)throw Hy(i,`In computing ${Vy(i)}, TLC expected a boolean expression,\nbut didn't find one.\n${r}`);p&&l(o,s)}},vb=(e,t)=>{let n=hb(e);return rb(e,t)?db([n],t,!1):e.kind===`Tuple`?Zy(n,t,!1):(r,i,a,o,s,c)=>{let l=e.kind===`Identifier`?ax(i,e.name):void 0;if(l?.kind===`Thunk`&&!l.isReleased){Zy(hb(l.expression),t,!1)(r,l.scope,a,o,s,c);return}let u=zy(r,i,a);if(r.isEnabled&&e.kind===`Apply`){let n=Zx(e,u);if(n?.kind===`Closure`&&n.params.length===e.args.length){Zy(hb(n.body),t,!1)(r,lS(n,e.args,u),a,o,s,c);return}}Gy(r,n,u)&&c(a,o)}},yb=(e,t,n)=>{let r=e.operator,i=fb(e),a=M(e)?void 0:Xx(r,t);if(a?.kind===`Builtin`)return i;if(a?.kind===`Closure`){let i=PS(a,e.args,t),o;return(e,s,c,l,u,d)=>{o??=Zy(a.body,t,n),o(e,i(zy(e,s,c)),c,u?l:r,u,d)}}return(a,o,s,c,l,u)=>{let d=zy(a,o,s),f=Zx(e,d);f?.kind===`Closure`?Zy(f.body,t,n)(a,lS(f,e.args,d),s,l?c:r,l,u):i(a,o,s,c,l,u)}},bb=(e,t,n)=>{let r=fb(e),i=M(e)?void 0:Qy(e.name,t),a;return(o,s,c,l,u,d)=>{let f=ax(s,e.name);f?.kind===`Thunk`&&!f.isReleased?Zy(f.expression,t,n)(o,f.scope,c,l,u,d):f||!i||e.location.range&&Gx(i,t)!==void 0?r(o,s,c,l,u,d):(a??=Zy(i.body,t,n),a(o,void 0,c,u?l:i.name,u,d))}},xb=(e,t)=>{if(e.kind!==`Apply`||e.operator!==`=`||M(e))return;let n=e.args[0],r=e.args[1];if(n.kind!==`FunctionApplication`||r.kind!==`String`)return;let i=n.args.length===1?n.args[0]:void 0;if(i?.kind!==`Identifier`||!M(i))return;let a=$y(n.function,t,!1);if(a!==void 0)return{variable:a,argument:i.name,labels:/* @__PURE__ */ new Set([r.value])}},Sb=e=>e.kind===`And`?e.operands.flatMap(Sb):[e],Cb=(e,t)=>(e.kind===`Identifier`||e.kind===`Apply`&&(e.operator===`=`||e.operator===`#`))&&ab(e,t,!1),wb=e=>{let t=[];return(n,r,i)=>{let a=zy(n,r,i);for(let r=0;r<e.length;r++){let i=e[r];if(!Jy(n,i,Yy(t,r,i,a)))return}}},Tb=(e,t,n)=>{if(n.has(e))return;if(n.add(e),e.kind===`And`){let n=Sb(e),r=n.findIndex(e=>!Cb(e,t)||xb(e,t)),i=r===-1?void 0:xb(n[r],t);return i?{...i,before:r===0?void 0:wb(n.slice(0,r))}:void 0}if(e.kind===`Or`){let r=e.operands.map(e=>Tb(e,t,n)),i=r[0],a=r.every(e=>e!==void 0&&e.before===void 0&&e.variable===i?.variable&&e.argument===i.argument);if(!i||!a)return;let o=new Set(r.flatMap(e=>[...e?.labels??[]]));return{variable:i.variable,argument:i.argument,labels:o,before:void 0}}if(e.kind!==`Apply`||M(e))return;let r=Xx(e.operator,t);if(r?.kind!==`Closure`||r.scope!==void 0)return;let i=Tb(r.body,t,n),a=r.params.findIndex(e=>e.arity===0&&e.name===i?.argument),o=e.args[a];if(!i||o?.kind!==`Identifier`||!M(o))return;let s=i.before,c=s&&PS(r,e.args,t);return{variable:i.variable,argument:o.name,labels:i.labels,before:s&&c&&((e,t,n)=>s(e,c(zy(e,t,n)),n))}},Eb=(e,t,n)=>{let r=ax(t,n.argument),i=e.current?.[n.variable];if(r?.kind!==`Value`||typeof i!=`object`||i.kind!==`Function`)return;let a=i.domain.indexOf(r.value),o=a===-1?void 0:i.range[a];return typeof o==`string`?o:void 0},Db=(e,t,n)=>{let r=e.map(e=>Zy(e,t,n)),i=n?[]:e.map(e=>Tb(e,t,/* @__PURE__ */ new Set)),a=i.find(e=>e!==void 0),o=i.map(e=>e?.variable===a?.variable&&e?.argument===a?.argument?e:void 0);return(e,t,n,i,s,c)=>{let l=a&&Eb(e,t,a);for(let a=0;a<r.length&&!e.isStopped;a++){let u=o[a];l!==void 0&&u?.labels.has(l)===!1?u.before?.(e,t,n):r[a](e,t,n,i,s,c)}}},Ob=e=>(t,n,r,i,a,o)=>{let s=t.generator;if(!s)throw Error(`A random choice needs the run's generator`);let c=Math.floor(s.random.nextDouble()*e.length),l=__(s.random);for(let u=0;u<e.length;u++)if(e[(c+u*l)%e.length](t,n,r,i,a,o),s.kept>0||t.isStopped)return},kb=(e,t)=>{let n=Zy(e.body,t,!1);return(r,i,a,o,s,c)=>{let l=zy(r,i,a),u=t.runtime.version,d=Tx(e.bounds,e=>$(e,l)).map((n,r)=>D_(bx(n,e.bounds[r].set,u).length,n,t.runtime.getRandom(),u)),f=(t,i)=>{if(t<0)return n(r,i,a,o,s,c),(r.generator?.kept??0)>0||r.isStopped;let l=e.bounds[t].pattern;return d[t].some(e=>f(t-1,sx(i,l,e)))};f(d.length-1,i)}},Ab=(e,t)=>{if(e.kind===`Exists`)return kb(e,t);if(e.kind!==`Or`)return;let n=e.operands.map(e=>Zy(e,t,!1));return e.isBulleted?Ob(n):n.reduce((e,t)=>Ob([e,t]))},jb=(e,t,n)=>{let r=e=>Zy(e,t,n);switch(e.kind){case`And`:return db(e.operands,t,n);case`Or`:return Db(e.operands,t,n);case`Exists`:{let i=r(e.body),a=e.bounds[0];if(e.bounds.length===1&&a.pattern.kind===`Name`){let e=a.pattern.name;return(n,r,o,s,c,l)=>{let u=bx($(a.set,zy(n,r,o)),a.set,t.runtime.version);for(let t=0;t<u.length&&!n.isStopped;t++)i(n,ox(r,e,u[t]),o,s,c,l)}}let o=n?void 0:ub(e,t);if(o){let r=db(o.rest,t,n);return(n,i,a,s,c,l)=>{let u=zy(n,i,a),d=Tx(e.bounds,e=>bx($(e,u),e,t.runtime.version));if(d.some(e=>e.length===0))return;let f=(e,t)=>{if(e<0)r(n,t,a,s,c,l);else for(let r of d[e]){if(n.isStopped)return;let i=ox(t,o.names[e],r);if(e===d.length-1){let e=zy(n,i,a);if(!o.guards.every(t=>Gy(n,t,e)))continue}f(e-1,i)}};f(d.length-1,i)}}return(t,n,r,a,o,s)=>{Ox(e.bounds,zy(t,n,r),e=>(i(t,e,r,a,o,s),t.isStopped))}}case`Forall`:{let i=r(e.body),a=!n&&qh(e,t)!==void 0&&!cb(e.body,t,/* @__PURE__ */ new Set)?sb(e,ob):void 0;return(t,n,r,o,s,c)=>{let l=[];Ox(e.bounds,zy(t,n,r),e=>(l.push(e),!1));let u=[...l.slice(0,1),...l.slice(1).reverse()];if(a?.every(e=>ax(n,e)?.kind===`Value`)){u.every(n=>Gy(t,e.body,zy(t,n,r)))&&c(r,o);return}let d=(n,r,a)=>{n===u.length?c(r,a):n>0&&t.isInit&&Nb(r)?u.slice(n).every(n=>Gy(t,e.body,zy(t,n,r)))&&c(r,a):i(t,u[n],r,a,!0,(e,t)=>d(n+1,e,t))};d(0,r,o)}}case`If`:{let t=r(e.consequent),n=r(e.alternative);return(r,i,a,o,s,c)=>{let l=$(e.condition,zy(r,i,a));if(typeof l!=`boolean`)throw Hy(r,Wy(r,l,e));(l?t:n)(r,i,a,o,s,c)}}case`Case`:{let t=e.arms.map(e=>({condition:e.condition,source:e.body,body:r(e.body)})),n=e.other?r(e.other):void 0;return(r,i,a,o,s,c)=>{let l=zy(r,i,a),u=t.find(e=>{let t=$(e.condition,l);if(typeof t==`boolean`)return t;throw Hy(r,`In computing ${Vy(r)}, a non-boolean expression${r.isEnabled?``:` `}(${fp(t)}) was used as a guard condition of a CASE.\n${Jb(e.source)}`)})?.body??n;if(!u)throw Hy(r,`In computing ${Vy(r)}, TLC encountered a CASE with no conditions true.\n${Q(e)}`);u(r,i,a,o,s,c)}}case`Let`:{let n=r(e.body),i=hS(e.definitions,t),a={impure:/* @__PURE__ */ new Set,streamed:i.streamed};return(t,r,o,s,c,l)=>n(t,pS(e.definitions,zy(t,r,o),t.isEnabled?a:i),o,s,c,l)}case`Unchanged`:return n?()=>{throw new w(`UNCHANGED appears in an initial predicate at ${Gb(e)}`)}:vb(e.expression,t);case`AngleAction`:{let n=r(e.action),i={kind:`Unchanged`,expression:e.subscript,location:e.subscript.location},a=(e,n,r)=>{try{return Gy(e,i,zy(e,n,r))}catch(n){throw e.isEnabled?ix(n,t.runtime.version):n}};return(e,t,r,i,o,s)=>n(e,t,r,i,o,(n,r)=>{a(e,t,n)||s(n,r)})}case`BoxAction`:return Db([e.action,hb(e.subscript)],t,n);case`Label`:return r(e.body);case`Selection`:return r(e.expression);case`Identifier`:return bb(e,t,n);case`FunctionApplication`:return _b(e,t,n);case`Apply`:{let i=e.args;if(Xy(e.operator)){let r=eb(i[0],t,n);if(r!==void 0)return e.operator===`=`?db([e],t,n):pb(e,()=>r);if(nb(i[0],n))return gb(e,n)}if(e.operator===`=>`){let t=r(i[1]);return(n,r,a,o,s,c)=>{let l=$(i[0],zy(n,r,a));if(typeof l!=`boolean`){let t=fp(l),r=Q(e);throw Hy(n,n.isInit?`In computing initial states of a predicate of form P => Q, P was ${t}\n.${r}`:n.isEnabled?`While computing ENABLED of an expression of the form P => Q, P was ${t}.\n${r}`:`In computing next states of a predicate of the form P => Q, P was\n${t}.\n${r}`)}l?t(n,r,a,o,s,c):c(a,o)}}return yb(e,t,n)}default:return fb(e)}},Mb=e=>e.variables.map(()=>void 0),Nb=e=>{for(let t=0;t<e.length;t++)if(e[t]===void 0)return!1;return!0},Pb=(e,t)=>{let n=t.state;if(!n||!Nb(n))throw new w(`ENABLED needs a complete state at ${Gb(e)}`);let r=t.environment;if(r.callStack||r.coverage&&r.coverage.current!==-1)return My(e,t.scope,n,r);let i={environment:r,isInit:!1,isEnabled:!0,current:n,isStopped:!1,generator:void 0,successors:0};return Zy(e,r,!1)(i,t.scope,Mb(r),void 0,!1,()=>{i.isStopped=!0}),i.isStopped},Fb=(e,t,n,i,a)=>{let o={environment:t,isInit:!0,isEnabled:!1,current:void 0,isStopped:!1,generator:void 0,successors:0};Zy(e,t,!0)(o,i,Mb(t),void 0,!1,e=>{if(!o.isStopped){if(!Nb(e)){if(a){o.isStopped=a([...e]);return}throw v(new r([...e]),b.error)}o.isStopped=n(e)}})},Ib=(e,t,n)=>{let r=[];return Fb(e,t,e=>(r.push(e),!1),n),r},Lb=(e,t,n)=>{let r=n.variables.filter((t,n)=>e[n]===void 0);return new ne(`Successor state is not completely specified by action ${t??`Next`}. The following variables are not assigned: ${r.join(`, `)}`,e,t,r)},Rb=(e,t,n,r,i,a,o,s)=>{let c={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:a,successors:0,onUnsatisfied:o};return Zy(e,n,!1)(c,i,Mb(n),void 0,!1,(e,t)=>{if(!c.isStopped){if(!Nb(e)){if(s){s(e,t);return}throw Lb(e,t,n)}c.successors++,c.isStopped=r({state:e,action:t})}}),c.successors},zb=(e,t,n,r)=>{let i={environment:n,isInit:!1,isEnabled:!1,current:t,isStopped:!1,generator:void 0,successors:0};return Zy(e,n,!1)(i,r,Mb(n),void 0,!1,e=>{Nb(e)||i.successors++}),i.successors>0},Bb=(e,t,n,r)=>{let i=[];return Rb(e,t,n,e=>(i.push(e),!1),r),i},Vb=/* @__PURE__ */ new Set([`SUBSET`,`UNION`,`DOMAIN`,`\\cup`,`\\cap`,`\\`]),Hb=/* @__PURE__ */ new Set([`SetEnumeration`,`SetFilter`,`SetMap`,`Tuple`,`FunctionSet`,`Record`,`RecordSet`,`Product`]),Ub=e=>Hb.has(e.kind)||e.kind===`Apply`&&Vb.has(e.operator),Wb=(e,t)=>{if(e.kind===`FunctionApplication`||e.kind===`Except`)return e.function;if(e.kind===`Apply`&&e.args.length===2){if([`\\subseteq`,`=`,`#`,`\\`].includes(e.operator))return e.args[0];if(e.operator===`\\cap`||e.operator===`\\cup`){let n=t.get(e.args[0]);return n!==void 0&&Ns(n)?e.args[0]:e.args[1]}return e.operator===`\\in`||e.operator===`\\notin`?e.args[1]:void 0}},Gb=e=>`line ${e.location.line}, column ${e.location.column}`,Q=e=>{let t=e.location.range;return t?m(t):Gb(e)},Kb={Always:`[]A`,Eventually:`<>A`,WeakFairness:`WF`,StrongFairness:`SF`},qb=(e,t)=>new w(`TLC encountered a temporal formula (${e}) when evaluating a predicate or action.\n${Q(t)}`),Jb=e=>e.kind===`Number`?e.text??String(e.value):Q(e),Yb=(e,t)=>new w(`A non-boolean expression (${fp(t)}) was used as the condition of an IF.\n${Q(e)}`),Xb=(e,t,n)=>{let r=e.location.range;if(r?.start.line===e.location.line&&r.start.column===e.location.column||!r)return new w(`A non-boolean expression (${fp(n)}) was used as a formula in a ${e.kind===`And`?`conjunction`:`disjunction`}.\n${Jb(e.operands[t])}`);let i=e.prefixEnds?.[Math.max(t,1)-1]??r.end;return new w(`Attempted to evaluate an expression of form P ${e.kind===`And`?`/\\`:`\\/`} Q when ${t===0?`P`:`Q`} was\n${fp(n)}.\n${Q({...e,location:{...e.location,range:{...r,end:i}}})}`)},Zb=e=>{let t=e.field,n=n=>`Attempted to select nonexistent field "${t}" from the record\n${U(q(n))}\n${Q(e)}`,r=e=>`Attempted to apply function:\n${U(q(e))}\nto argument "${t}", which is not in the domain of the function.`;return i=>{if(!Ps(i))throw new w(`Attempted to select field "${t}" from a non-record value ${U(q(i))}\n${Q(e)}`);let a=jc(i);if(a===`tuple`)throw Du(t);return Fu(i.kind===`LazyFunction`?K(i):i,t,a===`record`?n:r)}},Qb=e=>e===`1.7.4`?(t,n)=>wu(t,n,e):void 0,$b=e=>t=>{if(!Ps(t))throw new w(`Attempted to apply the operator DOMAIN to a non-function\n(${fp(t)})\n${Q(e)}`);return Lu(t)},ex=(e,t)=>(n,r)=>{if(!Ms(n)||mc(n))throw new w(`Attempted to evaluate an expression of form S \\subseteq T, but S was not enumerable.\n${Q(e)}`);return t(n,r)},tx=e=>v(new w(`TLC can't handle real numbers.\n${e.text}`),b.configParseError),nx=e=>v(new w(`TLC can't handle a number this big.\n${e.text??e.value}`),b.error),rx=(e,t)=>new T(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Q(t)}`,e),ix=(e,t)=>e instanceof T&&t!==`1.7.4`?new w(`The action formula A appearing in a WF_v(A) or SF_v(A) operator does not specify the primed value of the variable ${e.variable} occurring in the state formula v.\n`):e,ax=(e,t)=>{for(let n=e;n;n=n.parent)if(n.name===t)return n.binding},ox=(e,t,n)=>({name:t,binding:{kind:`Value`,value:n},parent:e}),sx=(e,t,n)=>{if(t.kind===`Name`)return ox(e,t.name,n);let r=du(n);if(!r||r.length!==t.names.length){let e=t.ranges?.[0];throw new w(`Argument mismatch in operator application.${e?m(e):``}`)}return t.names.reduce((e,t,n)=>ox(e,t,r[n]),e)},cx=(e,t)=>{if(Ps(e))return e;throw new w(`A non-function (${fp(e)}) was applied as a function.\n${Q(t)}`)},lx=e=>e.isKeepLazy?e:{environment:e.environment,scope:e.scope,state:e.state,next:e.next,isKeepLazy:!0},ux=(e,t)=>({environment:e.environment,scope:t,state:e.state,next:e.next,isKeepLazy:e.isKeepLazy}),dx=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Expected ${t} to be a boolean but found ${q(e)}`);return e},fx=(e,t,n)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form P => Q when ${n} was\n${fp(e)}.\n${Q(t)}`);return e},px=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to apply the operator ~ to a non-boolean\n(${fp(e)})\n${Q(t)}`);return!e},mx=(e,t,n)=>{if(typeof e!=`boolean`||typeof t!=`boolean`)throw new w(`Attempted to evaluate an expression of form P <=> Q when P or Q was not a boolean.\n${Q(n)}`);return e===t},hx=(e,t)=>{if(typeof e!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${Jb(t)}`);return e},gx=(e,t)=>t.definitions.get(t.substitutions.get(e)??e),_x=(e,t)=>{let n=`universally (\\A) or existentially (\\E) quantify over ${t}, because this would require checking an\ninfinite number of cases.`;if(typeof e==`object`&&e.kind===`SequenceSet`)return`In TLA+, Seq(S) represents the set of all finite sequences whose elements come from the set S. Even when S\nis a finite set, the number of possible sequences in Seq(S) is unbounded because sequences can have any\nfinite length (e.g., length 0, 1, 2, and so on). As a result, TLC cannot evaluate expressions that\n${n} Note that for a finite set of sequences s, TLC handles s \\subseteq Seq(S).\nSee https://explain.tlapl.us/seq-unenumerable for additional details.`;if(typeof e==`object`&&e.kind===`InfiniteSet`&&e.name!==`STRING`&&e.name!==`Any`)return`The set ${e.name} contains infinitely many elements. As a result, TLC cannot evaluate expressions that\n${n} Note that TLC handles set membership like T \\subseteq ${e.name} for any finite set T.`},vx=(e,t,n)=>{if(!Ms(e)||mc(e)){let r=q(e),i=n===`1.7.4`?void 0:_x(e,r);throw new w(i===void 0?`TLC encountered a non-enumerable quantifier bound\n${r}.\n${Jb(t)}`:`TLC encountered the non-enumerable quantifier bound\n${r}\n${Jb(t)}\n${i}`)}},yx=(e,t,n)=>(vx(e,t,n),typeof e==`object`&&e.kind===`Interval`?Al(e):Wl(e)??Xl(e)),bx=(e,t,n)=>n===`1.7.4`?(vx(e,t,n),Wl(e)??Ql(e)):yx(e,t,n),xx=e=>{if(typeof e==`object`&&e.kind===`Interval`)return ou(e),e},Sx=(e,t,n)=>xx(e)??bx(e,t,n),Cx=(e,t,n)=>xx(e)??yx(e,t,n),wx=(e,t)=>{if(Array.isArray(e))return e.some(t);for(let n=e.low;n<=e.high;n++)if(t(n))return!0;return!1},Tx=(e,t)=>e.reduce((n,r,i)=>(n.push(i>0&&e[i-1].set===r.set?n[i-1]:t(r.set,i)),n),[]),Ex=(e,t)=>Tx(e,e=>Sx($(e,t),e,t.environment.runtime.version)),Dx=(e,t,n,r)=>{let i=(n,a)=>n<0?r(a):wx(t[n],t=>i(n-1,sx(a,e[n].pattern,t)));return i(e.length-1,n)},Ox=(e,t,n)=>Dx(e,Ex(e,t),t.scope,n),kx=(e,t,n,r)=>{let i=Tx(e,e=>{let n=$(e,t);return{value:n,elements:Sx(n,e,t.environment.runtime.version)}}),a=i.map(e=>e.elements),o=jf(n,i.map(e=>e.value),a);return Dx(e,a,t.scope,e=>(o(),r(e)))},Ax=(e,t)=>{let n=Tx(e,e=>$(e,t));return n.length===1?n[0]:{kind:`ProductSet`,factors:n}},jx=(e,t,n)=>{if(e.length===1)return sx(t,e[0].pattern,n);let r=du(n)??[];return e.reduce((e,t,n)=>sx(e,t.pattern,r[n]),t)},Mx=e=>typeof e==`object`&&e.kind===`LazyFunction`&&`lambda`in e,Nx=e=>Object.assign(e.value,{lambda:e}),Px=e=>Mx(e)?e.lambda:void 0,Fx=(e,t,n)=>{let r=e.value,i=t.args.map(e=>$(e,n)),a=i.length===1?i[0]:Pl(i),o=(e,n,i)=>`In applying the function\n${U(q(r))},\nthe ${e} is:\n${U(q(n))}${i}.\n${Q(t.function)}`,s=e.bounds;if(s.length===1){if(!gu(a,r.domain))throw new w(o(`first argument`,a,`which is not in its domain`));return jx(s,e.scope,a)}let c=du(a),l=typeof r.domain==`object`&&r.domain.kind===`ProductSet`?r.domain.factors:[];if(c===void 0)throw new w(`Attempted to apply a function to an argument not in its domain.\n${Q(t.function)}`);let u=()=>new w(`In applying the function\n${U(q(r))},\nthe argument list is:\n${U(q(a))}\nwhich does not match its formal parameter.\n`);if(s.forEach((e,t)=>{if(t>=c.length)throw u();let n=c[t],r=`argument number ${t+1}`;if(!gu(n,l[t]))throw new w(o(r,n,`${e.pattern.kind===`Name`?``:`
|
|
1792
|
+
`}which is not in its domain`));if(e.pattern.kind===`Tuple`&&du(n)?.length!==e.pattern.names.length)throw new w(o(r,n,`which does not match its formal parameter`))}),c.length>s.length)throw u();return jx(s,e.scope,a)},Ix=(e,t)=>{if(t.location.range)return{parameters:e.flatMap((t,n)=>n>0&&e[n-1].set===t.set?[]:[{index:n,name:t.pattern.kind===`Name`?t.pattern.name:`<<${t.pattern.names.join(`, `)}>>`}]),body:Jb(t)}},Lx=(e,t,n)=>{if(!e)return;let r=t.length>1&&typeof n==`object`&&n.kind===`ProductSet`?n.factors:[n];return{parameters:e.parameters.map(e=>({name:e.name,domain:r[e.index]})),body:e.body}},Rx=(e,t,n,r)=>{let i={kind:`LazyFunction`,domain:e,source:n,boundTupleLengths:r,apply:e=>t(e,i)};return i},zx=e=>e.length===1?void 0:e.map(e=>e.pattern.kind===`Tuple`?e.pattern.names.length:void 0),Bx=(e,t)=>{let n=Ax(e.bounds,t),r=(n,r)=>$(e.body,ux(t,jx(e.bounds,ox(void 0,e.name,r),n))),i=t.environment.coverage,a=i&&!t.environment.callStack?i.current:-1,o=Rx(n,i?(e,t)=>i.current===-1?r(e,t):yf(i,a,()=>r(e,t)):r,Lx(Ix(e.bounds,e.body),e.bounds,n),zx(e.bounds));Nx({value:o,bounds:e.bounds,body:e.body,scope:ox(void 0,e.name,o)});let s=Object.assign(o,{rebind:n=>{let r=Bx(e,{...t,environment:n});return r.enumerated=o.enumerated,r}});return e.bounds.length===1?Mc(s):s},Vx=(e,t)=>{if(typeof t!=`object`||jc(t)!==`lambda`||e.kind===`Operator`||e.isSelfReferential||t.kind!==`LazyFunction`||!Ns(t.domain))return t;try{let e=K(t);return Oc(e.domain,e.range)}catch(e){if(e instanceof w)return t;throw e}},Hx=(e,t)=>{if(e.kind===`Operator`&&e.params.length>0)return()=>{throw new w(`Operator ${e.name} requires ${e.params.length} arguments`)};if(e.kind!==`Function`)return kS(e.body,t);let n=mt(e,!1);if(!e.isSelfReferential)return kS(n,t);let r=t=>Bx(e,t),i=t.coverage;return i?DS(n,r,i):r},Ux={name:``,binding:{kind:`Value`,value:!1},parent:void 0},Wx=(e,t)=>{let n=t.definitionEvaluators.get(e);if(n)return n;let r=Hx(e,t),i=t.facts.ids.get(e),a=t.startupValues,o=e.kind===`Operator`&&e.params.length===0&&Wh(e.body,t)?e=>(i===void 0?void 0:a[i])??r(ux(e,IS(e.scope)?void 0:Ux)):i===void 0?e=>r(ux(e,void 0)):e=>a[i]??r(ux(e,void 0));return t.definitionEvaluators.set(e,o),o},Gx=(e,t)=>{let n=t.facts.ids.get(e);return n===void 0?void 0:t.startupValues[n]},Kx=(e,t)=>e.forEach(e=>{if(e.kind===`Operator`&&e.params.length>0)return;let n=e.name;if(t.constants.has(n)||t.substitutions.has(n)||!Bh(e,t))return;let r=t.facts.ids.get(e);if(r===void 0||t.startupValues[r]!==void 0)return;let i={environment:t,scope:void 0,state:void 0,next:void 0};try{let n=t.runtime.evaluateAtStartup(()=>Vx(e,Hx(e,t)(i)));fl(n),t.startupValues[r]=n}catch(e){if(!(e instanceof w)&&!te(e))throw e}}),qx=(e,t)=>{if(t===void 0||e===t)return!0;try{return t.every((t,n)=>t===void 0||e?.[n]!==void 0&&zc(e[n],t))}catch(e){if(e instanceof w)return!1;throw e}},Jx=(e,t)=>{let n=e.cache;if(n!==void 0&&qx(t.state,e.state)&&qx(t.next,e.next))return n;let r=t.environment.coverage,i=r?.current===-1?void 0:r?.values.get(e),a=r&&i!==void 0?yf(r,i,()=>$(e.expression,ux(t,e.scope))):$(e.expression,ux(t,e.scope));return(!e.isStreamed||eu(a))&&(e.cache=a,e.state=t.state,e.next=t.next),e.cache!==void 0&&e.state===void 0&&e.next===void 0&&(e.scope=void 0,e.isReleased=!0),a},Yx=e=>({kind:`Closure`,name:e.name,params:e.params,body:e.body,scope:void 0}),Xx=(e,t)=>{let n=t.substitutions.get(e);if(n!==void 0)return Xx(n,t);let r=t.definitions.get(e);return r?.kind===`Operator`?Yx(r):t.builtins.get(e)},Zx=(e,t)=>M(e)?Qx(e.operator,t):Xx(e.operator,t.environment)??Qx(e.operator,t),Qx=(e,t)=>{let n=ax(t.scope,e);if(n?.kind===`Operator`)return n.operator;if(!n)return Xx(e,t.environment)},$x=e=>e.kind===`Closure`?e.params.length:e.arity,eS=(e,t)=>{if(e.kind===`Lambda`)return{kind:`Closure`,name:`LAMBDA`,params:e.params.map(e=>({name:e,arity:0})),body:e.body,scope:t.scope};let n=e.kind===`OperatorReference`?e.operator:e.kind===`Identifier`?e.name:void 0,r=n===void 0?void 0:Qx(n,t);if(!r)throw new w(`Expected an operator argument at ${Gb(e)}`);return r},tS=(e,t,n)=>{if(e.kind===`Builtin`&&e.isLazy)return e.evaluate(t.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>e})),n);if(e.kind===`Builtin`)return e.evaluate(t,n);if(e.kind===`Operator`)return e.call(t);let r=e.params.reduce((e,n,r)=>ox(e,n.name,t[r]),e.scope);return $(e.body,ux(n,r))},nS=(e,t)=>e.kind===`Operator`?e:{kind:`Operator`,name:e.name,arity:$x(e),call:n=>tS(e,n,t)},rS=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!0;if(e.kind!==`Identifier`)return!1;let n=Qx(e.name,t);return n!==void 0&&$x(n)>0},iS=(e,t)=>e.map(e=>rS(e,t)?nS(eS(e,t),t):$(e,t)),aS=(e,t)=>new w(`Operator ${e.name} expects ${e.params.length} arguments but received ${t}`),oS=(e,t)=>({kind:`Thunk`,expression:e,scope:t.scope,state:t.state,next:t.next,cache:void 0,isStreamed:!1}),sS=(e,t)=>{let n=t.variableIndex.get(e);if(n!==void 0)return{kind:`Variable`,index:n};let r=t.constants.get(e);if(r!==void 0)return{kind:`Value`,value:r};let i=t.substitutions.get(e);if(i!==void 0)return sS(i,t);let a=t.definitions.get(e);if(a)return{kind:`Definition`,definition:a};let o=t.builtins.get(e);if(o&&o.arity===0&&!o.isStateLevel)return{kind:`Value`,value:o.evaluate([])}},cS=(e,t)=>{if(e.kind===`String`||e.kind===`Number`&&Rs(e.value)){let t={kind:`Value`,value:e.value,argument:e};return()=>t}let n=t.coverage;if(n)return t=>{let r=oS(e,t);return n.current!==-1&&n.values.set(r,n.current),r};if(e.kind===`Identifier`){let n=M(e)?void 0:sS(e.name,t);if(n?.kind===`Value`){let e={kind:`Value`,value:n.value};return()=>e}if(n===void 0&&!t.callStack)return t=>{let n=ax(t.scope,e.name);return n?.kind===`Value`||n?.kind===`Thunk`?n:oS(e,t)}}return t=>oS(e,t)},lS=(e,t,n,r)=>{if(t.length!==e.params.length)throw aS(e,t.length);let i=e.scope;for(let a=0;a<t.length;a++){let o=e.params[a],s=o.arity>0?{kind:`Operator`,operator:eS(t[a],n)}:(r?.[a]??cS(t[a],n.environment))(n);i={name:o.name,binding:s,parent:i}}return i},uS=(e,t,n,r)=>e.kind===`Closure`?$(e.body,ux(n,lS(e,t,n,r))):e.kind===`Operator`?e.call(t.map(e=>$(e,n))):e.isLazy?e.evaluate(MS(t,n),n):e.evaluate(iS(t,n),n),dS=e=>e.kind===`Operator`&&e.isRecursive&&e.params.length>0,fS=(e,t,n)=>{let r=n;for(let n=0;n<e.length;n++)dS(e[n])&&(t[n].parent=r,r=t[n]);for(let n=0;n<e.length;n++)dS(e[n])||(t[n].parent=r,r=t[n]);return r},pS=(e,t,n)=>{let r=e.map(e=>({name:e.name,binding:{kind:`Value`,value:!1},parent:void 0})),i=t.scope,a=!1;for(let t=0;t<r.length;t++)r[t].parent=i,i=r[t],a||=e[t].isRecursive;a&&(i=fS(e,r,t.scope));let o=!1;for(let a=e.length-1;a>=0;a--){let s=e[a];o||=s.isRecursive&&s.kind===`Operator`&&s.params.length===0;let c=s.kind===`Operator`&&s.params.length===0&&!o?r[a].parent:i;r[a].binding=s.kind===`Function`?{kind:`Thunk`,expression:mt(s,!0),scope:i,state:t.state,next:t.next,cache:void 0,isStreamed:!1}:s.params.length>0||n?.impure.has(s)?{kind:`Operator`,operator:{kind:`Closure`,name:s.name,params:s.params,body:s.body,scope:c}}:{kind:`Thunk`,expression:s.body,scope:c,state:t.state,next:t.next,cache:void 0,isStreamed:n?.streamed.has(s)??!1}}let s=t.environment.coverage;return s&&s.current!==-1&&r.forEach(e=>{e.binding.kind===`Thunk`&&s.values.set(e.binding,s.current)}),i},mS=(e,t,n)=>{let r=ax(n.scope,e);if(r?.kind===`Value`)return r.value;if(r?.kind===`Thunk`)return Jx(r,n);if(r?.kind===`Operator`){if($x(r.operator)===0)return tS(r.operator,[],n);throw new w(`Operator ${e} is used without arguments`)}let i=sS(e,n.environment);if(i?.kind===`Variable`){let r=n.state?.[i.index];if(r===void 0)throw rx(e,t);return r}if(i?.kind===`Value`)return i.value;if(i?.kind===`Definition`)return Wx(i.definition,n.environment)(n);let a=n.environment.builtins.get(n.environment.substitutions.get(e)??e);if(a?.arity===0)return a.evaluate([],n);throw new w(`In evaluation, the identifier ${e} is either undefined or not an operator.\n${Q(t)}`)},hS=(e,t)=>({impure:new Set(e.filter(e=>Uh(e,t,`varying`))),streamed:new Set(e.filter(e=>Uh(e,t,`streamed`)))}),gS=e=>[...e.facts.ids.keys()].some(t=>Uh(t,e)),_S=e=>[...e.facts.ids.keys()].some(t=>Uh(t,e,`repeated`)),vS=e=>typeof e==`object`&&(e.kind===`FilteredSet`||e.kind===`LazyFunction`)&&`rebind`in e,yS=e=>({environment:e.environment,scope:e.scope,state:e.next,next:void 0,isKeepLazy:e.isKeepLazy}),bS=e=>t=>{let n=e(t);return zc(n,e(yS(t)))},xS=(e,t,n,r)=>i=>{r.expressions.push(e);let a=pu.sets,o=pu.callStack,s=a??[],c=s.length;pu.sets=s,pu.callStack=r;try{let a=t(i),o=vS(a)?a.rebind(n):a;return r.values.set(e,o),typeof o==`object`&&o.kind!==`FilteredSet`&&Ub(e)&&r.sources.set(o,e),o}catch(t){t instanceof u&&!r.isFrozen&&(r.expressions.length=0,r.isFrozen=!0);let n=t instanceof Error?r.failures.get(t):void 0;t instanceof Error&&r.failures.set(t,e);let i=Wb(e,r.values),a=i&&!gt(e).some(e=>e===n)?r.values.get(i):void 0,o=e.kind===`FunctionApplication`&&a!==void 0&&!Ps(a)?void 0:a;throw SS(r,[o,...s.slice(c).filter(e=>e!==o)],t),t}finally{r.isFrozen||r.expressions.pop(),s.length=c,pu.sets=a,pu.callStack=o}},SS=(e,t,n)=>{let r=[...new Set(t)].flatMap(t=>{let n=typeof t==`object`?e.sources.get(t):void 0;return n?[n]:[]});if(r.length>0&&n instanceof w){e.isFrozen||e.expressions.push(...r);let t=e.fingerprint;e.fingerprint={sources:[...r,...t?.sources??[]],reason:t?.reason??n.message}}e.isFrozen=!0},CS=(e,t,n)=>{if(!(n instanceof w))return;e.isFrozen||e.expressions.push(t),e.isFrozen=!0;let r=e.fingerprint;e.fingerprint={sources:[t,...r?.sources??[]],reason:r?.reason??n.message}},wS=e=>({...e,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap,callStack:{expressions:[],isFrozen:!1,sources:/* @__PURE__ */ new WeakMap,values:/* @__PURE__ */ new WeakMap,failures:/* @__PURE__ */ new WeakMap}}),TS=(e,t,n)=>{let r=e.location.range,i=e.prefixEnds;if(!n||e.isBulleted||!r||!i||t.length<3)return;let a=i.slice(0,t.length-2).map(t=>({...e,location:{...e.location,range:{...r,end:t}}})).reverse(),o=e.kind===`And`;return r=>{n.expressions.push(...a);for(let i=0;i<t.length;i++){i>=2&&!n.isFrozen&&n.expressions.pop();let s=t[i](r);if(typeof s!=`boolean`)throw Xb(e,i,s);if(s!==o)return n.isFrozen||(n.expressions.length-=a.length-Math.max(i-1,0)),s}return o}},ES=(e,t,n,r)=>i=>{if(r.expressions.at(-1)===e)return n(i);r.expressions.push(...t);try{return n(i)}finally{r.isFrozen||(r.expressions.length-=t.length)}},DS=(e,t,n)=>r=>{let i=n.current;if(i===-1||!n.covered.has(e))return t(r);let a=_f(n,i,e);vf(n,a),n.current=a;try{let i=t(r),o=e.kind===`SetEnumeration`||(e.kind===`SetFilter`||e.kind===`SetMap`)&&Ns(i)||e.kind===`SetFilter`&&typeof i==`object`&&i.kind===`FilteredSet`||(e.kind===`FunctionSet`||e.kind===`RecordSet`)&&typeof i==`object`&&i.kind===e.kind||e.kind===`Apply`&&e.operator===`SUBSET`&&typeof i==`object`&&i.kind===`Subset`;return typeof i==`object`&&o&&n.values.set(i,a),i}finally{n.current=i}},OS=(e,t)=>{let n=t.evaluators.get(e);if(n)return n;let r=oC(e,t),i=t.callStack,a=i&&Cp.get(e),o=i?xS(e,r,t,i):r,s=i&&a?ES(e,a,o,i):o,c=t.coverage,l=c?DS(e,s,c):s;return t.evaluators.set(e,l),l},kS=(e,t)=>{if(t.callStack||t.coverage)return OS(e,t);let n=t.entryEvaluators.get(e);if(n)return n;let r=hg(e,t)??OS(e,t);return t.entryEvaluators.set(e,r),r},$=(e,t)=>kS(e,t.environment)(t),AS=(e,t)=>{let n=e.name,r=M(e)?void 0:sS(n,t);if(r?.kind===`Variable`){let t=r.index;return r=>{let i=r.state?.[t];if(i===void 0)throw rx(n,e);return i}}if(r?.kind===`Value`){let e=r.value;return()=>e}if(r?.kind===`Definition`){let e=r.definition,n;return r=>(n??=Wx(e,t))(r)}return t=>mS(n,e,t)},jS=(e,t)=>{if(e.kind===`Lambda`||e.kind===`OperatorReference`)return!1;if(e.kind!==`Identifier`||M(e))return!0;let n=Xx(e.name,t);return n===void 0||$x(n)===0},MS=(e,t)=>e.map(e=>({kind:`Operator`,name:`argument`,arity:0,call:()=>$(e,t),expression:e})),NS=(e,t,n)=>{if(e.isLazy)return n=>e.evaluate(MS(t,n),n);let r=e.evaluateUnary;if(r&&t.length===1&&jS(t[0],n)){let e=OS(t[0],n);return t=>r(e(t))}let i=e.evaluateBinary,a=t.length===2&&jS(t[0],n)&&jS(t[1],n);if(i&&a){let e=OS(t[0],n),r=OS(t[1],n);return t=>i(e(t),r(t))}return n=>e.evaluate(iS(t,n),n)},PS=(e,t,n)=>{if(t.length!==e.params.length)return()=>{throw aS(e,t.length)};let r=e.params,i=t.map((e,t)=>r[t].arity>0?void 0:cS(e,n));return n=>{let a=e.scope;for(let e=0;e<t.length;e++){let o=i[e],s=o?o(n):{kind:`Operator`,operator:eS(t[e],n)};a={name:r[e].name,binding:s,parent:a}}return a}},FS=(e,t,n)=>{let r=PS(e,t,n),i;return t=>(i??=kS(e.body,n),i({environment:n,scope:r(t),state:t.state,next:t.next,isKeepLazy:t.isKeepLazy}))},IS=e=>{for(let t=e;t!==void 0;t=t.parent){let e=t.binding;if(e.kind!==`Operator`||e.operator.kind!==`Closure`||e.operator.params.length===0)return!1;let n=e.operator.scope;for(;n!==void 0&&n!==t;)n=n.parent;if(n!==t)return!1}return!0},LS=/* @__PURE__ */ new Set([`\\cup`,`\\cap`,`\\`]),RS=(e,t)=>{let n=e.args;if(e.operator===`=>`){let r=OS(n[0],t),i=OS(n[1],t);return t=>!fx(r(t),e,`P`)||fx(i(t),e,`Q`)}if(e.operator===`~`&&n.length===1){let r=OS(n[0],t);return t=>px(r(t),e)}if(e.operator===`<=>`){let r=OS(n[0],t),i=OS(n[1],t);return t=>mx(r(t),i(t),e)}if(e.operator===`~>`||e.operator===`-+->`)return()=>{throw qb(e.operator===`~>`?`a ~> b`:`a -+-> formula`,e)};let r=M(e)?void 0:Xx(e.operator,t);if(r?.kind===`Closure`)return FS(r,n,t);if(r?.kind===`Builtin`&&r.name===`DOMAIN`){let r=OS(n[0],t),i=$b(e);return e=>i(r(e))}if(r?.kind===`Builtin`&&r.name===`TLCEval`&&n.length===1){let i=!Sp.has(e)&&!Jh(n[0],t),a=t.tlcEvalValues;return t=>{if(!i||!IS(t.scope))return r.evaluate(MS(n,t),t);let o=a.get(e);if(o!==void 0)return o;let s=r.evaluate(MS(n,t),void 0);return a.set(e,s),s}}if(r?.kind===`Builtin`&&r.name===`\\subseteq`&&r.evaluateBinary&&n.length===2){let i=OS(n[0],t),a=OS(n[1],t),o=ex(e,r.evaluateBinary),s=t.coverage;return s?e=>{let t=i(e),n=a(e);if(typeof t!=`object`||t.kind!==`Set`||!s.values.has(t))return o(t,n);let r=t.elements.findIndex(e=>!gu(e,n));return bf(s,t,(r===-1?t.elements.length:r)+1),r===-1}:e=>o(i(e),a(e))}let i=t.coverage,a=r?.kind===`Builtin`?r.evaluateBinary:void 0;if(i&&a&&LS.has(e.operator)&&n.length===2){let r=OS(n[0],t),o=OS(n[1],t);return t=>{let n=r(t),s=o(t);return xf(i,e.operator,n,s,a(n,s))}}if(r?.kind===`Builtin`)return NS(r,n,t);if(e.operator===`\\cdot`&&n.length===2)return()=>{throw new w(t.runtime.version===`1.7.4`?`The current version of TLC does not support action composition.`:`The current version of TLC does not support action composition. An incomplete implementation can be enabled via the tlc2.tool.impl.Tool.cdot=true java property.`)};let o=n.map(e=>cS(e,t));return r=>{let i=Qx(e.operator,r);if(i)return uS(i,n,r,o);throw t.definitions.get(e.operator)?.kind===`Function`?new w(`${e.operator} is a function; apply it with brackets`):new w(`Unknown operator ${e.operator} at ${Gb(e)}`)}},zS=(e,t)=>{let n=e.kind===`Forall`,r=OS(e.body,t),i=e.bounds[0],a=t.coverage;if(a)return t=>kx(e.bounds,t,a,i=>hx(r(ux(t,i)),e)!==n)?!n:n;if(e.bounds.length===1&&i.pattern.kind===`Name`){let a=i.pattern.name,o=OS(i.set,t);return s=>wx(Sx(o(s),i.set,t.runtime.version),t=>hx(r(ux(s,ox(s.scope,a,t))),e)!==n)?!n:n}let o=e.bounds;if(o.every(e=>e.pattern.kind===`Name`)){let i=o.map(e=>e.pattern.kind===`Name`?e.pattern.name:``);return a=>{let s=Tx(o,e=>Sx(OS(e,t)(a),e,t.runtime.version)),c=(t,o)=>t<0?hx(r(ux(a,o)),e)!==n:wx(s[t],e=>c(t-1,ox(o,i[t],e)));return c(o.length-1,a.scope)?!n:n}}return t=>Ox(o,t,i=>hx(r(ux(t,i)),e)!==n)?!n:n},BS=(e,t)=>{if(e.kind===`Tuple`)return Pl(e.names.map(e=>{let n=ax(t,e);return n?.kind===`Value`&&n.value}));let n=ax(t,e.name);return n?.kind===`Value`?n.value:void 0},VS=/* @__PURE__ */ new WeakSet,HS=e=>{(e.kind===`FunctionConstruction`||e.kind===`Except`)&&VS.add(e)},US=/* @__PURE__ */ new WeakMap,WS=e=>{if(US.has(e))return US.get(e);let t=/* @__PURE__ */ new Set,n=e=>{if(e.kind===`Subexpression`)return!1;let r=_t(e);return r!==void 0&&t.add(r),e.kind===`ExceptAt`&&t.add(`@`),gt(e).every(n)},r=n(e)?[...t]:void 0;return US.set(e,r),r},GS=(e,t)=>t===void 0||e===void 0?e:t.reduce((t,n)=>{let r=ax(e,n);return r?{name:n,binding:r,parent:t}:t},{name:``,binding:{kind:`Value`,value:!1},parent:void 0}),KS=e=>VS.has(e),qS=(e,t)=>{let n=KS(e),r=OS(e.body,t),i=e.bounds,a=i[0],o=i.length===1&&a.pattern.kind===`Name`,s=(e,t)=>{if(o&&a.pattern.kind===`Name`){let n=a.pattern.name,i=e=>r(ux(t,ox(t.scope,n,e)));if(As(e))return ou(e),js(e,i),f(e,t);let o=Ml(e),s=Oc(o,o.map(i));return Ns(e)?s:(s.lambdaDomain=e,Mc(s))}let n=[],s=Tx(i,(n,r)=>Cx(i.length>1&&typeof e==`object`&&e.kind===`ProductSet`?e.factors[r]:e,n,t.environment.runtime.version));return Dx(i,s,t.scope,e=>{let o=i.length===1?BS(a.pattern,e)??!1:Pl(i.map(t=>BS(t.pattern,e)??!1));return n.push([o,r(ux(t,e))]),!1}),Cl(n)},c=Ix(i,e.body),l=zx(i),u=WS(e.body),d=t.coverage,f=(n,a)=>{let o=GS(a.scope,u),s=ux(a,o),f=e=>r(ux(s,jx(i,o,e))),p=d&&!t.callStack?d.current:-1,m=Nx({value:Rx(n,d?e=>d.current===-1?f(e):yf(d,p,()=>f(e)):f,Lx(c,i,n),l),bounds:i,body:e.body,scope:o});return i.length===1?Mc(m):m},p=t.callStack;return{build:(t,r)=>{if(e.isRecursive||n||r.isKeepLazy||!W(t))return f(t,r);if(!(i.length===1?Ns(t):typeof t==`object`&&t.kind===`ProductSet`&&t.factors.every(Ns))){if(p)return f(t,r);try{return s(t,r)}catch(e){if(!(e instanceof w))throw e;return f(t,r)}}if(!p)return s(t,r);try{return s(t,r)}catch(t){throw CS(p,e,t),t}},createLazy:f}},JS=(e,t)=>{let n=qS(e,t).build,r=e.bounds,i=t.coverage;if(i)return t=>{let a=Ax(r,t),o=n(a,t),s=r.length===1||typeof a!=`object`||a.kind!==`ProductSet`?[a]:a.factors;return(typeof o!=`object`||o.kind!==`LazyFunction`)&&s.every(Ns)&&i.current!==-1&&i.covered.has(e)&&Mf(i,i.current,s),o};if(r.length===1&&r[0].pattern.kind===`Name`){let e=OS(r[0].set,t);return t=>n(e(t),t)}return e=>n(Ax(r,e),e)},YS=(e,t)=>{let n=VS.has(e);n&&HS(e.function);let r=OS(e.function,t),i=e.updates.map(e=>({path:e.path.map(e=>e.kind===`Field`?{kind:`Field`,name:e.name,args:[]}:{kind:`Index`,name:``,args:e.args.map(e=>OS(e,t))}),value:OS(e.value,t)})),a=(e,t)=>e.kind===`Field`?e.name:e.args.length===1?e.args[0](t):Pl(e.args.map(e=>e(t))),o=(e,t,r,i,s)=>r===t.length?s(ux(i,ox(i.scope,`@`,e))):Ru(e,a(t[r],i),e=>o(e,t,r+1,i,s),n&&r===0);return t=>{let n=r(t);for(let r of i){let i=!1;n=o(n,r.path,0,t,e=>(i=!0,r.value(e))),i||t.environment.runtime.warn(Ko.exceptAppliedToUnknownField,`The EXCEPT was applied to non-existing fields of the value at\n${Q(e.function)}`)}return n}},XS=(e,t)=>{let n=OS(e.predicate,t),r=e.bound.pattern,i=Jb(e.predicate),a=e.predicate.location.range&&{names:r.kind===`Name`?r.name:r.names.join(`, `),predicate:i},o=t.coverage,s=(t,n,c,l)=>{let u=(e,t)=>{if(r.kind===`Tuple`&&du(e)?.length!==r.names.length)throw new w(`Attempted to check if the value:\n${U(q(e))}\nis an element of a set of ${r.names.length}-tuples.`);let a=c(ux(n,sx(n.scope,r,e)));if(typeof a!=`boolean`)throw new w(`${t?`The evaluation of predicate`:`Evaluating predicate`} ${i} yielded non-Boolean value.`);return a},d=r=>s(t,{...n,environment:r},OS(e.predicate,r),-1);return!o||l===-1?{kind:`FilteredSet`,base:t,test:u,source:a,rebind:d}:{kind:`FilteredSet`,base:t,test:(e,t)=>yf(o,t?-1:l,()=>u(e,t)),startPass:e=>{let n=wf(o,t);return r=>{n?.next(),Ef(o,t,r),o.secondary[l]++;let i=yf(o,l,()=>u(r,!1));return e&&i&&o.secondary[l]++,i}},source:a,rebind:d}};return(e,t,r=-1)=>s(e,t,n,r)},ZS=e=>M(e)||e.kind===`OperatorReference`||gt(e).some(ZS),QS=(e,t)=>e.bound.pattern.kind===`Name`&&!t.coverage&&!ZS(e.predicate)&&!Hh([e.predicate],t,`varying`),$S=(e,t)=>{if(typeof e!=`boolean`)throw new w(`Attempted to evaluate an expression of form {x \\in S : P(x)} when P was ${fp(e)}.\n${Jb(t.predicate)}`);return e},eC=(e,t,n,r)=>{if(!Ms(e)||mc(e))throw new w(`Attempted to compute the value of an expression of\nform CHOOSE x \\in S: P, but S was not enumerable.\n${Q(t)}`);return pl(e),Cx(e,n,r)},tC=e=>new w(`Attempted to compute the value of an expression of form\nCHOOSE x \\in S: P, but no element of S satisfied P.\n${Q(e)}`),nC=(e,t)=>{if(e.kind===`SetFilter`){let n=OS(e.predicate,t),r=OS(e.bound.set,t),i=XS(e,t),a=e.bound.pattern,o=t.coverage,s=QS(e,t);return t=>{let c=r(t);if(!Ns(c))return i(c,t,o?.current);let l=[],u=c.kind===`Interval`?c:G(c).elements,d=Array.isArray(u)?u.length:u.high-u.low+1;for(let r=0;r<d;r++){let i=Array.isArray(u)?u[r]:u.low+r,o=n(ux(t,sx(t.scope,a,i)));if($S(o,e))ks(l,i);else if(s)break}return o&&bf(o,c,d+1),Dc(l)}}if(e.kind===`SetMap`){let n=OS(e.expression,t),r=t.coverage;return t=>{let i=[],a=e=>(ks(i,n(ux(t,e))),!1);return r?kx(e.bounds,t,r,a):Ox(e.bounds,t,a),vl(i)}}let n=e.set;if(!n)return()=>{throw new w(`TLC attempted to evaluate an unbounded CHOOSE.\nMake sure that the expression is of form CHOOSE x \\in S: P(x).\n${Q(e)}`)};let r=OS(e.body,t),i=OS(n,t),a=t.coverage;return t=>{let o=i(t),s=eC(o,e,n,t.environment.runtime.version),c=a&&kf(a,o,s,!0),l,u=e.pattern;if(wx(s,n=>{if(c?.next(),u.kind===`Tuple`&&du(n)?.length!==u.names.length)throw new w(`Attempted to compute the value of an expression of form\nCHOOSE <<x1, ... , xN>> \\in S: P, but S was not a set\nof N-tuples.\n${Q(e)}`);let i=sx(t.scope,u,n);return hx(r(ux(t,i)),e)?(l=BS(u,i),!0):!1}),l!==void 0)return l;throw c?.next(),tC(e)}},rC=e=>[...e].sort((e,t)=>xc(e.name,t.name)),iC=e=>e.some((t,n)=>n>0&&e[n-1].name===t.name),aC=(e,t)=>{let n=rC(e),r=e.map(e=>OS(e.value,t));if(iC(n))return t=>Fl(e.map((e,n)=>[e.name,r[n](t)]));let i=n.map(e=>e.name),a=e.map(e=>e.name);if(a.some((e,t)=>e!==i[t])){let t=n.map(t=>e.indexOf(t));return e=>Ws(i,t,r.map(t=>t(e)),a)}return e=>Il(i,r.map(t=>t(e)))},oC=(e,t)=>{let n=e=>OS(e,t);switch(e.kind){case`Number`:{let t=e.value;return Rs(t)?()=>t:()=>{throw nx(e)}}case`Decimal`:return()=>{throw tx(e)};case`String`:{let t=e.value;return()=>t}case`Identifier`:return AS(e,t);case`Apply`:return RS(e,t);case`Bracket`:return()=>{throw new w(`A bracket without a function or subscript is not an expression at ${Gb(e)}`)};case`OperatorReference`:case`Lambda`:return()=>{throw new w(`An operator cannot be used as a value at ${Gb(e)}`)};case`And`:{let r=e.operands.map(n);return TS(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Xb(e,n,i);if(!i)return!1}return!0})}case`Or`:{let r=e.operands.map(n);return TS(e,r,t.callStack)??(t=>{for(let n=0;n<r.length;n++){let i=r[n](t);if(typeof i!=`boolean`)throw Xb(e,n,i);if(i)return!0}return!1})}case`Prime`:{let t=n(e.expression);return e=>t(yS(e))}case`Unchanged`:return bS(n(e.expression));case`If`:{let t=n(e.condition),r=n(e.consequent),i=n(e.alternative);return n=>{let a=t(n);if(typeof a!=`boolean`)throw Yb(e,a);return a?r(n):i(n)}}case`Case`:{let t=e.arms.map(e=>({source:e.condition,condition:n(e.condition),body:n(e.body)})),r=e.other?n(e.other):void 0;return n=>{for(let e of t){let t=e.condition(n);if(typeof t!=`boolean`)throw new w(`A non-boolean expression (${fp(t)}) was used as a condition of a CASE. ${Jb(e.source)}`);if(t)return e.body(n)}if(r)return r(n);throw new w(`Attempted to evaluate a CASE with no conditions true.\n${Q(e)}`)}}case`Let`:{let t=n(e.body);return n=>t(ux(n,pS(e.definitions,n)))}case`Forall`:case`Exists`:return zS(e,t);case`UnboundedQuantifier`:return()=>{let t=e.quantifier===`Forall`?`\\A`:`\\E`;throw e.isTemporal?qb(e.quantifier===`Forall`?`\\AA`:`\\EE`,e):new w(`TLC attempted to evaluate an unbounded ${t}.\nMake sure that the expression is of form ${t} x \\in S: P(x).\n${Q(e)}`)};case`Choose`:case`SetFilter`:case`SetMap`:return nC(e,t);case`SetEnumeration`:{let t=e.elements.map(n);return e=>vl(t.map(t=>t(e)))}case`Tuple`:{let t=e.elements.map(n);return e=>Pl(t.map(t=>t(e)))}case`FunctionConstruction`:return JS(e,t);case`FunctionSet`:{let t=n(e.domain),r=n(e.range);return e=>({kind:`FunctionSet`,domain:t(e),range:r(e)})}case`Record`:return aC(e.fields,t);case`RecordSet`:{let t=rC(e.fields),r=t.map(e=>e.name),i=t.map(t=>e.fields.indexOf(t)),a=e.fields.map(e=>n(e.value));return i.every((e,t)=>e===t)?e=>({kind:`RecordSet`,names:r,sets:a.map(t=>t(e))}):e=>{let t=a.map(t=>t(e));return{kind:`RecordSet`,names:r,sets:i.map(e=>t[e])}}}case`Except`:return YS(e,t);case`ExceptAt`:return t=>{let n=ax(t.scope,`@`);if(n?.kind!==`Value`)throw new w(`@ appears outside an EXCEPT at ${Gb(e)}`);return n.value};case`FunctionApplication`:{HS(e.function);let r=n(e.function),i=t=>cx(r(lx(t)),e),a=e.args.map(n),o=Qb(t.runtime.version);if(a.length===1){let e=a[0];return t=>Fu(i(t),e(t),o)}return e=>Fu(i(e),Pl(a.map(t=>t(e))),o)}case`FieldAccess`:{let t=n(e.record),r=Zb(e);return e=>r(t(e))}case`Product`:{let t=e.factors.map(n);return e=>({kind:`ProductSet`,factors:t.map(t=>t(e))})}case`BoxAction`:case`AngleAction`:{let t=n(e.action),r=bS(n(e.subscript)),i=e.kind===`BoxAction`,a=i?`[A]_e`:`<A>_e`;return n=>{let o=t(n);if(typeof o!=`boolean`)throw new w(`Attempted to evaluate an expression of form ${a}, but A was not a boolean.\n${Q(e)}`);return i?o||r(n):o&&!r(n)}}case`Enabled`:{let t=e.expression;return e=>Pb(t,e)}case`Label`:return n(e.body);case`Selection`:return n(e.expression);case`Subexpression`:return()=>{throw new w(`The subexpression reference at ${Gb(e)} does not name a subexpression`)};case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return()=>{throw qb(Kb[e.kind],e)}}},sC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},cC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^Yu(e[t]),16777619),r=Math.imul(r^td(e[t]),1540483477);t[0]=sC(n)||1,t[1]=sC(r)},lC=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},uC=e=>({slots:new Int32Array(1<<17),size:0,shift:16,states:e}),dC=e=>{let t=2166136261;for(let n=0;n<e.length;n++)t=Bu(t,Yu(e[n]));return t&1073741823},fC=(e,t)=>{for(let n=0;n<t.length;n++)if(!Vc(e[n],t[n]))return!1;return!0},pC=(e,t)=>Math.imul(t,2654435761)>>>e.shift<<1,mC=(e,t,n)=>{let r=e.slots.length-1;for(let i=pC(e,t);;i=i+2&r){let r=e.slots[i+1];if(r===0)return-1;if(e.slots[i]===t&&fC(e.states[r-1],n))return r-1}},hC=(e,t,n)=>{let r=e.slots.length-1,i=pC(e,t);for(;e.slots[i+1]!==0;)i=i+2&r;e.slots[i]=t,e.slots[i+1]=n},gC=(e,t,n)=>{if(e.size++,e.size*4>e.slots.length){let t=e.slots;e.slots=new Int32Array(t.length*2),e.shift--;for(let n=0;n<t.length;n+=2)t[n+1]!==0&&hC(e,t[n],t[n+1])}hC(e,t,n+1)},_C=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},vC=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),yC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return _C(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},bC=e=>Atomics.load(e.used,0)*2>=e.slots.length,xC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&_C(t,n);return{slots:t,used:e.used}},SC={kind:`Boolean`,value:!0},CC={kind:`Boolean`,value:!1},wC=e=>e?SC:CC,TC=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Action`,EC=e=>e.kind===`State`||e.kind===`Enabled`||e.kind===`Boolean`,DC=(e,t)=>({kind:e,body:t}),OC=(e,t,n)=>({kind:e,operands:[t,n]}),kC=(e,t)=>({kind:e,operands:t.flatMap(t=>t.kind===e?kC(e,t.operands).operands:[t])}),AC=e=>{switch(e.kind){case`Boolean`:return 0;case`State`:case`Enabled`:return 1;case`Action`:case`Next`:return 2;case`Not`:return AC(e.body);case`Always`:case`Eventually`:return 3;case`And`:case`Or`:return e.operands.reduce((e,t)=>Math.max(e,AC(t)),0)}},jC=e=>{switch(e.kind){case`Action`:return!0;case`Boolean`:case`State`:case`Enabled`:return!1;case`Not`:case`Always`:case`Eventually`:case`Next`:return jC(e.body);case`And`:case`Or`:return e.operands.some(jC)}},MC=/* @__PURE__ */ new WeakMap;let NC=0;const PC=e=>{let t=MC.get(e);if(t!==void 0)return t;let n=(()=>{switch(e.kind){case`Boolean`:return String(e.value);case`State`:case`Enabled`:case`Action`:return`#${NC++}`;case`And`:case`Or`:return`${e.kind}(${e.operands.map(PC).join(`,`)})`;default:return`${e.kind}(${PC(e.body)})`}})();return MC.set(e,n),n},FC=(e,t)=>e===t||PC(e)===PC(t),IC=(e,t)=>{let n=PC(t);return e.some(e=>e===t||PC(e)===n)},LC=e=>e===`And`?`Or`:`And`,RC=(e,t)=>{switch(e.kind){case`Boolean`:return t?wC(!e.value):e;case`State`:case`Enabled`:case`Action`:case`Next`:return t?DC(`Not`,e):e;case`Not`:return RC(e.body,!t);case`And`:case`Or`:return kC(t?LC(e.kind):e.kind,e.operands.map(e=>RC(e,t)));case`Always`:case`Eventually`:{let n=t===(e.kind===`Always`)?`Eventually`:`Always`;return DC(n,RC(e.body,t))}}},zC=e=>{switch(e.kind){case`Boolean`:return wC(!e.value);case`Not`:return e.body;case`And`:case`Or`:return kC(LC(e.kind),e.operands.map(zC));case`Always`:return DC(`Eventually`,zC(e.body));case`Eventually`:return DC(`Always`,zC(e.body));default:return DC(`Not`,e)}},BC=e=>{switch(e.kind){case`And`:case`Or`:{let t=e.kind===`Or`,n=[];for(let r of e.operands){let e=BC(r);if(e.kind!==`Boolean`)n.push(e);else if(e.value===t)return wC(t)}return n.length===0?wC(!t):n.length===1?n[0]:kC(e.kind,n)}case`Not`:{let t=BC(e.body);return t.kind===`Boolean`?wC(!t.value):DC(`Not`,t)}case`Always`:case`Eventually`:{let t=BC(e.body);return DC(e.kind,t.kind===e.kind?t.body:t)}default:return e}},VC=e=>e.kind===`Always`&&e.body.kind===`Eventually`?e.body.body:void 0,HC=e=>{switch(e.kind){case`And`:{let t=[],n=1;for(let r of e.operands){let e=HC(r);if(e.kind===`And`)t.push(...e.operands);else{if(e.kind===`Or`&&(n*=e.operands.length,n>2147483647))throw new w(`TLC cannot handle the temporal formula because it exceeds the maximum supported size in disjunctive normal form.`);t.push(e)}}if(n===1)return{kind:`And`,operands:t};let r=Array.from({length:n},()=>[]),i=1,a=n;for(let e of t){if(e.kind!==`Or`){r.forEach(t=>t.push(e));continue}a/=e.operands.length;let t=0;for(let n=0;n<i;n++)for(let n of e.operands)for(let e=0;e<a;e++)r[t++].push(n);i*=e.operands.length}return{kind:`Or`,operands:r.map(e=>kC(`And`,e))}}case`Or`:{let t=[],n=[];for(let r of e.operands){let e=HC(r);for(let r of e.kind===`Or`?e.operands:[e]){let e=VC(r);e?t.push(e):n.push(r)}}if(t.length>0){let e=t.length===1?t[0]:kC(`Or`,t);n.push(DC(`Always`,DC(`Eventually`,e)))}return kC(`Or`,n)}case`Not`:return TC(e.body)?e:HC(zC(e.body));default:return e}},UC=e=>{switch(e.kind){case`And`:case`Or`:return e.operands.length===1?UC(e.operands[0]):kC(e.kind,e.operands.map(UC));case`Not`:return e.body.kind===`Not`?UC(e.body.body):DC(`Not`,UC(e.body));case`Always`:case`Eventually`:case`Next`:return DC(e.kind,UC(e.body));default:return e}},WC=e=>{switch(e.kind){case`And`:case`Or`:{if(e.operands.length===1)return WC(e.operands[0]);let t=Math.floor(e.operands.length/2);return OC(e.kind,WC(kC(e.kind,e.operands.slice(0,t))),WC(kC(e.kind,e.operands.slice(t))))}case`Not`:case`Always`:case`Eventually`:case`Next`:return DC(e.kind,WC(e.body));default:return e}},GC=(e,t)=>{e.kind===`Eventually`&&!IC(t,e)&&t.push(e),`body`in e&&GC(e.body,t),`operands`in e&&e.operands.forEach(e=>GC(e,t))},KC=e=>{let t=e.filter(EC),n=e.flatMap(e=>e.kind===`Not`&&EC(e.body)?[e.body]:[]);return!t.some(e=>IC(n,e))},qC=e=>{let t=[...e],n=[];for(;t.length>0;){let e=t.pop();if(!e)break;switch(e.kind){case`Not`:t.push(e.body);break;case`Next`:n.push(e),t.push(e.body);break;case`Always`:case`Eventually`:n.push(e,DC(`Next`,e)),t.push(e.body);break;case`And`:case`Or`:t.push(...e.operands),n.push(e);break;case`Action`:throw new w(`TLC encountered actions while constructing the tableau`);default:n.push(e)}}return n},JC=(e,t,n)=>{if(e.kind===t&&`body`in e)return{first:e.body,second:DC(`Next`,e)};if(e.kind===n&&`operands`in e)return{first:e.operands[0],second:e.operands[1]}},YC=(e,t,n)=>e.flatMap(e=>{let r=JC(e,t,n);return r?[{whole:e,first:r.first,second:r.second}]:[]}),XC=e=>[...new Set(e.map(PC))].sort().join(`|`),ZC=(e,t)=>{let n=new Set(t.map(XC));return[...e.filter(e=>!n.has(XC(e))),...t]},QC=e=>{let t=qC(e),n=YC(t,`Always`,`And`),r=YC(t,`Eventually`,`Or`),i=e=>{for(let t of e){let n=JC(t,`Eventually`,`Or`);if(n&&!(IC(e,n.first)||IC(e,n.second)))return ZC(a([...e,n.first]),a([...e,n.second]))}let t=r.find(t=>(IC(e,t.first)||IC(e,t.second))&&!IC(e,t.whole));return t?a([...e,t.whole]):[e]},a=e=>{if(!KC(e))return[];let t=[...e];for(let e=0;e<t.length;e++){let n=JC(t[e],`Always`,`And`);n&&(IC(t,n.first)||t.push(n.first),IC(t,n.second)||t.push(n.second))}let r=!0;for(;r;){r=!1;for(let e of n)IC(t,e.first)&&IC(t,e.second)&&!IC(t,e.whole)&&(t.push(e.whole),r=!0)}return t.length>e.length&&!KC(t)?[]:i(t)};return a(e)},$C=e=>({particle:e,successors:[],statePredicates:e.filter(e=>AC(e)<=1)}),ew=e=>{let t=QC([e]).map($C),n=t.length,r=/* @__PURE__ */ new Map;t.forEach((e,t)=>{let n=XC(e.particle);r.has(n)||r.set(n,t)});for(let e=0;e<t.length;e++){let n=t[e].particle.flatMap(e=>e.kind===`Next`?[e.body]:[]);for(let i of QC(n)){let n=XC(i),a=r.get(n);a===void 0&&(r.set(n,t.length),t.push($C(i))),t[e].successors.push(a??t.length-1)}}return{nodes:t,initialCount:n}},tw=(e,t)=>!IC(e,t)||IC(e,t.body),nw=(e,t)=>{if(e.kind===`Eventually`&&e.body.kind===`Always`&&AC(e.body.body)<3){t.eventuallyAlways.push(e.body.body);return}let n=VC(e);if(n){let e=AC(n);if(e<=1){t.infinitelyOftenStates.push(n);return}if(e===2){t.infinitelyOftenActions.push(n);return}}if(jC(e))throw new w(`Temporal formulas containing actions must be of forms <>[]A or []<>A.`);t.formulas.push(e)},rw=(e,t)=>{let n=e.findIndex(e=>FC(e,t));return n===-1?(e.push(t),e.length-1):n},iw=e=>{let t=HC(BC(RC(e,!1)));if(t.kind===`Boolean`&&!t.value)return[];let n=[];for(let e of t.kind===`Or`?t.operands:[t]){let t=UC(e),r={eventuallyAlways:[],infinitelyOftenStates:[],infinitelyOftenActions:[],formulas:[]};for(let e of t.kind===`And`?t.operands:[t])nw(e,r);let i=r.formulas,a=i.length===0?void 0:i.length===1?i[0]:kC(`And`,i),o=n.find(e=>e.formula===void 0||a===void 0?e.formula===a:FC(e.formula,a));o?o.classifications.push(r):n.push({formula:a,classifications:[r]})}return n.map(e=>{let t=e.formula&&WC(e.formula),n=[];t&&GC(t,n);let r=[],i=[],a=e.classifications.map(e=>({infinitelyOftenActions:e.infinitelyOftenActions.map(e=>rw(i,e)),infinitelyOftenStates:e.infinitelyOftenStates.map(e=>rw(r,e)),eventuallyAlways:e.eventuallyAlways.map(e=>rw(i,e))}));return{tableau:t&&ew(t),promises:n,stateChecks:r,actionChecks:i,models:a}})},aw=()=>v(new w(`Temporal formula is a tautology (its negation is unsatisfiable).`),b.livenessEvaluationFailure),ow=/* @__PURE__ */ new Set([`~>`,`-+->`]),sw=/* @__PURE__ */ new WeakSet,cw=/* @__PURE__ */ new Map([[`/\\`,`And`],[`\\/`,`Or`]]),lw=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),uw=(e,t)=>new w(`TLC cannot handle the temporal formula ${Q(e)}${t===void 0?``:`:\n${t}`}`),dw=(e,t,n,r=/* @__PURE__ */ new Set,i=/* @__PURE__ */ new Set)=>{let a=(e,t,r)=>{if(i.has(e))return 0;i.add(e);let a=dw(t,r,n,/* @__PURE__ */ new Set,i);return i.delete(e),a},o=e=>{let n=ax(t,e);if(!n)return;if(n.kind===`Value`)return 0;if(n.kind===`Thunk`)return n.isReleased?0:a(n,n.expression,n.scope);let r=n.operator;return r.kind===`Closure`?a(r,r.body,r.scope):0},s=e=>{if(n.variableIndex.has(e))return 1;if(n.constants.has(e))return 0;let t=gx(e,n);if(t)return Gh(t,n);let r=n.builtins.get(n.substitutions.get(e)??e);if(r)return r.isActionLevel?2:r.isStateLevel&&!r.isLevelConstant?1:0},c=(e,t)=>r.has(e)?0:M(t)?o(e)??s(e)??0:s(e)??o(e)??0,l=e=>{let a=0;return jp(e,(e,o)=>(a=Math.max(a,dw(e,t,n,o.length===0?r:/* @__PURE__ */ new Set([...r,...o]),i)),e)),a};switch(e.kind){case`Prime`:case`Unchanged`:case`BoxAction`:case`AngleAction`:return 2;case`Enabled`:return 1;case`Always`:case`Eventually`:case`WeakFairness`:case`StrongFairness`:return 3;case`UnboundedQuantifier`:return e.isTemporal?3:l(e);case`Identifier`:return c(e.name,e);case`OperatorReference`:return c(e.operator,e);case`Apply`:{if(ow.has(e.operator))return 3;if(e.operator===`\\cdot`)return 2;let r=c(e.operator,e),i=Math.max(r,l(e)),o=M(e)?void 0:Xx(e.operator,n);return i===r||o?.kind!==`Closure`||o.params.length!==e.args.length?i:a(o,o.body,lS(o,e.args,lw(n,t)))}default:return l(e)}},fw=(e,t)=>{try{return Ex(e,t)}catch(e){if(!(e instanceof w))throw e;if(!rs(e))return;throw v(new w(`${a}${e.message}`),b.error)}},pw=(e,t,n,r,i={name:void 0,path:[],expanding:/* @__PURE__ */ new Set,isSubstituted:!1})=>{let a=(e,t,a=i.name,o=i.expanding,s)=>pw(e,t,n,r,{name:a,path:s?.kind===`Operator`&&s.params.length===0?[...i.path,s.name]:i.path,expanding:o,isSubstituted:i.isSubstituted||s!==void 0&&n.substitutedDefinitions.has(s)});if(e.kind===`And`)return e.operands.flatMap(e=>a(e,t,Q(e)));if(e.kind===`Label`)return a(e.body,t);if(e.kind===`Selection`)return a(e.expression,t);if(e.kind===`Let`)return a(e.body,mw(e,t,n));if(e.kind===`Identifier`){let r=M(e)?ax(t,e.name):void 0;if(r?.kind===`Thunk`&&!r.isReleased)return a(r.expression,r.scope,sw.has(r)?e.name:i.name);let o=n.constants.has(e.name)?void 0:gx(e.name,n);if(!r&&o?.kind===`Operator`&&o.params.length===0&&(Gh(o,n)>0||Gx(o,n)===void 0)){if(i.expanding.has(o))throw h();return a(o.body,void 0,!i.isSubstituted&&n.instanceNames.get(e.name)||o.name,/* @__PURE__ */ new Set([...i.expanding,o]),o)}}let o=lw(n,t);if(e.kind===`Apply`&&n.runtime.version!==`1.7.4`&&(r||dw(e,t,n)===3)){let t=Zx(e,o),r=M(e)?void 0:gx(e.operator,n),s=t?.kind===`Closure`&&t.params.every(e=>n.instanceParams.has(e));if(t?.kind===`Closure`&&t.params.length===e.args.length&&!r?.isRecursive&&(!i.isSubstituted||s))return a(t.body,lS(t,e.args,o),i.isSubstituted&&r?r.name:e.operator,i.expanding,r)}let s=r&&e.kind===`Forall`&&e.bounds.every(e=>dw(e.set,t,n)===0),c=s?fw(e.bounds,o):void 0;if(s&&c){let n=[];if(Dx(e.bounds,c,t,t=>(n.push(...a(e.body,t,Q(e.body))),!1)),n.length===0)throw aw();return n}return[{expression:e,scope:t,name:i.name,path:i.path}]},mw=(e,t,n)=>{let r=pS(e.definitions,lw(n,t),hS(e.definitions,n));for(let n=r;n&&n!==t;n=n.parent){n.binding.kind===`Thunk`&&sw.add(n.binding);let t=n.name,r=e.definitions.find(e=>e.name===t);r&&Yd.set(n,r)}return r},hw=(e,t,n)=>{let r=n.runtime.version===`1.7.4`,a=(e,t,i)=>{let a=i===0&&!r?dw(e,t,n):i;if(a===0){let r=$(e,lw(n,t));if(typeof r!=`boolean`)throw new w(`TLC expected a boolean value, but did not find one. ${Jb(e)}`);return wC(r)}return a===1?{kind:`State`,expression:e,scope:t}:e.kind===`AngleAction`?{kind:`Action`,expression:e.action,subscript:e.subscript,scope:t}:{kind:`Action`,expression:e,subscript:void 0,scope:t}},o=0,s=(e,t,r,i)=>{if(o>=100)throw h();o++;let s=p(e,t);o--;let c=AC(s),l=c===0&&dw(r,i,n)>2;return c>2||l?s:a(r,i,c)},c=(e,t)=>{let i=e.kind===`Identifier`?e.name:e.operator,a=lw(n,t),o=M(e)||gx(i,n)===void 0?ax(t,i):void 0;if(o?.kind===`Thunk`&&!o.isReleased&&sw.has(o))return l(e,()=>s(o.expression,o.scope,e,t));let c=o?.kind===`Operator`?o.operator:o?void 0:M(e)?Qx(i,a):Xx(i,n),u=e.kind===`Apply`?e.args:[],f=c?.kind===`Builtin`&&u.length===2?cw.get(c.name):void 0;if(f){let n=u.map(e=>p(e,t));return d(e,t,kC(f,n))}if(c?.kind!==`Closure`)throw uw(e);let m=!M(e)&&gx(i,n)?.isRecursive===!0;return l(e,()=>(r&&u.filter(e=>e.kind!==`Lambda`&&e.kind!==`OperatorReference`).forEach(e=>$(e,a)),s(c.body,lS(c,u,a),e,t)),m)},l=(e,t,n=!1)=>{try{return t()}catch(t){let a=t instanceof i||n&&!r;throw!(t instanceof w)||a?t:uw(e)}},u=(e,t)=>{let r=dw(e,t,n),o=[],s=e.kind===`Forall`;try{Ox(e.bounds,lw(n,t),t=>(o.push(p(e.body,t)),!1))}catch(n){if(!(n instanceof w)||n instanceof i)throw n;if(r<=2)return a(e,t,r);throw uw(e,s&&!rs(n)?n.message:void 0)}return o.length===0?wC(s):d(e,t,kC(s?`And`:`Or`,o))},d=(e,t,n)=>{let r=AC(n);return r>2?n:a(e,t,r)},f=(e,t)=>{let n=e.operands,r=e.location.range,i=e.prefixEnds;return e.isBulleted||!r||!i?d(e,t,kC(e.kind,n.map(e=>p(e,t)))):n.slice(1).reduce((a,o,s)=>{let c=s===n.length-2?e:{...e,operands:n.slice(0,s+2),prefixEnds:i.slice(0,s+1),location:{...e.location,range:{...r,end:i[s]}}};return d(c,t,kC(e.kind,[a,p(o,t)]))},p(n[0],t))},p=(e,t)=>{let i=dw(e,t,n);switch(e.kind){case`Label`:return p(e.body,t);case`Selection`:return p(e.expression,t);case`Let`:return p(e.body,mw(e,t,n));case`Apply`:{let n=e.args;if(e.operator===`~`&&!M(e))return d(e,t,DC(`Not`,p(n[0],t)));if(e.operator===`=>`)return d(e,t,OC(`Or`,DC(`Not`,p(n[0],t)),p(n[1],t)));break}case`And`:case`Or`:return f(e,t);case`Forall`:case`Exists`:return u(e,t);case`If`:{if(!r&&dw(e.condition,t,n)===0){let r=$(e.condition,lw(n,t));if(typeof r==`boolean`)return p(r?e.consequent:e.alternative,t)}let i=p(e.condition,t);return d(e,t,OC(`Or`,OC(`And`,i,p(e.consequent,t)),OC(`And`,DC(`Not`,i),p(e.alternative,t))))}}if(i<=2)return a(e,t,i);switch(e.kind){case`Identifier`:return c(e,t);case`Apply`:return e.operator===`~>`?DC(`Always`,OC(`Or`,DC(`Not`,p(e.args[0],t)),DC(`Eventually`,p(e.args[1],t)))):c(e,t);case`Always`:case`Eventually`:return DC(e.kind,p(e.expression,t));case`WeakFairness`:case`StrongFairness`:{let n={kind:`AngleAction`,action:e.action,subscript:e.subscript,location:e.action.location},r={kind:`Enabled`,step:e.enabled??n,scope:t},i=DC(`Not`,r),a={kind:`Action`,expression:e.action,subscript:e.subscript,scope:t,enabled:r};return e.kind===`WeakFairness`?DC(`Always`,DC(`Eventually`,OC(`Or`,i,a))):OC(`Or`,DC(`Eventually`,DC(`Always`,i)),DC(`Always`,DC(`Eventually`,a)))}default:throw uw(e)}};return p(e,t)},gw=e=>({holdsState:(t,n)=>{let r={environment:e,scope:t.scope,state:n,next:void 0},i=t.kind===`State`?$(t.expression,r):Pb(t.step,r);if(typeof i!=`boolean`)throw new w(`A state predicate was evaluated to a non-boolean value.`);return i},holdsAction:(t,n,r)=>{let i=t.scope,a=t.subscript;if(a&&ml($(a,{environment:e,scope:i,state:n,next:void 0}),$(a,{environment:e,scope:i,state:r,next:void 0})))return!1;let o=$(t.expression,{environment:e,scope:i,state:n,next:r});if(typeof o!=`boolean`)throw new w(`Encountered an action predicate that's not a boolean.`);return o}}),_w=(e,t,n,r,i)=>{let a=e=>_w(e,t,n,r,i);switch(e.kind){case`Boolean`:return e.value;case`State`:case`Enabled`:{let n=i.get(e);if(n!==void 0)return n;let a=r.holdsState(e,t);return i.set(e,a),a}case`Action`:return e.enabled&&i.get(e.enabled)===!1?!1:n!==void 0&&r.holdsAction(e,t,n);case`Not`:return!a(e.body);case`And`:return e.operands.every(a);case`Or`:return e.operands.some(a);case`Next`:return _w(e.body,n??t,void 0,r,/* @__PURE__ */ new Map);case`Always`:case`Eventually`:throw new w(`TLC cannot evaluate a temporal formula in a single step`)}},vw=(e,t,n,r,i)=>{let a=e=>e+1<t.length?e+1:n,o=e=>t.map((e,t)=>t).filter(t=>t>=Math.min(e,n)),s=(e,a=r)=>vw(e,t,n,a,i);switch(e.kind){case`Not`:return!s(e.body);case`And`:return e.operands.every(e=>s(e));case`Or`:return e.operands.some(e=>s(e));case`Next`:return s(e.body,a(r));case`Always`:return o(r).every(t=>s(e.body,t));case`Eventually`:return o(r).some(t=>s(e.body,t));default:return _w(e,t[r],t[a(r)],gw(i),/* @__PURE__ */ new Map)}},yw=`UnnamedAction`,bw={module:`--TLA+ BUILTINS--`,start:{line:0,column:0},end:{line:0,column:0}},xw=e=>{let t=e.range??bw;return Fl([[`beginLine`,t.start.line],[`beginColumn`,t.start.column],[`endLine`,t.end.line],[`endColumn`,t.end.column],[`module`,t.module]])},Sw=(e,t)=>{let n=[[`name`,e.name],[`location`,xw(e.location)]];return e.parameters.length>0&&n.push([`context`,Fl(e.parameters)],[`parameters`,Pl(e.parameters.map(e=>e[0]))]),t!==void 0&&n.push([`coverage`,t]),Fl(n)},Cw=(e,t,n)=>({name:e,location:t.location,parameters:[],expression:t,scope:n}),ww=(e,t)=>({environment:e,scope:t,state:void 0,next:void 0}),Tw=e=>e.kind===`Identifier`?e.name:e.kind===`Apply`?e.operator:void 0,Ew=e=>e.kind===`Apply`?e.args:[],Dw=(e,t,n)=>{let r=Tw(e);if(r===void 0)return;if(M(e)){let e=ax(t,r);return e?.kind===`Operator`&&e.operator.kind===`Closure`?e.operator:void 0}if(n.constants.has(r)||n.variableIndex.has(r))return;let i=Xx(r,n);return i?.kind===`Closure`?i:void 0},Ow=(e,t)=>{try{return $(e,ww(t,void 0)),!0}catch(e){if(e instanceof y)return!1;throw e}},kw=(e,t)=>e?.kind===`Operator`&&e.params.length===0&&Bh(e,t)&&Ow(e.body,t),Aw=(e,t)=>e?.kind===`Operator`&&e.body.kind!==`Number`&&e.body.kind!==`String`&&kw(e,t),jw=(e,t)=>{let n=gx(e.name,t);return n?.body===e.body&&Aw(n,t)},Mw=(e,t)=>{if(e.kind!==`Identifier`||!M(e))return;let n=ax(t,e.name);return n?.kind===`Thunk`?n:void 0},Nw=(e,t,n)=>{if(e.kind===`Let`)return{expression:e.body,scope:mw(e,t,n)};let r=Mw(e,t);return r&&{expression:r.expression,scope:r.scope}},Pw=(e,t,n,r)=>t.kind===`Apply`?lS(e,t.args,ww(r,n)):e.scope,Fw=(e,t)=>(e?.params??[]).flatMap(e=>{let n=ax(t,e.name);return n?.kind===`Value`?[[e.name,n.value]]:[]}),Iw=(e,t)=>{try{return e()}catch(e){if(e instanceof y)return t();throw e}},Lw=(e,t,n,r,i)=>{let a=Ew(t),o=()=>[{name:e.name,location:t.location,parameters:[],expression:t,scope:n}];return r&&a.length===0?[{...e,parameters:[],expression:r.body,scope:r.scope}]:r?a.some(e=>dw(e,n,i)!==0)?o():Iw(()=>[{...e,parameters:a.map((e,t)=>[r.params[t].name.replace(/#\d+$/,``),$(e,ww(i,n))]),expression:t,scope:n}],o):[{...e,parameters:[],expression:t,scope:n}]},Rw=(e,t,n,r,i)=>{let a=()=>({name:n?.name??yw,location:e.location,parameters:Fw(n,t),expression:e,scope:t});if(Sy.has(e.kind))throw v(new w(`${l}The next state relation is not a boolean expression.\n${Jb(e)}`),b.error);switch(e.kind){case`Let`:return Rw(e.body,mw(e,t,r),n,r,i);case`Label`:return Rw(e.body,t,n,r,i);case`Selection`:return e.location.range===void 0?Rw(e.expression,t,n,r,i):[a()];case`Or`:return e.operands.flatMap(e=>Rw(e,t,n,r,i));case`Exists`:return Iw(()=>{let o=[];return Ox(e.bounds,ww(r,t),t=>(o.push(...Rw(e.body,t,n,r,i)),!1)),o.length===0?[a()]:o},()=>[a()])}let o=M(e)?void 0:i.get(Tw(e)??``),s=Dw(e,t,r);if(o)return Lw(o,e,t,s,r);if(!s)return[a()];let c=Ew(e),u=M(e)?s.name===`$subexpression`?`LAMBDA`:s.name:r.instanceNames.get(Tw(e)??``)??s.name,d=()=>[{name:u,location:e.location,parameters:[],expression:e,scope:t}];return jw(s,r)||c.some(e=>dw(e,t,r)!==0)?d():Iw(()=>{let e=c.reduce((e,n,i)=>({name:s.params[i].name,binding:{kind:`Value`,value:$(n,ww(r,t))},parent:e}),s.scope);return Rw(s.body,e,{...s,name:u},r,i)},d)},zw=(e,t,n,r,i,a=[])=>{let o=(e,t,o=a)=>zw(e,t,n,r,i,o),s=(e,t,n)=>Cw(e,wp(t,a),n),c=Nw(e,t,n);if(c){o(c.expression,c.scope);return}let l=Dw(e,t,n);if(l&&jw(l,n))return;let u=l?[...a,...Cp.get(l.body)??[]]:a;if(l&&l.params.length===0){if(dw(l.body,l.scope,n)===1){r.inits.push(s(l.name,l.body,l.scope));return}o(l.body,l.scope,u);return}if(l&&e.kind===`Apply`&&l.params.length===e.args.length){o(l.body,lS(l,e.args,ww(n,t)),u);return}if(e.kind===`And`){e.operands.forEach(e=>o(e,t));return}if(e.kind===`Always`){if(e.expression.kind===`BoxAction`){i.push({expression:e.expression.action,scope:t,frames:a});return}r.temporals.push(s(yw,e,t));return}let d=dw(e,t,n);d<=1?r.inits.push(s(yw,e,t)):d===3&&r.temporals.push(s(yw,e,t))},Bw=(e,t,n,r,i)=>{let a=(t,n)=>Bw(e,t,n,r,i),o=Nw(t,n,r);if(o){a(o.expression,o.scope);return}let s=Dw(t,n,r);if(s&&jw(s,r))return;if(s&&s.params.length===Ew(t).length){a(s.body,Pw(s,t,n,r));return}if(t.kind===`Forall`&&Iw(()=>(Ox(t.bounds,ww(r,n),e=>(a(t.body,e),!1)),!0),()=>!1))return;if(t.kind===`And`){t.operands.forEach(e=>a(e,n));return}if(t.kind===`Always`){let a=t.expression;a.kind===`BoxAction`?i.impliedActions.push(Cw(e,a)):dw(a,n,r)<2?i.invariants.push(Cw(e,a)):i.impliedTemporals.push(Cw(e,t));return}let c=dw(t,n,r);c<=1?i.impliedInits.push(Cw(e,t)):c===3&&i.impliedTemporals.push(Cw(e,t))},Vw=(e,t)=>{let n=gx(e,t);return n?.kind===`Operator`&&!Aw(n,t)?n:void 0},Hw=(e,t,n)=>{let r={inits:[],actions:[],temporals:[]},i=[],a=e.specification===void 0?void 0:Vw(e.specification,t);a&&(zw(a.body,void 0,t,r,i),i.forEach(e=>r.actions.push(...e.frames.length>0?[{name:yw,location:e.frames[0].location,parameters:[],expression:wp(e.expression,e.frames),scope:e.scope}]:Rw(e.expression,e.scope,void 0,t,n))));let o=e.init===void 0?void 0:Xx(e.init,t);o?.kind===`Closure`&&r.inits.push(Cw(e.init??``,o.body));let s=e.next===void 0?void 0:Xx(e.next,t);return s?.kind===`Closure`&&r.actions.push(...Rw(s.body,s.scope,s,t,n)),r},Uw=(e,t,n)=>{let r=[],i=(e,t)=>{if(e.kind===`Number`||e.kind===`Decimal`||e.kind===`String`)return!1;if(e.kind===`Tuple`)return e.elements.every(e=>i(e,t));if(e.kind===`Label`)return i(e.body,t);if(e.kind===`Selection`)return i(e.expression,t);let a=Nw(e,t,n);if(a)return i(a.expression,a.scope);let o=e.kind===`Identifier`&&M(e)?ax(t,e.name):void 0;if(o?.kind===`Value`&&o.argument)return i(o.argument,t);if(e.kind===`Identifier`&&!M(e)&&n.variableIndex.has(e.name))return r.push(e.name),!0;let s=Dw(e,t,n);if(!s||s.params.length!==Ew(e).length)return!0;let c=gx(s.name,n);return c?.body===s.body&&kw(c,n)?!0:i(s.body,Pw(s,e,t,n))};return i(e,t)?r:void 0},Ww=e=>e.parameters.length===0?``:`(${e.parameters.map(e=>q(e[1])).join(`,`)})`,Gw=(e,t,n=!1)=>`${e.name===yw?n?`Initial predicate`:`Action`:e.name}${t===`1.7.4`?``:Ww(e)} ${m(e.location.range??bw)}`,Kw=e=>`${e.name}${Ww(e)}`,qw=(e,t,n,r)=>{let i={invariants:[],impliedInits:[],impliedActions:[],impliedTemporals:[]};t.invariants.forEach(e=>{let t=Vw(e,n);t&&i.invariants.push(Cw(e,t.body))}),t.properties.forEach(e=>{let t=Vw(e,n);t&&Bw(e,t.body,void 0,n,i)});let a=n.coverage,o=(e,t)=>_l(e.map(e=>{let n=a&&t&&qf(a,t,e.expression);return Sw(e,n&&Fl(n))})),s=e=>_l(e.flatMap(e=>{let t=Vw(e,n);return t?[Fl([[`name`,t.name],[`location`,xw(t.location)]])]:[]}));return Fl([[`inits`,o(e.inits,`init`)],[`actions`,o(e.actions,`next`)],[`temporals`,o(e.temporals)],[`invariants`,o(i.invariants,`invariant`)],[`impliedinits`,o(i.impliedInits,`implied`)],[`impliedactions`,o(i.impliedActions,`implied`)],[`impliedtemporals`,o(i.impliedTemporals)],[`variables`,_l(n.variables.map((e,t)=>Fl([[`name`,e],[`location`,xw(r[t])],...a?[[`coverage`,Fl([[`distinct`,Ff(a,t)]])]]:[]])))],[`actionconstraints`,s(t.actionConstraints)],[`constraints`,s(t.constraints)]])},Jw=2**50,Yw=2**51,Xw=(e,t,n,r)=>({fingerprint:e,tableau:t,position:n,stateChecks:r,successors:[],actionChecks:[],stepPositions:[],number:0}),Zw=(e,t,n,r)=>{e.successors.push(t),e.actionChecks.push(n),e.stepPositions.push(r)},Qw=(e,t)=>e.stepPositions[e.successors.indexOf(t)],$w=e=>{let t=e[e.length-1];return--e.length,t},eT=(e,t,n,r)=>{let i={initial:[],isPartial:!1},a=t.tableau;if(!a){let t=/* @__PURE__ */ new Map,r=Xw(e[0],-1,0,n.getStates(0));Zw(r,r,n.getStutters(0),0),t.set(e[0],r),i.initial.push(r);for(let i=1;i<e.length;i++){let a=t.get(e[i]);if(a===void 0){let a=Xw(e[i],-1,i,n.getStates(i));Zw(a,a,n.getStutters(i),i),Zw(r,a,n.getSteps(i),i),t.set(e[i],a),r=a}else r.successors.includes(a)||Zw(r,a,n.getSteps(i),i),r=a}return i}let o=/* @__PURE__ */ new Map,s=e=>{let t=o.get(e)??[];return o.set(e,t),t},c=(t,o,s,c,l,u)=>{for(let d=0;d<t.length;d++){let f=t[d],p=a.nodes[f.tableau].successors;for(let t=0;t<p.length;t++){let a=p[t],d=s[a];if(d===void 0){if(!n.isConsistent(a,c))continue;let t=Xw(e[c],a,c,l);Zw(f,t,u,c),o.push(t),s[a]=t}else f.successors.includes(d)||Zw(f,d,u,c),d.position!==c&&(i.isPartial=!0,r&&!o.includes(d)&&o.push(d))}}},l=s(e[0]),u=n.getStates(0),d=n.getStutters(0);for(let t=0;t<a.initialCount;t++){if(!n.isConsistent(t,0))continue;let r=Xw(e[0],t,0,u);i.initial.push(r),l[t]=r}for(let e of i.initial)for(let t of a.nodes[e.tableau].successors){let n=l[t];n?Zw(e,n,d,0):i.isPartial=!0}let f=[...i.initial];r&&c(f,f,l,0,u,d);for(let t=1;t<e.length;t++){let r=s(e[t]),i=n.getStates(t),a=[];c(f,a,r,t,i,n.getSteps(t)),c(a,a,r,t,i,n.getStutters(t)),f=a}return i},tT=(e,t,n)=>{let r=t.promises,i=t.tableau?.nodes??[],a=[],o=1,s=Jw+1,c=Yw+1,l=s,u=c,d=s,f=c,p=t.models[0],m,h=(e,t)=>{let n=e.actionChecks[t],r=p.eventuallyAlways;for(let e=0;e<r.length;e++)if(!n[r[e]])return!1;return!0},g=t=>{let n=[],a=c-1,o=p.infinitelyOftenStates,s=p.infinitelyOftenActions,l=o.map(()=>!1),u=s.map(()=>!1),d=r.map(()=>!1),f=o.length+s.length+r.length,m=t;for(;f>0;){m.number=c;let e=f;search:for(;;){for(let e=0;e<o.length;e++)!l[e]&&m.stateChecks[o[e]]&&(l[e]=!0,f--);for(let e=0;e<r.length;e++)!d[e]&&tw(i[m.tableau].particle,r[e])&&(d[e]=!0,f--);if(f<=0)break;let t,p,h=f;for(let e=0;e<m.successors.length;e++){let r=m.successors[e],i=r.number;if(a<=i&&i<=c){t=r;for(let t=0;t<s.length;t++)!u[t]&&m.actionChecks[e][s[t]]&&(u[t]=!0,f--)}if(f<h){n.push(m),m=r,c++;break search}a<=i&&i<c&&(p=r)}if(f<e&&t){n.push(m),m=t,c++;break}for(;p===void 0;){m=$w(n);for(let e=0;e<m.successors.length;e++){let t=m.successors[e];if(a<=t.number&&t.number<c){n.push(m),p=t;break}}}n.push(m),m=p,m.number=c}}c++,m.number=c;close:for(;m!==t;){let e=!1;for(let r=0;r<m.successors.length;r++){let i=m.successors[r];if(a<=i.number&&i.number<c){if(n.push(m),i===t)break close;e=!0,m=i,m.number=c;break}}e||(m=$w(n))}n.length===0&&n.push(m);let h=[];for(let n=0;n<=t.position;n++)(n===0||e[n]!==e[n-1])&&h.push(n);let g=h.length;for(let e=1;e<n.length;e++)n[e].fingerprint!==n[e-1].fingerprint&&h.push(Qw(n[e-1],n[e]));let _=n[n.length-1];return{positions:h,cyclePosition:g,backPosition:_.fingerprint===t.fingerprint?void 0:Qw(_,t)}},_=e=>{let t=p.infinitelyOftenStates,n=p.infinitelyOftenActions,a=t.map(()=>!1),o=n.map(()=>!1),s=r.map(()=>!1),l=[e];for(e.number++;l.length>0;){let e=$w(l);for(let n=0;n<t.length;n++)a[n]||(a[n]=e.stateChecks[t[n]]);for(let t=0;t<e.successors.length;t++){let r=e.successors[t],i=r.number;if(i>=c)for(let r=0;r<n.length;r++)o[r]||(o[r]=e.actionChecks[t][n[r]]);i===c&&(r.number++,l.push(r))}for(let t=0;t<r.length;t++)tw(i[e.tableau].particle,r[t])&&(s[t]=!0)}c+=2,m!==void 0||a.includes(!1)||o.includes(!1)||s.includes(!1)||(m=g(e))},v=e=>{let t=e.successors.indexOf(e);return t!==-1&&d<=e.number&&h(e,t)},y=e=>{let t=$w(a);if(t===e&&!v(e))return e.number=c++,!1;for(t.number=c;t!==e;)t=$w(a),t.number=c;return!0},ee=e=>{let t=s++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number;d<=i&&h(e,n)&&((i<l||f<=i&&i<u)&&(i=ee(r)),i<t&&(t=i))}return t===e.number&&y(e)&&_(e),t},b=e=>{let t=$w(a);if(t===e&&!e.successors.includes(e)){e.number=Jw;return}let n=[];for(d=s++,f=c,t.number=d,n.push(t);t!==e;)t=$w(a),t.number=d,n.push(t);return n},x=e=>{let n=b(e);if(n)for(let e of t.models){p=e,l=s,u=c;for(let e=n.length-1;e>=0;e--)n[e].number<u&&ee(n[e])}},te=e=>{let t=o++;e.number=t,a.push(e);for(let n=0;n<e.successors.length;n++){let r=e.successors[n],i=r.number===0?te(r):r.number;i<t&&(t=i)}return t===e.number&&x(e),t};for(let e of n)if(e.number===0&&te(e),m)return m},nT=(e,t,n,r,i)=>{let a=/* @__PURE__ */ new Map,o=(t,n,i)=>(a.clear(),_w(t,e[n],i===void 0?void 0:e[i],r,a)),s=e.map((e,t)=>t),c=e.map((e,t)=>t);if(i){let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map;for(let i=0;i<e.length;i++){let a=n.get(t[i])??i;if(n.set(t[i],a),fC(e[a],e[i])&&(s[i]=a),i===0)continue;let o=s[i-1]*e.length+s[i];c[i]=r.get(o)??i,r.set(o,c[i])}}let l=n.map(e=>{let t=[],n=[],r=[],a=[],l=e.tableau?.nodes.map(e=>e.statePredicates)??[];return{getStates:n=>{let r=s[n];return t[r]??=e.stateChecks.map(e=>o(e,r,void 0))},getSteps:t=>{let r=c[t];return n[r]??=e.actionChecks.map(e=>o(e,r-1,r))},getStutters:t=>{let n=s[t];return r[n]??=e.actionChecks.map(e=>o(e,n,n))},isConsistent:(e,t)=>{let n=s[t],r=a[n]??=[],c=i?r[e]:void 0;return c===void 0?(r[e]=l[e].every(e=>o(e,n,void 0)),r[e]):c}}}),u=[];for(let e=0;e<n.length;e++){let r=eT(t,n[e],l[e],!1),i=tT(t,n[e],r.initial);if(i)return i;r.isPartial&&u.push(e)}for(let e of u){let r=eT(t,n[e],l[e],!0),i=tT(t,n[e],r.initial);if(i)return i}},rT=e=>{switch(e.kind){case`Always`:return!0;case`Eventually`:case`Not`:case`Next`:return rT(e.body);case`And`:case`Or`:return e.operands.some(rT);default:return!1}},iT=e=>e.eventuallyAlways.length===0&&e.infinitelyOftenStates.length===0&&e.infinitelyOftenActions.length===0,aT=e=>e.promises.some(e=>rT(e.body))||e.models.some(e=>!iT(e)),oT=(e,t)=>e.every((e,n)=>Vc(e,t[n])),sT=e=>e.filter((t,n)=>n===0||e[n-1]!==t),cT=e=>({data:e(1024),length:0,create:e}),lT=(e,t,n,r=0,i=n.length-r)=>{let a=t+i;if(a>e.data.length){let t=e.create(Math.max(2*e.data.length,a));t.set(e.data),e.data=t}for(let a=0;a<i;a++)e.data[t+a]=n[r+a];e.length=Math.max(e.length,a)},uT=(e,t,n)=>{let r=e.slots.length/3-1,i=Math.imul(Math.imul(t,2654435761)^n,2246822507)>>>e.shift;for(let a=i;;a=a+1&r){let r=a*3,i=e.slots[r];if(i===0||i===t+1&&e.slots[r+1]===n)return r}},dT=e=>new Int32Array(e).fill(-1),fT=(e,t)=>(e.edgeStarts[t]??-1)!==-1,pT=(e,t)=>{let n=e.edgeStarts[t];return e.edgeTargets.data.subarray(n,n+e.edgeCounts[t])},mT=(e,t,n)=>e.stateResults.data[e.nodeStates[t]*e.solution.stateChecks.length+n]===1,hT=(e,t,n)=>(e.nodeStates.push(t),e.nodeTableaux.push(n),e.edgeStarts.push(-1),e.edgeCounts.push(0),e.nextSiblings.push(-1),e.nodeStates.length-1),gT=(e,t)=>{let n=[];for(let r=e.firstNodes.data[t]??-1;r!==-1;r=e.nextSiblings[r])n.push(r);return n},_T=2**53-1,vT=(e,t,n)=>{let r=t.map(e=>hw(e.expression,e.scope,n)),i=e.map(e=>hw(e.expression,e.scope,n)),a=i.map(e=>DC(`Not`,e)),o=a.length===1?a[0]:kC(`Or`,a);return{formula:r.length===0?o:kC(`And`,[...r,o]),checks:i}},yT=e=>{switch(e.kind){case`State`:return[e];case`Enabled`:return[{expression:e.step,scope:e.scope}];case`Action`:return[e.expression,e.subscript].flatMap(t=>t?[{expression:t,scope:e.scope}]:[])}},bT=(e,t)=>{switch(e.kind){case`Boolean`:return;case`State`:case`Enabled`:case`Action`:t.add(e);return;case`And`:case`Or`:e.operands.forEach(e=>bT(e,t));return;default:bT(e.body,t)}},xT=e=>{let t=/* @__PURE__ */ new Set;for(let n of e)[...n.stateChecks,...n.actionChecks,...n.tableau?.nodes.flatMap(e=>e.statePredicates)??[]].forEach(e=>bT(e,t));return[...t]},ST=e=>xT(e).flatMap(e=>yT(e).map(e=>e.expression)),CT=(e,t)=>{let n=/* @__PURE__ */ new Set;bT(e,n);let r=[...n].flatMap(yT);return r.every(e=>e.scope===void 0)?!Hh(r.map(e=>e.expression),t,`repeated`):!_S(t)},wT=(e,t,n,r,i,a)=>[...new Set(e.filter((e,o)=>{try{return!vw(t[o],n,r,0,i)}catch(e){if(!a||!(e instanceof w))throw e;return a.push(e),!1}}).map(e=>e.name))],TT=(e,t,n)=>{if(e.length===0)return;let r=vT(e,t,n),i=iw(r.formula),a=gw(n),o=CT(r.formula,n);return{solutions:i,findTraceViolation:(t,s)=>{let c=nT(t,s,i,a,o);if(!c)return;let l=[],u=wT(e,r.checks,c.positions.map(e=>t[e]),c.cyclePosition-1,n,l);return{...c,properties:u,failures:l}}}},ET=(e,t,n,r)=>{if(e.length===0)return;let i=vT(e,t,n),a=CT(i.formula,n),o=iw(i.formula),s={atoms:gw(n),replay:void 0},c=DT(o,{atoms:{holdsState:(e,t)=>s.atoms.holdsState(e,t),holdsAction:(e,t,n)=>s.atoms.holdsAction(e,t,n)},isShared:a,isSame:oT,evaluateFrom:(e,t)=>{n.runtime.setLivenessSource(e);try{return t()}finally{n.runtime.setLivenessSource(void 0)}}},{getFingerprint:r.getFingerprint,forEachActionSuccessors:(e,t,n)=>r.forEachActionSuccessors(e,t,n,s.replay)},n.runtime.version!==`1.7.4`),l=(e,t)=>{if(e===void 0)return t();s.atoms=gw(e),s.replay=e;try{return t()}finally{s.atoms=gw(n),s.replay=void 0}};return{branches:c.branches,solutions:o,addInitialState:(e,t,n)=>l(n,()=>c.addInitialState(e,t)),addState:(e,t,n,r)=>l(r,()=>c.addState(e,t,n,r!==void 0)),storeState:c.storeState,getStateCounts:c.getStateCounts,findViolation:c.findViolation,getViolatedProperties:(t,r)=>wT(e,i.checks,t,r,n)}},DT=(e,t,n,r)=>{let i=/* @__PURE__ */ new Map,a=1,o=t.isShared,s=t.atoms,c=t.evaluateFrom,l=/* @__PURE__ */ new Map,u=[],d=e=>{let t=l.get(e)??l.size;return l.set(e,t),u[t]=e,t},f=e=>{if(e.kind===`State`||e.kind===`Enabled`)return[d(e)*2+1];if(e.kind===`Not`){let t=e.body;return t.kind===`State`||t.kind===`Enabled`?[d(t)*2]:void 0}if(e.kind!==`And`)return;let t=e.operands.map(f);return t.every(e=>e!==void 0)?t.flat():void 0},p=e=>new Int8Array(e*l.size).fill(-1),m=e=>new Int8Array(e*i.size).fill(-1),h=(e,t,n,r,i)=>o?e(t,n,r,i):e(t,p(1),0,i),g=e=>{switch(e.kind){case`Boolean`:{let t=e.value;return()=>t}case`State`:case`Enabled`:{let t=d(e);return(n,r,i)=>(r[i+t]===-1&&(r[i+t]=+!!s.holdsState(e,n)),r[i+t]===1)}case`Action`:{let t=e.enabled&&d(e.enabled);return(n,r,i,a)=>(t===void 0||r[i+t]!==0)&&a!==void 0&&s.holdsAction(e,n,a)}case`Not`:{let t=g(e.body);return(e,n,r,i)=>!t(e,n,r,i)}case`And`:{let t=e.operands.map(g);return(e,n,r,i)=>t.every(t=>t(e,n,r,i))}case`Or`:{let t=e.operands.map(g);return(e,n,r,i)=>t.some(t=>t(e,n,r,i))}case`Next`:{let t=g(e.body);return(e,n,r,i)=>t(i??e,p(1),0,void 0)}case`Always`:case`Eventually`:return()=>{throw new w(`TLC cannot evaluate a temporal formula in a single step`)}}},_=e.map(e=>({solution:e,checks:{states:e.stateChecks.map(g),actions:e.actionChecks.map(g),nodes:e.tableau?.nodes.map(e=>{let t=o?f({kind:`And`,operands:e.statePredicates}):void 0;return t?Int32Array.from(t):e.statePredicates.map(g)})??[]},actionIds:Int32Array.from(e.actionChecks,e=>{let t=PC(e),n=i.get(t)??i.size;return i.set(t,n),n}),nodeStates:[],nodeTableaux:[],edgeStarts:[],edgeCounts:[],edgeTargets:cT(e=>new Int32Array(e)),edgeActions:cT(e=>new Uint8Array(e)),stateResults:cT(e=>new Uint8Array(e)),initial:[],firstNodes:cT(dT),lastNodes:cT(dT),nextSiblings:[],nodeIds:{slots:/* @__PURE__ */ new Int32Array(3072),size:0,shift:22},isDone:[],stateCount:0,errorNode:void 0})),v=(e,t,n,r,i)=>c(t,()=>{let t=e.checks.states,a=new Uint8Array(t.length);return t.forEach((e,t)=>{a[t]=+!!h(e,n,r,i)}),a}),y=(e,t,n,r,i,a,s,l,u,d)=>c(t,()=>{let t=e.checks.actions;for(let c=0;c<t.length;c++){if(!o){u[d+c]=+!!h(t[c],n,r,i,a);continue}let f=l+e.actionIds[c];s[f]===-1&&(s[f]=+!!t[c](n,r,i,a)),u[d+c]=s[f]}}),ee=(e,t,n,r,i)=>{let a=e.checks.nodes[t];if(!(a instanceof Int32Array))return a.every(e=>h(e,n,r,i));for(let e=0;e<a.length;e++){let t=a[e],o=i+(t>>1);if(r[o]===-1&&(r[o]=+!!s.holdsState(u[t>>1],n)),r[o]!==(t&1))return!1}return!0},b=(e,t,n,r,i,a)=>c(n,()=>ee(e,t,r,i,a)),x=(e,t)=>{if(!r)return!1;let n=e.nodes[t];return n.particle.length===0&&n.successors.length===1&&n.successors[0]===t},te=(e,t,n)=>{if(!e.solution.tableau)return t;let r=e.nodeIds.slots,i=uT(e.nodeIds,t,n);return r[i]===0?void 0:r[i+2]},S=(e,t,n,r)=>{let i=e.nodeIds;if(++i.size*2>i.slots.length/3){let e=i.slots;i.slots=new Int32Array(e.length*2),i.shift--;for(let t=0;t<e.length;t+=3)e[t]!==0&&i.slots.set(e.subarray(t,t+3),uT(i,e[t]-1,e[t+1]))}if(i.slots.set([t+1,n,r],uT(i,t,n)),t<0)return r;let a=e.lastNodes.data[t]??-1;return a===-1?lT(e.firstNodes,t,[r]):e.nextSiblings[a]=r,lT(e.lastNodes,t,[r]),r},C=(e,t)=>t<0?e.checks.nodes.some((n,r)=>te(e,t,r)!==void 0):e.isDone[t]===!0||(e.firstNodes.data[t]??-1)!==-1,ne=(e,t,n)=>(C(e,t)||e.stateCount++,S(e,t,n,hT(e,t,n))),re=(e,t,n,r,i,a)=>{let o=e.edgeTargets.length,s=e.solution.actionChecks.length;lT(e.edgeTargets,o,n),i.forEach((t,n)=>lT(e.edgeActions,(o+n)*s,r,t*s,s)),lT(e.stateResults,e.nodeStates[t]*a.length,a),e.edgeStarts[t]=o,e.edgeCounts[t]=n.length},T={slots:/* @__PURE__ */ new Int32Array},ie=(e,r,i)=>{let o=[...i,{index:e,state:r}],s=16*a;T.slots=T.slots.length===s?T.slots.fill(0):new Int32Array(s);let c=e=>{let r=T.slots,i=o[e];for(let a=(n.getFingerprint(i)&2147483647)%r.length;;a=(a+1)%r.length){let n=r[a];if(n===0)return r[a]=e+1,!0;let s=o[n-1];if(s.index===i.index&&t.isSame(s.state,i.state))return!1}},l=0;for(let e=0;e<o.length;e++){if(l>=T.slots.length>>1){let e=T.slots;T.slots=new Int32Array(2*e.length+1);for(let t of e)t!==0&&c(t-1)}c(e)&&l++}T.slots.length>s&&a++;let u=[];for(let e of T.slots)e!==0&&u.push(o[e-1]);return u},ae=(e,t,r,a,o,s,c)=>{let l=v(e,a,r,s,c),u=t.nodes[e.nodeTableaux[o]],d=e.checks.actions.length,f=[],h=[],g=new Uint8Array(d);u.successors.length>0&&y(e,a,r,s,c,r,m(1),0,g,0);for(let n of u.successors){if(!b(e,n,a,r,s,c))continue;if(x(t,n)&&e.errorNode===void 0&&e.solution.models.some(iT)){e.errorNode=o;return}let i=te(e,a,n);if(i!==void 0&&h.includes(i))continue;let l=i??ne(e,a,n);h.push(l),f.push(0),i===void 0&&ae(e,t,r,a,l,s,c)}let _=[g],ee=1;if(n.forEachActionSuccessors(a,r,n=>{let o=m(n.length),l=new Uint8Array(n.length*d);_.push(l);for(let m=0;m<n.length;m++){let g=n[m],_=p(1);y(e,a,r,s,c,g.state,o,m*i.size,l,m*d);let v=e.isDone[g.index]===!0;for(let n of u.successors){if(!b(e,n,a,g.state,_,0))continue;let r=te(e,g.index,n);if(r!==void 0&&h.includes(r))continue;let i=r??ne(e,g.index,n);h.push(i),f.push(ee+m),r===void 0&&v&&ae(e,t,g.state,g.index,i,_,0)}}ee+=n.length}),h.length>0){let t=new Uint8Array(ee*d);for(let e=0,n=0;e<_.length;e++)t.set(_[e],n),n+=_[e].length;re(e,o,h,t,f,l)}},oe=(e,t,n,r,i,a,o)=>{let s=l.size,u=new Uint8Array(t.nodes.length*n.length);c(o,()=>{for(let i=0;i<t.nodes.length;i++)for(let t=0;t<n.length;t++)ee(e,i,n[t].state,r,t*s)&&(u[i*n.length+t]=1)}),C(e,o)||e.stateCount++,e.isDone[o]=!0;for(let c of gT(e,o)){let o=[],l=[];n.forEach((i,a)=>{let d=e.isDone[i.index]===!0;for(let f of t.nodes[e.nodeTableaux[c]].successors){if(u[f*n.length+a]===0)continue;let c=te(e,i.index,f);if(c!==void 0&&o.includes(c))continue;let p=c??ne(e,i.index,f);o.push(p),l.push(a),c===void 0&&d&&ae(e,t,i.state,i.index,p,r,a*s)}}),re(e,c,o,i,l,a)}return e.errorNode===void 0?void 0:ce(e,e.errorNode)},se=(e,t,n,r,i)=>{for(;e.nodeStates.length<=i;)hT(e,e.nodeStates.length,-1);let a=[],o=[];t.forEach((t,n)=>{fT(e,t.index)&&a.includes(t.index)||(a.push(t.index),o.push(n))}),fT(e,i)||e.stateCount++,re(e,i,a,n,o,r)},E=(e,t)=>{if(e.initial.includes(t))return[t];let n=/* @__PURE__ */ new Map,r=[];for(let t of e.initial)fT(e,t)&&(r.push(t),n.set(t,-1));for(let i=0;i<r.length;i++){let a=r[i];for(let i of pT(e,a))if(!(i===a&&e.solution.tableau)){if(i===t){let e=[t];for(let t=a;t!==-1;t=n.get(t)??-1)e.push(t);return e}fT(e,i)&&!n.has(i)&&(n.set(i,a),r.push(i))}}throw new w(`Couldn't re-create liveness trace (path) starting at: ${t}`)},ce=(e,t)=>sT(E(e,t).reverse().map(t=>e.nodeStates[t])),D=(e,t)=>{let n=e.solution,r=n.actionChecks.length,i=(t,n,i)=>e.edgeActions.data[(e.edgeStarts[t]+n)*r+i]===1,a=(e,n)=>t.eventuallyAlways.every(t=>i(e,n,t)),o=new Float64Array(e.nodeStates.length).fill(-1),s=e.initial.filter(t=>fT(e,t)),c=[],l=t=>{let n=pT(e,t).indexOf(t);return n!==-1&&a(t,n)},u=(t,r)=>n.tableau!==void 0&&tw(n.tableau.nodes[e.nodeTableaux[t]].particle,r),d=r=>{let s=c.pop()??r;if(s===r&&!l(s)){o[s]=_T;return}let d=/* @__PURE__ */ new Set,p=/* @__PURE__ */ new Map;for(let t=s;;t=c.pop()??r){d.add(t);let n=p.get(e.nodeStates[t]);if(n?n.push(t):p.set(e.nodeStates[t],[t]),o[t]=_T,t===r)break}let m=t.infinitelyOftenStates.every(t=>[...d].some(n=>mT(e,n,t))),h=t.infinitelyOftenActions.every(t=>[...d].some(n=>pT(e,n).some((e,r)=>d.has(e)&&a(n,r)&&i(n,r,t)))),g=n.promises.every(e=>[...d].some(t=>u(t,e)));if(m&&h&&g)return f(r,d,p)},f=(r,o,s)=>{let c=ce(e,r),l=[],d=/* @__PURE__ */ new Set([r]),f=t.infinitelyOftenStates.map(()=>!1),m=t.infinitelyOftenActions.map(()=>!1),h=n.promises.map(()=>!1),g=f.length+m.length+h.length,_=r,v=e=>{l.push(_),_=e};for(;g>0;){let r=g;for(;t.infinitelyOftenStates.forEach((t,n)=>{!f[n]&&mT(e,_,t)&&(f[n]=!0,g--)}),n.promises.forEach((e,t)=>{!h[t]&&u(_,e)&&(h[t]=!0,g--)}),!(g<=0);){let n=-1,c=-1,u=g;if(pT(e,_).some((r,l)=>{if(s.has(e.nodeStates[r])){if(!o.has(r)||!a(_,l))return!1;n=r,t.infinitelyOftenActions.forEach((e,t)=>{!m[t]&&i(_,l,e)&&(m[t]=!0,g--)})}return g<u?(v(r),d.clear(),!0):(o.has(r)&&!d.has(r)&&(c=r),!1)}))break;if(g<r){v(n),d.clear();break}for(;c===-1;){let t=l.pop();if(t===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);_=t,c=pT(e,t).find(e=>o.has(e)&&!d.has(e))??-1}v(c),d.add(c)}}let y=p(r,_,s);for(let t=l.length-1;t>=0;t--){let n=e.nodeStates[l[t]];y[y.length-1]!==n&&y.push(n)}let ee=c[c.length-1];return y[y.length-1]===ee&&y.pop(),{prefix:c.slice(0,-1),cycle:[ee,...y.reverse()],isCycleConstrained:aT(n)}},p=(t,n,r)=>{if(n===t)return[];let i=e.nodeStates[n],o=/* @__PURE__ */ new Map,s=/* @__PURE__ */ new Set([i]),c=[];for(let n=i,l=-1,u=0;;u++){for(let u of r.get(n)??[])for(let[d,f]of pT(e,u).entries()){if(f===u||!a(u,d))continue;if(f===t){let e=[];for(let t=n,r=l;t!==i;)e.push(t),t=r,r=o.get(t)??-1;return e.push(i),e}let p=e.nodeStates[f];r.has(p)&&!s.has(p)&&(s.add(p),c.push([p,n]))}o.set(n,l);let d=c[u];if(d===void 0)throw new w(`TLC failed to build the counterexample of a liveness property`);n=d[0],l=d[1]}};for(let t=0;t<s.length;t++){let n=[s[t],-1,0],r=0;for(;n.length>=3;){let t=n.pop()??0,i=n.pop(),l=n.pop()??0;if(i===-42){if(o[l]===t){let e=d(l);if(e)return e}n.push(Math.min(n.pop()??t,t));continue}if(o[l]!==-1){n.push(Math.min(t,o[l]));continue}o[l]=r,n.push(t,l,-42),c.push(l);let u=r++;pT(e,l).forEach((t,r)=>{fT(e,t)&&(a(l,r)?o[t]===-1?n.push(t,-1):u=Math.min(u,o[t]):o[t]===-1&&s.push(t))}),n.push(u)}}};return{branches:_.length,addInitialState:(e,t)=>{let n=p(1);for(let r of _){let i=r.solution.tableau;if(!i)r.initial.push(e);else for(let a=0;a<i.initialCount;a++)b(r,a,void 0,t,n,0)&&r.initial.push(te(r,e,a)??ne(r,e,a))}},addState:(e,t,n,r)=>{let a=ie(e,t,n),o=p(a.length),s=a.findIndex(t=>t.index===e)*l.size,c=m(a.length);for(let n of _){let l=n.checks.actions.length,u=new Uint8Array(a.length*l);a.forEach((r,a)=>y(n,e,t,o,s,r.state,c,a*i.size,u,a*l));let d=v(n,e,t,o,s),f=n.solution.tableau;if(r&&(f?gT(n,e).some(e=>n.edgeCounts[e]>0):a.every(e=>fT(n,e.index))))throw new w(`The behavior graph holds every edge of the state already.`);if(!f){se(n,a,u,d,e);continue}let p=oe(n,f,a,o,u,d,e);if(p)return p}},storeState:(e,t)=>{for(let n of _){let r=n.solution.tableau;if(!r)continue;let i=[];for(let t=0;t<r.nodes.length;t++){let r=te(n,e,t);r!==void 0&&i.push(r)}for(let e of i.sort((e,t)=>e-t))n.nodeStates[e]=t,S(n,t,n.nodeTableaux[e],e)}},getStateCounts:()=>_.map(e=>e.stateCount),findViolation:()=>{for(let e of _)for(let t of e.solution.models){let n=D(e,t);if(n)return n}}}},OT=e=>{switch(e.kind){case`Number`:if(!Rs(e.value))throw v(new t(`TLC can't handle a number this big.\n${e.value}`),b.error);return e.value;case`String`:case`Boolean`:return e.value;case`ModelValue`:return wc(e.name);case`Set`:return G({kind:`MixedSet`,elements:e.elements.map(OT)})}},kT=e=>{try{return OT(e)}catch(e){throw!(e instanceof w)||e instanceof t||e instanceof f?e:v(new w(`${l}${e.message}`),b.error)}},AT=(e,t,n)=>{let r=`{ ${n.map(e=>`<${[...e[0],e[1]].map(e=>q(e)).join(`, `)}>`).join(`, `)}}`;return{kind:`Builtin`,name:e,arity:t,evaluate:e=>{let t=n.find(t=>{if(t[0].length!==e.length)throw new w(`Attempted to apply the operator ${r}\nwith wrong number of arguments.`);return t[0].every((t,n)=>{let r=e[n];return(typeof r!=`object`||r.kind!==`Operator`)&&zc(t,r)})});if(t)return t[1];throw new w(`Attempted to apply operator:\n${r}\nto arguments (${e.map(e=>typeof e==`object`&&e.kind===`Operator`?e.name:q(e)).join(`, `)}), which is undefined.`)},evaluateUnary:void 0,evaluateBinary:void 0}},jT=e=>new C(`In the configuration file, the identifier ${e} appears\non the right-hand side of a <- after already appearing on the\nleft-hand side of one.`),MT=(e,t)=>{let n=e=>t.root.visible.get(e)?.key??e,r=t.root.constants.map(e=>e.name),i=t.root.variables,a=e=>{let n=t.moduleSymbols.get(e.module??``)?.get(e.name);return n?.kind===`Definition`?n:void 0},o=e=>{if(e.module===void 0)return[e.name,n(e.name)];let t=a(e);return t?[t.key]:[]},s=e=>e.module===t.root.module.name?[]:o(e),c=e=>{let n=t.definitions.get(e);return n?.kind===`Operator`?n.params.length:t.root.constants.find(t=>t.name===e)?.arity??t.builtins.get(e)?.arity??0},l=/* @__PURE__ */ new Map,u=/* @__PURE__ */ new Set,d=(e,n)=>{t.builtins.set(e,n),t.definitions.delete(e),l.delete(e),u.add(e)};e.constants.filter(e=>e.args===void 0).forEach(e=>{let t=kT(e.value);fl(t),s(e).forEach(e=>{let n=c(e);n===0?l.set(e,t):d(e,{kind:`Builtin`,name:e,arity:n,evaluate:()=>t,evaluateUnary:void 0,evaluateBinary:void 0,isLazy:!0})})});let f=/* @__PURE__ */ new Map;e.constants.forEach(e=>{if(e.args===void 0)return;let t=`${e.module??``}!${e.name}`,n=f.get(t)??{name:e.name,module:e.module,rows:[]};if(n.rows.length>0&&n.rows[0][0].length!==e.args.length)throw new C(`The arity of the operator ${e.name} is inconsistent in the configuration file.`);n.rows.push([e.args.map(OT),OT(e.value)]),f.set(t,n)}),f.forEach(e=>s(e).forEach(t=>d(t,AT(e.name,c(t),e.rows))));let p=new Map(e.substitutions.flatMap(e=>o(e).map(t=>[t,n(e.target)])));[...p.keys()].forEach(e=>l.delete(e));let m=(e,a,o)=>{let s=n(a),c=t.definitions.get(s);if(!(c!==void 0||t.builtins.has(s)||l.has(s)||r.includes(a)||i.includes(a)))throw new C(`The configuration file substitutes for ${e} with the undefined identifier ${a}.`);if(c?.kind===`Operator`&&c.params.length!==o)throw new C(`The configuration file substitutes for ${e} with ${a} of different number of arguments.`)};e.substitutions.filter(e=>e.module===void 0).forEach(n=>{let i=n.name,a=n.target;if(!r.includes(i)&&!t.root.visible.has(i))throw new C(`In the configuration file, the identifier ${i} does not appear in the specification.`);if(e.substitutions.some(e=>e.name===a))throw jT(a);m(i,a,t.root.constants.find(e=>e.name===i)?.arity??t.root.visible.get(i)?.arity)});let h=e.substitutions.filter(e=>e.module!==void 0);[...t.moduleSymbols.keys()].forEach(e=>{let t=h.filter(t=>t.module===e);t.forEach(e=>{let n=a(e);if(n){if(t.some(t=>t.name===e.target))throw jT(e.target);m(e.name,e.target,n.arity)}});let n=t.find(e=>!a(e));if(n)throw new C(`In the configuration file, the identifier ${n.name} does not appear in the specification.`)});let g=h.find(e=>!t.moduleSymbols.has(e.module??``));if(g)throw new C(`In the configuration file, the module name ${g.module} is not a module in the specification.`);let _=new Set([...e.constants,...e.substitutions].filter(e=>e.module!==void 0).flatMap(s)),v=(e,n)=>{if(_.has(e))return{key:e,prefix:n};let r=t.copySources.get(e);return r&&v(r.source,n+r.prefix)};t.copySources.forEach((e,n)=>{let r=v(e.source,e.prefix),i=t.definitions.get(n);if(!r||!i)return;let a=i.kind===`Operator`?i.params:[],o=em(n,r.key,a,a.slice(r.prefix),i.location);t.definitions.set(n,o),t.root.visible.forEach((e,r)=>{e.key===n&&r!==n&&t.definitions.set(r,o)})}),t.operatorConstants.forEach((e,t)=>l.set(t,e));let y=r.filter(e=>!l.has(e)&&!p.has(e)&&!u.has(e));if(y.length>0){let e=t.order.getDeclarationOrder(`constant`).find(e=>y.includes(e))??y[0];throw new C(`The constant parameter ${e} is not assigned a value by the configuration file.`)}return{constants:l,substitutions:p}},NT=`tlc2/value/impl/`,PT={utf8:1,integer:3,float:4,long:5,double:6,class:7,string:8,methodHandle:15,methodType:16,module:19,package:20},FT={iconstM1:2,iconst0:3,iconst5:8,bipush:16,sipush:17,ldc:18,ldcW:19,dup:89,areturn:176,getstatic:178,invokespecial:183,invokestatic:184,new:187},IT=e=>{let t=new DataView(e.buffer,e.byteOffset,e.byteLength),n=0,r=e=>{let t=n;return n+=e,t};return{readUint8:()=>t.getUint8(r(1)),readUint16:()=>t.getUint16(r(2)),readUint32:()=>t.getUint32(r(4)),readInt32:()=>t.getInt32(r(4)),readBytes:t=>e.subarray(r(t),n)}},LT=/* @__PURE__ */ new Map([[`B`,`byte`],[`C`,`char`],[`D`,`double`],[`F`,`float`],[`I`,`int`],[`J`,`long`],[`S`,`short`],[`Z`,`boolean`],[`V`,`void`]]),RT=[[1,`public`],[4,`protected`],[2,`private`],[1024,`abstract`],[8,`static`],[16,`final`],[32,`synchronized`],[256,`native`],[2048,`strictfp`]],zT=e=>[...e.matchAll(/(\[*)(?:L([^;]*);|([BCDFIJSZV]))/g)].map(e=>`${e[2]?.replaceAll(`/`,`.`)??LT.get(e[3])}${`[]`.repeat(e[1].length)}`),BT=(e,t)=>e[e[t].first].text,VT=(e,t)=>BT(e,t).replaceAll(`/`,`.`),HT=e=>{let t=IT(e);if(t.readUint32()!==3405691582)throw new s(`A module override is not a class file`);t.readUint16(),t.readUint16();let n=[],r=t.readUint16(),i=new TextDecoder;for(let e=1;e<r;e++){let r=t.readUint8(),a={tag:r,text:``,value:0,first:0,second:0};n[e]=a,r===PT.utf8?a.text=i.decode(t.readBytes(t.readUint16())):r===PT.integer?a.value=t.readInt32():r===PT.float?t.readUint32():r===PT.long||r===PT.double?(t.readBytes(8),e++):r===PT.class||r===PT.string||r===PT.methodType||r===PT.module||r===PT.package?a.first=t.readUint16():r===PT.methodHandle?(t.readUint8(),a.first=t.readUint16()):(a.first=t.readUint16(),a.second=t.readUint16())}t.readUint16();let a=VT(n,t.readUint16());t.readUint16(),t.readBytes(t.readUint16()*2);for(let e=t.readUint16();e>0;e--){t.readBytes(6);for(let e=t.readUint16();e>0;e--)t.readUint16(),t.readBytes(t.readUint32())}let o=[];for(let e=t.readUint16();e>0;e--){let e=t.readUint16(),r=n[t.readUint16()].text,i=n[t.readUint16()].text,s=i.indexOf(`)`),c=zT(i.slice(1,s)),l=Array.from({length:t.readUint16()},()=>({name:n[t.readUint16()].text,reader:IT(t.readBytes(t.readUint32()))}));if(!(e&1&&e&8))continue;let u=l.find(e=>e.name===`Code`)?.reader;u?.readBytes(4);let d=l.find(e=>e.name===`Exceptions`)?.reader,f=d?Array.from({length:d.readUint16()},()=>VT(n,d.readUint16())):[],p=RT.filter(t=>(e&t[0])!==0).map(e=>e[1]),m=zT(i.slice(s+1))[0],h=f.length===0?``:` throws ${f.join(`,`)}`;o.push({name:r,arity:c.length,code:u?.readBytes(u.readUint32()),signature:`${p.join(` `)} ${m} ${a}.${r}(${c.join(`,`)})${h}`})}return{pool:n,methods:o}},UT=(e,t)=>{let n=e[t],r=e[n.second];return{className:BT(e,n.first),name:e[r.first].text}},WT=(e,t,n,r)=>{let i=()=>new p(`The Java override ${n}.${e.name} computes its value, which tla-ts cannot run`),a=e.code;if(!a)throw i();let o=[],s=()=>{let e=o.pop();if(e===void 0)throw i();return e},c=e=>{let n=t[e];if(n.tag===PT.integer)return n.value;if(n.tag===PT.string)return t[n.first].text;throw i()};for(let e=0;e<a.length;){let n=a[e],l=()=>a[e+1]<<8|a[e+2];if(n>=FT.iconstM1&&n<=FT.iconst5)o.push(n-FT.iconst0),e+=1;else if(n===FT.bipush)o.push(a[e+1]<<24>>24),e+=2;else if(n===FT.sipush)o.push(l()<<16>>16),e+=3;else if(n===FT.ldc)o.push(c(a[e+1])),e+=2;else if(n===FT.ldcW)o.push(c(l())),e+=3;else if(n===FT.dup){let t=s();o.push(t,t),e+=1}else if(n===FT.getstatic){let n=UT(t,l());if(n.className!==`${NT}BoolValue`||n.name!==`ValTrue`&&n.name!==`ValFalse`)throw i();o.push({kind:`Identifier`,name:n.name===`ValTrue`?`TRUE`:`FALSE`,location:r}),e+=3}else if(n===FT.invokestatic){let n=UT(t,l()),a=s();if(n.className!==`${NT}IntValue`||n.name!==`gen`||typeof a!=`number`)throw i();o.push({kind:`Number`,value:a,location:r}),e+=3}else if(n===FT.new)o.push({className:BT(t,l()),value:void 0}),e+=3;else if(n===FT.invokespecial){let n=UT(t,l()),a=s(),o=s();if(!(n.className===`${NT}StringValue`&&n.name===`<init>`&&typeof a==`string`&&typeof o==`object`&&`className`in o))throw i();o.value={kind:`String`,value:a,location:r},e+=3}else if(n===FT.areturn){let e=s();if(typeof e!=`object`)throw i();if(`className`in e){if(!e.value)throw i();return e.value}return e}else throw i()}throw i()},GT=(e,t,n)=>{if(!t)return{module:e,overrides:[]};let r=HT(t),i=new Map(e.definitions.filter(e=>n||!e.isLocal).map(e=>[e.name,e.kind===`Operator`?e.params.length:0])),a=e=>i.get(e.name)===e.arity,o=e.definitions.map(t=>{if(t.kind!==`Operator`)return t;let n=r.methods.find(e=>e.name===t.name&&a(e));return n?{...t,body:WT(n,r.pool,e.name,t.location)}:t});return{module:{...e,definitions:o},overrides:r.methods.map(t=>({module:e.name,operator:t.name,signature:t.signature,isMatched:a(t)}))}},KT=/* @__PURE__ */ new WeakMap,qT=(e,t)=>{let n=Ap(e,t),r=KT.get(e);return r!==void 0&&KT.set(n,r),n},JT=(e,t)=>e.forEach(e=>{let n=t.find(t=>t.isRecursive&&t.name===e.name);n&&KT.set(n,e.arity)}),YT=e=>{switch(e.kind){case`Name`:return e.name;case`Operand`:return typeof e.operand==`number`?`argument selector ${e.operand}`:e.operand;case`Bound`:return`!(...)`;case`At`:return`@`;case`Colon`:return`:`}},XT=(e,t,n)=>({operator:e,range:t,args:n,params:n.map(()=>0)}),ZT=(e,t)=>new s(`${e} at line ${t.line}, column ${t.column}`),QT=(e,t,n,r)=>{if(e.kind===`Label`)return e.name===t?{label:e,lets:n,applications:r}:void 0;if(e.kind===`Let`)return QT(e.body,t,[...n,e.definitions],r);if(e.kind===`Lambda`||e.kind===`Selection`)return;let i=Xi.get(e),a=e.kind===`Apply`&&i===void 0||e.kind===`FunctionApplication`?[...r,e]:r;for(let o of gt(e).slice(0,i)){let i=e.kind===`FunctionApplication`&&o===e.function,s=QT(o,t,n,i?r:a);if(s)return s}},$T=e=>({line:e.line,column:e.column}),eE=(e,t,n)=>t.reduceRight((e,t)=>({kind:`Let`,definitions:t,body:e,location:$T(n)}),e),tE=(e,t)=>{let n=e.location;if(e.params.length===0)return t;if(e.args.length===0){if(e.params.some(e=>e.arity>0))throw ZT(`Selected an operator with operator parameters as an argument`,n);return{kind:`Lambda`,params:e.params.map(e=>e.name),body:t,location:n}}if(e.args.length!==e.params.length)throw ZT(`The subexpression requires ${e.params.length} arguments but received ${e.args.length}`,n);return{kind:`Let`,definitions:[{kind:`Operator`,name:Ui,params:e.params,body:t,isLocal:!0,isRecursive:!1,location:n}],body:{kind:`Apply`,operator:Ui,args:e.args,location:n,resolution:Hi},location:$T(n)}},nE=(e,t)=>{let n=t.location,r=e.kind===`Operator`?e.params.map((e,n)=>({name:`${e.name}$${t.params.length+n}`,arity:e.arity})):[],i=r.map(e=>({kind:`Identifier`,name:e.name,location:n,resolution:Hi})),a=i.length===0?{kind:`Identifier`,name:e.name,location:n,resolution:Hi}:{kind:`Apply`,operator:e.name,args:i,location:n,resolution:Hi};return tE({...t,params:[...t.params,...r]},eE(a,t.lets,n))},rE=(e,t,n,r)=>{let i=n.location,a={params:[],args:[],lets:[],location:i},o=0,s=-1,c,l,u=!1,d=0,f=[],p=[],h,g=(e,t)=>{!h&&e&&(h={location:m(e),message:t})},_=(e,t,r=!1)=>{let i=n.selectorRanges?.[o];e&&i&&f.push({node:e,error:{location:m(i),message:t},isEmpty:r,applications:[...p]})},v=(e,t)=>{if(!e)throw ZT(t,i);Gi.set(n,{applications:p,nulls:f,error:{location:m(e),message:t}}),Xi.set(n,d),u=!0},y=r=>{let i=n.selectorRanges?.[o],a=[],s=[];for(;o<e.length;){let n=e[o];if(n.kind!==`Name`&&!r)return;if(n.kind===`Name`){a.push(n.name),s.push(...n.args);let e=a.join(`!`),i=r?r.find(t=>Op(t)===e):t(e);if(i)return{definition:i,name:e,args:s,earlier:s.length-n.args.length}}o++}let c=n.selectorRanges?.[e.findLastIndex(e=>e.kind===`Name`)];return v(i&&c&&{...i,end:c.end},`Unknown operator: \`${a.join(`!`)}'.`)},ee=t=>{let l=y(t);if(!l){u=!0;return}let f=l.definition,m=KT.get(f)??sa(f),h=o===e.length-1;if(l.args.length!==m){let e=n.argumentRanges?.[o]??i.range,t=`The operator ${xt(l.name)} requires ${m-l.earlier} arguments.`;if(!r||l.args.length!==0)return d+=l.earlier,v(e,t);g(e,t)}if(d+=l.args.length,l.args.forEach((e,t)=>Ji.set(e,{operator:l.name,index:t,range:n.selectorRanges?.[o]})),h)return{definition:f,args:l.args};let _=f.location.range,ee=KT.has(f)&&_?.module===i.range?.module&&aa(i,f.location);if(p.push({operator:l.name,range:n.selectorRanges?.[o],args:l.args,params:ee?Array(m).fill(0):ca(f)}),f.isRecursive&&_&&_.module===i.range?.module&&aa(i,_.end))return v(n.selectorRanges?.[o],`Subexpression of \`${l.name}' used inside the operator's definition.`);if(f.kind!==`Operator`)throw ZT(`Cannot select a subexpression of ${f.name}`,i);a.params.push(...f.params),a.args.push(...l.args),c=f.body,s=o,o++},b=()=>{for(;o<e.length&&!u;){let t=e[o];if(t.kind!==`Name`)return;let i=n.selectorRanges?.[o],s=c&&QT(c,t.name,[],[]),l=`Cannot find label \`${t.name}'.`;if(!s)return v(i,l);s.applications.forEach(e=>_(e,l,!0));let u=s.label.params;if(t.args.length!==u.length){let e=`Label \`${t.name}' used with wrong number of arguments.`;if(!r)return v(i,e);g(i,e)}d+=t.args.length,a.lets.push(...s.lets),a.params.push(...u.map(e=>({name:e,arity:0}))),a.args.push(...t.args),p.push(XT(t.name,i,t.args)),c=s.label.body,o++}},x=t=>{if(!c)throw ZT(`Subexpression selection failed`,i);if(t.kind===`Colon`)return;let r=n.selectorRanges?.[o],s=`Choosing operand \`${YT(t)}' of subexpression with no operands.`;if(Gi.has(c)){v(r,s);return}if(Wi.has(c)&&c.kind!==`Lambda`&&c!==l&&(_(c,s,!0),l=c,c=c.kind===`Let`&&c.body.kind===`Apply`&&c.body.operator===`$subexpression`?c.body:c.kind===`Selection`?c:{kind:`Tuple`,elements:[c],location:c.location}),c.kind===`Label`){c=c.body,x(t);return}let u=`Nonexistent operand specified by \`${YT(t)}'.`;if(c.kind===`Let`){if(t.kind!==`Operand`||Pa(t.operand,1)!==0){v(r,`A LET/IN expression has only one operand.`);return}a.lets.push(c.definitions),c=c.body;return}let f=Ra(c);if(f&&(t.kind===`Bound`||t.kind===`At`)){if(t.kind===`Bound`&&t.args.length!==f.names.length){v(r,`Selector with ${t.args.length} argument(s) used for quantifier with ${f.names.length} bound identifier(s).`);return}a.params.push(...f.names.map(e=>({name:e,arity:0}))),t.kind===`Bound`&&(d+=t.args.length,a.args.push(...t.args),p.push(XT(``,r,t.args))),c=Wi.has(c)&&f.body.kind===`Selection`?f.body.expression:f.body;return}if(c.kind===`Case`){let i=[...c.arms,...c.other?[{condition:void 0,body:c.other}]:[]];if(o===e.length-1){v(r,`Subexpression of CASE must have form !i!j.`);return}let a=t.kind===`Operand`?i[Pa(t.operand,i.length)]:void 0;if(!a){v(r,u);return}o++;let s=e[o],l=s.kind===`Operand`?Pa(s.operand,2):-1,d=n.selectorRanges?.[o];if(l===-1){v(d,`Second selector for CASE subexpression must specify one of two operands.`);return}let f=l===0?a.condition:a.body;if(!f){v(d,`Selecting OTHER in a CASE statement.`);return}c=f;return}if(c.kind===`Except`&&t.kind===`Operand`&&Pa(t.operand,c.updates.length+1)>0){v(r,`Selecting subexpression of an EXCEPT not yet implemented.`);return}let m=f?f.sets:za(c);if(!m&&c.kind!==`Identifier`){v(r,`Selecting subexpression of expression that has none.`);return}if(t.kind!==`Operand`){v(r,u);return}let h=m?.[Pa(t.operand,m.length)];h?c=h:v(r,u)},te=ee(void 0);if(u)return n;if(te)return nE(te.definition,{...a,args:te.args});for(b();o<e.length&&!u;){let t=e[o];if(t.kind===`Name`){for(;c?.kind===`Label`;)c=c.body;if(c?.kind!==`Let`)return v(n.selectorRanges?.[o-1],`A name selector here must be from a LET clause.`),n;a.lets.push(c.definitions);let e=ee(c.definitions);if(u)return n;if(e)return nE(e.definition,{...a,args:[...a.args,...e.args]});b()}else{if(t.kind===`Colon`&&e[o-1].kind!==`Name`)return v(n.selectorRanges?.[o-1],`!: should not follow an operand selector.`),n;if(t.kind===`Colon`&&e[o+1]?.kind!==`Name`&&(s!==o-1||o!==e.length-1))return v(n.selectorRanges?.[o],`\`!:' can be used only after a name and either at the end after an
|
|
1793
|
+
operator name or before an operator name.`),n;t.kind!==`Colon`&&(_(c,`Subexpression selection failed, probably due to an error in the selected expression.`),_(c,`Choosing operand \`${YT(t)}' of subexpression with no operands.`,!0)),x(t),_(c,`An unexpected null node specified by '${YT(e[o])}'.\nThis is probably due to a previous error.`),o++}}if(u)return n;if(!c)throw ZT(`Subexpression selection failed`,i);let S=a.params.length,C=a.args.length;if(S!==C){let e=`Expected ${S} arguments but found ${C}.`;if(!r||C>0)return v(i.range,e),n;g(i.range,e)}let ne=eE(c,a.lets,i),w=e=>({kind:`Selection`,expression:e,location:a.params.length===0&&ne.kind!==`Lambda`?i:$T(i)}),re=tE(a,ne.kind===`Lambda`?{...ne,body:Wi.has(ne)?ne.body:w(ne.body),location:i}:w(ne));return Yi.set(re,f),h&&Ki.set(re,h),re},iE=(e,t,n,r)=>{if(!e.includes(`!`)||r(e))return;let i=e.split(`!`);if(i.some((e,t)=>r(i.slice(0,t+1).join(`!`))))return Fa(e,t,n)},aE=e=>e.kind===`Subexpression`||e.kind===`Identifier`&&e.name.includes(`!`)||e.kind===`Apply`&&e.operator.includes(`!`)||gt(e).some(aE),oE=(e,t,n,r=!1)=>{if(!aE(e))return e;if(e.kind===`Let`){e.recursive&&JT(e.recursive,e.definitions);let r=[],i=n=>r.find(e=>e.name===n)??e.definitions.find(e=>e.name===n)??t(n),a=t=>!e.definitions.some(e=>e.name===t)&&n(t);e.definitions.forEach(e=>r.push(qT(e,e=>oE(e,i,a))));let o={...e,definitions:r,body:oE(e.body,i,a)};return o.instances?{...o,instances:o.instances.map(e=>sE(e,i,a))}:o}let i=e.kind===`Apply`?t(e.operator):void 0,a=i?.kind===`Operator`?i.params:e.kind===`Apply`?dm.get(e.operator.slice(e.operator.lastIndexOf(`!`)+1))?.formals:void 0,o=e.kind===`Apply`?{...e,args:e.args.map((e,r)=>oE(e,t,n,a!==void 0&&a[r]?.arity!==0))}:jp(e,e=>oE(e,t,n)),s=gt(e),c=gt(o).every((e,t)=>e===s[t])?e:o,l=c.kind===`Subexpression`?c.selectors:c.kind===`Identifier`?iE(c.name,[],void 0,t):c.kind===`Apply`?iE(c.operator,c.args,c.argumentCounts,t):void 0,u=l?.[0],d=t=>{Xi.set(e,t),Xi.set(c,t)};if(!l)return c.kind===`Apply`&&c.operator.includes(`!`)&&!t(c.operator)&&d(0),c;let f=l.findIndex(e=>e.kind!==`Name`),p=l.slice(0,f===-1?l.length:f),m=p.some((e,n)=>n>0&&t(p.slice(0,n+1).map(YT).join(`!`)));if(u?.kind===`Name`&&n(u.name)&&!m)return c;if(u?.kind===`Name`&&l[1].kind!==`Name`&&!t(u.name))return d(0),c;let h=rE(l,t,c,r),g=Xi.get(c);g!==void 0&&d(g);let _=di.get(e);return _&&h!==c&&di.set(h,_),h!==c&&Wi.set(h,c),h},sE=(e,t,n)=>({...e,substitutions:e.substitutions.map(e=>({...e,expression:oE(e.expression,t,n,!0)}))}),cE=e=>{let t=new Map(e.map(e=>[e.name,e]));return e=>t.get(e)},lE=(e,t)=>sE(e,cE(t.definitions),()=>!1),uE=(e,t)=>{let n=new Set(e.theorems.flatMap(e=>e.name!==void 0&&e.statement.kind===`AssumeProve`?[e.name]:[])),r=e.theorems.flatMap(e=>{let t=e.statement;if(e.name===void 0||t.kind!==`AssumeProve`)return[];let n=t.assumptions.filter(e=>e.kind!==`NewSymbol`&&e.kind!==`AssumeProve`);return n.length===t.assumptions.length?[{kind:`Operator`,name:e.name,params:[],body:{kind:`Tuple`,elements:[...n,t.conclusion],location:t.location},isLocal:!0,isRecursive:!1,location:e.location}]:[]}),i=/* @__PURE__ */ new Set([...e.definitions,...r]);JT(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations:[]),e.definitions);let a=new Map(e.units.flatMap(e=>e.kind===`Recursive`?e.declarations.map(e=>[e.name,e.location]):[])),o=(e,t)=>{let n=a.get(e.name);return aa(e.location,t)||e.isRecursive&&n!==void 0&&aa(n,t)},s=/* @__PURE__ */ new Map,c=(e,t)=>n=>{let r=e(n);if(!(!r||i.has(r)&&!o(r,t)))return s.get(r)??r},l=cE([...t,...e.definitions]),u=e=>n.has(e),d=cE([...t,...e.definitions,...r]),f=(e,t)=>oE(e,c(d,t),e=>u(e)&&r.every(t=>t.name!==e)),p=e=>{let t=t=>u(t)||!e(t),n=n=>oE(n,e,t),r=e=>{let t=e.map(e=>e.kind===`ModuleFact`?e:n(e));return qi.set(t,e),t},i=n=>n.map(n=>n.kind===`ModuleFact`?n:oE(n,e,t,!0)),a=e=>e.map(e=>({...e,set:n(e.set)})),o=e=>e.kind===`AssumeProve`?{...e,assumptions:e.assumptions.map(e=>e.kind===`NewSymbol`?{...e,set:e.set&&n(e.set)}:o(e)),conclusion:n(e.conclusion)}:n(e),s=s=>{switch(s.kind){case`Use`:case`Hide`:return{...s,facts:r(s.facts),defs:i(s.defs)};case`Instance`:return sE(s,e,t);case`Define`:return{...s,definitions:s.definitions.map(r=>r.kind===`Instance`?sE(r,e,t):qT(r,n))};case`Have`:case`Case`:return{...s,expression:n(s.expression)};case`Witness`:return{...s,expressions:s.expressions.map(n)};case`Take`:return{...s,bounds:a(s.bounds)};case`Pick`:return{...s,bounds:a(s.bounds),body:n(s.body)};case`Assert`:return{...s,statement:o(s.statement)};default:return s}},c=t=>{if(t?.kind===`By`)return{...t,facts:r(t.facts),defs:i(t.defs)};if(t?.kind!==`Steps`)return t;let n={lookup:e,resolveStep:s,resolveProof:c};return{...t,steps:t.steps.map(e=>{let t={...e,body:n.resolveStep(e.body),proof:n.resolveProof(e.proof)};if(t.body.kind===`Define`){let e=t.body.definitions.flatMap(e=>e.kind===`Instance`?[]:[e]),r=n.lookup;n=p(t=>e.find(e=>e.name===t)??r(t))}return t})}};return{lookup:e,resolveFacts:r,resolveDefs:i,resolveStatement:o,resolveStep:s,resolveProof:c}},m=e.definitions.some(e=>aE(e.body))||e.assumptions.some(e=>aE(e.expression));m&&[...e.definitions,...r].toSorted((e,t)=>oa(e.location,t.location)).forEach(e=>s.set(e,qT(e,t=>f(t,e.location))));let h={...e,theorems:e.theorems.map(e=>{let t=p(c(l,e.location));return{...e,statement:e.name!==void 0&&e.statement.kind!==`AssumeProve`?e.statement:t.resolveStatement(e.statement),proof:e.proof&&p(c(l,e.proof.location)).resolveProof(e.proof)}}),uses:e.uses.map(e=>{let t=p(c(l,e.location));return{...e,facts:t.resolveFacts(e.facts),defs:t.resolveDefs(e.defs)}})};return m?{...h,definitions:e.definitions.map(e=>s.get(e)??e),assumptions:e.assumptions.map(e=>({...e,expression:f(e.expression,e.location)}))}:h},dE=(e,t)=>e.maxLevels[t]??3,fE=e=>{let t=/* @__PURE__ */ new Map,n=n=>{let r=t.get(n);if(r)return r;let i=e(n),a=yh({constants:new Set(i.constants.map(e=>e.name)),variables:new Set(i.variables),getDefinition:i.getDefinition});return t.set(n,a),a},r=/* @__PURE__ */ new Map,i=t=>{let i=r.get(t);if(i)return i;let a=e(t),o=n(t),s=a.definitions.map(e=>o.analyzeDefinition(e,/* @__PURE__ */ new Map)),c={isConstant:a.variables.length===0&&s.every(e=>e.level===0),constraints:/* @__PURE__ */ new Map,argConstraints:/* @__PURE__ */ new Map,argParams:/* @__PURE__ */ new Set};c.isConstant||a.constants.forEach(e=>bm(c.constraints,e.name,0));let l=(e,t)=>{e.constraints.forEach((e,t)=>bm(c.constraints,t,e)),e.argConstraints.forEach((e,t)=>xm(c.argConstraints,t,e)),e.argParams.forEach(e=>{let n=_m(e);t(n.operator,n.param)&&c.argParams.add(e)})};s.forEach(e=>l(e,(t,n)=>e.formals.every(e=>e.name!==t&&e.name!==n)));let u=e=>{l(e,()=>!0),a.constants.forEach(t=>{e.params.has(t.name)&&bm(c.constraints,t.name,2)})};return a.assumptions.forEach(e=>u(o.analyze(e,/* @__PURE__ */ new Map))),a.theorems.forEach(e=>e.statement.kind===`AssumeProve`?u(bh(e.statement,/* @__PURE__ */ new Map,o)):l(o.analyze(e.statement,/* @__PURE__ */ new Map),()=>!0)),r.set(t,c),c};return t=>{let r=/* @__PURE__ */ new Map,a=m(t.location.range??{module:t.instancer,start:t.location,end:t.location}),o=e=>r.set(`${a}\n${e}`,{location:a,message:e}),s=e(t.module),l=i(t.module),u=n(t.instancer),d=/* @__PURE__ */ new Map;t.lets.forEach(e=>d.set(e.name,{kind:`Let`,definition:e,scope:d}));let f=[...s.constants.map(e=>({...e,maximumLevel:0})),...s.variables.map(e=>({name:e,arity:0,maximumLevel:1}))].flatMap(e=>{let n=t.substitutions.get(e.name);if(!n)return[];if(e.arity===0){let t=u.analyze(n,d);return[{...e,level:t.level,operator:void 0,isLeibniz:!0}]}let r=u.toOperand(n,d),i=r.kind===`Operator`?r.data:void 0;return[{...e,level:r.data.level,operator:i,isLeibniz:i===void 0||i.nonLeibniz.size===0}]}),p=(e,n)=>`Level error in instantiating module '${t.module}':\nThe level of the expression or operator substituted for '${e}' \nmust be at most ${n}.`;if(f.forEach(e=>{!l.isConstant&&e.level>e.maximumLevel&&o(p(e.name,e.maximumLevel)),e.isLeibniz||o(`Error in instantiating module '${t.module}':\n A non-Leibniz operator substituted for '${e.name}'.`)}),f.forEach(e=>{let n=l.constraints.get(e.name);n!==void 0&&e.level>n&&o(p(e.name,n));let r=e.operator;if(r)for(let n=0;n<e.arity;n++){let i=l.argConstraints.get(hm(e.name,n));i!==void 0&&dE(r,n)<i&&o(`Level error in instantiating module '${t.module}':\nThe level of the argument ${n+1} of the operator ${r.name} \nmust be at least ${i}.`)}}),l.argParams.forEach(e=>{let n=_m(e),r=f.find(e=>e.name===n.operator)?.operator,i=f.find(e=>e.name===n.param);if(!r||!i)return;let a=dE(r,n.index);i.level>a&&o(`Level error when instantiating module '${t.module}':\nThe level of the argument ${n.index} of the operator ${n.operator}' \nmust be at most ${a}.`)}),r.size>0)throw c([...r.values()])}},pE=[`LAMBDA`,`$$InAssume`,`nullODN`,`nullOpArg`,`nullLabelNode`],mE=/* @__PURE__ */ new Set([`THEOREM`,`LEMMA`,`COROLLARY`,`PROPOSITION`]),hE=new Map(yt.flatMap(e=>e.map(t=>[t,e[0]]))),gE=e=>hE.get(e)??e,_E=()=>{let e=Array.from({length:11},()=>[]),t=8,n=/* @__PURE__ */ new Set,r=[],i=t=>{for(let n=e.length-1;n>=0;n--){let r=e[n];for(let e=r.length-1;e>=0;e--)t(r[e])}},a=()=>{let n=e.length*2+1,r=Array.from({length:n},()=>[]);i(e=>r[e.hash%n].push(e)),e=r,t=Math.floor(n*.75)};return{put:i=>{n.has(i.key)||(r.length>=t&&a(),e[i.hash%e.length].push(i),n.add(i.key),r.push(i))},inserted:r,ownStart:0,enumerate:()=>{let e=[];return i(t=>e.push(t)),e}}},vE=(e,t,n)=>({key:t===`module`?`module ${e}`:e,name:e,hash:bi(e)&2147483647,kind:t,isLocal:n}),yE=(e,t)=>{let n=e[t],r=e[t+1];if(n.text===`_`&&r.kind===`Operator`)return e[t+2]?.text===`_`?{name:gE(r.text),end:t+3}:{name:r.text,end:t+2};if(n.kind===`Operator`)return{name:n.text===`-`?`-.`:gE(n.text),end:t+2};if(r?.text!==`(`)return{name:n.text,end:t+1};let i=t+2;for(;i<e.length&&e[i].text!==`)`;)i++;return{name:n.text,end:i+1}},bE=(e,t)=>{let n=[];for(let r=t;;){let t=yE(e,r);if(n.push(t.name),e[t.end]?.text!==`,`)return n;r=t.end+1}},xE=e=>({line:e.line,column:e.column}),SE=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=(a,o)=>{let s={key:o,unit:t,extends:[],instances:[],inner:[],allExtends:r};for(let t=a+1;t<e.length;t++){let a=e[t];if(a.kind===`ModuleEnd`)return{references:s,end:t};if(a.kind===`Separator`&&e[t+1]?.text===`MODULE`){let r=e[t+2].text,a=i(t,`${o}/${r}`);n.set(r,a.references),s.inner.push(a.references),t=a.end}else if(e[t-1]?.text!==`.`){if(a.text===`EXTENDS`){let n=bE(e,t+1);s.extends.push(...n),n.forEach(e=>r.add(e))}else a.text===`INSTANCE`&&e[t+1]?.kind===`Identifier`&&s.instances.push(e[t+1].text)}}return{references:s,end:e.length}};return i(0,t??``).references},CE=(e,t)=>t!==void 0&&t.line===e.line&&t.column===e.column+e.text.length,wE={"\\":`\\\\`,'"':`\\"`,"\n":`\\n`," ":`\\t`,"\r":`\\r`,"\f":`\\f`},TE=e=>{let t=[];for(let n=0;n<e.length;n++){let r=e[n];r.text===`<`&&CE(r,e[n+1])&&/^(\d+|\*|\+)$/.test(e[n+1].text)&&e[n+2]?.text===`>`&&CE(e[n+1],e[n+2])?n+=CE(e[n+2],e[n+3])?3:2:(r.text!==`MODULE`||e[n-1]?.kind!==`Separator`)&&t.push(r.kind===`String`?`"${r.text.replace(/[\\"\n\t\r\f]/g,e=>wE[e])}"`:r.text)}return t},EE=e=>e[2]?.text,DE=e=>{let t=/* @__PURE__ */ new Map,n=[];return e.forEach((r,i)=>{r.kind===`Separator`&&e[i+1]?.text===`MODULE`&&n.push({name:e[i+2].text,start:i});let a=r.kind===`ModuleEnd`?n.pop():void 0;a&&!t.has(a.name)&&t.set(a.name,{start:a.start,end:i+1})}),t},OE=(e,t)=>e.find(e=>e.name===t)??e.map(e=>OE(e.modules,t)).find(Boolean),kE=e=>{let t=e===void 0?[]:tt(e),n;return{tokens:t,ranges:DE(t),getModule:()=>n??=e===void 0?gi(``):_i(e,t)}},AE=(e,t)=>{let n=/* @__PURE__ */ new Map,r=/* @__PURE__ */ new Map,i=/* @__PURE__ */ new Map,a=e=>{let t=e===void 0?void 0:i.get(e);if(t)return t;let n=kE(e);return e!==void 0&&i.set(e,n),n},o=i=>{let o=n.get(i??``);if(o)return o;let s=i===void 0?e:t?.(i)??Tt.get(i)??uv.get(i)??mi(e,i),c=a(s),l=c.tokens,u=c.ranges.get(EE(l)??``)??{start:0,end:0},d={tokens:l,...u,getModule:c.getModule};return n.set(i??``,d),c.ranges.forEach((e,t)=>{e.start===u.start||r.has(t)||r.set(t,{tokens:l,...e,getModule:()=>OE(d.getModule().modules,t)??d.getModule()})}),d};return o(void 0),{getParsed:e=>(e===void 0?void 0:r.get(e))??o(e),parseText:e=>a(e).getModule()}},jE=e=>{let t=e=>{let t=e.tokens,n=e.getModule(),i=[],a=[],o=(e,n)=>{let r=bE(t,e+1);i.push({location:xE(t[e]),apply:e=>r.forEach(t=>e.put(vE(t,n,!1)))})},s=new Set(n.definitions.filter(e=>e.isRecursive).map(e=>e.name)),c=new Set(n.units.flatMap(e=>e.kind===`Constants`||e.kind===`Variables`?[`${e.location.line}:${e.location.column}`]:[])),l=0;t.slice(e.start,e.end).forEach((n,r)=>{let u=e.start+r;if(n.kind===`Separator`&&t[u+1]?.text===`MODULE`){if(l++,l===2){let e=t[u+2].text;i.push({location:xE(n),apply:t=>t.put(vE(e,`module`,!1))})}return}if(n.kind===`ModuleEnd`&&l--,l!==1||n.kind!==`Keyword`)return;let d=c.has(`${n.line}:${n.column}`);d&&(n.text===`CONSTANT`||n.text===`CONSTANTS`)&&o(u,`constant`),d&&(n.text===`VARIABLE`||n.text===`VARIABLES`)&&o(u,`variable`),n.text===`RECURSIVE`&&bE(t,u+1).every(e=>s.has(e))&&o(u,`definition`),mE.has(n.text)&&t[u+1]?.kind===`Identifier`&&t[u+2]?.text===`==`&&(a.push(xE(n)),i.push({location:xE(n),apply:e=>e.put(vE(t[u+1].text,`theorem`,!1))}))}),n.assumptions.forEach(e=>{a.push(e.location);let t=e.name;t!==void 0&&i.push({location:e.location,apply:e=>e.put(vE(t,`theorem`,!1))})});let u=e=>a.some(t=>t.line===e.line&&t.column===e.column);return n.definitions.forEach(e=>{if(u(e.location))return;let t=gE(e.name);i.push({location:e.location,apply:n=>n.put(vE(t,`definition`,e.isLocal))})}),n.instances.forEach(e=>{i.push({location:e.location,apply:t=>{let n=r(e.module).enumerate(),i=e.name===void 0?``:`${e.name}!`,a=n.filter(e=>e.kind===`definition`),o=n.filter(e=>e.kind===`theorem`);[...a,...o].forEach(n=>{n.isLocal||t.put(vE(`${i}${n.name}`,n.kind,e.isLocal))}),e.name!==void 0&&t.put(vE(e.name,`definition`,e.isLocal))}})}),i.sort((e,t)=>aa(e.location,t.location)?-1:+!!aa(t.location,e.location))},n=/* @__PURE__ */ new Map,r=i=>{let a=n.get(i??``);if(a)return a;let o=_E();n.set(i??``,o),vt.toReversed().forEach(e=>o.put(vE(e,`builtin`,!1)));let s=e(i);return s.getModule().extends.forEach(e=>r(e).inserted.forEach(e=>{e.isLocal||o.put(e)})),o.ownStart=o.inserted.length,t(s).forEach(e=>e.apply(o)),o};return{getContext:r,getOwnEntries:e=>{let t=r(e);return t.inserted.slice(t.ownStart)}}},ME=(e,t,n)=>{let r=/* @__PURE__ */ new Set,i=e=>{r.add(e)},a=e=>{e.kind===`ModelValue`&&i(e.name),e.kind===`String`&&i(e.value),e.kind===`Set`&&e.elements.forEach(a)};t.constants.forEach(e=>{e.args?.forEach(a),a(e.value)}),St.forEach(i);let o=t=>{let n=e(t);return n.tokens.slice(n.start,n.end)},s=/* @__PURE__ */ new Map,c=/* @__PURE__ */ new Map,l=e=>{let t=c.get(e);if(t)return t;let n=SE(o(e),e,s);return c.set(e,n),n},u=e=>s.get(e)??l(e),d=/* @__PURE__ */ new Set,f=(e,t)=>s.has(t)||d.has(`${e.key}>${t}`),p=(e,t,n)=>{let r=[...e.extends.map(u),...e.instances.filter(t=>f(e,t)).map(u),...e.inner];for(let e of r){let r=n(e,t);if(r)return r}},m=e=>{let t=(n,r)=>{if(r.has(n.key))return;r.add(n.key);let i=e(n).find(e=>!f(n,e));return i===void 0?p(n,r,t):[n,i]};return t},h=m(e=>e.extends),g=m(e=>e.instances),_=/* @__PURE__ */ new Set([void 0]),v=/* @__PURE__ */ new Map;TE(o(void 0)).forEach((e,t)=>{t===3&&wt.forEach(i),i(e)});let y=l(void 0);for(;;){let t=h(y,/* @__PURE__ */ new Set)??g(y,/* @__PURE__ */ new Set);if(!t)break;let[n,r]=t;if(d.add(`${n.key}>${r}`),v.set(n.unit,[...v.get(n.unit)??[],r]),!_.has(r)){if(_.add(r),e(r).tokens.length===0){let t=n.unit??EE(e(void 0).tokens);throw x(r,t)}TE(o(r)).forEach(i)}}pE.forEach(i);let ee=/* @__PURE__ */ new Set,b=e=>{if(ee.has(e))return;ee.add(e);let t=v.get(e)??[],n=l(e).allExtends;[...t.filter(e=>n.has(e)),...t.filter(e=>!n.has(e))].forEach(b),o(e).forEach(e=>{e.kind===`String`&&i(e.text)})};return b(void 0),n.forEach(e=>{let t=o(e);TE(t).forEach(i),t.forEach(e=>{e.kind===`String`&&i(e.text)})}),Ct.forEach(i),[...r]},NE=(e,t)=>{let n=AE(e,t),r=n.getParsed,i,a=()=>i??=jE(r);return{getStringOrder:(e,t)=>ME(r,e,t),getDeclarationOrder:e=>a().getContext(void 0).enumerate().filter(t=>t.kind===e).map(e=>e.name).reverse(),parseModule:n.parseText,createDefinitionOrder:()=>{let e=a();return e.getContext(void 0),t=>e.getOwnEntries(t).filter(e=>e.kind===`definition`).map(e=>e.name)}}},PE=/* @__PURE__ */ new Set([`IOUtils`,`Json`,`TLCExt`]),FE=e=>[...e.constants,...e.variables.map((t,n)=>({name:t,arity:0,location:e.variableLocations[n]}))],IE=(e,t,n)=>{try{return n.parseModule(e)}catch(n){if(!(n instanceof s))throw n;let r=Jn(e);throw r===void 0?n:c([{location:`In module ${t}`,message:`Could not parse module ${t} from file ${t}.tla`}],!0,r)}},LE=e=>new s(`Multiply-defined module '${e.name}' at line ${e.location.line}, column ${e.location.column}`),RE=(e,t)=>e.location.range&&t.location.range&&{location:m(e.location.range),message:`Multiply-defined module '${e.name}': this definition or declaration conflicts \nwith the one at ${m(t.location.range)}.`},zE=e=>[`Builtin`,`Definition`,`Instance`,`Parameter`].includes(e)?`definition`:`declaration`,BE=e=>e===`Theorem`?`ThmOrAssumpDefNode`:zE(e),VE=(e,t)=>({kind:`Operator`,name:t,params:[],body:{kind:`Let`,definitions:[e],body:Qp(e.name,e.location),location:e.location},isLocal:!0,isRecursive:!1,location:e.location}),HE=(e,t)=>{let n=_t(e);return n!==void 0&&t.has(n)||gt(e).some(e=>HE(e,t))},UE=(e,t)=>{let n=new Map(e.map((e,t)=>[e,t]));return new Set(t).forEach(e=>n.set(qp(e),n.get(e)??n.size)),n},WE=e=>e.flatMap(e=>e.substitutions.map(e=>e.expression)),GE=e=>e?.kind===`Steps`?e.steps.flatMap(e=>[...e.body.kind===`Instance`?[e.body]:[],...e.body.kind===`Define`?e.body.definitions.flatMap(e=>e.kind===`Instance`?[e]:[]):[],...GE(e.proof)]):[],KE=e=>e.forEach(e=>{if(e.kind===`Decimal`)throw tx(e);if(e.kind===`Number`&&!Rs(e.value))throw nx(e);KE(e.kind===`Let`?[...gt(e),...WE(e.instances??[])]:gt(e))}),qE=(e,t)=>{let n=t.order??NE(t.source,t.loadModule),r=n.parseModule(t.source),i=/* @__PURE__ */ new Map,a=/* @__PURE__ */ new Map,o=/* @__PURE__ */ new Map,l=/* @__PURE__ */ new Set,u=/* @__PURE__ */ new Set,d=new Map(Cv.map(e=>[e.name,e])),f=/* @__PURE__ */ new Map,p=L_(e.checkDeadlock,t.seed);p.isWarningEnabled=t.isWarningEnabled??!0,p.isTool=t.isTool??!1,p.version=t.version??`master`,p.readLine=t.readLine;let h=/* @__PURE__ */ new Map,_=/* @__PURE__ */ new Map,v=[],y=/* @__PURE__ */ new Map,ee=[],b=[],te=/* @__PURE__ */ new Set,S=(e,t)=>[te,...ee].forEach(n=>{n.add(e),[...t].forEach(e=>n.add(e))}),ne=0,re=e=>`${e}#${ne++}`,T=[],ie=[],ae=fE(e=>{let t=_.get(e)??le(e,e);return{constants:t.constants,variables:t.variables,definitions:[...new Set([...t.visible.values()].flatMap(e=>i.get(e.key)??[]))],assumptions:t.module.assumptions.map(e=>e.expression),theorems:t.module.theorems,getDefinition:e=>i.get(t.visible.get(e)?.key??e)}}),oe=/* @__PURE__ */ new Map,se=/* @__PURE__ */ new Map,E=/* @__PURE__ */ new Map,ce=e=>{let n=f.get(e);if(n)return n;let r=Gv(e,t.print,p,t.files,d);if(!r)return;Uv.get(e)?.forEach(ce);let i=/* @__PURE__ */ new Map;return Wv.get(e)?.forEach(e=>ce(e)?.forEach((e,t)=>i.set(t,e))),r.forEach(t=>{d.set(t.name,t),i.set(t.name,{key:t.name,arity:t.arity,params:dm.get(t.name)?.formals.map(e=>e.arity),kind:`Definition`,range:pm(e,t.name)??i.get(t.name)?.range})}),f.set(e,i),i},D=e=>{let n=Uv.get(e)??[];if(e===`TLCExt`||[e,...n].some(e=>t.loadModule?.(e)!==void 0))return;let r=ce(e);return r&&S(e,n),r&&n.includes(`Integers`)&&ce(`Integers`),r},O=e=>(KE([...e.definitions.flatMap(ht),...e.assumptions.map(e=>e.expression),...e.theorems.flatMap(e=>e.statement.kind===`AssumeProve`?[]:[e.statement]),...WE(e.instances)]),e.modules.forEach(O),e);O(r);let k=(e,r)=>{let i=t.loadModule?.(e)??fv(p.version).get(e)??mi(t.source,e);if(i===void 0)throw x(e,r);let a=IE(i,e,n);if(a.name!==e)throw c([{location:`Unknown location`,message:`File name '${e}' does not match the name '${a.name}' of the top level module it contains.`}],!0);return O(a)},A=e=>{let t=b.indexOf(e.name);if(t!==-1){let n=[...b.slice(t),e.name].map(e=>`${e}.tla`);throw new s(`Circular dependency among .tla files; dependency cycle is: ${n.join(` --> `)}`)}let n=/* @__PURE__ */ new Set,r=[],i=[],a=[];b.push(e.name),ee.push(n);let o=ve(e,{id:e.name,symbols:/* @__PURE__ */ new Map,modules:/* @__PURE__ */ new Map,nested:r,errors:i,warnings:ie,levelChecks:a});if(ee.pop(),b.pop(),i.length>0)throw c(i,!1,void 0,ie);let l=r.find(e=>n.has(e.name)),u=l&&h.get(l.name),d=u&&RE(l,u.module);if(d)throw c([d],!1,void 0,ie);if(l)throw LE(l);let f=[...zo(a.flatMap(e=>e.sections),ie),...a.flatMap(e=>e.check(e!==a.at(-1)))].filter((e,t,n)=>n.findIndex(t=>t.location===e.location&&t.message===e.message)===t);if(f.length>0)throw c(f,!1,void 0,ie);return{linked:o,closure:n}},le=(e,n)=>{let r=h.get(e);if(r)return S(e,y.get(e)??[]),r;let a=A(k(e,n)),o=/* @__PURE__ */ new Map;return Hv(e,t.print,p,t.files,d,(e,t,n)=>{let r=o.get(e),i=t.flatMap(e=>typeof e==`object`&&e.kind===`Operator`&&e.expression?[e.expression]:[]);if(r?.kind!==`Operator`||!n||i.length!==t.length)throw new w(`No definition of ${e} to fall back to`);return $(r.body,{environment:n.environment,scope:lS(Yx(r),i,n),state:n.state,next:n.next,isKeepLazy:n.isKeepLazy})})?.forEach(t=>{let n=a.linked.visible.get(t.name);if(n?.kind!==`Definition`||n.arity!==t.arity&&PE.has(e))return;let r=i.get(n.key);r&&o.set(t.name,r),d.set(n.key,t),i.delete(n.key)}),h.set(e,a.linked),y.set(e,a.closure),S(e,a.closure),a.linked},ue=(e,t,n,r,s)=>{let c=s?void 0:D(e.module);if(c)return de(e,c);let d=s??le(e.module,t.name);d.facts.forEach(t=>n.facts.add(e.name===void 0?t:`${e.name}!${t}`));let f=FE(d),p=`#${ne++}`,m=new Map(e.params.map(e=>[e.name,`${e.name}${p}`])),h=Ro(lE(e,t),f,t,n);T.push({module:e.module,instancer:t.name,lets:[],substitutions:h,location:e.location});let g=e.params.map(e=>({...e,name:`${e.name}${p}`}));g.forEach(e=>u.add(e));let _=e.definitionRange?{...e.definitionRange,start:{line:e.location.line,column:e.location.column}}:e.instanceRange,v=om({params:g,substitutions:new Map([...h].map(e=>[e[0],Tp(e[1],m)])),variables:new Set(d.variables),getDefinition:e=>i.get(e),getOuterDefinition:e=>t.definitions.find(t=>t.name===e),isParameterized:e=>a.get(e)===!0,addDefinition:(n,s,c)=>{let u=re(`${s}@${t.name}`),d=c(u);return i.set(u,d),f.length>0&&l.add(d),e.name!==void 0&&se.set(u,`${e.name}!${se.get(n)??s}`),a.set(u,!r),o.set(u,{source:n,prefix:e.params.length}),u},createName:re,...f.length>0&&{frame:{kind:`Identifier`,name:e.name??e.module,location:{..._.start,range:_}}}});return fe(e,d.exported,f,(t,n)=>{let r=e.name===void 0?v.getKey(t):v.getQualifiedKey(t);return f.length>0&&oe.set(r,{name:n,location:e.location}),e.name!==void 0&&E.set(r,n),r})},de=(e,t)=>e.name===void 0?t:new Map([...t].map(t=>[`${e.name}!${t[0]}`,{key:t[1].key,arity:t[1].arity,params:t[1].params,kind:t[1].kind}])),fe=(e,t,n,r)=>{let i=new Set(n.map(e=>e.name));return new Map([...t].filter(t=>!i.has(t[0])&&(e.name!==void 0||t[1].kind!==`Instance`)).map(t=>{if(e.name===void 0)return[t[0],{key:r(t[1].key,t[0]),arity:t[1].arity,params:t[1].params,kind:t[1].kind,range:a.get(t[1].key)===!0?e.location.range:t[1].range,functionArity:a.get(t[1].key)===!0?void 0:t[1].functionArity}];let i=`${e.name}!${t[0]}`;return[i,{key:t[1].kind===`Instance`?i:r(t[1].key,i),arity:t[1].arity+e.params.length,params:t[1].params&&[...e.params.map(e=>e.arity),...t[1].params],kind:t[1].kind,functionArity:n.length>0?void 0:t[1].functionArity}]}))},pe=(e,t)=>Array.from({length:e},(e,n)=>({name:`argument${n}`,arity:t?.[n]??0})),me=(e,t,n)=>{if(t.arity===0)return{params:[],body:e};if(e.kind===`Lambda`)return{params:e.params.map(e=>({name:e,arity:0})),body:e.body};let r=pe(t.arity,void 0);return{params:r,body:{kind:`Apply`,operator:e.kind===`Identifier`?e.name:e.kind===`OperatorReference`?e.operator:t.name,args:$p(r,n),location:n}}},he=(e,t,n,r)=>{let o=e.location,s=r?void 0:D(e.module);if(s)return e.name===void 0?[]:[...s].map(t=>{let n=pe(t[1].arity,t[1].params);return em(`${e.name}!${t[0]}`,t[1].key,[...e.params,...n],n,o)});let c=r??le(e.module,n),l=`#${ne++}`,u=new Map(e.substitutions.map(e=>[e.name,e.expression])),d=FE(c),f=e=>u.get(e.name)??{kind:`Identifier`,name:e.name,location:o};T.push({module:e.module,instancer:n,lets:t,substitutions:new Map(d.map(e=>[e.name,f(e)])),location:o});let p=new Set(e.params.map(e=>e.name)),m=e=>HE(f(e),p),h=d.map(t=>{let n=me(f(t),t,o);return{kind:`Operator`,name:`${t.name}${l}`,params:[...m(t)?e.params:[],...n.params],body:n.body,isLocal:!0,isRecursive:!1,location:o}}),g=[],_=om({params:e.params,substitutions:new Map(d.map(t=>[t.name,m(t)?{kind:`Apply`,operator:`${t.name}${l}`,args:$p(e.params,o),location:o,resolution:Hi}:Qp(`${t.name}${l}`,o)])),variables:new Set(c.variables),getDefinition:e=>i.get(e),getOuterDefinition:()=>void 0,isParameterized:e=>a.get(e)===!0,addDefinition:(t,n,r)=>{let i=`${n}@${e.module}${l}.${g.length}`,a=r(i);return g.push(a.kind===`Operator`?{...a,name:i}:VE(a,i)),i},createName:re}),v=new Set(d.map(e=>e.name)),y=[...c.exported].filter(e=>!v.has(e[0])&&e[1].kind!==`Instance`).map(t=>{let n=_.getKey(t[1].key),r=pe(t[1].arity,t[1].params),i=[...e.params,...r];return em(e.name===void 0?t[0]:`${e.name}!${t[0]}`,n,i,n===t[1].key?r:i,o)});return[...h,...g,...y]},ge=e=>[...e].flatMap(e=>{let t=i.get(e[1].key);return t?[{...t,name:e[0]}]:[]}),_e=/* @__PURE__ */ new Map,ve=(e,n)=>{let o=GT(e,t.loadClass?.(e.name),e===r);_e.set(e.name,o.overrides);let s=o.module,c=T.length,l=new Map([...Cv.map(e=>[e.name,{key:e.name,arity:e.arity,kind:`Builtin`}]),...n.symbols]),u=/* @__PURE__ */ new Map,d={location:No,errors:[],warnings:[]},f=[d],p=e=>e.forEach((e,t)=>{let n=h.get(t);if(!n){l.set(t,e),h.set(t,e);return}if(!n.range||!e.range||m(n.range)===m(e.range))return;let r=m(e.range),i=m(n.range);BE(n.kind)===BE(e.kind)?d.warnings.push({location:r,message:`Warning: the ${zE(n.kind)} of '${t}' conflicts with \nits ${zE(n.kind)} at ${i}.`}):d.errors.push({location:r,message:`The ${zE(e.kind)} of '${t}' conflicts with \nits ${zE(n.kind)} at ${i}.`})}),h=/* @__PURE__ */ new Map,g=/* @__PURE__ */ new Set,y=/* @__PURE__ */ new Map,ee=[],b=[...s.constants],x=s.variables.filter((e,t)=>s.variables.findIndex(t=>t.name===e.name)===t),S=x.map(e=>e.name),C=x.map(e=>e.location);s.extends.forEach(e=>{let t=n.modules.get(e),r=t?void 0:D(e);if(r){p(r);return}let i=t??le(e,s.name);b.push(...i.constants.filter(e=>b.every(t=>t.name!==e.name)&&!S.includes(e.name))),i.variables.forEach((e,t)=>{S.includes(e)||b.some(t=>t.name===e)||(S.push(e),C.push(i.variableLocations[t]))}),p(i.exported),i.facts.forEach(e=>g.add(e)),i.modules.forEach((e,t)=>y.set(t,e)),ee.push(i)});let ne=new Map(l),w=[...s.constants.map(e=>({...e,kind:`Constant`})),...s.variables.map(e=>({...e,kind:`Variable`}))],re=e=>({key:e.name,arity:e.arity,kind:e.kind,range:e.location.range});w.forEach(e=>h.set(e.name,re(e)));let oe=e=>({key:ce(e),arity:sa(e),params:ca(e),kind:Po(s,e)?`Theorem`:`Definition`,range:e.location.range,functionArity:ua(e)}),se=b.length===0&&S.length===0,ce=e=>s===r?e.name:`${e.name}@${n.id}`,O=/* @__PURE__ */ new Map,k=()=>new Map([...n.modules,...y]),A=e=>{let t=s.modules.find(t=>t.name===e.module);return t?aa(t.location,e.location)?y.get(t.name):void 0:k().get(e.module)},pe=e=>({imported:l,getInstance:e=>{let t=A(e),n=t?void 0:D(e.module);if(n)return{declarations:[],symbols:de(e,n),instancer:s.name};let r=t??le(e.module,s.name),i=FE(r);return{declarations:i,symbols:fe(e,r.exported,i,e=>e),instancer:s.name}},bound:ne,definitions:new Map(e.definitions.toReversed().map(e=>[e.name,e])),getKey:ce,isModuleKnown:(e,t)=>e===s.name||te.has(e)||n.modules.has(e)||s.modules.some(n=>n.name===e&&aa(n.location,t)),instanced:O,facts:g,reports:f,warnings:n.warnings}),me=e=>[...w.filter(t=>aa(t.location,e)).map(e=>[e.name,re(e)]),...s.definitions.filter(t=>aa(t.location,e)).map(e=>[e.name,oe(e)])].reduce((e,t)=>e.has(t[0])?e:e.set(t[0],t[1]),new Map(l)),ye=e=>{let t=k(),r=t.get(e.name),i=r&&RE(e,r.module);if(r&&!i)throw LE(e);n.nested.push(e);let a={location:e.location,errors:[],warnings:[]};f.push(a);let o=ve(e,{id:`${n.id}/${e.name}`,symbols:me(e.location),modules:t,nested:n.nested,errors:a.errors,warnings:a.warnings,levelChecks:n.levelChecks});i&&a.errors.push(i),r||y.set(e.name,o)};[...s.instances.map(e=>({location:e.location,link:()=>{let t=ue(e,s,pe(s),se,k().get(e.module));O.set(e,t),t.forEach((t,n)=>{l.has(n)||(u.set(n,e.location),l.set(n,t),e.isLocal||h.set(n,t))}),e.name!==void 0&&!e.isLocal&&h.set(e.name,{key:`${e.name}@${n.id}`,arity:e.params.length,kind:`Instance`,range:e.location.range})}})),...s.modules.map(e=>({location:e.location,link:()=>ye(e)}))].sort((e,t)=>aa(e.location,t.location)?-1:1).forEach(e=>e.link());let be=uE(um(s,(e,t)=>he(e,t,s.name,A(e))),ge(l));s.theorems.flatMap(e=>GE(e.proof)).filter(e=>!k().has(e.module)).forEach(e=>D(e.module)??le(e.module,s.name)),n.errors.push(...Bo(be,pe(be))),be.definitions.forEach(e=>{let t=ce(e);i.set(t,e),a.set(t,!se);let n=oe(e),r=u.get(e.name);(n.kind!==`Theorem`||l.get(e.name)?.kind!==`Theorem`||r!==void 0&&!aa(r,e.location))&&(l.set(e.name,n),e.isLocal||h.set(e.name,n))});let xe={module:be,constants:b,variables:S,variableLocations:C,visible:l,exported:h,modules:y,extended:ee,facts:/* @__PURE__ */ new Set([...g,...[...be.theorems,...be.assumptions].flatMap(e=>e.name??[])])};_.has(s.name)||_.set(s.name,xe);let Se=T.splice(c).map(e=>({location:e.location,check:()=>ae(e)}));return n.levelChecks.push(xh(be,{constants:new Set(b.map(e=>e.name)),variables:new Set(S),getDefinition:e=>i.get(l.get(e)?.key??e),getQualifiedName:e=>E.get(l.get(e)?.key??e)},Se,ie)),v.push(xe),xe},ye=A(r).linked,be=t.traceFile,xe=be===void 0?[]:[{kind:`postcondition`,module:`_TLCTrace`,operator:`_TLCTraceSilent`,constants:{_TLCTraceFile:be}}],Se=[...t.moduleOperators??[],...xe].map(e=>{let t=le(e.module,r.name).visible.get(e.operator);return{...e,key:t?.kind===`Definition`?t.key:void 0}});v.push(...v.splice(v.indexOf(ye),1)),ie.length>0&&!t.isSanyReported&&t.print(g(ie));let Ce=t.runtimeInvariants??[];Ce.forEach(e=>{if(e.module===void 0)return;h.set(r.name,ye);let t=le(e.module,r.name);v.splice(v.indexOf(t),1);let n=i.get(t.visible.get(e.name)?.key??e.name);n&&i.set(e.name,n)}),ye.visible.forEach((e,t)=>{let n=i.get(e.key);n&&e.key!==t&&i.set(t,n)}),Se.forEach(e=>{let t=e.key===void 0?void 0:i.get(e.key);e.kind!==`postcondition`&&t&&i.set(e.operator,t)});let we=[],Te=(e,t)=>{t.has(e)||(t.add(e),e.extended.forEach(e=>Te(e,t)),we.push(...e.module.assumptions))};Te(ye,/* @__PURE__ */ new Set);let Ee=ye.constants.map(e=>e.name),De=ye.variables,Oe=MT(e,{root:ye,moduleSymbols:new Map([...f,...[...h].map(e=>[e[0],e[1].visible]),[r.name,ye.visible]]),definitions:i,builtins:d,copySources:o,operatorConstants:new Map(Se.flatMap(e=>le(e.module,r.name).constants.flatMap(t=>{let n=e.constants?.[t.name];return n===void 0?[]:[[t.name,n]]}))),order:n}),ke=Oe.constants,Ae=Oe.substitutions;be!==void 0&&d.forEach((e,t)=>{let n=Ov(e);n&&d.set(t,n)});let je=UE(De,v.flatMap(e=>e.module.variables.map(e=>e.name))),Me=Ih({definitions:i,substitutions:Ae,constants:ke,variableIndex:je,builtins:d,variables:De}),Ne={runtime:p,definitions:i,builtins:d,constants:ke,substitutions:Ae,instanceNames:se,variables:De,variableIndex:je,facts:Me,startupValues:Array.from({length:Me.ids.size},()=>void 0),tlcEvalValues:/* @__PURE__ */ new WeakMap,substitutedDefinitions:l,instanceParams:u,evaluators:/* @__PURE__ */ new WeakMap,entryEvaluators:/* @__PURE__ */ new WeakMap,definitionEvaluators:/* @__PURE__ */ new WeakMap},Pe=yh({constants:new Set(ke.keys()),variables:/* @__PURE__ */ new Set([...De,...[`TLCGet`,`Trace`,`CounterExample`].filter(e=>d.has(e))]),getDefinition:e=>gx(e,Ne)}),Fe=e=>{try{$(e,{environment:Ne,scope:void 0,state:void 0,next:void 0});return}catch(e){if(e instanceof w)return e;throw e}};Ae.forEach((e,t)=>{let n=i.get(e),r=Ee.includes(t)&&n?.kind===`Operator`&&n.params.length===0&&Pe.analyzeDefinition(n,/* @__PURE__ */ new Map).level>0?Fe(n.body):void 0;if(r){let n=rs(r)?``:` - specifically: ${r.message}`;throw new C(`The configuration file substitutes constant ${t} with non-constant ${e}${n}`)}}),p.version!==`1.7.4`&&(p.isStarted=!0);let Ie=new Set(v.flatMap(e=>e.module.instances.map(e=>e.module))),Le=n.createDefinitionOrder();return{environment:Ne,assumptions:we,variableLocations:ye.variableLocations,instanceActions:oe,startupDefinitions:v.filter(e=>!Ie.has(e.module.name)||FE(e).length===0).flatMap(e=>Le(e===ye?void 0:e.module.name).flatMap(t=>{let n=i.get(e.visible.get(t)?.key??t);return n?[n]:[]})),javaOverrides:v.flatMap(e=>_e.get(e.module.name)??[]),moduleOperators:Se,runtimeInvariants:Ce,rootName:r.name}},JE=e=>[...e].map(e=>`${e[0]}>${e[1].name}`).sort().join(`,`),YE=(e,t)=>{let n=/* @__PURE__ */ new Map;return(/* @__PURE__ */ new Set([...e.keys(),...t.keys()])).forEach(r=>{let i=e.get(r),a=i?t.get(i.name)??i:t.get(r);a&&a.name!==r&&n.set(r,a)}),n},XE=e=>v(new w(`${l}${e}`),b.error),ZE=e=>{let t=K(e),n=/* @__PURE__ */ new Map;return t.domain.forEach((e,r)=>{let i=t.range[r];if(!Fs(e)||!Fs(i))throw XE(`Symmetry function must have model values as domain and range.`);e.name!==i.name&&n.set(e.name,i)}),n},QE=(e,t)=>{let n=e.kind===`Name`?e.name:`<<${e.names.join(`,`)}>>`;return t?`${n}\\in${$E(t)}`:n},$E=e=>{if(e.kind===`Identifier`)return e.name;if(e.kind===`Number`)return e.text??String(e.value);if(e.kind===`SetEnumeration`)return`{${e.elements.map($E).join(`,`)}}`;if(e.kind===`Choose`)return`CHOOSE${QE(e.pattern,e.set)}:${$E(e.body)}`;if(e.kind===`Tuple`)return`<<${e.elements.map($E).join(`,`)}>>`;if(e.kind===`Record`)return`[${e.fields.map(e=>`${e.name}|->${$E(e.value)}`).join(`,`)}]`;if(e.kind===`FunctionConstruction`)return`[${e.bounds.map(e=>QE(e.pattern,e.set)).join(`,`)}|->${$E(e.body)}]`;if(e.kind!==`Apply`)return``;let t=e.args.map($E);return/^[A-Za-z_]/.test(e.operator)?`${e.operator}(${t.join(`,`)})`:t.join(e.operator)},eD=e=>e.kind===`Apply`&&e.operator===`Permutations`&&e.args.length===1,tD=(e,t,n)=>{let r=t.definitions.get(e);if(r===void 0&&!t.constants.has(e))throw new C(`The symmetry function ${e} specified in the configuration file\nis not defined in the specification.`);if(r?.kind!==`Operator`||r.params.length>0)throw XE(`The symmetry function ${e} must specify a set of permutations.`);let i=e=>$(e,{environment:t,scope:void 0,state:void 0,next:void 0}),a=i(r.body);if(!Ms(a)||!W(a))throw XE(`The symmetry operator must specify a set of functions.`);let o=G(a).elements;if(!o.every(Ps))throw XE(`The symmetry values must be function records.`);let s=r.body,c=s.kind===`Apply`?s.args:s.kind===`SetEnumeration`?s.elements:[],l=new Map(n.filter(e=>e.module===void 0).map(e=>[e.target,e.name])),u=e=>{if(e.length===0)return;let n=e.map(e=>{let t=$E(eD(e)?e.args[0]:e);return l.get(t)??t}),r=e.length>1;t.runtime.warn(Ko.symmetrySetTooSmall,`The set${r?`s`:``} ${n.join(`, and `)} ${r?`have`:`has`} been defined to be a symmetry set but contain${r?``:`s`} less than two elements.`)};if(c.length>=o.length){u(c);return}let d=/* @__PURE__ */ new Map;o.map(ZE).forEach(e=>{e.size>0&&d.set(JE(e),e)});let f=[...d.values()],p=0;for(;p<d.size;){let e=[...d.values()],t=e.length;f.forEach(n=>e.slice(p,t).forEach(e=>{let t=YE(n,e),r=JE(t);t.size>0&&!d.has(r)&&d.set(r,t)})),p=t}let m=new Set([...d.values()].flatMap(e=>[...e.values()].map(e=>e.name))),h=new Set(n.map(e=>e.name));if(u(c.filter(e=>{if(!eD(e))return!1;let t=e.args[0];if(t.kind!==`Identifier`||h.has(t.name))return!1;let n=i(t);return typeof n==`object`&&n.kind===`Set`&&!n.elements.some(e=>Fs(e)&&m.has(e.name))})),d.size!==0)return[...d.values()]},nD=(e,t)=>{for(let n=0;n<e.length;n++){let r=e[n],i=iD(r,t);if(i===r)continue;let a=e.slice(0,n);a.push(i);for(let r=n+1;r<e.length;r++)a.push(iD(e[r],t));return a}},rD=(e,t)=>{let n=[],r=[];for(let i of e){let e=iD(i,t);e===i?n.push(i):r.push(e)}if(r.length===0)return;r.sort(xc);let i=[],a=0,o=0;for(;a<n.length&&o<r.length;)i.push(xc(n[a],r[o])<0?n[a++]:r[o++]);for(;a<n.length;)i.push(n[a++]);for(;o<r.length;)i.push(r[o++]);return i},iD=(e,t)=>{if(typeof e!=`object`)return e;let n=e.kind;if(n===`ModelValue`)return t.get(e.name)??e;if(n===`Set`){let n=rD(e.elements,t);return n?Ec(n):e}if(n===`Function`||n===`LazyFunction`&&W(e.domain)){let n=K(e),r=nD(n.domain,t),i=nD(n.range,t)??n.range;if(r){let e=Cl(r.map((e,t)=>[e,i[t]]));return e.domain.every((e,t)=>e===n.domain[t])?Oc(n.domain,e.range):e}return i===n.range?n:Oc(n.domain,i)}if(n===`Interval`||!Ms(e)||!W(e))return e;let r=G(e),i=nD(r.elements,t);return i?_l(i):r},aD=(e,t,n)=>{let r=e;for(let i of t){let t=e.slice(),a=0;for(let o of n)if(t[o]=iD(e[o],i),a===0&&(a=xc(t[o],r[o])),a>0)break;a<0&&(r=t)}return r},oD={line:0,column:0},sD=e=>({kind:`Identifier`,name:e,location:oD}),cD=e=>({name:e,expression:sD(e),scope:void 0}),lD=/* @__PURE__ */ new Set([`name`,`property`]),uD=(e,t,n)=>{let r=gx(t,n);if(!r)throw new C(`The ${e} ${t} specified in the configuration file\nis not defined in the specification.`);if(r.kind===`Operator`&&r.params.length>0)throw new C(lD.has(e)?`TLC requires ${t} not to take any argument.`:`TLC requires ${e} not to take any argument, but one was given: ${t}`);return r},dD=e=>e.body.kind===`Number`||e.body.kind===`String`,fD=(e,t,n)=>n.constants.has(e)?n.constants.get(e):dD(t)?void 0:Gx(t,n),pD=(e,t,n)=>{if(n.constants.has(t))throw new C(`The ${e} ${t} cannot be a constant.`);let r=uD(e,t,n);if(fD(t,r,n)!==void 0)throw new C(`The ${e} ${t} cannot be a constant.`);return r},mD=(e,t,n)=>{let r=n.constants.has(t)?void 0:uD(e,t,n),i=r?fD(t,r,n):n.constants.get(t);if(i!==void 0&&i!==!0)throw new C(`The ${e} of ${t} is equal to ${q(i)}`);return i===void 0?r:void 0},hD=(e,t)=>{e>1&&!(e&e-1)&&t?.({kind:`initial-states-progress`,count:e})},gD=(e,t,n)=>{let r=e.environment;r.runtime.warn=(e,t)=>n?.({kind:`warning`,code:e,text:t}),n?.({kind:`parsed`}),e.javaOverrides.forEach(e=>n?.({kind:`java-override`,...e})),Kx(e.startupDefinitions,r),t.invariants.forEach(e=>{mD(`invariant`,e,r)||n?.({kind:`constant-level-invariant`,name:e})})},_D=(e,t)=>{let n=yh({constants:new Set(t.constants.keys()),variables:new Set(t.variables),getDefinition:e=>t.definitions.get(e)});return e.flatMap(e=>{let r=mD(`invariant`,e,t);if(!r)return[];let i=n.analyzeDefinition(r,/* @__PURE__ */ new Map);if(i.level>=2){let t=i.params.size===0?``:`
|
|
1786
1794
|
Note that a bug can cause TLC to incorrectly report this error.
|
|
1787
1795
|
If you believe your TLA+ or PlusCal specification to be correct,
|
|
1788
|
-
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw
|
|
1789
|
-
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:
|
|
1790
|
-
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&Jx(c.expression,e.scope,t)<2)throw x(new v(`TLC cannot handle the temporal formula ${H(c.expression)}`),ie.error);let f=Jx(c,e.scope,t);if(f===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(f===2)throw new _(`TLC cannot handle this conjunct of the spec:\n${H(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,m=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:US},next:o.length===0?void 0:g(o[0],a.length),scope:m,temporals:s,isPropertyFairness:s.length>0&&!d}},rC=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=XS(`property`,e,t);if(!i)return;Jx(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;Xx(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(tC(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&Jx(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!A(e)?ig(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=Jx(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=H(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new _(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},iC=(e,t,n)=>t.flatMap(t=>XS(e,t,n)?[{name:t,expression:WS(t),scope:void 0}]:[]),aC=(e,t)=>{let n=ig(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},oC=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new _(`_POSSIBLE lists ${n} more than once`);YS(`possible`,n,t);let i=WS(n);if(Jx(i,void 0,t)===3)throw new _(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return{name:n,expression:i,scope:void 0}}),sC=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||A(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},cC=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=ig(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},lC=(e,t)=>e.flatMap(e=>eC(e.expression,t).map(n=>{let r=e.scope===void 0?Zu(n,t):void 0;return{name:e.name,expression:n,scope:e.scope,variables:r,membership:sC(n,r,t),predicate:cC(e.expression,t)}})),uC=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},dC=/[\u0100-\uffff]/,fC=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),pC=e=>e.kind===`String`?dC.test(e.value):e.kind===`Set`&&e.elements.some(pC),mC=e=>e.kind===`String`&&dC.test(e.value)||e.kind===`Apply`&&fC.has(e.operator)||ht(e).some(mC),hC=(e,t)=>e.constants.some(e=>pC(e.value)||(e.args??[]).some(pC))||[...t.definitions.values()].some(e=>mC(e.body)||e.kind===`Function`&&e.bounds.some(e=>mC(e.set))),gC=e=>{if(!ln(e))return;let t=_n(I(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},_C=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},vC=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),yC=(e,t,n)=>$h(W(e,t),n),bC=(e,t,n=SC)=>{let r=W(e,t);if(typeof r!=`boolean`)throw new v(n(e,t.environment));return r},xC=(e,t,n)=>{let r=t.kind===`Identifier`?ig(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?h(a):Ih(i)}`},SC=(e,t)=>xC(`boolean`,e,t),CC=(e,t)=>bC(e.expression,t,(n,r)=>(bC(e.predicate,t),SC(n,r))),wC=()=>{},TC=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=yC(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),EC=(e,t)=>{try{return e(vC(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof v)return{message:e.message};throw e}},DC=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=EC(e=>rg(W(n.expression,e),n.expression),t);if(e)return{name:Ih(n.expression),trace:[],message:e.message}}},OC=e=>{let t=typeof e.config==`string`?mt(e.config,e.version):e.config,n=Hb(e.source,e.loadModule);On(n.getStringOrder(t)),Nn(e),lo(e.fingerprintPolynomial??0);let r=ix(t,{source:e.source,loadModule:e.loadModule,order:n,loadClass:e.loadClass,print:e.onPrint??console.log,files:{readFile:e.readFile,writeFile:e.writeFile,makeDirectory:e.makeDirectory},seed:e.seed,isTool:e.isTool,traceFile:e.traceSpec?.traceFile,isSanyReported:e.isSanyReported,isWarningEnabled:e.isWarningEnabled,version:e.version,moduleOperators:e.moduleOperators});QS(r,t,e.onProgress);let i=r.environment;return i.runtime.getSpecification=()=>AS(t,i,r.variableLocations,r.instanceActions),{config:t,specification:r,environment:i,search:jC(t,i,r.variableLocations,()=>n.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators)}},kC=(e,t,n)=>{let r=DC(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(St.assumptionFalse,e,e),ie.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(St.assumptionEvaluationError,i,Ft(St.assumptionEvaluationError,i,!0)),ie.assumptionViolation},AC=e=>x(new v(`${i}Could not find operator: ${e.operator} in module: ${e.module}`),ie.error),jC=(e,t,n,r,a,o=[])=>{let s=e=>o.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw AC(e);return{name:e.operator,key:e.key}}),c=$S(e.invariants,t),l=nC(e,t,n,r,a),u=rC(e,t,a),d=e.properties[0],f=d&&ig(d,t)?.location.range,p=e.specification,m=p&&ig(p,t)?.location.range;l.isPropertyFairness&&f&&m&&a?.({kind:`warning`,code:St.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${d} at ${h(f)} equals\nthe fairness constraints of the behavior specification ${p} at ${h(m)}.\nTherefore, checking whether ${p} => ${d} using TLC will never result in a violation of ${d}.`});let g=lC([...c,...u.invariants],t),ee=[...new Map(g.map(e=>[e.predicate,e])).values()],y=g.length>0||u.actionProperties.length>0||u.liveness.length>0;if(l.init===void 0&&(y||u.initialPredicates.length>0||t.variables.length>0))throw new _(t.runtime.version===`1.7.4`?Dt:`The configuration file did not specify the initial state predicate.`);if(l.next===void 0&&y)throw new _(`The configuration file did not specify the next state predicate.`);let b=iC(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),te=lC(b,t),ne=iC(`action constraint`,e.actionConstraints,t),re=t.coverage,ae=(e,n,r=!0)=>n.flatMap(n=>{if(!re)return[];let i=r?cC(n.expression,t):n.expression,a=Co(r?n.name:void 0,i,t),o=xo(re,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),oe=[...ae(`invariant`,c),...ae(`invariant`,u.invariants,!1)],se=ae(`constraint`,ne),ce=ae(`constraint`,b),le=ae(`implied`,u.initialPredicates,!1),ue=ae(`implied`,u.actionProperties.map(e=>({...e,expression:e.box})),!1),de=(e,n,r,i)=>{try{return Fo(e,n.node,()=>W(n.expression,vC(t,r,i,n.scope)))}catch{return}},fe=(e,t,n)=>re!==void 0&&e.every(e=>de(re,e,t,n)===!0),S=(e,t,n)=>{if(re){for(let r of e){let e=de(re,r,t,n);if(typeof e!=`boolean`)return;if(!e)return re.primary[r.node]++,!1;re.secondary[r.node]++}return!0}};e.rlReward!==void 0&&KS(`rlreward`,e.rlReward,t),e.periodic!==void 0&&KS(`periodic`,e.periodic,t);let C=oC(e.possible,t);if(t.variables.length===0)return;let w=e.symmetry===void 0?void 0:RS(e.symmetry,t,e.substitutions),T=e.view===void 0?void 0:YS(`view function`,e.view,t),pe=e.view??s(`view`)[0]?.name,me=pe===void 0?void 0:{name:pe,expression:WS(pe),scope:void 0},he=u.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:US};return{...e,unchanged:t}}),ge=e=>Jx(e.expression,void 0,t)>=2,_e=C.filter(e=>!ge(e)),ve=C.filter(ge),ye=t.runtime,be,E=()=>{if(be)return be;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return be=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),be},xe=(e,n)=>W(e,vC(t,n,void 0)),Se=e=>{let t=E(),n=w===void 0?e:HS(e,w,t);return mo(me===void 0?t.map(e=>n[e]):[xe(me.expression,n)])},D=/* @__PURE__ */ new WeakSet,Ce=(e,n,r)=>{let i=r&&!D.has(r)?r:void 0;if(uC(e,n,i))return!1;try{let r=vC(t,n,void 0,e.scope),a=e.membership;return i&&a?!ea(n[a.variable],i[a.variable],W(a.set,r)):!CC(e,r)}catch(t){throw r?Vt(x(t,ie.safetyEvaluationFailure),St.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},we=hC(e,t);ye.getFingerprint=Se;let Te=()=>{let e=C.find(e=>!ye.possibleCounts.get(e.name));if(!e)return;let n=aC(e.name,t),r=n?` at ${h(n)}`:``;return{name:e.name,code:St.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:j(L(Sf(ye),!0))}},Ee=T?.body.kind===`Tuple`?T.body.elements:[],De=Ee.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Oe=T?.body.kind===`Tuple`&&De.length===Ee.length&&new Set(De).size===De.length,ke=(e,n)=>Oe?E().filter(e=>De.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${j(L(n[e]))}\n`).join(``):j(L(xe(e,n))),Ae=(e,n,r)=>bC(e.expression,vC(t,n,r),e=>`${i}${SC(e,t)}`),je=e=>{let n=Object.fromEntries(E().map(n=>[t.variables[n],e[n]]));return me===void 0?n:Fn(n,()=>ke(me.expression,e))};return{properties:u,spec:l,toRecord:je,evaluateAlias:(e,n,r,i)=>{try{YS(`alias`,e,t);let i=W(WS(e),vC(t,n,r)),a=gC(i);return a===void 0?je(n):Ln(a,e)}catch(e){if(!(e instanceof _||e instanceof v))throw e;return{...je(n),_ALIASEvalError:It(e.message,i)}}},isSymmetric:w!==void 0,isConstrained:te.length>0||ne.length>0,getTlcOrder:E,getStoredFingerprints:(e,t)=>me!==void 0||we?BigInt64Array.from(e,Se):ho(t,E()),getFingerprintState:e=>{if(we)return[String(Se(e))];let t=w===void 0?e:HS(e,w,E());return me===void 0?t:[xe(me.expression,t)]},findViolatedInvariant:(e,t)=>{if(fe(oe,e))return;let n=g.find(n=>Ce(n,e,t));return n&&D.add(e),n},getViolatedInvariants:e=>{let t=ee.filter(t=>g.some(n=>n.predicate===t.predicate&&Ce(n,e,void 0)));return t.length>0&&D.add(e),t},checkReplayedInitialState:(e,t,n)=>{let r=(n,r)=>bC(n,vC(t,e,void 0,r));te.every(e=>r(e.predicate,e.scope))&&n();let i=ee.find(e=>!r(e.predicate,e.scope));if(i)return{status:`invariant-violation`,name:i.name};let a=u.initialPredicates.find(e=>!r(e.expression,e.scope));return a&&{status:`liveness-violation`,name:a.name}},checkReplayedSuccessor:(e,t,n,r)=>(!(!(te.every(e=>bC(e.predicate,vC(n,t,void 0,e.scope)))&&ne.every(r=>bC(r.expression,vC(n,e,t,r.scope))))||r())||ee.every(e=>bC(e.predicate,vC(n,t,void 0,e.scope))))&&he.every(r=>bC(r.box,vC(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>S(ce,e)??te.every(r=>uC(r,e,n)||CC(r,vC(t,e,void 0))),findFailedInitialPredicate:e=>fe(le,e)?void 0:u.initialPredicates.find(n=>!bC(n.expression,vC(t,e,void 0,n.scope))),findViolatedActionProperty:(e,n)=>fe(ue,e,n)?void 0:he.find(r=>{try{return!bC(r.action,vC(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${H(r.box)}`)&&!yC(r.unchanged,vC(t,e,n,r.scope),`a subscript`)}catch(e){throw Vt(MC(e),St.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>S(se,e,t)??ne.every(n=>Ae(n,e,t)),getExcludingConstraints:(e,n)=>[...te.filter(e=>!CC(e,vC(t,n,void 0))),...ne.filter(t=>!Ae(t,e,n))].map(e=>{let n=aC(e.name,t);return n?h(n):e.name}),trackStatePossible:_e.length===0?wC:e=>TC(_e,ye,vC(t,e,void 0)),trackActionPossible:ve.length===0?wC:(e,n)=>TC(ve,ye,vC(t,e,n)),findUnwitnessedPossible:Te,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=WS(e.rlReward),o=W(a,vC(t,n,r));if(typeof o!=`number`)throw new v(xC(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=ig(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!qS(n)&&Mg(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw x(new v(i),ie.configParseError)}let a=(e,n)=>{let r=EC(e=>bC(WS(n),e),t);if(!r)return;let i=ig(n,t)?.body,a=aC(n,t),o=a?` at ${i?.kind===`Number`?Ih(i):h(a)}`:``;return r.message===void 0?{name:e,code:St.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:St.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=Te();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},MC=e=>e instanceof c?x(e,e.exitCode):e,NC=(e,t)=>e*((t-e)/2**64),PC=e=>e.includes(`.`)?e:`${e}.0`,FC=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return PC(String(e));let[n,r]=e.toExponential().split(`e`);return`${PC(n)}E${r.replace(`+`,``)}`},IC=e=>e!==void 0&&e>=`0`&&e<=`9`,LC=e=>{if(e===0)return`0.0`;let t=FC(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;IC(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;IC(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;IC(t[n])&&r<2;)i+=t[n++],r++;for(IC(t[n])&&Number(t[n])>=5&&(i=RC(i));IC(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},RC=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${RC(r)}.`:n===`9`?`${RC(r)}0`:`${r}${Number(n)+1}`},zC=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},BC=(e,t,n)=>{if(NC(e,t)<1e-10)return;let r=n().sort(),i=new Int32Array(r.buffer),a=1/0,o=9223372036854775807n;for(let e=1;e<r.length;e++){let t=i[2*e+1],n=i[2*e-1];if(t<0!=n<0)continue;let s=t-n;if(s<=1048576){let t=s*4294967296+(i[2*e]>>>0)-(i[2*e-2]>>>0);a=Math.min(a,t)}else{let t=r[e]-r[e-1];t<o&&(o=t)}}if(a===1/0)return o;let s=BigInt(a);return s<o?s:o},VC=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},HC=e=>{let t=Math.imul(e^e>>>16,2146121005),n=Math.imul(t^t>>>15,2221713035);return n^n>>>16},UC=(e,t)=>{let n=2166136261,r=1779033703;for(let t=0;t<e.length;t++)n=Math.imul(n^wa(e[t]),16777619),r=Math.imul(r^Aa(e[t]),1540483477);t[0]=HC(n)||1,t[1]=HC(r)},WC=()=>{let e=/* @__PURE__ */ new Int32Array(8192),t=0,n=(e,t,n)=>{let r=e.length/2-1;for(let i=t&r;;i=i+1&r){let r=e[i*2];if(r===0||r===t&&e[i*2+1]===n)return i}},r=()=>{let t=e,r=new Int32Array(t.length*2);for(let e=0;e<t.length;e+=2){if(t[e]===0)continue;let i=n(r,t[e],t[e+1]);r[i*2]=t[e],r[i*2+1]=t[e+1]}e=r};return{insert:(i,a)=>{t*4>=e.length&&r();let o=n(e,i,a);return e[o*2]!==i&&(e[o*2]=i,e[o*2+1]=a,t++,!0)}}},GC=(e,t)=>{let n=e.length-1;for(let r=Number(t>>32n)&n;;r=r+1&n){let n=Atomics.load(e,r);if(n===t)return!1;if(n!==0n)continue;let i=Atomics.compareExchange(e,r,0n,t);if(i===0n)return!0;if(i===t)return!1}},KC=()=>({slots:new BigInt64Array(new SharedArrayBuffer(8192)),used:new Int32Array(new SharedArrayBuffer(4))}),qC=(e,t,n)=>{let r=BigInt.asIntN(64,BigInt(t)<<32n|BigInt(n>>>0));return GC(e.slots,r)?(Atomics.add(e.used,0,1),!0):!1},JC=e=>Atomics.load(e.used,0)*2>=e.slots.length,YC=e=>{let t=new BigInt64Array(new SharedArrayBuffer(e.slots.byteLength*2));for(let n of e.slots)n!==0n&&GC(t,n);return{slots:t,used:e.used}},XC=[void 0,`lambda`,`tuple`,`record`],ZC=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=da(e.domain);return t?(a(7),a(XC.indexOf(ir(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(XC.indexOf(ir(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},QC=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return Zn(t.strings[n[r++]]);if(e===5)return $n(i(n[r++]));let a=XC[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=ui({kind:`Interval`,low:e,high:e+t-1});return rr(tr(o,i(t)),a)}let o=n[r++],s=i(o);return rr(tr(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Oh as $,ht as $t,$x as A,Ca as At,eb as B,Ct as Bt,OS as C,_r as Ct,AS as D,L as Dt,ES as E,Ka as Et,Vx as F,mr as Ft,d_ as G,Rt as Gt,ab as H,Ft as Ht,_x as I,dr as It,i_ as J,qt as Jt,H as K,Mt as Kt,Rx as L,On as Lt,Qx as M,tn as Mt,fx as N,An as Nt,iS as O,kn as Ot,ux as P,wa as Pt,Th as Q,gt as Qt,ix as R,Nn as Rt,MC as S,ha as St,TS as T,pi as Tt,ib as U,It as Ut,nb as V,Et as Vt,xy as W,zt as Wt,wh as X,Ht as Xt,r_ as Y,Nt as Yt,Eh as Z,Jt as Zt,_C as _,vo as _t,YC as a,rp as at,ZS as b,mo as bt,UC as c,Yf as ct,BC as d,Xd as dt,mt as en,Dh as et,NC as f,ef as ft,DC as g,Ro as gt,jC as h,jo as ht,KC as i,ke as in,wm as it,eS as j,Qn as jt,Hx as k,Sa as kt,LC as l,wf as lt,AC as m,xo as mt,ZC as n,qe as nn,Sm as nt,qC as o,np as ot,VC as p,ec as pt,ig as q,Zt as qt,WC as r,we as rn,Cm as rt,JC as s,ip as st,QC as t,nt as tn,Tm as tt,zC as u,Df as ut,OC as v,Co as vt,kS as w,Zn as wt,QS as x,lo as xt,kC as y,Xo as yt,Hb as z,St as zt};
|
|
1796
|
+
please check if this bug described in LevelNode.java starting at line 590ff affects you.`;throw v(new C(`The invariant ${e} is not a state predicate (one with no primes or temporal operators).${t}`),b.safetyEvaluationFailure)}return[cD(e)]})},vD=(e,t)=>{if(e.kind===`And`)return e.operands.flatMap(e=>vD(e,t));if(e.kind===`Identifier`&&!t.constants.has(e.name)){let n=gx(e.name,t);if(n?.kind===`Operator`&&n.params.length===0&&Gx(n,t)===void 0)return vD(n.body,t)}return[e]},yD=(e,t,n)=>{let r=e.expression;if(r.kind!==`Identifier`||dw(r,e.scope,t)>0)return!1;let i=$(r,LD(t,void 0,void 0,e.scope));if(i===!1)throw new C(`The spec is trivially false because ${r.name} is false.`);if(i!==!0)throw new C(`The operator ${r.name}, which equals ${q(i)},\ncannot be used as a ${n}`);return!0},bD=(e,t,n,r,i)=>{if(e.specification===void 0){let n=(e,n)=>{if(e!==void 0)return pD(n,e,t),sD(e)};return{init:n(e.init,`initial predicate`),next:n(e.next,`next state action`),scope:void 0,temporals:[],isPropertyFairness:!1}}if(e.init!==void 0||e.next!==void 0)throw new C(`The configuration file cannot specify both INIT/NEXT and SPECIFICATION fields.`);let a=[],o=[],s=[],c=t.constants.has(e.specification)?t.constants.get(e.specification):fD(e.specification,uD(`name`,e.specification,t),t);if(c!==void 0)throw new C(`The value of ${e.specification} is equal to ${q(c)}`);let l=uD(`name`,e.specification,t),u=e.properties.length===1?e.properties[0]:void 0,d=!1;pw(l.body,void 0,t,!1).forEach(e=>{let c=e.expression,l=e.path.some(e=>{let n=gx(e,t);return n?.kind===`Operator`&&dw(n.body,void 0,t)===1});if(!l&&yD(e,t,`spec`))return;let f=c.kind===`Identifier`&&!M(c)?t.variableIndex.get(c.name):void 0;if(!l&&c.kind===`Identifier`&&f!==void 0){let e=n[f].range;throw new C(`The operator ${c.name}, which equals ${e?m(e):c.name},\ncannot be used as a spec`)}if(c.kind===`UnboundedQuantifier`&&c.isTemporal)throw v(new C(`TLC does not support temporal existential, nor universal, quantification over state variables.`),b.error);if(c.kind===`Always`&&c.expression.kind===`BoxAction`){let n=Uw(c.expression.subscript,e.scope,t);if(n===void 0&&i?.({kind:`warning`,code:Ko.subscriptUndetermined,text:`TLC could not determine if the subscript of the next-state relation contains
|
|
1797
|
+
all state variables. Proceed with fingers crossed.`}),r().filter(e=>n!==void 0&&!n.includes(e)).forEach(e=>i?.({kind:`warning`,code:Ko.subscriptMissingVariable,text:`The subscript of the next-state relation specified by the specification\ndoes not seem to contain the state variable ${e}`})),o.length>0)throw new C(`The specification contains more than one conjunct of the form [][Next]_v,
|
|
1798
|
+
but TLC can handle only specifications with one next-state relation.`);o.push({expression:c.expression.action,scope:e.scope});return}if(c.kind===`Always`&&c.expression.kind!==`Let`&&c.expression.kind!==`Label`&&dw(c.expression,e.scope,t)<2)throw v(new w(`TLC cannot handle the temporal formula ${Q(c.expression)}`),b.error);let p=dw(c,e.scope,t);if(p===3)u!==void 0&&e.path.includes(u)||(d=!0),s.push(e);else{if(p===2)throw new C(`TLC cannot handle this conjunct of the spec:\n${Q(c)}`);a.push(e)}});let f=[...a,...o],p=e=>`$specification${e}`,h=f.reduce((e,t,n)=>t.scope===void 0?e:{name:p(n),binding:{kind:`Thunk`,expression:t.expression,scope:t.scope,state:void 0,next:void 0,cache:void 0,isStreamed:!1},parent:e},void 0),g=(e,t)=>e.scope===void 0?e.expression:{kind:`Identifier`,name:p(t),location:e.expression.location,resolution:{kind:`Local`}};return{init:a.length===0?void 0:{kind:`And`,operands:a.map(g),location:oD},next:o.length===0?void 0:g(o[0],a.length),scope:h,temporals:s,isPropertyFairness:s.length>0&&!d}},xD=(e,t,n)=>{let r={initialPredicates:[],invariants:[],actionProperties:[],liveness:[]};return e.properties.forEach(e=>{let i=mD(`property`,e,t);if(!i)return;dw(i.body,void 0,t)===1&&n?.({kind:`state-level-property`,name:e});let a=t.runtime.version!==`1.7.4`;pw(i.body,void 0,t,a).forEach(n=>{let i=n.expression;if(yD(n,t,`property`))return;let a=n.name??e;if(i.kind===`Always`&&i.expression.kind===`BoxAction`){r.actionProperties.push({name:a,box:i.expression,action:i.expression.action,subscript:i.expression.subscript,scope:n.scope});return}if(i.kind===`Always`&&dw(i.expression,n.scope,t)<=1){let e=i.expression,o=e.kind===`Identifier`&&!M(e)?gx(e.name,t):void 0;r.invariants.push({name:o?.name??(e.kind===`Identifier`?e.name:a),expression:e,scope:n.scope});return}let o=dw(i,n.scope,t);if(o<2)r.initialPredicates.push({name:a,expression:i,scope:n.scope});else{if(o===2){let e=Q(i),t=`Specifying Systems at https://lamport.azurewebsites.net/tla/book.html`,n=i.kind===`BoxAction`?`To check that action ${a} holds in *every* step of the behavior, define a temporal property by applying the "always" temporal operator ([]) to the formula at ${e} (compare page 90 of ${t}).`:i.kind===`AngleAction`?`To check that infinitely many ${a} steps occur, define a temporal property by applying the "always eventually" temporal operator combination ([]<>) to the formula at ${e} (compare page 91 of ${t}).`:`To check that action ${a} holds in *every* step of the behavior, define a temporal property: Let A be the formula at ${e}; rewrite A as [][A]_v, where v is a state function (typically the tuple of variables) (compare page 90 of ${t}).`;throw new C(`The formula ${a} at ${e} is an action-level formula (i.e., it contains no temporal operators). Only temporal-level (or state-level) formulas are allowed under PROPERTY or PROPERTIES. ${n}`)}r.liveness.push({name:e,expression:i,scope:n.scope})}})}),r},SD=e=>{let t=[],n=/* @__PURE__ */ new Set,r=e=>{if(e===void 0||n.has(e))return!0;n.add(e);let i=e.binding;return i.kind===`Thunk`?(t.push(i.expression),r(i.scope)&&r(e.parent)):i.kind===`Operator`?i.operator.kind===`Closure`&&(t.push(i.operator.body),r(i.operator.scope)&&r(e.parent)):r(e.parent)};return r(e)?t:void 0},CD=(e,t,n)=>t.flatMap(t=>mD(e,t,n)?[cD(t)]:[]),wD=(e,t)=>{let n=gx(e,t);return n?.kind===`Operator`?n.bodyRange:void 0},TD=(e,t)=>e.map((n,r)=>{if(e.indexOf(n)!==r)throw new C(`_POSSIBLE lists ${n} more than once`);pD(`possible`,n,t);let i=cD(n);if(dw(i.expression,void 0,t)===3)throw new C(`The possible of ${n} is equal to a temporal formula; only state- and action-level predicates are supported`);return i}),ED=(e,t,n)=>{if(e.kind!==`Apply`||e.operator!==`\\in`||t?.length!==1)return;let r=e.args[0];if(!(r.kind!==`Identifier`||M(r)))return n.variableIndex.get(r.name)===t[0]?{variable:t[0],set:e.args[1]}:void 0},DD=(e,t)=>{if(e.kind!==`Identifier`||t.constants.has(e.name))return e;let n=gx(e.name,t);return n?.kind===`Operator`&&n.params.length===0?n.body:e},OD=(e,t)=>e.flatMap(e=>{let n=DD(e.expression,t);return(e.scope===void 0&&qh(n,t)===void 0?[n]:vD(e.expression,t)).map(r=>{let i=e.scope===void 0?qh(r,t):void 0;return{name:e.name,expression:r,scope:e.scope,variables:i,membership:ED(r,i,t),predicate:n}})}),kD=(e,t,n)=>{let r=e.variables;if(!n||!r)return!1;for(let e=0;e<r.length;e++)if(t[r[e]]!==n[r[e]])return!1;return!0},AD=/[\u0100-\uffff]/,jD=/* @__PURE__ */ new Set([`JsonDeserialize`,`ndJsonDeserialize`]),MD=e=>e.kind===`String`?AD.test(e.value):e.kind===`Set`&&e.elements.some(MD),ND=(e,t)=>{if(e.kind===`Selection`){if(t.has(e.expression))return!1;t.add(e.expression)}return e.kind===`String`&&AD.test(e.value)||e.kind===`Apply`&&jD.has(e.operator)||gt(e).some(e=>ND(e,t))},PD=(e,t)=>{let n=/* @__PURE__ */ new Set;return e.constants.some(e=>MD(e.value)||(e.args??[]).some(MD))||[...t.definitions.values()].some(e=>ND(e.body,n)||e.kind===`Function`&&e.bounds.some(e=>ND(e.set,n)))},FD=e=>{if(!Ps(e))return;let t=Hs(K(e));if(t.every(e=>typeof e[0]==`string`))return Object.fromEntries(t.map(e=>[String(e[0]),e[1]]))},ID=(e,t,n,r)=>{let i=n===1?`the next-state action`:`action ${t} of the next-state relation`,a=r===`1.7.4`?`assigned`:`defined`;return`Successor state is not completely specified by ${i}. The following variable${e.length>1?`s are`:` is`} not ${a}: ${e.join(`, `)}.\n`},LD=(e,t,n,r)=>({environment:e,scope:r,state:t,next:n}),RD=(e,t,n)=>dx($(e,t),n),zD=(e,t,n=VD)=>{let r=$(e,t);if(typeof r!=`boolean`)throw new w(n(e,t.environment));return r},BD=(e,t,n)=>{let r=t.kind===`Identifier`?gx(t.name,n):void 0,i=r?.kind===`Operator`?r.body:t,a=r?.kind===`Operator`?r.bodyRange:void 0;return`TLC expected a ${e} value, but did not find one. ${a&&i.kind!==`Number`?m(a):Jb(i)}`},VD=(e,t)=>BD(`boolean`,e,t),HD=(e,t)=>zD(e.expression,t,(n,r)=>(e.predicate!==e.expression&&zD(e.predicate,t),VD(n,r))),UD=()=>{},WD=(e,t,n)=>e.forEach(e=>{let r=t.possibleCounts.get(e.name)??0,i=RD(e.expression,n,`_POSSIBLE ${e.name}`);t.possibleCounts.set(e.name,i?r+1:r)}),GD=(e,t)=>{try{return e(LD(t,void 0,void 0))?void 0:{message:void 0}}catch(e){if(e instanceof w)return{message:e.message};throw e}},KD=(e,t)=>{for(let n of e.filter(e=>!e.isAxiom)){let e=GD(e=>hx($(n.expression,e),n.expression),t);if(e)return{name:Jb(n.expression),trace:[],message:e.message}}},qD=(e,t,n,r=!1)=>{let i=NE(t.source,t.loadModule);return tc(i.getStringOrder(e,(t.runtimeInvariants??[]).flatMap(e=>e.module??[]))),oc(t),Pd(t.fingerprintPolynomial??0),r&&nc(),{order:i,specification:qE(e,{source:t.source,loadModule:t.loadModule,order:i,loadClass:t.loadClass,print:n,files:{readFile:t.readFile,writeFile:t.writeFile,makeDirectory:t.makeDirectory},seed:t.seed,isTool:t.isTool,traceFile:t.traceSpec?.traceFile,isSanyReported:t.isSanyReported,isWarningEnabled:t.isWarningEnabled,version:t.version,moduleOperators:t.moduleOperators,readLine:t.readLine,runtimeInvariants:t.runtimeInvariants})}},JD=e=>{let t=typeof e.config==`string`?ft(e.config,e.version):e.config,n=qD(t,e,e.onPrint??console.log),r=n.specification;gD(r,t,e.onProgress);let i=e.coverage===void 0?void 0:Qd(r.environment.variables.length),a=i?$d(r.environment,i):r.environment,o,s=()=>o??=Hw(t,a,r.instanceActions);a.runtime.getSpecification=()=>qw(s(),t,a,r.variableLocations);let c=eO(t,a,r.variableLocations,()=>n.order.getDeclarationOrder(`variable`),e.onProgress,r.moduleOperators,r.runtimeInvariants);return{config:t,specification:r,environment:a,search:c,getDescription:s,coverage:i,getCoverage:()=>i&&Kf(i,a,r.variableLocations,c?.getTlcOrder()??[])}},YD=/* @__PURE__ */ Error(`The walk stopped`),XD=(e,t,n)=>{let r=(n,r)=>r.map(r=>({...r,node:rf(e,n,of(r.name,r.expression,t),r.expression,r.scope)})),i=r(`init`,n.inits),a=r(`next`,n.actions);return hf(e,t,Iy(a,t)),{inits:i,actions:a}},ZD=(e,t,n,r,i,a=(e,t)=>{throw Lb(e,t,r)},o)=>Fy(t,t.node,n,r,n=>{e.primary[t.node]++,i(n)},n=>(e.primary[t.node]++,a(n,t.name),!0),o),QD=(e,t,n)=>{let r=KD(e,t);if(!r)return;if(r.message===void 0){let e=`Assumption ${r.name} is false.`;return n(Ko.assumptionFalse,e,e),b.assumptionViolation}let i=`Evaluating assumption ${r.name} failed.\n${r.message}`;return n(Ko.assumptionEvaluationError,i,as(Ko.assumptionEvaluationError,i,!0)),b.assumptionViolation},$D=e=>v(new w(`${l}Could not find operator: ${e.operator} in module: ${e.module}`),b.error),eO=(e,t,n,r,i,a=[],o=[])=>{let s=e=>a.filter(t=>t.kind===e).map(e=>{if(e.key===void 0)throw $D(e);return{name:e.operator,key:e.key}}),c=_D(e.invariants,t),u=bD(e,t,n,r,i),d=xD(e,t,i),f=e.properties[0],p=f&&gx(f,t)?.location.range,h=e.specification,g=h&&gx(h,t)?.location.range;u.isPropertyFairness&&p&&g&&i?.({kind:`warning`,code:Ko.fairnessTautology,text:`Implied-temporal checking is a tautology.\nThe temporal formula ${f} at ${m(p)} equals\nthe fairness constraints of the behavior specification ${h} at ${m(g)}.\nTherefore, checking whether ${h} => ${f} using TLC will never result in a violation of ${f}.`});let _=OD([...c,...d.invariants],t),y=_.length>0||d.actionProperties.length>0||d.liveness.length>0;if(u.init===void 0&&(y||d.initialPredicates.length>0||t.variables.length>0))throw new C(t.runtime.version===`1.7.4`?Zo:`The configuration file did not specify the initial state predicate.`);if(u.next===void 0&&y)throw new C(`The configuration file did not specify the next state predicate.`);let ee=OD(o.map(e=>{let n=gx(e.name,t);return{name:e.name,expression:n?.kind===`Operator`?n.body:sD(e.name),scope:void 0}}),t),x=[..._,...ee],te=[...new Map(x.map(e=>[e.predicate,e])).values()],S=CD(`constraint`,[...e.constraints,...s(`constraint`).map(e=>e.name)],t),ne=OD(S,t),re=CD(`action constraint`,e.actionConstraints,t),T=t.coverage,ie=(e,n,r=!0)=>n.flatMap(n=>{if(!T)return[];let i=r?DD(n.expression,t):n.expression,a=of(r?n.name:void 0,i,t),o=rf(T,e,a,i,n.scope);return[{expression:i,scope:n.scope,node:o}]}),ae=[...ie(`invariant`,c),...ie(`invariant`,d.invariants,!1)],oe=new Map([...c,...d.invariants].map((e,n)=>[DD(e.expression,t),ae[n]])),se=ie(`constraint`,re),E=ie(`constraint`,S),ce=new Map(E.map(e=>[e.expression,e])),D=[...new Map(ne.map(e=>[e.predicate,e])).values()],O=ie(`implied`,d.initialPredicates,!1),k=ie(`implied`,d.actionProperties.map(e=>({...e,expression:e.box})),!1),A=(e,n,r,i)=>{try{return yf(e,n.node,()=>$(n.expression,LD(t,r,i,n.scope)))}catch{return}},le=(e,t,n)=>T&&e?yf(T,e.node,()=>zD(e.expression,n)):zD(t,n),ue=(e,t,n)=>{if(T){for(let r of e){let e=A(T,r,t,n);if(typeof e!=`boolean`)return;if(!e)return T.primary[r.node]++,!1;T.secondary[r.node]++}return!0}};e.rlReward!==void 0&&uD(`rlreward`,e.rlReward,t),e.periodic!==void 0&&uD(`periodic`,e.periodic,t);let de=TD(e.possible,t);if(t.variables.length===0)return;let fe=e.symmetry===void 0?void 0:tD(e.symmetry,t,e.substitutions),pe=e.view===void 0?void 0:pD(`view function`,e.view,t),me=e.view??s(`view`)[0]?.name,he=me===void 0?void 0:cD(me),ge=d.actionProperties.map(e=>{let t={kind:`Unchanged`,expression:e.subscript,location:oD};return{...e,unchanged:t}}),_e=e=>dw(e.expression,void 0,t)>=2,ve=de.filter(e=>!_e(e)),ye=de.filter(_e),be=t.runtime,xe,Se=()=>{if(xe)return xe;let e=r(),n=n=>{let r=e.indexOf(t.variables[n]);return r===-1?t.variables.length:r};return xe=t.variables.map((e,t)=>t).sort((e,t)=>n(e)-n(t)),xe},Ce=(e,n)=>$(e,LD(t,n,void 0)),we=e=>(he!==void 0&&e.forEach(fl),fe===void 0?e:aD(e,fe,Se())),Te=e=>{let t=we(e);return Kd(he===void 0?Se().map(e=>t[e]):[Ce(he.expression,t)])},Ee=e=>d.initialPredicates.find((n,r)=>{let i=T&&A(T,O[r],e,void 0);return typeof i==`boolean`?!i:!zD(n.expression,LD(t,e,void 0,n.scope))}),De=/* @__PURE__ */ new WeakSet,Oe=(e,n,r)=>{let i=r&&!De.has(r)?r:void 0;if(kD(e,n,i))return!1;try{let r=LD(t,n,void 0,e.scope),a=e.membership;return i&&a?!Cu(n[a.variable],i[a.variable],$(a.set,r)):!HD(e,r)}catch(t){throw r?ds(v(t,b.safetyEvaluationFailure),Ko.invariantEvaluationFailed,`Evaluating invariant ${e.name} failed.`):t}},ke=(e,t,n)=>{let r=oe.get(e.predicate),i=T&&r?A(T,r,t,void 0):void 0;return typeof i==`boolean`?!i:x.some(r=>r.predicate===e.predicate&&Oe(r,t,n))},Ae=PD(e,t);be.getFingerprint=Te;let je=()=>{let e=de.find(e=>!be.possibleCounts.get(e.name));if(!e)return;let n=wD(e.name,t),r=n?` at ${m(n)}`:``;return{name:e.name,code:Ko.possibleUnwitnessed,message:`The _POSSIBLE predicate ${e.name}${r} was never witnessed.\nOthers may be unwitnessed too; only witnessed predicates appear with a\nnon-zero count in the record printed above.\nSee https://explain.tlapl.us/possible-conditions for additional details.`,counts:U(q(R_(be),!0))}},Me=pe?.body.kind===`Tuple`?pe.body.elements:[],Ne=Me.flatMap(e=>e.kind===`Identifier`&&t.variables.includes(e.name)?[e.name]:[]),Pe=pe?.body.kind===`Tuple`&&Ne.length===Me.length&&new Set(Ne).size===Ne.length,Fe=(e,n)=>Pe?Se().filter(e=>Ne.includes(t.variables[e])).map(e=>`/\\ ${t.variables[e]} = ${U(q(n[e]))}\n`).join(``):U(q(Ce(e,n))),Ie=(e,n,r)=>zD(e.expression,LD(t,n,r),e=>`${l}${VD(e,t)}`),Le=e=>{let n=Object.fromEntries(Se().map(n=>[t.variables[n],e[n]]));return he===void 0?n:cc(n,()=>Fe(he.expression,e))};return be.toRecord=Le,{properties:d,spec:u,toRecord:Le,evaluateAlias:(e,n,r,i)=>{let a=()=>Le(n.map(e=>e??wc(`null`)));try{pD(`alias`,e,t);let i=$(sD(e),LD(t,n,r)),o=FD(i);return o===void 0?a():uc(o,e)}catch(e){if(!(e instanceof C||e instanceof w))throw e;return{...a(),_ALIASEvalError:os(e.message,i)}}},isSymmetric:fe!==void 0,isConstrained:ne.length>0||re.length>0,getTypedChecks:n=>{if(T!==void 0||de.length>0||e.periodic!==void 0||[...x,...ne].some(e=>e.scope!==void 0)||re.length>0||d.actionProperties.some(e=>e.scope!==void 0)||d.liveness.length>0&&(n===void 0||he!==void 0)||u.init===void 0||u.next===void 0)return;let r=te.map(e=>e.predicate),i=[...new Set(ne.map(e=>e.predicate))],a=d.initialPredicates.map(e=>e.expression),o=[...t.facts.ids.keys()],s=SD(u.scope),c=e=>Gx(e,t)===void 0&&Uh(e,t,`replayed`);return(s===void 0?o.some(c):o.some(e=>!(e.kind===`Operator`&&e.params.length>0)&&zh(e,t)&&c(e))||Hh([u.init,u.next,...r,...i,...a,...d.actionProperties.flatMap(e=>[e.action,e.subscript]),...he?[he.expression]:[],...s,...ST(n??[])],t,`replayed`))?void 0:{init:u.init,next:u.next,scope:u.scope,invariants:r,constraints:i,holdsInitialPredicates:e=>Ee(e)===void 0,actionProperties:d.actionProperties,symmetry:fe,view:he?.expression,variableOrder:Se(),liveness:n}},getTlcOrder:Se,getStoredFingerprints:(e,t)=>he!==void 0||Ae?BigInt64Array.from(e,Te):Jd(t,Se()),getFingerprintState:e=>{if(Ae)return[String(Te(e))];let t=we(e);return he===void 0?t:[Ce(he.expression,t)]},findViolatedInvariant:(e,t)=>{let n=T===void 0?x.find(n=>Oe(n,e,t)):te.find(n=>ke(n,e,t));return n&&De.add(e),n},forEachViolatedInvariant:(e,t)=>{for(let n of te)ke(n,e,void 0)&&(De.add(e),t(n))},checkReplayedInitialState:(e,t,n,r)=>{let i=(n,r,i)=>le(n,r,LD(t,e,void 0,i));D.every(e=>i(ce.get(e.predicate),e.predicate,e.scope))&&n();for(let e of te)i(oe.get(e.predicate),e.predicate,e.scope)||r({status:`invariant-violation`,name:e.name});let a=d.initialPredicates.find((e,t)=>!i(O[t],e.expression,e.scope));a&&r({status:`liveness-violation`,name:a.name})},checkReplayedSuccessor:(e,t,n,r)=>(!(!(D.every(e=>le(ce.get(e.predicate),e.predicate,LD(n,t,void 0,e.scope)))&&re.every((r,i)=>le(se[i],r.expression,LD(n,e,t,r.scope))))||r())||te.every(e=>le(oe.get(e.predicate),e.predicate,LD(n,t,void 0,e.scope))))&&ge.every((r,i)=>le(k[i],r.box,LD(n,e,t,r.scope))),satisfiesConstraints:(e,n)=>ue(E,e)??ne.every(r=>kD(r,e,n)||HD(r,LD(t,e,void 0))),findFailedInitialPredicate:Ee,findViolatedActionProperty:(e,n)=>ge.find((r,i)=>{let a=T&&A(T,k[i],e,n);if(typeof a==`boolean`)return!a;try{return!zD(r.action,LD(t,e,n,r.scope),()=>`Attempted to evaluate an expression of form [A]_e, but A was not a boolean.\n${Q(r.box)}`)&&!RD(r.unchanged,LD(t,e,n,r.scope),`a subscript`)}catch(e){throw ds(tO(e),Ko.actionPropertyEvaluationFailed,`Evaluating action property ${r.name} failed.`)}}),satisfiesActionConstraints:(e,t)=>ue(se,e,t)??re.every(n=>Ie(n,e,t)),getExcludingConstraints:(e,n)=>[...ne.filter(e=>!HD(e,LD(t,n,void 0))),...re.filter(t=>!Ie(t,e,n))].map(e=>{let n=wD(e.name,t);return n?m(n):e.name}),trackStatePossible:ve.length===0?UD:e=>WD(ve,be,LD(t,e,void 0)),trackActionPossible:ye.length===0?UD:(e,n)=>WD(ye,be,LD(t,e,n)),findUnwitnessedPossible:je,getReward:(n,r,i)=>{if(e.rlReward===void 0)return i;let a=sD(e.rlReward),o=$(a,LD(t,n,r));if(typeof o!=`number`)throw new w(BD(`integer`,a,t));return o},findPostconditionViolation:(n=!1)=>{let r=s(`postcondition`),i=e.postconditions.map(e=>{let n=gx(e,t);return n?n.kind===`Operator`&&n.params.length>0?`TLC requires post condition not to take any argument, but one was given: ${e}`:!dD(n)&&Gx(n,t)!==void 0?`The post condition ${e} cannot be a constant.`:void 0:`The post condition ${e} specified in the configuration file\nis not defined in the specification.`}).find(e=>e!==void 0);if(i!==void 0){if(n)return;throw v(new w(i),b.configParseError)}let a=(e,n)=>{let r=GD(e=>zD(sD(n),e),t);if(!r)return;let i=gx(n,t)?.body,a=wD(n,t),o=a?` at ${i?.kind===`Number`?Jb(i):m(a)}`:``;return r.message===void 0?{name:e,code:Ko.postconditionFalse,message:`Postcondition ${e}${o} is false.`}:{name:e,code:Ko.postconditionFailed,message:`Evaluating postcondition ${e}${o} failed.\n${r.message}`}};for(let e of r){let t=a(e.name,e.key);if(t)return t}let o=je();if(o)return o;for(let t of e.postconditions){let e=a(t,t);if(e)return e}}}},tO=e=>e instanceof t?v(e,e.exitCode):e,nO=(e,t)=>e*((t-e)/2**64),rO=e=>e.includes(`.`)?e:`${e}.0`,iO=e=>{let t=Math.abs(e);if(t>=.001&&t<1e7)return rO(String(e));let[n,r]=e.toExponential().split(`e`);return`${rO(n)}E${r.replace(`+`,``)}`},aO=e=>e!==void 0&&e>=`0`&&e<=`9`,oO=e=>{if(e===0)return`0.0`;let t=iO(e),n=0,r=0,i=``;for(;t[n]===`0`;)n++;for(;aO(t[n]);)i+=t[n++],r++;if(n===t.length)return i;if(t[n]!==`.`)return t;if(n++,r>=2)for(;aO(t[n]);)n++;else{if(i+=`.`,r===0)for(;t[n]===`0`;)i+=t[n++];for(;aO(t[n])&&r<2;)i+=t[n++],r++;for(aO(t[n])&&Number(t[n])>=5&&(i=sO(i));aO(t[n]);)n++}return n>=t.length?i:t[n]===`E`?`${i}${t.slice(n)}`:t},sO=e=>{let t=e.length-1;if(t<0)return`1`;let n=e[t],r=e.slice(0,t);return n===`.`?`${sO(r)}.`:n===`9`?`${sO(r)}0`:`${r}${Number(n)+1}`},cO=e=>{let t=0;for(;10n**BigInt(t+1)<e*10n;)t++;let n=10n**BigInt(t+1),r=n/e,i=n%e*2n>=e;return Number(`${r+(i?1n:0n)}e-${t+1}`)},lO=(e,t,n)=>{if(nO(e,t)<1e-10)return;let r=1/0,i=9223372036854775807n,a;if(n(e=>{if(e.length===0)return;let t=e.sort();if(a!==void 0&&a<0n==t[0]<0n){let e=t[0]-a;e<i&&(i=e)}a=t[t.length-1];let n=new Int32Array(t.buffer,t.byteOffset,t.length*2);for(let e=1;e<t.length;e++){let a=n[2*e+1],o=n[2*e-1];if(a<0!=o<0)continue;let s=a-o;if(s<=1048576){let t=s*4294967296+(n[2*e]>>>0)-(n[2*e-2]>>>0);r=Math.min(r,t)}else{let n=t[e]-t[e-1];n<i&&(i=n)}}}),r===1/0)return i;let o=BigInt(r);return o<i?o:i},uO=e=>{let t=e.reduce((e,t)=>e+t,0);if(t===0)return;let n=e.flatMap((e,t)=>e>0?[t]:[]),r=e.reduce((e,t,n)=>e+t*n,0),i=Math.floor(t*.95),a=0,o=n.find(t=>(a+=e[t],a>i));return`The average outdegree of the complete state graph is ${Math.round(r/t)} (minimum is ${n[0]}, the maximum ${n[n.length-1]} and the 95th percentile is ${o}).`},dO=[void 0,`lambda`,`tuple`,`record`],fO=()=>{let e=/* @__PURE__ */ new Int32Array(1024),t=0,n=0,r=[],i=/* @__PURE__ */ new Map,a=n=>{if(t===e.length){let t=new Int32Array(e.length*2);t.set(e),e=t}e[t++]=n},o=e=>{let t=i.get(e);if(t!==void 0)return a(t);i.set(e,r.length),a(r.length),r.push(e)},s=e=>{if(typeof e==`boolean`)return a(+!!e),!0;if(typeof e==`number`)return(e|0)===e&&(a(2),a(e),!0);if(typeof e==`string`)return a(3),o(e),!0;if(e.kind===`ModelValue`)return a(4),o(e.name),!0;if(e.kind===`Set`)return a(5),a(e.elements.length),e.elements.every(s);if(e.kind===`Function`){let t=Iu(e.domain);return t?(a(7),a(dO.indexOf(jc(e))),a(t.low),a(e.range.length),e.range.every(s)):(a(6),a(dO.indexOf(jc(e))),a(e.domain.length),e.domain.every(s)&&e.range.every(s))}return!1};return{encode:e=>{let r=t;return e.every(s)?(n++,!0):(t=r,!1)},finish:()=>({words:e.slice(0,t),strings:r,count:n})}},pO=e=>t=>{let n=t.words,r=0,i=e=>Array.from({length:e},()=>a()),a=()=>{let e=n[r++];if(e===0)return!1;if(e===1)return!0;if(e===2)return n[r++];if(e===3)return t.strings[n[r++]];if(e===4)return wc(t.strings[n[r++]]);if(e===5)return Ec(i(n[r++]));let a=dO[n[r++]];if(e===7){let e=n[r++],t=n[r++],o=Ml({kind:`Interval`,low:e,high:e+t-1});return Ac(Oc(o,i(t)),a)}let o=n[r++],s=i(o);return Ac(Oc(s,i(o)),a)};return Array.from({length:t.count},()=>Array.from({length:e},()=>a()))};export{Fb as $,xt as $n,zc as $t,qw as A,mi as An,Wc as At,fC as B,ir as Bn,q as Bt,DT as C,zi as Cn,Hd as Ct,Gw as D,Si as Dn,Cs as Dt,xT as E,Ti as En,Kd as Et,uC as F,yr as Fn,Oc as Ft,Q as G,sr as Gn,Es as Gt,gC as H,ar as Hn,Ju as Ht,mC as I,Zn as In,Il as It,gx as J,ur as Jn,W as Jt,$ as K,er as Kn,Ql as Kt,dC as L,mr as Ln,Ec as Lt,aw as M,gi as Mn,wc as Mt,lC as N,yi as Nn,Fl as Nt,Kw as O,bi as On,xc as Ot,vC as P,vi as Pn,_l as Pt,Lb as Q,Jn as Qn,G as Qt,xC as R,hr as Rn,Pl as Rt,iD as S,ji as Sn,Bd as St,TT as T,Vi as Tn,Ld as Tt,cC as U,pr as Un,Ds as Ut,bC as V,nr as Vn,qu as Vt,wS as W,rr as Wn,Tc as Wt,gS as X,dr as Xn,Rc as Xt,Gx as Y,fr as Yn,Vc as Yt,QS as Z,Qn as Zn,fl as Zt,QD as _,Ni as _n,Hh as _t,lO as a,ls as an,Ny as at,ZD as b,Li as bn,$d as bt,YD as c,xs as cn,dv as ct,$D as d,fs as dn,B_ as dt,Ko as en,gt as er,Rb as et,eO as f,vs as fn,W_ as ft,JD as g,Fi as gn,zh as gt,ID as h,Ci as hn,__ as ht,cO as i,os as in,zb as it,Sw as j,pi as jn,Cl as jt,Hw as k,fi as kn,mu as kt,XD as l,_s as ln,uv as lt,LD as m,aa as mn,p_ as mt,fO as n,Xo as nn,tt as nr,Bb as nt,nO as o,cs as on,Py as ot,KD as p,ss as pn,H_ as pt,sS as q,cr as qn,rc as qt,oO as r,as as rn,Ae as rr,cb as rt,uO as s,ns as sn,Fy as st,pO as t,qo as tn,ft as tr,Ib as tt,qD as u,rs as un,fv as ut,hD as v,wi as vn,Pf as vt,ET as w,Ii as wn,Vd as wt,tO as x,Bi as xn,Kf as xt,gD as y,Ri as yn,Qd as yt,yC as z,or as zn,_d as zt};
|