tla-ts 0.0.10-dev.cb7650c54 → 0.0.10-dev.f57f64938
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/dist/run.cjs +9 -9
- package/dist/run.js +9 -9
- package/dist/transfer.cjs +4 -4
- package/dist/transfer.js +4 -4
- package/package.json +1 -1
- package/src/cli/tlc-output.ts +3 -3
- package/src/cli/tlc-usage.ts +0 -1
- package/src/cli/tlc.ts +15 -1
- package/src/environment.ts +10 -5
- package/src/obligations/action.ts +0 -2
- package/src/obligations/anonymize.ts +0 -2
- package/src/obligations/equality.ts +0 -2
- package/src/obligations/expression.ts +0 -2
- package/src/obligations/format.ts +0 -2
- package/src/obligations/generate.ts +0 -2
- package/src/obligations/levels.ts +0 -2
- package/src/obligations/module.ts +0 -2
- package/src/obligations/normalize.ts +0 -2
- package/src/obligations/operators.ts +0 -2
- package/src/obligations/printer.ts +0 -2
- package/src/obligations/proof.ts +0 -2
- package/src/obligations/regroup.ts +0 -2
- package/src/obligations/simplify.ts +0 -2
- package/src/obligations/subexpression.ts +0 -2
- package/src/obligations/substitution.ts +0 -2
- package/src/obligations/temporal.ts +0 -2
- package/src/obligations/tuples.ts +0 -2
- package/src/pretty-print.ts +1 -1
- package/src/prover/isabelle/encode.ts +0 -2
- package/src/prover/isabelle/isar/attrib.ts +0 -4
- package/src/prover/isabelle/isar/context.ts +0 -4
- package/src/prover/isabelle/isar/induct.ts +0 -4
- package/src/prover/isabelle/isar/method.ts +0 -2
- package/src/prover/isabelle/isar/proof.ts +0 -2
- package/src/prover/isabelle/isar/rule-cases.ts +0 -2
- package/src/prover/isabelle/isar/toplevel.ts +0 -4
- package/src/prover/isabelle/isar/type-check.ts +0 -2
- package/src/prover/isabelle/provers/blast/blast.ts +0 -2
- package/src/prover/isabelle/provers/blast/branch.ts +0 -2
- package/src/prover/isabelle/provers/blast/prove.ts +0 -2
- package/src/prover/isabelle/provers/blast/rules.ts +0 -2
- package/src/prover/isabelle/provers/blast/state.ts +0 -2
- package/src/prover/isabelle/provers/blast/term.ts +0 -2
- package/src/prover/isabelle/provers/clasimp.ts +0 -2
- package/src/prover/isabelle/provers/classical.ts +0 -2
- package/src/prover/isabelle/provers/hypsubst.ts +0 -2
- package/src/prover/isabelle/pure/bicompose.ts +0 -2
- package/src/prover/isabelle/pure/consts.ts +0 -2
- package/src/prover/isabelle/pure/conv.ts +0 -2
- package/src/prover/isabelle/pure/drule.ts +0 -2
- package/src/prover/isabelle/pure/envir.ts +0 -2
- package/src/prover/isabelle/pure/goal.ts +0 -2
- package/src/prover/isabelle/pure/logic.ts +0 -2
- package/src/prover/isabelle/pure/name.ts +0 -2
- package/src/prover/isabelle/pure/net.ts +0 -2
- package/src/prover/isabelle/pure/object-logic.ts +0 -2
- package/src/prover/isabelle/pure/pattern.ts +0 -2
- package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
- package/src/prover/isabelle/pure/rewriter.ts +0 -2
- 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 +0 -2
- package/src/prover/isabelle/pure/table.ts +0 -2
- package/src/prover/isabelle/pure/tactic.ts +0 -2
- package/src/prover/isabelle/pure/tactical.ts +0 -2
- package/src/prover/isabelle/pure/term-ord.ts +0 -2
- package/src/prover/isabelle/pure/term.ts +0 -2
- package/src/prover/isabelle/pure/thm.ts +0 -2
- package/src/prover/isabelle/pure/type.ts +0 -2
- package/src/prover/isabelle/pure/unify.ts +0 -2
- package/src/prover/isabelle/pure/variable.ts +0 -2
- package/src/prover/isabelle/tla/classical-setup.ts +0 -2
- package/src/prover/isabelle/tla/simpdata.ts +0 -2
- package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
- package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
- package/src/prover/smt/solver/ackr-helper.ts +0 -3
- package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
- package/src/prover/smt/solver/act-cache.ts +0 -1
- package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
- package/src/prover/smt/solver/aig-tactic.ts +0 -1
- package/src/prover/smt/solver/aig.ts +2 -3
- package/src/prover/smt/solver/arith-rewriter.ts +0 -1
- package/src/prover/smt/solver/arith-terms.ts +0 -2
- package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/array-rewriter.ts +0 -1
- package/src/prover/smt/solver/asserted-formulas.ts +0 -1
- package/src/prover/smt/solver/ast-lt.ts +0 -1
- package/src/prover/smt/solver/ast-util.ts +0 -2
- package/src/prover/smt/solver/ast.ts +0 -1
- package/src/prover/smt/solver/auf-solver.ts +0 -1
- package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
- package/src/prover/smt/solver/bit-blaster.ts +0 -3
- package/src/prover/smt/solver/bound-manager.ts +0 -1
- package/src/prover/smt/solver/bound-simplifier.ts +0 -2
- package/src/prover/smt/solver/bv-bound-chk.ts +0 -2
- package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
- package/src/prover/smt/solver/bv-rewriter.ts +0 -2
- package/src/prover/smt/solver/bv1-blast.ts +0 -2
- package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
- package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
- package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
- package/src/prover/smt/solver/card2bv.ts +0 -2
- package/src/prover/smt/solver/case-split-queue.ts +0 -2
- package/src/prover/smt/solver/cg-table.ts +0 -2
- package/src/prover/smt/solver/check-logic.ts +0 -1
- package/src/prover/smt/solver/clause.ts +0 -1
- package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
- package/src/prover/smt/solver/conflict-resolution.ts +0 -1
- package/src/prover/smt/solver/context.ts +0 -1
- package/src/prover/smt/solver/ctx-simplify.ts +0 -1
- package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
- package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
- package/src/prover/smt/solver/demodulator.ts +0 -3
- package/src/prover/smt/solver/dependent-expr-state.ts +0 -3
- package/src/prover/smt/solver/der.ts +0 -1
- package/src/prover/smt/solver/diff-neq.ts +0 -1
- package/src/prover/smt/solver/distribute-forall.ts +0 -1
- package/src/prover/smt/solver/dom-simplify.ts +0 -2
- package/src/prover/smt/solver/dt2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/dyn-ack.ts +0 -1
- package/src/prover/smt/solver/e-matching.ts +0 -1
- package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
- package/src/prover/smt/solver/elim-uncnstr.ts +0 -2
- package/src/prover/smt/solver/enode.ts +0 -1
- package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/arith-internalize.ts +0 -2
- package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
- package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
- package/src/prover/smt/solver/euf/array-internalize.ts +0 -2
- package/src/prover/smt/solver/euf/array-solver.ts +0 -2
- package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
- package/src/prover/smt/solver/euf/bv-internalize.ts +0 -2
- package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
- package/src/prover/smt/solver/euf/dt-solver.ts +0 -2
- package/src/prover/smt/solver/euf/egraph.ts +0 -2
- package/src/prover/smt/solver/euf/euf-solver.ts +0 -3
- package/src/prover/smt/solver/euf/fpa-solver.ts +0 -2
- package/src/prover/smt/solver/euf/mam.ts +0 -2
- package/src/prover/smt/solver/euf/q-ematch.ts +0 -2
- package/src/prover/smt/solver/euf/q-mbi.ts +0 -2
- package/src/prover/smt/solver/euf/q-model-fixer.ts +0 -3
- package/src/prover/smt/solver/euf/q-solver.ts +0 -2
- package/src/prover/smt/solver/euf/th-solver.ts +0 -2
- package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
- package/src/prover/smt/solver/expr-ref.ts +0 -1
- package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
- package/src/prover/smt/solver/expr2polynomial.ts +0 -1
- package/src/prover/smt/solver/factor.ts +0 -1
- package/src/prover/smt/solver/fd-solver.ts +0 -3
- package/src/prover/smt/solver/fingerprints.ts +0 -1
- package/src/prover/smt/solver/fix-dl-var.ts +0 -1
- package/src/prover/smt/solver/flat-literals.ts +0 -1
- package/src/prover/smt/solver/fm-tactic.ts +0 -1
- package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/fpa-rewriter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-converter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
- package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/goal.ts +0 -1
- package/src/prover/smt/solver/goal2nlsat.ts +0 -2
- package/src/prover/smt/solver/guard-set.ts +0 -1
- package/src/prover/smt/solver/hash.ts +0 -1
- package/src/prover/smt/solver/hashtable.ts +0 -1
- package/src/prover/smt/solver/inf-eps.ts +1 -2
- package/src/prover/smt/solver/inj-axiom.ts +0 -1
- package/src/prover/smt/solver/internalizer.ts +0 -1
- package/src/prover/smt/solver/lackr.ts +0 -2
- package/src/prover/smt/solver/lbool.ts +0 -1
- package/src/prover/smt/solver/lia2card.ts +0 -1
- package/src/prover/smt/solver/lia2pb.ts +0 -1
- package/src/prover/smt/solver/literal.ts +0 -1
- package/src/prover/smt/solver/logic-tactics.ts +0 -4
- 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 +0 -1
- package/src/prover/smt/solver/lp/core-solver.ts +0 -3
- package/src/prover/smt/solver/lp/cross-nested.ts +0 -1
- package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
- package/src/prover/smt/solver/lp/dependency.ts +0 -2
- package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
- package/src/prover/smt/solver/lp/explanation.ts +0 -1
- package/src/prover/smt/solver/lp/gomory.ts +0 -1
- package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
- package/src/prover/smt/solver/lp/hnf.ts +0 -3
- package/src/prover/smt/solver/lp/int-cube.ts +0 -1
- package/src/prover/smt/solver/lp/int-solver.ts +0 -2
- package/src/prover/smt/solver/lp/lar-solver.ts +0 -1
- package/src/prover/smt/solver/lp/lar-term.ts +0 -1
- package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
- package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
- package/src/prover/smt/solver/lp/nex-creator.ts +0 -1
- package/src/prover/smt/solver/lp/nex.ts +0 -1
- package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
- package/src/prover/smt/solver/lp/nla-basics.ts +0 -2
- package/src/prover/smt/solver/lp/nla-core.ts +0 -1
- 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 +0 -1
- 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 +0 -1
- 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 +0 -2
- 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 +0 -2
- package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
- package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
- package/src/prover/smt/solver/lp/pdd.ts +2 -2
- 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 +0 -1
- package/src/prover/smt/solver/macro-finder.ts +0 -3
- package/src/prover/smt/solver/mam-compiler.ts +0 -1
- package/src/prover/smt/solver/mam-interpreter.ts +0 -1
- package/src/prover/smt/solver/max-bv-sharing-tactic.ts +0 -2
- package/src/prover/smt/solver/max-cliques.ts +0 -2
- package/src/prover/smt/solver/maxcore.ts +1 -2
- package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
- package/src/prover/smt/solver/maxlex.ts +0 -1
- package/src/prover/smt/solver/maxsmt-base.ts +0 -1
- package/src/prover/smt/solver/maxsmt.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-arith.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-plugin.ts +0 -2
- package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +0 -1
- package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
- package/src/prover/smt/solver/model-based-opt.ts +0 -1
- package/src/prover/smt/solver/model-checker.ts +0 -1
- package/src/prover/smt/solver/model-evaluator.ts +0 -1
- package/src/prover/smt/solver/model-finder.ts +0 -1
- package/src/prover/smt/solver/model-generator.ts +0 -1
- package/src/prover/smt/solver/model-macro-solver.ts +0 -1
- package/src/prover/smt/solver/model-printer.ts +0 -1
- package/src/prover/smt/solver/mpf.ts +0 -1
- package/src/prover/smt/solver/mus.ts +0 -1
- package/src/prover/smt/solver/muz/dl-context.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
- package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-slice.ts +0 -1
- package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +0 -2
- package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
- package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -2
- package/src/prover/smt/solver/muz/dl-rule.ts +0 -2
- package/src/prover/smt/solver/muz/hnf.ts +0 -1
- package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +0 -2
- package/src/prover/smt/solver/muz/horn-tactic.ts +0 -2
- package/src/prover/smt/solver/muz/rule-properties.ts +0 -1
- package/src/prover/smt/solver/muz/spacer-context.ts +0 -1
- package/src/prover/smt/solver/muz/spacer-dl-interface.ts +0 -1
- package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
- package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
- package/src/prover/smt/solver/muz/spacer-pdr.ts +0 -1
- package/src/prover/smt/solver/muz/spacer-prop-solver.ts +1 -2
- package/src/prover/smt/solver/muz/spacer-util.ts +0 -1
- package/src/prover/smt/solver/muz/substitution.ts +0 -2
- package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
- package/src/prover/smt/solver/nlqsat.ts +2 -2
- package/src/prover/smt/solver/nlsat/algebraic.ts +0 -2
- package/src/prover/smt/solver/nlsat/atoms.ts +0 -2
- package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
- package/src/prover/smt/solver/nlsat/explain.ts +0 -1
- package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
- package/src/prover/smt/solver/nlsat/levelwise.ts +2 -3
- package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
- package/src/prover/smt/solver/nlsat/polynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat/solver.ts +3 -4
- package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
- package/src/prover/smt/solver/nlsat/transcendentals.ts +0 -2
- package/src/prover/smt/solver/nlsat/types.ts +0 -2
- package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +0 -3
- package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
- package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
- package/src/prover/smt/solver/nnf.ts +0 -1
- package/src/prover/smt/solver/normalize-bounds.ts +0 -1
- package/src/prover/smt/solver/occf.ts +0 -1
- package/src/prover/smt/solver/opt-context.ts +1 -2
- package/src/prover/smt/solver/opt-nlsat.ts +0 -1
- package/src/prover/smt/solver/opt-pareto.ts +0 -2
- package/src/prover/smt/solver/opt-preprocess.ts +0 -1
- package/src/prover/smt/solver/opt-solver.ts +0 -1
- package/src/prover/smt/solver/opt-value.ts +0 -1
- package/src/prover/smt/solver/optsmt.ts +0 -2
- package/src/prover/smt/solver/parallel-tactic.ts +0 -2
- package/src/prover/smt/solver/pattern-inference.ts +0 -1
- package/src/prover/smt/solver/pb-rewriter.ts +0 -3
- package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
- package/src/prover/smt/solver/poly-rewriter.ts +0 -1
- package/src/prover/smt/solver/probes.ts +2 -4
- package/src/prover/smt/solver/propagate-values.ts +0 -1
- package/src/prover/smt/solver/proto-model.ts +0 -1
- package/src/prover/smt/solver/pull-quant.ts +0 -1
- package/src/prover/smt/solver/purify-arith.ts +0 -1
- package/src/prover/smt/solver/qe-arith-plugin.ts +0 -2
- package/src/prover/smt/solver/qe-lite-der.ts +0 -1
- package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
- package/src/prover/smt/solver/qe-lite.ts +0 -1
- package/src/prover/smt/solver/qe-mbp.ts +0 -1
- package/src/prover/smt/solver/qe.ts +0 -2
- package/src/prover/smt/solver/qel.ts +0 -1
- package/src/prover/smt/solver/qi-queue.ts +0 -1
- package/src/prover/smt/solver/qsat.ts +0 -1
- package/src/prover/smt/solver/quant-hoist.ts +0 -1
- package/src/prover/smt/solver/quant-tactics.ts +0 -1
- package/src/prover/smt/solver/quantifier-analyzer.ts +0 -1
- package/src/prover/smt/solver/quantifier-manager.ts +0 -1
- package/src/prover/smt/solver/quasi-macros.ts +0 -2
- package/src/prover/smt/solver/random-gen.ts +0 -1
- package/src/prover/smt/solver/rational.ts +0 -1
- package/src/prover/smt/solver/recfun-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/recfun-rewriter.ts +0 -1
- package/src/prover/smt/solver/reduce-args.ts +0 -1
- package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
- package/src/prover/smt/solver/ref-vector.ts +0 -1
- package/src/prover/smt/solver/relevancy.ts +0 -1
- package/src/prover/smt/solver/rewriter-tpl.ts +0 -1
- package/src/prover/smt/solver/rewriter.ts +0 -1
- package/src/prover/smt/solver/rlimit.ts +0 -1
- package/src/prover/smt/solver/sat/asymm-branch.ts +0 -2
- package/src/prover/smt/solver/sat/big.ts +0 -1
- package/src/prover/smt/solver/sat/clause-use-list.ts +0 -2
- package/src/prover/smt/solver/sat/clause.ts +0 -3
- package/src/prover/smt/solver/sat/cleaner.ts +0 -2
- package/src/prover/smt/solver/sat/config.ts +0 -3
- package/src/prover/smt/solver/sat/consequences.ts +0 -1
- package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
- package/src/prover/smt/solver/sat/goal2sat.ts +0 -2
- package/src/prover/smt/solver/sat/inc-sat-solver.ts +0 -1
- package/src/prover/smt/solver/sat/model-converter.ts +0 -2
- package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
- package/src/prover/smt/solver/sat/pb-solver.ts +0 -2
- package/src/prover/smt/solver/sat/probing.ts +0 -2
- package/src/prover/smt/solver/sat/sat-tactic.ts +0 -1
- package/src/prover/smt/solver/sat/sat2goal.ts +0 -2
- package/src/prover/smt/solver/sat/scc.ts +0 -1
- package/src/prover/smt/solver/sat/simplifier.ts +0 -3
- package/src/prover/smt/solver/sat/solver.ts +0 -2
- package/src/prover/smt/solver/sat/var-queue.ts +0 -2
- package/src/prover/smt/solver/sat/watch-list.ts +0 -3
- package/src/prover/smt/solver/search-tree.ts +0 -1
- package/src/prover/smt/solver/seq-axioms.ts +0 -1
- package/src/prover/smt/solver/seq-decl-plugin.ts +0 -1
- package/src/prover/smt/solver/seq-derive.ts +0 -2
- package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
- package/src/prover/smt/solver/seq-eq-solver.ts +0 -1
- package/src/prover/smt/solver/seq-factory.ts +0 -1
- package/src/prover/smt/solver/seq-monadic.ts +0 -2
- package/src/prover/smt/solver/seq-range-predicate.ts +0 -2
- package/src/prover/smt/solver/seq-re-rewriter.ts +0 -1
- package/src/prover/smt/solver/seq-re-util.ts +0 -2
- package/src/prover/smt/solver/seq-regex-bisim.ts +0 -1
- package/src/prover/smt/solver/seq-regex-live.ts +0 -2
- package/src/prover/smt/solver/seq-rewriter.ts +0 -2
- package/src/prover/smt/solver/seq-skolem.ts +0 -1
- package/src/prover/smt/solver/seq-subset.ts +0 -1
- package/src/prover/smt/solver/seq-view-witness.ts +0 -2
- package/src/prover/smt/solver/smt-consequences.ts +0 -2
- package/src/prover/smt/solver/smt-kernel.ts +0 -2
- package/src/prover/smt/solver/smt-logics.ts +0 -1
- package/src/prover/smt/solver/smt-setup.ts +3 -5
- package/src/prover/smt/solver/smt2-printer.ts +0 -2
- package/src/prover/smt/solver/smtlib-parser.ts +0 -2
- package/src/prover/smt/solver/smtlib-script.ts +0 -2
- package/src/prover/smt/solver/solve-eqs.ts +0 -2
- package/src/prover/smt/solver/solver.ts +1 -2
- package/src/prover/smt/solver/static-features.ts +0 -2
- package/src/prover/smt/solver/sticky-generations.ts +0 -1
- package/src/prover/smt/solver/tactic.ts +0 -2
- package/src/prover/smt/solver/term-enumeration.ts +0 -1
- package/src/prover/smt/solver/theory-array.ts +0 -2
- package/src/prover/smt/solver/theory-bv.ts +0 -2
- package/src/prover/smt/solver/theory-char.ts +0 -1
- package/src/prover/smt/solver/theory-datatype.ts +0 -1
- package/src/prover/smt/solver/theory-finite-set.ts +2 -2
- package/src/prover/smt/solver/theory-fpa.ts +0 -1
- package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
- package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
- package/src/prover/smt/solver/theory-lra-final-check.ts +0 -1
- package/src/prover/smt/solver/theory-lra-internalize.ts +0 -1
- package/src/prover/smt/solver/theory-lra-model.ts +0 -1
- package/src/prover/smt/solver/theory-lra-propagate.ts +0 -1
- package/src/prover/smt/solver/theory-lra-state.ts +0 -1
- package/src/prover/smt/solver/theory-lra.ts +0 -1
- package/src/prover/smt/solver/theory-pb.ts +0 -2
- package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
- package/src/prover/smt/solver/theory-recfun.ts +0 -1
- package/src/prover/smt/solver/theory-seq-regex.ts +0 -1
- package/src/prover/smt/solver/theory-seq-solve.ts +0 -2
- package/src/prover/smt/solver/theory-seq-state.ts +0 -2
- package/src/prover/smt/solver/theory-seq.ts +0 -1
- package/src/prover/smt/solver/theory.ts +0 -1
- package/src/prover/smt/solver/tseitin-cnf.ts +0 -2
- package/src/prover/smt/solver/var-subst.ts +0 -1
- package/src/prover/zenon/decide.ts +0 -2
- package/src/prover/zenon/encode.ts +0 -2
- package/src/prover/zenon/eqrel.ts +0 -2
- package/src/prover/zenon/equality-rules.ts +0 -2
- package/src/prover/zenon/expr.ts +0 -2
- package/src/prover/zenon/index-table.ts +0 -2
- package/src/prover/zenon/isar-case.ts +0 -2
- package/src/prover/zenon/isar.ts +0 -2
- package/src/prover/zenon/llproof.ts +0 -2
- package/src/prover/zenon/mltoll.ts +0 -2
- package/src/prover/zenon/node.ts +0 -2
- package/src/prover/zenon/parse.ts +0 -2
- package/src/prover/zenon/phrase.ts +0 -2
- package/src/prover/zenon/proof.ts +0 -2
- package/src/prover/zenon/propositional-rules.ts +0 -2
- package/src/prover/zenon/rules.ts +0 -2
- package/src/prover/zenon/search.ts +0 -2
- package/src/prover/zenon/tla/functions.ts +0 -2
- package/src/prover/zenon/tla/llproof.ts +0 -2
- package/src/prover/zenon/tla/records.ts +0 -2
- package/src/prover/zenon/tla/rewrites.ts +0 -2
- package/src/prover/zenon/tla/sets.ts +0 -2
- package/src/prover/zenon/tla/terms.ts +0 -2
- package/src/prover/zenon/tla/tla.ts +0 -2
- package/src/resolve.ts +1 -2
- package/src/runtime.ts +4 -0
- package/src/sany/levels.ts +0 -2
- package/src/sany/linter.ts +0 -2
- package/src/search.ts +29 -20
- package/src/standard-definitions.ts +4 -0
- package/src/state-graph.ts +0 -2
- package/src/tlc/tlcext-operators.ts +44 -12
- package/src/prover/smt/solver/z3-license.txt +0 -10
- package/src/prover/zenon/LICENSE +0 -32
package/dist/run.cjs
CHANGED
|
@@ -6,7 +6,7 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs"),r=require("./tlapm.cjs");let i=require("node:path"),a=require("node:fs"),o=require("node:url"),s=require("node:child_process"),c=require("node:os"),l=require("node:v8");const u=`META-INF/MANIFEST.MF`,d=async e=>{if(e===void 0||!(0,a.existsSync)(e))return`master`;let t=await import(`fflate`),n=t.unzipSync((0,a.readFileSync)(e),{filter:e=>e.name===u})[u];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},f=/[*?[{]/,p=e=>e.flatMap(e=>f.test(e)?(0,a.globSync)(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),m=(e,t)=>e.map(e=>(0,i.join)(e,`${t}.tla`)).find(a.existsSync),h=e=>t=>{let n=m(e,t);return n===void 0?void 0:(0,a.readFileSync)(n,`utf8`)},g=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),_=e=>`jar:file:${(0,o.pathToFileURL)((0,i.resolve)(e)).pathname}!/tla2sany/StandardModules/`,v=t=>t instanceof e.V?e.it(t.code):e.Q(t),y=(n,r)=>{if(n instanceof e._||n instanceof e.b){let i=t.sn(n.message),a=n instanceof e.V?n.code:i&&!i.isEvalException?i.code:t.en.general;return r.print(a,t.tn.error,t.rn(a,n.message,r.isTool))}console.error(`${n.name}: ${n.message}`)},b=async(n,r=t.nn({isTool:!1}))=>{try{return await n()}catch(t){if(!(t instanceof e.y))throw t;return y(t,r),v(t)}},x=(e,t,n)=>console.error(`File does not exist: ${(0,i.isAbsolute)(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[_(n)]].join(`, `)}`),S=e=>e.endsWith(`/`)?e:`${e}/`,C=(e,n)=>r=>{let i=e(r);return i===void 0&&!t.ct.has(r)&&n(`${r}.tla`),i},w=e=>e.classPath?.split(i.delimiter).find(e=>e.endsWith(`.jar`));var T=`0.0.10-dev.
|
|
9
|
+
const e=require("./worker.cjs"),t=require("./transfer.cjs"),n=require("./prove.cjs"),r=require("./tlapm.cjs");let i=require("node:path"),a=require("node:fs"),o=require("node:url"),s=require("node:child_process"),c=require("node:os"),l=require("node:v8");const u=`META-INF/MANIFEST.MF`,d=async e=>{if(e===void 0||!(0,a.existsSync)(e))return`master`;let t=await import(`fflate`),n=t.unzipSync((0,a.readFileSync)(e),{filter:e=>e.name===u})[u];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},f=/[*?[{]/,p=e=>e.flatMap(e=>f.test(e)?(0,a.globSync)(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),m=(e,t)=>e.map(e=>(0,i.join)(e,`${t}.tla`)).find(a.existsSync),h=e=>t=>{let n=m(e,t);return n===void 0?void 0:(0,a.readFileSync)(n,`utf8`)},g=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),_=e=>`jar:file:${(0,o.pathToFileURL)((0,i.resolve)(e)).pathname}!/tla2sany/StandardModules/`,v=t=>t instanceof e.V?e.it(t.code):e.Q(t),y=(n,r)=>{if(n instanceof e._||n instanceof e.b){let i=t.sn(n.message),a=n instanceof e.V?n.code:i&&!i.isEvalException?i.code:t.en.general;return r.print(a,t.tn.error,t.rn(a,n.message,r.isTool))}console.error(`${n.name}: ${n.message}`)},b=async(n,r=t.nn({isTool:!1}))=>{try{return await n()}catch(t){if(!(t instanceof e.y))throw t;return y(t,r),v(t)}},x=(e,t,n)=>console.error(`File does not exist: ${(0,i.isAbsolute)(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[_(n)]].join(`, `)}`),S=e=>e.endsWith(`/`)?e:`${e}/`,C=(e,n)=>r=>{let i=e(r);return i===void 0&&!t.ct.has(r)&&n(`${r}.tla`),i},w=e=>e.classPath?.split(i.delimiter).find(e=>e.endsWith(`.jar`));var T=`0.0.10-dev.f57f64938`;const E=2224400062,D={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},O={smallInt:64,smallString:32,smallBlock:128},k=(e,...t)=>({tag:e,fields:t}),A=e=>typeof e==`object`&&`tag`in e,ee=(t,n)=>{let r=new DataView(t.buffer,t.byteOffset,t.byteLength);if(t.length<n+20||r.getUint32(n)!==E)throw new e.A(`corrupted fingerprint file`);let i=n+20+r.getUint32(n+4),a=[],o=n+20,s=t=>{let n=o;if(o+=t,o>i)throw new e.A(`corrupted fingerprint file`);return n},c=new TextDecoder,l=e=>{let n=s(e),r=c.decode(t.subarray(n,n+e));return a.push(r),r},u=(e,t)=>{let n=k(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let n=t[s(1)];if(n>=O.smallBlock)return u(n&15,n>>4&7);if(n>=O.smallInt)return n&63;if(n>=O.smallString)return l(n&31);switch(n){case D.int8:return r.getInt8(s(1));case D.int16:return r.getInt16(s(2));case D.int32:return r.getInt32(s(4));case D.shared8:return d(r.getUint8(s(1)));case D.shared16:return d(r.getUint16(s(2)));case D.shared32:return d(r.getUint32(s(4)));case D.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case D.string8:return l(r.getUint8(s(1)));case D.string32:return l(r.getUint32(s(4)));case D.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new e.A(`corrupted fingerprint file`)};return{value:f(),next:i}},te=e=>{let t=[],n=0,r=0,i=0,a=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},o=new TextEncoder,s=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(O.smallInt+e):e>=-128&&e<128?t.push(D.int8,e&255):e>=-32768&&e<32768?(t.push(D.int16),a(e,2)):(t.push(D.int32),a(e,4));if(n++,typeof e==`string`){let n=o.encode(e);n.length<32?t.push(O.smallString+n.length):n.length<256?t.push(D.string8,n.length):(t.push(D.string32),a(n.length,4)),t.push(...n),r+=1+Math.floor((n.length+4)/4),i+=1+Math.floor((n.length+8)/8);return}if(!A(e)){let n=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));n.setFloat64(0,e.float,!0),t.push(D.doubleLittle,...new Uint8Array(n.buffer)),r+=3,i+=2;return}let c=e.fields.length;c===0?n--:(r+=1+c,i+=1+c),e.tag<16&&c<8?t.push(O.smallBlock+e.tag+(c<<4)):(t.push(D.block32),a(c*1024+e.tag,4)),e.fields.forEach(s)};s(e);let c=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[E,t.length,n,r,i].forEach((e,t)=>c.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(c.buffer),...t])},ne=20210223,j=[...n.c,`cooper`,`expandenabled`,`expandcdot`,`lambdify`,`enabledaxioms`,`levelcomparison`],M={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},cooper:{field:4,tag:3,isConstant:!0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16},expandenabled:{field:18,tag:6,isConstant:!0},expandcdot:{field:19,tag:8,isConstant:!0},lambdify:{field:20,tag:9,isConstant:!0},enabledaxioms:{field:21,tag:10,isConstant:!0},levelcomparison:{field:22,tag:11,isConstant:!0}},re=[`false`,`timeout`],ie=`tla-ts ${T}`,ae=/* @__PURE__ */ new Map([[M.zenon.field,3],[M.isabelle.field,4]]),N=(e,t)=>e!==void 0&&A(e)?e.fields[t]:void 0,oe=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,se=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},P=e=>e!==void 0&&A(e)?[[e.fields[0],e.fields[1]],...P(e.fields[2])]:[],ce=(t,n,r)=>{let i=(0,a.readFileSync)(n),o=ee(i,0),s=ee(i,o.next).value;if(o.value!==ne||!A(s)||s.tag!==0)throw new e.A(`corrupted fingerprint file`);let c=N(N(s,0),1),l=(e,t)=>{let n=ae.get(t);return!r||n===void 0||N(N(e,0),n)===ie};t.clear(),(c!==void 0&&A(c)?c.fields:[]).flatMap(e=>P(e).toReversed()).forEach(([n,r])=>{if(typeof n!=`string`||!A(r))throw new e.A(`corrupted fingerprint file`);t.set(n,r.fields.map((e,t)=>l(e,t)?e:0))})},le=(e,t)=>{let n=N(t,0),r=N(n,0),i=N(N(n,1),0);if(r===void 0||r===1)return;let a=oe(N(e===`isabelle`?N(i,0):i,0)),o=e===`isabelle`?N(i,1):void 0,s=N(N(r,0),0);return{kind:`stored`,method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,...s!==void 0&&{reason:typeof s==`number`?re[s]:String(N(s,0))}}},ue=(e,t)=>{let r=/* @__PURE__ */ new Date,i=t.method,a={float:n.u(i)},o=e===`zenon`?k(0,a,5):e===`isabelle`?k(0,k(0,a),i.tactic??`auto`):k(0,a),s=n.i(t),c=re.indexOf(s??``),l=s===void 0?0:k(0,c===-1?k(0,s):c);return k(0,k(0,k(0,n.a(t)?0:k(0,l),M[e].isConstant?M[e].tag:k(M[e].tag,o)),k(0,r.getFullYear(),r.getMonth(),r.getDate(),r.getHours(),r.getMinutes(),r.getSeconds()),ie,ie,ie))},de=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=se(r)&t-1;n[i]=k(0,r,k(0,...e),n[i])}),k(0,k(0,e.size,k(0,...n),0,512))},fe=e=>String(e).padStart(2,`0`),pe=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,o=(0,i.join)(r,`${n.getFullYear()}-${fe(n.getMonth()+1)}-${fe(n.getDate())}_${fe(n.getHours())}_${fe(n.getMinutes())}_${fe(n.getSeconds())}`);(0,a.mkdirSync)(o,{recursive:!0}),[e,...t].filter(e=>(0,a.existsSync)(e)).forEach(e=>(0,a.cpSync)(e,(0,i.join)(o,(0,i.basename)(e)),{preserveTimestamps:!0})),(0,a.readdirSync)(r).map(e=>(0,i.join)(r,e)).sort((e,t)=>(0,a.statSync)(t).mtimeMs-(0,a.statSync)(e).mtimeMs).slice(10).forEach(e=>(0,a.rmSync)(e,{recursive:!0,force:!0}))},me=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(j.flatMap(e=>{let n=r[M[e].field],i=le(e,N(n,0));return i?(t.set(i,n),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];j.forEach(e=>{let n=r.get(e);n&&(a[M[e].field]=t.get(n)??ue(e,n))}),e.set(i,a)}),(0,a.writeFileSync)(`${i}.tmp`,Buffer.concat([te(ne),te(de(e))])),(0,a.renameSync)(`${i}.tmp`,i)}}},he=((e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,n.length]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[];for(let a=0;a<e.length;a++){let o=n.get(e[a]);o===void 0?(e[a].startsWith(`-`)?i:r).push(e[a]):(t.push({name:e[a],values:e.slice(a+1,a+1+o)}),a+=o)}return{options:t,positionals:r,unknown:i,incomplete:t.find(e=>e.values.length<(n.get(e.name)??0)),has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}})(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`},{flag:`--debug <flags>`,isRepeatable:!0},{flag:`--method <methods>`},{flag:`--solver <command>`},{flag:`--smt-logic <logic>`},{flag:`--stretch <factor>`},{flag:`--noflatten`}]),ge=[`Usage: tla-ts <Spec.tla|Spec.cfg|spec.ts|glob>... [-config <Spec.cfg>] [-continue] [-deadlock] [-dump [<format>] <file>] [-fp <num>] [-lncheck <final|default|off>] [-maxSetSize <num>] [-metadir <directory>] [-nowarning] [-seed <num>] [-terse] [-tool] [-view] [-workers <count|auto>]`,` ${he.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
10
10
|
`),F={name:``,values:[],doc:` `},_e=[F,{name:`(basic options)`,values:[],doc:` `},F,{name:`--help`,values:[],doc:` show this help message and exit`},{name:`-help`,values:[],doc:` (same as --help)`},{name:`--version`,values:[],doc:` show version number and exit`},{name:`--verbose`,values:[],doc:` produce verbose messages`},{name:`-v`,values:[],doc:` (same as --verbose)`},F,{name:`--where`,values:[],doc:` show location of standard library and exit`},{name:`--config`,values:[],doc:` show configuration and exit`},{name:`--summary`,values:[],doc:` show summary of theorems (implies -N and not -C)`},{name:`--strict`,values:[],doc:` report incomplete proofs, empty proof targets and failed obligations as errors and exit with a non-zero status`},{name:`--timing`,values:[],doc:` show runtime statistics`},F,{name:`-I`,values:[`string`],doc:`<dir> add <dir> to search path`},{name:`-d`,values:[`string`],doc:``},F,{name:`-k`,values:[],doc:` keep going on backend failures`},{name:`-N`,values:[],doc:` do not run any backend verifiers`},{name:`-C`,values:[],doc:` check proofs in Isabelle/TLA+`},F,{name:`--threads`,values:[`int`],doc:`<int> set number of worker threads to <int>`},{name:`--method`,values:[`string`],doc:`<meth> set default method to <meth> (try --method help)`},{name:`--solver`,values:[`string`],doc:`<solver> set SMT solver to <solver>`},{name:`--smt-logic`,values:[`string`],doc:`<logic> set SMT logic to <logic>`},{name:`--stretch`,values:[`float`],doc:`<f> multiply all timeouts by <f>`},{name:`--fast-isabelle`,values:[],doc:``},F,{name:`(advanced options)`,values:[],doc:` `},F,{name:`--noflatten`,values:[],doc:` do not flatten obligations`},{name:`--nonormal`,values:[],doc:` do not normalize obligations before printing`},{name:`--debug`,values:[`string`],doc:`{[-]<flag>} enable/disable debugging flags`},{name:`--paranoid`,values:[],doc:``},{name:`--isaprove`,values:[],doc:``},F,{name:`--toolbox`,values:[`int`,`int`],doc:`<int><int> toolbox mode`},{name:`--toolbox-vsn`,values:[`int`],doc:`<int> Toolbox protocol version, 1|2, 1 by default.`},{name:`--line`,values:[`int`],doc:`<int> line to prove`},{name:`--wait`,values:[`int`],doc:`<time> wait for <time> before printing obligations in progress`},{name:`--stdin`,values:[],doc:` read the tla file from stdin instead of file system. Only applies if single tla file is provided as input.`},{name:`--prefer-stdlib`,values:[],doc:` prefer built-in standard modules if the module search path contains files with the same names as modules in stdlib.`},{name:`--parser`,values:[`string`],doc:` Set parser backend to use: TLAPM (default) or SANY.`},{name:`--module-jar`,values:[`string`],doc:` Add a path to a .jar file containing additional TLA+ modules, such
|
|
11
11
|
as the community modules. Multiple .jar files can be added by using
|
|
12
12
|
this option multiple times.`},{name:`--noproving`,values:[],doc:` do not prove, report fingerprinted results only`},F,{name:`--printallobs`,values:[],doc:` print obligations in all toolbox messages`},F,{name:`--fpdir`,values:[`string`],doc:``},{name:`--safefp`,values:[],doc:` check tlapm, zenon, Isabelle versions for fingerprints`},{name:`--nofp`,values:[],doc:` do not use existing fingerprints, but overwrite any preexisting fingerprints associated with the current proof obligations, using the newly computed fingerprints and results`},{name:`--nofpl`,values:[`int`,`int`],doc:`<int><int> disable fingerprint use between given lines`},{name:`--cleanfp`,values:[],doc:` erase fingerprint file before starting`},F,{name:`--erasefp`,values:[`string`,`string`],doc:`<f><back> erase from file <f> all results of backend <back>`},{name:`--printfp`,values:[`string`],doc:`<f> print the fingerprints stored in file <f> and quit`},{name:`--usefp`,values:[`string`],doc:`<f> load fingerprints from file <f> (save as usual)`},{name:`--fpp`,values:[],doc:` print the fingerprints of obligations in toolbox messages`},{name:`--cache-dir`,values:[`string`],doc:'<directory> save auxiliary and temporary files under <directory>. Alternatively, this directory can be defined via the variable `TLAPM_CACHE_DIR` of the runtime environment. The command-line parameter takes precedence over the environment variable. If neither is specified, the default value is ".tlacache".'}],ve=e=>/^[^ ]* */.exec(e)?.[0].length??0,ye=()=>{let e=Math.max(..._e.map(e=>e.name.length+ve(e.doc)));return`Usage: tla-ts tlapm <options> FILE ...\noptions are:\n${_e.filter(e=>e.doc!==``).map(t=>{let n=ve(t.doc);return` ${t.name} ${t.doc.slice(0,n)}${` `.repeat(e-t.name.length-n)}${t.doc.slice(n)}\n`}).join(``)}`},be=t=>{for(let r=0;r<t.length;r++){let i=t[r];if(i===`--version`)return;if(!i.startsWith(`-`))continue;let a=_e.find(e=>e.name===i);if(!a)return`unknown option '${i}'`;for(let e of a.values){if(r++,r===t.length)return`option '${i}' needs an argument`;let a=t[r];if(e===`int`&&n.p(a)===void 0)return`wrong argument '${a}'; option '${i}' expects an integer`;if(e===`float`&&n.f(a)===void 0)return`wrong argument '${a}'; option '${i}' expects a float`}let o=t[r];if(i===`--threads`&&(n.p(o)??0)<0)return`--threads requires a positive argument`;if(i===`--debug`&&o.split(`,`).includes(`oldsmt`))return`--debug oldsmt: the old SMT encoding has been removed`;if(i===`--method`)try{n.d(o)}catch(t){if(!(t instanceof e.j))throw t;return t.message}}},xe=e=>[`.`,...r.t().map(e=>(0,i.join)((0,i.dirname)((0,i.dirname)((0,a.realpathSync)(e))),`lib/tlapm/stdlib`)).filter(a.existsSync).slice(0,1),...e.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],Se=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),Ce=(e,t,n)=>Se([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),we=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,Te={failed:10,incomplete:11,emptyTarget:12},Ee=(e,t,r)=>{let i=e.summary;r||(i.absent.forEach(e=>console.error(`Missing proof at ${n.x(e)}`)),i.omitted.forEach(e=>console.error(`Omitted proof at ${n.x(e)}`)));let a=i.absent.length+i.omitted.length>0;a&&console.error(`${n.b(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${i.absent.length} missing, ${i.omitted.length} omitted proof step(s).`);let o=t&&e.obligations.length===0;return o&&console.error(`${n.b(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...a?[Te.incomplete]:[],...o?[Te.emptyTarget]:[]]},De=(e,t,n)=>{console.error(` tlapm ending abnormally with ${e.exception}\n`),n&&Se(t.message===``?[`type:error`,`url:http://tla.msr-inria.inria.fr/bugs`,`msg:Oops, this seems to be a bug in TLAPM.\nPlease give feedback to developers.\n\n\n ${e.exception}\n`]:[`type:warning`,`msg:${t.location===void 0?``:`${t.location}\n\n`}${t.message}`])},Oe=t=>{if(!(t instanceof e.A))throw t;return{kind:`aborted`,error:t}},ke=e=>{try{return{kind:`done`,value:e()}}catch(e){return Oe(e)}},Ae=(e,t,r)=>{let i=t.method.timeLimitMs,a=t.kind===`decided`?`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/i)}%)`:``,o=i===0?``:`time-limit: ${i===1/0?`inf`:Number((i/1e3).toPrecision(6))}${a}`,s=[t.method.tactic,o].filter(Boolean).join(`; `),c=n.i(t),l=n.a(t),u=t.kind===`reused`,d=t.kind===`decided`?t.note:t.kind===`refused`?`${t.reason}\nObligation:\n\n`:t.kind===`unavailable`?`\n\\* ${t.warning}\n`:void 0,f=t.kind===`unavailable`||u?t.shipped:void 0;Ce(e,l?`proved`:`failed`,[`prover:${t.method.prover}`,...s===``?[]:[`meth:${s}`],...c===void 0?[]:[`reason:${c}`],`already:${u}`,...l?[]:[`obl:${u?``:d??`
|
|
@@ -44,7 +44,7 @@ Temporal formula used as set.`)),Ga(e,e.set)),e.levelCorrect;case`AssumeProve`:r
|
|
|
44
44
|
`:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,vs=e=>e.filter((t,n)=>t!==e[n-1]).map((e,n)=>`${n}) ${t.K(e)}\n`).toReversed().join(``),ys=e=>{if(e.length===0)return` The error call stack is empty.
|
|
45
45
|
`;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},bs=(e,n)=>{let r=n.generated,i=n.distinct,a=t.an(/* @__PURE__ */ new Date);r===i?e.print(t.en.initGenerated1,t.tn.none,`Finished computing initial states: ${i} distinct state${i===1?``:`s`} generated at ${a}.`):e.print(t.en.initGenerated2,t.tn.none,`Finished computing initial states: ${r} state${r===1?``:`s`} generated, with ${i} of them distinct at ${a}.`)},xs=(e,n,r)=>{let i=Math.max(Date.now()-(r??0),1)/6e4,a=e=>e.toLocaleString(`en-US`),o=(e,t)=>r===void 0?``:` (${a(Math.floor(e/i))} ${t}/min)`;e.print(t.en.progress,t.tn.none,`Progress(${Math.max(n.depth,1)}) at ${t.an(/* @__PURE__ */ new Date)}: ${a(n.generatedStates)} states generated${o(n.generatedStates,`s`)}, ${a(n.distinctStates)} distinct states found${o(n.distinctStates,`ds`)}, ${a(n.queuedStates)} states left on queue.`)},Ss={init:t.en.coverageInit,next:t.en.coverageNext,invariant:t.en.coverageProperty,implied:t.en.coverageProperty,constraint:t.en.coverageConstraint},Cs=(e,n,r)=>{let i=(n,r)=>e.print(n,t.tn.none,r);i(t.en.coverageStart,`The coverage statistics at ${t.an(/* @__PURE__ */ new Date)} (see https://explain.tlapl.us/module-coverage-statistics for how to interpret the following statistics).`),n.variables.forEach(e=>i(t.en.coverageVariable,`<${e.label}>: ${e.distinct}`)),n.relations.forEach(e=>{let n=Ss[e.kind];i(n,n===t.en.coverageProperty?`<${e.label}>`:`<${e.label}>: ${e.distinct}:${e.generated}`),e.expressions.forEach(e=>{let n=` ${`|`.repeat(e.depth)}${e.location}`;e.cost>0?i(t.en.coverageValueCost,`${n}: ${e.count}:${e.cost}`):i(t.en.coverageValue,`${n}: ${e.count}`)})}),Date.now()-r>3e5?i(t.en.coverageEndOverhead,`End of statistics (please note that for performance reasons large models
|
|
46
46
|
are best checked with coverage and cost statistics disabled).`):i(t.en.coverageEnd,`End of statistics.`)},ws=(e,t)=>(0,i.join)(e,`${t}.class`),Ts=(e,n,r,a)=>{let s=e.print;switch(n.kind){case`parsed`:r.isParsed=!0,e.isTool&&s(t.en.sanyFinished,t.tn.none,`SANY finished.`),s(t.en.starting,t.tn.none,`Starting... (${t.an(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;s(t.en.constantLevelInvariant,t.tn.warning,`The invariant ${n.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;s(t.en.stateLevelProperty,t.tn.warning,`The formula ${n.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${n.name} holds in all states of every behavior, use INVARIANT ${n.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${n.name} changes it into a temporal formula, asserting that ${n.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:n.isSymmetric&&s(t.en.livenessSymmetry,t.tn.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),n.isConstrained&&e.version===`1.7.4`&&s(t.en.livenessConstraints,t.tn.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:s(t.en.temporalBranches,t.tn.none,`Implied-temporal checking--satisfiability problem has ${n.branches} branches.`);return;case`java-override`:{let e=(0,o.pathToFileURL)((0,i.resolve)(ws(a,n.module))).href;s(n.isMatched?t.en.javaOverrideLoaded:t.en.javaOverrideMismatch,n.isMatched?t.tn.none:t.tn.warning,`${n.isMatched?`Loading`:`Failed to match`} ${n.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${n.signature}>.`);return}case`initial-states-started`:s(t.en.computingInit,t.tn.none,`Computing initial states...`);return;case`initial-states-progress`:us(e,n.count);return;case`initial-states-computed`:bs(e,n.initialStates);return;case`progress`:xs(e,n.statistics,r.startTime),n.statistics.coverage&&Cs(e,n.statistics.coverage,r.startTime);return;case`liveness-started`:{r.livenessStartTime=Date.now(),n.isComplete&&xs(e,n.statistics);let i=n.branches>1?`${n.branches} branches of `:``,a=n.branches*n.states;s(t.en.checkingTemporal,t.tn.none,`Checking ${i}temporal properties for the ${n.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${t.an(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Es(e,r);return;case`sequential-fallback`:process.stderr.write(`Warning: the search ordered the string ${JSON.stringify(n.string)} against another string it created, so tla-ts checks the model again with one worker. Workers don't agree on the order of strings the search creates.\n`);return;case`warning`:s(n.code,t.tn.warning,n.text);return;case`violation`:Os(n.status,n.violation,e)}},Es=(e,n)=>{n.livenessStartTime!==void 0&&(e.print(t.en.checkingTemporalEnd,t.tn.none,`Finished checking temporal properties in ${t.on(Date.now()-n.livenessStartTime)} at ${t.an(/* @__PURE__ */ new Date)}`),n.livenessStartTime=void 0)},Ds=(e,n)=>{n&&(n.counts&&console.log(n.counts),e.print(n.code,t.tn.error,t.rn(n.code,n.message,e.isTool)))},Os=(e,n,r)=>{let i=r.print,a=n.name,o=n.loopStart,s=o===void 0&&n.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),c={code:t.en.temporalPropertyViolated,text:_s(n.properties??[a],r.version)},l={success:void 0,error:void 0,"assumption-violation":n.message?{code:t.en.assumptionEvaluationError,text:t.rn(t.en.assumptionEvaluationError,`Evaluating assumption ${a} failed.\n${n.message}`,r.isTool)}:{code:t.en.assumptionFalse,text:`Assumption ${a} is false.`},deadlock:{code:t.en.deadlockReached,text:`Deadlock reached.`},"invariant-violation":s?ds(`invariant-violation`,a):{code:t.en.invariantViolatedBehavior,text:`Invariant ${a} is violated.`},"property-violation":c,"liveness-violation":o===void 0?s?ds(`liveness-violation`,a):{code:t.en.actionPropertyViolatedBehavior,text:`Action property ${a} is violated.`}:c,"postcondition-violation":{code:n.postcondition?.code??t.en.general,text:t.rn(n.postcondition?.code??t.en.general,n.message??`Postcondition ${a} is false.`,r.isTool)}}[e],u=e===`property-violation`,d=o!==void 0&&!u,f=u||d;if(f&&r.version!==`1.7.4`&&fs(r,n.trace[0]?.output),n.counts&&console.log(n.counts),l){let e=s?`${l.text}\n${t.Vt(n.trace[0].state)}`:l.text;i(l.code,t.tn.error,e)}if(s||(f||fs(r,n.trace[0]?.output),gs(r,n.trace,f?`counter-example`:`error-trace`)),fs(r,n.traceOutput),d){let e=n.loopLabel;o===n.trace.length-1?i(t.en.statePrint3,t.tn.state,`${o+2}: Stuttering`):r.isTool?i(t.en.backToState,t.tn.state,`${o+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${o+1}${e?`: <${e}>\n`:``}`)}n.warning&&r.version!==`1.7.4`&&i(n.warning.code,t.tn.warning,n.warning.text);let p=n.unwitnessed??(e===`postcondition-violation`?void 0:n.postcondition);return fs(r,n.postconditionOutput),Ds(r,p),!s&&e!==`assumption-violation`},ks=(e,n)=>e.print(t.en.nestedExpression,t.tn.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${ys(n)}`),As=(e,n,r)=>e.print(t.en.success,t.tn.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${t.r(n)}`,...r===void 0?[]:[` based on the actual fingerprints: val = ${t.r(r)}`]].join(`
|
|
47
|
-
`)),js=(e,n)=>{switch(n.kind){case`message`:e.print(n.code,n.isError?t.tn.error:t.tn.none,e.isTool?n.toolMessage:n.message);return;case`behavior`:n.states.forEach((r,i)=>n.isInvariant?e.print(t.en.statePrint2,t.tn.state,`${i+1}: \n${t.Vt(r,e.isDiffTrace?n.states[i-1]:void 0)}`):e.print(t.en.statePrint1,t.tn.state,`${i+1}:\n${t.Vt(r)}`));return;case`nested-expressions`:ks(e,n.callStack);return;case`success`:As(e,n.optimistic,n.actual)}},Ms=(n,r,i)=>{let a=r.print;if(n.failure){let i=n.failure,o=r.isTool?i.toolMessage:i.message,s=()=>{let e=i.fingerprint;if(e){let n=i.callStack?.length&&r.version!==`1.7.4`?ys(i.callStack):vs(e.sources);a(t.en.fingerprintFailed,t.tn.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${n}\nReason:\n${t.in(e.reason,r.isTool)}`)}else i.callStack&&ks(r,i.callStack)};i.isCallStackFirst&&s();let c=i.initialState&&(()=>{try{return`While working on the initial state:\n${t.Vt(i.initialState)}`}catch(t){throw t instanceof e.b?e.at(new e.b(`${e.G}${t.message}`),e.nt.error):t}})();a(c?t.en.initialState:i.code,t.tn.error,c?`${o}\n${c}`:o),fs(r,i.trace[0]?.output),gs(r,i.trace,`error-trace`);let l=i.traceFailure;l&&a(l.code,t.tn.error,r.isTool?l.toolMessage:l.message),fs(r,i.traceOutput),Ds(r,i.postcondition),i.isCallStackFirst||s()}else if(n.violation){if(!Os(n.status,n.violation,r))return;let e=n.additionalViolation;e&&Os(`property-violation`,e,r),n.liveCallStack&&ks(r,n.liveCallStack)}else n.status===`success`&&(Es(r,i),As(r,t.o(n.distinctStates,n.generatedStates),n.fingerprintDistance===void 0?void 0:t.i(n.fingerprintDistance)));if(n.failure?.isWithoutStatistics)return;n.status!==`success`&&Es(r,i),n.coverage&&Cs(r,n.coverage,i.startTime),r.isTool&&xs(r,n,i.startTime),a(t.en.stats,t.tn.none,`${n.generatedStates} states generated, ${n.distinctStates} distinct states found, ${n.queuedStates} states left on queue.`);let o=r.version===`1.7.4`,s=o?n.outDegrees??n.violationOutDegrees:n.outDegrees;(!o||s)&&a(t.en.searchDepth,t.tn.none,`The depth of the complete state graph search is ${o?Math.max(n.depth,1):n.depth}.`);let c=s&&t.s(s);c&&a(t.en.stateGraphOutdegree,t.tn.none,c)},Ns=e=>e.print(t.en.version,t.tn.none,`TLC2 Version ${T} (rev: tla-ts)`),Ps=(e,n,r)=>{let i=t.nn({isTool:e,version:n});return Ns(i),i.print(t.en.commandLineError,t.tn.error,`${r}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1},Fs=(e,n)=>{let r=`${n.workers} worker${n.workers===1?``:`s`} on ${(0,c.availableParallelism)()} cores with ${Math.floor((0,l.getHeapStatistics)().heap_size_limit/1024/1024)}MB heap and
|
|
47
|
+
`)),js=(e,n)=>{switch(n.kind){case`message`:e.print(n.code,n.isError?t.tn.error:t.tn.none,e.isTool?n.toolMessage:n.message);return;case`behavior`:n.states.forEach((r,i)=>n.isInvariant?e.print(t.en.statePrint2,t.tn.state,`${i+1}: \n${t.Vt(r,e.isDiffTrace?n.states[i-1]:void 0)}`):e.print(t.en.statePrint1,t.tn.state,`${i+1}:\n${t.Vt(r)}`));return;case`nested-expressions`:ks(e,n.callStack);return;case`success`:As(e,n.optimistic,n.actual)}},Ms=(n,r,i)=>{let a=r.print;if(n.failure){let i=n.failure,o=r.isTool?i.toolMessage:i.message,s=()=>{let e=i.fingerprint;if(e){let n=i.callStack?.length&&r.version!==`1.7.4`?ys(i.callStack):vs(e.sources);a(t.en.fingerprintFailed,t.tn.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${n}\nReason:\n${t.in(e.reason,r.isTool)}`)}else i.callStack&&ks(r,i.callStack)};i.isCallStackFirst&&s();let c=i.initialState&&(()=>{try{return`While working on the initial state:\n${t.Vt(i.initialState)}`}catch(t){throw t instanceof e.b?e.at(new e.b(`${e.G}${t.message}`),e.nt.error):t}})();a(c?t.en.initialState:i.code,t.tn.error,c?`${o}\n${c}`:o),fs(r,i.trace[0]?.output),gs(r,i.trace,`error-trace`);let l=i.traceFailure;l&&a(l.code,t.tn.error,r.isTool?l.toolMessage:l.message),fs(r,i.traceOutput),Ds(r,i.postcondition),i.isCallStackFirst||s()}else if(n.violation){if(!Os(n.status,n.violation,r))return;let e=n.additionalViolation;e&&Os(`property-violation`,e,r),n.liveCallStack&&ks(r,n.liveCallStack)}else n.status===`success`&&(Es(r,i),As(r,t.o(n.distinctStates,n.generatedStates),n.fingerprintDistance===void 0?void 0:t.i(n.fingerprintDistance)));if(n.failure?.isWithoutStatistics)return;n.status!==`success`&&Es(r,i),n.coverage&&Cs(r,n.coverage,i.startTime),r.isTool&&xs(r,n,i.startTime),a(t.en.stats,t.tn.none,`${n.generatedStates} states generated, ${n.distinctStates} distinct states found, ${n.queuedStates} states left on queue.`);let o=r.version===`1.7.4`,s=o?n.outDegrees??n.violationOutDegrees:n.outDegrees;(!o||s)&&a(t.en.searchDepth,t.tn.none,`The depth of the complete state graph search is ${o?Math.max(n.depth,1):n.depth}.`);let c=s&&t.s(s);c&&a(t.en.stateGraphOutdegree,t.tn.none,c)},Ns=e=>e.print(t.en.version,t.tn.none,`TLC2 Version ${T} (rev: tla-ts)`),Ps=(e,n,r)=>{let i=t.nn({isTool:e,version:n});return Ns(i),i.print(t.en.commandLineError,t.tn.error,`${r}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1},Fs=(e,n)=>{let r=`${n.workers} worker${n.workers===1?``:`s`} on ${(0,c.availableParallelism)()} cores with ${Math.floor((0,l.getHeapStatistics)().heap_size_limit/1024/1024)}MB heap and 64MB offheap memory [pid: ${process.pid}] (${(0,c.type)()} ${(0,c.release)()} ${(0,c.arch)()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit`;n.mode===`model-check`&&n.dfidDepth!==void 0?e.print(t.en.depthFirstModelChecking,t.tn.none,`Running depth-first search Model-Checking with fp ${n.fingerprintIndex} and seed ${n.seed} with ${r}).`):n.mode===`model-check`?e.print(t.en.modelChecking,t.tn.none,`Running breadth-first search Model-Checking with fp ${n.fingerprintIndex} and seed ${n.seed} with ${r}, MSBDiskFPSet, DiskStateQueue).`):e.print(t.en.simulating,t.tn.none,`Running ${n.scheduler===`rl`?`RL`:`Random`} Simulation with seed ${n.seed} with ${r}).`)},Is=(e,n)=>{let r=e.print;switch(n.kind){case`message`:r(n.code,n.isError?t.tn.error:t.tn.none,e.isTool?n.toolMessage:n.message);return;case`behavior`:{let i=n.trace[n.trace.length-1];if(!n.isLastStateOnly){gs(e,n.trace,`simulation`);return}r(t.en.errorState,t.tn.none,`The error state is:
|
|
48
48
|
`),r(t.en.statePrint1,t.tn.state,`:\n${t.Vt(i.state)}`);return}case`progress`:{let i=n.statistics;if(e.isTool){Ls(e,i);return}let a=i.levelM2/(i.traces+1);r(t.en.simulationProgress,t.tn.none,`Progress: ${i.generatedStates} states checked, ${i.traces} traces generated (trace length: mean=${i.levelMean}, var(x)=${Math.round(a)}, sd=${Math.round(Math.sqrt(a))})`);return}case`summary`:e.isTool&&Ls(e,n.statistics),r(t.en.simulationStats,t.tn.none,`The number of states generated: ${n.statistics.generatedStates}\nSimulation using seed ${n.statistics.seed} and aril ${n.statistics.aril}`)}},Ls=(e,n)=>e.print(t.en.simulationProgress,t.tn.none,`Progress(${n.traces}) at ${t.an(/* @__PURE__ */ new Date)}: ${n.generatedStates} states generated, -1 distinct states found, -1 states left on queue.`),Rs=[{name:`-checkpoint`,sampleValue:`minutes`,description:`interval between check point; defaults to 30`,isOptional:!0},{name:`-cleanup`,description:`clean up the states directory`,isOptional:!0},{name:`-config`,sampleValue:`file`,description:`provide the configuration file; defaults to SPEC.cfg`,isOptional:!0},{name:`-continue`,description:`continue running even when an invariant is violated; default
|
|
49
49
|
behavior is to halt on first violation`,isOptional:!0},{name:`-coverage`,sampleValue:`minutes`,description:`interval between the collection of coverage information;
|
|
50
50
|
if not specified, no coverage will be collected`,isOptional:!0},{name:`-deadlock`,description:`if specified DO NOT CHECK FOR DEADLOCK. Setting the flag is
|
|
@@ -151,10 +151,10 @@ A pretty-printed and in-depth description of TLC can be found at:
|
|
|
151
151
|
https://lamport.azurewebsites.net/tla/current-tools.pdf`.replace(/TLC(\)|\s|$)/g,`${X(`TLC`)}$1`),` `)}`,``,`${X(`OPTIONS`)}\n`,...e.map(e=>`\t${X(e.name)}${e.sampleValue===void 0?``:` ${Vs(e.sampleValue)}`}\n\t\t${t(e.description??``,` `)}`),``,`${X(`TIPS`)}\n`,...Bs.map(e=>`\t${t(e,` `)}\n`)].join(`
|
|
152
152
|
`)},Js=async t=>{let n=(await Promise.resolve().then(()=>require("./compile.cjs"))).compile((0,a.readFileSync)(t,`utf8`),t),r=`\\* Generated by tla-ts from ${(0,i.basename)(t)}. Edit ${(0,i.basename)(t)} instead.`,o=(0,i.join)((0,i.dirname)(t),`${n.name}.tla`),s=(0,i.join)((0,i.dirname)(t),`${n.name}.cfg`);for(let n of[o,s])if((0,a.existsSync)(n)&&!(0,a.readFileSync)(n,`utf8`).startsWith(r))throw new e.L(`${n} already exists, and tla-ts didn't generate it from ${t}`);return(0,a.writeFileSync)(o,`${r}\n${n.source}\n`),(0,a.writeFileSync)(s,`${r}\n${n.config}\n`),o},Ys={success:e.nt.success,"assumption-violation":e.nt.assumptionViolation,deadlock:e.nt.deadlock,"invariant-violation":e.nt.safetyViolation,"property-violation":e.nt.safetyViolation,"liveness-violation":e.nt.livenessViolation,"postcondition-violation":e.nt.assumptionViolation,error:e.nt.error},Xs=t=>{if((0,a.statSync)(t,{throwIfNoEntry:!1})?.isDirectory())throw new e.b(`${t} (Is a directory)`)},Zs=(e,t)=>e.endsWith(t)?e:`${e}${t}`,Qs=e=>{if(e.length===1)return{path:Zs(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:Zs(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`),constrained:t.includes(`constrained`),stuttering:t.includes(`stuttering`),strict:t.includes(`strict`)}},$s=e=>t.kt([e]).toString(),ec=(e,t,n,r,o)=>{let s=n.temporaryDirectory??(0,c.tmpdir)(),l=(0,a.existsSync)(s)?(0,a.realpathSync)(s):(0,i.resolve)(s),u=(0,i.join)(l,`tlc-${$s((0,i.resolve)(e))}`),d=w(n);return(n,s)=>{let c=`${n}.tla`;if(s===`file`)return(0,a.realpathSync)(m(t,n)??e);if(o===`1.7.4`)return(0,i.join)(l,c);if(s===`root file`){let t=r===void 0?l:(0,i.resolve)(r),o=(0,a.realpathSync)(e);return`${(0,i.join)(t,$s(`${o} ${n}`),c)} (${o})`}let f=(0,i.join)(u,c);return d===void 0?f:`${f} (${_(d)}${c})`}},tc=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>e.match(/^-----*\s*CONFIG\s+(\S+?)\s*-----*$/)?.[1]===t);if(r===-1)return`
|
|
153
153
|
`;let i=n.findIndex((e,t)=>t>r&&e.startsWith(`====`));return`${n.slice(r+1,i===-1?void 0:i).join(`
|
|
154
|
-
`).trim()}\n`},nc=e=>e.replace(/\/+/g,`/`).replace(/(.)\/$/,`$1`),rc=e=>{let t=nc(e),n=t.lastIndexOf(`/`);return n===-1?`.`:t.slice(0,Math.max(n,1))},ic=(e,t)=>e.endsWith(`/`)?`${e}${t}`:`${e}/${t}`,ac=(e,t,n,r)=>{if(t===`1.7.4`||!e.isTraceSpecForced&&(e.isTraceSpecDisabled||e.isTool||e.isContinued||(0,i.basename)(n).includes(`_TTrace`)))return;let a=e.traceSpecPath,o=`${(0,i.basename)(n)}_TTrace_${Math.floor(r/1e3)}`,s=a===void 0?{directory:rc(n),module:o}:a.toLowerCase().endsWith(`.tla`)?{directory:rc(a),module:(0,i.basename)(a).replace(/\.tla$/,``)}:{directory:nc(a),module:o};return{...s,traceFile:e.isTraceBinaryDisabled?void 0:ic(s.directory,`${s.module}.bin`)}},oc={ENOENT:`No such file or directory`,ENOTDIR:`Not a directory`,EISDIR:`Is a directory`,EACCES:`Permission denied`},sc=(t,n)=>{try{(0,a.writeFileSync)(t,n)}catch(n){let r=n instanceof Error&&`code`in n?oc[String(n.code)]:void 0;throw r===void 0?n:new e.b(`${t} (${r})`)}},cc=e=>{try{(0,a.mkdirSync)(e,{recursive:!0})}catch{}},lc=e=>{let n=/* @__PURE__ */ new Date,r=`${t.pn(n.getFullYear()%100)}-${t.pn(n.getMonth()+1)}-${t.pn(n.getDate())}-${t.pn(n.getHours())}-${t.pn(n.getMinutes())}-${t.pn(n.getSeconds())}.${t.pn(n.getMilliseconds(),3)}`,o=(0,i.join)(e.metadir??`states`,r);return(0,a.mkdirSync)(o,{recursive:!0}),o},uc=async(r,o,s,c,l)=>{let u=o.livenessCheck,d=l.version;Ns(l);let f=o.recoverDirectory;if(f!==void 0)throw(0,a.existsSync)((0,i.join)(f,`vars.chkpt`))?new e.x(`tla-ts can't recover a model check from the checkpoint in ${f}.`):new e.D(f);Fs(l,o);let p=o.configPath??r.replace(/\.tla$/,`.cfg`);if(!(0,a.existsSync)(p))return l.print(t.en.configFileError,t.tn.error,`TLC encountered the following error when trying to read the configuration file ${p}:\nFile not found.`),e.nt.configParseError;let m=(0,i.basename)(r,`.tla`),_={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},b=()=>{let e=Date.now()-_.startTime;l.print(t.en.finished,t.tn.none,`Finished in ${l.isTool?`${e}ms`:t.on(e)} at (${t.an(/* @__PURE__ */ new Date)})`)},x=()=>l.print(t.en.parsingFailed,t.tn.error,`Parsing or semantic analysis failed.`),S=t=>(t instanceof e.F?x():y(t,l),b(),v(t)),T=(()=>{try{let e=(0,a.readFileSync)(p,`utf8`);return t.gn(p.endsWith(`.tla`)?tc(e,p.replaceAll(`.tla`,``)):e,d)}catch(t){if(!(t instanceof e._))throw t;return t}})();if(T instanceof e._&&d===`1.7.4`)return l.print(t.en.general,t.tn.error,`${e.$(`tlc2.tool.ConfigFileException`)}${t.in(T.message,l.isTool)}`),b(),e.nt.error;if(T instanceof e._)return S(T);o.isDeadlockChecked||(T.checkDeadlock=!1);let E=(0,i.dirname)(r),D=[E,...c.libraries],O=h(D),k=ac(o,d,r.replace(/\.tla$/,``),_.startTime),A=e=>o.moduleOperators.filter(t=>t.kind===e).map(e=>e.module);l.isTool&&l.print(t.en.startingSany,t.tn.none,`Starting SANY...`);let ee=(0,i.isAbsolute)(r),te=ee?m:r.replace(/\.tla$/,``),ne=w(c),j=d===`1.7.4`?pc(r,c,ne):void 0;j?!(0,a.existsSync)(r)&&!t.ct.has(m)&&j(`${m}.tla`):!(0,a.existsSync)(r)&&!t.lt.has(m)&&g(ee?E:process.cwd(),ee?`${m}.tla`:`./${te}.tla`,[...ee||E===`.`?[]:[E],...c.libraries]);let M=Ro(r,j?C(O,j):O,{fileName:te,describeFile:ec(r,D,c,o.metadir,d),version:d,rootExtendees:[...A(`postcondition`),...k?.traceFile===void 0?[]:[`_TLCTrace`],...o.invariants.flatMap(e=>e.modules),...A(`constraint`),...A(`view`).slice(0,1)],suppressedCodes:o.suppressedCodes,errorCodes:o.errorCodes,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}),re=M.specification;if(M.isFailed||re===void 0)return Ts(l,{kind:`parsed`},_,E),x(),b(),e.nt.specParseError;try{let i=(0,a.readFileSync)(r,`utf8`),c=t.x(i).name;if(c!==m)throw new e.M(`File name '${m}' does not match the name '${c}' of the top level module it contains.`,void 0);let f=o.userFile,p=t.ut(d),h=Uo(i,re.root,o.invariants,e=>O(e)??p.get(e)??t.b(i,e),d);T.invariants.push(...h.names);let g={workers:o.workers,livenessCheck:u===`off`?`off`:[`final`,`seqfinal`].includes(u)?`final`:`default`,seed:o.seed,fingerprintPolynomial:o.fingerprintIndex,maxSetSize:o.maxSetSize,isLazyValueExpanded:o.isLazyValueExpanded,isViewPrinted:o.isViewPrinted,dump:s,isTool:l.isTool,isContinued:o.isContinued,moduleOperators:o.moduleOperators,traceSpec:k,coverage:o.coverage,isSanyReported:!0,isWarningEnabled:o.isWarningEnabled,version:d,onProgress:e=>Ts(l,e,_,E),onPrint:f===void 0?void 0:e=>(0,a.appendFileSync)(f,`${e}\n`),source:h.source,config:T,onPause:()=>(0,a.readSync)(0,Buffer.alloc(1)),loadModule:O,loadClass:e=>{let t=ws(E,e);return(0,a.existsSync)(t)?(0,a.readFileSync)(t):void 0},readFile:e=>(Xs(e),(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):void 0),writeFile:sc,makeDirectory:cc};if(o.mode!==`model-check`){let e=Xe({...g,traceDepth:o.traceDepth,traceCount:o.traceCount,aril:o.aril,isGenerating:o.mode===`generate`,scheduler:o.scheduler,onSimulation:e=>Is(l,e)});return b(),e}if(o.dfidDepth!==void 0){let e=Ue({...g,maxDepth:o.dfidDepth,onOutput:e=>js(l,e)});return b(),e}let v=await n.S(g);if(Ms(v,l,_),b(),k&&v.traceSpec!==void 0){let n=ic(k.directory,`${k.module}.tla`);cc(k.directory);let r=(()=>{try{sc(n,v.traceSpec);return}catch(t){if(!(t instanceof e.b))throw t;return t}})();l.print(r?t.en.traceSpecFailed:t.en.traceSpecWritten,t.tn.none,r?`Failed to generate trace exploration spec; error message: ${r.message}`:`Trace exploration spec path: ${n}`)}return v.failure?.exitCode??Ys[v.status]}catch(t){if(!(t instanceof e.y))throw t;return t instanceof e.F&&console.log(dc(t,m)),_.isParsed||Ts(l,{kind:`parsed`},_,E),S(t)}},dc=(t,n)=>{let r=t instanceof e.M;if(!r&&!t.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${t.message}\n\n`;let i=r?t.location===void 0?`Unknown location\n\n${t.message}`:`In module ${t.location}\n\n${t.message}`:`In module ${n}\n\nCould not parse module ${n} from file ${n}.tla`;return`${t.failure?`***Parse Error***\n${t.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${n}\n\n${i}\n*** Errors: 1\n\n${i}\n\n\n`},fc=async(n,r)=>{let o=r.tlcVersion??`master`,s=ls(n);if(s===`usage`)return console.log(qs()),1;if(`error`in s)return s.kind===`uncaught`?(console.error(`Exception in thread "main" ${s.error}`),1):Ps(s.isTool,o,s.error);let c=s.dump&&Qs(s.dump);c?.path.startsWith("${metadir}")&&(c.path=c.path.replaceAll("${metadir}",lc(s)));let l=c?.path;if(l!==void 0)try{(0,a.closeSync)((0,a.openSync)(l,`w`))}catch{return console.log(`Error: Unable to write to file ${l}`),Ps(s.isTool,o,`Error: Given file name ${l} for dumping states invalid.`)}let u=s.configPath!==void 0;if(u&&s.specs.length>1)return Ps(s.isTool,o,`Error: more than one input files: ${s.specs[0].replace(/\.tla$/,``)} and ${s.specs[1]}`);let d=p(s.specs).map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg|ts)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.ts`)||e.path.endsWith(`.tla`)&&(!e.isGlobbed||u||(0,a.existsSync)(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(d.length===0)return Ps(s.isTool,o,`Error: Missing input TLA+ module.`);if(u&&d.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let f=[...new Set(d.map(e=>(0,a.existsSync)(e)||(0,i.isAbsolute)(e)?e:r.libraries.map(t=>(0,i.join)(t,e)).find(a.existsSync)??e))],m=[];for(let[e,n]of f.entries()){e>0&&console.log(``);let a=t.nn({isTool:s.isTool,isWarningEnabled:s.isWarningEnabled,isDiffTrace:s.isDiffTrace,version:o,suppressedCodes:s.suppressedCodes,errorCodes:s.errorCodes});m.push(await b(async()=>{let e=n.endsWith(`.ts`)?await Js(n):n;return f.length>1&&console.log(`Checking ${(0,i.basename)(e)} with ${(0,i.basename)(e,`.tla`)}.cfg`),uc(e,s,c,r,a)},a))}return m.find(t=>t!==e.nt.success)??e.nt.success},pc=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),a=(!(0,i.isAbsolute)(e)&&r!==``?[r]:t.libraries).map(S),o=a.length>0?a[a.length-1]:(0,i.isAbsolute)(e)?r:``;return e=>x(`${o}${e}`,a,n)},mc={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},hc=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),gc={"&":`&`,"<":`<`,">":`>`,"\r":` `},_c=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:gc[e]),vc=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,yc=e=>{let t=(e.cdata??e.text)?.match(vc)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=yc(t);if(e)return e}},bc=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${_c(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)bc(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},xc=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Sc=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},Cc={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},wc={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Tc=Kn(`--TLA+ BUILTINS--`),Ec=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Dc=(e,t=16)=>e>t*.75?Dc(e,t*2):t,Oc=(e,t)=>(e^e>>>16)&t-1,kc=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Ac=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),jc=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Mc=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=kc(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(jc,``)}).join(`
|
|
155
|
-
`)},
|
|
156
|
-
`)},
|
|
157
|
-
`),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return e.at(new e.T(i,a),
|
|
158
|
-
`),n=r.isUncommented?Nc(
|
|
159
|
-
`)}\n`},
|
|
160
|
-
`)})(),
|
|
154
|
+
`).trim()}\n`},nc=e=>e.replace(/\/+/g,`/`).replace(/(.)\/$/,`$1`),rc=e=>{let t=nc(e),n=t.lastIndexOf(`/`);return n===-1?`.`:t.slice(0,Math.max(n,1))},ic=(e,t)=>e.endsWith(`/`)?`${e}${t}`:`${e}/${t}`,ac=(e,t,n,r)=>{if(t===`1.7.4`||!e.isTraceSpecForced&&(e.isTraceSpecDisabled||e.isTool||e.isContinued||(0,i.basename)(n).includes(`_TTrace`)))return;let a=e.traceSpecPath,o=`${(0,i.basename)(n)}_TTrace_${Math.floor(r/1e3)}`,s=a===void 0?{directory:rc(n),module:o}:a.toLowerCase().endsWith(`.tla`)?{directory:rc(a),module:(0,i.basename)(a).replace(/\.tla$/,``)}:{directory:nc(a),module:o};return{...s,traceFile:e.isTraceBinaryDisabled?void 0:ic(s.directory,`${s.module}.bin`)}},oc={ENOENT:`No such file or directory`,ENOTDIR:`Not a directory`,EISDIR:`Is a directory`,EACCES:`Permission denied`},sc=(t,n)=>{try{(0,a.writeFileSync)(t,n)}catch(n){let r=n instanceof Error&&`code`in n?oc[String(n.code)]:void 0;throw r===void 0?n:new e.b(`${t} (${r})`)}},cc=e=>{try{(0,a.mkdirSync)(e,{recursive:!0})}catch{}},lc=e=>{let n=/* @__PURE__ */ new Date,r=`${t.pn(n.getFullYear()%100)}-${t.pn(n.getMonth()+1)}-${t.pn(n.getDate())}-${t.pn(n.getHours())}-${t.pn(n.getMinutes())}-${t.pn(n.getSeconds())}.${t.pn(n.getMilliseconds(),3)}`,o=(0,i.join)(e.metadir??`states`,r);return(0,a.mkdirSync)(o,{recursive:!0}),o},uc=async(r,o,s,c,l)=>{let u=o.livenessCheck,d=l.version;Ns(l);let f=o.recoverDirectory;if(f!==void 0)throw(0,a.existsSync)((0,i.join)(f,`vars.chkpt`))?new e.x(`tla-ts can't recover a model check from the checkpoint in ${f}.`):new e.D(f);Fs(l,o);let p=o.configPath??r.replace(/\.tla$/,`.cfg`);if(!(0,a.existsSync)(p))return l.print(t.en.configFileError,t.tn.error,`TLC encountered the following error when trying to read the configuration file ${p}:\nFile not found.`),e.nt.configParseError;let m=(0,i.basename)(r,`.tla`),_={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},b=()=>{let e=Date.now()-_.startTime;l.print(t.en.finished,t.tn.none,`Finished in ${l.isTool?`${e}ms`:t.on(e)} at (${t.an(/* @__PURE__ */ new Date)})`)},x=()=>l.print(t.en.parsingFailed,t.tn.error,`Parsing or semantic analysis failed.`),S=t=>(t instanceof e.F?x():y(t,l),b(),v(t)),T=(()=>{try{let e=(0,a.readFileSync)(p,`utf8`);return t.gn(p.endsWith(`.tla`)?tc(e,p.replaceAll(`.tla`,``)):e,d)}catch(t){if(!(t instanceof e._))throw t;return t}})();if(T instanceof e._&&d===`1.7.4`)return l.print(t.en.general,t.tn.error,`${e.$(`tlc2.tool.ConfigFileException`)}${t.in(T.message,l.isTool)}`),b(),e.nt.error;if(T instanceof e._)return S(T);o.isDeadlockChecked||(T.checkDeadlock=!1);let E=(0,i.dirname)(r),D=[E,...c.libraries],O=h(D),k=ac(o,d,r.replace(/\.tla$/,``),_.startTime),A=e=>o.moduleOperators.filter(t=>t.kind===e).map(e=>e.module);l.isTool&&l.print(t.en.startingSany,t.tn.none,`Starting SANY...`);let ee=(0,i.isAbsolute)(r),te=ee?m:r.replace(/\.tla$/,``),ne=w(c),j=d===`1.7.4`?mc(r,c,ne):void 0;j?!(0,a.existsSync)(r)&&!t.ct.has(m)&&j(`${m}.tla`):!(0,a.existsSync)(r)&&!t.lt.has(m)&&g(ee?E:process.cwd(),ee?`${m}.tla`:`./${te}.tla`,[...ee||E===`.`?[]:[E],...c.libraries]);let M=Ro(r,j?C(O,j):O,{fileName:te,describeFile:ec(r,D,c,o.metadir,d),version:d,rootExtendees:[...A(`postcondition`),...k?.traceFile===void 0?[]:[`_TLCTrace`],...o.invariants.flatMap(e=>e.modules),...A(`constraint`),...A(`view`).slice(0,1)],suppressedCodes:o.suppressedCodes,errorCodes:o.errorCodes,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}),re=M.specification;if(M.isFailed||re===void 0)return Ts(l,{kind:`parsed`},_,E),x(),b(),e.nt.specParseError;try{let i=(0,a.readFileSync)(r,`utf8`),c=t.x(i).name;if(c!==m)throw new e.M(`File name '${m}' does not match the name '${c}' of the top level module it contains.`,void 0);let f=o.userFile,p=t.ut(d),h=Uo(i,re.root,o.invariants,e=>O(e)??p.get(e)??t.b(i,e),d);T.invariants.push(...h.names);let g={workers:o.workers,livenessCheck:u===`off`?`off`:[`final`,`seqfinal`].includes(u)?`final`:`default`,seed:o.seed,fingerprintPolynomial:o.fingerprintIndex,maxSetSize:o.maxSetSize,isLazyValueExpanded:o.isLazyValueExpanded,isViewPrinted:o.isViewPrinted,dump:s,isTool:l.isTool,isContinued:o.isContinued,moduleOperators:o.moduleOperators,traceSpec:k,coverage:o.coverage,isSanyReported:!0,isWarningEnabled:o.isWarningEnabled,version:d,onProgress:e=>Ts(l,e,_,E),onPrint:f===void 0?void 0:e=>(0,a.appendFileSync)(f,`${e}\n`),source:h.source,config:T,onPause:()=>(0,a.readSync)(0,Buffer.alloc(1)),readLine:dc,loadModule:O,loadClass:e=>{let t=ws(E,e);return(0,a.existsSync)(t)?(0,a.readFileSync)(t):void 0},readFile:e=>(Xs(e),(0,a.existsSync)(e)?(0,a.readFileSync)(e,`utf8`):void 0),writeFile:sc,makeDirectory:cc};if(o.mode!==`model-check`){let e=Xe({...g,traceDepth:o.traceDepth,traceCount:o.traceCount,aril:o.aril,isGenerating:o.mode===`generate`,scheduler:o.scheduler,onSimulation:e=>Is(l,e)});return b(),e}if(o.dfidDepth!==void 0){let e=Ue({...g,maxDepth:o.dfidDepth,onOutput:e=>js(l,e)});return b(),e}let v=await n.S(g);if(Ms(v,l,_),b(),k&&v.traceSpec!==void 0){let n=ic(k.directory,`${k.module}.tla`);cc(k.directory);let r=(()=>{try{sc(n,v.traceSpec);return}catch(t){if(!(t instanceof e.b))throw t;return t}})();l.print(r?t.en.traceSpecFailed:t.en.traceSpecWritten,t.tn.none,r?`Failed to generate trace exploration spec; error message: ${r.message}`:`Trace exploration spec path: ${n}`)}return v.failure?.exitCode??Ys[v.status]}catch(t){if(!(t instanceof e.y))throw t;return t instanceof e.F&&console.log(fc(t,m)),_.isParsed||Ts(l,{kind:`parsed`},_,E),S(t)}},dc=()=>{let e=[],t=Buffer.alloc(1),n=!1;for(;(0,a.readSync)(0,t)===1&&(n=!0,t[0]!==10);)e.push(t[0]);return n?Buffer.from(e).toString().replace(/\r$/,``):void 0},fc=(t,n)=>{let r=t instanceof e.M;if(!r&&!t.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${t.message}\n\n`;let i=r?t.location===void 0?`Unknown location\n\n${t.message}`:`In module ${t.location}\n\n${t.message}`:`In module ${n}\n\nCould not parse module ${n} from file ${n}.tla`;return`${t.failure?`***Parse Error***\n${t.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${n}\n\n${i}\n*** Errors: 1\n\n${i}\n\n\n`},pc=async(n,r)=>{let o=r.tlcVersion??`master`,s=ls(n);if(s===`usage`)return console.log(qs()),1;if(`error`in s)return s.kind===`uncaught`?(console.error(`Exception in thread "main" ${s.error}`),1):Ps(s.isTool,o,s.error);let c=s.dump&&Qs(s.dump);c?.path.startsWith("${metadir}")&&(c.path=c.path.replaceAll("${metadir}",lc(s)));let l=c?.path;if(l!==void 0)try{(0,a.closeSync)((0,a.openSync)(l,`w`))}catch{return console.log(`Error: Unable to write to file ${l}`),Ps(s.isTool,o,`Error: Given file name ${l} for dumping states invalid.`)}let u=s.configPath!==void 0;if(u&&s.specs.length>1)return Ps(s.isTool,o,`Error: more than one input files: ${s.specs[0].replace(/\.tla$/,``)} and ${s.specs[1]}`);let d=p(s.specs).map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg|ts)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.ts`)||e.path.endsWith(`.tla`)&&(!e.isGlobbed||u||(0,a.existsSync)(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(d.length===0)return Ps(s.isTool,o,`Error: Missing input TLA+ module.`);if(u&&d.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let f=[...new Set(d.map(e=>(0,a.existsSync)(e)||(0,i.isAbsolute)(e)?e:r.libraries.map(t=>(0,i.join)(t,e)).find(a.existsSync)??e))],m=[];for(let[e,n]of f.entries()){e>0&&console.log(``);let a=t.nn({isTool:s.isTool,isWarningEnabled:s.isWarningEnabled,isDiffTrace:s.isDiffTrace,version:o,suppressedCodes:s.suppressedCodes,errorCodes:s.errorCodes});m.push(await b(async()=>{let e=n.endsWith(`.ts`)?await Js(n):n;return f.length>1&&console.log(`Checking ${(0,i.basename)(e)} with ${(0,i.basename)(e,`.tla`)}.cfg`),uc(e,s,c,r,a)},a))}return m.find(t=>t!==e.nt.success)??e.nt.success},mc=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),a=(!(0,i.isAbsolute)(e)&&r!==``?[r]:t.libraries).map(S),o=a.length>0?a[a.length-1]:(0,i.isAbsolute)(e)?r:``;return e=>x(`${o}${e}`,a,n)},hc={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},gc=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),_c={"&":`&`,"<":`<`,">":`>`,"\r":` `},vc=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:_c[e]),yc=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,bc=e=>{let t=(e.cdata??e.text)?.match(yc)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=bc(t);if(e)return e}},xc=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${vc(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)xc(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Sc=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Cc=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},wc={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Tc={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Ec=Kn(`--TLA+ BUILTINS--`),Dc=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Oc=(e,t=16)=>e>t*.75?Oc(e,t*2):t,kc=(e,t)=>(e^e>>>16)&t-1,Ac=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},jc=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Mc=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Nc=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Ac(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(Mc,``)}).join(`
|
|
155
|
+
`)},Pc=e=>{let t=Ac(e),n=e=>jc(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
|
|
156
|
+
`)},Fc=(t,n,r)=>{let i=r.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s=!1,c=[],l=(e,t)=>{if(!i)return t();c.push(...e);let n=t();return c.length-=e.length,n},u=(t,n)=>{let r=[...c,...n].reverse(),i=[t,...r.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
157
|
+
`),a=r.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${i}\n`).join(``);return e.at(new e.T(i,a),hc.uncaughtException)},d=e=>u(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),f=(e,t)=>(a.has(e.id)||(a.add(e.id),o.set(e.id,l([...t?[t]:[],...Dc(e.kind,Kn(e.location))],()=>g(e)))),Z(Cc(e),[Q(`UID`,e.id)])),p=(e,t)=>{let n=t.levelChecked===0?[]:[Q(`level`,t.level)],r=t.location?[Sc(t.location),...n]:n;return{...e,children:[...r,...e.children]}},m=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[f(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),h=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|
|
158
|
+
`),n=r.isUncommented?Pc(Nc(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:n,children:[]}]:[]},g=t=>{switch(t.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,t.name),Q(`arity`,t.arity)]),t);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),Q(`kind`,t.declKind)]),t);case`OpDef`:{if(t.defKind===`NumberedProofStep`)throw i?u(gc(37),[Tc]):e.at(new e.B(gc(37)),hc.uncaughtException);if(t.defKind===`ModuleInstance`)return p(Z(`ModuleInstanceKind`,[Q(`uniquename`,t.name),...t.isLocal&&!i?[Z(`local`)]:[]]),t);let n=t.params??[];if(t.defKind===`BuiltIn`)return p(Z(`BuiltInKind`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),...t.params?[m(n,t.isLeibnizArg,$.builtInParam)]:[]]),t);let r=t.body,a=t.module;if(r===void 0&&i)throw d($.body);if(r===void 0||a===void 0)throw Error(`The definition of ${t.name} has no body`);return p(Z(`UserDefinedOpKind`,[Q(`uniquename`,t.name),Q(`arity`,t.arity),...i?[]:[Z(`originalOperator`,[f(t.source??t)]),Z(`originallyDefinedInModule`,[f(a)])],Z(`body`,[x(r,$.body)]),...t.params||!i?[m(n,t.isLeibnizArg,$.param)]:[],...i?[]:h(t.preComments),...t.inRecursive?[Z(`recursive`)]:[],...t.recursiveSection>=0&&!i?[Q(`recursiveSection`,t.recursiveSection)]:[],...t.isLocal&&!i?[Z(`local`)]:[]]),t)}case`ThmOrAssumpDef`:return p(Z(t.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,t.name),x(t.body,$.theoremDefinitionBody)]),t);case`Module`:return Z(`ModuleNode`,[Sc(t.location),..._(t)]);case`Theorem`:return p(Z(`TheoremNode`,[...t.definition?[Z(`definition`,[f(t.definition,$.theoremDefinition)])]:[],Z(`body`,[x(t.body,$.theorem)]),...t.proof?[x(t.proof,$.proof)]:[],...t.isSuffices?[Z(`suffices`)]:[]]),t);case`Assume`:return Z(`AssumeNode`,[Sc(t.location),...t.body.levelChecked===0?[]:[Q(`level`,t.body.level)],...t.definition?[Z(`definition`,[f(t.definition,$.assumeDefinition)])]:[],Z(`body`,[x(t.body,$.assume)])])}},_=e=>{let t=t=>!r.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...i?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...cr(e,2).filter(t).map(e=>f(e,$.constant)),...cr(e,3).filter(t).map(e=>f(e,$.variable)),...sr(e).filter(t).map(e=>f(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?x(e,$.topLevel):f(e,$.topLevel)),...e.definitions.filter(e=>!i&&e.kind===`Module`).map(e=>f(e))]},v=(e,t)=>l([t],()=>Z(`Subst`,[f(e.op,$.substOperator),x(e.expr,$.substExpression)])),y=e=>{if(e.nullKind!==void 0&&i)throw u(gc(0),[$.operator,...Dc(`OpDef`,Ec),Tc]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s=!0);let n=f(e.operator,$.operator),r=e.operands.map((e,t)=>e===void 0||t===0&&s&&qn(e)?i?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):x(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[f(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>f(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],x(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,r),...o])},b=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?f(e,t):x(e,t),x=(e,t)=>{if(!i)return S(e);if(e.kind===`OpAppl`&&e.nullKind===`absent`&&`nullType`in t)throw d(t);return l([t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:Kn(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}],()=>S(e))},S=e=>{switch(e.kind){case`OpAppl`:return p(y(e),e);case`Numeral`:return p(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e);case`String`:return p(Z(`StringNode`,[Q(`StringValue`,e.value)]),e);case`Decimal`:return p(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...i?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e);case`LetIn`:{let t=x(e.body,$.letBody);return p(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>f(e,$.letDefinition)))]),e)}case`Label`:return p(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[x(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>f(e,$.labelParam)))]),e);case`OpArg`:return p(Z(`OpArgNode`,[Z(`argument`,[f(e.op,$.argument)])]),e);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return p(Z(`AtNode`,[x(t,$.exceptObject),x(n,$.exceptComponents)]),e)}case`SubstIn`:case`APSubstIn`:{let t=wc[e.kind],n=e.substs.map(e=>v(e,t.subst)),r=x(e.body,t.body);return p(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[f(e.instantiatingModule,t.from)]),Z(`instTo`,[f(e.instantiatedModule,t.to)])]),e)}case`Instance`:{let t=e.substs.map(e=>v(e,$.instanceSubst)),n=e.params.map(e=>f(e,$.instanceParam));return Z(`InstanceNode`,[Sc(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!i?[Z(`local`)]:[]])}case`UseOrHide`:return p(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>b(e,$.useFact))),Z(`defs`,e.defs.map(e=>f(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e);case`NewSymb`:return p(Z(`NewSymbNode`,[f(e.declaration,$.newDeclaration),...e.set&&!(i&&qn(e.set))?[x(e.set,$.newSet)]:[]]),e);case`AssumeProve`:return p(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>x(e,$.assumption))),Z(`prove`,[x(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>b(e,$.byFact))),Z(`defs`,e.defs.map(e=>f(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return p(n,e)}case`NonLeafProof`:return p(Z(`steps`,[...i?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?f(e,$.step):x(e,$.step))]),e);case`DefStep`:return p(Z(`DefStepNode`,e.defs.map(e=>f(e,$.defStep))),e)}},C=(r.isRestricted?[n]:t).map(e=>f(e,$.main)),w=Oc(o.size),T=Z(`context`,[...o.entries()].toSorted(([e],[t])=>kc(e,w)-kc(t,w)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,n.name),T,...C])},Ic=(t,n={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let r=Fc(t.modules,t.root,n),i=bc(r);if(i){let t=i.character.codePointAt(0)??0;throw e.at(new e.B(`The spec contains the character U+${t.toString(16).toUpperCase().padStart(4,`0`)} in the ${i.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),hc.unrepresentableCharacter)}let a=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return xc(r,0,n.isTerse?0:2,a),n.isTerse?a.join(``):`${a.join(`
|
|
159
|
+
`)}\n`},Lc=(()=>{let e=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],t=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,X(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,X(`SYNOPSIS`),``,`\t${X(`tla2sany.xml.XMLExporter`)} [${X(`-Iortu`)}] [${X(`-help`)}] FILE`,``,X(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,X(`OPTIONS`),``,...e.map(([e,t])=>`\t${X(e)}\n\t\t${t}`),``,X(`TIPS`),``,...t.flatMap(e=>[`\t${e}`,``]),``].join(`
|
|
160
|
+
`)})(),Rc=e=>(process.stderr.write(`ERROR: ${e}\n${Lc}`),hc.argsParsingFailure),zc=(t,n)=>{try{return process.stdout.write(Ic(t,n)),e.nt.success}catch(t){if(!(t instanceof e.B))throw t;let n=e.Q(t),r=t instanceof e.T?t.unwound:``;return console.error(n===hc.uncaughtException?`${r}Exception in thread "main" ${t.message}`:`ERROR: ${t.message}`),n}},Bc={"no-file":{message:`at least one .tla file must be given`,line174:59},"missing-include":{message:`the -I flag must be followed by a directory and at least one .tla file`,line174:71},"several-files":{message:`Only one TLA file to check allowed!`,line174:83}},Vc=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0};if(e.length===0)return{...n,error:`no-file`};let r=-1;for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r=i}return r===e.length-2?n:{...n,error:`several-files`}},Hc=n=>{let r=Vc(n,/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]));if(r.error)return Rc(Bc[r.error].message);let o=n[n.length-1];if(o===`-help`)return process.stdout.write(Lc),e.nt.success;let s=o.endsWith(`.tla`)?o:`${o}.tla`,c=[`.`,...r.includes],l=c.map(e=>(0,i.resolve)(e,s)).find(a.existsSync);l===void 0&&!t.lt.has(s.slice(0,-4))&&g(process.cwd(),`./${s}`,r.includes);let u=Ro(l??s,h(c),{fileName:o,isXmlExport:!0});return process.stderr.write(u.text),u.isFailed||u.specification===void 0?(console.error(`ERROR: Failed to parse module.`),hc.specParsingFailure):zc(u.specification,{version:`master`,isRestricted:r.flags.has(`-r`),isUncommented:r.flags.has(`-u`),isTerse:r.flags.has(`-t`)})},Uc=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),hc.uncaughtException),Wc=(n,r)=>{let o=Vc(n,/* @__PURE__ */ new Set([`-o`]));if(o.error)return Uc(`java.lang.IllegalArgumentException: ${Bc[o.error].message}`,Bc[o.error].line174);let s=n[n.length-1],c=`${s.replace(/\.tla$/i,``)}.tla`,l=(o.includes.length===0?[`/`]:o.includes).map(S),u=[`.`,...l],d=e=>x(`${l[l.length-1]}${e}`,l,r),f=u.map(e=>(0,i.resolve)(e,c)).find(a.existsSync);if(f===void 0&&!t.ct.has((0,i.basename)(c,`.tla`)))return d(c),e.nt.success;let p=Ro(f??c,C(h(u),d),{fileName:s,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(p.text),p.specification===void 0?Uc(`tla2sany.xml.XMLExportingException: spec ${(f&&Lo((0,a.readFileSync)(f,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):zc(p.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},Gc=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],Kc=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(i.delimiter));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||Gc.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},qc=async e=>{if(e[0]===`tlapm`)return b(()=>Re(e.slice(1)));let t=Kc(e);return t===void 0?pc(e,{libraries:[]}):(t.java.tlcVersion??=await d(w(t.java)),t.mainClass===`tlc2.TLC`?pc(t.args,t.java):t.mainClass===`tla2sany.xml.XMLExporter`?b(()=>t.java.tlcVersion===`1.7.4`?Wc(t.args,w(t.java)):Hc(t.args)):(console.error(`Error: tla-ts runs the Java classes ${Gc.join(` and `)}, not ${t.mainClass}.`),1))},Jc=async()=>{process.exitCode=await qc(process.argv.slice(2))};exports.runCli=Jc;
|
package/dist/run.js
CHANGED
|
@@ -6,7 +6,7 @@
|
|
|
6
6
|
* This source code is licensed under the MIT license found in the
|
|
7
7
|
* LICENSE file in the root directory of this source tree.
|
|
8
8
|
*/
|
|
9
|
-
import{t as e}from"./tlapm.js";import{$ as t,A as n,B as r,C as i,D as a,F as o,G as s,I as c,L as l,M as u,O as d,P as f,Q as p,T as m,V as h,W as g,_,at as v,b as y,c as b,g as x,it as S,j as C,k as w,nt as T,o as E,ot as ee,s as D,tt as O,x as k,y as A}from"./worker.js";import{$ as te,At as ne,E as re,Ft as ie,G as ae,K as oe,M as se,O as ce,Pt as le,Q as ue,S as de,Vt as j,Zt as fe,_n as pe,an as me,b as he,bn as ge,cn as _e,ct as ve,dn as ye,dt as be,en as M,fn as xe,gn as Se,h as Ce,hn as we,ht as Te,i as Ee,in as De,kt as Oe,lt as ke,m as Ae,mn as je,mt as Me,nn as Ne,o as N,on as Pe,ot as Fe,p as Ie,pn as Le,pt as Re,qt as ze,r as Be,rn as Ve,s as He,sn as Ue,tn as P,un as We,ut as Ge,vn as Ke,vt as qe,w as Je,x as Ye,yn as Xe}from"./transfer.js";import{S as Ze,_ as Qe,a as $e,b as et,c as tt,d as nt,f as rt,g as it,h as at,i as ot,l as st,m as ct,n as lt,p as ut,r as dt,s as ft,t as pt,u as mt,v as ht,x as gt,y as _t}from"./prove.js";import{basename as vt,delimiter as yt,dirname as bt,isAbsolute as xt,join as St,resolve as Ct}from"node:path";import{appendFileSync as wt,closeSync as Tt,cpSync as Et,existsSync as F,globSync as Dt,mkdirSync as Ot,openSync as kt,readFileSync as At,readSync as jt,readdirSync as Mt,realpathSync as Nt,renameSync as Pt,rmSync as Ft,statSync as It,writeFileSync as Lt}from"node:fs";import{pathToFileURL as Rt}from"node:url";import{spawnSync as zt}from"node:child_process";import{arch as Bt,availableParallelism as Vt,release as Ht,tmpdir as Ut,type as Wt}from"node:os";import{getHeapStatistics as Gt}from"node:v8";const Kt=`META-INF/MANIFEST.MF`,qt=async e=>{if(e===void 0||!F(e))return`master`;let t=await import(`fflate`),n=t.unzipSync(At(e),{filter:e=>e.name===Kt})[Kt];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},Jt=/[*?[{]/,Yt=e=>e.flatMap(e=>Jt.test(e)?Dt(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),Xt=(e,t)=>e.map(e=>St(e,`${t}.tla`)).find(F),Zt=e=>t=>{let n=Xt(e,t);return n===void 0?void 0:At(n,`utf8`)},Qt=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),$t=e=>`jar:file:${Rt(Ct(e)).pathname}!/tla2sany/StandardModules/`,en=e=>e instanceof h?S(e.code):p(e),tn=(e,t)=>{if(e instanceof _||e instanceof y){let n=Ue(e.message),r=e instanceof h?e.code:n&&!n.isEvalException?n.code:M.general;return t.print(r,P.error,Ve(r,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},nn=async(e,t=Ne({isTool:!1}))=>{try{return await e()}catch(e){if(!(e instanceof A))throw e;return tn(e,t),en(e)}},rn=(e,t,n)=>console.error(`File does not exist: ${xt(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[$t(n)]].join(`, `)}`),an=e=>e.endsWith(`/`)?e:`${e}/`,on=(e,t)=>n=>{let r=e(n);return r===void 0&&!ve.has(n)&&t(`${n}.tla`),r},sn=e=>e.classPath?.split(yt).find(e=>e.endsWith(`.jar`));var cn=`0.0.10-dev.cb7650c54`;const ln=2224400062,un={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},dn={smallInt:64,smallString:32,smallBlock:128},I=(e,...t)=>({tag:e,fields:t}),fn=e=>typeof e==`object`&&`tag`in e,pn=(e,t)=>{let r=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.length<t+20||r.getUint32(t)!==ln)throw new n(`corrupted fingerprint file`);let i=t+20+r.getUint32(t+4),a=[],o=t+20,s=e=>{let t=o;if(o+=e,o>i)throw new n(`corrupted fingerprint file`);return t},c=new TextDecoder,l=t=>{let n=s(t),r=c.decode(e.subarray(n,n+t));return a.push(r),r},u=(e,t)=>{let n=I(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let t=e[s(1)];if(t>=dn.smallBlock)return u(t&15,t>>4&7);if(t>=dn.smallInt)return t&63;if(t>=dn.smallString)return l(t&31);switch(t){case un.int8:return r.getInt8(s(1));case un.int16:return r.getInt16(s(2));case un.int32:return r.getInt32(s(4));case un.shared8:return d(r.getUint8(s(1)));case un.shared16:return d(r.getUint16(s(2)));case un.shared32:return d(r.getUint32(s(4)));case un.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case un.string8:return l(r.getUint8(s(1)));case un.string32:return l(r.getUint32(s(4)));case un.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new n(`corrupted fingerprint file`)};return{value:f(),next:i}},mn=e=>{let t=[],n=0,r=0,i=0,a=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},o=new TextEncoder,s=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(dn.smallInt+e):e>=-128&&e<128?t.push(un.int8,e&255):e>=-32768&&e<32768?(t.push(un.int16),a(e,2)):(t.push(un.int32),a(e,4));if(n++,typeof e==`string`){let n=o.encode(e);n.length<32?t.push(dn.smallString+n.length):n.length<256?t.push(un.string8,n.length):(t.push(un.string32),a(n.length,4)),t.push(...n),r+=1+Math.floor((n.length+4)/4),i+=1+Math.floor((n.length+8)/8);return}if(!fn(e)){let n=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));n.setFloat64(0,e.float,!0),t.push(un.doubleLittle,...new Uint8Array(n.buffer)),r+=3,i+=2;return}let c=e.fields.length;c===0?n--:(r+=1+c,i+=1+c),e.tag<16&&c<8?t.push(dn.smallBlock+e.tag+(c<<4)):(t.push(un.block32),a(c*1024+e.tag,4)),e.fields.forEach(s)};s(e);let c=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[ln,t.length,n,r,i].forEach((e,t)=>c.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(c.buffer),...t])},hn=20210223,gn=[...tt,`cooper`,`expandenabled`,`expandcdot`,`lambdify`,`enabledaxioms`,`levelcomparison`],_n={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},cooper:{field:4,tag:3,isConstant:!0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16},expandenabled:{field:18,tag:6,isConstant:!0},expandcdot:{field:19,tag:8,isConstant:!0},lambdify:{field:20,tag:9,isConstant:!0},enabledaxioms:{field:21,tag:10,isConstant:!0},levelcomparison:{field:22,tag:11,isConstant:!0}},vn=[`false`,`timeout`],yn=`tla-ts ${cn}`,bn=/* @__PURE__ */ new Map([[_n.zenon.field,3],[_n.isabelle.field,4]]),xn=(e,t)=>e!==void 0&&fn(e)?e.fields[t]:void 0,Sn=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,Cn=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},wn=e=>e!==void 0&&fn(e)?[[e.fields[0],e.fields[1]],...wn(e.fields[2])]:[],Tn=(e,t,r)=>{let i=At(t),a=pn(i,0),o=pn(i,a.next).value;if(a.value!==hn||!fn(o)||o.tag!==0)throw new n(`corrupted fingerprint file`);let s=xn(xn(o,0),1),c=(e,t)=>{let n=bn.get(t);return!r||n===void 0||xn(xn(e,0),n)===yn};e.clear(),(s!==void 0&&fn(s)?s.fields:[]).flatMap(e=>wn(e).toReversed()).forEach(([t,r])=>{if(typeof t!=`string`||!fn(r))throw new n(`corrupted fingerprint file`);e.set(t,r.fields.map((e,t)=>c(e,t)?e:0))})},En=(e,t)=>{let n=xn(t,0),r=xn(n,0),i=xn(xn(n,1),0);if(r===void 0||r===1)return;let a=Sn(xn(e===`isabelle`?xn(i,0):i,0)),o=e===`isabelle`?xn(i,1):void 0,s=xn(xn(r,0),0);return{kind:`stored`,method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,...s!==void 0&&{reason:typeof s==`number`?vn[s]:String(xn(s,0))}}},Dn=(e,t)=>{let n=/* @__PURE__ */ new Date,r=t.method,i={float:mt(r)},a=e===`zenon`?I(0,i,5):e===`isabelle`?I(0,I(0,i),r.tactic??`auto`):I(0,i),o=ot(t),s=vn.indexOf(o??``),c=o===void 0?0:I(0,s===-1?I(0,o):s);return I(0,I(0,I(0,$e(t)?0:I(0,c),_n[e].isConstant?_n[e].tag:I(_n[e].tag,a)),I(0,n.getFullYear(),n.getMonth(),n.getDate(),n.getHours(),n.getMinutes(),n.getSeconds()),yn,yn,yn))},On=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=Cn(r)&t-1;n[i]=I(0,r,I(0,...e),n[i])}),I(0,I(0,e.size,I(0,...n),0,512))},kn=e=>String(e).padStart(2,`0`),An=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,i=St(r,`${n.getFullYear()}-${kn(n.getMonth()+1)}-${kn(n.getDate())}_${kn(n.getHours())}_${kn(n.getMinutes())}_${kn(n.getSeconds())}`);Ot(i,{recursive:!0}),[e,...t].filter(e=>F(e)).forEach(e=>Et(e,St(i,vt(e)),{preserveTimestamps:!0})),Mt(r).map(e=>St(r,e)).sort((e,t)=>It(t).mtimeMs-It(e).mtimeMs).slice(10).forEach(e=>Ft(e,{recursive:!0,force:!0}))},jn=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(gn.flatMap(e=>{let n=r[_n[e].field],i=En(e,xn(n,0));return i?(t.set(i,n),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];gn.forEach(e=>{let n=r.get(e);n&&(a[_n[e].field]=t.get(n)??Dn(e,n))}),e.set(i,a)}),Lt(`${i}.tmp`,Buffer.concat([mn(hn),mn(On(e))])),Pt(`${i}.tmp`,i)}}},Mn=((e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,n.length]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[];for(let a=0;a<e.length;a++){let o=n.get(e[a]);o===void 0?(e[a].startsWith(`-`)?i:r).push(e[a]):(t.push({name:e[a],values:e.slice(a+1,a+1+o)}),a+=o)}return{options:t,positionals:r,unknown:i,incomplete:t.find(e=>e.values.length<(n.get(e.name)??0)),has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}})(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`},{flag:`--debug <flags>`,isRepeatable:!0},{flag:`--method <methods>`},{flag:`--solver <command>`},{flag:`--smt-logic <logic>`},{flag:`--stretch <factor>`},{flag:`--noflatten`}]),Nn=[`Usage: tla-ts <Spec.tla|Spec.cfg|spec.ts|glob>... [-config <Spec.cfg>] [-continue] [-deadlock] [-dump [<format>] <file>] [-fp <num>] [-lncheck <final|default|off>] [-maxSetSize <num>] [-metadir <directory>] [-nowarning] [-seed <num>] [-terse] [-tool] [-view] [-workers <count|auto>]`,` ${Mn.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
9
|
+
import{t as e}from"./tlapm.js";import{$ as t,A as n,B as r,C as i,D as a,F as o,G as s,I as c,L as l,M as u,O as d,P as f,Q as p,T as m,V as h,W as g,_,at as v,b as y,c as b,g as x,it as S,j as C,k as w,nt as T,o as E,ot as ee,s as D,tt as O,x as k,y as A}from"./worker.js";import{$ as te,At as ne,E as re,Ft as ie,G as ae,K as oe,M as se,O as ce,Pt as le,Q as ue,S as de,Vt as j,Zt as fe,_n as pe,an as me,b as he,bn as ge,cn as _e,ct as ve,dn as ye,dt as be,en as M,fn as xe,gn as Se,h as Ce,hn as we,ht as Te,i as Ee,in as De,kt as Oe,lt as ke,m as Ae,mn as je,mt as Me,nn as Ne,o as N,on as Pe,ot as Fe,p as Ie,pn as Le,pt as Re,qt as ze,r as Be,rn as Ve,s as He,sn as Ue,tn as P,un as We,ut as Ge,vn as Ke,vt as qe,w as Je,x as Ye,yn as Xe}from"./transfer.js";import{S as Ze,_ as Qe,a as $e,b as et,c as tt,d as nt,f as rt,g as it,h as at,i as ot,l as st,m as ct,n as lt,p as ut,r as dt,s as ft,t as pt,u as mt,v as ht,x as gt,y as _t}from"./prove.js";import{basename as vt,delimiter as yt,dirname as bt,isAbsolute as xt,join as St,resolve as Ct}from"node:path";import{appendFileSync as wt,closeSync as Tt,cpSync as Et,existsSync as F,globSync as Dt,mkdirSync as Ot,openSync as kt,readFileSync as At,readSync as jt,readdirSync as Mt,realpathSync as Nt,renameSync as Pt,rmSync as Ft,statSync as It,writeFileSync as Lt}from"node:fs";import{pathToFileURL as Rt}from"node:url";import{spawnSync as zt}from"node:child_process";import{arch as Bt,availableParallelism as Vt,release as Ht,tmpdir as Ut,type as Wt}from"node:os";import{getHeapStatistics as Gt}from"node:v8";const Kt=`META-INF/MANIFEST.MF`,qt=async e=>{if(e===void 0||!F(e))return`master`;let t=await import(`fflate`),n=t.unzipSync(At(e),{filter:e=>e.name===Kt})[Kt];return(n&&/^X-Git-Tag: *(\S*)/m.exec(t.strFromU8(n))?.[1])===`v1.7.4`?`1.7.4`:`master`},Jt=/[*?[{]/,Yt=e=>e.flatMap(e=>Jt.test(e)?Dt(e).sort().map(e=>({path:e,isGlobbed:!0})):[{path:e,isGlobbed:!1}]),Xt=(e,t)=>e.map(e=>St(e,`${t}.tla`)).find(F),Zt=e=>t=>{let n=Xt(e,t);return n===void 0?void 0:At(n,`utf8`)},Qt=(e,t,n)=>console.error(`File does not exist: ${e}/${t} while looking in these directories: ${e}, ${n.join(`, `)}, classpath:/tla2sany/StandardModules, classpath:/`),$t=e=>`jar:file:${Rt(Ct(e)).pathname}!/tla2sany/StandardModules/`,en=e=>e instanceof h?S(e.code):p(e),tn=(e,t)=>{if(e instanceof _||e instanceof y){let n=Ue(e.message),r=e instanceof h?e.code:n&&!n.isEvalException?n.code:M.general;return t.print(r,P.error,Ve(r,e.message,t.isTool))}console.error(`${e.name}: ${e.message}`)},nn=async(e,t=Ne({isTool:!1}))=>{try{return await e()}catch(e){if(!(e instanceof A))throw e;return tn(e,t),en(e)}},rn=(e,t,n)=>console.error(`File does not exist: ${xt(e)?e:`${process.cwd()}/${e}`} while looking in these directories: ${[...t,...n===void 0?[]:[$t(n)]].join(`, `)}`),an=e=>e.endsWith(`/`)?e:`${e}/`,on=(e,t)=>n=>{let r=e(n);return r===void 0&&!ve.has(n)&&t(`${n}.tla`),r},sn=e=>e.classPath?.split(yt).find(e=>e.endsWith(`.jar`));var cn=`0.0.10-dev.f57f64938`;const ln=2224400062,un={int8:0,int16:1,int32:2,shared8:4,shared16:5,shared32:6,block32:8,string8:9,string32:10,doubleLittle:12},dn={smallInt:64,smallString:32,smallBlock:128},I=(e,...t)=>({tag:e,fields:t}),fn=e=>typeof e==`object`&&`tag`in e,pn=(e,t)=>{let r=new DataView(e.buffer,e.byteOffset,e.byteLength);if(e.length<t+20||r.getUint32(t)!==ln)throw new n(`corrupted fingerprint file`);let i=t+20+r.getUint32(t+4),a=[],o=t+20,s=e=>{let t=o;if(o+=e,o>i)throw new n(`corrupted fingerprint file`);return t},c=new TextDecoder,l=t=>{let n=s(t),r=c.decode(e.subarray(n,n+t));return a.push(r),r},u=(e,t)=>{let n=I(e);t>0&&a.push(n);for(let e=0;e<t;e++)n.fields.push(f());return n},d=e=>a[a.length-e],f=()=>{let t=e[s(1)];if(t>=dn.smallBlock)return u(t&15,t>>4&7);if(t>=dn.smallInt)return t&63;if(t>=dn.smallString)return l(t&31);switch(t){case un.int8:return r.getInt8(s(1));case un.int16:return r.getInt16(s(2));case un.int32:return r.getInt32(s(4));case un.shared8:return d(r.getUint8(s(1)));case un.shared16:return d(r.getUint16(s(2)));case un.shared32:return d(r.getUint32(s(4)));case un.block32:{let e=r.getUint32(s(4));return u(e&255,e>>>10)}case un.string8:return l(r.getUint8(s(1)));case un.string32:return l(r.getUint32(s(4)));case un.doubleLittle:{let e={float:r.getFloat64(s(8),!0)};return a.push(e),e}}throw new n(`corrupted fingerprint file`)};return{value:f(),next:i}},mn=e=>{let t=[],n=0,r=0,i=0,a=(e,n)=>{for(let r=(n-1)*8;r>=0;r-=8)t.push(e>>>r&255)},o=new TextEncoder,s=e=>{if(typeof e==`number`)return e>=0&&e<64?t.push(dn.smallInt+e):e>=-128&&e<128?t.push(un.int8,e&255):e>=-32768&&e<32768?(t.push(un.int16),a(e,2)):(t.push(un.int32),a(e,4));if(n++,typeof e==`string`){let n=o.encode(e);n.length<32?t.push(dn.smallString+n.length):n.length<256?t.push(un.string8,n.length):(t.push(un.string32),a(n.length,4)),t.push(...n),r+=1+Math.floor((n.length+4)/4),i+=1+Math.floor((n.length+8)/8);return}if(!fn(e)){let n=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(8));n.setFloat64(0,e.float,!0),t.push(un.doubleLittle,...new Uint8Array(n.buffer)),r+=3,i+=2;return}let c=e.fields.length;c===0?n--:(r+=1+c,i+=1+c),e.tag<16&&c<8?t.push(dn.smallBlock+e.tag+(c<<4)):(t.push(un.block32),a(c*1024+e.tag,4)),e.fields.forEach(s)};s(e);let c=/* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(20));return[ln,t.length,n,r,i].forEach((e,t)=>c.setUint32(t*4,e)),new Uint8Array([...new Uint8Array(c.buffer),...t])},hn=20210223,gn=[...tt,`cooper`,`expandenabled`,`expandcdot`,`lambdify`,`enabledaxioms`,`levelcomparison`],_n={zenon:{field:1,tag:1},isabelle:{field:2,tag:0},cooper:{field:4,tag:3,isConstant:!0},smt:{field:10,tag:8},z3:{field:11,tag:9},ls4:{field:17,tag:16},expandenabled:{field:18,tag:6,isConstant:!0},expandcdot:{field:19,tag:8,isConstant:!0},lambdify:{field:20,tag:9,isConstant:!0},enabledaxioms:{field:21,tag:10,isConstant:!0},levelcomparison:{field:22,tag:11,isConstant:!0}},vn=[`false`,`timeout`],yn=`tla-ts ${cn}`,bn=/* @__PURE__ */ new Map([[_n.zenon.field,3],[_n.isabelle.field,4]]),xn=(e,t)=>e!==void 0&&fn(e)?e.fields[t]:void 0,Sn=e=>e!==void 0&&typeof e==`object`&&`float`in e?e.float:1/0,Cn=e=>{let t=new TextEncoder().encode(e),n=(e,t)=>e<<t|e>>>32-t,r=Array.from({length:Math.ceil(t.length/4)},(e,n)=>t[n*4]|t[n*4+1]<<8|t[n*4+2]<<16|t[n*4+3]<<24).reduce((e,t)=>{let r=Math.imul(n(Math.imul(t,3432918353),15),461845907);return Math.imul(n(e^r,13),5)+3864292196|0},0),i=Math.imul(r^t.length^(r^t.length)>>>16,2246822507),a=Math.imul(i^i>>>13,3266489909);return(a^a>>>16)&1073741823},wn=e=>e!==void 0&&fn(e)?[[e.fields[0],e.fields[1]],...wn(e.fields[2])]:[],Tn=(e,t,r)=>{let i=At(t),a=pn(i,0),o=pn(i,a.next).value;if(a.value!==hn||!fn(o)||o.tag!==0)throw new n(`corrupted fingerprint file`);let s=xn(xn(o,0),1),c=(e,t)=>{let n=bn.get(t);return!r||n===void 0||xn(xn(e,0),n)===yn};e.clear(),(s!==void 0&&fn(s)?s.fields:[]).flatMap(e=>wn(e).toReversed()).forEach(([t,r])=>{if(typeof t!=`string`||!fn(r))throw new n(`corrupted fingerprint file`);e.set(t,r.fields.map((e,t)=>c(e,t)?e:0))})},En=(e,t)=>{let n=xn(t,0),r=xn(n,0),i=xn(xn(n,1),0);if(r===void 0||r===1)return;let a=Sn(xn(e===`isabelle`?xn(i,0):i,0)),o=e===`isabelle`?xn(i,1):void 0,s=xn(xn(r,0),0);return{kind:`stored`,method:{prover:e,timeLimitMs:a*1e3,...typeof o==`string`&&{tactic:o}},isProved:r===0,...s!==void 0&&{reason:typeof s==`number`?vn[s]:String(xn(s,0))}}},Dn=(e,t)=>{let n=/* @__PURE__ */ new Date,r=t.method,i={float:mt(r)},a=e===`zenon`?I(0,i,5):e===`isabelle`?I(0,I(0,i),r.tactic??`auto`):I(0,i),o=ot(t),s=vn.indexOf(o??``),c=o===void 0?0:I(0,s===-1?I(0,o):s);return I(0,I(0,I(0,$e(t)?0:I(0,c),_n[e].isConstant?_n[e].tag:I(_n[e].tag,a)),I(0,n.getFullYear(),n.getMonth(),n.getDate(),n.getHours(),n.getMinutes(),n.getSeconds()),yn,yn,yn))},On=e=>{let t=2**Math.max(9,Math.ceil(Math.log2(e.size/2))),n=Array.from({length:t},()=>0);return e.forEach((e,r)=>{let i=Cn(r)&t-1;n[i]=I(0,r,I(0,...e),n[i])}),I(0,I(0,e.size,I(0,...n),0,512))},kn=e=>String(e).padStart(2,`0`),An=(e,t)=>{let n=/* @__PURE__ */ new Date,r=`${e}.history`,i=St(r,`${n.getFullYear()}-${kn(n.getMonth()+1)}-${kn(n.getDate())}_${kn(n.getHours())}_${kn(n.getMinutes())}_${kn(n.getSeconds())}`);Ot(i,{recursive:!0}),[e,...t].filter(e=>F(e)).forEach(e=>Et(e,St(i,vt(e)),{preserveTimestamps:!0})),Mt(r).map(e=>St(r,e)).sort((e,t)=>It(t).mtimeMs-It(e).mtimeMs).slice(10).forEach(e=>Ft(e,{recursive:!0,force:!0}))},jn=e=>{let t=/* @__PURE__ */ new Map,n=/* @__PURE__ */ new Map,r=new Map([...e].map(([e,r])=>{let i=new Map(gn.flatMap(e=>{let n=r[_n[e].field],i=En(e,xn(n,0));return i?(t.set(i,n),[[e,i]]):[]}));return n.set(i,r),[e,i]}));return{results:r,save:i=>{e.clear(),r.forEach((r,i)=>{let a=[...n.get(r)??Array(23).fill(0)];gn.forEach(e=>{let n=r.get(e);n&&(a[_n[e].field]=t.get(n)??Dn(e,n))}),e.set(i,a)}),Lt(`${i}.tmp`,Buffer.concat([mn(hn),mn(On(e))])),Pt(`${i}.tmp`,i)}}},Mn=((e,t)=>{let n=new Map(t.map(e=>{let[t,...n]=e.flag.split(` `);return[t,n.length]}));return{usage:e.replace(`{options}`,t.map(e=>`[${e.flag}]${e.isRepeatable?`...`:``}`).join(` `)),parse:e=>{let t=[],r=[],i=[];for(let a=0;a<e.length;a++){let o=n.get(e[a]);o===void 0?(e[a].startsWith(`-`)?i:r).push(e[a]):(t.push({name:e[a],values:e.slice(a+1,a+1+o)}),a+=o)}return{options:t,positionals:r,unknown:i,incomplete:t.find(e=>e.values.length<(n.get(e.name)??0)),has:e=>t.some(t=>t.name===e),get:e=>t.findLast(t=>t.name===e)?.values}}}})(`tla-ts tlapm {options} <Module.tla|glob>...`,[{flag:`-N`},{flag:`--summary`},{flag:`--strict`},{flag:`--toolbox <start> <end>`},{flag:`--line <num>`},{flag:`--printallobs`},{flag:`--threads <num>`},{flag:`--version`},{flag:`-I <directory>`,isRepeatable:!0},{flag:`-k`},{flag:`--noproving`},{flag:`--nofp`},{flag:`--nofpl <start> <end>`},{flag:`--safefp`},{flag:`--cleanfp`},{flag:`--usefp <file>`},{flag:`--cache-dir <directory>`},{flag:`--debug <flags>`,isRepeatable:!0},{flag:`--method <methods>`},{flag:`--solver <command>`},{flag:`--smt-logic <logic>`},{flag:`--stretch <factor>`},{flag:`--noflatten`}]),Nn=[`Usage: tla-ts <Spec.tla|Spec.cfg|spec.ts|glob>... [-config <Spec.cfg>] [-continue] [-deadlock] [-dump [<format>] <file>] [-fp <num>] [-lncheck <final|default|off>] [-maxSetSize <num>] [-metadir <directory>] [-nowarning] [-seed <num>] [-terse] [-tool] [-view] [-workers <count|auto>]`,` ${Mn.usage}`,` tla-ts [<JVM option>]... tlc2.TLC <TLC option>... <Spec>`,` (-cp tla2tools.jar or -Dtla-ts.tlc=1.7.4 picks the TLC to reproduce)`,` tla-ts [<JVM option>]... tla2sany.xml.XMLExporter [-I <directory>]... [-o] [-t] [-r] [-u] <Module.tla>`].join(`
|
|
10
10
|
`),Pn={name:``,values:[],doc:` `},Fn=[Pn,{name:`(basic options)`,values:[],doc:` `},Pn,{name:`--help`,values:[],doc:` show this help message and exit`},{name:`-help`,values:[],doc:` (same as --help)`},{name:`--version`,values:[],doc:` show version number and exit`},{name:`--verbose`,values:[],doc:` produce verbose messages`},{name:`-v`,values:[],doc:` (same as --verbose)`},Pn,{name:`--where`,values:[],doc:` show location of standard library and exit`},{name:`--config`,values:[],doc:` show configuration and exit`},{name:`--summary`,values:[],doc:` show summary of theorems (implies -N and not -C)`},{name:`--strict`,values:[],doc:` report incomplete proofs, empty proof targets and failed obligations as errors and exit with a non-zero status`},{name:`--timing`,values:[],doc:` show runtime statistics`},Pn,{name:`-I`,values:[`string`],doc:`<dir> add <dir> to search path`},{name:`-d`,values:[`string`],doc:``},Pn,{name:`-k`,values:[],doc:` keep going on backend failures`},{name:`-N`,values:[],doc:` do not run any backend verifiers`},{name:`-C`,values:[],doc:` check proofs in Isabelle/TLA+`},Pn,{name:`--threads`,values:[`int`],doc:`<int> set number of worker threads to <int>`},{name:`--method`,values:[`string`],doc:`<meth> set default method to <meth> (try --method help)`},{name:`--solver`,values:[`string`],doc:`<solver> set SMT solver to <solver>`},{name:`--smt-logic`,values:[`string`],doc:`<logic> set SMT logic to <logic>`},{name:`--stretch`,values:[`float`],doc:`<f> multiply all timeouts by <f>`},{name:`--fast-isabelle`,values:[],doc:``},Pn,{name:`(advanced options)`,values:[],doc:` `},Pn,{name:`--noflatten`,values:[],doc:` do not flatten obligations`},{name:`--nonormal`,values:[],doc:` do not normalize obligations before printing`},{name:`--debug`,values:[`string`],doc:`{[-]<flag>} enable/disable debugging flags`},{name:`--paranoid`,values:[],doc:``},{name:`--isaprove`,values:[],doc:``},Pn,{name:`--toolbox`,values:[`int`,`int`],doc:`<int><int> toolbox mode`},{name:`--toolbox-vsn`,values:[`int`],doc:`<int> Toolbox protocol version, 1|2, 1 by default.`},{name:`--line`,values:[`int`],doc:`<int> line to prove`},{name:`--wait`,values:[`int`],doc:`<time> wait for <time> before printing obligations in progress`},{name:`--stdin`,values:[],doc:` read the tla file from stdin instead of file system. Only applies if single tla file is provided as input.`},{name:`--prefer-stdlib`,values:[],doc:` prefer built-in standard modules if the module search path contains files with the same names as modules in stdlib.`},{name:`--parser`,values:[`string`],doc:` Set parser backend to use: TLAPM (default) or SANY.`},{name:`--module-jar`,values:[`string`],doc:` Add a path to a .jar file containing additional TLA+ modules, such
|
|
11
11
|
as the community modules. Multiple .jar files can be added by using
|
|
12
12
|
this option multiple times.`},{name:`--noproving`,values:[],doc:` do not prove, report fingerprinted results only`},Pn,{name:`--printallobs`,values:[],doc:` print obligations in all toolbox messages`},Pn,{name:`--fpdir`,values:[`string`],doc:``},{name:`--safefp`,values:[],doc:` check tlapm, zenon, Isabelle versions for fingerprints`},{name:`--nofp`,values:[],doc:` do not use existing fingerprints, but overwrite any preexisting fingerprints associated with the current proof obligations, using the newly computed fingerprints and results`},{name:`--nofpl`,values:[`int`,`int`],doc:`<int><int> disable fingerprint use between given lines`},{name:`--cleanfp`,values:[],doc:` erase fingerprint file before starting`},Pn,{name:`--erasefp`,values:[`string`,`string`],doc:`<f><back> erase from file <f> all results of backend <back>`},{name:`--printfp`,values:[`string`],doc:`<f> print the fingerprints stored in file <f> and quit`},{name:`--usefp`,values:[`string`],doc:`<f> load fingerprints from file <f> (save as usual)`},{name:`--fpp`,values:[],doc:` print the fingerprints of obligations in toolbox messages`},{name:`--cache-dir`,values:[`string`],doc:'<directory> save auxiliary and temporary files under <directory>. Alternatively, this directory can be defined via the variable `TLAPM_CACHE_DIR` of the runtime environment. The command-line parameter takes precedence over the environment variable. If neither is specified, the default value is ".tlacache".'}],In=e=>/^[^ ]* */.exec(e)?.[0].length??0,Ln=()=>{let e=Math.max(...Fn.map(e=>e.name.length+In(e.doc)));return`Usage: tla-ts tlapm <options> FILE ...\noptions are:\n${Fn.filter(e=>e.doc!==``).map(t=>{let n=In(t.doc);return` ${t.name} ${t.doc.slice(0,n)}${` `.repeat(e-t.name.length-n)}${t.doc.slice(n)}\n`}).join(``)}`},Rn=e=>{for(let t=0;t<e.length;t++){let n=e[t];if(n===`--version`)return;if(!n.startsWith(`-`))continue;let r=Fn.find(e=>e.name===n);if(!r)return`unknown option '${n}'`;for(let i of r.values){if(t++,t===e.length)return`option '${n}' needs an argument`;let r=e[t];if(i===`int`&&ut(r)===void 0)return`wrong argument '${r}'; option '${n}' expects an integer`;if(i===`float`&&rt(r)===void 0)return`wrong argument '${r}'; option '${n}' expects a float`}let i=e[t];if(n===`--threads`&&(ut(i)??0)<0)return`--threads requires a positive argument`;if(n===`--debug`&&i.split(`,`).includes(`oldsmt`))return`--debug oldsmt: the old SMT encoding has been removed`;if(n===`--method`)try{nt(i)}catch(e){if(!(e instanceof C))throw e;return e.message}}},zn=t=>[`.`,...e().map(e=>St(bt(bt(Nt(e))),`lib/tlapm/stdlib`)).filter(F).slice(0,1),...t.options.flatMap(e=>e.name===`-I`?e.values:[]).toReversed()],Bn=e=>console.error(`@!!BEGIN\n${e.map(e=>`@!!${e}\n`).join(``)}@!!END\n`),Vn=(e,t,n)=>Bn([`type:obligation`,`id:${e.id}`,`loc:${e.location}`,`status:${t}`,...n]),Hn=e=>/^[+,\-./0-9:=@A-Z_a-z]+$/.test(e)?e:`'${e.replaceAll(`'`,`'\\''`)}'`,Un={failed:10,incomplete:11,emptyTarget:12},Wn=(e,t,n)=>{let r=e.summary;n||(r.absent.forEach(e=>console.error(`Missing proof at ${gt(e)}`)),r.omitted.forEach(e=>console.error(`Omitted proof at ${gt(e)}`)));let i=r.absent.length+r.omitted.length>0;i&&console.error(`${et(e.location)}[ERROR]: Proof incomplete in module ${JSON.stringify(e.name)}: ${r.absent.length} missing, ${r.omitted.length} omitted proof step(s).`);let a=t&&e.obligations.length===0;return a&&console.error(`${et(e.location)}[ERROR]: No proof obligation found for the selected target.`),[...i?[Un.incomplete]:[],...a?[Un.emptyTarget]:[]]},Gn=(e,t,n)=>{console.error(` tlapm ending abnormally with ${e.exception}\n`),n&&Bn(t.message===``?[`type:error`,`url:http://tla.msr-inria.inria.fr/bugs`,`msg:Oops, this seems to be a bug in TLAPM.\nPlease give feedback to developers.\n\n\n ${e.exception}\n`]:[`type:warning`,`msg:${t.location===void 0?``:`${t.location}\n\n`}${t.message}`])},Kn=e=>{if(!(e instanceof n))throw e;return{kind:`aborted`,error:e}},qn=e=>{try{return{kind:`done`,value:e()}}catch(e){return Kn(e)}},Jn=(e,t,n)=>{let r=t.method.timeLimitMs,i=t.kind===`decided`?`; time-used: ${(t.timeUsedMs/1e3).toFixed(1)} (${Math.round(100*t.timeUsedMs/r)}%)`:``,a=r===0?``:`time-limit: ${r===1/0?`inf`:Number((r/1e3).toPrecision(6))}${i}`,o=[t.method.tactic,a].filter(Boolean).join(`; `),s=ot(t),c=$e(t),l=t.kind===`reused`,u=t.kind===`decided`?t.note:t.kind===`refused`?`${t.reason}\nObligation:\n\n`:t.kind===`unavailable`?`\n\\* ${t.warning}\n`:void 0,d=t.kind===`unavailable`||l?t.shipped:void 0;Vn(e,c?`proved`:`failed`,[`prover:${t.method.prover}`,...o===``?[]:[`meth:${o}`],...s===void 0?[]:[`reason:${s}`],`already:${l}`,...c?[]:[`obl:${l?``:u??`
|
|
@@ -44,7 +44,7 @@ Temporal formula used as set.`)),uc(e,e.set)),e.levelCorrect;case`AssumeProve`:r
|
|
|
44
44
|
`:e.length===1?`Temporal property ${e[0]} was violated.\n`:`Temporal properties ${e.slice(0,-1).join(`, `)}${e.length>2?`,`:``} and ${e[e.length-1]} were violated.\n`,Il=e=>e.filter((t,n)=>t!==e[n-1]).map((e,t)=>`${t}) ${oe(e)}\n`).toReversed().join(``),Ll=e=>{if(e.length===0)return` The error call stack is empty.
|
|
45
45
|
`;let t=[];return e.forEach((n,r)=>{let i=n.location.range;n!==e[r-1]&&i&&t.push(`${t.length}. Line ${i.start.line}, column ${i.start.column} to line ${i.end.line}, column ${i.end.column} in ${i.module}\n`)}),`${t.join(``)}\n`},Rl=(e,t)=>{let n=t.generated,r=t.distinct,i=me(/* @__PURE__ */ new Date);n===r?e.print(M.initGenerated1,P.none,`Finished computing initial states: ${r} distinct state${r===1?``:`s`} generated at ${i}.`):e.print(M.initGenerated2,P.none,`Finished computing initial states: ${n} state${n===1?``:`s`} generated, with ${r} of them distinct at ${i}.`)},zl=(e,t,n)=>{let r=Math.max(Date.now()-(n??0),1)/6e4,i=e=>e.toLocaleString(`en-US`),a=(e,t)=>n===void 0?``:` (${i(Math.floor(e/r))} ${t}/min)`;e.print(M.progress,P.none,`Progress(${Math.max(t.depth,1)}) at ${me(/* @__PURE__ */ new Date)}: ${i(t.generatedStates)} states generated${a(t.generatedStates,`s`)}, ${i(t.distinctStates)} distinct states found${a(t.distinctStates,`ds`)}, ${i(t.queuedStates)} states left on queue.`)},Bl={init:M.coverageInit,next:M.coverageNext,invariant:M.coverageProperty,implied:M.coverageProperty,constraint:M.coverageConstraint},Vl=(e,t,n)=>{let r=(t,n)=>e.print(t,P.none,n);r(M.coverageStart,`The coverage statistics at ${me(/* @__PURE__ */ new Date)} (see https://explain.tlapl.us/module-coverage-statistics for how to interpret the following statistics).`),t.variables.forEach(e=>r(M.coverageVariable,`<${e.label}>: ${e.distinct}`)),t.relations.forEach(e=>{let t=Bl[e.kind];r(t,t===M.coverageProperty?`<${e.label}>`:`<${e.label}>: ${e.distinct}:${e.generated}`),e.expressions.forEach(e=>{let t=` ${`|`.repeat(e.depth)}${e.location}`;e.cost>0?r(M.coverageValueCost,`${t}: ${e.count}:${e.cost}`):r(M.coverageValue,`${t}: ${e.count}`)})}),Date.now()-n>3e5?r(M.coverageEndOverhead,`End of statistics (please note that for performance reasons large models
|
|
46
46
|
are best checked with coverage and cost statistics disabled).`):r(M.coverageEnd,`End of statistics.`)},Hl=(e,t)=>St(e,`${t}.class`),Ul=(e,t,n,r)=>{let i=e.print;switch(t.kind){case`parsed`:n.isParsed=!0,e.isTool&&i(M.sanyFinished,P.none,`SANY finished.`),i(M.starting,P.none,`Starting... (${me(/* @__PURE__ */ new Date)})`);return;case`constant-level-invariant`:if(e.version===`1.7.4`)return;i(M.constantLevelInvariant,P.warning,`The invariant ${t.name} is a constant-level formula (i.e., it contains no variables, primes, or temporal operators) and evaluates to TRUE. To assert constant-level formulas in your spec, use ASSUME ConstInv. If you optionally want to give the assumption a name, write ASSUME YourAssumption == ConstInv instead. See https://explain.tlapl.us/assumptions-and-invariants for additional details.`);return;case`state-level-property`:if(e.version===`1.7.4`)return;i(M.stateLevelProperty,P.warning,`The formula ${t.name} is a state-level formula, but it was used as a PROPERTY (or PROPERTIES), where a temporal formula is typically expected. State-level formulas used as PROPERTY or PROPERTIES are only checked in the initial state. To verify that the formula ${t.name} holds in all states of every behavior, use INVARIANT ${t.name} instead. Alternatively, applying the "always" temporal operator ([]) to the state-level formula ${t.name} changes it into a temporal formula, asserting that ${t.name} holds in all states of every behavior. See https://explain.tlapl.us/invariants-and-properties for additional details.`);return;case`liveness-initializing`:t.isSymmetric&&i(M.livenessSymmetry,P.warning,`Declaring symmetry during liveness checking is dangerous. It might cause TLC to miss violations of the stated liveness properties. Please check liveness without symmetry defined.`),t.isConstrained&&e.version===`1.7.4`&&i(M.livenessConstraints,P.warning,`Declaring state or action constraints during liveness checking is dangerous: Please read section 14.3.5 on page 247 of Specifying Systems (https://lamport.azurewebsites.net/tla/book.html) and optionally the discussion at https://discuss.tlapl.us/msg00994.html for more details.`);return;case`liveness-prepared`:i(M.temporalBranches,P.none,`Implied-temporal checking--satisfiability problem has ${t.branches} branches.`);return;case`java-override`:{let e=Rt(Ct(Hl(r,t.module))).href;i(t.isMatched?M.javaOverrideLoaded:M.javaOverrideMismatch,t.isMatched?P.none:P.warning,`${t.isMatched?`Loading`:`Failed to match`} ${t.operator} operator override from ${e.replace(`file:///`,`file:/`)} with signature: <Java Method: ${t.signature}>.`);return}case`initial-states-started`:i(M.computingInit,P.none,`Computing initial states...`);return;case`initial-states-progress`:Ol(e,t.count);return;case`initial-states-computed`:Rl(e,t.initialStates);return;case`progress`:zl(e,t.statistics,n.startTime),t.statistics.coverage&&Vl(e,t.statistics.coverage,n.startTime);return;case`liveness-started`:{n.livenessStartTime=Date.now(),t.isComplete&&zl(e,t.statistics);let r=t.branches>1?`${t.branches} branches of `:``,a=t.branches*t.states;i(M.checkingTemporal,P.none,`Checking ${r}temporal properties for the ${t.isComplete?`complete`:`current`} state space with ${a} total distinct states at (${me(/* @__PURE__ */ new Date)})`);return}case`liveness-finished`:Wl(e,n);return;case`sequential-fallback`:process.stderr.write(`Warning: the search ordered the string ${JSON.stringify(t.string)} against another string it created, so tla-ts checks the model again with one worker. Workers don't agree on the order of strings the search creates.\n`);return;case`warning`:i(t.code,P.warning,t.text);return;case`violation`:Kl(t.status,t.violation,e)}},Wl=(e,t)=>{t.livenessStartTime!==void 0&&(e.print(M.checkingTemporalEnd,P.none,`Finished checking temporal properties in ${Pe(Date.now()-t.livenessStartTime)} at ${me(/* @__PURE__ */ new Date)}`),t.livenessStartTime=void 0)},Gl=(e,t)=>{t&&(t.counts&&console.log(t.counts),e.print(t.code,P.error,Ve(t.code,t.message,e.isTool)))},Kl=(e,t,n)=>{let r=n.print,i=t.name,a=t.loopStart,o=a===void 0&&t.trace.length===1&&(e===`invariant-violation`||e===`liveness-violation`),s={code:M.temporalPropertyViolated,text:Fl(t.properties??[i],n.version)},c={success:void 0,error:void 0,"assumption-violation":t.message?{code:M.assumptionEvaluationError,text:Ve(M.assumptionEvaluationError,`Evaluating assumption ${i} failed.\n${t.message}`,n.isTool)}:{code:M.assumptionFalse,text:`Assumption ${i} is false.`},deadlock:{code:M.deadlockReached,text:`Deadlock reached.`},"invariant-violation":o?kl(`invariant-violation`,i):{code:M.invariantViolatedBehavior,text:`Invariant ${i} is violated.`},"property-violation":s,"liveness-violation":a===void 0?o?kl(`liveness-violation`,i):{code:M.actionPropertyViolatedBehavior,text:`Action property ${i} is violated.`}:s,"postcondition-violation":{code:t.postcondition?.code??M.general,text:Ve(t.postcondition?.code??M.general,t.message??`Postcondition ${i} is false.`,n.isTool)}}[e],l=e===`property-violation`,u=a!==void 0&&!l,d=l||u;if(d&&n.version!==`1.7.4`&&Al(n,t.trace[0]?.output),t.counts&&console.log(t.counts),c){let e=o?`${c.text}\n${j(t.trace[0].state)}`:c.text;r(c.code,P.error,e)}if(o||(d||Al(n,t.trace[0]?.output),Pl(n,t.trace,d?`counter-example`:`error-trace`)),Al(n,t.traceOutput),u){let e=t.loopLabel;a===t.trace.length-1?r(M.statePrint3,P.state,`${a+2}: Stuttering`):n.isTool?r(M.backToState,P.state,`${a+1}: Back to state${e?`: <${e}>\n`:``}`):console.log(`Back to state ${a+1}${e?`: <${e}>\n`:``}`)}t.warning&&n.version!==`1.7.4`&&r(t.warning.code,P.warning,t.warning.text);let f=t.unwitnessed??(e===`postcondition-violation`?void 0:t.postcondition);return Al(n,t.postconditionOutput),Gl(n,f),!o&&e!==`assumption-violation`},ql=(e,t)=>e.print(M.nestedExpression,P.error,`The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\n${Ll(t)}`),Jl=(e,t,n)=>e.print(M.success,P.none,[`Model checking completed. No error has been found.`,` Estimates of the probability that TLC did not check all reachable states`,` because two distinct states had the same fingerprint:`,` calculated (optimistic): val = ${Be(t)}`,...n===void 0?[]:[` based on the actual fingerprints: val = ${Be(n)}`]].join(`
|
|
47
|
-
`)),Yl=(e,t)=>{switch(t.kind){case`message`:e.print(t.code,t.isError?P.error:P.none,e.isTool?t.toolMessage:t.message);return;case`behavior`:t.states.forEach((n,r)=>t.isInvariant?e.print(M.statePrint2,P.state,`${r+1}: \n${j(n,e.isDiffTrace?t.states[r-1]:void 0)}`):e.print(M.statePrint1,P.state,`${r+1}:\n${j(n)}`));return;case`nested-expressions`:ql(e,t.callStack);return;case`success`:Jl(e,t.optimistic,t.actual)}},Xl=(e,t,n)=>{let r=t.print;if(e.failure){let n=e.failure,i=t.isTool?n.toolMessage:n.message,a=()=>{let e=n.fingerprint;if(e){let i=n.callStack?.length&&t.version!==`1.7.4`?Ll(n.callStack):Il(e.sources);r(M.fingerprintFailed,P.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${i}\nReason:\n${De(e.reason,t.isTool)}`)}else n.callStack&&ql(t,n.callStack)};n.isCallStackFirst&&a();let o=n.initialState&&(()=>{try{return`While working on the initial state:\n${j(n.initialState)}`}catch(e){throw e instanceof y?v(new y(`${s}${e.message}`),T.error):e}})();r(o?M.initialState:n.code,P.error,o?`${i}\n${o}`:i),Al(t,n.trace[0]?.output),Pl(t,n.trace,`error-trace`);let c=n.traceFailure;c&&r(c.code,P.error,t.isTool?c.toolMessage:c.message),Al(t,n.traceOutput),Gl(t,n.postcondition),n.isCallStackFirst||a()}else if(e.violation){if(!Kl(e.status,e.violation,t))return;let n=e.additionalViolation;n&&Kl(`property-violation`,n,t),e.liveCallStack&&ql(t,e.liveCallStack)}else e.status===`success`&&(Wl(t,n),Jl(t,N(e.distinctStates,e.generatedStates),e.fingerprintDistance===void 0?void 0:Ee(e.fingerprintDistance)));if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&Wl(t,n),e.coverage&&Vl(t,e.coverage,n.startTime),t.isTool&&zl(t,e,n.startTime),r(M.stats,P.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let i=t.version===`1.7.4`,a=i?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!i||a)&&r(M.searchDepth,P.none,`The depth of the complete state graph search is ${i?Math.max(e.depth,1):e.depth}.`);let o=a&&He(a);o&&r(M.stateGraphOutdegree,P.none,o)},Zl=e=>e.print(M.version,P.none,`TLC2 Version ${cn} (rev: tla-ts)`),Ql=(e,t,n)=>{let r=Ne({isTool:e,version:t});return Zl(r),r.print(M.commandLineError,P.error,`${n}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1},$l=(e,t)=>{let n=`${t.workers} worker${t.workers===1?``:`s`} on ${Vt()} cores with ${Math.floor(Gt().heap_size_limit/1024/1024)}MB heap and
|
|
47
|
+
`)),Yl=(e,t)=>{switch(t.kind){case`message`:e.print(t.code,t.isError?P.error:P.none,e.isTool?t.toolMessage:t.message);return;case`behavior`:t.states.forEach((n,r)=>t.isInvariant?e.print(M.statePrint2,P.state,`${r+1}: \n${j(n,e.isDiffTrace?t.states[r-1]:void 0)}`):e.print(M.statePrint1,P.state,`${r+1}:\n${j(n)}`));return;case`nested-expressions`:ql(e,t.callStack);return;case`success`:Jl(e,t.optimistic,t.actual)}},Xl=(e,t,n)=>{let r=t.print;if(e.failure){let n=e.failure,i=t.isTool?n.toolMessage:n.message,a=()=>{let e=n.fingerprint;if(e){let i=n.callStack?.length&&t.version!==`1.7.4`?Ll(n.callStack):Il(e.sources);r(M.fingerprintFailed,P.error,`TLC was unable to fingerprint.\n\nFingerprint Stack Trace:\n${i}\nReason:\n${De(e.reason,t.isTool)}`)}else n.callStack&&ql(t,n.callStack)};n.isCallStackFirst&&a();let o=n.initialState&&(()=>{try{return`While working on the initial state:\n${j(n.initialState)}`}catch(e){throw e instanceof y?v(new y(`${s}${e.message}`),T.error):e}})();r(o?M.initialState:n.code,P.error,o?`${i}\n${o}`:i),Al(t,n.trace[0]?.output),Pl(t,n.trace,`error-trace`);let c=n.traceFailure;c&&r(c.code,P.error,t.isTool?c.toolMessage:c.message),Al(t,n.traceOutput),Gl(t,n.postcondition),n.isCallStackFirst||a()}else if(e.violation){if(!Kl(e.status,e.violation,t))return;let n=e.additionalViolation;n&&Kl(`property-violation`,n,t),e.liveCallStack&&ql(t,e.liveCallStack)}else e.status===`success`&&(Wl(t,n),Jl(t,N(e.distinctStates,e.generatedStates),e.fingerprintDistance===void 0?void 0:Ee(e.fingerprintDistance)));if(e.failure?.isWithoutStatistics)return;e.status!==`success`&&Wl(t,n),e.coverage&&Vl(t,e.coverage,n.startTime),t.isTool&&zl(t,e,n.startTime),r(M.stats,P.none,`${e.generatedStates} states generated, ${e.distinctStates} distinct states found, ${e.queuedStates} states left on queue.`);let i=t.version===`1.7.4`,a=i?e.outDegrees??e.violationOutDegrees:e.outDegrees;(!i||a)&&r(M.searchDepth,P.none,`The depth of the complete state graph search is ${i?Math.max(e.depth,1):e.depth}.`);let o=a&&He(a);o&&r(M.stateGraphOutdegree,P.none,o)},Zl=e=>e.print(M.version,P.none,`TLC2 Version ${cn} (rev: tla-ts)`),Ql=(e,t,n)=>{let r=Ne({isTool:e,version:t});return Zl(r),r.print(M.commandLineError,P.error,`${n}\nUsage: java tlc2.TLC [-help] [-option] inputfile`),1},$l=(e,t)=>{let n=`${t.workers} worker${t.workers===1?``:`s`} on ${Vt()} cores with ${Math.floor(Gt().heap_size_limit/1024/1024)}MB heap and 64MB offheap memory [pid: ${process.pid}] (${Wt()} ${Ht()} ${Bt()}, Node.js ${process.versions.node} ${process.arch.endsWith(`64`)?64:32}bit`;t.mode===`model-check`&&t.dfidDepth!==void 0?e.print(M.depthFirstModelChecking,P.none,`Running depth-first search Model-Checking with fp ${t.fingerprintIndex} and seed ${t.seed} with ${n}).`):t.mode===`model-check`?e.print(M.modelChecking,P.none,`Running breadth-first search Model-Checking with fp ${t.fingerprintIndex} and seed ${t.seed} with ${n}, MSBDiskFPSet, DiskStateQueue).`):e.print(M.simulating,P.none,`Running ${t.scheduler===`rl`?`RL`:`Random`} Simulation with seed ${t.seed} with ${n}).`)},eu=(e,t)=>{let n=e.print;switch(t.kind){case`message`:n(t.code,t.isError?P.error:P.none,e.isTool?t.toolMessage:t.message);return;case`behavior`:{let r=t.trace[t.trace.length-1];if(!t.isLastStateOnly){Pl(e,t.trace,`simulation`);return}n(M.errorState,P.none,`The error state is:
|
|
48
48
|
`),n(M.statePrint1,P.state,`:\n${j(r.state)}`);return}case`progress`:{let r=t.statistics;if(e.isTool){tu(e,r);return}let i=r.levelM2/(r.traces+1);n(M.simulationProgress,P.none,`Progress: ${r.generatedStates} states checked, ${r.traces} traces generated (trace length: mean=${r.levelMean}, var(x)=${Math.round(i)}, sd=${Math.round(Math.sqrt(i))})`);return}case`summary`:e.isTool&&tu(e,t.statistics),n(M.simulationStats,P.none,`The number of states generated: ${t.statistics.generatedStates}\nSimulation using seed ${t.statistics.seed} and aril ${t.statistics.aril}`)}},tu=(e,t)=>e.print(M.simulationProgress,P.none,`Progress(${t.traces}) at ${me(/* @__PURE__ */ new Date)}: ${t.generatedStates} states generated, -1 distinct states found, -1 states left on queue.`),nu=[{name:`-checkpoint`,sampleValue:`minutes`,description:`interval between check point; defaults to 30`,isOptional:!0},{name:`-cleanup`,description:`clean up the states directory`,isOptional:!0},{name:`-config`,sampleValue:`file`,description:`provide the configuration file; defaults to SPEC.cfg`,isOptional:!0},{name:`-continue`,description:`continue running even when an invariant is violated; default
|
|
49
49
|
behavior is to halt on first violation`,isOptional:!0},{name:`-coverage`,sampleValue:`minutes`,description:`interval between the collection of coverage information;
|
|
50
50
|
if not specified, no coverage will be collected`,isOptional:!0},{name:`-deadlock`,description:`if specified DO NOT CHECK FOR DEADLOCK. Setting the flag is
|
|
@@ -151,10 +151,10 @@ A pretty-printed and in-depth description of TLC can be found at:
|
|
|
151
151
|
https://lamport.azurewebsites.net/tla/current-tools.pdf`.replace(/TLC(\)|\s|$)/g,`${X(`TLC`)}$1`),` `)}`,``,`${X(`OPTIONS`)}\n`,...e.map(e=>`\t${X(e.name)}${e.sampleValue===void 0?``:` ${au(e.sampleValue)}`}\n\t\t${t(e.description??``,` `)}`),``,`${X(`TIPS`)}\n`,...iu.map(e=>`\t${t(e,` `)}\n`)].join(`
|
|
152
152
|
`)},fu=async e=>{let t=(await import(`./compile.js`)).compile(At(e,`utf8`),e),n=`\\* Generated by tla-ts from ${vt(e)}. Edit ${vt(e)} instead.`,r=St(bt(e),`${t.name}.tla`),i=St(bt(e),`${t.name}.cfg`);for(let t of[r,i])if(F(t)&&!At(t,`utf8`).startsWith(n))throw new l(`${t} already exists, and tla-ts didn't generate it from ${e}`);return Lt(r,`${n}\n${t.source}\n`),Lt(i,`${n}\n${t.config}\n`),r},pu={success:T.success,"assumption-violation":T.assumptionViolation,deadlock:T.deadlock,"invariant-violation":T.safetyViolation,"property-violation":T.safetyViolation,"liveness-violation":T.livenessViolation,"postcondition-violation":T.assumptionViolation,error:T.error},mu=e=>{if(It(e,{throwIfNoEntry:!1})?.isDirectory())throw new y(`${e} (Is a directory)`)},hu=(e,t)=>e.endsWith(t)?e:`${e}${t}`,gu=e=>{if(e.length===1)return{path:hu(e[0],`.dump`)};let t=e[0].toLowerCase();return{path:hu(e[1],`.dot`),dot:!0,colorize:t.includes(`colorize`),actionLabels:t.includes(`actionlabels`),snapshot:t.includes(`snapshot`),constrained:t.includes(`constrained`),stuttering:t.includes(`stuttering`),strict:t.includes(`strict`)}},_u=e=>Oe([e]).toString(),vu=(e,t,n,r,i)=>{let a=n.temporaryDirectory??Ut(),o=F(a)?Nt(a):Ct(a),s=St(o,`tlc-${_u(Ct(e))}`),c=sn(n);return(n,a)=>{let l=`${n}.tla`;if(a===`file`)return Nt(Xt(t,n)??e);if(i===`1.7.4`)return St(o,l);if(a===`root file`){let t=r===void 0?o:Ct(r),i=Nt(e);return`${St(t,_u(`${i} ${n}`),l)} (${i})`}let u=St(s,l);return c===void 0?u:`${u} (${$t(c)}${l})`}},yu=(e,t)=>{let n=e.split(/\r?\n/),r=n.findIndex(e=>e.match(/^-----*\s*CONFIG\s+(\S+?)\s*-----*$/)?.[1]===t);if(r===-1)return`
|
|
153
153
|
`;let i=n.findIndex((e,t)=>t>r&&e.startsWith(`====`));return`${n.slice(r+1,i===-1?void 0:i).join(`
|
|
154
|
-
`).trim()}\n`},bu=e=>e.replace(/\/+/g,`/`).replace(/(.)\/$/,`$1`),xu=e=>{let t=bu(e),n=t.lastIndexOf(`/`);return n===-1?`.`:t.slice(0,Math.max(n,1))},Su=(e,t)=>e.endsWith(`/`)?`${e}${t}`:`${e}/${t}`,Cu=(e,t,n,r)=>{if(t===`1.7.4`||!e.isTraceSpecForced&&(e.isTraceSpecDisabled||e.isTool||e.isContinued||vt(n).includes(`_TTrace`)))return;let i=e.traceSpecPath,a=`${vt(n)}_TTrace_${Math.floor(r/1e3)}`,o=i===void 0?{directory:xu(n),module:a}:i.toLowerCase().endsWith(`.tla`)?{directory:xu(i),module:vt(i).replace(/\.tla$/,``)}:{directory:bu(i),module:a};return{...o,traceFile:e.isTraceBinaryDisabled?void 0:Su(o.directory,`${o.module}.bin`)}},wu={ENOENT:`No such file or directory`,ENOTDIR:`Not a directory`,EISDIR:`Is a directory`,EACCES:`Permission denied`},Tu=(e,t)=>{try{Lt(e,t)}catch(t){let n=t instanceof Error&&`code`in t?wu[String(t.code)]:void 0;throw n===void 0?t:new y(`${e} (${n})`)}},Eu=e=>{try{Ot(e,{recursive:!0})}catch{}},Du=e=>{let t=/* @__PURE__ */ new Date,n=`${Le(t.getFullYear()%100)}-${Le(t.getMonth()+1)}-${Le(t.getDate())}-${Le(t.getHours())}-${Le(t.getMinutes())}-${Le(t.getSeconds())}.${Le(t.getMilliseconds(),3)}`,r=St(e.metadir??`states`,n);return Ot(r,{recursive:!0}),r},Ou=async(e,n,r,i,s)=>{let c=n.livenessCheck,l=s.version;Zl(s);let d=n.recoverDirectory;if(d!==void 0)throw F(St(d,`vars.chkpt`))?new k(`tla-ts can't recover a model check from the checkpoint in ${d}.`):new a(d);$l(s,n);let f=n.configPath??e.replace(/\.tla$/,`.cfg`);if(!F(f))return s.print(M.configFileError,P.error,`TLC encountered the following error when trying to read the configuration file ${f}:\nFile not found.`),T.configParseError;let p=vt(e,`.tla`),m={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},h=()=>{let e=Date.now()-m.startTime;s.print(M.finished,P.none,`Finished in ${s.isTool?`${e}ms`:Pe(e)} at (${me(/* @__PURE__ */ new Date)})`)},g=()=>s.print(M.parsingFailed,P.error,`Parsing or semantic analysis failed.`),v=e=>(e instanceof o?g():tn(e,s),h(),en(e)),b=(()=>{try{let e=At(f,`utf8`);return Se(f.endsWith(`.tla`)?yu(e,f.replaceAll(`.tla`,``)):e,l)}catch(e){if(!(e instanceof _))throw e;return e}})();if(b instanceof _&&l===`1.7.4`)return s.print(M.general,P.error,`${t(`tlc2.tool.ConfigFileException`)}${De(b.message,s.isTool)}`),h(),T.error;if(b instanceof _)return v(b);n.isDeadlockChecked||(b.checkDeadlock=!1);let x=bt(e),S=[x,...i.libraries],C=Zt(S),w=Cu(n,l,e.replace(/\.tla$/,``),m.startTime),E=e=>n.moduleOperators.filter(t=>t.kind===e).map(e=>e.module);s.isTool&&s.print(M.startingSany,P.none,`Starting SANY...`);let ee=xt(e),D=ee?p:e.replace(/\.tla$/,``),O=sn(i),te=l===`1.7.4`?ju(e,i,O):void 0;te?!F(e)&&!ve.has(p)&&te(`${p}.tla`):!F(e)&&!ke.has(p)&&Qt(ee?x:process.cwd(),ee?`${p}.tla`:`./${D}.tla`,[...ee||x===`.`?[]:[x],...i.libraries]);let ne=nl(e,te?on(C,te):C,{fileName:D,describeFile:vu(e,S,i,n.metadir,l),version:l,rootExtendees:[...E(`postcondition`),...w?.traceFile===void 0?[]:[`_TLCTrace`],...n.invariants.flatMap(e=>e.modules),...E(`constraint`),...E(`view`).slice(0,1)],suppressedCodes:n.suppressedCodes,errorCodes:n.errorCodes,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}),re=ne.specification;if(ne.isFailed||re===void 0)return Ul(s,{kind:`parsed`},m,x),g(),h(),T.specParseError;try{let t=At(e,`utf8`),i=Ye(t).name;if(i!==p)throw new u(`File name '${p}' does not match the name '${i}' of the top level module it contains.`,void 0);let a=n.userFile,o=Ge(l),d=sl(t,re.root,n.invariants,e=>C(e)??o.get(e)??he(t,e),l);b.invariants.push(...d.names);let f={workers:n.workers,livenessCheck:c===`off`?`off`:[`final`,`seqfinal`].includes(c)?`final`:`default`,seed:n.seed,fingerprintPolynomial:n.fingerprintIndex,maxSetSize:n.maxSetSize,isLazyValueExpanded:n.isLazyValueExpanded,isViewPrinted:n.isViewPrinted,dump:r,isTool:s.isTool,isContinued:n.isContinued,moduleOperators:n.moduleOperators,traceSpec:w,coverage:n.coverage,isSanyReported:!0,isWarningEnabled:n.isWarningEnabled,version:l,onProgress:e=>Ul(s,e,m,x),onPrint:a===void 0?void 0:e=>wt(a,`${e}\n`),source:d.source,config:b,onPause:()=>jt(0,Buffer.alloc(1)),loadModule:C,loadClass:e=>{let t=Hl(x,e);return F(t)?At(t):void 0},readFile:e=>(mu(e),F(e)?At(e,`utf8`):void 0),writeFile:Tu,makeDirectory:Eu};if(n.mode!==`model-check`){let e=mr({...f,traceDepth:n.traceDepth,traceCount:n.traceCount,aril:n.aril,isGenerating:n.mode===`generate`,scheduler:n.scheduler,onSimulation:e=>eu(s,e)});return h(),e}if(n.dfidDepth!==void 0){let e=sr({...f,maxDepth:n.dfidDepth,onOutput:e=>Yl(s,e)});return h(),e}let g=await Ze(f);if(Xl(g,s,m),h(),w&&g.traceSpec!==void 0){let e=Su(w.directory,`${w.module}.tla`);Eu(w.directory);let t=(()=>{try{Tu(e,g.traceSpec);return}catch(e){if(!(e instanceof y))throw e;return e}})();s.print(t?M.traceSpecFailed:M.traceSpecWritten,P.none,t?`Failed to generate trace exploration spec; error message: ${t.message}`:`Trace exploration spec path: ${e}`)}return g.failure?.exitCode??pu[g.status]}catch(e){if(!(e instanceof A))throw e;return e instanceof o&&console.log(ku(e,p)),m.isParsed||Ul(s,{kind:`parsed`},m,x),v(e)}},ku=(e,t)=>{let n=e instanceof u;if(!n&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let r=n?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${t}\n\nCould not parse module ${t} from file ${t}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${t}\n\n${r}\n*** Errors: 1\n\n${r}\n\n\n`},Au=async(e,t)=>{let n=t.tlcVersion??`master`,r=Dl(e);if(r===`usage`)return console.log(du()),1;if(`error`in r)return r.kind===`uncaught`?(console.error(`Exception in thread "main" ${r.error}`),1):Ql(r.isTool,n,r.error);let i=r.dump&&gu(r.dump);i?.path.startsWith("${metadir}")&&(i.path=i.path.replaceAll("${metadir}",Du(r)));let a=i?.path;if(a!==void 0)try{Tt(kt(a,`w`))}catch{return console.log(`Error: Unable to write to file ${a}`),Ql(r.isTool,n,`Error: Given file name ${a} for dumping states invalid.`)}let o=r.configPath!==void 0;if(o&&r.specs.length>1)return Ql(r.isTool,n,`Error: more than one input files: ${r.specs[0].replace(/\.tla$/,``)} and ${r.specs[1]}`);let s=Yt(r.specs).map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg|ts)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.ts`)||e.path.endsWith(`.tla`)&&(!e.isGlobbed||o||F(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(s.length===0)return Ql(r.isTool,n,`Error: Missing input TLA+ module.`);if(o&&s.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let c=[...new Set(s.map(e=>F(e)||xt(e)?e:t.libraries.map(t=>St(t,e)).find(F)??e))],l=[];for(let[e,a]of c.entries()){e>0&&console.log(``);let o=Ne({isTool:r.isTool,isWarningEnabled:r.isWarningEnabled,isDiffTrace:r.isDiffTrace,version:n,suppressedCodes:r.suppressedCodes,errorCodes:r.errorCodes});l.push(await nn(async()=>{let e=a.endsWith(`.ts`)?await fu(a):a;return c.length>1&&console.log(`Checking ${vt(e)} with ${vt(e,`.tla`)}.cfg`),Ou(e,r,i,t,o)},o))}return l.find(e=>e!==T.success)??T.success},ju=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),i=(!xt(e)&&r!==``?[r]:t.libraries).map(an),a=i.length>0?i[i.length-1]:xt(e)?r:``;return e=>rn(`${a}${e}`,i,n)},Mu={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},Nu=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),Pu={"&":`&`,"<":`<`,">":`>`,"\r":` `},Fu=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Pu[e]),Iu=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Lu=e=>{let t=(e.cdata??e.text)?.match(Iu)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Lu(t);if(e)return e}},Ru=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${Fu(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)Ru(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},zu=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Bu=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},Vu={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Hu={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Uu=ua(`--TLA+ BUILTINS--`),Wu=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Gu=(e,t=16)=>e>t*.75?Gu(e,t*2):t,Ku=(e,t)=>(e^e>>>16)&t-1,qu=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Ju=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Yu=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Xu=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=qu(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(Yu,``)}).join(`
|
|
155
|
-
`)},
|
|
156
|
-
`)}
|
|
157
|
-
`),i=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${r}\n`).join(``);return v(new m(r,i),
|
|
158
|
-
`),r=n.isUncommented?Zu(
|
|
159
|
-
`)}\n`},
|
|
160
|
-
`)})(),
|
|
154
|
+
`).trim()}\n`},bu=e=>e.replace(/\/+/g,`/`).replace(/(.)\/$/,`$1`),xu=e=>{let t=bu(e),n=t.lastIndexOf(`/`);return n===-1?`.`:t.slice(0,Math.max(n,1))},Su=(e,t)=>e.endsWith(`/`)?`${e}${t}`:`${e}/${t}`,Cu=(e,t,n,r)=>{if(t===`1.7.4`||!e.isTraceSpecForced&&(e.isTraceSpecDisabled||e.isTool||e.isContinued||vt(n).includes(`_TTrace`)))return;let i=e.traceSpecPath,a=`${vt(n)}_TTrace_${Math.floor(r/1e3)}`,o=i===void 0?{directory:xu(n),module:a}:i.toLowerCase().endsWith(`.tla`)?{directory:xu(i),module:vt(i).replace(/\.tla$/,``)}:{directory:bu(i),module:a};return{...o,traceFile:e.isTraceBinaryDisabled?void 0:Su(o.directory,`${o.module}.bin`)}},wu={ENOENT:`No such file or directory`,ENOTDIR:`Not a directory`,EISDIR:`Is a directory`,EACCES:`Permission denied`},Tu=(e,t)=>{try{Lt(e,t)}catch(t){let n=t instanceof Error&&`code`in t?wu[String(t.code)]:void 0;throw n===void 0?t:new y(`${e} (${n})`)}},Eu=e=>{try{Ot(e,{recursive:!0})}catch{}},Du=e=>{let t=/* @__PURE__ */ new Date,n=`${Le(t.getFullYear()%100)}-${Le(t.getMonth()+1)}-${Le(t.getDate())}-${Le(t.getHours())}-${Le(t.getMinutes())}-${Le(t.getSeconds())}.${Le(t.getMilliseconds(),3)}`,r=St(e.metadir??`states`,n);return Ot(r,{recursive:!0}),r},Ou=async(e,n,r,i,s)=>{let c=n.livenessCheck,l=s.version;Zl(s);let d=n.recoverDirectory;if(d!==void 0)throw F(St(d,`vars.chkpt`))?new k(`tla-ts can't recover a model check from the checkpoint in ${d}.`):new a(d);$l(s,n);let f=n.configPath??e.replace(/\.tla$/,`.cfg`);if(!F(f))return s.print(M.configFileError,P.error,`TLC encountered the following error when trying to read the configuration file ${f}:\nFile not found.`),T.configParseError;let p=vt(e,`.tla`),m={startTime:Date.now(),livenessStartTime:void 0,isParsed:!1},h=()=>{let e=Date.now()-m.startTime;s.print(M.finished,P.none,`Finished in ${s.isTool?`${e}ms`:Pe(e)} at (${me(/* @__PURE__ */ new Date)})`)},g=()=>s.print(M.parsingFailed,P.error,`Parsing or semantic analysis failed.`),v=e=>(e instanceof o?g():tn(e,s),h(),en(e)),b=(()=>{try{let e=At(f,`utf8`);return Se(f.endsWith(`.tla`)?yu(e,f.replaceAll(`.tla`,``)):e,l)}catch(e){if(!(e instanceof _))throw e;return e}})();if(b instanceof _&&l===`1.7.4`)return s.print(M.general,P.error,`${t(`tlc2.tool.ConfigFileException`)}${De(b.message,s.isTool)}`),h(),T.error;if(b instanceof _)return v(b);n.isDeadlockChecked||(b.checkDeadlock=!1);let x=bt(e),S=[x,...i.libraries],C=Zt(S),w=Cu(n,l,e.replace(/\.tla$/,``),m.startTime),E=e=>n.moduleOperators.filter(t=>t.kind===e).map(e=>e.module);s.isTool&&s.print(M.startingSany,P.none,`Starting SANY...`);let ee=xt(e),D=ee?p:e.replace(/\.tla$/,``),O=sn(i),te=l===`1.7.4`?Mu(e,i,O):void 0;te?!F(e)&&!ve.has(p)&&te(`${p}.tla`):!F(e)&&!ke.has(p)&&Qt(ee?x:process.cwd(),ee?`${p}.tla`:`./${D}.tla`,[...ee||x===`.`?[]:[x],...i.libraries]);let ne=nl(e,te?on(C,te):C,{fileName:D,describeFile:vu(e,S,i,n.metadir,l),version:l,rootExtendees:[...E(`postcondition`),...w?.traceFile===void 0?[]:[`_TLCTrace`],...n.invariants.flatMap(e=>e.modules),...E(`constraint`),...E(`view`).slice(0,1)],suppressedCodes:n.suppressedCodes,errorCodes:n.errorCodes,onPrint:e=>process.stdout.write(e),onPrintError:e=>process.stderr.write(e)}),re=ne.specification;if(ne.isFailed||re===void 0)return Ul(s,{kind:`parsed`},m,x),g(),h(),T.specParseError;try{let t=At(e,`utf8`),i=Ye(t).name;if(i!==p)throw new u(`File name '${p}' does not match the name '${i}' of the top level module it contains.`,void 0);let a=n.userFile,o=Ge(l),d=sl(t,re.root,n.invariants,e=>C(e)??o.get(e)??he(t,e),l);b.invariants.push(...d.names);let f={workers:n.workers,livenessCheck:c===`off`?`off`:[`final`,`seqfinal`].includes(c)?`final`:`default`,seed:n.seed,fingerprintPolynomial:n.fingerprintIndex,maxSetSize:n.maxSetSize,isLazyValueExpanded:n.isLazyValueExpanded,isViewPrinted:n.isViewPrinted,dump:r,isTool:s.isTool,isContinued:n.isContinued,moduleOperators:n.moduleOperators,traceSpec:w,coverage:n.coverage,isSanyReported:!0,isWarningEnabled:n.isWarningEnabled,version:l,onProgress:e=>Ul(s,e,m,x),onPrint:a===void 0?void 0:e=>wt(a,`${e}\n`),source:d.source,config:b,onPause:()=>jt(0,Buffer.alloc(1)),readLine:ku,loadModule:C,loadClass:e=>{let t=Hl(x,e);return F(t)?At(t):void 0},readFile:e=>(mu(e),F(e)?At(e,`utf8`):void 0),writeFile:Tu,makeDirectory:Eu};if(n.mode!==`model-check`){let e=mr({...f,traceDepth:n.traceDepth,traceCount:n.traceCount,aril:n.aril,isGenerating:n.mode===`generate`,scheduler:n.scheduler,onSimulation:e=>eu(s,e)});return h(),e}if(n.dfidDepth!==void 0){let e=sr({...f,maxDepth:n.dfidDepth,onOutput:e=>Yl(s,e)});return h(),e}let g=await Ze(f);if(Xl(g,s,m),h(),w&&g.traceSpec!==void 0){let e=Su(w.directory,`${w.module}.tla`);Eu(w.directory);let t=(()=>{try{Tu(e,g.traceSpec);return}catch(e){if(!(e instanceof y))throw e;return e}})();s.print(t?M.traceSpecFailed:M.traceSpecWritten,P.none,t?`Failed to generate trace exploration spec; error message: ${t.message}`:`Trace exploration spec path: ${e}`)}return g.failure?.exitCode??pu[g.status]}catch(e){if(!(e instanceof A))throw e;return e instanceof o&&console.log(Au(e,p)),m.isParsed||Ul(s,{kind:`parsed`},m,x),v(e)}},ku=()=>{let e=[],t=Buffer.alloc(1),n=!1;for(;jt(0,t)===1&&(n=!0,t[0]!==10);)e.push(t[0]);return n?Buffer.from(e).toString().replace(/\r$/,``):void 0},Au=(e,t)=>{let n=e instanceof u;if(!n&&!e.failure)return`Semantic errors:\n\n*** Errors: 1\n\n${e.message}\n\n`;let r=n?e.location===void 0?`Unknown location\n\n${e.message}`:`In module ${e.location}\n\n${e.message}`:`In module ${t}\n\nCould not parse module ${t} from file ${t}.tla`;return`${e.failure?`***Parse Error***\n${e.message}\n\n`:``}\nFatal errors while parsing TLA+ spec in file ${t}\n\n${r}\n*** Errors: 1\n\n${r}\n\n\n`},ju=async(e,t)=>{let n=t.tlcVersion??`master`,r=Dl(e);if(r===`usage`)return console.log(du()),1;if(`error`in r)return r.kind===`uncaught`?(console.error(`Exception in thread "main" ${r.error}`),1):Ql(r.isTool,n,r.error);let i=r.dump&&gu(r.dump);i?.path.startsWith("${metadir}")&&(i.path=i.path.replaceAll("${metadir}",Du(r)));let a=i?.path;if(a!==void 0)try{Tt(kt(a,`w`))}catch{return console.log(`Error: Unable to write to file ${a}`),Ql(r.isTool,n,`Error: Given file name ${a} for dumping states invalid.`)}let o=r.configPath!==void 0;if(o&&r.specs.length>1)return Ql(r.isTool,n,`Error: more than one input files: ${r.specs[0].replace(/\.tla$/,``)} and ${r.specs[1]}`);let s=Yt(r.specs).map(e=>({...e,path:e.isGlobbed||/\.(tla|cfg|ts)$/.test(e.path)?e.path.replace(/\.cfg$/,`.tla`):`${e.path}.tla`})).filter(e=>e.path.endsWith(`.ts`)||e.path.endsWith(`.tla`)&&(!e.isGlobbed||o||F(e.path.replace(/\.tla$/,`.cfg`)))).map(e=>e.path);if(s.length===0)return Ql(r.isTool,n,`Error: Missing input TLA+ module.`);if(o&&s.length>1)return console.error(`Error: -config applies to one specification, but several were given.`),1;let c=[...new Set(s.map(e=>F(e)||xt(e)?e:t.libraries.map(t=>St(t,e)).find(F)??e))],l=[];for(let[e,a]of c.entries()){e>0&&console.log(``);let o=Ne({isTool:r.isTool,isWarningEnabled:r.isWarningEnabled,isDiffTrace:r.isDiffTrace,version:n,suppressedCodes:r.suppressedCodes,errorCodes:r.errorCodes});l.push(await nn(async()=>{let e=a.endsWith(`.ts`)?await fu(a):a;return c.length>1&&console.log(`Checking ${vt(e)} with ${vt(e,`.tla`)}.cfg`),Ou(e,r,i,t,o)},o))}return l.find(e=>e!==T.success)??T.success},Mu=(e,t,n)=>{let r=e.slice(0,e.lastIndexOf(`/`)+1),i=(!xt(e)&&r!==``?[r]:t.libraries).map(an),a=i.length>0?i[i.length-1]:xt(e)?r:``;return e=>rn(`${a}${e}`,i,n)},Nu={uncaughtException:1,argsParsingFailure:1,specParsingFailure:2,unrepresentableCharacter:7},Pu=e=>`java.lang.IllegalArgumentException: unsupported kind: ${e} in xml export`,Z=(e,t=[])=>({tag:e,children:t}),Q=(e,t)=>({tag:e,text:String(t),children:[]}),Fu={"&":`&`,"<":`<`,">":`>`,"\r":` `},Iu=e=>e.replace(/[&<>\r]|[\u{10000}-\u{10FFFF}]/gu,e=>e.length===2?`&#${e.codePointAt(0)};`:Fu[e]),Lu=/[^\t\n\r\u0020-\uD7FF\uE000-\uFFFD\u{10000}-\u{10FFFF}]/u,Ru=e=>{let t=(e.cdata??e.text)?.match(Lu)?.[0];if(t!==void 0)return{tag:e.tag,character:t};for(let t of e.children){let e=Ru(t);if(e)return e}},zu=(e,t,n,r)=>{let i=` `.repeat(t*n);if(e.cdata){let t=e.cdata.replaceAll(`]]>`,`]]]]><![CDATA[>`);r.push(`${i}<${e.tag}><![CDATA[${t}]]></${e.tag}>`)}else if(e.text)r.push(`${i}<${e.tag}>${Iu(e.text)}</${e.tag}>`);else if(e.children.length===0)r.push(`${i}<${e.tag}/>`);else{r.push(`${i}<${e.tag}>`);for(let i of e.children)zu(i,t+1,n,r);r.push(`${i}</${e.tag}>`)}},Bu=e=>Z(`location`,[Z(`column`,[Q(`begin`,e.beginColumn),Q(`end`,e.endColumn)]),Z(`line`,[Q(`begin`,e.beginLine),Q(`end`,e.endLine)]),Q(`filename`,e.file)]),Vu=e=>{switch(e.kind){case`FormalParam`:return`FormalParamNodeRef`;case`OpDecl`:return`OpDeclNodeRef`;case`Module`:return`ModuleNodeRef`;case`Theorem`:return`TheoremNodeRef`;case`Assume`:return`AssumeNodeRef`;case`ThmOrAssumpDef`:return e.isTheorem?`TheoremDefRef`:`AssumeDefRef`;case`OpDef`:return e.defKind===`UserDefined`?`UserDefinedOpKindRef`:e.defKind===`BuiltIn`?`BuiltInKindRef`:`ModuleInstanceKindRef`}},$={main:{at:`xml.XMLExporter.main(XMLExporter.java:145)`},constant:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1228)`},variable:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1236)`},definition:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1244)`},topLevel:{at:`semantic.ModuleNode.getSymbolElement(ModuleNode.java:1268)`},body:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1392)`,nullType:`ExprNode`,nullValue:`"this.body"`},param:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1397)`},builtInParam:{at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1413)`},theoremDefinitionBody:{at:`semantic.ThmOrAssumpDefNode.getSymbolElement(ThmOrAssumpDefNode.java:663)`,nullType:`LevelNode`,nullValue:`"this.body"`},theoremDefinition:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:439)`},theorem:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:444)`,nullType:`LevelNode`,nullValue:`the return value of "tla2sany.semantic.TheoremNode.getTheorem()"`},proof:{at:`semantic.TheoremNode.getLevelElement(TheoremNode.java:447)`},assumeDefinition:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:249)`},assume:{at:`semantic.AssumeNode.getLevelElement(AssumeNode.java:254)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeNode.getAssume()"`},operator:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1315)`},operand:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1326)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.operands[i]"`},unbound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1337)`},bound:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1347)`},range:{at:`semantic.OpApplNode.getLevelElement(OpApplNode.java:1349)`,nullType:`ExprNode`,nullValue:`"this.ranges[i]"`},letBody:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:301)`,nullType:`ExprNode`,nullValue:`"this.body"`},letDefinition:{at:`semantic.LetInNode.getLevelElement(LetInNode.java:303)`},labelBody:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:341)`,nullType:`LevelNode`,nullValue:`"this.body"`},labelParam:{at:`semantic.LabelNode.getLevelElement(LabelNode.java:343)`},argument:{at:`semantic.OpArgNode.getLevelElement(OpArgNode.java:150)`},exceptObject:{at:`semantic.AtNode.getLevelElement(AtNode.java:180)`},exceptComponents:{at:`semantic.AtNode.getLevelElement(AtNode.java:181)`},substOperator:{at:`semantic.Subst.export(Subst.java:258)`},substExpression:{at:`semantic.Subst.export(Subst.java:259)`,nullType:`ExprOrOpArgNode`,nullValue:`"this.expr"`},instanceSubst:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:447)`},instanceParam:{at:`semantic.InstanceNode.getLevelElement(InstanceNode.java:452)`},useFact:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:175)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},useDefinition:{at:`semantic.UseOrHideNode.getLevelElement(UseOrHideNode.java:176)`},newDeclaration:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:202)`},newSet:{at:`semantic.NewSymbNode.getLevelElement(NewSymbNode.java:204)`},assumption:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:404)`,nullType:`SemanticNode`,nullValue:`"assumes[i]"`},goal:{at:`semantic.AssumeProveNode.getLevelElement(AssumeProveNode.java:406)`,nullType:`ExprNode`,nullValue:`the return value of "tla2sany.semantic.AssumeProveNode.getProve()"`},byFact:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:154)`,nullType:`LevelNode`,nullValue:`"this.facts[i]"`},byDefinition:{at:`semantic.LeafProofNode.getLevelElement(LeafProofNode.java:155)`},step:{at:`semantic.NonLeafProofNode.getLevelElement(NonLeafProofNode.java:228)`,nullType:`LevelNode`,nullValue:`"this.steps[i]"`},defStep:{at:`semantic.DefStepNode.getLevelElement(DefStepNode.java:99)`}},Hu={SubstIn:{subst:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:530)`},body:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:533)`,nullType:`ExprNode`,nullValue:`"this.body"`},from:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:536)`},to:{at:`semantic.SubstInNode.getLevelElement(SubstInNode.java:540)`}},APSubstIn:{subst:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:460)`},body:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:463)`,nullType:`LevelNode`,nullValue:`"this.body"`},from:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:466)`},to:{at:`semantic.APSubstInNode.getLevelElement(APSubstInNode.java:470)`}}},Uu={at:`semantic.OpDefNode.getSymbolElement(OpDefNode.java:1424)`},Wu=ua(`--TLA+ BUILTINS--`),Gu=(e,t)=>{let[n,r,i]=e===`Theorem`?[`TheoremNode.export(TheoremNode.java:456)`,70,`TheoremNode.exportDefinition(TheoremNode.java:404)`]:e===`Assume`?[`AssumeNode.export(AssumeNode.java:263)`,80,`AssumeNode.exportDefinition(AssumeNode.java:207)`]:[e===`ThmOrAssumpDef`?`ThmOrAssumpDefNode.export(ThmOrAssumpDefNode.java:671)`:`SymbolNode.export(SymbolNode.java:177)`,60,`SymbolNode.exportDefinition(SymbolNode.java:138)`];return[{at:`semantic.${n}`},{at:`xml.SymbolContext.put(SymbolContext.java:${r})`},{at:`semantic.${i}`,failedFor:t}]},Ku=(e,t=16)=>e>t*.75?Ku(e,t*2):t,qu=(e,t)=>(e^e>>>16)&t-1,Ju=e=>{let t=e.split(/\r?\n/);for(;t.at(-1)===``;)t.pop();return t},Yu=e=>e.replace(/^[\0-\x20]+|[\0-\x20]+$/g,``),Xu=/[\t-\r\x1C-\x20\u1680\u2000-\u2006\u2008-\u200A\u2028\u2029\u205F\u3000]+$/,Zu=e=>{let t=e.indexOf(`(**`),n=e.lastIndexOf(`**)`);if(t<0||n<=t)return e;let r=Ju(e),i=r.findIndex(e=>e.includes(`(**`)),a=r.findLastIndex(e=>e.includes(`**)`));return i<0||i>=a?e:r.slice(i+1,a).map(e=>{let t=e.indexOf(`(*`),n=e.indexOf(`*)`);return t<0||n<=t?e:e.slice(t+3,Math.max(t+3,n)).replace(Xu,``)}).join(`
|
|
155
|
+
`)},Qu=e=>{let t=Ju(e),n=e=>Yu(e).startsWith(`\\*`);return t.filter(n).length<Math.floor(t.length/2)?e:t.map(e=>{if(!n(e))return e;let t=e.indexOf(`\\*`)+2;return e.slice(e[t]===` `?t+1:t)}).join(`
|
|
156
|
+
`)},$u=(e,t,n)=>{let i=n.version===`1.7.4`,a=/* @__PURE__ */ new Set,o=/* @__PURE__ */ new Map,s=!1,c=[],l=(e,t)=>{if(!i)return t();c.push(...e);let n=t();return c.length-=e.length,n},u=(e,t)=>{let n=[...c,...t].reverse(),r=[e,...n.map(e=>`\tat tla2sany.${e.at}`)].join(`
|
|
157
|
+
`),i=n.filter(e=>e.failedFor!==void 0).map(e=>`failed for node.toString(): ${e.failedFor}\n with error \n${r}\n`).join(``);return v(new m(r,i),Nu.uncaughtException)},d=e=>u(`java.lang.NullPointerException: Cannot invoke "tla2sany.semantic.${e.nullType}.export(org.w3c.dom.Document, tla2sany.xml.SymbolContext)" because ${e.nullValue} is null`,[e]),f=(e,t)=>(a.has(e.id)||(a.add(e.id),o.set(e.id,l([...t?[t]:[],...Gu(e.kind,ua(e.location))],()=>_(e)))),Z(Vu(e),[Q(`UID`,e.id)])),p=(e,t)=>{let n=t.levelChecked===0?[]:[Q(`level`,t.level)],r=t.location?[Bu(t.location),...n]:n;return{...e,children:[...r,...e.children]}},h=(e,t,n)=>Z(`params`,e.map((e,r)=>Z(`leibnizparam`,[f(e,n),...t?.[r]?[Z(`leibniz`)]:[]]))),g=e=>{let t=e.map(e=>e.trimEnd()).filter(e=>e.length>0).join(`
|
|
158
|
+
`),r=n.isUncommented?Qu(Zu(t)):t;return e.length>0?[{tag:`pre-comments`,cdata:r,children:[]}]:[]},_=e=>{switch(e.kind){case`FormalParam`:return p(Z(`FormalParamNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity)]),e);case`OpDecl`:return p(Z(`OpDeclNode`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),Q(`kind`,e.declKind)]),e);case`OpDef`:{if(e.defKind===`NumberedProofStep`)throw i?u(Pu(37),[Uu]):v(new r(Pu(37)),Nu.uncaughtException);if(e.defKind===`ModuleInstance`)return p(Z(`ModuleInstanceKind`,[Q(`uniquename`,e.name),...e.isLocal&&!i?[Z(`local`)]:[]]),e);let t=e.params??[];if(e.defKind===`BuiltIn`)return p(Z(`BuiltInKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...e.params?[h(t,e.isLeibnizArg,$.builtInParam)]:[]]),e);let n=e.body,a=e.module;if(n===void 0&&i)throw d($.body);if(n===void 0||a===void 0)throw Error(`The definition of ${e.name} has no body`);return p(Z(`UserDefinedOpKind`,[Q(`uniquename`,e.name),Q(`arity`,e.arity),...i?[]:[Z(`originalOperator`,[f(e.source??e)]),Z(`originallyDefinedInModule`,[f(a)])],Z(`body`,[C(n,$.body)]),...e.params||!i?[h(t,e.isLeibnizArg,$.param)]:[],...i?[]:g(e.preComments),...e.inRecursive?[Z(`recursive`)]:[],...e.recursiveSection>=0&&!i?[Q(`recursiveSection`,e.recursiveSection)]:[],...e.isLocal&&!i?[Z(`local`)]:[]]),e)}case`ThmOrAssumpDef`:return p(Z(e.isTheorem?`TheoremDefNode`:`AssumeDef`,[Q(`uniquename`,e.name),C(e.body,$.theoremDefinitionBody)]),e);case`Module`:return Z(`ModuleNode`,[Bu(e.location),...y(e)]);case`Theorem`:return p(Z(`TheoremNode`,[...e.definition?[Z(`definition`,[f(e.definition,$.theoremDefinition)])]:[],Z(`body`,[C(e.body,$.theorem)]),...e.proof?[C(e.proof,$.proof)]:[],...e.isSuffices?[Z(`suffices`)]:[]]),e);case`Assume`:return Z(`AssumeNode`,[Bu(e.location),...e.body.levelChecked===0?[]:[Q(`level`,e.body.level)],...e.definition?[Z(`definition`,[f(e.definition,$.assumeDefinition)])]:[],Z(`body`,[C(e.body,$.assume)])])}},y=e=>{let t=t=>!n.isRestricted||t.module===e;return[Q(`uniquename`,e.name),...i?[]:[Z(`extends`,[...new Set(e.extendees.map(e=>e.name))].toSorted().map(e=>Q(`uniquename`,e)))],...Ea(e,2).filter(t).map(e=>f(e,$.constant)),...Ea(e,3).filter(t).map(e=>f(e,$.variable)),...Ta(e).filter(t).map(e=>f(e,$.definition)),...e.topLevel.map(e=>e.kind===`Instance`||e.kind===`UseOrHide`?C(e,$.topLevel):f(e,$.topLevel)),...e.definitions.filter(e=>!i&&e.kind===`Module`).map(e=>f(e))]},b=(e,t)=>l([t],()=>Z(`Subst`,[f(e.op,$.substOperator),C(e.expr,$.substExpression)])),x=e=>{if(e.nullKind!==void 0&&i)throw u(Pu(0),[$.operator,...Gu(`OpDef`,Wu),Uu]);let t=e.operands[e.operands.length-1];e.operator.name===`$Case`&&e.operands.length>1&&t?.kind===`OpAppl`&&t.operator.name===`$Pair`&&t.operands[0]===void 0&&(s=!0);let n=f(e.operator,$.operator),r=e.operands.map((e,t)=>e===void 0||t===0&&s&&da(e)?i?Q(`StringNode`,`$Other`):Z(`StringNode`,[Q(`StringValue`,`$Other`)]):C(e,$.operand)),a=e.tupleOrs,o=e.unbounded===void 0&&e.bounded===void 0?[]:[Z(`boundSymbols`,[...(e.unbounded??[]).map((e,t)=>Z(`unbound`,[f(e,$.unbound),...a?.[t]?[Z(`tuple`)]:[]])),...(e.bounded??[]).map((t,n)=>Z(`bound`,[...t.map(e=>f(e,$.bound)),...a?.[n]?[Z(`tuple`)]:[],C(e.ranges[n],$.range)]))])];return Z(`OpApplNode`,[Z(`operator`,[n]),Z(`operands`,r),...o])},S=(e,t)=>e.kind===`Module`||e.kind===`OpDef`?f(e,t):C(e,t),C=(e,t)=>{if(!i)return w(e);if(e.kind===`OpAppl`&&e.nullKind===`absent`&&`nullType`in t)throw d(t);return l([t,{at:`semantic.SemanticNode.export(SemanticNode.java:379)`,failedFor:ua(e.location)},{at:`semantic.LevelNode.getSemanticElement(LevelNode.java:333)`}],()=>w(e))},w=e=>{switch(e.kind){case`OpAppl`:return p(x(e),e);case`Numeral`:return p(Z(`NumeralNode`,[Q(`IntValue`,e.value)]),e);case`String`:return p(Z(`StringNode`,[Q(`StringValue`,e.value)]),e);case`Decimal`:return p(Z(`DecimalNode`,[Q(`mantissa`,e.mantissa),Q(`exponent`,e.exponent),...i?[]:[Q(`integralPart`,e.integralPart),Q(`fractionalPart`,e.fractionalPart)]]),e);case`LetIn`:{let t=C(e.body,$.letBody);return p(Z(`LetInNode`,[Z(`body`,[t]),Z(`opDefs`,e.opDefs.map(e=>f(e,$.letDefinition)))]),e)}case`Label`:return p(Z(`LabelNode`,[Q(`uniquename`,e.name),Q(`arity`,e.params.length),Z(`body`,[C(e.body,$.labelBody)]),Z(`params`,e.params.map(e=>f(e,$.labelParam)))]),e);case`OpArg`:return p(Z(`OpArgNode`,[Z(`argument`,[f(e.op,$.argument)])]),e);case`At`:{let t=e.except.operands[0],n=e.component.operands[0];if(t===void 0||n===void 0)throw Error(`An @ refers to an incomplete EXCEPT`);return p(Z(`AtNode`,[C(t,$.exceptObject),C(n,$.exceptComponents)]),e)}case`SubstIn`:case`APSubstIn`:{let t=Hu[e.kind],n=e.substs.map(e=>b(e,t.subst)),r=C(e.body,t.body);return p(Z(e.kind===`SubstIn`?`SubstInNode`:`APSubstInNode`,[Z(`substs`,n),Z(`body`,[r]),Z(`instFrom`,[f(e.instantiatingModule,t.from)]),Z(`instTo`,[f(e.instantiatedModule,t.to)])]),e)}case`Instance`:{let t=e.substs.map(e=>b(e,$.instanceSubst)),n=e.params.map(e=>f(e,$.instanceParam));return Z(`InstanceNode`,[Bu(e.location),Q(`level`,0),...e.name===void 0?[]:[Q(`uniquename`,e.name)],Q(`module`,e.module.name),Z(`substs`,t),Z(`params`,n),...e.isLocal&&!i?[Z(`local`)]:[]])}case`UseOrHide`:return p(Z(`UseOrHideNode`,[Z(`facts`,e.facts.map(e=>S(e,$.useFact))),Z(`defs`,e.defs.map(e=>f(e,$.useDefinition))),...e.isOnly?[Z(`only`)]:[],...e.isHide?[Z(`hide`)]:[]]),e);case`NewSymb`:return p(Z(`NewSymbNode`,[f(e.declaration,$.newDeclaration),...e.set&&!(i&&da(e.set))?[C(e.set,$.newSet)]:[]]),e);case`AssumeProve`:return p(Z(`AssumeProveNode`,[Z(`assumes`,e.assumptions.map(e=>C(e,$.assumption))),Z(`prove`,[C(e.goal,$.goal)]),...e.isSuffices?[Z(`suffices`)]:[],...e.isBoxed?[Z(`boxed`)]:[]]),e);case`LeafProof`:{let t=e.facts.length===0&&e.defs.length===0,n=e.isOmitted?Z(`omitted`):t?Z(`obvious`):Z(`by`,[Z(`facts`,e.facts.map(e=>S(e,$.byFact))),Z(`defs`,e.defs.map(e=>f(e,$.byDefinition))),...e.isOnly?[Z(`only`)]:[]]);return p(n,e)}case`NonLeafProof`:return p(Z(`steps`,[...i?[]:[Q(`proofLevel`,e.proofLevel)],...e.steps.map(e=>e.kind===`Theorem`?f(e,$.step):C(e,$.step))]),e);case`DefStep`:return p(Z(`DefStepNode`,e.defs.map(e=>f(e,$.defStep))),e)}},T=(n.isRestricted?[t]:e).map(e=>f(e,$.main)),E=Ku(o.size),ee=Z(`context`,[...o.entries()].toSorted(([e],[t])=>qu(e,E)-qu(t,E)).map(([e,t])=>Z(`entry`,[Q(`UID`,e),t])));return Z(`modules`,[Q(`RootModule`,t.name),ee,...T])},ed=(e,t={version:`master`,isRestricted:!1,isUncommented:!1,isTerse:!1})=>{let n=$u(e.modules,e.root,t),i=Ru(n);if(i){let e=i.character.codePointAt(0)??0;throw v(new r(`The spec contains the character U+${e.toString(16).toUpperCase().padStart(4,`0`)} in the ${i.tag} element. XML 1.0 cannot represent that character in character data, not even as a numeric character reference, so the spec cannot be exported until the character is removed from it.`),Nu.unrepresentableCharacter)}let a=[`<?xml version="1.0" encoding="UTF-8" standalone="no"?>`];return zu(n,0,t.isTerse?0:2,a),t.isTerse?a.join(``):`${a.join(`
|
|
159
|
+
`)}\n`},td=(()=>{let e=[[`-I`,`Include; use given directory path to resolve module dependencies.`],[`-help`,`Print this usage information.`],[`-o`,`Offline mode; skip XML schema validation step.`],[`-r`,`Restrict mode; include only declarations and definitions of the specified module, excluding extended or instantiated modules.`],[`-t`,`Terse; format XML output without tabs or newlines.`],[`-u`,`Uncomment; process boxed comments and single-line comments (\\*) in pre-comments to extract their content.`]],t=[`Only one root TLA+ file can be parsed per run.`,`Multiple directory search paths can be given by providing multiple -I arguments.`,`XML schema validation does not require network access.`];return[``,X(`NAME`),``,` tla2sany.xml.XMLExporter - Emit SANY's parse tree as XML - Version 2.2 created 08 July 2020`,``,``,X(`SYNOPSIS`),``,`\t${X(`tla2sany.xml.XMLExporter`)} [${X(`-Iortu`)}] [${X(`-help`)}] FILE`,``,X(`DESCRIPTION`),``,` Given a TLA+ file, parse that file with SANY then translate the module's semantic parse tree to XML, including all the modules depended on. The XML is printed to stdout and its output format is given by an XML Schema file (.xsd) found at https://proofs.tlapl.us/doc/web/sany.xsd.`,``,X(`OPTIONS`),``,...e.map(([e,t])=>`\t${X(e)}\n\t\t${t}`),``,X(`TIPS`),``,...t.flatMap(e=>[`\t${e}`,``]),``].join(`
|
|
160
|
+
`)})(),nd=e=>(process.stderr.write(`ERROR: ${e}\n${td}`),Nu.argsParsingFailure),rd=(e,t)=>{try{return process.stdout.write(ed(e,t)),T.success}catch(e){if(!(e instanceof r))throw e;let t=p(e),n=e instanceof m?e.unwound:``;return console.error(t===Nu.uncaughtException?`${n}Exception in thread "main" ${e.message}`:`ERROR: ${e.message}`),t}},id={"no-file":{message:`at least one .tla file must be given`,line174:59},"missing-include":{message:`the -I flag must be followed by a directory and at least one .tla file`,line174:71},"several-files":{message:`Only one TLA file to check allowed!`,line174:83}},ad=(e,t)=>{let n={flags:/* @__PURE__ */ new Set,includes:[],error:void 0};if(e.length===0)return{...n,error:`no-file`};let r=-1;for(let i=0;i<e.length-1;i++)if(t.has(e[i]))n.flags.add(e[i]),r=i;else if(e[i]===`-I`){if(i++,i>e.length-2)return{...n,error:`missing-include`};n.includes.push(e[i]),r=i}return r===e.length-2?n:{...n,error:`several-files`}},od=e=>{let t=ad(e,/* @__PURE__ */ new Set([`-o`,`-t`,`-r`,`-u`]));if(t.error)return nd(id[t.error].message);let n=e[e.length-1];if(n===`-help`)return process.stdout.write(td),T.success;let r=n.endsWith(`.tla`)?n:`${n}.tla`,i=[`.`,...t.includes],a=i.map(e=>Ct(e,r)).find(F);a===void 0&&!ke.has(r.slice(0,-4))&&Qt(process.cwd(),`./${r}`,t.includes);let o=nl(a??r,Zt(i),{fileName:n,isXmlExport:!0});return process.stderr.write(o.text),o.isFailed||o.specification===void 0?(console.error(`ERROR: Failed to parse module.`),Nu.specParsingFailure):rd(o.specification,{version:`master`,isRestricted:t.flags.has(`-r`),isUncommented:t.flags.has(`-u`),isTerse:t.flags.has(`-t`)})},sd=(e,t)=>(console.error(`Exception in thread "main" ${e}\n\tat tla2sany.xml.XMLExporter.main(XMLExporter.java:${t})`),Nu.uncaughtException),cd=(e,t)=>{let n=ad(e,/* @__PURE__ */ new Set([`-o`]));if(n.error)return sd(`java.lang.IllegalArgumentException: ${id[n.error].message}`,id[n.error].line174);let r=e[e.length-1],i=`${r.replace(/\.tla$/i,``)}.tla`,a=(n.includes.length===0?[`/`]:n.includes).map(an),o=[`.`,...a],s=e=>rn(`${a[a.length-1]}${e}`,a,t),c=o.map(e=>Ct(e,i)).find(F);if(c===void 0&&!ve.has(vt(i,`.tla`)))return s(i),T.success;let l=nl(c??i,on(Zt(o),s),{fileName:r,isXmlExport:!0,version:`1.7.4`});return process.stderr.write(l.text),l.specification===void 0?sd(`tla2sany.xml.XMLExportingException: spec ${(c&&tl(At(c,`utf8`),`1.7.4`))??`null`} is malformed - does not have a root module`,110):rd(l.specification,{version:`1.7.4`,isRestricted:!1,isUncommented:!1,isTerse:!0})},ld=[`tlc2.TLC`,`tla2sany.xml.XMLExporter`],ud=e=>{let t={libraries:[]};for(let n=0;n<e.length;n++){let r=e[n];if(r===`-cp`||r===`-classpath`||r===`--class-path`)n++,t.classPath=e[n];else if(r===`-jar`)return t.classPath=e[n+1],{mainClass:`tlc2.TLC`,args:e.slice(n+2),java:t};else if(r.startsWith(`-DTLA-Library=`))t.libraries.push(...r.slice(14).split(yt));else if(r.startsWith(`-Djava.io.tmpdir=`))t.temporaryDirectory=r.slice(17);else if(r.startsWith(`-Dtla-ts.tlc=`))t.tlcVersion=r.slice(13)===`1.7.4`?`1.7.4`:`master`;else if(!r.startsWith(`-D`)&&!r.startsWith(`-X`))return n>0||ld.includes(r)?{mainClass:r,args:e.slice(n+1),java:t}:void 0}},dd=async e=>{if(e[0]===`tlapm`)return nn(()=>nr(e.slice(1)));let t=ud(e);return t===void 0?ju(e,{libraries:[]}):(t.java.tlcVersion??=await qt(sn(t.java)),t.mainClass===`tlc2.TLC`?ju(t.args,t.java):t.mainClass===`tla2sany.xml.XMLExporter`?nn(()=>t.java.tlcVersion===`1.7.4`?cd(t.args,sn(t.java)):od(t.args)):(console.error(`Error: tla-ts runs the Java classes ${ld.join(` and `)}, not ${t.mainClass}.`),1))},fd=async()=>{process.exitCode=await dd(process.argv.slice(2))};export{fd as runCli};
|