tla-ts 0.0.10-dev.f16792fed → 0.0.10-dev.fdc173479

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 (587) 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 +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  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 +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  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 +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  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 +120 -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 +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -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 +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -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 +829 -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 +22 -25
  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 +262 -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 +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  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 +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -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 +2107 -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 +995 -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 +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -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 +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -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 +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  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 +2176 -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 +1210 -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 +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -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 +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -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/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. 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,319 @@
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
+ private isExpandingSelects = false,
28
+ ) {}
29
+
30
+ private isOp(expr: number, op: number) {
31
+ return this.manager.getOp(expr) === op;
32
+ }
33
+
34
+ private mkApp(op: number, args: number[], parameters: number[] = []) {
35
+ return mkArrayApp(this.manager, op, args, parameters);
36
+ }
37
+
38
+ private compareArgs(count: number, first: number, firstStart: number, second: number[]) {
39
+ const manager = this.manager;
40
+ for (let index = 0; index < count; index++) {
41
+ const left = manager.getArg(first, firstStart + index);
42
+ const right = second[index];
43
+ if (left === right) continue;
44
+ return manager.areDistinct(left, right) ? L_FALSE : L_UNDEF;
45
+ }
46
+ return L_TRUE;
47
+ }
48
+
49
+ mkAppCore(op: number, args: number[]): number | Rewrite | undefined {
50
+ if (op === OP_SELECT) return this.mkSelectCore(args);
51
+ if (op === OP_STORE) return this.mkStoreCore(args);
52
+ return undefined;
53
+ }
54
+
55
+ private mkStoreCore(args: number[]): number | Rewrite | undefined {
56
+ const manager = this.manager;
57
+ const array = args[0];
58
+ const indices = args.slice(1, -1);
59
+ if (this.isOp(array, OP_STORE)) {
60
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
61
+ if (comparison === L_TRUE)
62
+ return this.mkApp(OP_STORE, [manager.getArg(array, 0), ...args.slice(1)]);
63
+ if (comparison === L_FALSE) {
64
+ if (this.isSortingStore && this.isLexLess(indices, manager.getArgs(array).slice(1))) {
65
+ const nested = this.mkApp(OP_STORE, [manager.getArg(array, 0), ...args.slice(1)]);
66
+ return {
67
+ expr: this.mkApp(OP_STORE, [nested, ...manager.getArgs(array).slice(1)]),
68
+ depth: 2,
69
+ };
70
+ }
71
+ const squashed = this.squashStore(args);
72
+ if (squashed !== undefined) return { expr: squashed, depth: 2 };
73
+ }
74
+ }
75
+ const value = args[args.length - 1];
76
+ if (this.isOp(array, OP_CONST_ARRAY) && manager.getArg(array, 0) === value) return array;
77
+ if (this.isOp(value, OP_SELECT) && this.compareArgs(args.length - 1, value, 0, args) === L_TRUE)
78
+ return array;
79
+ return undefined;
80
+ }
81
+
82
+ private isLexLess(first: number[], second: number[]) {
83
+ const index = first.findIndex((arg, position) => arg !== second[position]);
84
+ return index !== -1 && isAstLess(this.manager, first[index], second[index]);
85
+ }
86
+
87
+ private squashStore(args: number[]) {
88
+ const manager = this.manager;
89
+ const parents: number[] = [];
90
+ const indices = args.slice(1, -1);
91
+ let array = args[0];
92
+ for (let rounds = 0; this.isOp(array, OP_STORE) && rounds < MAX_SQUASH_ROUNDS; rounds++) {
93
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
94
+ if (comparison === L_UNDEF) return undefined;
95
+ if (comparison === L_FALSE) {
96
+ parents.push(array);
97
+ array = manager.getArg(array, 0);
98
+ continue;
99
+ }
100
+ let result = manager.getArg(array, 0);
101
+ for (let index = parents.length - 1; index >= 0; index--)
102
+ result = this.mkApp(OP_STORE, [result, ...manager.getArgs(parents[index]).slice(1)]);
103
+ return this.mkApp(OP_STORE, [result, ...args.slice(1)]);
104
+ }
105
+ return undefined;
106
+ }
107
+
108
+ private mkSelectSameStore(args: number[]): number | Rewrite | undefined {
109
+ const manager = this.manager;
110
+ const indices = args.slice(1);
111
+ let array = args[0];
112
+ for (;;) {
113
+ if (this.isOp(array, OP_STORE)) {
114
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
115
+ if (comparison === L_TRUE) return manager.getArg(array, indices.length + 1);
116
+ if (comparison === L_UNDEF) return undefined;
117
+ array = manager.getArg(array, 0);
118
+ continue;
119
+ }
120
+ if (this.isOp(array, OP_CONST_ARRAY)) return manager.getArg(array, 0);
121
+ if (manager.isLambda(array))
122
+ return { expr: this.betaReduce(array, indices), depth: Infinity };
123
+ if (this.isOp(array, OP_ARRAY_MAP)) {
124
+ const decl = manager.funcDecls[manager.decls[array]].parameters[0];
125
+ const selects = manager.mapArgs(array, (arg) => this.mkApp(OP_SELECT, [arg, ...indices]));
126
+ const range = manager.getArrayRange(manager.sorts[array]);
127
+ return { expr: manager.mkApp(decl, selects, range), depth: 2 };
128
+ }
129
+ if (this.isOp(array, OP_AS_ARRAY)) {
130
+ const decl = manager.funcDecls[manager.decls[array]].parameters[0];
131
+ return { expr: manager.mkApp(decl, indices, manager.funcDecls[decl].range), depth: 1 };
132
+ }
133
+ return undefined;
134
+ }
135
+ }
136
+
137
+ // select(lambda(X) M, N) -> M[N/X], anywhere rather than to weak head normal form.
138
+ private betaReduce(lambda: number, indices: number[]) {
139
+ const manager = this.manager;
140
+ const count = indices.length;
141
+ const shifter = new VarShifter(manager);
142
+ const shifted = indices.map((index) => shifter.shift(index, 0, count, 0));
143
+ shifter.release();
144
+ const subst = new VarSubst(manager, true);
145
+ const substituted = subst.apply(manager.getQuantifier(lambda).body, shifted);
146
+ subst.release();
147
+ for (const index of shifted) manager.decRef(index);
148
+ const invShifter = new InvVarShifter(manager);
149
+ const result = invShifter.shift(substituted, count);
150
+ invShifter.release();
151
+ manager.decRef(substituted);
152
+ manager.releaseLater(result);
153
+ return result;
154
+ }
155
+
156
+ // Array eta-reduction: (lambda (x_0 ... x_{k-1}) (select a x_0 ... x_{k-1})) -> a, when a does not
157
+ // depend on the bound variables.
158
+ mkLambdaCore(lambda: number, body: number) {
159
+ const manager = this.manager;
160
+ const count = manager.getQuantifier(lambda).sorts.length;
161
+ if (!this.isOp(body, OP_SELECT) || manager.getNumArgs(body) !== count + 1) return -1;
162
+ for (let index = 0; index < count; index++) {
163
+ const arg = manager.getArg(body, index + 1);
164
+ if (!manager.isVar(arg) || manager.values[arg] !== count - 1 - index) return -1;
165
+ }
166
+ const array = manager.getArg(body, 0);
167
+ if (getFreeVarSorts(manager, array, count).some((sort) => sort !== undefined)) return -1;
168
+ const shifter = new InvVarShifter(manager);
169
+ const result = shifter.shift(array, count);
170
+ shifter.release();
171
+ manager.releaseLater(result);
172
+ return result;
173
+ }
174
+
175
+ private mkSelectCore(args: number[]): number | Rewrite | undefined {
176
+ const manager = this.manager;
177
+ const sameStore = this.mkSelectSameStore(args);
178
+ if (sameStore !== undefined) return sameStore;
179
+ const indices = args.slice(1);
180
+ const array = args[0];
181
+ if (this.isOp(array, OP_STORE)) {
182
+ const comparison = this.compareArgs(indices.length, array, 1, indices);
183
+ if (comparison === L_FALSE) {
184
+ let base = manager.getArg(array, 0);
185
+ while (
186
+ this.isOp(base, OP_STORE) &&
187
+ this.compareArgs(indices.length, base, 1, indices) === L_FALSE
188
+ )
189
+ base = manager.getArg(base, 0);
190
+ return { expr: this.mkApp(OP_SELECT, [base, ...indices]), depth: 1 };
191
+ }
192
+ const base = manager.getArg(array, 0);
193
+ const areValues = indices.every(
194
+ (index, position) =>
195
+ manager.isValue(index) && manager.isValue(manager.getArg(array, position + 1)),
196
+ );
197
+ if (
198
+ !this.isOp(base, OP_CONST_ARRAY) &&
199
+ !areValues &&
200
+ !(this.isExpandingSelects && manager.getRefCount(base) === 1)
201
+ )
202
+ return undefined;
203
+ const selectBase = this.mkApp(OP_SELECT, [base, ...indices]);
204
+ const value = manager.getArg(array, indices.length + 1);
205
+ const eqs = indices.map((index, position) =>
206
+ manager.mkEq(manager.getArg(array, position + 1), index),
207
+ );
208
+ const condition = eqs.length === 1 ? eqs[0] : manager.mkApp(OP_AND, eqs, SORT_BOOL);
209
+ return {
210
+ expr: manager.mkApp(OP_ITE, [condition, value, selectBase], manager.sorts[value]),
211
+ depth: eqs.length === 1 ? 2 : 3,
212
+ };
213
+ }
214
+ if (this.isOp(array, OP_ITE)) {
215
+ const thenArray = manager.getArg(array, 1);
216
+ const elseArray = manager.getArg(array, 2);
217
+ if (
218
+ !this.isExpandingSelects &&
219
+ manager.getRefCount(thenArray) !== 1 &&
220
+ manager.getRefCount(elseArray) !== 1
221
+ )
222
+ return undefined;
223
+ const thenSelect = this.mkApp(OP_SELECT, [thenArray, ...indices]);
224
+ const elseSelect = this.mkApp(OP_SELECT, [elseArray, ...indices]);
225
+ return {
226
+ expr: manager.mkApp(
227
+ OP_ITE,
228
+ [manager.getArg(array, 0), thenSelect, elseSelect],
229
+ manager.sorts[thenSelect],
230
+ ),
231
+ depth: 2,
232
+ };
233
+ }
234
+ return undefined;
235
+ }
236
+
237
+ private getStoreBase(expr: number) {
238
+ let base = expr;
239
+ let count = 0;
240
+ while (this.isOp(base, OP_STORE)) {
241
+ base = this.manager.getArg(base, 0);
242
+ count++;
243
+ }
244
+ return { base, count };
245
+ }
246
+
247
+ private isDomainLargerThan(sort: number, numStores: number) {
248
+ const manager = this.manager;
249
+ let size = 1n;
250
+ for (let index = 0; index < manager.getArrayArity(sort); index++) {
251
+ const domain = manager.getSortParameters(sort)[index];
252
+ if (manager.isUninterpretedSort(domain)) continue;
253
+ const domainSize = manager.getSortSize(domain);
254
+ if (domainSize === SORT_SIZE_INFINITE) return true;
255
+ if (domainSize === SORT_SIZE_VERY_BIG) return false;
256
+ size *= domainSize;
257
+ if (size > BigInt(numStores)) return true;
258
+ }
259
+ return false;
260
+ }
261
+
262
+ private pushStoreEqs(store: number, lhs: number, rhs: number, eqs: number[]) {
263
+ const manager = this.manager;
264
+ for (let current = store; this.isOp(current, OP_STORE); current = manager.getArg(current, 0)) {
265
+ const indices = manager.getArgs(current).slice(1, -1);
266
+ const left = this.mkSelect([lhs, ...indices]);
267
+ const right = this.mkSelect([rhs, ...indices]);
268
+ eqs.push(manager.mkEq(left, right));
269
+ }
270
+ }
271
+
272
+ private mkSelect(args: number[]) {
273
+ const result = this.mkSelectCore(args);
274
+ if (result === undefined) return this.mkApp(OP_SELECT, args);
275
+ return typeof result === "number" ? result : result.expr;
276
+ }
277
+
278
+ private hasValueIndices(expr: number) {
279
+ const manager = this.manager;
280
+ for (let current = expr; this.isOp(current, OP_STORE); current = manager.getArg(current, 0))
281
+ for (let index = 1; index + 1 < manager.getNumArgs(current); index++)
282
+ if (!manager.isValue(manager.getArg(current, index))) return false;
283
+ return true;
284
+ }
285
+
286
+ mkEqCore(inputLhs: number, inputRhs: number): Rewrite | undefined {
287
+ const manager = this.manager;
288
+ const isSwapped = this.isOp(inputRhs, OP_CONST_ARRAY) && this.isOp(inputLhs, OP_STORE);
289
+ const lhs = isSwapped ? inputRhs : inputLhs;
290
+ const rhs = isSwapped ? inputLhs : inputRhs;
291
+ if (this.isOp(lhs, OP_CONST_ARRAY) && this.isOp(rhs, OP_CONST_ARRAY))
292
+ return { expr: manager.mkEq(manager.getArg(lhs, 0), manager.getArg(rhs, 0)), depth: 1 };
293
+ const left = this.getStoreBase(lhs);
294
+ const right = this.getStoreBase(rhs);
295
+ const sort = manager.sorts[lhs];
296
+ if (
297
+ this.isOp(left.base, OP_CONST_ARRAY) &&
298
+ this.isOp(right.base, OP_CONST_ARRAY) &&
299
+ this.isDomainLargerThan(sort, left.count + right.count)
300
+ ) {
301
+ const eqs: number[] = [];
302
+ this.pushStoreEqs(lhs, lhs, rhs, eqs);
303
+ this.pushStoreEqs(rhs, lhs, rhs, eqs);
304
+ eqs.push(manager.mkEq(manager.getArg(left.base, 0), manager.getArg(right.base, 0)));
305
+ return { expr: manager.mkAnd(eqs), depth: Infinity };
306
+ }
307
+ if (
308
+ this.isOp(left.base, OP_CONST_ARRAY) &&
309
+ this.isOp(right.base, OP_CONST_ARRAY) &&
310
+ !(this.hasValueIndices(lhs) && this.hasValueIndices(rhs)) &&
311
+ manager
312
+ .getSortParameters(sort)
313
+ .slice(0, -1)
314
+ .some((domain) => manager.isUninterpretedSort(domain))
315
+ )
316
+ throw new SmtUnsupportedError("lambdas");
317
+ return undefined;
318
+ }
319
+ }