tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (586) hide show
  1. package/README.md +2 -1
  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 +37 -0
  8. package/dist/index.d.ts +37 -0
  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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,572 @@
1
+ import { SmtInvariantError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ OP_DT_ACCESSOR,
5
+ OP_DT_CONSTRUCTOR,
6
+ OP_DT_IS,
7
+ OP_DT_RECOGNISER,
8
+ OP_DT_UPDATE_FIELD,
9
+ SORT_BOOL,
10
+ SORT_SIZE_INFINITE,
11
+ SORT_SIZE_VERY_BIG,
12
+ } from "./ast";
13
+ import { stringHash } from "./hash";
14
+ import { RandomGen } from "./random-gen";
15
+
16
+ export interface AccessorDef {
17
+ name: string;
18
+ // A sort, or -1 - i for the i-th datatype of the declaration until it exists.
19
+ range: number;
20
+ }
21
+
22
+ export interface ConstructorDef {
23
+ name: string;
24
+ recognizer: string;
25
+ accessors: AccessorDef[];
26
+ }
27
+
28
+ const SIZE_OFFSET = 0;
29
+ const SIZE_PARAMETER = 1;
30
+ const SIZE_PLUS = 2;
31
+ const SIZE_TIMES = 3;
32
+ const SIZE_POWER = 4;
33
+
34
+ interface SizeTerm {
35
+ kind: number;
36
+ size: bigint;
37
+ index: number;
38
+ args: SizeTerm[];
39
+ }
40
+
41
+ export interface DatatypeDef {
42
+ name: string;
43
+ classId: number;
44
+ parameters: number[];
45
+ constructors: ConstructorDef[];
46
+ sort: number;
47
+ size: SizeTerm | undefined;
48
+ isRecursive: boolean;
49
+ }
50
+
51
+ const MAX_FINITE_SIZE = 1n << 64n;
52
+
53
+ const mkSizeTerm = (kind: number, size: bigint, index: number, args: SizeTerm[]): SizeTerm => ({
54
+ kind,
55
+ size,
56
+ index,
57
+ args,
58
+ });
59
+
60
+ const mkOffset = (size: bigint) => mkSizeTerm(SIZE_OFFSET, size, 0, []);
61
+
62
+ const mkFold = (kind: number, args: SizeTerm[], empty: bigint) =>
63
+ args.length === 0
64
+ ? mkOffset(empty)
65
+ : args.slice(1).reduce((left, right) => mkSizeTerm(kind, 0n, 0, [left, right]), args[0]);
66
+
67
+ const isInfiniteOrVeryBig = (size: bigint) =>
68
+ size === SORT_SIZE_INFINITE || size === SORT_SIZE_VERY_BIG;
69
+
70
+ const toSortSize = (size: bigint) => (size >= MAX_FINITE_SIZE ? SORT_SIZE_VERY_BIG : size);
71
+
72
+ const evalSize = (term: SizeTerm, parameterSizes: bigint[]): bigint => {
73
+ if (term.kind === SIZE_OFFSET) return term.size;
74
+ if (term.kind === SIZE_PARAMETER) return parameterSizes[term.index];
75
+ if (term.kind === SIZE_PLUS) {
76
+ let sum = 0n;
77
+ const todo = [term.args[0], term.args[1]];
78
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
79
+ if (current.kind === SIZE_PLUS) {
80
+ todo.push(current.args[0], current.args[1]);
81
+ continue;
82
+ }
83
+ const size = evalSize(current, parameterSizes);
84
+ if (isInfiniteOrVeryBig(size)) return size;
85
+ sum += size;
86
+ }
87
+ return toSortSize(sum);
88
+ }
89
+ const first = evalSize(term.args[0], parameterSizes);
90
+ const second = evalSize(term.args[1], parameterSizes);
91
+ if (first === SORT_SIZE_INFINITE) return first;
92
+ if (second === SORT_SIZE_INFINITE) return second;
93
+ if (first === SORT_SIZE_VERY_BIG) return first;
94
+ if (second === SORT_SIZE_VERY_BIG) return second;
95
+ if (term.kind === SIZE_TIMES) return toSortSize(first * second);
96
+ if (first === 1n || second === 1n) return first;
97
+ if (first > 2n << 20n || second > 10n) return SORT_SIZE_VERY_BIG;
98
+ return toSortSize(first ** second);
99
+ };
100
+
101
+ const getSymbolHash = (name: string) => stringHash(name, 17);
102
+
103
+ export const getDatatypeDef = (manager: AstManager, sort: number) =>
104
+ manager.datatypeDefs.get(manager.sortNames[sort]);
105
+
106
+ const getDef = (manager: AstManager, sort: number) => {
107
+ const def = getDatatypeDef(manager, sort);
108
+ if (def === undefined) throw new SmtInvariantError("datatype constructors have not been created");
109
+ return def;
110
+ };
111
+
112
+ export const mkDatatypeSort = (manager: AstManager, name: string, parameters: number[]) => {
113
+ const sort = manager.mkDatatypeSort(name, parameters);
114
+ const def = manager.datatypeDefs.get(name);
115
+ if (def?.size !== undefined && def.parameters.length === parameters.length)
116
+ manager.setSortSize(
117
+ sort,
118
+ evalSize(
119
+ def.size,
120
+ parameters.map((parameter) => manager.getSortSize(parameter)),
121
+ ),
122
+ );
123
+ return sort;
124
+ };
125
+
126
+ export const substituteSort = (
127
+ manager: AstManager,
128
+ sort: number,
129
+ from: readonly number[],
130
+ to: readonly number[],
131
+ ): number => {
132
+ const index = from.indexOf(sort);
133
+ if (index !== -1) return to[index];
134
+ const parameters = manager.getSortParameters(sort);
135
+ if (parameters.length === 0) return sort;
136
+ const substituted = parameters.map((parameter) => substituteSort(manager, parameter, from, to));
137
+ if (manager.isArraySort(sort)) return manager.mkArraySort(substituted);
138
+ if (manager.isSeqSort(sort)) return manager.mkSeqSort(substituted[0]);
139
+ if (manager.isReSort(sort)) return manager.mkReSort(substituted[0]);
140
+ const name = manager.sortNames[sort];
141
+ if (!manager.isDatatypeSort(sort)) return manager.mkUninterpretedSort(name, substituted);
142
+ const result = manager.mkDatatypeSort(name, substituted);
143
+ if (manager.getSortSize(result) === SORT_SIZE_INFINITE)
144
+ manager.setSortSize(result, manager.getSortSize(sort));
145
+ return result;
146
+ };
147
+
148
+ const instantiateDef = (manager: AstManager, def: DatatypeDef, sorts: readonly number[]) => {
149
+ if (def.sort === -1) def.sort = mkDatatypeSort(manager, def.name, def.parameters);
150
+ return sorts.length === 0 ? def.sort : substituteSort(manager, def.sort, def.parameters, sorts);
151
+ };
152
+
153
+ const getSubsorts = (manager: AstManager, sort: number, result: number[]) => {
154
+ result.push(sort);
155
+ for (const parameter of manager.getSortParameters(sort)) getSubsorts(manager, parameter, result);
156
+ return result;
157
+ };
158
+
159
+ const isWellFounded = (manager: AstManager, defs: DatatypeDef[], sorts: number[]) => {
160
+ const isWellFoundedDef = defs.map(() => false);
161
+ let numWellFounded = 0;
162
+ for (let isChanged = true; isChanged && numWellFounded < defs.length;) {
163
+ isChanged = false;
164
+ defs.forEach((def, index) => {
165
+ if (isWellFoundedDef[index]) return;
166
+ const hasGroundedConstructor = def.constructors.some((constructor) =>
167
+ constructor.accessors.every((accessor) => {
168
+ for (const subsort of getSubsorts(manager, accessor.range, [])) {
169
+ const sortIndex = sorts.indexOf(subsort);
170
+ if (sortIndex !== -1) {
171
+ if (!isWellFoundedDef[sortIndex]) return false;
172
+ } else if (manager.isDatatypeSort(subsort)) break;
173
+ }
174
+ return true;
175
+ }),
176
+ );
177
+ if (!hasGroundedConstructor) return;
178
+ isChanged = true;
179
+ isWellFoundedDef[index] = true;
180
+ numWellFounded++;
181
+ });
182
+ }
183
+ return numWellFounded === defs.length;
184
+ };
185
+
186
+ const isCovariant = (manager: AstManager, defs: DatatypeDef[], sorts: number[]) =>
187
+ defs.every((def) =>
188
+ def.constructors.every((constructor) =>
189
+ constructor.accessors.every((accessor) => {
190
+ const range = accessor.range;
191
+ if (!manager.isArraySort(range)) return true;
192
+ const parameters = manager.getSortParameters(range);
193
+ const subsorts: number[] = [];
194
+ for (const domain of parameters.slice(0, -1)) getSubsorts(manager, domain, subsorts);
195
+ const arrayRange = manager.getArrayRange(range);
196
+ if (!manager.isDatatypeSort(arrayRange)) getSubsorts(manager, arrayRange, subsorts);
197
+ return subsorts.every((subsort) => !sorts.includes(subsort));
198
+ }),
199
+ ),
200
+ );
201
+
202
+ const isRecursiveDef = (manager: AstManager, start: DatatypeDef) => {
203
+ const isBlack = new Map<string, boolean>();
204
+ const todo = [start.sort];
205
+ while (todo.length > 0) {
206
+ const sort = todo[todo.length - 1];
207
+ const name = manager.sortNames[sort];
208
+ if (isBlack.get(name) === true) {
209
+ todo.pop();
210
+ continue;
211
+ }
212
+ const def = manager.datatypeDefs.get(name);
213
+ if (def === undefined) return true;
214
+ isBlack.set(name, false);
215
+ let canProcess = true;
216
+ for (const constructor of def.constructors)
217
+ for (const accessor of constructor.accessors)
218
+ for (const subsort of getSubsorts(manager, accessor.range, [])) {
219
+ if (!manager.isDatatypeSort(subsort)) continue;
220
+ const status = isBlack.get(manager.sortNames[subsort]);
221
+ if (status === false && manager.sortNames[subsort] === start.name) return true;
222
+ if (status !== undefined) continue;
223
+ todo.push(subsort);
224
+ canProcess = false;
225
+ }
226
+ if (!canProcess) continue;
227
+ isBlack.set(name, true);
228
+ todo.pop();
229
+ }
230
+ return false;
231
+ };
232
+
233
+ const getSortSizeTerm = (
234
+ manager: AstManager,
235
+ parameters: number[],
236
+ sort: number,
237
+ ): SizeTerm | undefined => {
238
+ if (parameters.length === 0 && !manager.isDatatypeSort(sort))
239
+ return mkOffset(manager.getSortSize(sort));
240
+ if (manager.isDatatypeSort(sort)) {
241
+ const def = getDatatypeDef(manager, sort);
242
+ if (def === undefined) return undefined;
243
+ const substitution = manager
244
+ .getSortParameters(sort)
245
+ .map((parameter) => getSortSizeTerm(manager, parameters, parameter));
246
+ if (def.size === undefined) def.size = mkOffset(SORT_SIZE_INFINITE);
247
+ return substituteSize(def.size, substitution);
248
+ }
249
+ if (manager.isArraySort(sort)) {
250
+ const sortParameters = manager.getSortParameters(sort);
251
+ const domainSizes = sortParameters
252
+ .slice(0, -1)
253
+ .map((domain) => getSortSizeTerm(manager, parameters, domain));
254
+ const rangeSize = getSortSizeTerm(manager, parameters, manager.getArrayRange(sort));
255
+ if (rangeSize === undefined || domainSizes.some((size) => size === undefined)) return undefined;
256
+ return mkSizeTerm(SIZE_POWER, 0n, 0, [
257
+ rangeSize,
258
+ mkFold(
259
+ SIZE_TIMES,
260
+ domainSizes.flatMap((size) => (size === undefined ? [] : [size])),
261
+ 1n,
262
+ ),
263
+ ]);
264
+ }
265
+ const index = parameters.indexOf(sort);
266
+ if (index !== -1) return mkSizeTerm(SIZE_PARAMETER, 0n, index, []);
267
+ return mkOffset(manager.getSortSize(sort));
268
+ };
269
+
270
+ const substituteSize = (term: SizeTerm, substitution: (SizeTerm | undefined)[]): SizeTerm => {
271
+ if (term.kind === SIZE_OFFSET) return term;
272
+ if (term.kind === SIZE_PARAMETER) return substitution[term.index] ?? mkOffset(SORT_SIZE_INFINITE);
273
+ return mkSizeTerm(
274
+ term.kind,
275
+ 0n,
276
+ 0,
277
+ term.args.map((arg) => substituteSize(arg, substitution)),
278
+ );
279
+ };
280
+
281
+ const computeSizeFunctions = (manager: AstManager, names: string[]) => {
282
+ const isBlack = new Map<string, boolean>();
283
+ const todo = [...names];
284
+ while (todo.length > 0) {
285
+ const name = todo[todo.length - 1];
286
+ if (isBlack.get(name) === true) {
287
+ todo.pop();
288
+ continue;
289
+ }
290
+ isBlack.set(name, false);
291
+ let isInfinite = false;
292
+ let canProcess = true;
293
+ const def = manager.datatypeDefs.get(name);
294
+ if (def === undefined) return;
295
+ for (const constructor of def.constructors)
296
+ for (const accessor of constructor.accessors) {
297
+ if (!manager.isDatatypeSort(accessor.range)) continue;
298
+ const rangeName = manager.sortNames[accessor.range];
299
+ const status = isBlack.get(rangeName);
300
+ if (status === false) isInfinite = true;
301
+ else if (status === undefined && names.includes(rangeName)) {
302
+ todo.push(rangeName);
303
+ canProcess = false;
304
+ }
305
+ }
306
+ if (!canProcess) continue;
307
+ todo.pop();
308
+ isBlack.set(name, true);
309
+ if (isInfinite) {
310
+ def.size = mkOffset(SORT_SIZE_INFINITE);
311
+ continue;
312
+ }
313
+ def.size = mkFold(
314
+ SIZE_PLUS,
315
+ def.constructors.map((constructor) =>
316
+ mkFold(
317
+ SIZE_TIMES,
318
+ constructor.accessors.flatMap((accessor) => {
319
+ const size = getSortSizeTerm(manager, def.parameters, accessor.range);
320
+ return size === undefined ? [] : [size];
321
+ }),
322
+ 1n,
323
+ ),
324
+ ),
325
+ 0n,
326
+ );
327
+ }
328
+ };
329
+
330
+ const resetDeclarations = (manager: AstManager) => {
331
+ manager.datatypeConstructors = [];
332
+ manager.constructorAccessors = [];
333
+ manager.constructorRecognizers = [];
334
+ manager.nonRecConstructors = [];
335
+ manager.nonRecDepths = [];
336
+ };
337
+
338
+ export const removeDatatype = (manager: AstManager, name: string) => {
339
+ manager.datatypeDefs.delete(name);
340
+ resetDeclarations(manager);
341
+ };
342
+
343
+ export const mkDatatypeDef = (
344
+ manager: AstManager,
345
+ name: string,
346
+ parameters: number[],
347
+ constructors: ConstructorDef[],
348
+ ): DatatypeDef => ({
349
+ name,
350
+ classId: manager.datatypeDefs.size,
351
+ parameters,
352
+ constructors,
353
+ sort: -1,
354
+ size: undefined,
355
+ isRecursive: false,
356
+ });
357
+
358
+ export const mkDatatypes = (manager: AstManager, defs: DatatypeDef[]): number[] | string => {
359
+ for (const def of defs) {
360
+ if (manager.datatypeDefs.has(def.name)) resetDeclarations(manager);
361
+ manager.datatypeDefs.set(def.name, def);
362
+ }
363
+ const sorts = defs.map((def) => instantiateDef(manager, def, []));
364
+ for (const def of defs)
365
+ for (const constructor of def.constructors)
366
+ for (const accessor of constructor.accessors)
367
+ if (accessor.range < 0) accessor.range = sorts[-1 - accessor.range];
368
+ if (!isWellFounded(manager, defs, sorts)) return "datatype is not well-founded";
369
+ if (!isCovariant(manager, defs, sorts)) return "datatype is not co-variant";
370
+ if (
371
+ defs.some((def) =>
372
+ def.constructors.some((constructor) =>
373
+ constructor.accessors.some(
374
+ (accessor) =>
375
+ manager.isArraySort(accessor.range) &&
376
+ sorts.includes(manager.getArrayRange(accessor.range)),
377
+ ),
378
+ ),
379
+ )
380
+ )
381
+ manager.hasNestedRecDatatype = true;
382
+ computeSizeFunctions(
383
+ manager,
384
+ defs.map((def) => def.name),
385
+ );
386
+ for (const def of defs) mkDatatypeSort(manager, def.name, def.parameters);
387
+ for (const def of defs) def.isRecursive = isRecursiveDef(manager, def);
388
+ return sorts;
389
+ };
390
+
391
+ const getConstructorDef = (manager: AstManager, constructor: number) =>
392
+ getDef(manager, manager.funcDecls[constructor].range).constructors[
393
+ manager.funcDecls[constructor].parameters[0]
394
+ ];
395
+
396
+ export const instantiateAccessor = (
397
+ manager: AstManager,
398
+ sort: number,
399
+ constructorIndex: number,
400
+ index: number,
401
+ ) => {
402
+ const def = getDef(manager, sort);
403
+ const constructor = def.constructors[constructorIndex];
404
+ const accessor = constructor.accessors[index];
405
+ return manager.mkDatatypeDecl(
406
+ OP_DT_ACCESSOR,
407
+ accessor.name,
408
+ [constructorIndex, index],
409
+ [getSymbolHash(accessor.name), getSymbolHash(constructor.name)],
410
+ [sort],
411
+ substituteSort(manager, accessor.range, def.parameters, manager.getSortParameters(sort)),
412
+ );
413
+ };
414
+
415
+ export const getDatatypeConstructors = (manager: AstManager, sort: number) => {
416
+ const existing = manager.datatypeConstructors[sort];
417
+ if (existing !== undefined) return existing;
418
+ const def = getDef(manager, sort);
419
+ const parameters = manager.getSortParameters(sort);
420
+ const constructors = def.constructors.map((constructor, index) =>
421
+ manager.mkDatatypeDecl(
422
+ OP_DT_CONSTRUCTOR,
423
+ constructor.name,
424
+ [index],
425
+ [getSymbolHash(constructor.name)],
426
+ constructor.accessors.map((accessor) =>
427
+ substituteSort(manager, accessor.range, def.parameters, parameters),
428
+ ),
429
+ instantiateDef(manager, def, parameters),
430
+ ),
431
+ );
432
+ manager.datatypeConstructors[sort] = constructors;
433
+ return constructors;
434
+ };
435
+
436
+ export const getConstructorAccessors = (manager: AstManager, constructor: number) => {
437
+ const existing = manager.constructorAccessors[constructor];
438
+ if (existing !== undefined) return existing;
439
+ const funcDecl = manager.funcDecls[constructor];
440
+ const accessors = getConstructorDef(manager, constructor).accessors.map((_accessor, index) =>
441
+ instantiateAccessor(manager, funcDecl.range, funcDecl.parameters[0], index),
442
+ );
443
+ manager.constructorAccessors[constructor] = accessors;
444
+ return accessors;
445
+ };
446
+
447
+ export const getConstructorRecognizer = (manager: AstManager, constructor: number) => {
448
+ const existing = manager.constructorRecognizers[constructor];
449
+ if (existing !== undefined) return existing;
450
+ const name = getConstructorDef(manager, constructor).recognizer;
451
+ const recognizer = manager.mkDatatypeDecl(
452
+ OP_DT_RECOGNISER,
453
+ name,
454
+ [constructor],
455
+ [manager.getDeclHash(constructor), getSymbolHash(name)],
456
+ [manager.funcDecls[constructor].range],
457
+ SORT_BOOL,
458
+ );
459
+ manager.constructorRecognizers[constructor] = recognizer;
460
+ return recognizer;
461
+ };
462
+
463
+ export const getConstructorIs = (manager: AstManager, constructor: number) =>
464
+ manager.mkDatatypeDecl(
465
+ OP_DT_IS,
466
+ "is",
467
+ [constructor],
468
+ [manager.getDeclHash(constructor)],
469
+ [manager.funcDecls[constructor].range],
470
+ SORT_BOOL,
471
+ );
472
+
473
+ export const mkUpdateField = (manager: AstManager, accessor: number) => {
474
+ const funcDecl = manager.funcDecls[accessor];
475
+ return manager.mkDatatypeDecl(
476
+ OP_DT_UPDATE_FIELD,
477
+ "update-field",
478
+ [accessor],
479
+ [manager.getDeclHash(accessor)],
480
+ [funcDecl.domain[0], funcDecl.range],
481
+ funcDecl.domain[0],
482
+ );
483
+ };
484
+
485
+ export const getAccessorConstructor = (manager: AstManager, accessor: number) => {
486
+ const funcDecl = manager.funcDecls[accessor];
487
+ return getDatatypeConstructors(manager, funcDecl.domain[0])[funcDecl.parameters[0]];
488
+ };
489
+
490
+ export const getConstructorIndex = (manager: AstManager, constructor: number) =>
491
+ manager.funcDecls[constructor].parameters[0];
492
+
493
+ export const getRecognizerConstructor = (manager: AstManager, recognizer: number) =>
494
+ manager.funcDecls[recognizer].parameters[0];
495
+
496
+ export const getNumConstructors = (manager: AstManager, sort: number) =>
497
+ getDatatypeDef(manager, sort)?.constructors.length ?? 0;
498
+
499
+ export const isRecursiveDatatype = (manager: AstManager, sort: number) =>
500
+ getDatatypeDef(manager, sort)?.isRecursive ?? true;
501
+
502
+ export const instantiateConstructor = (
503
+ manager: AstManager,
504
+ def: DatatypeDef,
505
+ index: number,
506
+ parameters: number[],
507
+ ) => getDatatypeConstructors(manager, instantiateDef(manager, def, parameters))[index];
508
+
509
+ const getArrayRangeRec = (manager: AstManager, sort: number) => {
510
+ let current = sort;
511
+ while (manager.isArraySort(current)) current = manager.getArrayRange(current);
512
+ return current;
513
+ };
514
+
515
+ const isRecursiveNested = (manager: AstManager, sort: number) => {
516
+ if (!manager.isArraySort(sort)) return false;
517
+ const range = getArrayRangeRec(manager, sort);
518
+ return manager.isDatatypeSort(range) && isRecursiveDatatype(manager, range);
519
+ };
520
+
521
+ const getNonRecConstructorCore = (
522
+ manager: AstManager,
523
+ sort: number,
524
+ forbidden: number[],
525
+ ): { constructor: number; depth: number } => {
526
+ const constructors = getDatatypeConstructors(manager, sort);
527
+ const found = manager.nonRecConstructors[sort];
528
+ if (found !== undefined) return { constructor: found, depth: manager.nonRecDepths[sort] };
529
+ const remember = (constructor: number, depth: number) => {
530
+ manager.nonRecConstructors[sort] = constructor;
531
+ manager.nonRecDepths[sort] = depth;
532
+ return { constructor, depth };
533
+ };
534
+ const random = new RandomGen(manager.getSortSmallId(sort));
535
+ const start = random.next();
536
+ for (let offset = 0; offset < constructors.length; offset++) {
537
+ const constructor = constructors[(start + offset) % constructors.length];
538
+ if (
539
+ manager.funcDecls[constructor].domain.every(
540
+ (argSort) => !manager.isDatatypeSort(argSort) && !isRecursiveNested(manager, argSort),
541
+ )
542
+ )
543
+ return remember(constructor, 1);
544
+ }
545
+ let result = -1;
546
+ let minDepth = Number.MAX_SAFE_INTEGER;
547
+ for (let offset = 0; offset < constructors.length; offset++) {
548
+ const constructor = constructors[(start + offset) % constructors.length];
549
+ const domain = manager.funcDecls[constructor].domain;
550
+ const argStart = random.next();
551
+ let maxDepth = 0;
552
+ let argOffset = 0;
553
+ for (; argOffset < domain.length; argOffset++) {
554
+ const argSort = getArrayRangeRec(manager, domain[(argStart + argOffset) % domain.length]);
555
+ if (!manager.isDatatypeSort(argSort)) continue;
556
+ if (forbidden.includes(argSort)) break;
557
+ forbidden.push(argSort);
558
+ const nested = getNonRecConstructorCore(manager, argSort, forbidden);
559
+ forbidden.pop();
560
+ if (nested.constructor === -1) break;
561
+ maxDepth = Math.max(nested.depth + 1, maxDepth);
562
+ }
563
+ if (argOffset === domain.length && maxDepth < minDepth) {
564
+ result = constructor;
565
+ minDepth = maxDepth;
566
+ }
567
+ }
568
+ return result === -1 ? { constructor: -1, depth: 0 } : remember(result, minDepth);
569
+ };
570
+
571
+ export const getNonRecConstructor = (manager: AstManager, sort: number) =>
572
+ getNonRecConstructorCore(manager, sort, [sort]).constructor;
@@ -0,0 +1,82 @@
1
+ import {
2
+ type AstManager,
3
+ KIND_APP,
4
+ OP_DT_ACCESSOR,
5
+ OP_DT_CONSTRUCTOR,
6
+ OP_DT_IS,
7
+ OP_DT_RECOGNISER,
8
+ OP_DT_UPDATE_FIELD,
9
+ } from "./ast";
10
+ import {
11
+ getAccessorConstructor,
12
+ getConstructorIs,
13
+ getNumConstructors,
14
+ getRecognizerConstructor,
15
+ } from "./datatype-decl-plugin";
16
+ import type { Rewrite } from "./rewriter-tpl";
17
+
18
+ const isAppOf = (manager: AstManager, expr: number, op: number) =>
19
+ manager.kinds[expr] === KIND_APP && manager.getOp(expr) === op;
20
+
21
+ export const mkDatatypeAppCore = (
22
+ manager: AstManager,
23
+ decl: number,
24
+ args: number[],
25
+ ): number | Rewrite | undefined => {
26
+ const funcDecl = manager.funcDecls[decl];
27
+ const arg = args[0];
28
+ if (funcDecl.op === OP_DT_RECOGNISER)
29
+ return {
30
+ expr: manager.mkApp(
31
+ getConstructorIs(manager, getRecognizerConstructor(manager, decl)),
32
+ [arg],
33
+ funcDecl.range,
34
+ ),
35
+ depth: 1,
36
+ };
37
+ if (funcDecl.op === OP_DT_IS) {
38
+ if (getNumConstructors(manager, manager.sorts[arg]) === 1) return manager.trueExpr;
39
+ if (isAppOf(manager, arg, OP_DT_UPDATE_FIELD))
40
+ return { expr: manager.mkApp(decl, [manager.getArg(arg, 0)], funcDecl.range), depth: 1 };
41
+ if (!isAppOf(manager, arg, OP_DT_CONSTRUCTOR)) return undefined;
42
+ return manager.decls[arg] === getRecognizerConstructor(manager, decl)
43
+ ? manager.trueExpr
44
+ : manager.falseExpr;
45
+ }
46
+ if (funcDecl.op === OP_DT_ACCESSOR) {
47
+ if (manager.kinds[arg] !== KIND_APP) return undefined;
48
+ if (
49
+ isAppOf(manager, arg, OP_DT_UPDATE_FIELD) &&
50
+ getNumConstructors(manager, manager.sorts[arg]) === 1
51
+ ) {
52
+ if (manager.funcDecls[manager.decls[arg]].parameters[0] === decl)
53
+ return manager.getArg(arg, 1);
54
+ return { expr: manager.mkApp(decl, [manager.getArg(arg, 0)], funcDecl.range), depth: 1 };
55
+ }
56
+ if (!isAppOf(manager, arg, OP_DT_CONSTRUCTOR)) return undefined;
57
+ if (manager.decls[arg] !== getAccessorConstructor(manager, decl)) return undefined;
58
+ return manager.getArg(arg, funcDecl.parameters[1]);
59
+ }
60
+ if (funcDecl.op !== OP_DT_UPDATE_FIELD || !isAppOf(manager, arg, OP_DT_CONSTRUCTOR))
61
+ return undefined;
62
+ const accessor = funcDecl.parameters[0];
63
+ if (manager.decls[arg] !== getAccessorConstructor(manager, accessor)) return arg;
64
+ const position = manager.funcDecls[accessor].parameters[1];
65
+ return manager.mkApp(
66
+ manager.decls[arg],
67
+ manager.mapArgs(arg, (field, index) => (index === position ? args[1] : field)),
68
+ manager.sorts[arg],
69
+ );
70
+ };
71
+
72
+ export const mkDatatypeEqCore = (
73
+ manager: AstManager,
74
+ lhs: number,
75
+ rhs: number,
76
+ ): number | Rewrite | undefined => {
77
+ if (!isAppOf(manager, lhs, OP_DT_CONSTRUCTOR) || !isAppOf(manager, rhs, OP_DT_CONSTRUCTOR))
78
+ return undefined;
79
+ if (manager.decls[lhs] !== manager.decls[rhs]) return manager.falseExpr;
80
+ const eqs = manager.mapArgs(lhs, (arg, index) => manager.mkEq(arg, manager.getArg(rhs, index)));
81
+ return { expr: manager.mkAnd(eqs), depth: 2 };
82
+ };