tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.68b2c4968

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 (542) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +45 -41
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  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 +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +44 -43
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +1 -1
  20. package/dist/transfer.cjs +44 -41
  21. package/dist/transfer.js +43 -40
  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 +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +349 -91
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/codegen.ts +6 -2
  36. package/src/dependencies.ts +72 -11
  37. package/src/dfid.ts +9 -2
  38. package/src/environment.ts +27 -5
  39. package/src/errors.ts +38 -3
  40. package/src/evaluate.ts +92 -32
  41. package/src/exit-codes.ts +5 -2
  42. package/src/instances.ts +1 -1
  43. package/src/levels.ts +134 -86
  44. package/src/lexer.ts +5 -3
  45. package/src/liveness-checker.ts +572 -204
  46. package/src/liveness.ts +47 -32
  47. package/src/obligations/action.ts +10 -6
  48. package/src/obligations/anonymize.ts +33 -14
  49. package/src/obligations/enabled-axioms.ts +218 -0
  50. package/src/obligations/equality.ts +1 -3
  51. package/src/obligations/expression.ts +18 -6
  52. package/src/obligations/format.ts +0 -2
  53. package/src/obligations/generate.ts +22 -17
  54. package/src/obligations/index.ts +36 -6
  55. package/src/obligations/levels.ts +24 -11
  56. package/src/obligations/module.ts +1 -3
  57. package/src/obligations/normalize.ts +24 -13
  58. package/src/obligations/operators.ts +0 -2
  59. package/src/obligations/pragma.ts +53 -16
  60. package/src/obligations/printer.ts +43 -13
  61. package/src/obligations/proof.ts +3 -2
  62. package/src/obligations/regroup.ts +0 -2
  63. package/src/obligations/simplify.ts +17 -7
  64. package/src/obligations/source.ts +71 -17
  65. package/src/obligations/subexpression.ts +45 -18
  66. package/src/obligations/substitution.ts +1 -3
  67. package/src/obligations/temporal.ts +0 -2
  68. package/src/obligations/tuples.ts +0 -2
  69. package/src/parallel-worker.ts +8 -2
  70. package/src/parallel.ts +7 -2
  71. package/src/parser.ts +634 -186
  72. package/src/pretty-print.ts +1 -1
  73. package/src/prover/deciders.ts +11 -8
  74. package/src/prover/isabelle/decide.ts +3 -25
  75. package/src/prover/isabelle/encode.ts +71 -41
  76. package/src/prover/isabelle/isar/attrib.ts +250 -0
  77. package/src/prover/isabelle/isar/context.ts +335 -0
  78. package/src/prover/isabelle/isar/induct.ts +382 -0
  79. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  80. package/src/prover/isabelle/isar/method.ts +506 -198
  81. package/src/prover/isabelle/isar/proof.ts +570 -14
  82. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  83. package/src/prover/isabelle/isar/theory.ts +479 -69
  84. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  85. package/src/prover/isabelle/isar/type-check.ts +83 -8
  86. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  92. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  93. package/src/prover/isabelle/provers/classical.ts +45 -20
  94. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  95. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  96. package/src/prover/isabelle/pure/consts.ts +0 -2
  97. package/src/prover/isabelle/pure/conv.ts +0 -2
  98. package/src/prover/isabelle/pure/drule.ts +63 -4
  99. package/src/prover/isabelle/pure/envir.ts +0 -2
  100. package/src/prover/isabelle/pure/goal.ts +1 -3
  101. package/src/prover/isabelle/pure/logic.ts +0 -2
  102. package/src/prover/isabelle/pure/name.ts +0 -2
  103. package/src/prover/isabelle/pure/net.ts +0 -2
  104. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  105. package/src/prover/isabelle/pure/pattern.ts +0 -2
  106. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  107. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  108. package/src/prover/isabelle/pure/search.ts +0 -2
  109. package/src/prover/isabelle/pure/seq.ts +0 -2
  110. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  111. package/src/prover/isabelle/pure/table.ts +0 -2
  112. package/src/prover/isabelle/pure/tactic.ts +0 -2
  113. package/src/prover/isabelle/pure/tactical.ts +0 -2
  114. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  115. package/src/prover/isabelle/pure/term.ts +0 -2
  116. package/src/prover/isabelle/pure/thm.ts +0 -2
  117. package/src/prover/isabelle/pure/type.ts +0 -2
  118. package/src/prover/isabelle/pure/unify.ts +0 -2
  119. package/src/prover/isabelle/pure/variable.ts +0 -2
  120. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  121. package/src/prover/isabelle/tla/context.ts +51 -9
  122. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  123. package/src/prover/isabelle/tla/logic.ts +40 -1
  124. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  125. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  126. package/src/prover/ocaml.ts +4 -1
  127. package/src/prover/prep/action.ts +19 -12
  128. package/src/prover/prep/enabled-axioms.ts +11 -2
  129. package/src/prover/prep/methods.ts +159 -50
  130. package/src/prover/prep/normalize.ts +38 -9
  131. package/src/prover/prove.ts +343 -65
  132. package/src/prover/ptl/decide.ts +95 -50
  133. package/src/prover/ptl/encode.ts +2 -3
  134. package/src/prover/ptl/tableau.ts +28 -2
  135. package/src/prover/smt/arithmetic.ts +310 -0
  136. package/src/prover/smt/axioms.ts +12 -8
  137. package/src/prover/smt/context.ts +42 -6
  138. package/src/prover/smt/data.ts +191 -84
  139. package/src/prover/smt/encode.ts +122 -43
  140. package/src/prover/smt/extensionality.ts +5 -3
  141. package/src/prover/smt/flatten.ts +4 -6
  142. package/src/prover/smt/format.ts +28 -4
  143. package/src/prover/smt/instances.ts +7 -1
  144. package/src/prover/smt/layout.ts +91 -0
  145. package/src/prover/smt/rewrite.ts +483 -116
  146. package/src/prover/smt/simplify.ts +441 -0
  147. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  148. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  149. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  150. package/src/prover/smt/solver/act-cache.ts +0 -1
  151. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  152. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  153. package/src/prover/smt/solver/aig.ts +889 -0
  154. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  155. package/src/prover/smt/solver/arith-terms.ts +121 -0
  156. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  157. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  158. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  159. package/src/prover/smt/solver/ast-lt.ts +165 -11
  160. package/src/prover/smt/solver/ast-util.ts +160 -2
  161. package/src/prover/smt/solver/ast.ts +1449 -41
  162. package/src/prover/smt/solver/auf-solver.ts +0 -1
  163. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  164. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  165. package/src/prover/smt/solver/bound-manager.ts +196 -0
  166. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  167. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  168. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  169. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  170. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  171. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  172. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  173. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  174. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  175. package/src/prover/smt/solver/card2bv.ts +109 -0
  176. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  177. package/src/prover/smt/solver/cg-table.ts +39 -25
  178. package/src/prover/smt/solver/check-logic.ts +330 -0
  179. package/src/prover/smt/solver/clause.ts +0 -1
  180. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  181. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  182. package/src/prover/smt/solver/context.ts +533 -114
  183. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  184. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  185. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  186. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  187. package/src/prover/smt/solver/demodulator.ts +786 -0
  188. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  189. package/src/prover/smt/solver/der.ts +38 -10
  190. package/src/prover/smt/solver/diff-neq.ts +205 -0
  191. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  192. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  193. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  194. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  195. package/src/prover/smt/solver/e-matching.ts +6 -7
  196. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  197. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  198. package/src/prover/smt/solver/enode.ts +100 -3
  199. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  200. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  201. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  202. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  203. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  204. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  205. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  206. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  207. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  208. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  209. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  210. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  211. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  212. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  213. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  214. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  215. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  216. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  217. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  218. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  219. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  220. package/src/prover/smt/solver/expr-ref.ts +0 -1
  221. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  222. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  223. package/src/prover/smt/solver/factor.ts +163 -0
  224. package/src/prover/smt/solver/fd-solver.ts +267 -0
  225. package/src/prover/smt/solver/fingerprints.ts +15 -15
  226. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  227. package/src/prover/smt/solver/flat-literals.ts +0 -1
  228. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  229. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  230. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  231. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  232. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  233. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  234. package/src/prover/smt/solver/goal.ts +177 -15
  235. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  236. package/src/prover/smt/solver/guard-set.ts +219 -0
  237. package/src/prover/smt/solver/hash.ts +0 -1
  238. package/src/prover/smt/solver/hashtable.ts +30 -16
  239. package/src/prover/smt/solver/inf-eps.ts +63 -0
  240. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  241. package/src/prover/smt/solver/internalizer.ts +109 -36
  242. package/src/prover/smt/solver/lackr.ts +381 -0
  243. package/src/prover/smt/solver/lbool.ts +0 -1
  244. package/src/prover/smt/solver/lia2card.ts +268 -0
  245. package/src/prover/smt/solver/lia2pb.ts +154 -0
  246. package/src/prover/smt/solver/literal.ts +0 -1
  247. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  248. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  249. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  250. package/src/prover/smt/solver/lp/containers.ts +7 -2
  251. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  252. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  253. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  254. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  255. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  256. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  257. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  259. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  260. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  261. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  262. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  263. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  264. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  265. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  266. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  267. package/src/prover/smt/solver/lp/nex.ts +2 -2
  268. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  269. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  270. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  271. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  274. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  275. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  276. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  278. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  279. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  280. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  281. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  282. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  285. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  287. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  288. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  289. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  290. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  291. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  292. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  293. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  294. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  295. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  296. package/src/prover/smt/solver/macro-finder.ts +530 -0
  297. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  298. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  299. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  300. package/src/prover/smt/solver/max-cliques.ts +105 -0
  301. package/src/prover/smt/solver/maxcore.ts +309 -0
  302. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  303. package/src/prover/smt/solver/maxlex.ts +115 -0
  304. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  305. package/src/prover/smt/solver/maxsmt.ts +92 -0
  306. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  307. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  308. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  309. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  310. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  311. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  312. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  313. package/src/prover/smt/solver/model-checker.ts +17 -26
  314. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  315. package/src/prover/smt/solver/model-finder.ts +0 -1
  316. package/src/prover/smt/solver/model-generator.ts +59 -30
  317. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  318. package/src/prover/smt/solver/model-printer.ts +214 -0
  319. package/src/prover/smt/solver/mpf.ts +709 -0
  320. package/src/prover/smt/solver/mus.ts +50 -0
  321. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  322. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  323. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  324. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  325. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  326. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  327. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  328. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  329. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  330. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  331. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  332. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  333. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  334. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  335. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  336. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  337. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  338. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  339. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  340. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  341. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  342. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  343. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  344. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  345. package/src/prover/smt/solver/nlqsat.ts +484 -0
  346. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  347. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  348. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  349. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  350. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  351. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  352. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  353. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  354. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  355. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  356. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  357. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  358. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  359. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  360. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  361. package/src/prover/smt/solver/nnf.ts +105 -23
  362. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  363. package/src/prover/smt/solver/occf.ts +97 -0
  364. package/src/prover/smt/solver/opt-context.ts +792 -0
  365. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  366. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  367. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  368. package/src/prover/smt/solver/opt-solver.ts +311 -0
  369. package/src/prover/smt/solver/opt-value.ts +55 -0
  370. package/src/prover/smt/solver/optsmt.ts +692 -0
  371. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  372. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  373. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  374. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  375. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  376. package/src/prover/smt/solver/probes.ts +511 -0
  377. package/src/prover/smt/solver/propagate-values.ts +37 -21
  378. package/src/prover/smt/solver/proto-model.ts +650 -17
  379. package/src/prover/smt/solver/pull-quant.ts +28 -12
  380. package/src/prover/smt/solver/purify-arith.ts +632 -0
  381. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  382. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  383. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  384. package/src/prover/smt/solver/qe-lite.ts +37 -17
  385. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  386. package/src/prover/smt/solver/qe.ts +1499 -0
  387. package/src/prover/smt/solver/qel.ts +25 -0
  388. package/src/prover/smt/solver/qi-queue.ts +0 -1
  389. package/src/prover/smt/solver/qsat.ts +814 -0
  390. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  391. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  392. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  393. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  394. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  395. package/src/prover/smt/solver/random-gen.ts +0 -1
  396. package/src/prover/smt/solver/rational.ts +45 -1
  397. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  398. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  399. package/src/prover/smt/solver/reduce-args.ts +225 -0
  400. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  401. package/src/prover/smt/solver/ref-vector.ts +0 -1
  402. package/src/prover/smt/solver/relevancy.ts +1 -2
  403. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  404. package/src/prover/smt/solver/rewriter.ts +475 -36
  405. package/src/prover/smt/solver/rlimit.ts +38 -2
  406. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  407. package/src/prover/smt/solver/sat/big.ts +177 -0
  408. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  409. package/src/prover/smt/solver/sat/clause.ts +203 -0
  410. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  411. package/src/prover/smt/solver/sat/config.ts +122 -0
  412. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  413. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  414. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  415. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  416. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  417. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  418. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  419. package/src/prover/smt/solver/sat/probing.ts +170 -0
  420. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  421. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  422. package/src/prover/smt/solver/sat/scc.ts +142 -0
  423. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  424. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  425. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  426. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  427. package/src/prover/smt/solver/search-tree.ts +284 -0
  428. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  429. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  430. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  431. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  432. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  433. package/src/prover/smt/solver/seq-factory.ts +89 -0
  434. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  435. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  436. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  437. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  438. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  439. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  440. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  441. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  442. package/src/prover/smt/solver/seq-subset.ts +165 -0
  443. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  444. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  445. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  446. package/src/prover/smt/solver/smt-logics.ts +66 -0
  447. package/src/prover/smt/solver/smt-setup.ts +544 -0
  448. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  449. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  450. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  451. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  452. package/src/prover/smt/solver/solver.ts +113 -22
  453. package/src/prover/smt/solver/static-features.ts +314 -0
  454. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  455. package/src/prover/smt/solver/tactic.ts +2012 -0
  456. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  457. package/src/prover/smt/solver/theory-array.ts +1240 -0
  458. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  459. package/src/prover/smt/solver/theory-char.ts +355 -0
  460. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  461. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  462. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  463. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  464. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  465. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  466. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  467. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  468. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  469. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  470. package/src/prover/smt/solver/theory-lra.ts +188 -2
  471. package/src/prover/smt/solver/theory-pb.ts +933 -0
  472. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  473. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  474. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  475. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  476. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  477. package/src/prover/smt/solver/theory-seq.ts +961 -0
  478. package/src/prover/smt/solver/theory.ts +189 -0
  479. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  480. package/src/prover/smt/solver/var-subst.ts +36 -14
  481. package/src/prover/smt/table.ts +3 -2
  482. package/src/prover/smt/types.ts +146 -0
  483. package/src/prover/tlapm/cache.ts +29 -8
  484. package/src/prover/tlapm-library.ts +3208 -0
  485. package/src/prover/verdict.ts +2 -0
  486. package/src/prover/zenon/decide.ts +10 -7
  487. package/src/prover/zenon/encode.ts +0 -2
  488. package/src/prover/zenon/eqrel.ts +0 -2
  489. package/src/prover/zenon/equality-rules.ts +24 -2
  490. package/src/prover/zenon/expr.ts +21 -2
  491. package/src/prover/zenon/index-table.ts +7 -4
  492. package/src/prover/zenon/isar-case.ts +1 -3
  493. package/src/prover/zenon/isar.ts +2 -4
  494. package/src/prover/zenon/llproof.ts +0 -2
  495. package/src/prover/zenon/mltoll.ts +0 -2
  496. package/src/prover/zenon/node.ts +20 -5
  497. package/src/prover/zenon/parse.ts +6 -2
  498. package/src/prover/zenon/phrase.ts +1 -3
  499. package/src/prover/zenon/proof.ts +0 -2
  500. package/src/prover/zenon/propositional-rules.ts +0 -2
  501. package/src/prover/zenon/rules.ts +2 -3
  502. package/src/prover/zenon/search.ts +7 -5
  503. package/src/prover/zenon/tla/functions.ts +0 -2
  504. package/src/prover/zenon/tla/llproof.ts +0 -2
  505. package/src/prover/zenon/tla/records.ts +0 -2
  506. package/src/prover/zenon/tla/rewrites.ts +0 -2
  507. package/src/prover/zenon/tla/sets.ts +7 -8
  508. package/src/prover/zenon/tla/terms.ts +0 -2
  509. package/src/prover/zenon/tla/tla.ts +0 -2
  510. package/src/resolve.ts +264 -77
  511. package/src/runtime.ts +6 -0
  512. package/src/sany/generation.ts +1 -13
  513. package/src/sany/generator-definitions.ts +2 -1
  514. package/src/sany/generator-expressions.ts +30 -27
  515. package/src/sany/generator-proofs.ts +1 -1
  516. package/src/sany/generator.ts +2 -1
  517. package/src/sany/levels.ts +0 -2
  518. package/src/sany/linter.ts +0 -2
  519. package/src/sany/nodes.ts +1 -1
  520. package/src/sany/selectors.ts +6 -5
  521. package/src/search.ts +209 -56
  522. package/src/simulate.ts +3 -0
  523. package/src/spec-description.ts +2 -2
  524. package/src/standard-definitions.ts +4 -0
  525. package/src/state-graph.ts +0 -2
  526. package/src/subexpressions.ts +165 -78
  527. package/src/successors.ts +2 -1
  528. package/src/symmetry.ts +2 -2
  529. package/src/tableau.ts +2 -2
  530. package/src/tlc/fingerprint.ts +81 -9
  531. package/src/tlc/jar-data.ts +12 -0
  532. package/src/tlc/order.ts +14 -3
  533. package/src/tlc/summary.ts +29 -14
  534. package/src/tlc/tlcext-operators.ts +61 -16
  535. package/src/tlc/trace-spec.ts +2 -3
  536. package/src/typed-tier.ts +6541 -0
  537. package/src/typescript/types.ts +2 -2
  538. package/src/values.ts +42 -23
  539. package/src/prover/isabelle/isar/statement.ts +0 -52
  540. package/src/prover/smt/solver/z3-license.txt +0 -10
  541. package/src/prover/tlaps-module.ts +0 -510
  542. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,527 @@
1
+ import { SmtUnsupportedError } from "../../../../errors";
2
+ import { mkArrayApp } from "../array-decl-plugin";
3
+ import {
4
+ OP_ARRAY_DEFAULT,
5
+ OP_ARRAY_EXT,
6
+ OP_AS_ARRAY,
7
+ OP_CONST_ARRAY,
8
+ OP_SELECT,
9
+ OP_STORE,
10
+ } from "../ast";
11
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
12
+ import { NULL_LITERAL } from "../sat/clause";
13
+ import { hasLargeDomain, hasUnitaryDomain } from "../theory-array";
14
+ import {
15
+ ArrayInternalize,
16
+ type AxiomRecord,
17
+ KIND_CONGRUENCE,
18
+ KIND_DEFAULT,
19
+ KIND_EXTENSIONALITY,
20
+ KIND_SELECT,
21
+ KIND_STORE,
22
+ STATE_DELAYED,
23
+ STATE_NEW,
24
+ } from "./array-internalize";
25
+ import type { Enode } from "./egraph";
26
+
27
+ interface Reach {
28
+ readonly root: Enode;
29
+ readonly parent: Reach | null;
30
+ readonly store: Enode | null;
31
+ }
32
+
33
+ export abstract class ArrayAxioms extends ArrayInternalize {
34
+ private sort2epsilon = new Map<number, number>();
35
+ private sort2diag = new Map<number, number>();
36
+
37
+ protected abstract collectDefaults(): void;
38
+ protected abstract mustHaveDifferentModelValues(first: number, second: number): boolean;
39
+
40
+ protected mkSelect(args: number[]) {
41
+ return mkArrayApp(this.manager, OP_SELECT, args);
42
+ }
43
+
44
+ private mkDefault(array: number) {
45
+ return mkArrayApp(this.manager, OP_ARRAY_DEFAULT, [array]);
46
+ }
47
+
48
+ private withTemporaries<T>(body: () => T) {
49
+ return this.manager.withTemporaries(body, () => []);
50
+ }
51
+
52
+ private rewriteLater(expr: number) {
53
+ const rewritten = this.rewrite(expr);
54
+ this.manager.releaseLater(rewritten);
55
+ return rewritten;
56
+ }
57
+
58
+ private getAppArgs(expr: number) {
59
+ return [...this.manager.getArgs(expr)];
60
+ }
61
+
62
+ protected assertAxiom(index: number) {
63
+ const record = this.axiomTrail[index];
64
+ switch (record.kind) {
65
+ case KIND_STORE:
66
+ return this.assertStoreAxiom(record.node.owner);
67
+ case KIND_SELECT:
68
+ return this.assertSelect(index, record);
69
+ case KIND_DEFAULT:
70
+ return this.assertDefault(record);
71
+ case KIND_EXTENSIONALITY:
72
+ return this.assertExtensionality(record.node.owner, (record.select as Enode).owner);
73
+ case KIND_CONGRUENCE:
74
+ throw new SmtUnsupportedError("sat.euf array lambdas");
75
+ }
76
+ return false;
77
+ }
78
+
79
+ private assertDefault(record: AxiomRecord) {
80
+ const child = record.node.owner;
81
+ if (this.isOp(child, OP_CONST_ARRAY)) return this.assertDefaultConstAxiom(child);
82
+ if (this.isOp(child, OP_STORE)) return this.assertDefaultStoreAxiom(child);
83
+ if (this.isMapCombinator(child)) return this.assertDefaultMapAxiom(child);
84
+ return false;
85
+ }
86
+
87
+ private assertSelect(index: number, record: AxiomRecord) {
88
+ const child = record.node.owner;
89
+ const select = (record.select as Enode).owner;
90
+ const isDelaying =
91
+ (record.select as Enode).getArg(0).root !== record.node.root &&
92
+ record.state !== STATE_DELAYED &&
93
+ this.isDelayEnabled;
94
+ if (isDelaying) {
95
+ this.ctx.trail.push(() => {
96
+ this.axiomTrail[index].state = STATE_NEW;
97
+ });
98
+ record.state = STATE_DELAYED;
99
+ return false;
100
+ }
101
+ if (this.isOp(child, OP_CONST_ARRAY)) return this.assertSelectConstAxiom(select, child);
102
+ if (this.isOp(child, OP_AS_ARRAY)) return this.assertSelectAsArrayAxiom(select, child);
103
+ if (this.isOp(child, OP_STORE)) return this.assertSelectStoreAxiom(select, child);
104
+ if (this.isMapCombinator(child)) return this.assertSelectMapAxiom(select, child);
105
+ return this.assertSelectLambdaAxiom(select, child);
106
+ }
107
+
108
+ private propagateAxiomEq(first: Enode, second: Enode, eqs: readonly (readonly [Enode, Enode])[]) {
109
+ if (first.root === second.root) return false;
110
+ return this.propagateEq([], eqs, first, second);
111
+ }
112
+
113
+ private assertStoreAxiom(store: number) {
114
+ const args = this.getAppArgs(store);
115
+ const select = this.mkSelect([store, ...args.slice(1, -1)]);
116
+ return this.propagateAxiomEq(
117
+ this.eInternalize(select),
118
+ this.expr2enode(args[args.length - 1]) as Enode,
119
+ [],
120
+ );
121
+ }
122
+
123
+ private assertSelectStoreAxiom(select: number, store: number) {
124
+ const manager = this.manager;
125
+ const selectArgs = this.getAppArgs(select);
126
+ const storeArgs = this.getAppArgs(store);
127
+ const numArgs = selectArgs.length;
128
+ let hasDiff = false;
129
+ for (let index = 1; index < numArgs; index++)
130
+ hasDiff ||=
131
+ (this.expr2enode(selectArgs[index]) as Enode).root !==
132
+ (this.expr2enode(storeArgs[index]) as Enode).root;
133
+ if (!hasDiff) return false;
134
+ const indices = selectArgs.slice(1);
135
+ const firstSelect = this.mkSelect([store, ...indices]);
136
+ const secondSelect = this.mkSelect([storeArgs[0], ...indices]);
137
+ const selectEqExpr = manager.mkEq(firstSelect, secondSelect);
138
+ const egraph = this.ctx.egraph;
139
+ let isNew = egraph.find(firstSelect) === undefined || egraph.find(secondSelect) === undefined;
140
+ const firstNode = this.eInternalize(firstSelect);
141
+ const secondNode = this.eInternalize(secondSelect);
142
+ if (firstNode.root === secondNode.root) return isNew;
143
+ let selectEq = NULL_LITERAL;
144
+ const initSelectEq = () => {
145
+ if (selectEq !== NULL_LITERAL) return true;
146
+ selectEq = this.mkLiteral(selectEqExpr);
147
+ return this.s.value(selectEq) !== L_TRUE;
148
+ };
149
+ for (let index = 1; index < numArgs; index++) {
150
+ const storeIndex = storeArgs[index];
151
+ const selectIndex = selectArgs[index];
152
+ if (this.expr2enode(storeIndex) === this.expr2enode(selectIndex)) continue;
153
+ if (manager.areDistinct(storeIndex, selectIndex)) {
154
+ if (initSelectEq() && this.addClause([selectEq])) isNew = true;
155
+ break;
156
+ }
157
+ const indexEq = this.eqInternalize(storeIndex, selectIndex);
158
+ if (this.s.value(indexEq) === L_TRUE) continue;
159
+ if (this.s.value(indexEq) === L_UNDEF) isNew = true;
160
+ if (!initSelectEq()) break;
161
+ if (this.addClause([indexEq, selectEq])) isNew = true;
162
+ }
163
+ return isNew;
164
+ }
165
+
166
+ private assertSelectConstAxiom(select: number, constArray: number) {
167
+ const value = this.manager.getArg(constArray, 0);
168
+ const constSelect = this.mkSelect([constArray, ...this.getAppArgs(select).slice(1)]);
169
+ return this.propagateAxiomEq(
170
+ this.eInternalize(constSelect),
171
+ this.expr2enode(value) as Enode,
172
+ [],
173
+ );
174
+ }
175
+
176
+ private assertExtensionality(first: number, second: number) {
177
+ const manager = this.manager;
178
+ return this.withTemporaries(() => {
179
+ const diffs = this.sort2diff(manager.sorts[first]).map((decl) =>
180
+ this.rewriteLater(manager.mkApp(decl, [first, second], manager.funcDecls[decl].range)),
181
+ );
182
+ const firstSelect = this.mkSelect([first, ...diffs]);
183
+ const secondSelect = this.mkSelect([second, ...diffs]);
184
+ const arrayEq = this.eqInternalize(first, second);
185
+ const selectEq = this.eqInternalize(firstSelect, secondSelect);
186
+ return this.addClause([arrayEq, selectEq ^ 1]);
187
+ });
188
+ }
189
+
190
+ private assertSelectMapAxiom(select: number, map: number) {
191
+ const indices = this.getAppArgs(select).slice(1);
192
+ return this.withTemporaries(() => {
193
+ const selects = this.getAppArgs(map).map((arg) => this.mkSelect([arg, ...indices]));
194
+ const mapSelect = this.mkSelect([map, ...indices]);
195
+ const applied = this.rewriteLater(this.applyMap(map, selects));
196
+ return this.propagateAxiomEq(this.eInternalize(mapSelect), this.eInternalize(applied), []);
197
+ });
198
+ }
199
+
200
+ private assertSelectAsArrayAxiom(select: number, asArray: number) {
201
+ const manager = this.manager;
202
+ const decl = manager.funcDecls[manager.decls[asArray]].parameters[0];
203
+ const indices = this.getAppArgs(select).slice(1);
204
+ const asArraySelect = this.mkSelect([asArray, ...indices]);
205
+ const value = manager.mkApp(decl, indices, manager.funcDecls[decl].range);
206
+ return this.propagateAxiomEq(this.eInternalize(asArraySelect), this.eInternalize(value), []);
207
+ }
208
+
209
+ // Owned by the caller's temporaries.
210
+ private applyMap(map: number, args: number[]) {
211
+ const manager = this.manager;
212
+ const decl = manager.funcDecls[manager.decls[map]].parameters[0];
213
+ return this.rewriteLater(manager.mkApp(decl, args, manager.funcDecls[decl].range));
214
+ }
215
+
216
+ private assertDefaultMapAxiom(map: number) {
217
+ return this.withTemporaries(() => {
218
+ const defaults = this.getAppArgs(map).map((arg) => this.mkDefault(arg));
219
+ const mapDefault = this.mkDefault(map);
220
+ const applied = this.applyMap(map, defaults);
221
+ return this.propagateAxiomEq(this.eInternalize(mapDefault), this.eInternalize(applied), []);
222
+ });
223
+ }
224
+
225
+ private assertDefaultConstAxiom(constArray: number) {
226
+ const value = this.manager.getArg(constArray, 0);
227
+ return this.propagateAxiomEq(
228
+ this.expr2enode(value) as Enode,
229
+ this.eInternalize(this.mkDefault(constArray)),
230
+ [],
231
+ );
232
+ }
233
+
234
+ private assertDefaultStoreAxiom(store: number) {
235
+ const manager = this.manager;
236
+ const args = this.getAppArgs(store);
237
+ const storeDefaultExpr = this.mkDefault(store);
238
+ const arrayDefaultExpr = this.mkDefault(args[0]);
239
+ const isNew =
240
+ this.ctx.getEnode(storeDefaultExpr) === undefined ||
241
+ this.ctx.getEnode(arrayDefaultExpr) === undefined;
242
+ const storeDefault = this.eInternalize(storeDefaultExpr);
243
+ const internalizedArrayDefault = this.eInternalize(arrayDefaultExpr);
244
+ const arrayDefault = hasUnitaryDomain(manager, store)
245
+ ? this.eInternalize(args[args.length - 1])
246
+ : internalizedArrayDefault;
247
+ if (!hasUnitaryDomain(manager, store) && !hasLargeDomain(manager, store)) {
248
+ const epsilons: number[] = [];
249
+ const diagonals: number[] = [];
250
+ for (const arg of args.slice(1, -1)) {
251
+ const sort = manager.sorts[arg];
252
+ const epsilon = this.mkEpsilon(sort);
253
+ epsilons.push(epsilon.epsilon);
254
+ diagonals.push(manager.mkApp(epsilon.diag, [arg], sort));
255
+ }
256
+ const isFirst = this.propagateAxiomEq(
257
+ this.eInternalize(this.mkSelect([store, ...epsilons])),
258
+ storeDefault,
259
+ [],
260
+ );
261
+ const isSecond = this.propagateAxiomEq(
262
+ this.eInternalize(this.mkSelect([args[0], ...epsilons])),
263
+ arrayDefault,
264
+ [],
265
+ );
266
+ const isThird = this.propagateAxiomEq(
267
+ this.eInternalize(this.mkSelect([store, ...diagonals])),
268
+ this.eInternalize(this.mkSelect([args[0], ...diagonals])),
269
+ [],
270
+ );
271
+ return isFirst || isSecond || isThird || isNew;
272
+ }
273
+ return this.propagateAxiomEq(storeDefault, arrayDefault, []) || isNew;
274
+ }
275
+
276
+ private assertSelectLambdaAxiom(select: number, lambda: number) {
277
+ return this.withTemporaries(() => {
278
+ const alpha = this.mkSelect([lambda, ...this.getAppArgs(select).slice(1)]);
279
+ const beta = this.rewriteLater(alpha);
280
+ return this.propagateAxiomEq(this.eInternalize(alpha), this.eInternalize(beta), []);
281
+ });
282
+ }
283
+
284
+ private mkEpsilon(sort: number) {
285
+ const manager = this.manager;
286
+ const trail = this.ctx.trail;
287
+ let epsilon = this.sort2epsilon.get(sort);
288
+ if (epsilon === undefined) {
289
+ const created = manager.mkFreshConst("epsilon", sort);
290
+ manager.incRef(created);
291
+ this.sort2epsilon.set(sort, created);
292
+ trail.push(() => {
293
+ this.sort2epsilon.delete(sort);
294
+ manager.decRef(created);
295
+ });
296
+ epsilon = created;
297
+ }
298
+ let diag = this.sort2diag.get(sort);
299
+ if (diag === undefined) {
300
+ const created = manager.mkFreshFuncDecl("diag", [sort], sort);
301
+ this.sort2diag.set(sort, created);
302
+ trail.push(() => this.sort2diag.delete(sort));
303
+ diag = created;
304
+ }
305
+ return { epsilon, diag };
306
+ }
307
+
308
+ protected addDelayedAxioms() {
309
+ let isChanged = false;
310
+ for (let thVar = 0; thVar < this.numVars; thVar++) {
311
+ const data = this.getVarData(thVar);
312
+ if (!data.isPropUpward) continue;
313
+ const node = this.var2enodeOf(thVar);
314
+ for (const lambda of data.parentLambdas) this.propagateSelectAxioms(data, lambda);
315
+ if (this.addAsArrayEqs(node)) isChanged = true;
316
+ if (!node.parents.some((parent) => this.isOp(parent.owner, OP_ARRAY_DEFAULT)))
317
+ this.propagateParentDefault(thVar);
318
+ }
319
+ const size = this.axiomTrail.length;
320
+ for (this.delayQhead = 0; this.delayQhead < size; this.delayQhead++)
321
+ if (
322
+ this.axiomTrail[this.delayQhead].state === STATE_DELAYED &&
323
+ this.assertAxiom(this.delayQhead)
324
+ )
325
+ isChanged = true;
326
+ this.isDelayEnabled = false;
327
+ if (this.unitPropagate()) isChanged = true;
328
+ this.isDelayEnabled = true;
329
+ return isChanged;
330
+ }
331
+
332
+ private addAsArrayEqs(node: Enode) {
333
+ const manager = this.manager;
334
+ if (!this.isOp(node.owner, OP_AS_ARRAY)) return false;
335
+ const decl = manager.funcDecls[manager.decls[node.owner]].parameters[0];
336
+ const nodes = this.ctx.egraph.enodesOf(decl);
337
+ let isChanged = false;
338
+ for (let index = 0; index < nodes.length; index++) {
339
+ const app = nodes[index];
340
+ const select = this.mkSelect([node.owner, ...this.getAppArgs(app.owner)]);
341
+ if (this.eInternalize(select).root !== app.root) {
342
+ this.addUnit(this.eqInternalize(select, app.owner));
343
+ isChanged = true;
344
+ }
345
+ }
346
+ return isChanged;
347
+ }
348
+
349
+ protected addInterfaceEqualities() {
350
+ const manager = this.manager;
351
+ this.collectDefaults();
352
+ const roots = this.collectSharedVars();
353
+ let isPropagated = false;
354
+ for (let first = roots.length; first-- > 0;) {
355
+ const firstVar = roots[first];
356
+ const firstExpr = this.var2expr(firstVar);
357
+ for (let second = first; second-- > 0;) {
358
+ const secondVar = roots[second];
359
+ const secondExpr = this.var2expr(secondVar);
360
+ if (manager.sorts[firstExpr] !== manager.sorts[secondExpr]) continue;
361
+ if (this.mustHaveDifferentModelValues(firstVar, secondVar)) continue;
362
+ if (this.ctx.egraph.areDiseq(this.var2enodeOf(firstVar), this.var2enodeOf(secondVar)))
363
+ continue;
364
+ if (this.s.value(this.eqInternalize(firstExpr, secondExpr)) === L_UNDEF)
365
+ isPropagated = true;
366
+ }
367
+ }
368
+ return isPropagated;
369
+ }
370
+
371
+ private collectSharedVars() {
372
+ const roots: number[] = [];
373
+ const marked = new Set<Enode>();
374
+ for (let thVar = 0; thVar < this.numVars; thVar++) {
375
+ const node = this.var2enodeOf(thVar);
376
+ if (!this.isArray(node.owner)) continue;
377
+ const root = node.root;
378
+ if (marked.has(root)) continue;
379
+ if (this.ctx.isShared(root) || this.isSharedArg(root)) roots.push(root.getThVar(this.id));
380
+ marked.add(root);
381
+ }
382
+ return roots;
383
+ }
384
+
385
+ protected checkLambdas() {
386
+ for (let thVar = 0; thVar < this.numVars; thVar++) {
387
+ const node = this.var2enodeOf(thVar);
388
+ if (!this.isOp(node.owner, OP_AS_ARRAY) && !this.isLambda(node.owner)) continue;
389
+ for (const parent of node.parents) if (!this.ctx.isBetaRedex(parent, node)) return false;
390
+ }
391
+ return true;
392
+ }
393
+
394
+ private isSharedArg(root: Enode) {
395
+ for (const parent of root.parents) {
396
+ const expr = parent.owner;
397
+ if (this.isOp(expr, OP_SELECT))
398
+ for (let index = 1; index < parent.numArgs; index++)
399
+ if (root === parent.getArg(index).root) return true;
400
+ if (this.isOp(expr, OP_CONST_ARRAY)) return true;
401
+ if (this.isOp(expr, OP_ARRAY_EXT)) return true;
402
+ }
403
+ return false;
404
+ }
405
+
406
+ protected checkConstArrays() {
407
+ const manager = this.manager;
408
+ const constArrays: Enode[] = [];
409
+ const seen = new Set<Enode>();
410
+ for (let thVar = 0; thVar < this.numVars; thVar++) {
411
+ const node = this.var2enodeOf(thVar);
412
+ if (!this.isOp(node.owner, OP_CONST_ARRAY) || seen.has(node.root)) continue;
413
+ seen.add(node.root);
414
+ constArrays.push(node);
415
+ }
416
+ if (constArrays.length < 2) return L_TRUE;
417
+ const reachable = (constArray: Enode) => {
418
+ const initial: Reach = { root: constArray.root, parent: null, store: null };
419
+ const result = [initial];
420
+ const visited = new Set([constArray.root]);
421
+ for (let qhead = 0; qhead < result.length; qhead++) {
422
+ const current = result[qhead];
423
+ for (const parent of current.root.parents) {
424
+ if (!this.isOp(parent.owner, OP_STORE) || parent.getArg(0).root !== current.root)
425
+ continue;
426
+ if (visited.has(parent.root)) continue;
427
+ visited.add(parent.root);
428
+ result.push({ root: parent.root, parent: current, store: parent });
429
+ }
430
+ }
431
+ return result;
432
+ };
433
+ const isSameIndex = (first: Enode, second: Enode) => {
434
+ if (first.numArgs !== second.numArgs) return false;
435
+ for (let index = 1; index + 1 < first.numArgs; index++)
436
+ if (first.getArg(index).root !== second.getArg(index).root) return false;
437
+ return true;
438
+ };
439
+ const addEq = (first: Enode, second: Enode, eqs: [Enode, Enode][]) => {
440
+ if (first !== second) eqs.push([first, second]);
441
+ };
442
+ const addIndices = (inputPath: Reach, indices: Enode[], eqs: [Enode, Enode][]) => {
443
+ for (let path = inputPath; path.store !== null; path = path.parent as Reach) {
444
+ const store = path.store;
445
+ const old = indices.find((index) => isSameIndex(store, index));
446
+ if (old === undefined) {
447
+ indices.push(store);
448
+ continue;
449
+ }
450
+ for (let index = 1; index + 1 < store.numArgs; index++)
451
+ addEq(store.getArg(index), old.getArg(index), eqs);
452
+ }
453
+ };
454
+ const addPathEqs = (constArray: Enode, inputPath: Reach, eqs: [Enode, Enode][]) => {
455
+ let initial = inputPath;
456
+ while (initial.parent !== null) initial = initial.parent;
457
+ addEq(constArray, initial.root, eqs);
458
+ for (let path = inputPath; path.store !== null; path = path.parent as Reach) {
459
+ addEq(path.store.getArg(0), (path.parent as Reach).root, eqs);
460
+ addEq(path.store, path.root, eqs);
461
+ }
462
+ };
463
+ const internalizeSelect = (constArray: Enode, indices: number[]) => {
464
+ const select = this.mkSelect([constArray.owner, ...indices]);
465
+ const isNew = this.ctx.egraph.find(select) === undefined;
466
+ this.eInternalize(select);
467
+ return isNew;
468
+ };
469
+ const allReachable = constArrays.map(reachable);
470
+ let hasUninterpreted = false;
471
+ for (let first = 0; first < constArrays.length; first++) {
472
+ const firstValue = constArrays[first].getArg(0);
473
+ for (let second = first + 1; second < constArrays.length; second++) {
474
+ const secondValue = constArrays[second].getArg(0);
475
+ if (firstValue.root === secondValue.root) continue;
476
+ let firstPath: Reach | undefined;
477
+ let secondPath: Reach | undefined;
478
+ for (const firstReach of allReachable[first]) {
479
+ secondPath = allReachable[second].find((reach) => reach.root === firstReach.root);
480
+ if (secondPath !== undefined) {
481
+ firstPath = firstReach;
482
+ break;
483
+ }
484
+ }
485
+ if (firstPath === undefined || secondPath === undefined) continue;
486
+ const indices: Enode[] = [];
487
+ const eqs: [Enode, Enode][] = [];
488
+ addIndices(firstPath, indices, eqs);
489
+ addIndices(secondPath, indices, eqs);
490
+ const sort = manager.sorts[constArrays[first].owner];
491
+ const numIndices = BigInt(indices.length);
492
+ let isDomainExceedingIndices = false;
493
+ let domainSize = 1n;
494
+ let hasUninterp = false;
495
+ for (const domain of manager.getSortParameters(sort).slice(0, -1)) {
496
+ if (manager.isUninterpretedSort(domain)) {
497
+ hasUninterp = true;
498
+ continue;
499
+ }
500
+ const size = manager.getSortSize(domain);
501
+ if (size < 0n || size > numIndices || domainSize > numIndices / size) {
502
+ isDomainExceedingIndices = true;
503
+ break;
504
+ }
505
+ domainSize *= size;
506
+ }
507
+ if (isDomainExceedingIndices || domainSize > numIndices) {
508
+ addPathEqs(constArrays[first], firstPath, eqs);
509
+ addPathEqs(constArrays[second], secondPath, eqs);
510
+ this.propagateAxiomEq(firstValue, secondValue, eqs);
511
+ return L_FALSE;
512
+ }
513
+ let isNew = false;
514
+ for (const store of indices) {
515
+ const storeIndices: number[] = [];
516
+ for (let index = 1; index + 1 < store.numArgs; index++)
517
+ storeIndices.push(store.getArg(index).owner);
518
+ isNew = internalizeSelect(constArrays[first], storeIndices) || isNew;
519
+ isNew = internalizeSelect(constArrays[second], storeIndices) || isNew;
520
+ }
521
+ if (isNew) return L_FALSE;
522
+ if (hasUninterp) hasUninterpreted = true;
523
+ }
524
+ }
525
+ return hasUninterpreted ? L_UNDEF : L_TRUE;
526
+ }
527
+ }