tla-ts 0.0.9-dev.8298a52 → 0.0.10-dev.06b481ee0

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 (631) hide show
  1. package/README.md +8 -0
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +121 -12
  8. package/dist/index.d.ts +121 -12
  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 +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1155 -900
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +318 -656
  41. package/src/cli/typescript.ts +0 -3
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +260 -371
  51. package/src/errors.ts +93 -58
  52. package/src/evaluate.ts +848 -374
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +97 -43
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -325
  64. package/src/liveness.ts +224 -131
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +121 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +34 -57
  88. package/src/parallel.ts +62 -72
  89. package/src/parser.ts +1184 -531
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +34 -77
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +4 -47
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +26 -31
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1021 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +626 -56
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +129 -38
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +296 -105
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +10 -25
  612. package/src/typescript/collections.ts +34 -35
  613. package/src/typescript/compile.ts +1 -8
  614. package/src/typescript/context.ts +0 -12
  615. package/src/typescript/emit.ts +0 -1
  616. package/src/typescript/expressions.ts +0 -12
  617. package/src/typescript/formula.ts +9 -15
  618. package/src/typescript/functions.ts +6 -17
  619. package/src/typescript/model.ts +14 -16
  620. package/src/typescript/names.ts +0 -2
  621. package/src/typescript/program.ts +0 -3
  622. package/src/typescript/properties.ts +6 -8
  623. package/src/typescript/scope.ts +0 -5
  624. package/src/typescript/steps.ts +20 -28
  625. package/src/typescript/types.ts +3 -10
  626. package/src/values.ts +917 -522
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
package/src/dfid.ts ADDED
@@ -0,0 +1,683 @@
1
+ import type { Expression } from "./ast";
2
+ import type { CheckOptions } from "./check";
3
+ import type { CoverageOutput } from "./coverage";
4
+ import {
5
+ getErrorExitCode,
6
+ getUnexpectedException,
7
+ isStackOverflow,
8
+ TlaEvaluationError,
9
+ TlaStackOverflowError,
10
+ TlaTooManyStatesError,
11
+ TlaUnsupportedError,
12
+ } from "./errors";
13
+ import { createTracingEnvironment, type State } from "./evaluate";
14
+ import { EXIT_STATUS, getMessageExitStatus, withLivenessExitCode } from "./exit-codes";
15
+ import { createLivenessChecker } from "./liveness-checker";
16
+ import {
17
+ addActionCoverage,
18
+ getIncompleteSuccessorMessage,
19
+ prepareSearch,
20
+ reportAssumptionViolation,
21
+ } from "./search";
22
+ import { forEachInitialState, forEachSuccessor, getSuccessors, type Successor } from "./successors";
23
+ import {
24
+ formatNestedMessage,
25
+ formatTlcDate,
26
+ getFailureMessage,
27
+ isEvalException,
28
+ isHeadedError,
29
+ MESSAGE_CODE,
30
+ withUnexpectedException,
31
+ } from "./tlc/messages";
32
+ import { getTlcFingerprint } from "./tlc/fingerprint";
33
+ import { createJavaRandom } from "./tlc/random";
34
+ import { replayInitialStates, replaySuccessors, walkSuccessors } from "./tlc/replay";
35
+ import { getOptimisticProbability, getActualProbability } from "./tlc/summary";
36
+ import { createModelValue, formatState, getSetBound, isSameValue, type Value } from "./values";
37
+
38
+ export interface DepthFirstOptions extends CheckOptions {
39
+ maxDepth: number;
40
+ onOutput: (output: DepthFirstOutput) => void;
41
+ }
42
+
43
+ export type DepthFirstOutput =
44
+ | { kind: "message"; code: number; isError: boolean; message: string; toolMessage: string }
45
+ | { kind: "behavior"; states: Record<string, Value>[]; isInvariant: boolean }
46
+ | { kind: "nested-expressions"; callStack: Expression[] }
47
+ | CoverageOutput
48
+ | { kind: "success"; optimistic: number; actual: number };
49
+
50
+ interface StateEntry {
51
+ state: Value[];
52
+ fingerprint: bigint;
53
+ }
54
+
55
+ interface CheckerState {
56
+ isDone: boolean;
57
+ errorCode: number;
58
+ continuedCode: number;
59
+ isKeepingCallStack: boolean;
60
+ errorEntry: StateEntry | undefined;
61
+ /** DFIDWorker's stopCode: 0 while it searches, 1 once every initial state is done, 2 after an error. */
62
+ stopCode: "searching" | "done" | "error";
63
+ isMoreLevel: boolean;
64
+ }
65
+
66
+ const DONE = 1;
67
+ const LEVELED = 2;
68
+
69
+ const NO_ERROR = 0;
70
+
71
+ const LONG_MAX = (1n << 63n) - 1n;
72
+
73
+ const INITIAL_BUCKETS = 1n << 16n;
74
+ const MAX_LOAD = 20n;
75
+
76
+ const getFingerprintDistance = (fingerprints: bigint[], buckets: bigint) => {
77
+ const values = fingerprints.map((fingerprint) => {
78
+ const low = BigInt.asIntN(32, fingerprint);
79
+ return low < 0n ? low : BigInt.asIntN(64, fingerprint);
80
+ });
81
+ const sorted = values.toSorted((left, right) => (left < right ? -1 : left > right ? 1 : 0));
82
+ const gaps = sorted
83
+ .slice(1)
84
+ .map((value, index) => value - sorted[index])
85
+ .filter((gap) => gap <= LONG_MAX);
86
+ const ranges = new Map<bigint, { min: bigint; max: bigint }>();
87
+ fingerprints.forEach((fingerprint, index) => {
88
+ const bucket = fingerprint & (buckets - 1n);
89
+ const range = ranges.get(bucket);
90
+ const value = values[index];
91
+ if (!range) {
92
+ ranges.set(bucket, { min: value, max: value });
93
+ return;
94
+ }
95
+ range.min = value < range.min ? value : range.min;
96
+ range.max = value > range.max ? value : range.max;
97
+ });
98
+ const wraps = [...ranges.values()]
99
+ .map((range) => range.max - range.min)
100
+ .filter((difference) => difference > LONG_MAX)
101
+ .map((difference) => (difference === LONG_MAX + 1n ? -difference : (1n << 64n) - difference));
102
+ return [...gaps, ...wraps].reduce((min, gap) => (gap < min ? gap : min), LONG_MAX);
103
+ };
104
+
105
+ const getUnexpectedMessage = (cause: string, error: TlaEvaluationError) => {
106
+ const exception = isEvalException(error)
107
+ ? "tlc2.tool.EvalException"
108
+ : "java.lang.RuntimeException";
109
+ return cause === ""
110
+ ? getUnexpectedException(exception)
111
+ : `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: `;
112
+ };
113
+
114
+ // Deviation from TLC: DFIDWorker picks the next initial state and successor with an unseeded generator, so tla-ts picks the first one.
115
+ export const checkDepthFirst = (options: DepthFirstOptions): number => {
116
+ const output = options.onOutput;
117
+ const isTool = options.isTool ?? false;
118
+ const isContinued = options.isContinued ?? false;
119
+ const prepared = prepareSearch(options);
120
+ const config = prepared.config;
121
+ const environment = prepared.environment;
122
+ const runtime = environment.runtime;
123
+ const search = prepared.search;
124
+ if (!search) {
125
+ throw new TlaUnsupportedError("tla-ts can't search a specification without variables");
126
+ }
127
+ const message = (code: number, text: string, toolText = text, isError = true) =>
128
+ output({ kind: "message", code, isError, message: text, toolMessage: toolText });
129
+ const temporalProperties = search.properties.liveness;
130
+ if (temporalProperties.length > 0) {
131
+ options.onProgress?.({
132
+ kind: "liveness-initializing",
133
+ isSymmetric: search.isSymmetric,
134
+ isConstrained: search.isConstrained,
135
+ });
136
+ const branches = withLivenessExitCode(() =>
137
+ withUnexpectedException(() =>
138
+ createLivenessChecker(temporalProperties, search.spec.temporals, environment, {
139
+ getFingerprint: () => 0,
140
+ forEachActionSuccessors: () => {},
141
+ }),
142
+ ),
143
+ )?.branches;
144
+ if (branches) options.onProgress?.({ kind: "liveness-prepared", branches });
145
+ }
146
+ if ((options.workers ?? 1) !== 1) {
147
+ message(
148
+ MESSAGE_CODE.general,
149
+ "Depth-First Iterative Deepening mode does not support multiple workers (https://github.com/tlaplus/tlaplus/issues/548). Please run TLC with a single worker.",
150
+ );
151
+ return EXIT_STATUS.error;
152
+ }
153
+ if (temporalProperties.length > 0) {
154
+ message(
155
+ MESSAGE_CODE.general,
156
+ "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.",
157
+ );
158
+ return EXIT_STATUS.error;
159
+ }
160
+ runtime.generatedStates = -1;
161
+ runtime.distinctStates = -1;
162
+ runtime.initialStates = -1;
163
+ runtime.queueSize = -1;
164
+ runtime.diameter = -1;
165
+ runtime.isStarted = true;
166
+ const assumptionStatus = reportAssumptionViolation(
167
+ prepared.specification.assumptions,
168
+ environment,
169
+ message,
170
+ );
171
+ if (assumptionStatus !== undefined) return assumptionStatus;
172
+
173
+ const description = prepared.getDescription();
174
+ const nextActions = description.actions;
175
+ const coverage = prepared.coverage;
176
+ const covered = coverage && addActionCoverage(coverage, environment, description);
177
+ // Deviation from TLC: TLCExt#pickSuccessor casts the DFID checker to ModelChecker and fails, so tla-ts asks as model checking does.
178
+ runtime.getSuccessorAction = (state, next) =>
179
+ nextActions.find((action) =>
180
+ getSuccessors(action.expression, state, environment, action.scope).some((successor) =>
181
+ successor.state.every((value, index) => isSameValue(value, next[index])),
182
+ ),
183
+ );
184
+ const statuses = new Map<bigint, number>();
185
+ const fingerprintSet = { level: 1, leveled: 0, buckets: INITIAL_BUCKETS };
186
+ const setStatus = (fingerprint: bigint, status: number) => {
187
+ const old = statuses.get(fingerprint);
188
+ if (old !== undefined) {
189
+ statuses.set(fingerprint, old | status);
190
+ return old;
191
+ }
192
+ if (BigInt(statuses.size) >= fingerprintSet.buckets * MAX_LOAD) fingerprintSet.buckets *= 2n;
193
+ statuses.set(fingerprint, (fingerprintSet.level << 2) | fingerprintSet.leveled | status);
194
+ return 0;
195
+ };
196
+ const getStatus = (fingerprint: bigint) => statuses.get(fingerprint) ?? 0;
197
+ const isCompleted = (status: number) =>
198
+ (status & LEVELED) === fingerprintSet.leveled || (status & DONE) === DONE;
199
+ const isLeafStatus = (status: number) => status === 0 || status >>> 2 === fingerprintSet.level;
200
+
201
+ let generatedCount = 0;
202
+ const checker: CheckerState = {
203
+ isDone: false,
204
+ errorCode: NO_ERROR,
205
+ continuedCode: NO_ERROR,
206
+ isKeepingCallStack: false,
207
+ errorEntry: undefined,
208
+ stopCode: "searching",
209
+ isMoreLevel: false,
210
+ };
211
+ const setErrorState = (entry: StateEntry, isKeepingCallStack: boolean, code: number) => {
212
+ if (!isContinued && checker.isDone) return false;
213
+ checker.errorEntry = entry;
214
+ checker.errorCode = code;
215
+ checker.isDone = true;
216
+ checker.isKeepingCallStack = isKeepingCallStack;
217
+ checker.stopCode = "error";
218
+ return true;
219
+ };
220
+ const toRecord = (state: (Value | undefined)[]) =>
221
+ search.toRecord(state.map((value) => value ?? createModelValue("null")));
222
+ const printSummary = () => {
223
+ const report = nextActions.length > 0 ? prepared.getCoverage() : undefined;
224
+ if (report) output({ kind: "coverage", coverage: report });
225
+ const counts = `${generatedCount} states generated, ${statuses.size} distinct states found`;
226
+ if (isTool) {
227
+ message(
228
+ MESSAGE_CODE.depthFirstProgress,
229
+ `Progress: ${counts}.`,
230
+ `Progress(-1) at ${formatTlcDate(new Date())}: ${counts}, -1 states left on queue.`,
231
+ false,
232
+ );
233
+ }
234
+ message(MESSAGE_CODE.depthFirstStats, `${counts}.`, undefined, false);
235
+ };
236
+ const reportSuccess = () =>
237
+ output({
238
+ kind: "success",
239
+ optimistic: getOptimisticProbability(statuses.size, generatedCount),
240
+ actual:
241
+ statuses.size === 0 && generatedCount === 0
242
+ ? 0
243
+ : getActualProbability(
244
+ getFingerprintDistance([...statuses.keys()], fingerprintSet.buckets),
245
+ ),
246
+ });
247
+ const levels = new WeakMap<(Value | undefined)[], number>();
248
+ let currentState: Value[] | undefined;
249
+ runtime.getLevel = (state) => levels.get(state) ?? 0;
250
+ runtime.getCurrentState = () => currentState;
251
+
252
+ const initialEntries: StateEntry[] = [];
253
+ let errorState: Value[] | undefined;
254
+ const computeInitialStates = (): number => {
255
+ const generated: (Value | undefined)[][] = [];
256
+ const addGenerated = (state: (Value | undefined)[]) => {
257
+ generated.push(state);
258
+ return false;
259
+ };
260
+ const init = search.spec.init;
261
+ if (covered) {
262
+ replayInitialStates(covered.inits, environment, addGenerated, (partial) =>
263
+ addGenerated([...partial]),
264
+ );
265
+ } else if (init) {
266
+ forEachInitialState(init, environment, addGenerated, search.spec.scope, addGenerated);
267
+ }
268
+ generatedCount = generated.length;
269
+ for (const state of generated) {
270
+ if (!state.every((value) => value !== undefined)) {
271
+ message(
272
+ MESSAGE_CODE.initialStateIncomplete,
273
+ `State is not completely specified by the initial predicate:\n${formatState(toRecord(state))}`,
274
+ );
275
+ return MESSAGE_CODE.initialStateIncomplete;
276
+ }
277
+ errorState = state;
278
+ levels.set(state, 1);
279
+ const isInModel = search.satisfiesConstraints(state);
280
+ const fingerprint = isInModel ? runtime.getFingerprint(state) : 0n;
281
+ const status = isInModel ? setStatus(fingerprint, 0) : 0;
282
+ if (isInModel && status === 0) initialEntries.push({ state, fingerprint });
283
+ if (status !== 0) continue;
284
+ const alias = () =>
285
+ config.alias === undefined
286
+ ? search.toRecord(state)
287
+ : search.evaluateAlias(config.alias, state, state, isTool);
288
+ const reportInvariant = (name: string) =>
289
+ message(
290
+ MESSAGE_CODE.invariantViolatedInitial,
291
+ `Invariant ${name} is violated by the initial state:\n${formatState(alias())}`,
292
+ );
293
+ if (isContinued) {
294
+ search.forEachViolatedInvariant(state, (invariant) => {
295
+ reportInvariant(invariant.name);
296
+ checker.continuedCode = MESSAGE_CODE.invariantViolatedInitial;
297
+ });
298
+ }
299
+ const violated = isContinued ? undefined : search.findViolatedInvariant(state);
300
+ if (violated) {
301
+ reportInvariant(violated.name);
302
+ return MESSAGE_CODE.invariantViolatedInitial;
303
+ }
304
+ const predicate = search.findFailedInitialPredicate(state);
305
+ if (predicate) {
306
+ message(
307
+ MESSAGE_CODE.propertyViolatedInitial,
308
+ `Property ${predicate.name} is violated by the initial state:\n${formatState(alias())}`,
309
+ );
310
+ return MESSAGE_CODE.propertyViolatedInitial;
311
+ }
312
+ }
313
+ return NO_ERROR;
314
+ };
315
+
316
+ let actionSuccessors: Value[][] = [];
317
+ let incompleteSuccessor: State | undefined;
318
+ let actionSuccessorCount = 0;
319
+ const addActionSuccessor = (successor: Value[]) => {
320
+ actionSuccessorCount++;
321
+ if (incompleteSuccessor) return false;
322
+ if (actionSuccessors.length === getSetBound()) throw new TlaTooManyStatesError();
323
+ actionSuccessors.push(successor);
324
+ return false;
325
+ };
326
+ const visitActionSuccessor = (successor: Successor) => addActionSuccessor(successor.state);
327
+ const addIncompleteSuccessor = (partial: State) => {
328
+ actionSuccessorCount++;
329
+ incompleteSuccessor ??= [...partial];
330
+ return true;
331
+ };
332
+ // TLC's Tool#getNextStates generates every successor of the action before DFIDWorker finds an incomplete one.
333
+ const getActionSuccessors = (index: number, state: Value[]) => {
334
+ const action = nextActions[index];
335
+ const coveredAction = covered?.actions[index];
336
+ actionSuccessors = [];
337
+ incompleteSuccessor = undefined;
338
+ actionSuccessorCount = 0;
339
+ if (coverage && coveredAction) {
340
+ walkSuccessors(
341
+ coveredAction,
342
+ coveredAction.node,
343
+ state,
344
+ environment,
345
+ addActionSuccessor,
346
+ addIncompleteSuccessor,
347
+ );
348
+ coverage.primary[coveredAction.node] += actionSuccessorCount;
349
+ } else {
350
+ forEachSuccessor(
351
+ action.expression,
352
+ state,
353
+ environment,
354
+ visitActionSuccessor,
355
+ action.scope,
356
+ undefined,
357
+ undefined,
358
+ addIncompleteSuccessor,
359
+ );
360
+ }
361
+ return {
362
+ successors: actionSuccessors,
363
+ incomplete: incompleteSuccessor,
364
+ count: actionSuccessorCount,
365
+ };
366
+ };
367
+
368
+ const findCheckFailure = (state: Value[], successor: Value[], isNew: boolean) => {
369
+ try {
370
+ const invariant = isNew ? search.findViolatedInvariant(successor, state) : undefined;
371
+ if (invariant) {
372
+ return {
373
+ code: MESSAGE_CODE.invariantViolatedBehavior,
374
+ text: `Invariant ${invariant.name} is violated.`,
375
+ isViolated: true,
376
+ };
377
+ }
378
+ const property = search.findViolatedActionProperty(state, successor);
379
+ return (
380
+ property && {
381
+ code: MESSAGE_CODE.actionPropertyViolatedBehavior,
382
+ text: `Action property ${property.name} is violated.`,
383
+ isViolated: true,
384
+ }
385
+ );
386
+ } catch (error) {
387
+ if (!(error instanceof TlaEvaluationError) || !isHeadedError(error)) throw error;
388
+ return {
389
+ code: getFailureMessage(error, true).code,
390
+ text: error.message.slice(0, error.message.indexOf("\n")),
391
+ isViolated: false,
392
+ };
393
+ }
394
+ };
395
+ const stack: StateEntry[] = [];
396
+ const successorStack: StateEntry[][] = [];
397
+ const printTrace = (
398
+ code: number,
399
+ text: string,
400
+ toolText: string,
401
+ depth: number,
402
+ successor: (Value | undefined)[] | undefined,
403
+ ) => {
404
+ message(code, text, toolText);
405
+ message(MESSAGE_CODE.behaviorUpToThisPoint, "The behavior up to this point is:");
406
+ const states = [
407
+ ...stack.slice(0, depth + 1).map((entry) => entry.state),
408
+ ...(successor ? [successor] : []),
409
+ ];
410
+ output({
411
+ kind: "behavior",
412
+ states: states.map(toRecord),
413
+ isInvariant: code === MESSAGE_CODE.invariantViolatedBehavior,
414
+ });
415
+ };
416
+ const expandState = (depth: number, isLeaf: boolean, successors: StateEntry[]) => {
417
+ const entry = stack[depth];
418
+ const state = entry.state;
419
+ let isDeadlocked = true;
420
+ let isAllDone = true;
421
+ let isNoLeaf = true;
422
+ let processedSuccessor: (Value | undefined)[] | undefined;
423
+ const report = (code: number, text: string, isKeepingCallStack: boolean) => {
424
+ if (setErrorState(entry, isKeepingCallStack, code)) {
425
+ printTrace(code, text, text, depth, processedSuccessor);
426
+ }
427
+ return isNoLeaf;
428
+ };
429
+ currentState = state;
430
+ try {
431
+ for (let index = 0; index < nextActions.length; index++) {
432
+ const action = nextActions[index];
433
+ const next = getActionSuccessors(index, state);
434
+ const incomplete = next.incomplete;
435
+ generatedCount += next.count;
436
+ isDeadlocked &&= next.count === 0;
437
+ for (const successor of next.successors) {
438
+ processedSuccessor = successor;
439
+ levels.set(successor, depth + 2);
440
+ const isInModel =
441
+ search.satisfiesConstraints(successor, state) &&
442
+ search.satisfiesActionConstraints(state, successor);
443
+ const fingerprint = isInModel ? runtime.getFingerprint(successor) : 0n;
444
+ const status = isInModel ? setStatus(fingerprint, 0) : 0;
445
+ if (isInModel) {
446
+ isAllDone &&= (status & DONE) === DONE;
447
+ isNoLeaf &&= !isLeafStatus(status);
448
+ if (!isCompleted(status)) {
449
+ if (successors.length === getSetBound()) throw new TlaTooManyStatesError();
450
+ successors.push({ state: successor, fingerprint });
451
+ }
452
+ }
453
+ const failure = findCheckFailure(state, successor, status === 0);
454
+ if (failure?.isViolated && isContinued) {
455
+ printTrace(failure.code, failure.text, failure.text, depth, successor);
456
+ checker.continuedCode = failure.code;
457
+ continue;
458
+ }
459
+ if (failure) return report(failure.code, failure.text, !failure.isViolated);
460
+ }
461
+ if (incomplete) {
462
+ processedSuccessor = incomplete;
463
+ return report(
464
+ MESSAGE_CODE.incompleteSuccessor,
465
+ getIncompleteSuccessorMessage(
466
+ environment.variables.filter(
467
+ (_variable, position) => incomplete[position] === undefined,
468
+ ),
469
+ action.name,
470
+ nextActions.length,
471
+ options.version,
472
+ ),
473
+ false,
474
+ );
475
+ }
476
+ processedSuccessor = undefined;
477
+ }
478
+ if (isDeadlocked && config.checkDeadlock) {
479
+ return report(MESSAGE_CODE.deadlockReached, "Deadlock reached.", false);
480
+ }
481
+ if (isAllDone || (isLeaf && isNoLeaf)) setStatus(entry.fingerprint, DONE);
482
+ return isNoLeaf;
483
+ } catch (error) {
484
+ const failure = isStackOverflow(error) ? new TlaStackOverflowError() : error;
485
+ if (!(failure instanceof TlaEvaluationError)) throw error;
486
+ const isOverflow = failure instanceof TlaStackOverflowError;
487
+ if (
488
+ setErrorState(
489
+ entry,
490
+ !isOverflow,
491
+ isOverflow ? MESSAGE_CODE.stackOverflow : MESSAGE_CODE.general,
492
+ )
493
+ ) {
494
+ const unexpected = getUnexpectedMessage("computing the set of next states", failure);
495
+ printTrace(
496
+ isOverflow ? MESSAGE_CODE.stackOverflow : MESSAGE_CODE.general,
497
+ isOverflow ? failure.message : `${unexpected}${failure.message}`,
498
+ isOverflow
499
+ ? failure.message
500
+ : `${unexpected}${formatNestedMessage(failure.message, true)}`,
501
+ depth,
502
+ processedSuccessor,
503
+ );
504
+ }
505
+ throw failure;
506
+ }
507
+ };
508
+ const hasNext = (successors: StateEntry[], level: number) => {
509
+ while (successors.length > 0) {
510
+ const status = getStatus(successors[0].fingerprint);
511
+ if (!isCompleted(status) && level < status >>> 2) return true;
512
+ successors[0] = successors[successors.length - 1];
513
+ successors.pop();
514
+ }
515
+ return false;
516
+ };
517
+ const searchLevel = (toLevel: number) => {
518
+ const initials = [...initialEntries];
519
+ checker.stopCode = "searching";
520
+ checker.isMoreLevel = false;
521
+ let stackLevel = 0;
522
+ try {
523
+ while (checker.stopCode === "searching") {
524
+ while (initials.length > 0 && isCompleted(getStatus(initials[0].fingerprint))) {
525
+ initials[0] = initials[initials.length - 1];
526
+ initials.pop();
527
+ }
528
+ if (initials.length === 0) {
529
+ checker.stopCode = "done";
530
+ return;
531
+ }
532
+ stack[0] = initials[0];
533
+ successorStack[0] = [];
534
+ stackLevel = 0;
535
+ const isInitialLeaf = toLevel < 2;
536
+ const isInitialNoLeaf = expandState(0, isInitialLeaf, successorStack[0]);
537
+ checker.isMoreLevel ||= !isInitialNoLeaf;
538
+ stackLevel = 1;
539
+ while (!isInitialLeaf) {
540
+ if (!hasNext(successorStack[stackLevel - 1], stackLevel)) {
541
+ const entry = stack[stackLevel - 1];
542
+ statuses.set(
543
+ entry.fingerprint,
544
+ (getStatus(entry.fingerprint) & ~LEVELED) | fingerprintSet.leveled,
545
+ );
546
+ if (stackLevel === 1) break;
547
+ stackLevel--;
548
+ continue;
549
+ }
550
+ stack[stackLevel] = successorStack[stackLevel - 1][0];
551
+ successorStack[stackLevel] = [];
552
+ const isLeaf = stackLevel >= toLevel - 1;
553
+ const isNoLeaf = expandState(stackLevel, isLeaf, successorStack[stackLevel]);
554
+ checker.isMoreLevel ||= !isNoLeaf;
555
+ stackLevel++;
556
+ if (isLeaf) break;
557
+ }
558
+ }
559
+ } catch (error) {
560
+ if (!(error instanceof TlaEvaluationError)) throw error;
561
+ checker.stopCode = "error";
562
+ if (setErrorState(stack[stackLevel], true, MESSAGE_CODE.general)) {
563
+ const unexpected = getUnexpectedMessage("", error);
564
+ message(
565
+ MESSAGE_CODE.general,
566
+ `${unexpected}${error.message}`,
567
+ `${unexpected}${formatNestedMessage(error.message, true)}`,
568
+ );
569
+ }
570
+ }
571
+ };
572
+ const replayExpansion = (entry: StateEntry) => {
573
+ const tracing = createTracingEnvironment(environment);
574
+ try {
575
+ const isPassed = nextActions.every((action) => {
576
+ const successors: Value[][] = [];
577
+ replaySuccessors([action], entry.state, tracing, (successor) => successors.push(successor));
578
+ generatedCount += successors.length;
579
+ return successors.every(
580
+ (successor) =>
581
+ successor.every((value) => value !== undefined) &&
582
+ search.checkReplayedSuccessor(
583
+ entry.state,
584
+ successor,
585
+ tracing,
586
+ () => setStatus(runtime.getFingerprint(successor), 0) === 0,
587
+ ),
588
+ );
589
+ });
590
+ if (isPassed) return;
591
+ } catch (error) {
592
+ if (!(error instanceof TlaEvaluationError) && !isStackOverflow(error)) throw error;
593
+ }
594
+ output({ kind: "nested-expressions", callStack: tracing.callStack?.expressions ?? [] });
595
+ };
596
+
597
+ const finish = (code: number) => {
598
+ printSummary();
599
+ const status = [code, checker.errorCode, checker.continuedCode].find(
600
+ (candidate) => candidate !== NO_ERROR,
601
+ );
602
+ return status === undefined ? EXIT_STATUS.success : getMessageExitStatus(status);
603
+ };
604
+ const tryInitialStates = () => {
605
+ try {
606
+ return { code: computeInitialStates(), error: undefined };
607
+ } catch (error) {
608
+ const failure = isStackOverflow(error) ? new TlaStackOverflowError() : error;
609
+ if (!(failure instanceof TlaEvaluationError)) throw error;
610
+ return { code: NO_ERROR, error: failure };
611
+ }
612
+ };
613
+ const initialFailure = tryInitialStates();
614
+ if (initialFailure.error) {
615
+ const failure = initialFailure.error;
616
+ const inner =
617
+ isHeadedError(failure) && failure.cause instanceof TlaEvaluationError
618
+ ? failure.cause
619
+ : failure;
620
+ const initialState = errorState;
621
+ const prefix = initialState ? "" : getUnexpectedMessage("computing initial states", inner);
622
+ const suffix = initialState
623
+ ? `\nWhile working on the initial state:\n${formatState(toRecord(initialState))}`
624
+ : "";
625
+ message(
626
+ initialState ? MESSAGE_CODE.initialState : MESSAGE_CODE.general,
627
+ `${prefix}${inner.message}${suffix}`,
628
+ `${prefix}${formatNestedMessage(inner.message, true)}${suffix}`,
629
+ );
630
+ generatedCount = 0;
631
+ initialEntries.length = 0;
632
+ const isReplayFailed = tryInitialStates().error !== undefined;
633
+ if (isReplayFailed) {
634
+ message(
635
+ MESSAGE_CODE.nestedExpression,
636
+ `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)}`,
637
+ );
638
+ }
639
+ printSummary();
640
+ return isReplayFailed ? EXIT_STATUS.specEvaluationFailure : getErrorExitCode(inner);
641
+ }
642
+ if (initialFailure.code !== NO_ERROR) return getMessageExitStatus(initialFailure.code);
643
+ message(
644
+ MESSAGE_CODE.depthFirstInitGenerated,
645
+ `Finished computing initial states: ${generatedCount} states generated, with ${initialEntries.length} of them distinct.`,
646
+ undefined,
647
+ false,
648
+ );
649
+ if (nextActions.length === 0) {
650
+ reportSuccess();
651
+ return finish(NO_ERROR);
652
+ }
653
+ let isTerminated = false;
654
+ let levelCode: number = MESSAGE_CODE.general;
655
+ for (let level = 2; level <= options.maxDepth; level++) {
656
+ if (isTerminated) {
657
+ const errorEntry = checker.errorEntry;
658
+ if (!errorEntry && checker.continuedCode === NO_ERROR) {
659
+ levelCode = NO_ERROR;
660
+ reportSuccess();
661
+ }
662
+ if (errorEntry && checker.isKeepingCallStack) replayExpansion(errorEntry);
663
+ break;
664
+ }
665
+ message(
666
+ MESSAGE_CODE.depthFirstLevel,
667
+ `Starting level ${level}: ${generatedCount} states generated, ${statuses.size} distinct states found.`,
668
+ undefined,
669
+ false,
670
+ );
671
+ fingerprintSet.level++;
672
+ fingerprintSet.leveled = LEVELED - fingerprintSet.leveled;
673
+ // TLC starts a new DFIDWorker thread for each level, whose generator for random values starts over from the seed.
674
+ const random = createJavaRandom(runtime.seed);
675
+ runtime.getRandom = () => random;
676
+ searchLevel(level);
677
+ checker.isDone = false;
678
+ levelCode = checker.isKeepingCallStack ? NO_ERROR : checker.errorCode;
679
+ if (levelCode !== NO_ERROR) return finish(levelCode);
680
+ isTerminated = checker.stopCode === "error" || !checker.isMoreLevel;
681
+ }
682
+ return finish(levelCode);
683
+ };