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
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/smt/smt_theory.h, src/smt/smt_theory.cpp), MIT license, see z3-license.txt.
2
1
  import { shrink } from "./array";
3
2
  import { type AstManager, OP_ITE } from "./ast";
4
3
  import type { Context } from "./context";
@@ -1,5 +1,3 @@
1
- // Ported from Z3 (src/tactic/core/tseitin_cnf_tactic.cpp, src/ast/shared_occs.cpp), MIT license,
2
- // see z3-license.txt.
3
1
  import { SmtTacticError } from "../../../errors";
4
2
  import {
5
3
  type AstManager,
@@ -1,4 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/var_subst.cpp), MIT license, see z3-license.txt.
2
1
  import { KIND_APP, KIND_QUANTIFIER, KIND_VAR, type AstManager, type SmtSymbol } from "./ast";
3
2
  import { ExprSafeReplace } from "./expr-safe-replace";
4
3
  import { BetaReducer } from "./rewriter-tpl";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's main.ml, as shipped in tlapm. Copyright 1997 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import type { DecideOptions, Decision } from "../verdict";
5
3
  import { checkProof } from "./check/check";
@@ -1,5 +1,3 @@
1
- // A port of tlapm's Backend.Zenon.
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, Hyp, Sequent } from "../../obligations/expression";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's eqrel.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import { TRUE, type Expr, type Expressions } from "./expr";
4
2
 
5
3
  export type Direction = "left" | "right";
@@ -1,11 +1,10 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import {
5
3
  isApp,
6
4
  isNegatedRelation,
7
5
  isRelation,
8
6
  isMeta,
7
+ preunify,
9
8
  type Expr,
10
9
  type NegatedRelationExpr,
11
10
  type NotExpr,
@@ -206,6 +205,29 @@ export const addReflexivity: SearchRule = (context, queue, formula, goalness) =>
206
205
  return [queue, false];
207
206
  };
208
207
 
208
+ export const addPreunification: SearchRule = (context, queue, formula, goalness) => {
209
+ const matches =
210
+ formula.kind === "not" && formula.args[0].kind === "app"
211
+ ? context.index.getPositive(formula.args[0].symbol)
212
+ : formula.kind === "app"
213
+ ? context.index.getNegative(formula.symbol)
214
+ : undefined;
215
+ if (matches === undefined) return [queue, false];
216
+ let current = queue;
217
+ for (let matchIndex = matches.length - 1; matchIndex >= 0; matchIndex--) {
218
+ const pairs = preunify(matches[matchIndex], formula);
219
+ for (let pairIndex = 0; pairIndex < pairs.length; pairIndex++)
220
+ current = makeInstance(
221
+ context.exprs,
222
+ current,
223
+ pairs[pairIndex][0],
224
+ pairs[pairIndex][1],
225
+ Math.min(goalness, context.index.getGoalness(matches[matchIndex])),
226
+ );
227
+ }
228
+ return [current, false];
229
+ };
230
+
209
231
  export const addCongruence: SearchRule = (context, queue, formula, goalness) => {
210
232
  const exprs = context.exprs;
211
233
  if (formula.kind !== "not" || !isApp(formula.args[0], "=", 2)) return [queue, false];
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's expr.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import { combine, createHasher, toInt63, type Int63 } from "./ocaml";
5
3
 
@@ -243,6 +241,27 @@ export const compareExprs = (left: Expr, right: Expr): number => {
243
241
  return 0;
244
242
  };
245
243
 
244
+ const NO_PAIRS: readonly [Expr, Expr][] = [];
245
+
246
+ const xpreunify = (
247
+ accu: readonly [Expr, Expr][],
248
+ left: Expr,
249
+ right: Expr,
250
+ ): readonly [Expr, Expr][] | undefined => {
251
+ if (left === right) return accu;
252
+ if (left.kind === "app" && right.kind === "app" && left.symbol === right.symbol) {
253
+ let current: readonly [Expr, Expr][] | undefined = accu;
254
+ for (let index = 0; index < left.args.length && current !== undefined; index++)
255
+ current = xpreunify(current, left.args[index], right.args[index]);
256
+ return current;
257
+ }
258
+ if (left.kind === "meta") return [[left.args[0], right], ...accu];
259
+ if (right.kind === "meta") return [[right.args[0], left], ...accu];
260
+ return undefined;
261
+ };
262
+
263
+ export const preunify = (left: Expr, right: Expr) => xpreunify(NO_PAIRS, left, right) ?? NO_PAIRS;
264
+
246
265
  type Substitution = [Expr, Expr][];
247
266
 
248
267
  const lookup = (map: Substitution, variable: Expr) => map.find((pair) => pair[0] === variable)?.[1];
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's index.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import {
4
2
  getStringName,
5
3
  isApp,
@@ -282,6 +280,8 @@ export const createIndex = (exprs: Expressions) => {
282
280
  getGoalness,
283
281
  findPositive: (symbol: string) => withGoalness(getLatestFirst(positive, symbol)),
284
282
  findNegative: (symbol: string) => withGoalness(getLatestFirst(negative, symbol)),
283
+ getPositive: (symbol: string) => positive.get(symbol),
284
+ getNegative: (symbol: string) => negative.get(symbol),
285
285
  findEqualRight: (term: Expr) => getLatestFirst(equalLeftRight, term),
286
286
  findEqualLeft: (term: Expr) => getLatestFirst(equalRightLeft, term),
287
287
  findDisequalities: (term: Expr) => [
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's isar_case.ml and enum.ml, as shipped in tlapm. Copyright 2009 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
 
5
3
  interface Lexeme {
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's lltoisar.ml and the -oisar path of main.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import { FALSE, GOAL_NAME, TRUE, type BinderExpr, type Expr, type Expressions } from "./expr";
5
3
  import type { Relations } from "./eqrel";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's llproof.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import { FALSE, TRUE, type Expr, type Expressions } from "./expr";
5
3
 
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's mltoll.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import type { Direction, Origin, RelationProperty, Relations } from "./eqrel";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's node.ml and heap.ml, as shipped in tlapm. Copyright 2001-2004 INRIA, see LICENSE.
2
-
3
1
  import type { Expr } from "./expr";
4
2
  import type { Rule } from "./proof";
5
3
 
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's lexzen.mll and parsezen.mly, as shipped in tlapm. Copyright 2005 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import {
5
3
  FALSE,
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's phrase.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import type { Expr } from "./expr";
4
2
  import type { Definition, Phrase } from "./parse";
5
3
 
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's mlproof.ml, as shipped in tlapm. Copyright 2004 INRIA, see LICENSE.
2
-
3
1
  import type { Expr } from "./expr";
4
2
  import type { Definition } from "./parse";
5
3
 
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import { getStringValue } from "./equality-rules";
4
2
  import { isApp, type Expr, type Expressions } from "./expr";
5
3
  import { insertNode, type Queue } from "./node";
@@ -1,9 +1,8 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import type { Relations } from "./eqrel";
4
2
  import {
5
3
  addCongruence,
6
4
  addMatches,
5
+ addPreunification,
7
6
  addReflexivity,
8
7
  addStringEqualities,
9
8
  addSymmetricMatches,
@@ -59,7 +58,6 @@ const addExtensions: SearchRule = (context, queue, formula, goalness) => {
59
58
  return [insertAll(queue, result.nodes), result.isStopped];
60
59
  };
61
60
 
62
- // Deviation from Zenon: newnodes_preunif is left out because it never adds a node.
63
61
  const RULES: SearchRule[] = [
64
62
  addAbsurd,
65
63
  addClosure,
@@ -72,6 +70,7 @@ const RULES: SearchRule[] = [
72
70
  addGamma,
73
71
  addUnfold,
74
72
  addReflexivity,
73
+ addPreunification,
75
74
  addCongruence,
76
75
  addTransitivity,
77
76
  addSymmetricMatches,
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's prove.ml, as shipped in tlapm. Copyright 2002 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../errors";
4
2
  import { difference, isApp, isDisjoint, isMeta, isRelation, union, type Expr } from "./expr";
5
3
  import { getLimitFailure, type Limits } from "./limits";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { isApp } from "../expr";
4
2
  import type { Priority } from "../node";
5
3
  import { makeRule } from "../proof";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../../errors";
4
2
  import { difference, union, type Expr, type Expressions } from "../expr";
5
3
  import type { Lemma, LlProof, LlRule } from "../llproof";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { compareExprs, getStringName, isApp, type Expr } from "../expr";
4
2
  import { stableSort } from "../ocaml";
5
3
  import { makeRule } from "../proof";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../../errors";
4
2
  import {
5
3
  FALSE,
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { isApp, type Expr } from "../expr";
4
2
  import { makeRule } from "../proof";
5
3
  import {
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import { TlaZenonError } from "../../../errors";
4
2
  import { isApp, isRelation, type Expr, type Expressions, type RelationExpr } from "../expr";
5
3
  import type { Index } from "../index-table";
@@ -1,5 +1,3 @@
1
- // Ported from Zenon's ext_tla.ml, as shipped in tlapm. Copyright 2008 INRIA, see LICENSE.
2
-
3
1
  import {
4
2
  FALSE,
5
3
  isApp,
package/src/resolve.ts CHANGED
@@ -850,7 +850,7 @@ const resolveDefinitions = (
850
850
  range: definition.location.range,
851
851
  parent: current,
852
852
  };
853
- if (isInstantiated(definition)) return local;
853
+ if (isInstantiated(definition)) return { ...local, params: getParamArities(definition) };
854
854
  const isInstanced = instances.some((instance) => instance.location === definition.location);
855
855
  const isGenerated = unit.isGenerated || definition.isLocal || isKey(definition.name);
856
856
  const inner = isInstanced
@@ -899,7 +899,6 @@ const isInstanceArityReported = (
899
899
  return true;
900
900
  };
901
901
 
902
- // Deviation from SANY: an operator whose parameters tla-ts does not know takes any argument.
903
902
  const resolveApply = (
904
903
  expression: Expression & { kind: "Apply" },
905
904
  scope: LocalName | undefined,
package/src/runtime.ts CHANGED
@@ -19,6 +19,7 @@ export interface CheckerRuntime {
19
19
  | undefined;
20
20
  evaluateAtStartup: <Result>(evaluate: () => Result) => Result;
21
21
  pause: (() => void) | undefined;
22
+ readLine: (() => string | undefined) | undefined;
22
23
  warn: (code: number, text: string) => void;
23
24
  isWarningEnabled: boolean;
24
25
  isTool: boolean;
@@ -26,6 +27,7 @@ export interface CheckerRuntime {
26
27
  seed: bigint;
27
28
  isSeen: (state: Value[]) => boolean;
28
29
  getSuccessorAction: (state: Value[], next: Value[]) => SpecAction | undefined;
30
+ toRecord: (state: Value[]) => Record<string, Value>;
29
31
  generatedStates: number;
30
32
  distinctStates: number;
31
33
  initialStates: number;
@@ -54,6 +56,7 @@ export const createRuntime = (checkDeadlock: boolean, seed = 0n): CheckerRuntime
54
56
  deferred: undefined,
55
57
  isSeen: () => false,
56
58
  getSuccessorAction: () => undefined,
59
+ toRecord: () => ({}),
57
60
  setLivenessSource: () => {},
58
61
  getCurrentState: () => undefined,
59
62
  getFingerprint: getTlcFingerprint,
@@ -77,6 +80,7 @@ export const createRuntime = (checkDeadlock: boolean, seed = 0n): CheckerRuntime
77
80
  }
78
81
  },
79
82
  pause: undefined,
83
+ readLine: undefined,
80
84
  warn: () => {},
81
85
  isWarningEnabled: true,
82
86
  isTool: false,
@@ -27,8 +27,6 @@ import {
27
27
  type ThmOrAssumpDefNode,
28
28
  } from "./nodes";
29
29
 
30
- // A port of the levelCheck methods of SANY's semantic nodes.
31
-
32
30
  type AnyDefNode = OpDefNode | ThmOrAssumpDefNode;
33
31
 
34
32
  interface LevelCheck {
@@ -7,8 +7,6 @@ import {
7
7
  type SemanticNode,
8
8
  } from "./nodes";
9
9
 
10
- // A port of SANY's tla2sany.linter.Linter.
11
-
12
10
  const getChildren = (node: SemanticNode): (SemanticNode | undefined)[] => {
13
11
  switch (node.kind) {
14
12
  case "OpAppl":
package/src/search.ts CHANGED
@@ -95,26 +95,33 @@ import {
95
95
  type Value,
96
96
  } from "./values";
97
97
 
98
- interface EnvironmentSettings extends Pick<
99
- CheckOptions,
100
- | "source"
101
- | "loadModule"
102
- | "loadClass"
103
- | "readFile"
104
- | "writeFile"
105
- | "makeDirectory"
106
- | "seed"
107
- | "isTool"
108
- | "traceSpec"
109
- | "isSanyReported"
110
- | "isWarningEnabled"
111
- | "version"
112
- | "moduleOperators"
113
- | "fingerprintPolynomial"
114
- | "maxSetSize"
115
- | "isLazyValueExpanded"
116
- | "isViewPrinted"
117
- > {}
98
+ export interface StandardInput {
99
+ readLine?: () => string | undefined;
100
+ }
101
+
102
+ interface EnvironmentSettings
103
+ extends
104
+ Pick<
105
+ CheckOptions,
106
+ | "source"
107
+ | "loadModule"
108
+ | "loadClass"
109
+ | "readFile"
110
+ | "writeFile"
111
+ | "makeDirectory"
112
+ | "seed"
113
+ | "isTool"
114
+ | "traceSpec"
115
+ | "isSanyReported"
116
+ | "isWarningEnabled"
117
+ | "version"
118
+ | "moduleOperators"
119
+ | "fingerprintPolynomial"
120
+ | "maxSetSize"
121
+ | "isLazyValueExpanded"
122
+ | "isViewPrinted"
123
+ >,
124
+ StandardInput {}
118
125
 
119
126
  interface NamedExpression {
120
127
  name: string;
@@ -875,6 +882,7 @@ export const createCheckEnvironment = (
875
882
  isWarningEnabled: options.isWarningEnabled,
876
883
  version: options.version,
877
884
  moduleOperators: options.moduleOperators,
885
+ readLine: options.readLine,
878
886
  });
879
887
  return { order, specification };
880
888
  };
@@ -1186,6 +1194,7 @@ export const createSearch = (
1186
1194
  ? record
1187
1195
  : setViewText(record, () => getViewText(view.expression, state));
1188
1196
  };
1197
+ runtime.toRecord = toRecord;
1189
1198
  return {
1190
1199
  properties,
1191
1200
  spec,
package/src/simulate.ts CHANGED
@@ -249,6 +249,8 @@ export const simulate = (options: SimulationOptions): number => {
249
249
  const nextActions = description.actions;
250
250
  let traceCount = 0;
251
251
  let currentTrace = 0;
252
+ let evaluatedAction: SpecAction | undefined;
253
+ runtime.getSuccessorAction = () => evaluatedAction;
252
254
  runtime.getLevel = (state) => nodes.get(state)?.level ?? 0;
253
255
  runtime.getBehavior = (state) => {
254
256
  const node = nodes.get(state);
@@ -486,6 +488,7 @@ export const simulate = (options: SimulationOptions): number => {
486
488
  const successors: TraceNode[] = [];
487
489
  let failure: WorkerError | undefined;
488
490
  runtime.deferred = undefined;
491
+ evaluatedAction = action;
489
492
  try {
490
493
  forEachSuccessor(
491
494
  action.expression,
@@ -81,6 +81,10 @@ const SIGNATURES: Signature[] = [
81
81
  ["RandomSubset", 0, [0, 0], [2, 2], [1, 1]],
82
82
  ["RandomSetOfSubsets", 0, [0, 0, 0], [2, 3, 2], [1, 0, 1]],
83
83
  ["TestRandomSetOfSubsets", 0, [0, 0, 0], [2, 3, 2], [1, 0, 1]],
84
+ ["_Track", 0, [0, 0], [3, 2], [0, 0]],
85
+ ["_Counts", 0, [], [], []],
86
+ ["_CheckName", 0, [0], [2], [1]],
87
+ ["_PrintCounts", 0, [], [], []],
84
88
  ];
85
89
 
86
90
  export const STANDARD_LEVELS = new Map(
@@ -1,5 +1,3 @@
1
- // A port of TLC's -dump writers, tlc2.util.StateWriter and tlc2.util.DotStateWriter.
2
-
3
1
  import { getJavaHashCode } from "./java-hash";
4
2
  import type { TlcVersion } from "./tlc/version";
5
3
 
@@ -7,7 +7,13 @@ import {
7
7
  getThunk,
8
8
  getValue,
9
9
  } from "../builtins";
10
- import { formatRange, TlaEndOfInputError, TlaEvaluationError, TlaModuleError } from "../errors";
10
+ import {
11
+ formatRange,
12
+ TlaEndOfInputError,
13
+ TlaEvaluationError,
14
+ TlaModuleError,
15
+ TlaUnsupportedError,
16
+ } from "../errors";
11
17
  import { getTlcFingerprint } from "./fingerprint";
12
18
  import { formatMessage, formatNestedMessage, MESSAGE_CODE, MESSAGE_LEVEL } from "./messages";
13
19
  import {
@@ -31,6 +37,7 @@ import {
31
37
  createRecord,
32
38
  createSet,
33
39
  createTuple,
40
+ formatState,
34
41
  formatValue,
35
42
  getFingerprintError,
36
43
  getSequenceElements,
@@ -270,17 +277,42 @@ export const createTlcExtOperators = (
270
277
  if (isPicked || !context?.next || !context.state || !isCompleteState(context.state)) {
271
278
  return true;
272
279
  }
273
- const action = runtime.getSuccessorAction(context.state, next);
274
- print(
275
- formatMessage(
276
- runtime.isTool,
277
- MESSAGE_CODE.moduleOverrideStdout,
278
- MESSAGE_LEVEL.none,
279
- `Extend behavior of length ${runtime.getLevel(context.state)} with a "${action?.name}" step [<Action ${action?.location.range && formatRange(action.location.range)}>]? (Yes/no/explored/states/diff):`,
280
- ),
281
- );
282
- // Deviation from TLC: PickSuccessor has no standard input to read an answer from.
283
- throw new TlaEndOfInputError();
280
+ const state = context.state;
281
+ const action = runtime.getSuccessorAction(state, next);
282
+ const printOverride = (text: string) =>
283
+ print(
284
+ formatMessage(
285
+ runtime.isTool,
286
+ MESSAGE_CODE.moduleOverrideStdout,
287
+ MESSAGE_LEVEL.none,
288
+ text,
289
+ ),
290
+ );
291
+ while (true) {
292
+ printOverride(
293
+ `Extend behavior of length ${runtime.getLevel(state)} with a "${action?.name}" step [<Action ${action?.location.range && formatRange(action.location.range)}>]? (Yes/no/explored/states/diff):`,
294
+ );
295
+ const answer = runtime.readLine?.();
296
+ // Deviation from TLC: at the end of standard input, TLC's Scanner leaks a NoSuchElementException.
297
+ if (answer === undefined) throw new TlaEndOfInputError();
298
+ if (/^[\0-\x20]*$/.test(answer) || answer.toLowerCase().startsWith("y")) return true;
299
+ if (answer[0] === "s") {
300
+ printOverride(
301
+ `${formatState(runtime.toRecord(state)).trimEnd()}\n~>\n${formatState(runtime.toRecord(next)).trimEnd()}`,
302
+ );
303
+ } else if (answer[0] === "d") {
304
+ printOverride(formatState(runtime.toRecord(next), runtime.toRecord(state)));
305
+ } else if (answer[0] === "e") {
306
+ if (runtime.getSimulationValue === undefined) {
307
+ throw new TlaUnsupportedError(
308
+ "tla-ts can't mark a state explored while it checks a model.",
309
+ );
310
+ }
311
+ printOverride(
312
+ "Marking a state explored is unsupported by the current TLC mode. Is TLC running in simulation mode?",
313
+ );
314
+ } else if (answer[0] === "n") return false;
315
+ }
284
316
  }),
285
317
  isActionLevel: true,
286
318
  },
@@ -180,9 +180,8 @@ ${lassoStep}${variables
180
180
  \\* IN J!JsonSerialize("${input.module}.json", _TETrace)
181
181
 
182
182
  `;
183
- const isViewed =
184
- isLasso && new Set(states.map((state) => JSON.stringify(state))).size < states.length;
185
- const view = isViewed
183
+ // MCError#isLassoWithDuplicates counts the state a lasso goes back to, so TLC views every lasso.
184
+ const view = isLasso
186
185
  ? {
187
186
  config: "\nVIEW\n _view\n",
188
187
  definition: `\n_view ==\n${INDENT}<<${variables.join(", ")}, IF TLCGet("level") = ${LASSO_END} + 1 THEN ${LASSO_START} ELSE TLCGet("level")>>\n`,
@@ -1,10 +0,0 @@
1
- Z3
2
- Copyright (c) Microsoft Corporation
3
- All rights reserved.
4
- MIT License
5
-
6
- Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
7
-
8
- The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
9
-
10
- THE SOFTWARE IS PROVIDED *AS IS*, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
@@ -1,32 +0,0 @@
1
- Copyright (c) 1997-2006, Institut National de Recherche en
2
- Informatique et en Automatique (INRIA)
3
-
4
- All rights reserved.
5
-
6
- Redistribution and use in source and binary forms, with or without
7
- modification, are permitted provided that the following conditions are
8
- met:
9
-
10
- * Redistributions of source code must retain the above copyright notice,
11
- this list of conditions and the following disclaimer.
12
-
13
- * Redistributions in binary form must reproduce the above copyright
14
- notice, this list of conditions and the following disclaimer in the
15
- documentation and/or other materials provided with the
16
- distribution.
17
-
18
- * Neither the name of INRIA nor the names of its contributors may
19
- be used to endorse or promote products derived from this software
20
- without specific prior written permission.
21
-
22
- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
23
- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
24
- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
25
- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
26
- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
27
- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
28
- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
29
- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
30
- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
31
- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
32
- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.