tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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 (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  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 +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,121 @@
1
+ import {
2
+ type AstManager,
3
+ OP_ADD,
4
+ OP_GE,
5
+ OP_LE,
6
+ OP_MUL,
7
+ OP_TO_REAL,
8
+ SORT_BOOL,
9
+ SORT_INT,
10
+ SORT_REAL,
11
+ } from "./ast";
12
+ import { getIdentityHash, ObjMap } from "./hashtable";
13
+ import type { LarSolver } from "./lp/lar-solver";
14
+ import type { LarTerm } from "./lp/lar-term";
15
+ import { getGcd, getLcm, Rational } from "./rational";
16
+
17
+ // term2coeffs: the term over the theory variables of its columns, with nested terms expanded.
18
+ export const getTermCoeffs = (solver: LarSolver, term: LarTerm) => {
19
+ const coeffs = new ObjMap<Rational>(getIdentityHash);
20
+ const visit = (current: LarTerm, coeff: Rational) => {
21
+ for (const entry of current.coeffs) {
22
+ if (solver.hasTerm(entry[0])) {
23
+ visit(solver.getTerm(entry[0]), coeff.mul(entry[1]));
24
+ continue;
25
+ }
26
+ const thVar = solver.getExternal(entry[0]);
27
+ const sum = (coeffs.get(thVar) ?? Rational.zero).add(entry[1].mul(coeff));
28
+ if (coeffs.has(thVar)) coeffs.replace(thVar, sum);
29
+ else coeffs.set(thVar, sum);
30
+ }
31
+ };
32
+ visit(term, Rational.one);
33
+ return [...coeffs];
34
+ };
35
+
36
+ // coeffs2app: Int expressions of a Real sum are coerced to Real.
37
+ export const coeffsToApp = (
38
+ manager: AstManager,
39
+ coeffs: [number, Rational][],
40
+ isInt: boolean,
41
+ getExpr: (thVar: number) => number,
42
+ ) => {
43
+ const sort = isInt ? SORT_INT : SORT_REAL;
44
+ const summands = coeffs
45
+ .filter((entry) => !entry[1].isZero())
46
+ .map((entry) => {
47
+ const original = getExpr(entry[0]);
48
+ const expr =
49
+ !isInt && manager.isInt(original)
50
+ ? manager.mkApp(OP_TO_REAL, [original], SORT_REAL)
51
+ : original;
52
+ return entry[1].equals(Rational.one)
53
+ ? expr
54
+ : manager.mkApp(OP_MUL, [manager.mkNumeralOfSort(entry[1], sort), expr], sort);
55
+ });
56
+ return summands.length === 0
57
+ ? manager.mkNumeralOfSort(Rational.zero, sort)
58
+ : summands.length === 1
59
+ ? summands[0]
60
+ : manager.mkApp(OP_ADD, summands, sort);
61
+ };
62
+
63
+ // mk_bound: the atom term >= offset, or term <= offset, with integer coefficients reduced by their
64
+ // gcd when every variable is an integer.
65
+ export const mkBoundAtom = (
66
+ manager: AstManager,
67
+ solver: LarSolver,
68
+ term: LarTerm,
69
+ inputOffset: Rational,
70
+ inputIsLower: boolean,
71
+ getExpr: (thVar: number) => number,
72
+ ) => {
73
+ let coeffs = getTermCoeffs(solver, term);
74
+ let offset = inputOffset;
75
+ let isLower = inputIsLower;
76
+ let lcm = offset.den;
77
+ const isInt = coeffs.every((entry) => manager.isInt(getExpr(entry[0])));
78
+ if (isInt) {
79
+ for (const entry of coeffs) lcm = getLcm(lcm, entry[1].den);
80
+ if (lcm !== 1n) {
81
+ const scale = Rational.of(lcm);
82
+ offset = offset.mul(scale);
83
+ coeffs = coeffs.map((entry) => [entry[0], entry[1].mul(scale)]);
84
+ }
85
+ let gcd = 0n;
86
+ for (const entry of coeffs) gcd = getGcd(gcd, entry[1].num);
87
+ if (gcd !== 0n && gcd !== 1n) {
88
+ const divisor = Rational.of(gcd);
89
+ coeffs = coeffs.map((entry) => [entry[0], entry[1].div(divisor)]);
90
+ offset = isLower ? offset.div(divisor).ceil() : offset.div(divisor).floor();
91
+ }
92
+ }
93
+ if (coeffs.length > 0 && coeffs[0][1].isNegative()) {
94
+ offset = offset.neg();
95
+ isLower = !isLower;
96
+ coeffs = coeffs.map((entry) => [entry[0], entry[1].neg()]);
97
+ }
98
+ const sort = isInt ? SORT_INT : SORT_REAL;
99
+ return manager.mkApp(
100
+ isLower ? OP_GE : OP_LE,
101
+ [coeffsToApp(manager, coeffs, isInt, getExpr), manager.mkNumeralOfSort(offset, sort)],
102
+ SORT_BOOL,
103
+ );
104
+ };
105
+
106
+ // The sides of the equality term = offset that mk_eq internalizes.
107
+ export const mkTermEqSides = (
108
+ manager: AstManager,
109
+ solver: LarSolver,
110
+ term: LarTerm,
111
+ offset: Rational,
112
+ getExpr: (thVar: number) => number,
113
+ ) => {
114
+ const coeffs = getTermCoeffs(solver, term);
115
+ const isInt =
116
+ offset.isInt() && coeffs.every((entry) => manager.isInt(getExpr(entry[0])) && entry[1].isInt());
117
+ return [
118
+ coeffsToApp(manager, coeffs, isInt, getExpr),
119
+ manager.mkNumeralOfSort(offset, isInt ? SORT_INT : SORT_REAL),
120
+ ];
121
+ };
@@ -0,0 +1,175 @@
1
+ import { SmtInvariantError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ isArithSort,
5
+ OP_ARRAY_DEFAULT,
6
+ OP_ARRAY_EXT,
7
+ OP_ARRAY_MAP,
8
+ OP_AS_ARRAY,
9
+ OP_CONST_ARRAY,
10
+ OP_SELECT,
11
+ OP_STORE,
12
+ } from "./ast";
13
+
14
+ interface ArraySignature {
15
+ name: string;
16
+ domain: number[];
17
+ range: number;
18
+ }
19
+
20
+ const isCompatible = (first: number, second: number) =>
21
+ first === second || (isArithSort(first) && isArithSort(second));
22
+
23
+ const getSelectSignature = (manager: AstManager, argSorts: number[]): ArraySignature | string => {
24
+ if (argSorts.length <= 1) return "select takes at least two arguments";
25
+ const sort = argSorts[0];
26
+ if (!manager.isArraySort(sort))
27
+ return `select expects the first argument sort to be an array, but was provided a value of sort ${manager.getSortName(sort)}`;
28
+ const parameters = manager.getSortParameters(sort);
29
+ if (parameters.length !== argSorts.length)
30
+ return `select expects the first argument to be an array taking ${parameters.length - 1}, instead it was passed ${argSorts.length - 1} arguments`;
31
+ for (let index = 0; index + 1 < parameters.length; index++)
32
+ if (!isCompatible(argSorts[index + 1], parameters[index]))
33
+ return `domain sort ${manager.getSortName(argSorts[index + 1])} and parameter ${manager.getSortName(parameters[index])} do not match`;
34
+ return {
35
+ name: "select",
36
+ domain: [sort, ...parameters.slice(0, -1)],
37
+ range: manager.getArrayRange(sort),
38
+ };
39
+ };
40
+
41
+ const getStoreSignature = (manager: AstManager, argSorts: number[]): ArraySignature | string => {
42
+ if (argSorts.length < 3) return "store takes at least 3 arguments";
43
+ const sort = argSorts[0];
44
+ if (!manager.isArraySort(sort)) return "store expects the first argument sort to be an array";
45
+ const parameters = manager.getSortParameters(sort);
46
+ if (argSorts.length !== parameters.length + 1)
47
+ return `store expects the first argument to be an array taking ${parameters.length + 1}, instead it was passed ${argSorts.length - 1} arguments`;
48
+ for (let index = 0; index < parameters.length; index++)
49
+ if (!isCompatible(parameters[index], argSorts[index + 1]))
50
+ return `domain sort ${manager.getSortName(argSorts[index + 1])} and parameter sort ${manager.getSortName(parameters[index])} do not match`;
51
+ return { name: "store", domain: [sort, ...parameters], range: sort };
52
+ };
53
+
54
+ const getConstSignature = (
55
+ manager: AstManager,
56
+ sort: number,
57
+ argSorts: number[],
58
+ ): ArraySignature | string => {
59
+ if (argSorts.length !== 1) return "invalid const array definition, expected one argument";
60
+ if (!manager.isArraySort(sort))
61
+ return "invalid const array definition, parameter is not an array sort";
62
+ if (manager.getArrayRange(sort) !== argSorts[0])
63
+ return "invalid const array definition, sort mismatch between array range and argument";
64
+ return { name: "const", domain: argSorts, range: sort };
65
+ };
66
+
67
+ export const getMapSignature = (
68
+ manager: AstManager,
69
+ mapped: { domain: readonly number[]; range: number },
70
+ argSorts: number[],
71
+ ): ArraySignature | string => {
72
+ if (argSorts.length !== mapped.domain.length)
73
+ return `map expects to take as many arguments as the function being mapped, it was given ${argSorts.length} but expects ${mapped.domain.length}`;
74
+ if (argSorts.length === 0) return "don't use map on constants";
75
+ const arity = manager.getArrayArity(argSorts[0]);
76
+ for (let index = 0; index < argSorts.length; index++) {
77
+ const sort = argSorts[index];
78
+ if (!manager.isArraySort(sort))
79
+ return `map expects an array sort as argument at position ${index}`;
80
+ if (manager.getArrayArity(sort) !== arity)
81
+ return `map expects all arguments to have the same array domain, this is not the case for argument ${index}`;
82
+ for (let position = 0; position < arity; position++)
83
+ if (
84
+ manager.getSortParameters(sort)[position] !==
85
+ manager.getSortParameters(argSorts[0])[position]
86
+ )
87
+ return `map expects all arguments to have the same array domain, this is not the case for argument ${index}`;
88
+ if (manager.getArrayRange(sort) !== mapped.domain[index])
89
+ return `map expects the argument at position ${index} to have the array range the same as the function`;
90
+ }
91
+ const range = manager.mkArraySort([
92
+ ...manager.getSortParameters(argSorts[0]).slice(0, -1),
93
+ mapped.range,
94
+ ]);
95
+ return { name: "map", domain: argSorts, range };
96
+ };
97
+
98
+ const getDefaultSignature = (manager: AstManager, argSorts: number[]): ArraySignature | string => {
99
+ if (argSorts.length !== 1) return "invalid default array definition, invalid domain size";
100
+ if (manager.getSortParameters(argSorts[0]).length <= 1)
101
+ return "parameter mismatch. There should be more than one parameter to defaults";
102
+ return { name: "default", domain: argSorts, range: manager.getArrayRange(argSorts[0]) };
103
+ };
104
+
105
+ const getExtSignature = (
106
+ manager: AstManager,
107
+ index: number,
108
+ argSorts: number[],
109
+ ): ArraySignature | string => {
110
+ if (argSorts.length !== 2 || argSorts[0] !== argSorts[1])
111
+ return "incorrect arguments passed to array-ext";
112
+ const parameters = manager.getSortParameters(argSorts[0]);
113
+ if (parameters.length === 0 || index >= parameters.length - 1)
114
+ return "incorrect arguments passed to array-ext";
115
+ return { name: "array-ext", domain: argSorts, range: parameters[index] };
116
+ };
117
+
118
+ // The parameter of const is its array sort, of map the declaration it maps, and of array-ext the
119
+ // index of its domain.
120
+ export const getArraySignature = (
121
+ manager: AstManager,
122
+ op: number,
123
+ argSorts: number[],
124
+ parameters: number[],
125
+ ): ArraySignature | string => {
126
+ switch (op) {
127
+ case OP_SELECT:
128
+ return getSelectSignature(manager, argSorts);
129
+ case OP_STORE:
130
+ return getStoreSignature(manager, argSorts);
131
+ case OP_CONST_ARRAY:
132
+ return getConstSignature(manager, parameters[0], argSorts);
133
+ case OP_ARRAY_MAP:
134
+ return getMapSignature(manager, manager.funcDecls[parameters[0]], argSorts);
135
+ case OP_ARRAY_DEFAULT:
136
+ return getDefaultSignature(manager, argSorts);
137
+ case OP_ARRAY_EXT:
138
+ return getExtSignature(manager, parameters[0] ?? 0, argSorts);
139
+ default:
140
+ return "invalid array operator";
141
+ }
142
+ };
143
+
144
+ export const mkArrayDecl = (
145
+ manager: AstManager,
146
+ op: number,
147
+ argSorts: number[],
148
+ parameters: number[] = [],
149
+ ) => {
150
+ const signature = getArraySignature(manager, op, argSorts, parameters);
151
+ if (typeof signature === "string") throw new SmtInvariantError(signature);
152
+ return manager.mkArrayDecl(op, signature.name, parameters, signature.domain, signature.range);
153
+ };
154
+
155
+ export const mkArrayApp = (
156
+ manager: AstManager,
157
+ op: number,
158
+ args: number[],
159
+ parameters: number[] = [],
160
+ ) => {
161
+ const decl = mkArrayDecl(
162
+ manager,
163
+ op,
164
+ args.map((arg) => manager.sorts[arg]),
165
+ parameters,
166
+ );
167
+ return manager.mkApp(decl, args, manager.funcDecls[decl].range);
168
+ };
169
+
170
+ export const mkAsArray = (manager: AstManager, decl: number) => {
171
+ const funcDecl = manager.funcDecls[decl];
172
+ const sort = manager.mkArraySort([...funcDecl.domain, funcDecl.range]);
173
+ const asArray = manager.mkArrayDecl(OP_AS_ARRAY, "as-array", [decl], [], sort);
174
+ return manager.mkApp(asArray, [], sort);
175
+ };
@@ -0,0 +1,309 @@
1
+ import { SmtUnsupportedError } from "../../../errors";
2
+ import { mkArrayApp } from "./array-decl-plugin";
3
+ import {
4
+ type AstManager,
5
+ OP_AND,
6
+ OP_ARRAY_MAP,
7
+ OP_AS_ARRAY,
8
+ OP_CONST_ARRAY,
9
+ OP_ITE,
10
+ OP_SELECT,
11
+ OP_STORE,
12
+ SORT_SIZE_INFINITE,
13
+ SORT_SIZE_VERY_BIG,
14
+ SORT_BOOL,
15
+ } from "./ast";
16
+ import { isAstLess } from "./ast-lt";
17
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
18
+ import { InvVarShifter, type Rewrite, VarShifter } from "./rewriter-tpl";
19
+ import { getFreeVarSorts, VarSubst } from "./var-subst";
20
+
21
+ const MAX_SQUASH_ROUNDS = 10;
22
+
23
+ export class ArrayRewriter {
24
+ constructor(
25
+ private manager: AstManager,
26
+ private isSortingStore = false,
27
+ ) {}
28
+
29
+ private isOp(expr: number, op: number) {
30
+ return this.manager.getOp(expr) === op;
31
+ }
32
+
33
+ private mkApp(op: number, args: number[], parameters: number[] = []) {
34
+ return mkArrayApp(this.manager, op, args, parameters);
35
+ }
36
+
37
+ private compareArgs(count: number, first: number, firstStart: number, second: number[]) {
38
+ const manager = this.manager;
39
+ for (let index = 0; index < count; index++) {
40
+ const left = manager.getArg(first, firstStart + index);
41
+ const right = second[index];
42
+ if (left === right) continue;
43
+ return manager.areDistinct(left, right) ? L_FALSE : L_UNDEF;
44
+ }
45
+ return L_TRUE;
46
+ }
47
+
48
+ mkAppCore(op: number, args: number[]): number | Rewrite | undefined {
49
+ if (op === OP_SELECT) return this.mkSelectCore(args);
50
+ if (op === OP_STORE) return this.mkStoreCore(args);
51
+ return undefined;
52
+ }
53
+
54
+ private mkStoreCore(args: number[]): number | Rewrite | undefined {
55
+ const manager = this.manager;
56
+ const array = args[0];
57
+ const indices = args.slice(1, -1);
58
+ if (this.isOp(array, OP_STORE)) {
59
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
60
+ if (comparison === L_TRUE)
61
+ return this.mkApp(OP_STORE, [manager.getArg(array, 0), ...args.slice(1)]);
62
+ if (comparison === L_FALSE) {
63
+ if (this.isSortingStore && this.isLexLess(indices, manager.getArgs(array).slice(1))) {
64
+ const nested = this.mkApp(OP_STORE, [manager.getArg(array, 0), ...args.slice(1)]);
65
+ return {
66
+ expr: this.mkApp(OP_STORE, [nested, ...manager.getArgs(array).slice(1)]),
67
+ depth: 2,
68
+ };
69
+ }
70
+ const squashed = this.squashStore(args);
71
+ if (squashed !== undefined) return { expr: squashed, depth: 2 };
72
+ }
73
+ }
74
+ const value = args[args.length - 1];
75
+ if (this.isOp(array, OP_CONST_ARRAY) && manager.getArg(array, 0) === value) return array;
76
+ if (this.isOp(value, OP_SELECT) && this.compareArgs(args.length - 1, value, 0, args) === L_TRUE)
77
+ return array;
78
+ return undefined;
79
+ }
80
+
81
+ private isLexLess(first: number[], second: number[]) {
82
+ const index = first.findIndex((arg, position) => arg !== second[position]);
83
+ return index !== -1 && isAstLess(this.manager, first[index], second[index]);
84
+ }
85
+
86
+ private squashStore(args: number[]) {
87
+ const manager = this.manager;
88
+ const parents: number[] = [];
89
+ const indices = args.slice(1, -1);
90
+ let array = args[0];
91
+ for (let rounds = 0; this.isOp(array, OP_STORE) && rounds < MAX_SQUASH_ROUNDS; rounds++) {
92
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
93
+ if (comparison === L_UNDEF) return undefined;
94
+ if (comparison === L_FALSE) {
95
+ parents.push(array);
96
+ array = manager.getArg(array, 0);
97
+ continue;
98
+ }
99
+ let result = manager.getArg(array, 0);
100
+ for (let index = parents.length - 1; index >= 0; index--)
101
+ result = this.mkApp(OP_STORE, [result, ...manager.getArgs(parents[index]).slice(1)]);
102
+ return this.mkApp(OP_STORE, [result, ...args.slice(1)]);
103
+ }
104
+ return undefined;
105
+ }
106
+
107
+ private mkSelectSameStore(args: number[]): number | Rewrite | undefined {
108
+ const manager = this.manager;
109
+ const indices = args.slice(1);
110
+ let array = args[0];
111
+ for (;;) {
112
+ if (this.isOp(array, OP_STORE)) {
113
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
114
+ if (comparison === L_TRUE) return manager.getArg(array, indices.length + 1);
115
+ if (comparison === L_UNDEF) return undefined;
116
+ array = manager.getArg(array, 0);
117
+ continue;
118
+ }
119
+ if (this.isOp(array, OP_CONST_ARRAY)) return manager.getArg(array, 0);
120
+ if (manager.isLambda(array))
121
+ return { expr: this.betaReduce(array, indices), depth: Infinity };
122
+ if (this.isOp(array, OP_ARRAY_MAP)) {
123
+ const decl = manager.funcDecls[manager.decls[array]].parameters[0];
124
+ const selects = manager.mapArgs(array, (arg) => this.mkApp(OP_SELECT, [arg, ...indices]));
125
+ const range = manager.getArrayRange(manager.sorts[array]);
126
+ return { expr: manager.mkApp(decl, selects, range), depth: 2 };
127
+ }
128
+ if (this.isOp(array, OP_AS_ARRAY)) {
129
+ const decl = manager.funcDecls[manager.decls[array]].parameters[0];
130
+ return { expr: manager.mkApp(decl, indices, manager.funcDecls[decl].range), depth: 1 };
131
+ }
132
+ return undefined;
133
+ }
134
+ }
135
+
136
+ // select(lambda(X) M, N) -> M[N/X], anywhere rather than to weak head normal form.
137
+ private betaReduce(lambda: number, indices: number[]) {
138
+ const manager = this.manager;
139
+ const count = indices.length;
140
+ const shifter = new VarShifter(manager);
141
+ const shifted = indices.map((index) => shifter.shift(index, 0, count, 0));
142
+ shifter.release();
143
+ const subst = new VarSubst(manager, true);
144
+ const substituted = subst.apply(manager.getQuantifier(lambda).body, shifted);
145
+ subst.release();
146
+ for (const index of shifted) manager.decRef(index);
147
+ const invShifter = new InvVarShifter(manager);
148
+ const result = invShifter.shift(substituted, count);
149
+ invShifter.release();
150
+ manager.decRef(substituted);
151
+ manager.releaseLater(result);
152
+ return result;
153
+ }
154
+
155
+ // Array eta-reduction: (lambda (x_0 ... x_{k-1}) (select a x_0 ... x_{k-1})) -> a, when a does not
156
+ // depend on the bound variables.
157
+ mkLambdaCore(lambda: number, body: number) {
158
+ const manager = this.manager;
159
+ const count = manager.getQuantifier(lambda).sorts.length;
160
+ if (!this.isOp(body, OP_SELECT) || manager.getNumArgs(body) !== count + 1) return -1;
161
+ for (let index = 0; index < count; index++) {
162
+ const arg = manager.getArg(body, index + 1);
163
+ if (!manager.isVar(arg) || manager.values[arg] !== count - 1 - index) return -1;
164
+ }
165
+ const array = manager.getArg(body, 0);
166
+ if (getFreeVarSorts(manager, array, count).some((sort) => sort !== undefined)) return -1;
167
+ const shifter = new InvVarShifter(manager);
168
+ const result = shifter.shift(array, count);
169
+ shifter.release();
170
+ manager.releaseLater(result);
171
+ return result;
172
+ }
173
+
174
+ private mkSelectCore(args: number[]): number | Rewrite | undefined {
175
+ const manager = this.manager;
176
+ const sameStore = this.mkSelectSameStore(args);
177
+ if (sameStore !== undefined) return sameStore;
178
+ const indices = args.slice(1);
179
+ const array = args[0];
180
+ if (this.isOp(array, OP_STORE)) {
181
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
182
+ if (comparison === L_FALSE) {
183
+ let base = manager.getArg(array, 0);
184
+ while (
185
+ this.isOp(base, OP_STORE) &&
186
+ this.compareArgs(indices.length, base, 1, indices) === L_FALSE
187
+ )
188
+ base = manager.getArg(base, 0);
189
+ return { expr: this.mkApp(OP_SELECT, [base, ...indices]), depth: 1 };
190
+ }
191
+ const base = manager.getArg(array, 0);
192
+ const areValues = indices.every(
193
+ (index, position) =>
194
+ manager.isValue(index) && manager.isValue(manager.getArg(array, position + 1)),
195
+ );
196
+ if (!this.isOp(base, OP_CONST_ARRAY) && !areValues) return undefined;
197
+ const selectBase = this.mkApp(OP_SELECT, [base, ...indices]);
198
+ const value = manager.getArg(array, indices.length + 1);
199
+ const eqs = indices.map((index, position) =>
200
+ manager.mkEq(manager.getArg(array, position + 1), index),
201
+ );
202
+ const condition = eqs.length === 1 ? eqs[0] : manager.mkApp(OP_AND, eqs, SORT_BOOL);
203
+ return {
204
+ expr: manager.mkApp(OP_ITE, [condition, value, selectBase], manager.sorts[value]),
205
+ depth: eqs.length === 1 ? 2 : 3,
206
+ };
207
+ }
208
+ if (this.isOp(array, OP_ITE)) {
209
+ const thenArray = manager.getArg(array, 1);
210
+ const elseArray = manager.getArg(array, 2);
211
+ if (manager.getRefCount(thenArray) !== 1 && manager.getRefCount(elseArray) !== 1)
212
+ return undefined;
213
+ const thenSelect = this.mkApp(OP_SELECT, [thenArray, ...indices]);
214
+ const elseSelect = this.mkApp(OP_SELECT, [elseArray, ...indices]);
215
+ return {
216
+ expr: manager.mkApp(
217
+ OP_ITE,
218
+ [manager.getArg(array, 0), thenSelect, elseSelect],
219
+ manager.sorts[thenSelect],
220
+ ),
221
+ depth: 2,
222
+ };
223
+ }
224
+ return undefined;
225
+ }
226
+
227
+ private getStoreBase(expr: number) {
228
+ let base = expr;
229
+ let count = 0;
230
+ while (this.isOp(base, OP_STORE)) {
231
+ base = this.manager.getArg(base, 0);
232
+ count++;
233
+ }
234
+ return { base, count };
235
+ }
236
+
237
+ private isDomainLargerThan(sort: number, numStores: number) {
238
+ const manager = this.manager;
239
+ let size = 1n;
240
+ for (let index = 0; index < manager.getArrayArity(sort); index++) {
241
+ const domain = manager.getSortParameters(sort)[index];
242
+ if (manager.isUninterpretedSort(domain)) continue;
243
+ const domainSize = manager.getSortSize(domain);
244
+ if (domainSize === SORT_SIZE_INFINITE) return true;
245
+ if (domainSize === SORT_SIZE_VERY_BIG) return false;
246
+ size *= domainSize;
247
+ if (size > BigInt(numStores)) return true;
248
+ }
249
+ return false;
250
+ }
251
+
252
+ private pushStoreEqs(store: number, lhs: number, rhs: number, eqs: number[]) {
253
+ const manager = this.manager;
254
+ for (let current = store; this.isOp(current, OP_STORE); current = manager.getArg(current, 0)) {
255
+ const indices = manager.getArgs(current).slice(1, -1);
256
+ const left = this.mkSelect([lhs, ...indices]);
257
+ const right = this.mkSelect([rhs, ...indices]);
258
+ eqs.push(manager.mkEq(left, right));
259
+ }
260
+ }
261
+
262
+ private mkSelect(args: number[]) {
263
+ const result = this.mkSelectCore(args);
264
+ if (result === undefined) return this.mkApp(OP_SELECT, args);
265
+ return typeof result === "number" ? result : result.expr;
266
+ }
267
+
268
+ private hasValueIndices(expr: number) {
269
+ const manager = this.manager;
270
+ for (let current = expr; this.isOp(current, OP_STORE); current = manager.getArg(current, 0))
271
+ for (let index = 1; index + 1 < manager.getNumArgs(current); index++)
272
+ if (!manager.isValue(manager.getArg(current, index))) return false;
273
+ return true;
274
+ }
275
+
276
+ mkEqCore(inputLhs: number, inputRhs: number): Rewrite | undefined {
277
+ const manager = this.manager;
278
+ const isSwapped = this.isOp(inputRhs, OP_CONST_ARRAY) && this.isOp(inputLhs, OP_STORE);
279
+ const lhs = isSwapped ? inputRhs : inputLhs;
280
+ const rhs = isSwapped ? inputLhs : inputRhs;
281
+ if (this.isOp(lhs, OP_CONST_ARRAY) && this.isOp(rhs, OP_CONST_ARRAY))
282
+ return { expr: manager.mkEq(manager.getArg(lhs, 0), manager.getArg(rhs, 0)), depth: 1 };
283
+ const left = this.getStoreBase(lhs);
284
+ const right = this.getStoreBase(rhs);
285
+ const sort = manager.sorts[lhs];
286
+ if (
287
+ this.isOp(left.base, OP_CONST_ARRAY) &&
288
+ this.isOp(right.base, OP_CONST_ARRAY) &&
289
+ this.isDomainLargerThan(sort, left.count + right.count)
290
+ ) {
291
+ const eqs: number[] = [];
292
+ this.pushStoreEqs(lhs, lhs, rhs, eqs);
293
+ this.pushStoreEqs(rhs, lhs, rhs, eqs);
294
+ eqs.push(manager.mkEq(manager.getArg(left.base, 0), manager.getArg(right.base, 0)));
295
+ return { expr: manager.mkAnd(eqs), depth: Infinity };
296
+ }
297
+ if (
298
+ this.isOp(left.base, OP_CONST_ARRAY) &&
299
+ this.isOp(right.base, OP_CONST_ARRAY) &&
300
+ !(this.hasValueIndices(lhs) && this.hasValueIndices(rhs)) &&
301
+ manager
302
+ .getSortParameters(sort)
303
+ .slice(0, -1)
304
+ .some((domain) => manager.isUninterpretedSort(domain))
305
+ )
306
+ throw new SmtUnsupportedError("lambdas");
307
+ return undefined;
308
+ }
309
+ }
@@ -3,14 +3,12 @@ export const shrink = <T>(values: T[], size: number) => {
3
3
  while (values.length > size) values.pop();
4
4
  };
5
5
 
6
- // Writing far past an array's end turns it into a dictionary in V8, which makes every access a hash
7
- // lookup. So this fills the gap first.
6
+ // Writing far past an array's end turns it into a dictionary in V8, so this fills the gap first.
8
7
  export const setAt = <T>(values: (T | undefined)[], index: number, value: T | undefined) => {
9
8
  while (values.length < index) values.push(undefined);
10
9
  values[index] = value;
11
10
  };
12
11
 
13
- // A typed array of twice the length with the same contents.
14
12
  export const grow = <
15
13
  T extends Uint8Array<ArrayBuffer> | Int32Array<ArrayBuffer> | Uint32Array<ArrayBuffer>,
16
14
  >(