tla-ts 0.0.4 → 0.0.5

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 (378) hide show
  1. package/README.md +37 -126
  2. package/dist/cli.cjs +1 -1
  3. package/dist/cli.js +1 -1
  4. package/dist/deciders.cjs +366 -0
  5. package/dist/deciders.js +366 -0
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +46 -12
  8. package/dist/index.d.ts +46 -12
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -4
  11. package/dist/parallel-worker.js +1 -4
  12. package/dist/prove-worker.cjs +9 -0
  13. package/dist/prove-worker.d.cts +9 -0
  14. package/dist/prove-worker.d.ts +9 -0
  15. package/dist/prove-worker.js +9 -0
  16. package/dist/prove.cjs +1006 -0
  17. package/dist/prove.js +1006 -0
  18. package/dist/run.cjs +45 -0
  19. package/dist/run.js +45 -0
  20. package/dist/tlapm.cjs +10 -0
  21. package/dist/tlapm.js +10 -0
  22. package/dist/transfer.cjs +76 -92
  23. package/dist/transfer.js +76 -92
  24. package/dist/worker.cjs +21 -0
  25. package/dist/worker.js +21 -0
  26. package/package.json +21 -12
  27. package/src/ast.ts +2 -2
  28. package/src/bags.ts +22 -23
  29. package/src/builtins.ts +16 -8
  30. package/src/check.ts +131 -1153
  31. package/src/{cli-options.ts → cli/options.ts} +54 -9
  32. package/src/cli/run.ts +63 -0
  33. package/src/cli/shared.ts +106 -0
  34. package/src/cli/tlapm.ts +374 -0
  35. package/src/{run-cli.ts → cli/tlc.ts} +115 -721
  36. package/src/cli/xml-exporter.ts +221 -0
  37. package/src/cli.ts +1 -1
  38. package/src/codegen.ts +43 -22
  39. package/src/config.ts +5 -5
  40. package/src/dependencies.ts +4 -6
  41. package/src/environment.ts +55 -60
  42. package/src/errors.ts +97 -35
  43. package/src/evaluate.ts +361 -181
  44. package/src/exit-codes.ts +1 -1
  45. package/src/fingerprints.ts +3 -3
  46. package/src/index.ts +10 -0
  47. package/src/instances.ts +56 -46
  48. package/src/java-overrides.ts +79 -41
  49. package/src/json.ts +31 -36
  50. package/src/levels.ts +10 -13
  51. package/src/{live-check.ts → liveness-checker.ts} +207 -141
  52. package/src/liveness.ts +38 -34
  53. package/src/{obligation-action.ts → obligations/action.ts} +248 -74
  54. package/src/{obligation-anon.ts → obligations/anonymize.ts} +55 -57
  55. package/src/obligations/equality.ts +260 -0
  56. package/src/obligations/expression.ts +618 -0
  57. package/src/{obligation-format.ts → obligations/format.ts} +7 -8
  58. package/src/obligations/generate.ts +457 -0
  59. package/src/{obligations.ts → obligations/index.ts} +46 -32
  60. package/src/{obligation-levels.ts → obligations/levels.ts} +44 -40
  61. package/src/obligations/module.ts +445 -0
  62. package/src/obligations/normalize.ts +554 -0
  63. package/src/obligations/operators.ts +176 -0
  64. package/src/obligations/pragma.ts +195 -0
  65. package/src/{obligation-printer.ts → obligations/printer.ts} +65 -230
  66. package/src/{obligation-proof.ts → obligations/proof.ts} +7 -2
  67. package/src/obligations/regroup.ts +100 -0
  68. package/src/{obligation-generate.ts → obligations/simplify.ts} +130 -536
  69. package/src/{obligation-source.ts → obligations/source.ts} +172 -216
  70. package/src/{obligation-deref.ts → obligations/subexpression.ts} +84 -115
  71. package/src/obligations/substitution.ts +261 -0
  72. package/src/obligations/temporal.ts +321 -0
  73. package/src/{obligation-tuples.ts → obligations/tuples.ts} +38 -54
  74. package/src/parallel-worker.ts +39 -51
  75. package/src/parallel.ts +39 -66
  76. package/src/parser.ts +67 -74
  77. package/src/{pcal-ast.ts → pcal/ast.ts} +2 -17
  78. package/src/{pcal-parse.ts → pcal/parse.ts} +28 -64
  79. package/src/{pcal-tokenize.ts → pcal/tokenize.ts} +10 -39
  80. package/src/{pcal-translate.ts → pcal/translate.ts} +30 -109
  81. package/src/{pcal-validate.ts → pcal/validate.ts} +10 -20
  82. package/src/prover/decide-pool.ts +95 -0
  83. package/src/prover/deciders.ts +33 -0
  84. package/src/prover/first-order.ts +175 -0
  85. package/src/prover/isabelle/LICENSE +36 -0
  86. package/src/prover/isabelle/LICENSE-tlapm +26 -0
  87. package/src/prover/isabelle/decide.ts +44 -0
  88. package/src/prover/isabelle/encode.ts +445 -0
  89. package/src/prover/isabelle/isar/inner-syntax.ts +579 -0
  90. package/src/prover/isabelle/isar/method.ts +367 -0
  91. package/src/prover/isabelle/isar/proof.ts +28 -0
  92. package/src/prover/isabelle/isar/statement.ts +57 -0
  93. package/src/prover/isabelle/isar/theory.ts +192 -0
  94. package/src/prover/isabelle/isar/type-check.ts +278 -0
  95. package/src/prover/isabelle/provers/blast/blast.ts +258 -0
  96. package/src/prover/isabelle/provers/blast/branch.ts +322 -0
  97. package/src/prover/isabelle/provers/blast/prove.ts +347 -0
  98. package/src/prover/isabelle/provers/blast/rules.ts +330 -0
  99. package/src/prover/isabelle/provers/blast/state.ts +180 -0
  100. package/src/prover/isabelle/provers/blast/term.ts +546 -0
  101. package/src/prover/isabelle/provers/clasimp.ts +150 -0
  102. package/src/prover/isabelle/provers/classical.ts +389 -0
  103. package/src/prover/isabelle/provers/hypsubst.ts +433 -0
  104. package/src/prover/isabelle/pure/bicompose.ts +174 -0
  105. package/src/prover/isabelle/pure/consts.ts +32 -0
  106. package/src/prover/isabelle/pure/conv.ts +79 -0
  107. package/src/prover/isabelle/pure/drule.ts +264 -0
  108. package/src/prover/isabelle/pure/envir.ts +331 -0
  109. package/src/prover/isabelle/pure/goal.ts +53 -0
  110. package/src/prover/isabelle/pure/interrupt.ts +16 -0
  111. package/src/prover/isabelle/pure/list.ts +12 -0
  112. package/src/prover/isabelle/pure/logic.ts +330 -0
  113. package/src/prover/isabelle/pure/name.ts +98 -0
  114. package/src/prover/isabelle/pure/net.ts +215 -0
  115. package/src/prover/isabelle/pure/object-logic.ts +41 -0
  116. package/src/prover/isabelle/pure/pattern.ts +631 -0
  117. package/src/prover/isabelle/pure/raw-simplifier.ts +338 -0
  118. package/src/prover/isabelle/pure/rewriter.ts +602 -0
  119. package/src/prover/isabelle/pure/search.ts +68 -0
  120. package/src/prover/isabelle/pure/seq.ts +133 -0
  121. package/src/prover/isabelle/pure/simplifier.ts +106 -0
  122. package/src/prover/isabelle/pure/table.ts +201 -0
  123. package/src/prover/isabelle/pure/tactic.ts +168 -0
  124. package/src/prover/isabelle/pure/tactical.ts +264 -0
  125. package/src/prover/isabelle/pure/term-ord.ts +105 -0
  126. package/src/prover/isabelle/pure/term.ts +688 -0
  127. package/src/prover/isabelle/pure/thm.ts +783 -0
  128. package/src/prover/isabelle/pure/type.ts +121 -0
  129. package/src/prover/isabelle/pure/unify.ts +753 -0
  130. package/src/prover/isabelle/pure/variable.ts +25 -0
  131. package/src/prover/isabelle/tla/classical-setup.ts +101 -0
  132. package/src/prover/isabelle/tla/context.ts +74 -0
  133. package/src/prover/isabelle/tla/logic-data.ts +5 -0
  134. package/src/prover/isabelle/tla/logic.ts +215 -0
  135. package/src/prover/isabelle/tla/simpdata.ts +241 -0
  136. package/src/prover/isabelle/tools/intuitionistic.ts +132 -0
  137. package/src/prover/ocaml.ts +22 -0
  138. package/src/prover/prep/action.ts +508 -0
  139. package/src/prover/prep/enabled-axioms.ts +189 -0
  140. package/src/prover/prep/fingerprint.ts +388 -0
  141. package/src/prover/prep/level-comparison.ts +529 -0
  142. package/src/prover/prep/md5.ts +60 -0
  143. package/src/prover/prep/methods.ts +221 -0
  144. package/src/prover/prep/normalize.ts +309 -0
  145. package/src/prover/prove-worker.ts +22 -0
  146. package/src/prover/prove.ts +492 -0
  147. package/src/prover/ptl/decide.ts +68 -0
  148. package/src/prover/ptl/encode.ts +244 -0
  149. package/src/prover/ptl/sat.ts +151 -0
  150. package/src/prover/ptl/tableau.ts +276 -0
  151. package/src/prover/smt/axioms.ts +209 -0
  152. package/src/prover/smt/context.ts +108 -0
  153. package/src/prover/smt/data.ts +636 -0
  154. package/src/prover/smt/encode.ts +275 -0
  155. package/src/prover/smt/extensionality.ts +65 -0
  156. package/src/prover/smt/flatten.ts +112 -0
  157. package/src/prover/smt/format.ts +154 -0
  158. package/src/prover/smt/instances.ts +181 -0
  159. package/src/prover/smt/rewrite.ts +766 -0
  160. package/src/prover/smt/solver/act-cache.ts +265 -0
  161. package/src/prover/smt/solver/arith-rewriter.ts +962 -0
  162. package/src/prover/smt/solver/array.ts +22 -0
  163. package/src/prover/smt/solver/asserted-formulas.ts +469 -0
  164. package/src/prover/smt/solver/ast-lt.ts +157 -0
  165. package/src/prover/smt/solver/ast-util.ts +91 -0
  166. package/src/prover/smt/solver/ast.ts +1315 -0
  167. package/src/prover/smt/solver/auf-solver.ts +572 -0
  168. package/src/prover/smt/solver/case-split-queue.ts +178 -0
  169. package/src/prover/smt/solver/cg-table.ts +175 -0
  170. package/src/prover/smt/solver/clause.ts +276 -0
  171. package/src/prover/smt/solver/conflict-resolution.ts +343 -0
  172. package/src/prover/smt/solver/context.ts +1292 -0
  173. package/src/prover/smt/solver/ctx-simplify.ts +334 -0
  174. package/src/prover/smt/solver/der.ts +224 -0
  175. package/src/prover/smt/solver/dyn-ack.ts +141 -0
  176. package/src/prover/smt/solver/e-matching.ts +659 -0
  177. package/src/prover/smt/solver/enode.ts +259 -0
  178. package/src/prover/smt/solver/expr-ref.ts +21 -0
  179. package/src/prover/smt/solver/expr-safe-replace.ts +172 -0
  180. package/src/prover/smt/solver/fingerprints.ts +92 -0
  181. package/src/prover/smt/solver/flat-literals.ts +51 -0
  182. package/src/prover/smt/solver/goal.ts +138 -0
  183. package/src/prover/smt/solver/hash.ts +173 -0
  184. package/src/prover/smt/solver/hashtable.ts +166 -0
  185. package/src/prover/smt/solver/internalizer.ts +1381 -0
  186. package/src/prover/smt/solver/lbool.ts +5 -0
  187. package/src/prover/smt/solver/literal.ts +24 -0
  188. package/src/prover/smt/solver/lp/bound-propagator.ts +391 -0
  189. package/src/prover/smt/solver/lp/constraints.ts +78 -0
  190. package/src/prover/smt/solver/lp/containers.ts +296 -0
  191. package/src/prover/smt/solver/lp/core-solver.ts +504 -0
  192. package/src/prover/smt/solver/lp/cross-nested.ts +224 -0
  193. package/src/prover/smt/solver/lp/dep-intervals.ts +642 -0
  194. package/src/prover/smt/solver/lp/dependency.ts +51 -0
  195. package/src/prover/smt/solver/lp/dioph-eq.ts +1181 -0
  196. package/src/prover/smt/solver/lp/explanation.ts +46 -0
  197. package/src/prover/smt/solver/lp/gomory.ts +255 -0
  198. package/src/prover/smt/solver/lp/hnf-cutter.ts +125 -0
  199. package/src/prover/smt/solver/lp/hnf.ts +281 -0
  200. package/src/prover/smt/solver/lp/int-cube.ts +295 -0
  201. package/src/prover/smt/solver/lp/int-solver.ts +514 -0
  202. package/src/prover/smt/solver/lp/lar-solver.ts +816 -0
  203. package/src/prover/smt/solver/lp/lar-term.ts +62 -0
  204. package/src/prover/smt/solver/lp/lp-settings.ts +91 -0
  205. package/src/prover/smt/solver/lp/maximize-term.ts +347 -0
  206. package/src/prover/smt/solver/lp/nex-creator.ts +381 -0
  207. package/src/prover/smt/solver/lp/nex.ts +120 -0
  208. package/src/prover/smt/solver/lp/nla-backoff.ts +43 -0
  209. package/src/prover/smt/solver/lp/nla-basics.ts +398 -0
  210. package/src/prover/smt/solver/lp/nla-core.ts +968 -0
  211. package/src/prover/smt/solver/lp/nla-divisions.ts +332 -0
  212. package/src/prover/smt/solver/lp/nla-emonics.ts +373 -0
  213. package/src/prover/smt/solver/lp/nla-factorization.ts +30 -0
  214. package/src/prover/smt/solver/lp/nla-grobner.ts +904 -0
  215. package/src/prover/smt/solver/lp/nla-horner.ts +126 -0
  216. package/src/prover/smt/solver/lp/nla-intervals.ts +265 -0
  217. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +715 -0
  218. package/src/prover/smt/solver/lp/nla-monotone.ts +59 -0
  219. package/src/prover/smt/solver/lp/nla-order.ts +307 -0
  220. package/src/prover/smt/solver/lp/nla-patcher.ts +112 -0
  221. package/src/prover/smt/solver/lp/nla-tangents.ts +251 -0
  222. package/src/prover/smt/solver/lp/nla-throttle.ts +85 -0
  223. package/src/prover/smt/solver/lp/nla-types.ts +124 -0
  224. package/src/prover/smt/solver/lp/nla-var-eqs.ts +141 -0
  225. package/src/prover/smt/solver/lp/nra-solver.ts +440 -0
  226. package/src/prover/smt/solver/lp/numeric-pair.ts +65 -0
  227. package/src/prover/smt/solver/lp/pdd-interval.ts +31 -0
  228. package/src/prover/smt/solver/lp/pdd-simplifier.ts +184 -0
  229. package/src/prover/smt/solver/lp/pdd-solver.ts +408 -0
  230. package/src/prover/smt/solver/lp/pdd.ts +971 -0
  231. package/src/prover/smt/solver/lp/random-updater.ts +138 -0
  232. package/src/prover/smt/solver/lp/static-matrix.ts +246 -0
  233. package/src/prover/smt/solver/lp/union-find.ts +96 -0
  234. package/src/prover/smt/solver/mam-compiler.ts +847 -0
  235. package/src/prover/smt/solver/mam-interpreter.ts +400 -0
  236. package/src/prover/smt/solver/maximize-ac-sharing.ts +118 -0
  237. package/src/prover/smt/solver/model-checker.ts +347 -0
  238. package/src/prover/smt/solver/model-evaluator.ts +262 -0
  239. package/src/prover/smt/solver/model-finder.ts +155 -0
  240. package/src/prover/smt/solver/model-generator.ts +97 -0
  241. package/src/prover/smt/solver/model-macro-solver.ts +728 -0
  242. package/src/prover/smt/solver/nlsat/algebraic.ts +1161 -0
  243. package/src/prover/smt/solver/nlsat/atoms.ts +238 -0
  244. package/src/prover/smt/solver/nlsat/evaluator.ts +303 -0
  245. package/src/prover/smt/solver/nlsat/explain.ts +607 -0
  246. package/src/prover/smt/solver/nlsat/interval-set.ts +351 -0
  247. package/src/prover/smt/solver/nlsat/levelwise.ts +737 -0
  248. package/src/prover/smt/solver/nlsat/mpbq.ts +161 -0
  249. package/src/prover/smt/solver/nlsat/polynomial.ts +1722 -0
  250. package/src/prover/smt/solver/nlsat/solver.ts +911 -0
  251. package/src/prover/smt/solver/nlsat/types.ts +43 -0
  252. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
  253. package/src/prover/smt/solver/nlsat/upolynomial.ts +996 -0
  254. package/src/prover/smt/solver/nnf.ts +469 -0
  255. package/src/prover/smt/solver/pattern-inference.ts +351 -0
  256. package/src/prover/smt/solver/poly-rewriter.ts +477 -0
  257. package/src/prover/smt/solver/propagate-values.ts +83 -0
  258. package/src/prover/smt/solver/proto-model.ts +551 -0
  259. package/src/prover/smt/solver/pull-quant.ts +139 -0
  260. package/src/prover/smt/solver/qe-lite-der.ts +526 -0
  261. package/src/prover/smt/solver/qe-lite-fm.ts +576 -0
  262. package/src/prover/smt/solver/qe-lite.ts +381 -0
  263. package/src/prover/smt/solver/qi-queue.ts +362 -0
  264. package/src/prover/smt/solver/quant-tactics.ts +117 -0
  265. package/src/prover/smt/solver/quantifier-analyzer.ts +562 -0
  266. package/src/prover/smt/solver/quantifier-manager.ts +186 -0
  267. package/src/prover/smt/solver/random-gen.ts +10 -0
  268. package/src/prover/smt/solver/rational.ts +165 -0
  269. package/src/prover/smt/solver/ref-vector.ts +62 -0
  270. package/src/prover/smt/solver/relevancy.ts +247 -0
  271. package/src/prover/smt/solver/rewriter-tpl.ts +1159 -0
  272. package/src/prover/smt/solver/rewriter.ts +843 -0
  273. package/src/prover/smt/solver/rlimit.ts +79 -0
  274. package/src/prover/smt/solver/smtlib-parser.ts +526 -0
  275. package/src/prover/smt/solver/solver.ts +71 -0
  276. package/src/prover/smt/solver/sort.ts +35 -0
  277. package/src/prover/smt/solver/sticky-generations.ts +69 -0
  278. package/src/prover/smt/solver/theory-lra-axioms.ts +340 -0
  279. package/src/prover/smt/solver/theory-lra-bounds.ts +226 -0
  280. package/src/prover/smt/solver/theory-lra-final-check.ts +252 -0
  281. package/src/prover/smt/solver/theory-lra-internalize.ts +476 -0
  282. package/src/prover/smt/solver/theory-lra-model.ts +243 -0
  283. package/src/prover/smt/solver/theory-lra-propagate.ts +405 -0
  284. package/src/prover/smt/solver/theory-lra-state.ts +43 -0
  285. package/src/prover/smt/solver/theory-lra.ts +56 -0
  286. package/src/prover/smt/solver/var-subst.ts +258 -0
  287. package/src/prover/smt/solver/z3-license.txt +10 -0
  288. package/src/prover/smt/table.ts +170 -0
  289. package/src/prover/tlapm/cache.ts +236 -0
  290. package/src/prover/tlapm/ocaml-marshal.ts +166 -0
  291. package/src/prover/tlapm/tlapm.ts +96 -0
  292. package/src/prover/tlaps-module.ts +510 -0
  293. package/src/prover/verdict.ts +13 -0
  294. package/src/prover/zenon/LICENSE +32 -0
  295. package/src/prover/zenon/check/check.ts +105 -0
  296. package/src/prover/zenon/check/definitions.ts +144 -0
  297. package/src/prover/zenon/check/equality.ts +182 -0
  298. package/src/prover/zenon/check/functions.ts +62 -0
  299. package/src/prover/zenon/check/keys.ts +125 -0
  300. package/src/prover/zenon/check/propositional.ts +104 -0
  301. package/src/prover/zenon/check/records.ts +188 -0
  302. package/src/prover/zenon/check/relations.ts +121 -0
  303. package/src/prover/zenon/check/rewrites.ts +224 -0
  304. package/src/prover/zenon/check/sets.ts +302 -0
  305. package/src/prover/zenon/check/terms.ts +127 -0
  306. package/src/prover/zenon/check/tla.ts +126 -0
  307. package/src/prover/zenon/decide.ts +107 -0
  308. package/src/prover/zenon/encode.ts +378 -0
  309. package/src/prover/zenon/eqrel.ts +300 -0
  310. package/src/prover/zenon/equality-rules.ts +435 -0
  311. package/src/prover/zenon/expr.ts +551 -0
  312. package/src/prover/zenon/index-table.ts +350 -0
  313. package/src/prover/zenon/isar-case.ts +513 -0
  314. package/src/prover/zenon/isar.ts +1249 -0
  315. package/src/prover/zenon/limits.ts +15 -0
  316. package/src/prover/zenon/llproof.ts +173 -0
  317. package/src/prover/zenon/mltoll.ts +1566 -0
  318. package/src/prover/zenon/node.ts +297 -0
  319. package/src/prover/zenon/ocaml.ts +169 -0
  320. package/src/prover/zenon/parse.ts +247 -0
  321. package/src/prover/zenon/phrase.ts +191 -0
  322. package/src/prover/zenon/proof.ts +198 -0
  323. package/src/prover/zenon/propositional-rules.ts +387 -0
  324. package/src/prover/zenon/rules.ts +94 -0
  325. package/src/prover/zenon/search.ts +288 -0
  326. package/src/prover/zenon/tla/functions.ts +151 -0
  327. package/src/prover/zenon/tla/llproof.ts +480 -0
  328. package/src/prover/zenon/tla/records.ts +225 -0
  329. package/src/prover/zenon/tla/rewrites.ts +447 -0
  330. package/src/prover/zenon/tla/sets.ts +304 -0
  331. package/src/prover/zenon/tla/terms.ts +162 -0
  332. package/src/prover/zenon/tla/tla.ts +506 -0
  333. package/src/randomization.ts +19 -24
  334. package/src/resolve.ts +15 -22
  335. package/src/runtime.ts +8 -8
  336. package/src/{sany-builtins.ts → sany/builtins.ts} +1 -1
  337. package/src/{sany-generator.ts → sany/generator.ts} +38 -55
  338. package/src/{sany-levels.ts → sany/levels.ts} +45 -48
  339. package/src/{sany-lexer.ts → sany/lexer.ts} +2 -3
  340. package/src/{sany-linter.ts → sany/linter.ts} +1 -1
  341. package/src/{sany-modules.ts → sany/modules.ts} +2 -2
  342. package/src/{sany-nodes.ts → sany/nodes.ts} +2 -2
  343. package/src/{sany-parse-error.ts → sany/parse-error.ts} +2 -2
  344. package/src/{sany-report.ts → sany/report.ts} +16 -17
  345. package/src/{sany-selectors.ts → sany/selectors.ts} +3 -5
  346. package/src/{sany-source.ts → sany/source.ts} +6 -7
  347. package/src/{sany-xml.ts → sany/xml.ts} +5 -6
  348. package/src/search.ts +969 -0
  349. package/src/spec-description.ts +26 -20
  350. package/src/{standard-levels.ts → standard-definitions.ts} +118 -2
  351. package/src/standard-modules.ts +21 -22
  352. package/src/state-graph.ts +9 -8
  353. package/src/substitution-levels.ts +2 -2
  354. package/src/successors.ts +39 -23
  355. package/src/symmetry.ts +1 -1
  356. package/src/tableau.ts +6 -7
  357. package/src/tlc/fingerprint.ts +214 -0
  358. package/src/{tlc-messages.ts → tlc/messages.ts} +119 -7
  359. package/src/{tlc-order.ts → tlc/order.ts} +7 -7
  360. package/src/{tlc-random.ts → tlc/random.ts} +3 -190
  361. package/src/{tlc-replay.ts → tlc/replay.ts} +40 -36
  362. package/src/{tlc-module.ts → tlc/tlc-operators.ts} +9 -9
  363. package/src/{tlc-ext.ts → tlc/tlcext-operators.ts} +30 -25
  364. package/src/{tlc-version.ts → tlc/version.ts} +8 -7
  365. package/src/transfer.ts +32 -32
  366. package/src/values.ts +166 -111
  367. package/src/worker.ts +62 -0
  368. package/dist/parallel.cjs +0 -12
  369. package/dist/parallel.js +0 -12
  370. package/dist/run-cli.cjs +0 -55
  371. package/dist/run-cli.js +0 -55
  372. package/src/canonical.ts +0 -40
  373. package/src/obligation-expression.ts +0 -1060
  374. package/src/obligation-module.ts +0 -1042
  375. package/src/standard-ranges.ts +0 -116
  376. package/src/value-sources.ts +0 -29
  377. /package/src/{tlc-modules.ts → tlc/jar-data.ts} +0 -0
  378. /package/src/{tlc-summary.ts → tlc/summary.ts} +0 -0
@@ -0,0 +1,56 @@
1
+ // Ported from Z3 (src/smt/theory_lra.cpp, src/smt/arith_eq_adapter.cpp, src/math/lp/lp_api.h), MIT
2
+ // license, see z3-license.txt. Linear integer and real arithmetic, as the theory_lra solver that
3
+ // Z3's default configuration uses for UFNIA. Terms become columns of the lp solver, integer or not
4
+ // by their sort, atoms become bounds on them, propagation makes the tableau feasible and propagates
5
+ // implied bounds and equalities, and the final check runs the integer solver and assumes equalities
6
+ // between shared terms with equal values. Nonlinear products and divisions go to nla
7
+ // (src/math/lp/nla_core.cpp), which refines the model with lemmas, and runs nlsat on what they
8
+ // leave open. This class adds the scopes to the chain of classes that theory-lra-state.ts starts.
9
+ import { shrink } from "./array";
10
+ import { TheoryLraFinalCheck } from "./theory-lra-final-check";
11
+
12
+ export class TheoryLra extends TheoryLraFinalCheck {
13
+ pushScopeEh() {
14
+ this.scopes.push({
15
+ boundsLimit: this.boundsTrail.length,
16
+ assertedQhead: this.assertedQhead,
17
+ assertedAtomsLimit: this.assertedAtoms.length,
18
+ numVars: this.getNumVars(),
19
+ });
20
+ this.solver.push();
21
+ this.nla?.push();
22
+ }
23
+
24
+ popScopeEh(numScopes = 1) {
25
+ if (numScopes === 0) return;
26
+ const oldSize = this.scopes.length - numScopes;
27
+ const scope = this.scopes[oldSize];
28
+ for (let index = this.boundsTrail.length; index-- > scope.boundsLimit;)
29
+ this.bounds[this.boundsTrail[index]].pop();
30
+ shrink(this.boundsTrail, scope.boundsLimit);
31
+ shrink(this.assertedAtoms, scope.assertedAtomsLimit);
32
+ this.assertedQhead = scope.assertedQhead;
33
+ shrink(this.scopes, oldSize);
34
+ this.solver.pop(numScopes);
35
+ const numConstraints = this.solver.constraints.constraints.length;
36
+ if (this.constraintSources.length > numConstraints)
37
+ shrink(this.constraintSources, numConstraints);
38
+ this.newBounds = [];
39
+ this.nla?.pop(numScopes);
40
+ shrink(this.varEnodes, scope.numVars);
41
+ }
42
+
43
+ restartEh() {
44
+ const pairs = this.restartPairs;
45
+ this.restartPairs = [];
46
+ for (const pair of pairs) {
47
+ if (this.context.isInconsistent()) break;
48
+ this.mkEqAxioms(pair[0], pair[1]);
49
+ }
50
+ }
51
+
52
+ initSearchEh() {
53
+ this.numConflicts = 0;
54
+ this.restartPairs = [];
55
+ }
56
+ }
@@ -0,0 +1,258 @@
1
+ // Ported from Z3 (src/ast/rewriter/var_subst.cpp), MIT license, see z3-license.txt. Substitution and
2
+ // shifting of de Bruijn variables.
3
+ import { KIND_APP, KIND_QUANTIFIER, KIND_VAR, type AstManager, type SmtSymbol } from "./ast";
4
+ import { ExprSafeReplace } from "./expr-safe-replace";
5
+ import { BetaReducer } from "./rewriter-tpl";
6
+
7
+ // var_subst: substitutes args for the free variables, args[n - 1 - i] for (:var i) in standard
8
+ // order and args[i] otherwise, where -1 keeps the variable. Each result comes with a reference,
9
+ // which the caller releases.
10
+ export class VarSubst {
11
+ private reducer: BetaReducer;
12
+
13
+ constructor(
14
+ private manager: AstManager,
15
+ private isStdOrder: boolean,
16
+ ) {
17
+ this.reducer = new BetaReducer(manager);
18
+ }
19
+
20
+ apply(expr: number, args: number[]) {
21
+ const manager = this.manager;
22
+ const count = args.length;
23
+ if (manager.isGroundApp(expr) || count === 0) {
24
+ manager.incRef(expr);
25
+ return expr;
26
+ }
27
+ if (manager.hasQuantifierFlags[expr]) {
28
+ const replace = new ExprSafeReplace(manager);
29
+ args.forEach((arg, index) => {
30
+ if (arg !== -1)
31
+ replace.insert(
32
+ manager.mkVar(this.isStdOrder ? count - index - 1 : index, manager.sorts[arg]),
33
+ arg,
34
+ );
35
+ });
36
+ const result = replace.apply(expr);
37
+ replace.release();
38
+ return result;
39
+ }
40
+ if (
41
+ manager.kinds[expr] === KIND_APP &&
42
+ manager.everyArg(expr, (arg) => manager.isGroundApp(arg) || manager.kinds[arg] === KIND_VAR)
43
+ ) {
44
+ const result = manager.mkApp(
45
+ manager.decls[expr],
46
+ manager.mapArgs(expr, (arg) => {
47
+ if (manager.isGroundApp(arg)) return arg;
48
+ const index = manager.values[arg];
49
+ const replaced =
50
+ index < count ? (this.isStdOrder ? args[count - index - 1] : args[index]) : -1;
51
+ return replaced === -1 ? arg : replaced;
52
+ }),
53
+ manager.sorts[expr],
54
+ );
55
+ manager.incRef(result);
56
+ return result;
57
+ }
58
+ this.reducer.reset();
59
+ if (this.isStdOrder) this.reducer.setInvBindings(args);
60
+ else this.reducer.setBindings(args);
61
+ return this.reducer.rewrite(expr);
62
+ }
63
+
64
+ // ~var_subst.
65
+ release() {
66
+ this.reducer.release();
67
+ }
68
+ }
69
+
70
+ // A term whose children replaceFreeVars is rebuilding: where its children's results start on the
71
+ // result stack, and the next child to visit.
72
+ interface ReplaceFrame {
73
+ expr: number;
74
+ shift: number;
75
+ start: number;
76
+ next: number;
77
+ }
78
+
79
+ // Rebuilds expr with each free variable replaced. replace gets the variable, its de Bruijn index
80
+ // relative to expr, and the number of binders above it. Like Z3's rewriter_tpl, it keeps its own
81
+ // stack, so deep terms do not exhaust the call stack.
82
+ export const replaceFreeVars = (
83
+ manager: AstManager,
84
+ expr: number,
85
+ replace: (variable: number, index: number, shift: number) => number,
86
+ ) => {
87
+ const cache = new Map<number, number>();
88
+ const frames: ReplaceFrame[] = [];
89
+ const results: number[] = [];
90
+ const visit = (current: number, shift: number) => {
91
+ if (manager.freeVarBounds[current] <= shift) {
92
+ results.push(current);
93
+ return;
94
+ }
95
+ const key = current * 64 + shift;
96
+ const cached = cache.get(key);
97
+ if (cached !== undefined) results.push(cached);
98
+ else if (manager.kinds[current] !== KIND_VAR)
99
+ frames.push({ expr: current, shift, start: results.length, next: 0 });
100
+ else {
101
+ const result = replace(current, manager.values[current] - shift, shift);
102
+ cache.set(key, result);
103
+ results.push(result);
104
+ }
105
+ };
106
+ visit(expr, 0);
107
+ while (frames.length > 0) {
108
+ const frame = frames[frames.length - 1];
109
+ const current = frame.expr;
110
+ const data = manager.kinds[current] === KIND_QUANTIFIER ? manager.getQuantifier(current) : null;
111
+ // A quantifier's children are its body and its patterns, under its binders.
112
+ const numChildren = data === null ? manager.getNumArgs(current) : 1 + data.patterns.length;
113
+ if (frame.next < numChildren) {
114
+ const index = frame.next++;
115
+ if (data === null) visit(manager.getArg(current, index), frame.shift);
116
+ else
117
+ visit(index === 0 ? data.body : data.patterns[index - 1], frame.shift + data.sorts.length);
118
+ continue;
119
+ }
120
+ const children = results.splice(frame.start);
121
+ const result =
122
+ data === null
123
+ ? manager.mkApp(manager.decls[current], children, manager.sorts[current])
124
+ : manager.mkQuantifier({ ...data, body: children[0], patterns: children.slice(1) });
125
+ frames.pop();
126
+ cache.set(current * 64 + frame.shift, result);
127
+ results.push(result);
128
+ }
129
+ return results[0];
130
+ };
131
+
132
+ // used_vars::process: the sort of each free variable of expr below count, indexed by de Bruijn
133
+ // index, undefined for a variable that does not occur. Like Z3, it walks the term without rebuilding
134
+ // it, and visits a shared term once for each number of binders above it.
135
+ export const getFreeVarSorts = (manager: AstManager, expr: number, count: number) => {
136
+ const sorts: (number | undefined)[] = Array.from({ length: count }, () => undefined);
137
+ const exprs = [expr];
138
+ const deltas = [0];
139
+ const visited = new Set<number>();
140
+ for (let current = exprs.pop(); current !== undefined; current = exprs.pop()) {
141
+ const delta = deltas.pop() ?? 0;
142
+ if (manager.freeVarBounds[current] <= delta) continue;
143
+ if (manager.getRefCount(current) > 1) {
144
+ const key = current * 64 + delta;
145
+ if (visited.has(key)) continue;
146
+ visited.add(key);
147
+ }
148
+ const kind = manager.kinds[current];
149
+ if (kind === KIND_VAR) {
150
+ const index = manager.values[current] - delta;
151
+ if (index < count && sorts[index] === undefined) sorts[index] = manager.sorts[current];
152
+ } else if (kind === KIND_APP)
153
+ for (let index = 0; index < manager.getNumArgs(current); index++) {
154
+ const arg = manager.getArg(current, index);
155
+ exprs.push(arg);
156
+ deltas.push(delta);
157
+ }
158
+ else {
159
+ const data = manager.getQuantifier(current);
160
+ for (const child of [data.body, ...data.patterns]) {
161
+ exprs.push(child);
162
+ deltas.push(delta + data.sorts.length);
163
+ }
164
+ }
165
+ }
166
+ return sorts;
167
+ };
168
+
169
+ // Which variables of a quantifier body occur, indexed by de Bruijn index.
170
+ export const collectUsedVars = (manager: AstManager, expr: number, count: number) =>
171
+ getFreeVarSorts(manager, expr, count).map((sort) => sort !== undefined);
172
+
173
+ // unused_vars_eliminator: drops the variables that neither the body nor a pattern uses. Its
174
+ // var_subst keeps the cache of its last substitution until the next one.
175
+ export class UnusedVarsEliminator {
176
+ private subst: VarSubst;
177
+
178
+ constructor(private manager: AstManager) {
179
+ this.subst = new VarSubst(manager, true);
180
+ }
181
+
182
+ // The result comes with a reference, which the caller releases.
183
+ apply(expr: number) {
184
+ const manager = this.manager;
185
+ return manager.withoutTemporaries(() => {
186
+ const data = manager.kinds[expr] === KIND_QUANTIFIER ? manager.getQuantifier(expr) : null;
187
+ // ignore_patterns_on_ground_qbody: a ground body drops the patterns with the variables.
188
+ const kept = data === null ? expr : manager.isGround(data.body) ? data.body : -1;
189
+ if (kept !== -1 || data === null) {
190
+ manager.incRef(kept);
191
+ return kept;
192
+ }
193
+ // used_vars: the sort of each free variable of the body and the patterns.
194
+ const usedSorts: (number | undefined)[] = [];
195
+ for (const term of [data.body, ...data.patterns])
196
+ getFreeVarSorts(manager, term, manager.freeVarBounds[term]).forEach((sort, index) => {
197
+ if (sort !== undefined) usedSorts[index] = sort;
198
+ });
199
+ const numDecls = data.sorts.length;
200
+ if (usedSorts.slice(0, numDecls).filter((sort) => sort !== undefined).length === numDecls) {
201
+ manager.incRef(expr);
202
+ return expr;
203
+ }
204
+ const keptSorts: number[] = [];
205
+ const keptNames: SmtSymbol[] = [];
206
+ data.sorts.forEach((sort, index) => {
207
+ if (usedSorts[numDecls - index - 1] === undefined) return;
208
+ keptSorts.push(sort);
209
+ keptNames.push(data.names[index]);
210
+ });
211
+ // var_mapping: (:var i) becomes the variable it moves to, and an unused variable stays.
212
+ const mapping: number[] = [];
213
+ let numRemoved = 0;
214
+ for (let index = 0; index < Math.max(numDecls, usedSorts.length); index++) {
215
+ const sort = usedSorts[index];
216
+ if (sort === undefined) {
217
+ if (index < numDecls) numRemoved++;
218
+ mapping.push(-1);
219
+ continue;
220
+ }
221
+ const variable = manager.mkVar(index - numRemoved, sort);
222
+ manager.incRef(variable);
223
+ mapping.push(variable);
224
+ }
225
+ mapping.reverse();
226
+ const body = this.subst.apply(data.body, mapping);
227
+ const patterns =
228
+ numRemoved === numDecls
229
+ ? []
230
+ : data.patterns.map((pattern) => this.subst.apply(pattern, mapping));
231
+ const result =
232
+ numRemoved === numDecls
233
+ ? body
234
+ : manager.mkQuantifier({ ...data, sorts: keptSorts, names: keptNames, body, patterns });
235
+ if (result !== body) {
236
+ manager.incRef(result);
237
+ for (const pattern of patterns) manager.decRef(pattern);
238
+ manager.decRef(body);
239
+ }
240
+ for (const variable of mapping) if (variable !== -1) manager.decRef(variable);
241
+ return result;
242
+ });
243
+ }
244
+
245
+ // ~unused_vars_eliminator.
246
+ release() {
247
+ this.subst.release();
248
+ }
249
+ }
250
+
251
+ // elim_unused_vars: unused_vars_eliminator with a var_subst of its own. The result is a temporary.
252
+ export const elimUnusedVars = (manager: AstManager, expr: number) => {
253
+ const eliminator = new UnusedVarsEliminator(manager);
254
+ const result = eliminator.apply(expr);
255
+ eliminator.release();
256
+ manager.releaseLater(result);
257
+ return result;
258
+ };
@@ -0,0 +1,10 @@
1
+ Z3
2
+ Copyright (c) Microsoft Corporation
3
+ All rights reserved.
4
+ MIT License
5
+
6
+ Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
7
+
8
+ The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
9
+
10
+ THE SOFTWARE IS PROVIDED *AS IS*, WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
@@ -0,0 +1,170 @@
1
+ // encode/n_table.ml: the axioms tlapm's SMT encoding can assert, in the order it prints them.
2
+
3
+ import { compareValues } from "../ocaml";
4
+
5
+ // The order of tlapm's Table.tla_axm constructors. OCaml compares constant constructors before
6
+ // those with arguments, so the axioms of an obligation print in this order.
7
+ const CONSTANT_AXIOMS = [
8
+ "ChooseDef",
9
+ "ChooseExt",
10
+ "SetExt",
11
+ "SubsetEqDef",
12
+ "SubsetEqIntro",
13
+ "SubsetEqElim",
14
+ "UnionDef",
15
+ "UnionIntro",
16
+ "UnionElim",
17
+ "SubsetDef",
18
+ "SubsetDefAlt",
19
+ "SubsetIntro",
20
+ "SubsetElim",
21
+ "CupDef",
22
+ "CapDef",
23
+ "SetMinusDef",
24
+ "SetStDef",
25
+ "NatSetDef",
26
+ "IntPlusTyping",
27
+ "IntUminusTyping",
28
+ "IntMinusTyping",
29
+ "IntTimesTyping",
30
+ "IntQuotientTyping",
31
+ "IntRemainderTyping",
32
+ "IntExpTyping",
33
+ "NatPlusTyping",
34
+ "NatTimesTyping",
35
+ "IntRangeDef",
36
+ "NonNegIsPos",
37
+ "LteqReflexive",
38
+ "LteqTransitive",
39
+ "LteqAntisym",
40
+ "FunExt",
41
+ "FunConstrIsafcn",
42
+ "FunSetDef",
43
+ "FunSetIntro",
44
+ "FunSetElim1",
45
+ "FunSetElim2",
46
+ "FunSetImIntro",
47
+ "FunSetSubs",
48
+ "FunDomDef",
49
+ "FunAppDef",
50
+ "FunTyping",
51
+ "FunExceptIsafcn",
52
+ "FunExceptDomDef",
53
+ "FunExceptAppDef1",
54
+ "FunExceptAppDef2",
55
+ "FunExceptTyping",
56
+ "FunImDef",
57
+ "FunImIntro",
58
+ "FunImElim",
59
+ "SeqSetIntro",
60
+ "SeqSetElim1",
61
+ "SeqSetElim2",
62
+ "SeqLenDef",
63
+ "SeqCatTyping",
64
+ "SeqCatLen",
65
+ "SeqCatApp1",
66
+ "SeqCatApp2",
67
+ "SeqAppendTyping",
68
+ "SeqAppendLen",
69
+ "SeqAppendApp1",
70
+ "SeqAppendApp2",
71
+ "SeqHeadDef",
72
+ "SeqTailTyping",
73
+ "SeqTailLen",
74
+ "SeqTailApp",
75
+ "SeqSubseqTyping",
76
+ "SeqSubseqLen",
77
+ "SeqSubseqApp",
78
+ "SeqSelectseqTyping",
79
+ "SeqSelectseqLen",
80
+ "SeqSelectseqNil",
81
+ "SeqSelectseqApp",
82
+ "SeqSelectseqAppend",
83
+ "DisjointTrigger",
84
+ "EmptyComprehensionTrigger",
85
+ "CompareSetOfTrigger",
86
+ ];
87
+
88
+ const BLOCK_AXIOMS = [
89
+ "EnumDef",
90
+ "EnumDefIntro",
91
+ "EnumDefElim",
92
+ "SetOfDef",
93
+ "SetOfIntro",
94
+ "SetOfElim",
95
+ "StrLitIsstr",
96
+ "StrLitDistinct",
97
+ "IntLitIsint",
98
+ "IntLitDistinct",
99
+ "IntLitZeroCmp",
100
+ "TupIsafcn",
101
+ "TupDomDef",
102
+ "TupAppDef",
103
+ "TupExcept",
104
+ "ProductDef",
105
+ "ProductIntro",
106
+ "ProductElim",
107
+ "RecIsafcn",
108
+ "RecDomDef",
109
+ "RecAppDef",
110
+ "RecExcept",
111
+ "RecSetDef",
112
+ "RecSetIntro",
113
+ "RecSetElim",
114
+ "SeqTupTyping",
115
+ "SeqTupLen",
116
+ "CastInj",
117
+ "CastInjAlt",
118
+ "TypeGuard",
119
+ "TypeGuardIntro",
120
+ "TypeGuardElim",
121
+ "Typing",
122
+ "ExtTrigEqDef",
123
+ "ExtTrigEqTrigger",
124
+ "AssertIsSetOf",
125
+ ];
126
+
127
+ // Table.tla_smb's typed constant constructors, which Typing takes, in order.
128
+ export const TYPED_SYMBOLS = [
129
+ "TIntPlus",
130
+ "TIntUminus",
131
+ "TIntMinus",
132
+ "TIntTimes",
133
+ "TIntQuotient",
134
+ "TIntRemainder",
135
+ "TIntLteq",
136
+ ];
137
+
138
+ export type AxiomArgument = number | string | string[];
139
+
140
+ // An axiom without a formula belongs to a second-order symbol. Flattening instantiates it for
141
+ // each use of the symbol, and otherwise it isn't printed.
142
+ export interface Axiom {
143
+ name: string;
144
+ args: AxiomArgument[];
145
+ label: string;
146
+ formula: string | undefined;
147
+ }
148
+
149
+ export const axiom = (
150
+ name: string,
151
+ args: AxiomArgument[],
152
+ formula: string | undefined,
153
+ label?: string,
154
+ ): Axiom => ({
155
+ name,
156
+ args,
157
+ label: label ?? [name, ...args.flat()].join(" "),
158
+ formula,
159
+ });
160
+
161
+ export const getAxiomKey = (entry: Axiom) => `${entry.name} ${JSON.stringify(entry.args)}`;
162
+
163
+ const getAxiomRank = (entry: Axiom) => {
164
+ const constant = CONSTANT_AXIOMS.indexOf(entry.name);
165
+ return constant === -1 ? CONSTANT_AXIOMS.length + BLOCK_AXIOMS.indexOf(entry.name) : constant;
166
+ };
167
+
168
+ // N_axiomatize.TlaAxmSet orders axioms as OCaml's compare does.
169
+ export const compareAxioms = (left: Axiom, right: Axiom) =>
170
+ getAxiomRank(left) - getAxiomRank(right) || compareValues(left.args, right.args);