tla-ts 0.0.10-dev.cb7650c54 → 0.0.10-dev.d618a2d79

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.
Files changed (454) hide show
  1. package/dist/deciders.cjs +29 -29
  2. package/dist/deciders.js +29 -29
  3. package/dist/prove.cjs +17 -17
  4. package/dist/prove.js +57 -57
  5. package/dist/run.cjs +15 -15
  6. package/dist/run.js +38 -38
  7. package/dist/transfer.cjs +12 -12
  8. package/dist/transfer.js +5 -5
  9. package/dist/worker.cjs +1 -1
  10. package/dist/worker.js +1 -1
  11. package/package.json +1 -1
  12. package/src/check-trace.ts +2 -16
  13. package/src/check.ts +23 -6
  14. package/src/cli/tlc-output.ts +3 -3
  15. package/src/cli/tlc-usage.ts +0 -1
  16. package/src/cli/tlc.ts +15 -1
  17. package/src/environment.ts +10 -5
  18. package/src/exit-codes.ts +1 -0
  19. package/src/liveness-checker.ts +27 -4
  20. package/src/obligations/action.ts +0 -2
  21. package/src/obligations/anonymize.ts +0 -2
  22. package/src/obligations/equality.ts +0 -2
  23. package/src/obligations/expression.ts +0 -2
  24. package/src/obligations/format.ts +0 -2
  25. package/src/obligations/generate.ts +0 -2
  26. package/src/obligations/levels.ts +0 -2
  27. package/src/obligations/module.ts +0 -2
  28. package/src/obligations/normalize.ts +0 -2
  29. package/src/obligations/operators.ts +0 -2
  30. package/src/obligations/printer.ts +0 -2
  31. package/src/obligations/proof.ts +0 -2
  32. package/src/obligations/regroup.ts +0 -2
  33. package/src/obligations/simplify.ts +0 -2
  34. package/src/obligations/subexpression.ts +0 -2
  35. package/src/obligations/substitution.ts +0 -2
  36. package/src/obligations/temporal.ts +0 -2
  37. package/src/obligations/tuples.ts +0 -2
  38. package/src/pretty-print.ts +1 -1
  39. package/src/prover/isabelle/encode.ts +0 -2
  40. package/src/prover/isabelle/isar/attrib.ts +0 -4
  41. package/src/prover/isabelle/isar/context.ts +0 -4
  42. package/src/prover/isabelle/isar/induct.ts +0 -4
  43. package/src/prover/isabelle/isar/method.ts +0 -2
  44. package/src/prover/isabelle/isar/proof.ts +0 -2
  45. package/src/prover/isabelle/isar/rule-cases.ts +0 -2
  46. package/src/prover/isabelle/isar/toplevel.ts +0 -4
  47. package/src/prover/isabelle/isar/type-check.ts +0 -2
  48. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  49. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  50. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  51. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  52. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  53. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  54. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  55. package/src/prover/isabelle/provers/classical.ts +0 -2
  56. package/src/prover/isabelle/provers/hypsubst.ts +0 -2
  57. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  58. package/src/prover/isabelle/pure/consts.ts +0 -2
  59. package/src/prover/isabelle/pure/conv.ts +0 -2
  60. package/src/prover/isabelle/pure/drule.ts +0 -2
  61. package/src/prover/isabelle/pure/envir.ts +0 -2
  62. package/src/prover/isabelle/pure/goal.ts +0 -2
  63. package/src/prover/isabelle/pure/logic.ts +0 -2
  64. package/src/prover/isabelle/pure/name.ts +0 -2
  65. package/src/prover/isabelle/pure/net.ts +0 -2
  66. package/src/prover/isabelle/pure/object-logic.ts +0 -2
  67. package/src/prover/isabelle/pure/pattern.ts +0 -2
  68. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  69. package/src/prover/isabelle/pure/rewriter.ts +0 -2
  70. package/src/prover/isabelle/pure/search.ts +0 -2
  71. package/src/prover/isabelle/pure/seq.ts +0 -2
  72. package/src/prover/isabelle/pure/simplifier.ts +0 -2
  73. package/src/prover/isabelle/pure/table.ts +0 -2
  74. package/src/prover/isabelle/pure/tactic.ts +0 -2
  75. package/src/prover/isabelle/pure/tactical.ts +0 -2
  76. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  77. package/src/prover/isabelle/pure/term.ts +0 -2
  78. package/src/prover/isabelle/pure/thm.ts +0 -2
  79. package/src/prover/isabelle/pure/type.ts +0 -2
  80. package/src/prover/isabelle/pure/unify.ts +0 -2
  81. package/src/prover/isabelle/pure/variable.ts +0 -2
  82. package/src/prover/isabelle/tla/classical-setup.ts +0 -2
  83. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  84. package/src/prover/isabelle/tools/intuitionistic.ts +0 -2
  85. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +0 -2
  86. package/src/prover/smt/solver/ackr-helper.ts +0 -3
  87. package/src/prover/smt/solver/ackr-model-converter.ts +0 -1
  88. package/src/prover/smt/solver/act-cache.ts +0 -1
  89. package/src/prover/smt/solver/add-bounds-tactic.ts +0 -1
  90. package/src/prover/smt/solver/aig-tactic.ts +0 -1
  91. package/src/prover/smt/solver/aig.ts +2 -3
  92. package/src/prover/smt/solver/arith-rewriter.ts +0 -1
  93. package/src/prover/smt/solver/arith-terms.ts +0 -2
  94. package/src/prover/smt/solver/array-decl-plugin.ts +0 -1
  95. package/src/prover/smt/solver/array-rewriter.ts +0 -1
  96. package/src/prover/smt/solver/asserted-formulas.ts +0 -1
  97. package/src/prover/smt/solver/ast-lt.ts +0 -1
  98. package/src/prover/smt/solver/ast-util.ts +0 -2
  99. package/src/prover/smt/solver/ast.ts +0 -1
  100. package/src/prover/smt/solver/auf-solver.ts +0 -1
  101. package/src/prover/smt/solver/bit-blast-tactic.ts +0 -3
  102. package/src/prover/smt/solver/bit-blaster.ts +0 -3
  103. package/src/prover/smt/solver/bound-manager.ts +0 -1
  104. package/src/prover/smt/solver/bound-simplifier.ts +0 -2
  105. package/src/prover/smt/solver/bv-bound-chk.ts +0 -2
  106. package/src/prover/smt/solver/bv-decl-plugin.ts +0 -1
  107. package/src/prover/smt/solver/bv-divrem-bounds.ts +0 -2
  108. package/src/prover/smt/solver/bv-rewriter.ts +0 -2
  109. package/src/prover/smt/solver/bv1-blast.ts +0 -2
  110. package/src/prover/smt/solver/bv2fpa-converter.ts +0 -1
  111. package/src/prover/smt/solver/bv2int-rewriter.ts +0 -1
  112. package/src/prover/smt/solver/bv2real-rewriter.ts +0 -1
  113. package/src/prover/smt/solver/card2bv.ts +0 -2
  114. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  115. package/src/prover/smt/solver/cg-table.ts +0 -2
  116. package/src/prover/smt/solver/check-logic.ts +0 -1
  117. package/src/prover/smt/solver/clause.ts +0 -1
  118. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +0 -2
  119. package/src/prover/smt/solver/conflict-resolution.ts +0 -1
  120. package/src/prover/smt/solver/context.ts +0 -1
  121. package/src/prover/smt/solver/ctx-simplify.ts +0 -1
  122. package/src/prover/smt/solver/ctx-solver-simplify.ts +0 -2
  123. package/src/prover/smt/solver/datatype-decl-plugin.ts +0 -1
  124. package/src/prover/smt/solver/datatype-rewriter.ts +0 -1
  125. package/src/prover/smt/solver/demodulator.ts +0 -3
  126. package/src/prover/smt/solver/dependent-expr-state.ts +0 -3
  127. package/src/prover/smt/solver/der.ts +0 -1
  128. package/src/prover/smt/solver/diff-neq.ts +0 -1
  129. package/src/prover/smt/solver/distribute-forall.ts +0 -1
  130. package/src/prover/smt/solver/dom-simplify.ts +0 -2
  131. package/src/prover/smt/solver/dt2bv-tactic.ts +0 -2
  132. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  133. package/src/prover/smt/solver/e-matching.ts +0 -1
  134. package/src/prover/smt/solver/elim-small-bv-tactic.ts +0 -1
  135. package/src/prover/smt/solver/elim-uncnstr.ts +0 -2
  136. package/src/prover/smt/solver/enode.ts +0 -1
  137. package/src/prover/smt/solver/eq2bv-tactic.ts +0 -1
  138. package/src/prover/smt/solver/euf/arith-axioms.ts +0 -1
  139. package/src/prover/smt/solver/euf/arith-internalize.ts +0 -2
  140. package/src/prover/smt/solver/euf/arith-solver.ts +0 -1
  141. package/src/prover/smt/solver/euf/array-axioms.ts +0 -1
  142. package/src/prover/smt/solver/euf/array-internalize.ts +0 -2
  143. package/src/prover/smt/solver/euf/array-solver.ts +0 -2
  144. package/src/prover/smt/solver/euf/bv-ackerman.ts +0 -2
  145. package/src/prover/smt/solver/euf/bv-internalize.ts +0 -2
  146. package/src/prover/smt/solver/euf/bv-solver.ts +0 -2
  147. package/src/prover/smt/solver/euf/dt-solver.ts +0 -2
  148. package/src/prover/smt/solver/euf/egraph.ts +2 -3
  149. package/src/prover/smt/solver/euf/euf-solver.ts +0 -3
  150. package/src/prover/smt/solver/euf/fpa-solver.ts +0 -2
  151. package/src/prover/smt/solver/euf/mam.ts +0 -2
  152. package/src/prover/smt/solver/euf/q-ematch.ts +0 -2
  153. package/src/prover/smt/solver/euf/q-mbi.ts +0 -2
  154. package/src/prover/smt/solver/euf/q-model-fixer.ts +0 -3
  155. package/src/prover/smt/solver/euf/q-solver.ts +0 -2
  156. package/src/prover/smt/solver/euf/th-solver.ts +0 -2
  157. package/src/prover/smt/solver/euf/th-solvers.ts +0 -1
  158. package/src/prover/smt/solver/expr-ref.ts +0 -1
  159. package/src/prover/smt/solver/expr-safe-replace.ts +0 -1
  160. package/src/prover/smt/solver/expr2polynomial.ts +0 -1
  161. package/src/prover/smt/solver/factor.ts +0 -1
  162. package/src/prover/smt/solver/fd-solver.ts +0 -3
  163. package/src/prover/smt/solver/fingerprints.ts +0 -1
  164. package/src/prover/smt/solver/fix-dl-var.ts +0 -1
  165. package/src/prover/smt/solver/flat-literals.ts +0 -1
  166. package/src/prover/smt/solver/fm-tactic.ts +0 -1
  167. package/src/prover/smt/solver/fpa-decl-plugin.ts +0 -1
  168. package/src/prover/smt/solver/fpa-rewriter.ts +0 -1
  169. package/src/prover/smt/solver/fpa2bv-converter.ts +0 -1
  170. package/src/prover/smt/solver/fpa2bv-rewriter.ts +0 -1
  171. package/src/prover/smt/solver/fpa2bv-tactic.ts +0 -2
  172. package/src/prover/smt/solver/goal.ts +0 -1
  173. package/src/prover/smt/solver/goal2nlsat.ts +0 -2
  174. package/src/prover/smt/solver/guard-set.ts +0 -1
  175. package/src/prover/smt/solver/hash.ts +0 -1
  176. package/src/prover/smt/solver/hashtable.ts +0 -1
  177. package/src/prover/smt/solver/inf-eps.ts +1 -2
  178. package/src/prover/smt/solver/inj-axiom.ts +0 -1
  179. package/src/prover/smt/solver/internalizer.ts +0 -1
  180. package/src/prover/smt/solver/lackr.ts +0 -2
  181. package/src/prover/smt/solver/lbool.ts +0 -1
  182. package/src/prover/smt/solver/lia2card.ts +0 -1
  183. package/src/prover/smt/solver/lia2pb.ts +0 -1
  184. package/src/prover/smt/solver/literal.ts +0 -1
  185. package/src/prover/smt/solver/logic-tactics.ts +0 -4
  186. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  187. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  188. package/src/prover/smt/solver/lp/containers.ts +7 -2
  189. package/src/prover/smt/solver/lp/core-solver.ts +0 -3
  190. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  191. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  192. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  193. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  194. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  195. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  196. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  197. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  198. package/src/prover/smt/solver/lp/int-cube.ts +0 -1
  199. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  200. package/src/prover/smt/solver/lp/lar-solver.ts +0 -1
  201. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  202. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  203. package/src/prover/smt/solver/lp/maximize-term.ts +0 -3
  204. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  205. package/src/prover/smt/solver/lp/nex.ts +2 -2
  206. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  207. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  208. package/src/prover/smt/solver/lp/nla-core.ts +25 -6
  209. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  210. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  211. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  212. package/src/prover/smt/solver/lp/nla-grobner.ts +0 -2
  213. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  214. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  215. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  216. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  217. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  218. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  219. package/src/prover/smt/solver/lp/nla-powers.ts +0 -1
  220. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  221. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  222. package/src/prover/smt/solver/lp/nla-transcendentals.ts +0 -2
  223. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  224. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  225. package/src/prover/smt/solver/lp/nra-solver.ts +97 -62
  226. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  227. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  228. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  229. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  230. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  231. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  232. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  233. package/src/prover/smt/solver/lp/union-find.ts +0 -1
  234. package/src/prover/smt/solver/macro-finder.ts +0 -3
  235. package/src/prover/smt/solver/mam-compiler.ts +0 -1
  236. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  237. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +0 -2
  238. package/src/prover/smt/solver/max-cliques.ts +0 -2
  239. package/src/prover/smt/solver/maxcore.ts +1 -2
  240. package/src/prover/smt/solver/maximize-ac-sharing.ts +0 -1
  241. package/src/prover/smt/solver/maxlex.ts +0 -1
  242. package/src/prover/smt/solver/maxsmt-base.ts +0 -1
  243. package/src/prover/smt/solver/maxsmt.ts +0 -1
  244. package/src/prover/smt/solver/mbp/mbp-arith.ts +0 -1
  245. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +0 -1
  246. package/src/prover/smt/solver/mbp/mbp-plugin.ts +0 -2
  247. package/src/prover/smt/solver/mbp/mbp-qel.ts +0 -1
  248. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +0 -1
  249. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +0 -1
  250. package/src/prover/smt/solver/model-based-opt.ts +0 -1
  251. package/src/prover/smt/solver/model-checker.ts +0 -1
  252. package/src/prover/smt/solver/model-evaluator.ts +0 -1
  253. package/src/prover/smt/solver/model-finder.ts +0 -1
  254. package/src/prover/smt/solver/model-generator.ts +0 -1
  255. package/src/prover/smt/solver/model-macro-solver.ts +0 -1
  256. package/src/prover/smt/solver/model-printer.ts +0 -1
  257. package/src/prover/smt/solver/mpf.ts +0 -1
  258. package/src/prover/smt/solver/mus.ts +0 -1
  259. package/src/prover/smt/solver/muz/dl-context.ts +0 -2
  260. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +0 -1
  261. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +0 -2
  262. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +0 -2
  263. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +0 -2
  264. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +0 -1
  265. package/src/prover/smt/solver/muz/dl-mk-slice.ts +0 -1
  266. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +0 -2
  267. package/src/prover/smt/solver/muz/dl-rule-set.ts +0 -1
  268. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +0 -2
  269. package/src/prover/smt/solver/muz/dl-rule.ts +0 -2
  270. package/src/prover/smt/solver/muz/hnf.ts +0 -1
  271. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +0 -2
  272. package/src/prover/smt/solver/muz/horn-tactic.ts +0 -2
  273. package/src/prover/smt/solver/muz/rule-properties.ts +0 -1
  274. package/src/prover/smt/solver/muz/spacer-context.ts +0 -1
  275. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +0 -1
  276. package/src/prover/smt/solver/muz/spacer-generalizers.ts +0 -3
  277. package/src/prover/smt/solver/muz/spacer-manager.ts +0 -2
  278. package/src/prover/smt/solver/muz/spacer-pdr.ts +0 -1
  279. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +1 -2
  280. package/src/prover/smt/solver/muz/spacer-util.ts +0 -1
  281. package/src/prover/smt/solver/muz/substitution.ts +0 -2
  282. package/src/prover/smt/solver/nla2bv-tactic.ts +0 -1
  283. package/src/prover/smt/solver/nlqsat.ts +2 -2
  284. package/src/prover/smt/solver/nlsat/algebraic.ts +0 -2
  285. package/src/prover/smt/solver/nlsat/atoms.ts +0 -2
  286. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  287. package/src/prover/smt/solver/nlsat/explain.ts +0 -1
  288. package/src/prover/smt/solver/nlsat/interval-set.ts +0 -1
  289. package/src/prover/smt/solver/nlsat/levelwise.ts +2 -3
  290. package/src/prover/smt/solver/nlsat/mpbq.ts +0 -1
  291. package/src/prover/smt/solver/nlsat/polynomial.ts +0 -2
  292. package/src/prover/smt/solver/nlsat/solver.ts +5 -13
  293. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +2 -3
  294. package/src/prover/smt/solver/nlsat/transcendentals.ts +0 -2
  295. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  296. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +0 -3
  297. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  298. package/src/prover/smt/solver/nlsat-tactic.ts +0 -1
  299. package/src/prover/smt/solver/nnf.ts +0 -1
  300. package/src/prover/smt/solver/normalize-bounds.ts +0 -1
  301. package/src/prover/smt/solver/occf.ts +0 -1
  302. package/src/prover/smt/solver/opt-context.ts +1 -2
  303. package/src/prover/smt/solver/opt-nlsat.ts +0 -1
  304. package/src/prover/smt/solver/opt-pareto.ts +0 -2
  305. package/src/prover/smt/solver/opt-preprocess.ts +0 -1
  306. package/src/prover/smt/solver/opt-solver.ts +0 -1
  307. package/src/prover/smt/solver/opt-value.ts +0 -1
  308. package/src/prover/smt/solver/optsmt.ts +0 -2
  309. package/src/prover/smt/solver/parallel-tactic.ts +0 -2
  310. package/src/prover/smt/solver/pattern-inference.ts +0 -1
  311. package/src/prover/smt/solver/pb-rewriter.ts +0 -3
  312. package/src/prover/smt/solver/pb2bv-tactic.ts +0 -2
  313. package/src/prover/smt/solver/poly-rewriter.ts +0 -1
  314. package/src/prover/smt/solver/probes.ts +2 -4
  315. package/src/prover/smt/solver/propagate-values.ts +0 -1
  316. package/src/prover/smt/solver/proto-model.ts +0 -1
  317. package/src/prover/smt/solver/pull-quant.ts +0 -1
  318. package/src/prover/smt/solver/purify-arith.ts +0 -1
  319. package/src/prover/smt/solver/qe-arith-plugin.ts +0 -2
  320. package/src/prover/smt/solver/qe-lite-der.ts +0 -1
  321. package/src/prover/smt/solver/qe-lite-fm.ts +0 -1
  322. package/src/prover/smt/solver/qe-lite.ts +0 -1
  323. package/src/prover/smt/solver/qe-mbp.ts +0 -1
  324. package/src/prover/smt/solver/qe.ts +0 -2
  325. package/src/prover/smt/solver/qel.ts +0 -1
  326. package/src/prover/smt/solver/qi-queue.ts +0 -1
  327. package/src/prover/smt/solver/qsat.ts +0 -1
  328. package/src/prover/smt/solver/quant-hoist.ts +0 -1
  329. package/src/prover/smt/solver/quant-tactics.ts +0 -1
  330. package/src/prover/smt/solver/quantifier-analyzer.ts +0 -1
  331. package/src/prover/smt/solver/quantifier-manager.ts +0 -1
  332. package/src/prover/smt/solver/quasi-macros.ts +0 -2
  333. package/src/prover/smt/solver/random-gen.ts +0 -1
  334. package/src/prover/smt/solver/rational.ts +0 -1
  335. package/src/prover/smt/solver/recfun-decl-plugin.ts +0 -1
  336. package/src/prover/smt/solver/recfun-rewriter.ts +0 -1
  337. package/src/prover/smt/solver/reduce-args.ts +0 -1
  338. package/src/prover/smt/solver/reduce-bv-size.ts +0 -1
  339. package/src/prover/smt/solver/ref-vector.ts +0 -1
  340. package/src/prover/smt/solver/relevancy.ts +0 -1
  341. package/src/prover/smt/solver/rewriter-tpl.ts +0 -1
  342. package/src/prover/smt/solver/rewriter.ts +0 -1
  343. package/src/prover/smt/solver/rlimit.ts +13 -1
  344. package/src/prover/smt/solver/sat/asymm-branch.ts +0 -2
  345. package/src/prover/smt/solver/sat/big.ts +0 -1
  346. package/src/prover/smt/solver/sat/clause-use-list.ts +0 -2
  347. package/src/prover/smt/solver/sat/clause.ts +0 -3
  348. package/src/prover/smt/solver/sat/cleaner.ts +0 -2
  349. package/src/prover/smt/solver/sat/config.ts +0 -3
  350. package/src/prover/smt/solver/sat/consequences.ts +0 -1
  351. package/src/prover/smt/solver/sat/elim-eqs.ts +0 -2
  352. package/src/prover/smt/solver/sat/goal2sat.ts +0 -2
  353. package/src/prover/smt/solver/sat/inc-sat-solver.ts +0 -1
  354. package/src/prover/smt/solver/sat/model-converter.ts +0 -2
  355. package/src/prover/smt/solver/sat/pb-constraint.ts +0 -3
  356. package/src/prover/smt/solver/sat/pb-solver.ts +0 -2
  357. package/src/prover/smt/solver/sat/probing.ts +0 -2
  358. package/src/prover/smt/solver/sat/sat-tactic.ts +0 -1
  359. package/src/prover/smt/solver/sat/sat2goal.ts +0 -2
  360. package/src/prover/smt/solver/sat/scc.ts +0 -1
  361. package/src/prover/smt/solver/sat/simplifier.ts +0 -3
  362. package/src/prover/smt/solver/sat/solver.ts +0 -2
  363. package/src/prover/smt/solver/sat/var-queue.ts +0 -2
  364. package/src/prover/smt/solver/sat/watch-list.ts +0 -3
  365. package/src/prover/smt/solver/search-tree.ts +0 -1
  366. package/src/prover/smt/solver/seq-axioms.ts +0 -1
  367. package/src/prover/smt/solver/seq-decl-plugin.ts +0 -1
  368. package/src/prover/smt/solver/seq-derive.ts +3 -8
  369. package/src/prover/smt/solver/seq-eq-approx.ts +0 -2
  370. package/src/prover/smt/solver/seq-eq-solver.ts +0 -1
  371. package/src/prover/smt/solver/seq-factory.ts +0 -1
  372. package/src/prover/smt/solver/seq-monadic.ts +0 -2
  373. package/src/prover/smt/solver/seq-range-predicate.ts +0 -2
  374. package/src/prover/smt/solver/seq-re-rewriter.ts +0 -1
  375. package/src/prover/smt/solver/seq-re-util.ts +0 -2
  376. package/src/prover/smt/solver/seq-regex-bisim.ts +0 -1
  377. package/src/prover/smt/solver/seq-regex-live.ts +0 -2
  378. package/src/prover/smt/solver/seq-rewriter.ts +0 -2
  379. package/src/prover/smt/solver/seq-skolem.ts +0 -1
  380. package/src/prover/smt/solver/seq-subset.ts +0 -1
  381. package/src/prover/smt/solver/seq-view-witness.ts +0 -2
  382. package/src/prover/smt/solver/smt-consequences.ts +0 -2
  383. package/src/prover/smt/solver/smt-kernel.ts +0 -2
  384. package/src/prover/smt/solver/smt-logics.ts +0 -1
  385. package/src/prover/smt/solver/smt-setup.ts +3 -5
  386. package/src/prover/smt/solver/smt2-printer.ts +0 -2
  387. package/src/prover/smt/solver/smtlib-parser.ts +0 -2
  388. package/src/prover/smt/solver/smtlib-script.ts +0 -2
  389. package/src/prover/smt/solver/solve-eqs.ts +0 -2
  390. package/src/prover/smt/solver/solver.ts +1 -2
  391. package/src/prover/smt/solver/static-features.ts +0 -2
  392. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  393. package/src/prover/smt/solver/tactic.ts +0 -2
  394. package/src/prover/smt/solver/term-enumeration.ts +0 -1
  395. package/src/prover/smt/solver/theory-array.ts +0 -2
  396. package/src/prover/smt/solver/theory-bv.ts +0 -2
  397. package/src/prover/smt/solver/theory-char.ts +0 -1
  398. package/src/prover/smt/solver/theory-datatype.ts +0 -1
  399. package/src/prover/smt/solver/theory-finite-set.ts +2 -2
  400. package/src/prover/smt/solver/theory-fpa.ts +0 -1
  401. package/src/prover/smt/solver/theory-lra-axioms.ts +0 -1
  402. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -1
  403. package/src/prover/smt/solver/theory-lra-final-check.ts +0 -1
  404. package/src/prover/smt/solver/theory-lra-internalize.ts +8 -1
  405. package/src/prover/smt/solver/theory-lra-model.ts +0 -1
  406. package/src/prover/smt/solver/theory-lra-propagate.ts +0 -1
  407. package/src/prover/smt/solver/theory-lra-state.ts +0 -1
  408. package/src/prover/smt/solver/theory-lra.ts +0 -1
  409. package/src/prover/smt/solver/theory-pb.ts +0 -2
  410. package/src/prover/smt/solver/theory-polymorphism.ts +3 -4
  411. package/src/prover/smt/solver/theory-recfun.ts +0 -1
  412. package/src/prover/smt/solver/theory-seq-regex.ts +0 -1
  413. package/src/prover/smt/solver/theory-seq-solve.ts +0 -2
  414. package/src/prover/smt/solver/theory-seq-state.ts +0 -2
  415. package/src/prover/smt/solver/theory-seq.ts +0 -1
  416. package/src/prover/smt/solver/theory.ts +0 -1
  417. package/src/prover/smt/solver/tseitin-cnf.ts +0 -2
  418. package/src/prover/smt/solver/var-subst.ts +0 -1
  419. package/src/prover/zenon/decide.ts +0 -2
  420. package/src/prover/zenon/encode.ts +0 -2
  421. package/src/prover/zenon/eqrel.ts +0 -2
  422. package/src/prover/zenon/equality-rules.ts +24 -2
  423. package/src/prover/zenon/expr.ts +21 -2
  424. package/src/prover/zenon/index-table.ts +2 -2
  425. package/src/prover/zenon/isar-case.ts +0 -2
  426. package/src/prover/zenon/isar.ts +0 -2
  427. package/src/prover/zenon/llproof.ts +0 -2
  428. package/src/prover/zenon/mltoll.ts +0 -2
  429. package/src/prover/zenon/node.ts +0 -2
  430. package/src/prover/zenon/parse.ts +0 -2
  431. package/src/prover/zenon/phrase.ts +0 -2
  432. package/src/prover/zenon/proof.ts +0 -2
  433. package/src/prover/zenon/propositional-rules.ts +0 -2
  434. package/src/prover/zenon/rules.ts +2 -3
  435. package/src/prover/zenon/search.ts +0 -2
  436. package/src/prover/zenon/tla/functions.ts +0 -2
  437. package/src/prover/zenon/tla/llproof.ts +0 -2
  438. package/src/prover/zenon/tla/records.ts +0 -2
  439. package/src/prover/zenon/tla/rewrites.ts +0 -2
  440. package/src/prover/zenon/tla/sets.ts +0 -2
  441. package/src/prover/zenon/tla/terms.ts +0 -2
  442. package/src/prover/zenon/tla/tla.ts +0 -2
  443. package/src/resolve.ts +1 -2
  444. package/src/runtime.ts +4 -0
  445. package/src/sany/levels.ts +0 -2
  446. package/src/sany/linter.ts +0 -2
  447. package/src/search.ts +29 -20
  448. package/src/simulate.ts +3 -0
  449. package/src/standard-definitions.ts +4 -0
  450. package/src/state-graph.ts +0 -2
  451. package/src/tlc/tlcext-operators.ts +44 -12
  452. package/src/tlc/trace-spec.ts +2 -3
  453. package/src/prover/smt/solver/z3-license.txt +0 -10
  454. package/src/prover/zenon/LICENSE +0 -32
package/dist/worker.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={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=new Map([...[...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281,...Array.from({length:7},(e,t)=>5001+t)].map(t=>[t,e.configParseError]),[2253,e.livenessEvaluationFailure],[2109,e.specEvaluationFailure],[2115,e.specEvaluationFailure],[2103,e.specEvaluationFailure],[2147,e.specEvaluationFailure],[2111,e.safetyEvaluationFailure],[2146,e.safetyEvaluationFailure],[2107,e.safetyViolation],[2110,e.safetyViolation],[2112,e.livenessViolation],[2113,e.livenessViolation],[2116,e.livenessViolation],[2108,e.livenessViolation],[2114,e.deadlock],[2104,e.assumptionViolation],[2105,e.assumptionViolation],[2404,e.assumptionViolation],[2405,e.assumptionViolation],[2780,e.assumptionViolation],[2132,e.assertViolation],[2171,e.specParseError],[3002,e.specParseError]]),n=n=>t.get(n)??e.error,r=/* @__PURE__ */ new WeakMap,i=(e,t)=>(e instanceof Error&&!r.has(e)&&r.set(e,t),e),a=e=>r.get(e),o=t=>{try{return t()}catch(t){throw i(t,e.error)}},s=e=>{let t=o(e);return t&&{branches:t.branches,solutions:t.solutions,addInitialState:(e,n,r)=>o(()=>t.addInitialState(e,n,r)),addState:(e,n,r,i)=>o(()=>t.addState(e,n,r,i)),findViolation:()=>o(()=>t.findViolation()),getViolatedProperties:(e,n)=>o(()=>t.getViolatedProperties(e,n))}},c=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,l=c(`java.lang.RuntimeException`),u=c(`tlc2.tool.EvalException`),ee=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`||e instanceof SyntaxError&&e.message.endsWith(`: Stack overflow`);var d=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},f=class extends d{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},p=class extends f{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},te=class extends p{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const m=(e,t=!1,n,r=[])=>new f(e.map(e=>`${e.location}\n\n${e.message}`).join(`
9
+ const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=new Map([...[...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281,...Array.from({length:7},(e,t)=>5001+t)].map(t=>[t,e.configParseError]),[2253,e.livenessEvaluationFailure],[2109,e.specEvaluationFailure],[2115,e.specEvaluationFailure],[2103,e.specEvaluationFailure],[2147,e.specEvaluationFailure],[2111,e.safetyEvaluationFailure],[2146,e.safetyEvaluationFailure],[2107,e.safetyViolation],[2110,e.safetyViolation],[2112,e.livenessViolation],[2113,e.livenessViolation],[2116,e.livenessViolation],[2108,e.livenessViolation],[2114,e.deadlock],[2104,e.assumptionViolation],[2105,e.assumptionViolation],[2404,e.assumptionViolation],[2405,e.assumptionViolation],[2780,e.assumptionViolation],[2132,e.assertViolation],[2171,e.specParseError],[3002,e.specParseError]]),n=n=>t.get(n)??e.error,r=/* @__PURE__ */ new WeakMap,i=(e,t)=>(e instanceof Error&&!r.has(e)&&r.set(e,t),e),a=e=>r.get(e),o=t=>{try{return t()}catch(t){throw i(t,e.error)}},s=e=>{let t=o(e);return t&&{branches:t.branches,solutions:t.solutions,addInitialState:(e,n,r)=>o(()=>t.addInitialState(e,n,r)),addState:(e,n,r,i)=>o(()=>t.addState(e,n,r,i)),storeState:t.storeState,findViolation:()=>o(()=>t.findViolation()),getViolatedProperties:(e,n)=>o(()=>t.getViolatedProperties(e,n))}},c=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,l=c(`java.lang.RuntimeException`),u=c(`tlc2.tool.EvalException`),ee=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`||e instanceof SyntaxError&&e.message.endsWith(`: Stack overflow`);var d=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},f=class extends d{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},p=class extends f{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},te=class extends p{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const m=(e,t=!1,n,r=[])=>new f(e.map(e=>`${e.location}\n\n${e.message}`).join(`
10
10
 
11
11
  `),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),h=(e,t)=>m([{location:`In module ${t}`,message:`Cannot find source file for module ${e} imported in module ${t}.`}],!0),g=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
12
12
  `)}`,_=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,ne=(e,t)=>m([{location:_(t),message:e}]);var v=class extends d{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},y=class extends d{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}};const b=`This was a Java StackOverflowError. It was probably the result
package/dist/worker.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
- const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=new Map([...[...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281,...Array.from({length:7},(e,t)=>5001+t)].map(t=>[t,e.configParseError]),[2253,e.livenessEvaluationFailure],[2109,e.specEvaluationFailure],[2115,e.specEvaluationFailure],[2103,e.specEvaluationFailure],[2147,e.specEvaluationFailure],[2111,e.safetyEvaluationFailure],[2146,e.safetyEvaluationFailure],[2107,e.safetyViolation],[2110,e.safetyViolation],[2112,e.livenessViolation],[2113,e.livenessViolation],[2116,e.livenessViolation],[2108,e.livenessViolation],[2114,e.deadlock],[2104,e.assumptionViolation],[2105,e.assumptionViolation],[2404,e.assumptionViolation],[2405,e.assumptionViolation],[2780,e.assumptionViolation],[2132,e.assertViolation],[2171,e.specParseError],[3002,e.specParseError]]),n=n=>t.get(n)??e.error,r=/* @__PURE__ */ new WeakMap,i=(e,t)=>(e instanceof Error&&!r.has(e)&&r.set(e,t),e),a=e=>r.get(e),o=t=>{try{return t()}catch(t){throw i(t,e.error)}},s=e=>{let t=o(e);return t&&{branches:t.branches,solutions:t.solutions,addInitialState:(e,n,r)=>o(()=>t.addInitialState(e,n,r)),addState:(e,n,r,i)=>o(()=>t.addState(e,n,r,i)),findViolation:()=>o(()=>t.findViolation()),getViolatedProperties:(e,n)=>o(()=>t.getViolatedProperties(e,n))}},c=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,l=c(`java.lang.RuntimeException`),u=c(`tlc2.tool.EvalException`),ee=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`||e instanceof SyntaxError&&e.message.endsWith(`: Stack overflow`);var d=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},f=class extends d{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},p=class extends f{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},te=class extends p{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const m=(e,t=!1,n,r=[])=>new f(e.map(e=>`${e.location}\n\n${e.message}`).join(`
9
+ const e={success:0,assumptionViolation:10,deadlock:11,safetyViolation:12,livenessViolation:13,assertViolation:14,specEvaluationFailure:75,safetyEvaluationFailure:76,livenessEvaluationFailure:77,specParseError:150,configParseError:151,error:255},t=new Map([...[...Array.from({length:24},(e,t)=>2222+t),2272,2273,2274,2280,2281,...Array.from({length:7},(e,t)=>5001+t)].map(t=>[t,e.configParseError]),[2253,e.livenessEvaluationFailure],[2109,e.specEvaluationFailure],[2115,e.specEvaluationFailure],[2103,e.specEvaluationFailure],[2147,e.specEvaluationFailure],[2111,e.safetyEvaluationFailure],[2146,e.safetyEvaluationFailure],[2107,e.safetyViolation],[2110,e.safetyViolation],[2112,e.livenessViolation],[2113,e.livenessViolation],[2116,e.livenessViolation],[2108,e.livenessViolation],[2114,e.deadlock],[2104,e.assumptionViolation],[2105,e.assumptionViolation],[2404,e.assumptionViolation],[2405,e.assumptionViolation],[2780,e.assumptionViolation],[2132,e.assertViolation],[2171,e.specParseError],[3002,e.specParseError]]),n=n=>t.get(n)??e.error,r=/* @__PURE__ */ new WeakMap,i=(e,t)=>(e instanceof Error&&!r.has(e)&&r.set(e,t),e),a=e=>r.get(e),o=t=>{try{return t()}catch(t){throw i(t,e.error)}},s=e=>{let t=o(e);return t&&{branches:t.branches,solutions:t.solutions,addInitialState:(e,n,r)=>o(()=>t.addInitialState(e,n,r)),addState:(e,n,r,i)=>o(()=>t.addState(e,n,r,i)),storeState:t.storeState,findViolation:()=>o(()=>t.findViolation()),getViolatedProperties:(e,n)=>o(()=>t.getViolatedProperties(e,n))}},c=e=>`TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nSee the User Output or TLC Console for clues to what happened.\nThe exception was a ${e}\n: `,l=c(`java.lang.RuntimeException`),u=c(`tlc2.tool.EvalException`),ee=e=>e instanceof RangeError&&e.message===`Maximum call stack size exceeded`||e instanceof SyntaxError&&e.message.endsWith(`: Stack overflow`);var d=class extends Error{constructor(e,t){super(e,{cause:t}),this.name=`TlaError`}},f=class extends d{failure;sany;constructor(e,t,n,r){super(e,t),this.name=`TlaSyntaxError`,this.failure=n,this.sany=r}},p=class extends f{location;parseError;constructor(e,t,n){super(e),this.location=t,this.parseError=n}},te=class extends p{constructor(e,t,n=!0){super(`Cannot find source file for module ${e} imported in module ${t}.`,n?t:void 0)}};const m=(e,t=!1,n,r=[])=>new f(e.map(e=>`${e.location}\n\n${e.message}`).join(`
10
10
 
11
11
  `),void 0,void 0,{errors:e,warnings:r,isFatal:t,parseError:n}),h=(e,t)=>m([{location:`In module ${t}`,message:`Cannot find source file for module ${e} imported in module ${t}.`}],!0),g=e=>`*** Warnings: ${e.length}\n\n${e.map(e=>`${e.location}\n\n${e.message}\n\n\n`).join(`
12
12
  `)}`,_=e=>`line ${e.start.line}, col ${e.start.column} to line ${e.end.line}, col ${e.end.column} of module ${e.module}`,ne=(e,t)=>m([{location:_(t),message:e}]);var v=class extends d{constructor(e,t){super(e,t),this.name=`TlaConfigError`}},y=class extends d{constructor(e,t){super(e,t),this.name=`TlaEvaluationError`}};const b=`This was a Java StackOverflowError. It was probably the result
package/package.json CHANGED
@@ -1,6 +1,6 @@
1
1
  {
2
2
  "name": "tla-ts",
3
- "version": "0.0.10-dev.cb7650c54",
3
+ "version": "0.0.10-dev.d618a2d79",
4
4
  "description": "A TLA+ interpreter and model checker in TypeScript, 2× faster than TLC",
5
5
  "keywords": [
6
6
  "formal verification",
@@ -234,25 +234,11 @@ export const createTraceBuilder = (context: TraceContext) => {
234
234
  : lastSuccessor.action;
235
235
  return toTrace([...steps, { state: lastSuccessor.state, action }], path, { known: 2 });
236
236
  };
237
- // Deviation from TLC: TLCTrace#printTrace prints a lone initial state without the alias.
237
+ // TLCTrace#printTrace prints a lone initial state without the alias it applies to every other trace.
238
238
  const getStateTrace = (index: number): Behavior =>
239
239
  context.parents[index] === -1
240
240
  ? {
241
- trace: [
242
- {
243
- action: undefined,
244
- label: undefined,
245
- state:
246
- config.alias === undefined
247
- ? toRecord(states[index])
248
- : getAliasState(
249
- config.alias,
250
- [{ state: states[index], action: undefined }],
251
- 0,
252
- undefined,
253
- ),
254
- },
255
- ],
241
+ trace: [{ action: undefined, label: undefined, state: toRecord(states[index]) }],
256
242
  traceOutput: is174 ? [] : captureOutput(context.getInitialStates).lines,
257
243
  }
258
244
  : getTrace(index);
package/src/check.ts CHANGED
@@ -47,6 +47,7 @@ import {
47
47
  getStateHash,
48
48
  isSameState,
49
49
  markSeenState,
50
+ type StateTable,
50
51
  } from "./fingerprints";
51
52
  import type { JavaOverride } from "./java-overrides";
52
53
  import {
@@ -727,12 +728,12 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
727
728
  search.satisfiesActionConstraints(state, successor.state);
728
729
  if (!isInModel) return false;
729
730
  const fingerprintState = getFingerprintState(successor.state);
730
- const index = findStateIndex(
731
- seenStates,
732
- getStateHash(fingerprintState),
733
- fingerprintState,
734
- );
735
- successors.push({ index, state: successor.state });
731
+ const hash = getStateHash(fingerprintState);
732
+ const index = findStateIndex(seenStates, hash, fingerprintState);
733
+ successors.push({
734
+ index: index === -1 ? getPendingIndex(hash, fingerprintState) : index,
735
+ state: successor.state,
736
+ });
736
737
  return false;
737
738
  },
738
739
  spec.scope,
@@ -755,6 +756,18 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
755
756
  const actions: (string | undefined)[] = [];
756
757
  const depths: number[] = [];
757
758
  const seenStates = createStateTable(fingerprintStates);
759
+ const pendingFingerprintStates: Value[][] = [];
760
+ let pendingStates: StateTable | undefined;
761
+ const getPendingIndex = (hash: number, fingerprintState: Value[]) => {
762
+ pendingStates ??= createStateTable(pendingFingerprintStates);
763
+ const found = findStateIndex(pendingStates, hash, fingerprintState);
764
+ const position = found === -1 ? pendingFingerprintStates.length : found;
765
+ if (found === -1) {
766
+ markSeenState(pendingStates, hash, position);
767
+ pendingFingerprintStates.push(fingerprintState);
768
+ }
769
+ return -2 - position;
770
+ };
758
771
  const canonicalizeState = createCanonicalizer();
759
772
 
760
773
  const toRecord = search.toRecord;
@@ -1092,6 +1105,10 @@ const searchStates = (options: CheckOptions, stateWriter: StateWriter | undefine
1092
1105
  if (coverage) countCoverageVariables(coverage, successor.state);
1093
1106
  if (!isCanonicalizedFirst) canonicalizeState(successor.state);
1094
1107
  markSeenState(seenStates, found.hash, states.length);
1108
+ if (pendingStates) {
1109
+ const pending = findStateIndex(pendingStates, found.hash, found.fingerprintState);
1110
+ if (pending !== -1) liveness?.storeState(-2 - pending, states.length);
1111
+ }
1095
1112
  addState(successor.state, found.fingerprintState, index, successor.action);
1096
1113
  runtime.queueSize++;
1097
1114
  return undefined;
@@ -609,9 +609,9 @@ export const printCommandLineError = (isTool: boolean, version: TlcVersion, mess
609
609
  return 1;
610
610
  };
611
611
 
612
- // Deviation from TLC: tla-ts keeps its fingerprints and its queue of states in memory.
612
+ // TLC prints the JVM's default direct memory limit and its default fingerprint set and state queue.
613
613
  export const printStartupBanner = (printer: MessagePrinter, args: TlcArguments) => {
614
- const workers = `${args.workers} worker${args.workers === 1 ? "" : "s"} on ${availableParallelism()} cores with ${Math.floor(getHeapStatistics().heap_size_limit / 1024 / 1024)}MB heap and 0MB offheap memory [pid: ${process.pid}] (${type()} ${release()} ${arch()}, Node.js ${process.versions.node} ${process.arch.endsWith("64") ? 64 : 32}bit`;
614
+ const workers = `${args.workers} worker${args.workers === 1 ? "" : "s"} on ${availableParallelism()} cores with ${Math.floor(getHeapStatistics().heap_size_limit / 1024 / 1024)}MB heap and 64MB offheap memory [pid: ${process.pid}] (${type()} ${release()} ${arch()}, Node.js ${process.versions.node} ${process.arch.endsWith("64") ? 64 : 32}bit`;
615
615
  if (args.mode === "model-check" && args.dfidDepth !== undefined) {
616
616
  printer.print(
617
617
  MESSAGE_CODE.depthFirstModelChecking,
@@ -624,7 +624,7 @@ export const printStartupBanner = (printer: MessagePrinter, args: TlcArguments)
624
624
  printer.print(
625
625
  MESSAGE_CODE.modelChecking,
626
626
  MESSAGE_LEVEL.none,
627
- `Running breadth-first search Model-Checking with fp ${args.fingerprintIndex} and seed ${args.seed} with ${workers}, MemFPSet, MemStateQueue).`,
627
+ `Running breadth-first search Model-Checking with fp ${args.fingerprintIndex} and seed ${args.seed} with ${workers}, MSBDiskFPSet, DiskStateQueue).`,
628
628
  );
629
629
  return;
630
630
  }
@@ -1,4 +1,3 @@
1
- // A port of TLC.printUsage and UsageGenerator.displayUsage.
2
1
  interface UsageArgument {
3
2
  name: string;
4
3
  sampleValue?: string;
package/src/cli/tlc.ts CHANGED
@@ -29,6 +29,7 @@ import { EXIT_STATUS } from "../exit-codes";
29
29
  import { check } from "../parallel";
30
30
  import { extractModule, parseModule } from "../parser";
31
31
  import { simulate } from "../simulate";
32
+ import type { StandardInput } from "../search";
32
33
  import type { StateDump } from "../state-graph";
33
34
  import {
34
35
  getSanyStandardModules,
@@ -385,7 +386,7 @@ const checkSpec = async (
385
386
  version,
386
387
  );
387
388
  config.invariants.push(...invariants.names);
388
- const options: CheckOptions = {
389
+ const options: CheckOptions & StandardInput = {
389
390
  workers: args.workers,
390
391
  livenessCheck:
391
392
  livenessCheck === "off"
@@ -412,6 +413,7 @@ const checkSpec = async (
412
413
  source: invariants.source,
413
414
  config,
414
415
  onPause: () => readSync(0, Buffer.alloc(1)),
416
+ readLine: readStandardInputLine,
415
417
  loadModule,
416
418
  loadClass: (name) => {
417
419
  const classPath = getClassPath(directory, name);
@@ -478,6 +480,18 @@ const checkSpec = async (
478
480
  }
479
481
  };
480
482
 
483
+ const readStandardInputLine = () => {
484
+ const bytes: number[] = [];
485
+ const byte = Buffer.alloc(1);
486
+ let isRead = false;
487
+ while (readSync(0, byte) === 1) {
488
+ isRead = true;
489
+ if (byte[0] === 0x0a) break;
490
+ bytes.push(byte[0]);
491
+ }
492
+ return isRead ? Buffer.from(bytes).toString().replace(/\r$/, "") : undefined;
493
+ };
494
+
481
495
  const formatSanyErrors = (error: TlaSyntaxError, specName: string) => {
482
496
  const isFatal = error instanceof TlaSanyFatalError;
483
497
  if (!isFatal && !error.failure)
@@ -99,6 +99,7 @@ interface EnvironmentOptions {
99
99
  isWarningEnabled?: boolean;
100
100
  version?: TlcVersion;
101
101
  moduleOperators?: ModuleOperator[];
102
+ readLine?: () => string | undefined;
102
103
  }
103
104
 
104
105
  export interface ResolvedModuleOperator extends ModuleOperator {
@@ -260,6 +261,7 @@ export const createEnvironment = (
260
261
  runtime.isWarningEnabled = options.isWarningEnabled ?? true;
261
262
  runtime.isTool = options.isTool ?? false;
262
263
  runtime.version = options.version ?? "master";
264
+ runtime.readLine = options.readLine;
263
265
  const linkedModules = new Map<string, LinkedModule>();
264
266
  const checkedModules = new Map<string, LinkedModule>();
265
267
  const linkOrder: LinkedModule[] = [];
@@ -586,8 +588,11 @@ export const createEnvironment = (
586
588
  );
587
589
  };
588
590
 
589
- const createArgumentParams = (arity: number) =>
590
- Array.from({ length: arity }, (_value, index) => ({ name: `argument${index}`, arity: 0 }));
591
+ const createArgumentParams = (arity: number, params: number[] | undefined) =>
592
+ Array.from({ length: arity }, (_value, index) => ({
593
+ name: `argument${index}`,
594
+ arity: params?.[index] ?? 0,
595
+ }));
591
596
 
592
597
  const getSubstitutionBody = (
593
598
  replacement: Expression,
@@ -601,7 +606,7 @@ export const createEnvironment = (
601
606
  body: replacement.body,
602
607
  };
603
608
  }
604
- const params = createArgumentParams(declaration.arity);
609
+ const params = createArgumentParams(declaration.arity, undefined);
605
610
  const operator =
606
611
  replacement.kind === "Identifier"
607
612
  ? replacement.name
@@ -625,7 +630,7 @@ export const createEnvironment = (
625
630
  if (standardSymbols) {
626
631
  if (instance.name === undefined) return [];
627
632
  return [...standardSymbols].map(([name, symbol]) => {
628
- const forwarded = createArgumentParams(symbol.arity);
633
+ const forwarded = createArgumentParams(symbol.arity, symbol.params);
629
634
  return createLocalAlias(
630
635
  `${instance.name}!${name}`,
631
636
  symbol.key,
@@ -712,7 +717,7 @@ export const createEnvironment = (
712
717
  .filter(([name]) => !declared.has(name))
713
718
  .map(([name, symbol]) => {
714
719
  const key = instantiation.getKey(symbol.key);
715
- const ownParams = createArgumentParams(symbol.arity);
720
+ const ownParams = createArgumentParams(symbol.arity, symbol.params);
716
721
  const params = [...instance.params, ...ownParams];
717
722
  return createLocalAlias(
718
723
  instance.name === undefined ? name : `${instance.name}!${name}`,
package/src/exit-codes.ts CHANGED
@@ -81,6 +81,7 @@ export const withLivenessExitCode = (
81
81
  withErrorExitCode(() => checker.addInitialState(index, state, tracing)),
82
82
  addState: (index, state, successors, tracing) =>
83
83
  withErrorExitCode(() => checker.addState(index, state, successors, tracing)),
84
+ storeState: checker.storeState,
84
85
  findViolation: () => withErrorExitCode(() => checker.findViolation()),
85
86
  getViolatedProperties: (path, cycleStart) =>
86
87
  withErrorExitCode(() => checker.getViolatedProperties(path, cycleStart)),
@@ -45,6 +45,7 @@ export interface LivenessChecker {
45
45
  successors: LiveSuccessor[],
46
46
  tracing?: Environment,
47
47
  ) => number[] | undefined;
48
+ storeState: (pending: number, index: number) => void;
48
49
  findViolation: () => Lasso | undefined;
49
50
  getViolatedProperties: (path: Value[][], cycleStart: number) => string[];
50
51
  }
@@ -58,6 +59,7 @@ export interface LiveGraph<State> {
58
59
  state: State,
59
60
  successors: LiveSuccessor<State>[],
60
61
  ) => number[] | undefined;
62
+ storeState: (pending: number, index: number) => void;
61
63
  findViolation: () => Lasso | undefined;
62
64
  }
63
65
 
@@ -366,6 +368,7 @@ export const createLivenessChecker = (
366
368
  traceWith(replay, () => graph.addInitialState(index, state)),
367
369
  addState: (index, state, successors, replay) =>
368
370
  traceWith(replay, () => graph.addState(index, state, successors)),
371
+ storeState: graph.storeState,
369
372
  findViolation: graph.findViolation,
370
373
  getViolatedProperties: (path, cycleStart) => [
371
374
  ...new Set(
@@ -600,8 +603,12 @@ export const createLiveGraph = <State>(
600
603
  const slot = getNodeSlot(behavior.nodeIds, state, tableauNode);
601
604
  return slots[slot] === 0 ? undefined : slots[slot + 2];
602
605
  };
603
- const recordNode = (behavior: BehaviorGraph<State>, state: number, tableauNode: number) => {
604
- const node = pushNode(behavior, state, tableauNode);
606
+ const linkNode = (
607
+ behavior: BehaviorGraph<State>,
608
+ state: number,
609
+ tableauNode: number,
610
+ node: number,
611
+ ) => {
605
612
  const table = behavior.nodeIds;
606
613
  if (++table.size * 2 > table.slots.length / 3) {
607
614
  const old = table.slots;
@@ -617,12 +624,15 @@ export const createLiveGraph = <State>(
617
624
  }
618
625
  }
619
626
  table.slots.set([state + 1, tableauNode, node], getNodeSlot(table, state, tableauNode));
627
+ if (state < 0) return node;
620
628
  const last = behavior.lastNodes.data[state] ?? NO_NODE;
621
629
  if (last === NO_NODE) writeToPool(behavior.firstNodes, state, [node]);
622
630
  else behavior.nextSiblings[last] = node;
623
631
  writeToPool(behavior.lastNodes, state, [node]);
624
632
  return node;
625
633
  };
634
+ const recordNode = (behavior: BehaviorGraph<State>, state: number, tableauNode: number) =>
635
+ linkNode(behavior, state, tableauNode, pushNode(behavior, state, tableauNode));
626
636
  // The action results of the edge to each target are at its position in actions.
627
637
  const writeNode = (
628
638
  behavior: BehaviorGraph<State>,
@@ -753,8 +763,6 @@ export const createLiveGraph = <State>(
753
763
  const isDone = behavior.isDone[successor.index] === true;
754
764
  for (const next of tableauNode.successors) {
755
765
  if (!isConsistent(behavior, next, index, successor.state, successorRow, 0)) continue;
756
- // Deviation from TLC: TLC records the node of a successor the search never stored, which it never expands.
757
- if (successor.index === -1) continue;
758
766
  const existing = getNodeId(behavior, successor.index, next);
759
767
  if (existing !== undefined && successors.includes(existing)) continue;
760
768
  const target = existing ?? recordNode(behavior, successor.index, next);
@@ -1160,6 +1168,21 @@ export const createLiveGraph = <State>(
1160
1168
  }
1161
1169
  return undefined;
1162
1170
  },
1171
+ storeState: (pending, index) => {
1172
+ for (const behavior of behaviors) {
1173
+ const tableau = behavior.solution.tableau;
1174
+ if (!tableau) continue;
1175
+ const nodes: number[] = [];
1176
+ for (let tableauNode = 0; tableauNode < tableau.nodes.length; tableauNode++) {
1177
+ const node = getNodeId(behavior, pending, tableauNode);
1178
+ if (node !== undefined) nodes.push(node);
1179
+ }
1180
+ for (const node of nodes.sort((left, right) => left - right)) {
1181
+ behavior.nodeStates[node] = index;
1182
+ linkNode(behavior, index, behavior.nodeTableaux[node], node);
1183
+ }
1184
+ }
1185
+ },
1163
1186
  findViolation: () => {
1164
1187
  for (const behavior of behaviors) {
1165
1188
  for (const model of behavior.solution.models) {
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Expr.Action.
2
-
3
1
  import { TlapmBugError, TlaProverError } from "../errors";
4
2
  import type { Anonymizer } from "./anonymize";
5
3
  import { bumpBy, normalizeApply, shift, substituteExpr, type Substitution } from "./substitution";
@@ -1,5 +1,3 @@
1
- // A port of tlapm's anonymization (Expr.Anon, Elab.desugar and Proof.Anon).
2
-
3
1
  import { TlapmBugError, TlaProofError } from "../errors";
4
2
  import { consSubstitution, normalizeApply, shift, shiftExpr, substituteExpr } from "./substitution";
5
3
  import { isEqualExpr } from "./equality";
@@ -1,5 +1,3 @@
1
- // A port of tlapm's E_eq.
2
-
3
1
  import type { Bound, Defn, Expr, Field, Hyp, Selector, Sequent } from "./expression";
4
2
 
5
3
  const isEqualList = <Item>(
@@ -1,5 +1,3 @@
1
- // A port of tlapm's expression IR (E_t) and its visitors (Visit).
2
-
3
1
  import type { OldMethod, PragmaSetting } from "./pragma";
4
2
 
5
3
  export interface Locus {
@@ -1,5 +1,3 @@
1
- // A port of OCaml's Format module, which tlapm uses to lay out obligations.
2
-
3
1
  type BoxKind = "h" | "v" | "hv" | "hov" | "b" | "fits";
4
2
 
5
3
  type Token =
@@ -1,5 +1,3 @@
1
- // A port of tlapm's obligation generation (Proof.Gen and Module.Gen).
2
-
3
1
  import { TlapmBugError, TlaProofError } from "../errors";
4
2
  import { isEqualExpr } from "./equality";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Expr.Levels.
2
-
3
1
  import { TlaProofError, TlapmBugError } from "../errors";
4
2
  import {
5
3
  adjoin,
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Module.Standard, Module.Flatten, Module.Dep and Module.Subst.
2
-
3
1
  import { TlaProofError, TlapmBugError } from "../errors";
4
2
  import {
5
3
  at,
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Module.Elab.
2
-
3
1
  import { TlaProofError, TlapmBugError } from "../errors";
4
2
  import { lambdify } from "./action";
5
3
  import type { Anonymizer } from "./anonymize";
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Optable.
2
-
3
1
  import type { Builtin } from "./expression";
4
2
 
5
3
  export type Fixity = "Nonfix" | "Prefix" | "Postfix" | "InfixLeft" | "InfixNon" | "InfixRight";
@@ -1,5 +1,3 @@
1
- // A port of tlapm's obligation printer (E_fmt, Fmtutil and Ctx).
2
-
3
1
  import { TlaProofError } from "../errors";
4
2
  import {
5
3
  getHypName,
@@ -1,5 +1,3 @@
1
- // A port of tlapm's proof IR (P_t).
2
-
3
1
  import type { Bound, Defn, Expr, Locus, Sequent } from "./expression";
4
2
  import type { OldMethod } from "./pragma";
5
3
 
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Pco.resolve.
2
-
3
1
  import type { Expression, SourceLocation } from "../ast";
4
2
  import { lookupOperator, type Operator } from "./operators";
5
3
 
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Proof.Simplify.
2
-
3
1
  import { TlaProofError } from "../errors";
4
2
  import { isEqualExpr } from "./equality";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Expr.Deref.
2
-
3
1
  import { TlaProofError, TlapmBugError } from "../errors";
4
2
  import { consAll, consSubstitution, shift, substituteExpr } from "./substitution";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // A port of tlapm's E_subst.
2
-
3
1
  import { TlaProofError } from "../errors";
4
2
  import {
5
3
  at,
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Expr.Tla_norm, Expr.Constness and Expr.Temporal_props.
2
-
3
1
  import {
4
2
  adjoin,
5
3
  adjoinAll,
@@ -1,5 +1,3 @@
1
- // A port of tlapm's E_tuply_declarations.
2
-
3
1
  import type { Bound, BoundDomain, Defn, Expr } from "./expression";
4
2
 
5
3
  export type TuplyBound =
@@ -1,4 +1,4 @@
1
- // A port of TLC's tlc2.pprint package. TLC prints the original text whenever the parse fails.
1
+ // TLC prints the original text whenever the parse fails.
2
2
 
3
3
  import { skipWhile } from "./lexer";
4
4
 
@@ -1,5 +1,3 @@
1
- // Ported from tlapm's src/backend/isabelle.ml (BSD licensed, see LICENSE-tlapm).
2
-
3
1
  import { TlapmBugError, TlaProverError, TlaUnsupportedError } from "../../errors";
4
2
  import { createContext, getBoundName, popNames, pushName } from "../../obligations/printer";
5
3
  import type { Bound, Builtin, Expr, Sequent } from "../../obligations/expression";
@@ -1,7 +1,3 @@
1
- // Ported from Isabelle2025's Pure/Isar/attrib.ML, Pure/Tools/rule_insts.ML and the rules they use
2
- // from Pure/drule.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet
3
- // Muenchen, and contributors, see LICENSE.
4
-
5
1
  import { TlaIsabelleError } from "../../../errors";
6
2
  import { addUnsafeDest, addUnsafeElim, addUnsafeIntro, withClaset } from "../provers/classical";
7
3
  import { asmRl, compIncr, genAll, multiResolves, zeroVarIndexes } from "../pure/drule";
@@ -1,7 +1,3 @@
1
- // Ported from Isabelle2025's Pure/Isar/proof_context.ML, Pure/variable.ML and Pure/assumption.ML.
2
- // Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and
3
- // contributors, see LICENSE.
4
-
5
1
  import { TlaIsabelleError } from "../../../errors";
6
2
  import { protectD } from "../pure/drule";
7
3
  import { above, betaNorm, emptyEnvir, normTerm, type Envir } from "../pure/envir";
@@ -1,7 +1,3 @@
1
- // Ported from Isabelle2025's Tools/induct.ML: the cases method, as PredicateLogic.thy instantiates
2
- // Induct. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and
3
- // contributors, see LICENSE.
4
-
5
1
  import { TlaIsabelleError } from "../../../errors";
6
2
  import { fconvRule, premsConv } from "../pure/conv";
7
3
  import { asmRl, compIncr, normHhfEq } from "../pure/drule";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/Isar/method.ML and Pure/goal.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../errors";
4
2
  import {
5
3
  absDef,
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/Isar/proof.ML, Pure/goal.ML and Pure/Isar/method.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../errors";
4
2
  import { compIncr, forallIntrVars, protectD, protectI, revcutRl } from "../pure/drule";
5
3
  import { conclude } from "../pure/goal";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/Isar/rule_cases.ML. Copyright (c) 1986-2025 University of
2
- // Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
3
1
  // The cases here are common ones: no rule structure outlines nested cases.
4
2
 
5
3
  import { TlaIsabelleError } from "../../../errors";
@@ -1,7 +1,3 @@
1
- // Runs a theory's commands one after the other, as Isabelle's Pure/Isar/toplevel.ML does, with the
2
- // theory commands of Pure/Isar/specification.ML. Copyright (c) 1986-2025 University of Cambridge,
3
- // Technische Universitaet Muenchen, and contributors, see LICENSE.
4
-
5
1
  import { TlaIsabelleError } from "../../../errors";
6
2
  import { typargsOf } from "../pure/consts";
7
3
  import { zeroVarIndexes } from "../pure/drule";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Pure/type_infer_context.ML, Pure/type_infer.ML and Pure/consts.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../errors";
4
2
  import { bumpString } from "../pure/name";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { isIsabelleError, TlaIsabelleError } from "../../../../errors";
4
2
  import { selectGoal } from "../../pure/goal";
5
3
  import { destImplies, isAllAbs, stripParams } from "../../pure/logic";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { orElseGoal, thenGoal, type GoalTactic } from "../../pure/tactical";
4
2
  import { assumeTac, eqAssumeTac, ematchTac } from "../../pure/tactic";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import type { Seq } from "../../pure/seq";
4
2
  import type { GoalTactic } from "../../pure/tactical";
5
3
  import { checkInterrupt } from "../../pure/interrupt";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../../errors";
4
2
  import { revcutRl, zeroVarIndexes } from "../../pure/drule";
5
3
  import { unifyTermNet } from "../../pure/net";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { bumpInit, bumpString } from "../../pure/name";
4
2
  import type { GoalTactic } from "../../pure/tactical";
5
3
  import type { Limits } from "../../pure/interrupt";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/blast.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { typargs, type TypargPosition } from "../../pure/consts";
4
2
  import {
5
3
  dummyT,
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/clasimp.ML and Pure/tactic.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { trivForallEquality } from "../pure/drule";
4
2
  import { selectGoal } from "../pure/goal";
5
3
  import { addSimps, emptySimpset, type SimpContext } from "../pure/raw-simplifier";
@@ -1,5 +1,3 @@
1
- // Ported from Isabelle2025's Provers/classical.ML. Copyright (c) 1986-2025 University of Cambridge, Technische Universitaet Muenchen, and contributors, see LICENSE.
2
-
3
1
  import { TlaIsabelleError } from "../../../errors";
4
2
  import { revcutRl, thinRl, zeroVarIndexes, makeElim } from "../pure/drule";
5
3
  import { selectGoal } from "../pure/goal";