tla-ts 0.0.9 → 0.0.10-dev.63a6693bd

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 (400) hide show
  1. package/README.md +29 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +29 -29
  5. package/dist/deciders.js +42 -42
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +106 -10
  8. package/dist/index.d.ts +106 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +117 -37
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +129 -104
  21. package/dist/transfer.js +129 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +48 -62
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +599 -754
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +14 -25
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +361 -0
  40. package/src/cli/tlc.ts +309 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +14 -53
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +169 -335
  51. package/src/errors.ts +71 -55
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +37 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +80 -100
  63. package/src/liveness-checker.ts +103 -153
  64. package/src/liveness.ts +150 -109
  65. package/src/obligations/action.ts +8 -39
  66. package/src/obligations/anonymize.ts +88 -82
  67. package/src/obligations/equality.ts +1 -1
  68. package/src/obligations/expression.ts +20 -21
  69. package/src/obligations/format.ts +1 -9
  70. package/src/obligations/generate.ts +46 -49
  71. package/src/obligations/index.ts +2 -13
  72. package/src/obligations/levels.ts +4 -8
  73. package/src/obligations/module.ts +28 -53
  74. package/src/obligations/normalize.ts +7 -25
  75. package/src/obligations/operators.ts +1 -2
  76. package/src/obligations/pragma.ts +1 -10
  77. package/src/obligations/printer.ts +47 -46
  78. package/src/obligations/proof.ts +1 -5
  79. package/src/obligations/regroup.ts +1 -4
  80. package/src/obligations/simplify.ts +42 -58
  81. package/src/obligations/source.ts +48 -78
  82. package/src/obligations/subexpression.ts +5 -11
  83. package/src/obligations/substitution.ts +1 -3
  84. package/src/obligations/temporal.ts +13 -19
  85. package/src/obligations/tuples.ts +3 -9
  86. package/src/parallel-worker.ts +30 -60
  87. package/src/parallel.ts +57 -71
  88. package/src/parser.ts +584 -316
  89. package/src/pcal/ast.ts +53 -86
  90. package/src/pcal/parse.ts +144 -219
  91. package/src/pcal/tokenize.ts +91 -131
  92. package/src/pcal/translate.ts +83 -130
  93. package/src/pcal/validate.ts +48 -68
  94. package/src/pretty-print.ts +7 -8
  95. package/src/prover/decide-pool.ts +8 -13
  96. package/src/prover/deciders.ts +3 -7
  97. package/src/prover/first-order.ts +0 -11
  98. package/src/prover/isabelle/decide.ts +0 -6
  99. package/src/prover/isabelle/encode.ts +11 -23
  100. package/src/prover/isabelle/isar/inner-syntax.ts +114 -115
  101. package/src/prover/isabelle/isar/method.ts +29 -53
  102. package/src/prover/isabelle/isar/proof.ts +1 -10
  103. package/src/prover/isabelle/isar/statement.ts +1 -6
  104. package/src/prover/isabelle/isar/theory.ts +26 -36
  105. package/src/prover/isabelle/isar/type-check.ts +17 -31
  106. package/src/prover/isabelle/provers/blast/blast.ts +17 -104
  107. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  108. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  109. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  110. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  111. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  112. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  113. package/src/prover/isabelle/provers/classical.ts +14 -42
  114. package/src/prover/isabelle/provers/hypsubst.ts +28 -51
  115. package/src/prover/isabelle/pure/bicompose.ts +25 -38
  116. package/src/prover/isabelle/pure/consts.ts +1 -7
  117. package/src/prover/isabelle/pure/conv.ts +3 -17
  118. package/src/prover/isabelle/pure/drule.ts +33 -42
  119. package/src/prover/isabelle/pure/envir.ts +3 -52
  120. package/src/prover/isabelle/pure/goal.ts +1 -7
  121. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  122. package/src/prover/isabelle/pure/list.ts +0 -3
  123. package/src/prover/isabelle/pure/logic.ts +2 -15
  124. package/src/prover/isabelle/pure/name.ts +2 -9
  125. package/src/prover/isabelle/pure/net.ts +3 -59
  126. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  127. package/src/prover/isabelle/pure/pattern.ts +2 -19
  128. package/src/prover/isabelle/pure/raw-simplifier.ts +17 -62
  129. package/src/prover/isabelle/pure/rewriter.ts +31 -67
  130. package/src/prover/isabelle/pure/search.ts +3 -10
  131. package/src/prover/isabelle/pure/seq.ts +1 -10
  132. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  133. package/src/prover/isabelle/pure/table.ts +3 -32
  134. package/src/prover/isabelle/pure/tactic.ts +12 -22
  135. package/src/prover/isabelle/pure/tactical.ts +48 -47
  136. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  137. package/src/prover/isabelle/pure/term.ts +2 -43
  138. package/src/prover/isabelle/pure/thm.ts +27 -47
  139. package/src/prover/isabelle/pure/type.ts +2 -15
  140. package/src/prover/isabelle/pure/unify.ts +20 -30
  141. package/src/prover/isabelle/pure/variable.ts +3 -7
  142. package/src/prover/isabelle/tla/classical-setup.ts +17 -24
  143. package/src/prover/isabelle/tla/context.ts +15 -18
  144. package/src/prover/isabelle/tla/logic.ts +14 -32
  145. package/src/prover/isabelle/tla/simpdata.ts +46 -43
  146. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  147. package/src/prover/ocaml.ts +0 -6
  148. package/src/prover/prep/action.ts +14 -54
  149. package/src/prover/prep/enabled-axioms.ts +12 -19
  150. package/src/prover/prep/fingerprint.ts +2 -21
  151. package/src/prover/prep/level-comparison.ts +8 -12
  152. package/src/prover/prep/md5.ts +0 -2
  153. package/src/prover/prep/methods.ts +33 -39
  154. package/src/prover/prep/normalize.ts +4 -28
  155. package/src/prover/prove-worker.ts +0 -2
  156. package/src/prover/prove.ts +87 -100
  157. package/src/prover/ptl/decide.ts +7 -12
  158. package/src/prover/ptl/encode.ts +14 -36
  159. package/src/prover/ptl/sat.ts +24 -32
  160. package/src/prover/ptl/tableau.ts +12 -26
  161. package/src/prover/smt/axioms.ts +0 -7
  162. package/src/prover/smt/context.ts +20 -28
  163. package/src/prover/smt/data.ts +433 -424
  164. package/src/prover/smt/encode.ts +43 -52
  165. package/src/prover/smt/extensionality.ts +0 -10
  166. package/src/prover/smt/flatten.ts +3 -22
  167. package/src/prover/smt/format.ts +5 -10
  168. package/src/prover/smt/instances.ts +0 -10
  169. package/src/prover/smt/rewrite.ts +663 -667
  170. package/src/prover/smt/solver/act-cache.ts +0 -15
  171. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  172. package/src/prover/smt/solver/array.ts +1 -3
  173. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  174. package/src/prover/smt/solver/ast-lt.ts +1 -11
  175. package/src/prover/smt/solver/ast-util.ts +1 -6
  176. package/src/prover/smt/solver/ast.ts +1 -165
  177. package/src/prover/smt/solver/auf-solver.ts +8 -44
  178. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  179. package/src/prover/smt/solver/cg-table.ts +1 -18
  180. package/src/prover/smt/solver/clause.ts +1 -27
  181. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  182. package/src/prover/smt/solver/context.ts +7 -64
  183. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  184. package/src/prover/smt/solver/der.ts +2 -21
  185. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  186. package/src/prover/smt/solver/e-matching.ts +4 -35
  187. package/src/prover/smt/solver/enode.ts +1 -21
  188. package/src/prover/smt/solver/expr-ref.ts +1 -5
  189. package/src/prover/smt/solver/expr-safe-replace.ts +1 -6
  190. package/src/prover/smt/solver/fingerprints.ts +1 -12
  191. package/src/prover/smt/solver/flat-literals.ts +1 -9
  192. package/src/prover/smt/solver/goal.ts +2 -14
  193. package/src/prover/smt/solver/hash.ts +0 -8
  194. package/src/prover/smt/solver/hashtable.ts +1 -12
  195. package/src/prover/smt/solver/internalizer.ts +7 -100
  196. package/src/prover/smt/solver/lbool.ts +1 -2
  197. package/src/prover/smt/solver/literal.ts +0 -3
  198. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  199. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  200. package/src/prover/smt/solver/lp/containers.ts +12 -30
  201. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  202. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  203. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  204. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  205. package/src/prover/smt/solver/lp/dioph-eq.ts +9 -102
  206. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  207. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  208. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  209. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  210. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  211. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  212. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  213. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  214. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  215. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  216. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  217. package/src/prover/smt/solver/lp/nex.ts +1 -6
  218. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  220. package/src/prover/smt/solver/lp/nla-core.ts +36 -135
  221. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  222. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  223. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  224. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  225. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  226. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  227. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  228. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  229. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  230. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  231. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  232. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  233. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  234. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  235. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  236. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  237. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  238. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  239. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  240. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  241. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  242. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  243. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  244. package/src/prover/smt/solver/mam-compiler.ts +18 -58
  245. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  246. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  247. package/src/prover/smt/solver/model-checker.ts +3 -37
  248. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  249. package/src/prover/smt/solver/model-finder.ts +15 -32
  250. package/src/prover/smt/solver/model-generator.ts +1 -12
  251. package/src/prover/smt/solver/model-macro-solver.ts +23 -88
  252. package/src/prover/smt/solver/nlsat/algebraic.ts +63 -159
  253. package/src/prover/smt/solver/nlsat/atoms.ts +25 -23
  254. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  255. package/src/prover/smt/solver/nlsat/explain.ts +10 -69
  256. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  257. package/src/prover/smt/solver/nlsat/levelwise.ts +49 -135
  258. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  259. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -159
  260. package/src/prover/smt/solver/nlsat/solver.ts +18 -90
  261. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  262. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +2 -45
  263. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  264. package/src/prover/smt/solver/nnf.ts +3 -38
  265. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  266. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  267. package/src/prover/smt/solver/propagate-values.ts +1 -10
  268. package/src/prover/smt/solver/proto-model.ts +3 -52
  269. package/src/prover/smt/solver/pull-quant.ts +1 -12
  270. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  271. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  272. package/src/prover/smt/solver/qe-lite.ts +3 -33
  273. package/src/prover/smt/solver/qi-queue.ts +1 -16
  274. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  275. package/src/prover/smt/solver/quantifier-analyzer.ts +27 -47
  276. package/src/prover/smt/solver/quantifier-manager.ts +2 -13
  277. package/src/prover/smt/solver/random-gen.ts +1 -2
  278. package/src/prover/smt/solver/rational.ts +1 -8
  279. package/src/prover/smt/solver/ref-vector.ts +1 -6
  280. package/src/prover/smt/solver/relevancy.ts +2 -15
  281. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  282. package/src/prover/smt/solver/rewriter.ts +3 -85
  283. package/src/prover/smt/solver/rlimit.ts +2 -20
  284. package/src/prover/smt/solver/smtlib-parser.ts +80 -131
  285. package/src/prover/smt/solver/solver.ts +23 -34
  286. package/src/prover/smt/solver/sort.ts +1 -5
  287. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  288. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  289. package/src/prover/smt/solver/theory-lra-bounds.ts +1 -7
  290. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  291. package/src/prover/smt/solver/theory-lra-internalize.ts +6 -43
  292. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  293. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  294. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  295. package/src/prover/smt/solver/theory-lra.ts +1 -8
  296. package/src/prover/smt/solver/var-subst.ts +2 -26
  297. package/src/prover/smt/table.ts +0 -8
  298. package/src/prover/tlapm/cache.ts +45 -40
  299. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  300. package/src/prover/tlapm/tlapm.ts +21 -20
  301. package/src/prover/verdict.ts +7 -2
  302. package/src/prover/zenon/check/check.ts +1 -11
  303. package/src/prover/zenon/check/definitions.ts +5 -15
  304. package/src/prover/zenon/check/equality.ts +0 -8
  305. package/src/prover/zenon/check/functions.ts +0 -4
  306. package/src/prover/zenon/check/keys.ts +0 -7
  307. package/src/prover/zenon/check/propositional.ts +0 -3
  308. package/src/prover/zenon/check/records.ts +1 -6
  309. package/src/prover/zenon/check/relations.ts +2 -14
  310. package/src/prover/zenon/check/rewrites.ts +2 -21
  311. package/src/prover/zenon/check/sets.ts +40 -61
  312. package/src/prover/zenon/check/terms.ts +1 -19
  313. package/src/prover/zenon/check/tla.ts +0 -6
  314. package/src/prover/zenon/decide.ts +0 -12
  315. package/src/prover/zenon/encode.ts +1 -8
  316. package/src/prover/zenon/eqrel.ts +2 -13
  317. package/src/prover/zenon/equality-rules.ts +0 -4
  318. package/src/prover/zenon/expr.ts +8 -26
  319. package/src/prover/zenon/index-table.ts +26 -57
  320. package/src/prover/zenon/isar-case.ts +9 -19
  321. package/src/prover/zenon/isar.ts +36 -64
  322. package/src/prover/zenon/limits.ts +0 -4
  323. package/src/prover/zenon/llproof.ts +2 -20
  324. package/src/prover/zenon/mltoll.ts +66 -104
  325. package/src/prover/zenon/node.ts +1 -11
  326. package/src/prover/zenon/ocaml.ts +1 -17
  327. package/src/prover/zenon/parse.ts +4 -12
  328. package/src/prover/zenon/phrase.ts +1 -11
  329. package/src/prover/zenon/proof.ts +0 -9
  330. package/src/prover/zenon/propositional-rules.ts +0 -5
  331. package/src/prover/zenon/rules.ts +2 -6
  332. package/src/prover/zenon/search.ts +5 -31
  333. package/src/prover/zenon/tla/functions.ts +59 -31
  334. package/src/prover/zenon/tla/llproof.ts +67 -76
  335. package/src/prover/zenon/tla/records.ts +57 -33
  336. package/src/prover/zenon/tla/rewrites.ts +12 -19
  337. package/src/prover/zenon/tla/sets.ts +83 -53
  338. package/src/prover/zenon/tla/terms.ts +0 -6
  339. package/src/prover/zenon/tla/tla.ts +66 -64
  340. package/src/randomization.ts +81 -35
  341. package/src/resolve.ts +67 -184
  342. package/src/runtime.ts +22 -22
  343. package/src/sany/builtins.ts +2 -5
  344. package/src/sany/generation.ts +394 -0
  345. package/src/sany/generator-def-entries.ts +210 -0
  346. package/src/sany/generator-definitions.ts +686 -0
  347. package/src/sany/generator-expressions.ts +1100 -0
  348. package/src/sany/generator-proofs.ts +662 -0
  349. package/src/sany/generator.ts +191 -2764
  350. package/src/sany/levels.ts +6 -34
  351. package/src/sany/lexer.ts +58 -77
  352. package/src/sany/linter.ts +1 -9
  353. package/src/sany/modules.ts +1 -5
  354. package/src/sany/nodes.ts +5 -43
  355. package/src/sany/parse-error.ts +39 -117
  356. package/src/sany/report.ts +32 -69
  357. package/src/sany/selectors.ts +49 -76
  358. package/src/sany/source.ts +1 -17
  359. package/src/sany/xml.ts +35 -117
  360. package/src/search.ts +541 -163
  361. package/src/simulate.ts +709 -0
  362. package/src/spec-description.ts +192 -100
  363. package/src/standard-definitions.ts +0 -4
  364. package/src/standard-modules.ts +264 -95
  365. package/src/state-graph.ts +52 -31
  366. package/src/subexpressions.ts +69 -52
  367. package/src/substitution-levels.ts +7 -7
  368. package/src/successors.ts +266 -99
  369. package/src/symmetry.ts +33 -25
  370. package/src/tableau.ts +27 -24
  371. package/src/tlc/fingerprint.ts +183 -67
  372. package/src/tlc/jar-data.ts +112 -6
  373. package/src/tlc/messages.ts +125 -54
  374. package/src/tlc/order.ts +39 -69
  375. package/src/tlc/random.ts +37 -49
  376. package/src/tlc/replay.ts +553 -228
  377. package/src/tlc/summary.ts +36 -47
  378. package/src/tlc/tlc-operators.ts +78 -44
  379. package/src/tlc/tlcext-operators.ts +139 -122
  380. package/src/tlc/trace-spec.ts +249 -0
  381. package/src/tlc/value-stream.ts +139 -0
  382. package/src/tlc/version.ts +1 -4
  383. package/src/transfer.ts +22 -25
  384. package/src/typescript/actions.ts +479 -0
  385. package/src/typescript/collections.ts +614 -0
  386. package/src/typescript/compile.ts +63 -0
  387. package/src/typescript/context.ts +94 -0
  388. package/src/typescript/emit.ts +121 -0
  389. package/src/typescript/expressions.ts +496 -0
  390. package/src/typescript/formula.ts +154 -0
  391. package/src/typescript/functions.ts +284 -0
  392. package/src/typescript/model.ts +162 -0
  393. package/src/typescript/names.ts +114 -0
  394. package/src/typescript/program.ts +48 -0
  395. package/src/typescript/properties.ts +139 -0
  396. package/src/typescript/scope.ts +112 -0
  397. package/src/typescript/steps.ts +167 -0
  398. package/src/typescript/types.ts +171 -0
  399. package/src/values.ts +832 -484
  400. package/src/worker.ts +7 -8
package/src/dfid.ts ADDED
@@ -0,0 +1,618 @@
1
+ import type { Expression } from "./ast";
2
+ import type { CheckOptions } from "./check";
3
+ import {
4
+ getErrorExitCode,
5
+ getUnexpectedException,
6
+ isStackOverflow,
7
+ TlaEvaluationError,
8
+ TlaIncompleteSuccessorError,
9
+ TlaStackOverflowError,
10
+ TlaTooManyStatesError,
11
+ TlaUnsupportedError,
12
+ } from "./errors";
13
+ import { createTracingEnvironment } from "./evaluate";
14
+ import { EXIT_STATUS, getMessageExitStatus, withLivenessExitCode } from "./exit-codes";
15
+ import { createLivenessChecker } from "./liveness-checker";
16
+ import { getIncompleteSuccessorMessage, prepareSearch, reportAssumptionViolation } from "./search";
17
+ import type { SpecAction } from "./spec-description";
18
+ import { forEachInitialState, forEachSuccessor } from "./successors";
19
+ import {
20
+ formatNestedMessage,
21
+ formatTlcDate,
22
+ getFailureMessage,
23
+ isEvalException,
24
+ isHeadedError,
25
+ MESSAGE_CODE,
26
+ withUnexpectedException,
27
+ } from "./tlc/messages";
28
+ import { getTlcFingerprint } from "./tlc/fingerprint";
29
+ import { replaySuccessors } from "./tlc/replay";
30
+ import { getOptimisticProbability, getActualProbability } from "./tlc/summary";
31
+ import { createModelValue, formatState, getSetBound, type Value } from "./values";
32
+
33
+ export interface DepthFirstOptions extends CheckOptions {
34
+ maxDepth: number;
35
+ onOutput: (output: DepthFirstOutput) => void;
36
+ }
37
+
38
+ export type DepthFirstOutput =
39
+ | { kind: "message"; code: number; isError: boolean; message: string; toolMessage: string }
40
+ | { kind: "behavior"; states: Record<string, Value>[]; isInvariant: boolean }
41
+ | { kind: "nested-expressions"; callStack: Expression[] }
42
+ | { kind: "success"; optimistic: number; actual: number };
43
+
44
+ interface StateEntry {
45
+ state: Value[];
46
+ fingerprint: bigint;
47
+ }
48
+
49
+ interface CheckerState {
50
+ isDone: boolean;
51
+ errorCode: number;
52
+ continuedCode: number;
53
+ isKeepingCallStack: boolean;
54
+ errorEntry: StateEntry | undefined;
55
+ /** DFIDWorker's stopCode: 0 while it searches, 1 once every initial state is done, 2 after an error. */
56
+ stopCode: "searching" | "done" | "error";
57
+ isMoreLevel: boolean;
58
+ }
59
+
60
+ const DONE = 1;
61
+ const LEVELED = 2;
62
+
63
+ const NO_ERROR = 0;
64
+
65
+ const LONG_MAX = (1n << 63n) - 1n;
66
+
67
+ const INITIAL_BUCKETS = 1n << 16n;
68
+ const MAX_LOAD = 20n;
69
+
70
+ const getFingerprintDistance = (fingerprints: bigint[], buckets: bigint) => {
71
+ const values = fingerprints.map((fingerprint) => {
72
+ const low = BigInt.asIntN(32, fingerprint);
73
+ return low < 0n ? low : BigInt.asIntN(64, fingerprint);
74
+ });
75
+ const sorted = values.toSorted((left, right) => (left < right ? -1 : left > right ? 1 : 0));
76
+ const gaps = sorted
77
+ .slice(1)
78
+ .map((value, index) => value - sorted[index])
79
+ .filter((gap) => gap <= LONG_MAX);
80
+ const ranges = new Map<bigint, { min: bigint; max: bigint }>();
81
+ fingerprints.forEach((fingerprint, index) => {
82
+ const bucket = fingerprint & (buckets - 1n);
83
+ const range = ranges.get(bucket);
84
+ const value = values[index];
85
+ if (!range) {
86
+ ranges.set(bucket, { min: value, max: value });
87
+ return;
88
+ }
89
+ range.min = value < range.min ? value : range.min;
90
+ range.max = value > range.max ? value : range.max;
91
+ });
92
+ const wraps = [...ranges.values()]
93
+ .map((range) => range.max - range.min)
94
+ .filter((difference) => difference > LONG_MAX)
95
+ .map((difference) => (difference === LONG_MAX + 1n ? -difference : (1n << 64n) - difference));
96
+ return [...gaps, ...wraps].reduce((min, gap) => (gap < min ? gap : min), LONG_MAX);
97
+ };
98
+
99
+ const getUnexpectedMessage = (cause: string, error: TlaEvaluationError) => {
100
+ const exception = isEvalException(error)
101
+ ? "tlc2.tool.EvalException"
102
+ : "java.lang.RuntimeException";
103
+ return cause === ""
104
+ ? getUnexpectedException(exception)
105
+ : `TLC threw an unexpected exception.\nThis was probably caused by an error in the spec or model.\nThe error occurred when TLC was ${cause}.\nThe exception was a ${exception}\n: `;
106
+ };
107
+
108
+ // Deviation from TLC: DFIDWorker picks the next initial state and successor with an unseeded generator, so tla-ts picks the first one.
109
+ export const checkDepthFirst = (options: DepthFirstOptions): number => {
110
+ const output = options.onOutput;
111
+ const isTool = options.isTool ?? false;
112
+ const isContinued = options.isContinued ?? false;
113
+ const prepared = prepareSearch(options);
114
+ const config = prepared.config;
115
+ const environment = prepared.environment;
116
+ const runtime = environment.runtime;
117
+ const search = prepared.search;
118
+ if (!search) {
119
+ throw new TlaUnsupportedError("tla-ts can't search a specification without variables");
120
+ }
121
+ const message = (code: number, text: string, toolText = text, isError = true) =>
122
+ output({ kind: "message", code, isError, message: text, toolMessage: toolText });
123
+ const temporalProperties = search.properties.liveness;
124
+ if (temporalProperties.length > 0) {
125
+ options.onProgress?.({
126
+ kind: "liveness-initializing",
127
+ isSymmetric: search.isSymmetric,
128
+ isConstrained: search.isConstrained,
129
+ });
130
+ const branches = withLivenessExitCode(() =>
131
+ withUnexpectedException(() =>
132
+ createLivenessChecker(temporalProperties, search.spec.temporals, environment, {
133
+ getFingerprint: () => 0,
134
+ getSuccessors: () => [],
135
+ }),
136
+ ),
137
+ )?.branches;
138
+ if (branches) options.onProgress?.({ kind: "liveness-prepared", branches });
139
+ }
140
+ if ((options.workers ?? 1) !== 1) {
141
+ message(
142
+ MESSAGE_CODE.general,
143
+ "Depth-First Iterative Deepening mode does not support multiple workers (https://github.com/tlaplus/tlaplus/issues/548). Please run TLC with a single worker.",
144
+ );
145
+ return EXIT_STATUS.error;
146
+ }
147
+ if (temporalProperties.length > 0) {
148
+ message(
149
+ MESSAGE_CODE.general,
150
+ "Depth-First Iterative Deepening mode does not support checking liveness properties (https://github.com/tlaplus/tlaplus/issues/548). Please check liveness properties in Breadth-First-Search mode.",
151
+ );
152
+ return EXIT_STATUS.error;
153
+ }
154
+ runtime.generatedStates = -1;
155
+ runtime.distinctStates = -1;
156
+ runtime.initialStates = -1;
157
+ runtime.queueSize = -1;
158
+ runtime.diameter = -1;
159
+ runtime.isStarted = true;
160
+ const assumptionStatus = reportAssumptionViolation(
161
+ prepared.specification.assumptions,
162
+ environment,
163
+ message,
164
+ );
165
+ if (assumptionStatus !== undefined) return assumptionStatus;
166
+
167
+ const nextActions = prepared.getDescription().actions;
168
+ const statuses = new Map<bigint, number>();
169
+ const fingerprintSet = { level: 1, leveled: 0, buckets: INITIAL_BUCKETS };
170
+ const setStatus = (fingerprint: bigint, status: number) => {
171
+ const old = statuses.get(fingerprint);
172
+ if (old !== undefined) {
173
+ statuses.set(fingerprint, old | status);
174
+ return old;
175
+ }
176
+ if (BigInt(statuses.size) >= fingerprintSet.buckets * MAX_LOAD) fingerprintSet.buckets *= 2n;
177
+ statuses.set(fingerprint, (fingerprintSet.level << 2) | fingerprintSet.leveled | status);
178
+ return 0;
179
+ };
180
+ const getStatus = (fingerprint: bigint) => statuses.get(fingerprint) ?? 0;
181
+ const isCompleted = (status: number) =>
182
+ (status & LEVELED) === fingerprintSet.leveled || (status & DONE) === DONE;
183
+ const isLeafStatus = (status: number) => status === 0 || status >>> 2 === fingerprintSet.level;
184
+
185
+ let generatedCount = 0;
186
+ const checker: CheckerState = {
187
+ isDone: false,
188
+ errorCode: NO_ERROR,
189
+ continuedCode: NO_ERROR,
190
+ isKeepingCallStack: false,
191
+ errorEntry: undefined,
192
+ stopCode: "searching",
193
+ isMoreLevel: false,
194
+ };
195
+ const setErrorState = (entry: StateEntry, isKeepingCallStack: boolean, code: number) => {
196
+ if (!isContinued && checker.isDone) return false;
197
+ checker.errorEntry = entry;
198
+ checker.errorCode = code;
199
+ checker.isDone = true;
200
+ checker.isKeepingCallStack = isKeepingCallStack;
201
+ checker.stopCode = "error";
202
+ return true;
203
+ };
204
+ const toRecord = (state: (Value | undefined)[]) =>
205
+ search.toRecord(state.map((value) => value ?? createModelValue("null")));
206
+ const printSummary = () => {
207
+ const counts = `${generatedCount} states generated, ${statuses.size} distinct states found`;
208
+ if (isTool) {
209
+ message(
210
+ MESSAGE_CODE.depthFirstProgress,
211
+ `Progress: ${counts}.`,
212
+ `Progress(-1) at ${formatTlcDate(new Date())}: ${counts}, -1 states left on queue.`,
213
+ false,
214
+ );
215
+ }
216
+ message(MESSAGE_CODE.depthFirstStats, `${counts}.`, undefined, false);
217
+ };
218
+ const reportSuccess = () =>
219
+ output({
220
+ kind: "success",
221
+ optimistic: getOptimisticProbability(statuses.size, generatedCount),
222
+ actual:
223
+ statuses.size === 0 && generatedCount === 0
224
+ ? 0
225
+ : getActualProbability(
226
+ getFingerprintDistance([...statuses.keys()], fingerprintSet.buckets),
227
+ ),
228
+ });
229
+ const levels = new WeakMap<(Value | undefined)[], number>();
230
+ let currentState: Value[] | undefined;
231
+ runtime.getLevel = (state) => levels.get(state) ?? 0;
232
+ runtime.getCurrentState = () => currentState;
233
+
234
+ const initialEntries: StateEntry[] = [];
235
+ let errorState: Value[] | undefined;
236
+ const computeInitialStates = (): number => {
237
+ const generated: (Value | undefined)[][] = [];
238
+ const addGenerated = (state: (Value | undefined)[]) => {
239
+ generated.push(state);
240
+ return false;
241
+ };
242
+ const init = search.spec.init;
243
+ if (init) forEachInitialState(init, environment, addGenerated, search.spec.scope, addGenerated);
244
+ generatedCount = generated.length;
245
+ for (const state of generated) {
246
+ if (!state.every((value) => value !== undefined)) {
247
+ message(
248
+ MESSAGE_CODE.initialStateIncomplete,
249
+ `State is not completely specified by the initial predicate:\n${formatState(toRecord(state))}`,
250
+ );
251
+ return MESSAGE_CODE.initialStateIncomplete;
252
+ }
253
+ errorState = state;
254
+ levels.set(state, 1);
255
+ const isInModel = search.satisfiesConstraints(state);
256
+ const fingerprint = isInModel ? runtime.getFingerprint(state) : 0n;
257
+ const status = isInModel ? setStatus(fingerprint, 0) : 0;
258
+ if (isInModel && status === 0) initialEntries.push({ state, fingerprint });
259
+ if (status !== 0) continue;
260
+ const alias = () =>
261
+ config.alias === undefined
262
+ ? search.toRecord(state)
263
+ : search.evaluateAlias(config.alias, state, state, isTool);
264
+ const violated = isContinued
265
+ ? search.getViolatedInvariants(state)
266
+ : [search.findViolatedInvariant(state)].filter((invariant) => invariant !== undefined);
267
+ for (const invariant of violated) {
268
+ message(
269
+ MESSAGE_CODE.invariantViolatedInitial,
270
+ `Invariant ${invariant.name} is violated by the initial state:\n${formatState(alias())}`,
271
+ );
272
+ if (!isContinued) return MESSAGE_CODE.invariantViolatedInitial;
273
+ checker.continuedCode = MESSAGE_CODE.invariantViolatedInitial;
274
+ }
275
+ const predicate = search.findFailedInitialPredicate(state);
276
+ if (predicate) {
277
+ message(
278
+ MESSAGE_CODE.propertyViolatedInitial,
279
+ `Property ${predicate.name} is violated by the initial state:\n${formatState(alias())}`,
280
+ );
281
+ return MESSAGE_CODE.propertyViolatedInitial;
282
+ }
283
+ }
284
+ return NO_ERROR;
285
+ };
286
+
287
+ const getActionSuccessors = (action: SpecAction, state: Value[]) => {
288
+ const successors: Value[][] = [];
289
+ try {
290
+ forEachSuccessor(
291
+ action.expression,
292
+ state,
293
+ environment,
294
+ (successor) => {
295
+ if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
296
+ successors.push(successor.state);
297
+ return false;
298
+ },
299
+ action.scope,
300
+ );
301
+ return { successors, incomplete: undefined };
302
+ } catch (error) {
303
+ if (!(error instanceof TlaIncompleteSuccessorError)) throw error;
304
+ return { successors, incomplete: error };
305
+ }
306
+ };
307
+
308
+ const findCheckFailure = (state: Value[], successor: Value[], isNew: boolean) => {
309
+ try {
310
+ const invariant = isNew ? search.findViolatedInvariant(successor, state) : undefined;
311
+ if (invariant) {
312
+ return {
313
+ code: MESSAGE_CODE.invariantViolatedBehavior,
314
+ text: `Invariant ${invariant.name} is violated.`,
315
+ isViolated: true,
316
+ };
317
+ }
318
+ const property = search.findViolatedActionProperty(state, successor);
319
+ return (
320
+ property && {
321
+ code: MESSAGE_CODE.actionPropertyViolatedBehavior,
322
+ text: `Action property ${property.name} is violated.`,
323
+ isViolated: true,
324
+ }
325
+ );
326
+ } catch (error) {
327
+ if (!(error instanceof TlaEvaluationError) || !isHeadedError(error)) throw error;
328
+ return {
329
+ code: getFailureMessage(error, true).code,
330
+ text: error.message.slice(0, error.message.indexOf("\n")),
331
+ isViolated: false,
332
+ };
333
+ }
334
+ };
335
+ const stack: StateEntry[] = [];
336
+ const successorStack: StateEntry[][] = [];
337
+ const printTrace = (
338
+ code: number,
339
+ text: string,
340
+ toolText: string,
341
+ depth: number,
342
+ successor: (Value | undefined)[] | undefined,
343
+ ) => {
344
+ message(code, text, toolText);
345
+ message(MESSAGE_CODE.behaviorUpToThisPoint, "The behavior up to this point is:");
346
+ const states = [
347
+ ...stack.slice(0, depth + 1).map((entry) => entry.state),
348
+ ...(successor ? [successor] : []),
349
+ ];
350
+ output({
351
+ kind: "behavior",
352
+ states: states.map(toRecord),
353
+ isInvariant: code === MESSAGE_CODE.invariantViolatedBehavior,
354
+ });
355
+ };
356
+ const expandState = (depth: number, isLeaf: boolean, successors: StateEntry[]) => {
357
+ const entry = stack[depth];
358
+ const state = entry.state;
359
+ let isDeadlocked = true;
360
+ let isAllDone = true;
361
+ let isNoLeaf = true;
362
+ let processedSuccessor: (Value | undefined)[] | undefined;
363
+ const report = (code: number, text: string, isKeepingCallStack: boolean) => {
364
+ if (setErrorState(entry, isKeepingCallStack, code)) {
365
+ printTrace(code, text, text, depth, processedSuccessor);
366
+ }
367
+ return isNoLeaf;
368
+ };
369
+ currentState = state;
370
+ try {
371
+ for (const action of nextActions) {
372
+ const next = getActionSuccessors(action, state);
373
+ const incomplete = next.incomplete;
374
+ const count = next.successors.length + (incomplete ? 1 : 0);
375
+ generatedCount += count;
376
+ isDeadlocked &&= count === 0;
377
+ for (const successor of next.successors) {
378
+ processedSuccessor = successor;
379
+ levels.set(successor, depth + 2);
380
+ const isInModel =
381
+ search.satisfiesConstraints(successor, state) &&
382
+ search.satisfiesActionConstraints(state, successor);
383
+ const fingerprint = isInModel ? runtime.getFingerprint(successor) : 0n;
384
+ const status = isInModel ? setStatus(fingerprint, 0) : 0;
385
+ if (isInModel) {
386
+ isAllDone &&= (status & DONE) === DONE;
387
+ isNoLeaf &&= !isLeafStatus(status);
388
+ if (!isCompleted(status)) {
389
+ if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
390
+ successors.push({ state: successor, fingerprint });
391
+ }
392
+ }
393
+ const failure = findCheckFailure(state, successor, status === 0);
394
+ if (failure?.isViolated && isContinued) {
395
+ printTrace(failure.code, failure.text, failure.text, depth, successor);
396
+ checker.continuedCode = failure.code;
397
+ continue;
398
+ }
399
+ if (failure) return report(failure.code, failure.text, !failure.isViolated);
400
+ }
401
+ if (incomplete) {
402
+ processedSuccessor = incomplete.state;
403
+ return report(
404
+ MESSAGE_CODE.incompleteSuccessor,
405
+ getIncompleteSuccessorMessage(
406
+ incomplete.variables,
407
+ action.name,
408
+ nextActions.length,
409
+ options.version,
410
+ ),
411
+ false,
412
+ );
413
+ }
414
+ processedSuccessor = undefined;
415
+ }
416
+ if (isDeadlocked && config.checkDeadlock) {
417
+ return report(MESSAGE_CODE.deadlockReached, "Deadlock reached.", false);
418
+ }
419
+ if (isAllDone || (isLeaf && isNoLeaf)) setStatus(entry.fingerprint, DONE);
420
+ return isNoLeaf;
421
+ } catch (error) {
422
+ const failure = isStackOverflow(error) ? new TlaStackOverflowError() : error;
423
+ if (!(failure instanceof TlaEvaluationError)) throw error;
424
+ const isOverflow = failure instanceof TlaStackOverflowError;
425
+ if (
426
+ setErrorState(
427
+ entry,
428
+ !isOverflow,
429
+ isOverflow ? MESSAGE_CODE.stackOverflow : MESSAGE_CODE.general,
430
+ )
431
+ ) {
432
+ const unexpected = getUnexpectedMessage("computing the set of next states", failure);
433
+ printTrace(
434
+ isOverflow ? MESSAGE_CODE.stackOverflow : MESSAGE_CODE.general,
435
+ isOverflow ? failure.message : `${unexpected}${failure.message}`,
436
+ isOverflow
437
+ ? failure.message
438
+ : `${unexpected}${formatNestedMessage(failure.message, true)}`,
439
+ depth,
440
+ processedSuccessor,
441
+ );
442
+ }
443
+ throw failure;
444
+ }
445
+ };
446
+ const hasNext = (successors: StateEntry[], level: number) => {
447
+ while (successors.length > 0) {
448
+ const status = getStatus(successors[0].fingerprint);
449
+ if (!isCompleted(status) && level < status >>> 2) return true;
450
+ successors[0] = successors[successors.length - 1];
451
+ successors.pop();
452
+ }
453
+ return false;
454
+ };
455
+ const searchLevel = (toLevel: number) => {
456
+ const initials = [...initialEntries];
457
+ checker.stopCode = "searching";
458
+ checker.isMoreLevel = false;
459
+ let stackLevel = 0;
460
+ try {
461
+ while (checker.stopCode === "searching") {
462
+ while (initials.length > 0 && isCompleted(getStatus(initials[0].fingerprint))) {
463
+ initials[0] = initials[initials.length - 1];
464
+ initials.pop();
465
+ }
466
+ if (initials.length === 0) {
467
+ checker.stopCode = "done";
468
+ return;
469
+ }
470
+ stack[0] = initials[0];
471
+ successorStack[0] = [];
472
+ stackLevel = 0;
473
+ const isInitialLeaf = toLevel < 2;
474
+ const isInitialNoLeaf = expandState(0, isInitialLeaf, successorStack[0]);
475
+ checker.isMoreLevel ||= !isInitialNoLeaf;
476
+ stackLevel = 1;
477
+ while (!isInitialLeaf) {
478
+ if (!hasNext(successorStack[stackLevel - 1], stackLevel)) {
479
+ const entry = stack[stackLevel - 1];
480
+ statuses.set(
481
+ entry.fingerprint,
482
+ (getStatus(entry.fingerprint) & ~LEVELED) | fingerprintSet.leveled,
483
+ );
484
+ if (stackLevel === 1) break;
485
+ stackLevel--;
486
+ continue;
487
+ }
488
+ stack[stackLevel] = successorStack[stackLevel - 1][0];
489
+ successorStack[stackLevel] = [];
490
+ const isLeaf = stackLevel >= toLevel - 1;
491
+ const isNoLeaf = expandState(stackLevel, isLeaf, successorStack[stackLevel]);
492
+ checker.isMoreLevel ||= !isNoLeaf;
493
+ stackLevel++;
494
+ if (isLeaf) break;
495
+ }
496
+ }
497
+ } catch (error) {
498
+ if (!(error instanceof TlaEvaluationError)) throw error;
499
+ checker.stopCode = "error";
500
+ if (setErrorState(stack[stackLevel], true, MESSAGE_CODE.general)) {
501
+ const unexpected = getUnexpectedMessage("", error);
502
+ message(
503
+ MESSAGE_CODE.general,
504
+ `${unexpected}${error.message}`,
505
+ `${unexpected}${formatNestedMessage(error.message, true)}`,
506
+ );
507
+ }
508
+ }
509
+ };
510
+ const replayExpansion = (entry: StateEntry) => {
511
+ const tracing = createTracingEnvironment(environment);
512
+ try {
513
+ const isPassed = nextActions.every((action) => {
514
+ const successors: Value[][] = [];
515
+ replaySuccessors([action], entry.state, tracing, (successor) => successors.push(successor));
516
+ generatedCount += successors.length;
517
+ return successors.every(
518
+ (successor) =>
519
+ successor.every((value) => value !== undefined) &&
520
+ search.checkReplayedSuccessor(
521
+ entry.state,
522
+ successor,
523
+ tracing,
524
+ () => setStatus(runtime.getFingerprint(successor), 0) === 0,
525
+ ),
526
+ );
527
+ });
528
+ if (isPassed) return;
529
+ } catch (error) {
530
+ if (!(error instanceof TlaEvaluationError) && !isStackOverflow(error)) throw error;
531
+ }
532
+ output({ kind: "nested-expressions", callStack: tracing.callStack?.expressions ?? [] });
533
+ };
534
+
535
+ const finish = (code: number) => {
536
+ printSummary();
537
+ const status = [code, checker.errorCode, checker.continuedCode].find(
538
+ (candidate) => candidate !== NO_ERROR,
539
+ );
540
+ return status === undefined ? EXIT_STATUS.success : getMessageExitStatus(status);
541
+ };
542
+ const tryInitialStates = () => {
543
+ try {
544
+ return { code: computeInitialStates(), error: undefined };
545
+ } catch (error) {
546
+ const failure = isStackOverflow(error) ? new TlaStackOverflowError() : error;
547
+ if (!(failure instanceof TlaEvaluationError)) throw error;
548
+ return { code: NO_ERROR, error: failure };
549
+ }
550
+ };
551
+ const initialFailure = tryInitialStates();
552
+ if (initialFailure.error) {
553
+ const failure = initialFailure.error;
554
+ const inner =
555
+ isHeadedError(failure) && failure.cause instanceof TlaEvaluationError
556
+ ? failure.cause
557
+ : failure;
558
+ const initialState = errorState;
559
+ const prefix = initialState ? "" : getUnexpectedMessage("computing initial states", inner);
560
+ const suffix = initialState
561
+ ? `\nWhile working on the initial state:\n${formatState(toRecord(initialState))}`
562
+ : "";
563
+ message(
564
+ initialState ? MESSAGE_CODE.initialState : MESSAGE_CODE.general,
565
+ `${prefix}${inner.message}${suffix}`,
566
+ `${prefix}${formatNestedMessage(inner.message, true)}${suffix}`,
567
+ );
568
+ generatedCount = 0;
569
+ initialEntries.length = 0;
570
+ const isReplayFailed = tryInitialStates().error !== undefined;
571
+ if (isReplayFailed) {
572
+ message(
573
+ MESSAGE_CODE.nestedExpression,
574
+ `The error occurred when TLC was evaluating the nested\nexpressions at the following positions:\ntlc2.tool.impl.FastTool@${(Number(BigInt.asUintN(28, getTlcFingerprint([options.source]))) | 0x1000_0000).toString(16)}`,
575
+ );
576
+ }
577
+ printSummary();
578
+ return isReplayFailed ? EXIT_STATUS.specEvaluationFailure : getErrorExitCode(inner);
579
+ }
580
+ if (initialFailure.code !== NO_ERROR) return getMessageExitStatus(initialFailure.code);
581
+ message(
582
+ MESSAGE_CODE.depthFirstInitGenerated,
583
+ `Finished computing initial states: ${generatedCount} states generated, with ${initialEntries.length} of them distinct.`,
584
+ undefined,
585
+ false,
586
+ );
587
+ if (nextActions.length === 0) {
588
+ reportSuccess();
589
+ return finish(NO_ERROR);
590
+ }
591
+ let isTerminated = false;
592
+ let levelCode: number = MESSAGE_CODE.general;
593
+ for (let level = 2; level <= options.maxDepth; level++) {
594
+ if (isTerminated) {
595
+ const errorEntry = checker.errorEntry;
596
+ if (!errorEntry && checker.continuedCode === NO_ERROR) {
597
+ levelCode = NO_ERROR;
598
+ reportSuccess();
599
+ }
600
+ if (errorEntry && checker.isKeepingCallStack) replayExpansion(errorEntry);
601
+ break;
602
+ }
603
+ message(
604
+ MESSAGE_CODE.depthFirstLevel,
605
+ `Starting level ${level}: ${generatedCount} states generated, ${statuses.size} distinct states found.`,
606
+ undefined,
607
+ false,
608
+ );
609
+ fingerprintSet.level++;
610
+ fingerprintSet.leveled = LEVELED - fingerprintSet.leveled;
611
+ searchLevel(level);
612
+ checker.isDone = false;
613
+ levelCode = checker.isKeepingCallStack ? NO_ERROR : checker.errorCode;
614
+ if (levelCode !== NO_ERROR) return finish(levelCode);
615
+ isTerminated = checker.stopCode === "error" || !checker.isMoreLevel;
616
+ }
617
+ return finish(levelCode);
618
+ };