tla-ts 0.0.4 → 0.0.5-dev.552d313

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 +38 -127
  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 +645 -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,381 @@
1
+ // Ported from Z3 (src/qe/lite/qe_lite_tactic.cpp, src/qe/mbp/mbp_solve_plugin.cpp), MIT license, see
2
+ // z3-license.txt. The qe-lite tactic of Z3's ufnia strategy: each quantifier, innermost first, loses
3
+ // the variables that its body defines by an equality, Fourier-Motzkin elimination removes integer
4
+ // variables that only occur in bounds, and a quantifier over a small integer range becomes a finite
5
+ // disjunction. Like Z3, the port counts references, so that expressions are created and deleted in
6
+ // Z3's order. Arrays, bit-vectors and datatypes are not ported, as tlapm's encoding does not produce
7
+ // them.
8
+ import {
9
+ KIND_QUANTIFIER,
10
+ KIND_VAR,
11
+ OP_AND,
12
+ OP_EQ,
13
+ OP_GE,
14
+ OP_GT,
15
+ OP_LE,
16
+ OP_LT,
17
+ OP_NOT,
18
+ OP_OR,
19
+ SORT_BOOL,
20
+ SORT_INT,
21
+ type AstManager,
22
+ } from "./ast";
23
+ import { flattenAndVector, flattenOrVector, pushNotOwned } from "./ast-util";
24
+ import { isOccurring } from "./der";
25
+ import { ExprSafeReplace } from "./expr-safe-replace";
26
+ import type { Goal } from "./goal";
27
+ import { ObjHashtable } from "./hashtable";
28
+ import { RefVector } from "./ref-vector";
29
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
30
+ import { InvVarShifter, RewriterTpl } from "./rewriter-tpl";
31
+ import { collectUsedVars, VarSubst } from "./var-subst";
32
+ import { assign, assignOwned, release } from "./expr-ref";
33
+ import { EqDer } from "./qe-lite-der";
34
+ import { Fm } from "./qe-lite-fm";
35
+
36
+ // qe_lite's EXPAND_BOUND_LIMIT: the largest integer range that is expanded.
37
+ const EXPAND_BOUND_LIMIT = 10000;
38
+
39
+ // rewriter_tpl with elim_cfg: rewrites the quantifiers bottom-up.
40
+ class ElimStar extends RewriterTpl {
41
+ constructor(
42
+ manager: AstManager,
43
+ private reduce: (expr: number, body: number, patterns: number[]) => number,
44
+ ) {
45
+ super(manager);
46
+ }
47
+
48
+ reduceQuantifier(expr: number, body: number, patterns: number[]) {
49
+ return this.reduce(expr, body, patterns);
50
+ }
51
+ }
52
+
53
+ // qe_lite::impl.
54
+ class QeLite {
55
+ private der: EqDer;
56
+ private fm: Fm;
57
+ private elimStar: ElimStar;
58
+ private rewriter: Rewriter;
59
+
60
+ constructor(private manager: AstManager) {
61
+ this.der = new EqDer(manager);
62
+ this.fm = new Fm(manager);
63
+ this.elimStar = new ElimStar(manager, (expr, body, patterns) =>
64
+ this.reduceQuantifier(expr, body, patterns),
65
+ );
66
+ this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
67
+ }
68
+
69
+ // operator()(expr_ref&): the result comes with a reference, which the caller releases.
70
+ apply(formula: number) {
71
+ return this.elimStar.rewrite(formula);
72
+ }
73
+
74
+ // ~impl.
75
+ release() {
76
+ this.rewriter.release();
77
+ this.elimStar.release();
78
+ this.fm.release();
79
+ this.der.release();
80
+ }
81
+
82
+ // bool_rewriter's mk_and and mk_or, with a reference to the result.
83
+ private mkAnd(args: number[]) {
84
+ return this.manager.withTemporaries(() => this.rewriter.mkAnd(args));
85
+ }
86
+
87
+ private mkOr(args: number[]) {
88
+ return this.manager.withTemporaries(() => this.rewriter.mkOr(args));
89
+ }
90
+
91
+ // elim_cfg::reduce_quantifier.
92
+ private reduceQuantifier(expr: number, body: number, patterns: number[]) {
93
+ const manager = this.manager;
94
+ const data = manager.getQuantifier(expr);
95
+ let result = assign(manager, -1, body);
96
+ if (data.isForall) result = assign(manager, result, manager.mkApp(OP_NOT, [result], SORT_BOOL));
97
+ result = this.reduceFormula(data.sorts.length, result);
98
+ result = this.eliminateDiseqVars(data.sorts, result);
99
+ let expanded = this.tryExpandBoundedQuantifier(data.sorts, result);
100
+ if (expanded !== -1) {
101
+ if (data.isForall) expanded = assignOwned(manager, expanded, pushNotOwned(manager, expanded));
102
+ result = assignOwned(manager, result, this.rewriter.rewrite(expanded));
103
+ manager.decRef(expanded);
104
+ return result;
105
+ }
106
+ if (data.isForall) result = assignOwned(manager, result, pushNotOwned(manager, result));
107
+ const updated = assign(manager, -1, manager.mkQuantifier({ ...data, body: result, patterns }));
108
+ result = assignOwned(manager, result, this.rewriter.rewrite(updated));
109
+ manager.decRef(updated);
110
+ return result;
111
+ }
112
+
113
+ // operator()(index_set, index_of_bound, expr_ref&): each disjunct is a conjunction to reduce. The
114
+ // formula comes with a reference, and so does the result.
115
+ private reduceFormula(numVars: number, formula: number) {
116
+ const manager = this.manager;
117
+ const disjs = new RefVector(manager);
118
+ const conjs = new RefVector(manager);
119
+ disjs.push(formula);
120
+ flattenOrVector(manager, disjs);
121
+ let result = formula;
122
+ const size = disjs.size;
123
+ for (let index = 0; index < size; index++) {
124
+ conjs.reset();
125
+ conjs.push(disjs.items[index]);
126
+ this.reduceConjs(numVars, conjs);
127
+ result = assignOwned(manager, result, this.mkAnd(conjs.items));
128
+ disjs.setOwned(index, result);
129
+ result = -1;
130
+ }
131
+ result = assignOwned(manager, result, this.mkOr(disjs.items));
132
+ conjs.reset();
133
+ disjs.reset();
134
+ return result;
135
+ }
136
+
137
+ // operator()(index_set, index_of_bound, expr_ref_vector&): a single non-ground conjunct is reduced
138
+ // as a disjunction, and otherwise eq_der and fm run.
139
+ private reduceConjs(numVars: number, fmls: RefVector) {
140
+ const manager = this.manager;
141
+ flattenAndVector(manager, fmls);
142
+ const nonGround = fmls.items.flatMap((fml, index) => (manager.isGroundApp(fml) ? [] : [index]));
143
+ if (fmls.size > 1 && nonGround.length === 1) {
144
+ const index = nonGround[0];
145
+ const reduced = this.reduceFormula(numVars, assign(manager, -1, fmls.items[index]));
146
+ fmls.set(index, reduced);
147
+ manager.decRef(reduced);
148
+ return;
149
+ }
150
+ this.der.numVars = numVars;
151
+ this.fm.numVars = numVars;
152
+ this.der.apply(fmls);
153
+ this.fm.apply(fmls);
154
+ // ar_der checks the limit for each formula. tlapm's formulas have no arrays for it to solve.
155
+ for (let index = 0; index < fmls.size; index++) manager.limit.checkpoint();
156
+ }
157
+
158
+ // collect_negative_equalities: whether every occurrence of the variable is in a negative equality
159
+ // with a term without it, or outside any equality.
160
+ private collectNegativeEqualities(
161
+ expr: number,
162
+ index: number,
163
+ isPositive: boolean,
164
+ equalities: ObjHashtable,
165
+ ): boolean {
166
+ const manager = this.manager;
167
+ if (manager.isGroundApp(expr)) return true;
168
+ const kind = manager.kinds[expr];
169
+ if (kind === KIND_VAR) return manager.values[expr] !== index;
170
+ if (kind === KIND_QUANTIFIER) {
171
+ const data = manager.getQuantifier(expr);
172
+ return !isOccurring(manager, index + data.sorts.length, data.body);
173
+ }
174
+ const op = manager.getOp(expr);
175
+ if (manager.isNot(expr))
176
+ return this.collectNegativeEqualities(
177
+ manager.getArg(expr, 0),
178
+ index,
179
+ !isPositive,
180
+ equalities,
181
+ );
182
+ if (op === OP_AND || op === OP_OR)
183
+ return manager.everyArg(expr, (arg) =>
184
+ this.collectNegativeEqualities(arg, index, isPositive, equalities),
185
+ );
186
+ if (op === OP_EQ) {
187
+ const isVarAt = (term: number) =>
188
+ manager.kinds[term] === KIND_VAR && manager.values[term] === index;
189
+ const isLeftVar = isVarAt(manager.getArg(expr, 0));
190
+ if (isLeftVar !== isVarAt(manager.getArg(expr, 1))) {
191
+ const value = isLeftVar ? manager.getArg(expr, 1) : manager.getArg(expr, 0);
192
+ if (!isPositive && !isOccurring(manager, index, value)) {
193
+ equalities.add(expr);
194
+ return true;
195
+ }
196
+ }
197
+ }
198
+ return !isOccurring(manager, index, expr);
199
+ }
200
+
201
+ // eliminate_diseq_vars: an integer variable that occurs only in negative equalities can avoid
202
+ // every value they name, so those equalities are false. The body comes with a reference, and so
203
+ // does the result.
204
+ private eliminateDiseqVars(sorts: number[], body: number) {
205
+ const manager = this.manager;
206
+ const replace = new ExprSafeReplace(manager);
207
+ let isChanged = false;
208
+ for (let index = 0; index < sorts.length; index++) {
209
+ const equalities = new ObjHashtable((key) => manager.hashes[key]);
210
+ if (
211
+ this.collectNegativeEqualities(body, index, true, equalities) &&
212
+ equalities.size > 0 &&
213
+ sorts[sorts.length - index - 1] === SORT_INT
214
+ ) {
215
+ for (const equality of equalities) replace.insert(equality, manager.falseExpr);
216
+ isChanged = true;
217
+ }
218
+ }
219
+ if (!isChanged) {
220
+ replace.release();
221
+ return body;
222
+ }
223
+ const replaced = replace.apply(body);
224
+ const result = assignOwned(manager, body, this.rewriter.rewrite(replaced));
225
+ manager.decRef(replaced);
226
+ replace.release();
227
+ return result;
228
+ }
229
+
230
+ // extract_var_bound: an inclusive integer bound of the variable that a conjunct states.
231
+ private getBound(expr: number, index: number) {
232
+ const manager = this.manager;
233
+ const isNegated = manager.isNot(expr);
234
+ const atom = isNegated ? manager.getArg(expr, 0) : expr;
235
+ const op = manager.getOp(atom);
236
+ if (op !== OP_LE && op !== OP_GE && op !== OP_LT && op !== OP_GT) return undefined;
237
+ const isSwapped = op === OP_GE || op === OP_GT;
238
+ const isStrict = op === OP_LT || op === OP_GT;
239
+ const lhs = manager.getArg(atom, isSwapped ? 1 : 0);
240
+ const rhs = manager.getArg(atom, isSwapped ? 0 : 1);
241
+ if (manager.sorts[lhs] !== SORT_INT) return undefined;
242
+ const isIndex = (term: number) =>
243
+ manager.kinds[term] === KIND_VAR && manager.values[term] === index;
244
+ const isVarOnLeft = isIndex(lhs) && manager.isNumeral(rhs);
245
+ if (!isVarOnLeft && !(isIndex(rhs) && manager.isNumeral(lhs))) return undefined;
246
+ const numeral = manager.getNumeralValue(isVarOnLeft ? rhs : lhs);
247
+ const value = isVarOnLeft
248
+ ? isStrict
249
+ ? numeral - 1n
250
+ : numeral
251
+ : isStrict
252
+ ? numeral + 1n
253
+ : numeral;
254
+ if (!isNegated) return { isLower: !isVarOnLeft, value };
255
+ return { isLower: isVarOnLeft, value: isVarOnLeft ? value + 1n : value - 1n };
256
+ }
257
+
258
+ // try_expand_bounded_quantifier: the disjunction of the body over every value of the integer
259
+ // variables when their ranges are small, with a reference, or -1.
260
+ private tryExpandBoundedQuantifier(sorts: number[], body: number) {
261
+ const manager = this.manager;
262
+ const numDecls = sorts.length;
263
+ if (numDecls === 0) return -1;
264
+ const used = collectUsedVars(manager, body, numDecls);
265
+ const remaining = used.flatMap((isUsed, index) => (isUsed ? [index] : []));
266
+ if (remaining.length === 0) return -1;
267
+ // Z3 checks the declaration at position i for the variable with de Bruijn index i, which is
268
+ // another variable's sort. This port checks the variable's own sort.
269
+ if (remaining.some((index) => sorts[numDecls - 1 - index] !== SORT_INT)) return -1;
270
+ const conjs = new RefVector(manager);
271
+ conjs.push(body);
272
+ flattenAndVector(manager, conjs);
273
+ const lowers: (bigint | undefined)[] = [];
274
+ const uppers: (bigint | undefined)[] = [];
275
+ const isBoundConj = conjs.items.map((conj) => {
276
+ let isBound = false;
277
+ for (const index of remaining) {
278
+ const bound = this.getBound(conj, index);
279
+ if (bound === undefined) continue;
280
+ const bounds = bound.isLower ? lowers : uppers;
281
+ const old = bounds[index];
282
+ if (old === undefined || (bound.isLower ? bound.value > old : bound.value < old))
283
+ bounds[index] = bound.value;
284
+ isBound = true;
285
+ }
286
+ return isBound;
287
+ });
288
+ let domainSize = 1n;
289
+ for (const index of remaining) {
290
+ const lower = lowers[index];
291
+ const upper = uppers[index];
292
+ if (lower === undefined || upper === undefined) {
293
+ conjs.reset();
294
+ return -1;
295
+ }
296
+ const size = upper - lower + 1n;
297
+ if (size <= 0n) {
298
+ conjs.reset();
299
+ return assign(manager, -1, manager.falseExpr);
300
+ }
301
+ domainSize *= size;
302
+ if (domainSize > EXPAND_BOUND_LIMIT) {
303
+ conjs.reset();
304
+ return -1;
305
+ }
306
+ }
307
+ const payload = new RefVector(manager);
308
+ conjs.items.forEach((conj, position) => {
309
+ if (!isBoundConj[position]) payload.push(conj);
310
+ });
311
+ const substMap = new RefVector(manager);
312
+ substMap.resize(numDecls);
313
+ // Like Z3, an unused variable keeps the sort of the declaration at its index.
314
+ for (let index = 0; index < numDecls; index++)
315
+ if (!used[index]) substMap.set(index, manager.mkVar(index, sorts[index]));
316
+ const values = remaining.map((index) => lowers[index] ?? 0n);
317
+ const subst = new VarSubst(manager, false);
318
+ const shifter = new InvVarShifter(manager);
319
+ const disjuncts = new RefVector(manager);
320
+ for (;;) {
321
+ remaining.forEach((index, position) => {
322
+ substMap.set(index, manager.mkNumeral(values[position]));
323
+ });
324
+ const instConjs = new RefVector(manager);
325
+ for (const conj of payload.items) {
326
+ let instance = subst.apply(conj, substMap.items);
327
+ instance = assignOwned(manager, instance, shifter.shift(instance, numDecls));
328
+ instConjs.push(instance);
329
+ manager.decRef(instance);
330
+ }
331
+ const instBody = this.mkAnd(instConjs.items);
332
+ disjuncts.push(instBody);
333
+ manager.decRef(instBody);
334
+ instConjs.reset();
335
+ // The rightmost variable moves first.
336
+ let position = remaining.length - 1;
337
+ for (; position >= 0; position--) {
338
+ values[position]++;
339
+ if (values[position] <= (uppers[remaining[position]] ?? 0n)) break;
340
+ values[position] = lowers[remaining[position]] ?? 0n;
341
+ }
342
+ if (position < 0) break;
343
+ }
344
+ const result = this.mkOr(disjuncts.items);
345
+ disjuncts.reset();
346
+ shifter.release();
347
+ subst.release();
348
+ substMap.reset();
349
+ payload.reset();
350
+ conjs.reset();
351
+ return result;
352
+ }
353
+ }
354
+
355
+ // qe_lite_simplifier::reduce in a dependent_expr_state_tactic, on each formula with a quantifier.
356
+ // The tactic's m_dep holds the formula it read last, until the tactic is done.
357
+ export const applyQeLite = (manager: AstManager, goal: Goal) => {
358
+ const qe = new QeLite(manager);
359
+ let dep = -1;
360
+ for (const form of goal.forms.items) dep = assign(manager, dep, form);
361
+ if (goal.forms.items.some((form) => manager.hasQuantifierFlags[form])) {
362
+ let formula = -1;
363
+ const size = goal.forms.size;
364
+ for (let index = 0; index < size && !goal.isInconsistent; index++) {
365
+ const form = goal.forms.items[index];
366
+ dep = assign(manager, dep, form);
367
+ if (manager.hasQuantifierFlags[form]) {
368
+ formula = assign(manager, formula, form);
369
+ formula = assignOwned(manager, formula, qe.apply(formula));
370
+ if (formula !== form) goal.update(index, formula);
371
+ }
372
+ // The iterator of the simplifier's indices counts a step after each formula.
373
+ manager.limit.checkpoint();
374
+ }
375
+ release(manager, formula);
376
+ }
377
+ goal.elimTrue();
378
+ goal.elimRedundancies();
379
+ qe.release();
380
+ release(manager, dep);
381
+ };