tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.6b2a6741a

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 (551) 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 +5 -1
  8. package/dist/index.d.ts +5 -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 +43 -40
  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 +4 -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/cli/xml-exporter.ts +1 -1
  36. package/src/codegen.ts +9 -5
  37. package/src/dependencies.ts +72 -11
  38. package/src/dfid.ts +9 -2
  39. package/src/environment.ts +65 -36
  40. package/src/errors.ts +38 -3
  41. package/src/evaluate.ts +92 -32
  42. package/src/exit-codes.ts +5 -2
  43. package/src/instances.ts +5 -5
  44. package/src/java-overrides.ts +2 -2
  45. package/src/levels.ts +138 -90
  46. package/src/lexer.ts +5 -3
  47. package/src/liveness-checker.ts +572 -204
  48. package/src/liveness.ts +47 -32
  49. package/src/obligations/action.ts +10 -6
  50. package/src/obligations/anonymize.ts +33 -14
  51. package/src/obligations/enabled-axioms.ts +218 -0
  52. package/src/obligations/equality.ts +1 -3
  53. package/src/obligations/expression.ts +18 -6
  54. package/src/obligations/format.ts +0 -2
  55. package/src/obligations/generate.ts +22 -17
  56. package/src/obligations/index.ts +37 -7
  57. package/src/obligations/levels.ts +24 -11
  58. package/src/obligations/module.ts +1 -3
  59. package/src/obligations/normalize.ts +25 -17
  60. package/src/obligations/operators.ts +0 -2
  61. package/src/obligations/pragma.ts +53 -16
  62. package/src/obligations/printer.ts +48 -18
  63. package/src/obligations/proof.ts +3 -2
  64. package/src/obligations/regroup.ts +0 -2
  65. package/src/obligations/simplify.ts +17 -7
  66. package/src/obligations/source.ts +71 -17
  67. package/src/obligations/subexpression.ts +45 -18
  68. package/src/obligations/substitution.ts +1 -3
  69. package/src/obligations/temporal.ts +0 -2
  70. package/src/obligations/tuples.ts +0 -2
  71. package/src/parallel-worker.ts +8 -2
  72. package/src/parallel.ts +7 -2
  73. package/src/parser.ts +664 -287
  74. package/src/pretty-print.ts +1 -1
  75. package/src/prover/deciders.ts +11 -8
  76. package/src/prover/isabelle/decide.ts +3 -25
  77. package/src/prover/isabelle/encode.ts +71 -41
  78. package/src/prover/isabelle/isar/attrib.ts +250 -0
  79. package/src/prover/isabelle/isar/context.ts +335 -0
  80. package/src/prover/isabelle/isar/induct.ts +382 -0
  81. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  82. package/src/prover/isabelle/isar/method.ts +506 -198
  83. package/src/prover/isabelle/isar/proof.ts +570 -14
  84. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  85. package/src/prover/isabelle/isar/theory.ts +479 -69
  86. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  87. package/src/prover/isabelle/isar/type-check.ts +83 -8
  88. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  91. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  92. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  93. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  94. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  95. package/src/prover/isabelle/provers/classical.ts +45 -20
  96. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  97. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  98. package/src/prover/isabelle/pure/consts.ts +0 -2
  99. package/src/prover/isabelle/pure/conv.ts +0 -2
  100. package/src/prover/isabelle/pure/drule.ts +63 -4
  101. package/src/prover/isabelle/pure/envir.ts +0 -2
  102. package/src/prover/isabelle/pure/goal.ts +1 -3
  103. package/src/prover/isabelle/pure/logic.ts +0 -2
  104. package/src/prover/isabelle/pure/name.ts +0 -2
  105. package/src/prover/isabelle/pure/net.ts +0 -2
  106. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  107. package/src/prover/isabelle/pure/pattern.ts +0 -2
  108. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  109. package/src/prover/isabelle/pure/rewriter.ts +4 -11
  110. package/src/prover/isabelle/pure/search.ts +0 -2
  111. package/src/prover/isabelle/pure/seq.ts +0 -2
  112. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  113. package/src/prover/isabelle/pure/table.ts +0 -2
  114. package/src/prover/isabelle/pure/tactic.ts +0 -2
  115. package/src/prover/isabelle/pure/tactical.ts +0 -2
  116. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  117. package/src/prover/isabelle/pure/term.ts +3 -5
  118. package/src/prover/isabelle/pure/thm.ts +0 -2
  119. package/src/prover/isabelle/pure/type.ts +0 -2
  120. package/src/prover/isabelle/pure/unify.ts +0 -2
  121. package/src/prover/isabelle/pure/variable.ts +0 -2
  122. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  123. package/src/prover/isabelle/tla/context.ts +51 -9
  124. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  125. package/src/prover/isabelle/tla/logic.ts +40 -1
  126. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  127. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  128. package/src/prover/ocaml.ts +4 -1
  129. package/src/prover/prep/action.ts +19 -12
  130. package/src/prover/prep/enabled-axioms.ts +11 -2
  131. package/src/prover/prep/md5.ts +26 -29
  132. package/src/prover/prep/methods.ts +159 -50
  133. package/src/prover/prep/normalize.ts +38 -9
  134. package/src/prover/prove.ts +343 -65
  135. package/src/prover/ptl/decide.ts +95 -50
  136. package/src/prover/ptl/encode.ts +2 -3
  137. package/src/prover/ptl/tableau.ts +28 -2
  138. package/src/prover/smt/arithmetic.ts +310 -0
  139. package/src/prover/smt/axioms.ts +12 -8
  140. package/src/prover/smt/context.ts +42 -6
  141. package/src/prover/smt/data.ts +191 -84
  142. package/src/prover/smt/encode.ts +122 -43
  143. package/src/prover/smt/extensionality.ts +5 -3
  144. package/src/prover/smt/flatten.ts +4 -6
  145. package/src/prover/smt/format.ts +28 -4
  146. package/src/prover/smt/instances.ts +7 -1
  147. package/src/prover/smt/layout.ts +91 -0
  148. package/src/prover/smt/rewrite.ts +483 -116
  149. package/src/prover/smt/simplify.ts +441 -0
  150. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  151. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  152. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  153. package/src/prover/smt/solver/act-cache.ts +0 -1
  154. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  155. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  156. package/src/prover/smt/solver/aig.ts +889 -0
  157. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  158. package/src/prover/smt/solver/arith-terms.ts +121 -0
  159. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  160. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  161. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  162. package/src/prover/smt/solver/ast-lt.ts +165 -11
  163. package/src/prover/smt/solver/ast-util.ts +160 -2
  164. package/src/prover/smt/solver/ast.ts +1449 -41
  165. package/src/prover/smt/solver/auf-solver.ts +0 -1
  166. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  167. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  168. package/src/prover/smt/solver/bound-manager.ts +196 -0
  169. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  170. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  171. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  172. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  173. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  174. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  175. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  176. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  177. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  178. package/src/prover/smt/solver/card2bv.ts +109 -0
  179. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  180. package/src/prover/smt/solver/cg-table.ts +39 -25
  181. package/src/prover/smt/solver/check-logic.ts +330 -0
  182. package/src/prover/smt/solver/clause.ts +0 -1
  183. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  184. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  185. package/src/prover/smt/solver/context.ts +533 -114
  186. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  187. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  188. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  189. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  190. package/src/prover/smt/solver/demodulator.ts +786 -0
  191. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  192. package/src/prover/smt/solver/der.ts +38 -10
  193. package/src/prover/smt/solver/diff-neq.ts +205 -0
  194. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  195. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  196. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  197. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  198. package/src/prover/smt/solver/e-matching.ts +6 -7
  199. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  200. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  201. package/src/prover/smt/solver/enode.ts +100 -3
  202. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  203. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  204. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  205. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  206. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  207. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  208. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  209. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  210. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  211. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  212. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  213. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  214. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  215. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  216. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  217. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  218. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  219. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  220. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  221. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  222. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  223. package/src/prover/smt/solver/expr-ref.ts +0 -1
  224. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  225. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  226. package/src/prover/smt/solver/factor.ts +163 -0
  227. package/src/prover/smt/solver/fd-solver.ts +267 -0
  228. package/src/prover/smt/solver/fingerprints.ts +15 -15
  229. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  230. package/src/prover/smt/solver/flat-literals.ts +0 -1
  231. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  232. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  233. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  234. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  235. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  236. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  237. package/src/prover/smt/solver/goal.ts +177 -15
  238. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  239. package/src/prover/smt/solver/guard-set.ts +219 -0
  240. package/src/prover/smt/solver/hash.ts +0 -1
  241. package/src/prover/smt/solver/hashtable.ts +30 -16
  242. package/src/prover/smt/solver/inf-eps.ts +63 -0
  243. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  244. package/src/prover/smt/solver/internalizer.ts +109 -36
  245. package/src/prover/smt/solver/lackr.ts +381 -0
  246. package/src/prover/smt/solver/lbool.ts +0 -1
  247. package/src/prover/smt/solver/lia2card.ts +268 -0
  248. package/src/prover/smt/solver/lia2pb.ts +154 -0
  249. package/src/prover/smt/solver/literal.ts +0 -1
  250. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  251. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  252. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  253. package/src/prover/smt/solver/lp/containers.ts +7 -2
  254. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  255. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  256. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  257. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  258. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  259. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  260. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  261. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  262. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  263. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  264. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  265. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  266. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  267. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  268. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  269. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  270. package/src/prover/smt/solver/lp/nex.ts +2 -2
  271. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  272. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  273. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  274. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  277. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  278. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  281. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  282. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  283. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  285. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  288. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  290. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  291. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  292. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  293. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  294. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  295. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  296. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  297. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  298. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  299. package/src/prover/smt/solver/macro-finder.ts +530 -0
  300. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  301. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  302. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  303. package/src/prover/smt/solver/max-cliques.ts +105 -0
  304. package/src/prover/smt/solver/maxcore.ts +309 -0
  305. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  306. package/src/prover/smt/solver/maxlex.ts +115 -0
  307. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  308. package/src/prover/smt/solver/maxsmt.ts +92 -0
  309. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  310. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  311. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  312. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  313. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  314. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  315. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  316. package/src/prover/smt/solver/model-checker.ts +17 -26
  317. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  318. package/src/prover/smt/solver/model-finder.ts +0 -1
  319. package/src/prover/smt/solver/model-generator.ts +59 -30
  320. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  321. package/src/prover/smt/solver/model-printer.ts +214 -0
  322. package/src/prover/smt/solver/mpf.ts +709 -0
  323. package/src/prover/smt/solver/mus.ts +50 -0
  324. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  325. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  326. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  327. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  328. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  329. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  330. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  331. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  332. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  333. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  334. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  335. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  336. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  337. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  338. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  339. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  340. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  341. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  342. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  343. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  344. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  345. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  346. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  347. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  348. package/src/prover/smt/solver/nlqsat.ts +484 -0
  349. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  350. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  351. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  352. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  353. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  354. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  355. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  356. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  357. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  358. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  359. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  360. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  361. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  362. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  363. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  364. package/src/prover/smt/solver/nnf.ts +105 -23
  365. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  366. package/src/prover/smt/solver/occf.ts +97 -0
  367. package/src/prover/smt/solver/opt-context.ts +792 -0
  368. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  369. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  370. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  371. package/src/prover/smt/solver/opt-solver.ts +311 -0
  372. package/src/prover/smt/solver/opt-value.ts +55 -0
  373. package/src/prover/smt/solver/optsmt.ts +692 -0
  374. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  375. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  376. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  377. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  378. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  379. package/src/prover/smt/solver/probes.ts +511 -0
  380. package/src/prover/smt/solver/propagate-values.ts +37 -21
  381. package/src/prover/smt/solver/proto-model.ts +650 -17
  382. package/src/prover/smt/solver/pull-quant.ts +28 -12
  383. package/src/prover/smt/solver/purify-arith.ts +632 -0
  384. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  385. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  386. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  387. package/src/prover/smt/solver/qe-lite.ts +37 -17
  388. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  389. package/src/prover/smt/solver/qe.ts +1499 -0
  390. package/src/prover/smt/solver/qel.ts +25 -0
  391. package/src/prover/smt/solver/qi-queue.ts +0 -1
  392. package/src/prover/smt/solver/qsat.ts +814 -0
  393. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  394. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  395. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  396. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  397. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  398. package/src/prover/smt/solver/random-gen.ts +0 -1
  399. package/src/prover/smt/solver/rational.ts +45 -1
  400. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  401. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  402. package/src/prover/smt/solver/reduce-args.ts +225 -0
  403. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  404. package/src/prover/smt/solver/ref-vector.ts +0 -1
  405. package/src/prover/smt/solver/relevancy.ts +1 -2
  406. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  407. package/src/prover/smt/solver/rewriter.ts +475 -36
  408. package/src/prover/smt/solver/rlimit.ts +38 -2
  409. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  410. package/src/prover/smt/solver/sat/big.ts +177 -0
  411. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  412. package/src/prover/smt/solver/sat/clause.ts +203 -0
  413. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  414. package/src/prover/smt/solver/sat/config.ts +122 -0
  415. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  416. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  417. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  418. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  419. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  420. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  421. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  422. package/src/prover/smt/solver/sat/probing.ts +170 -0
  423. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  424. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  425. package/src/prover/smt/solver/sat/scc.ts +142 -0
  426. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  427. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  428. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  429. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  430. package/src/prover/smt/solver/search-tree.ts +284 -0
  431. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  432. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  433. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  434. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  435. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  436. package/src/prover/smt/solver/seq-factory.ts +89 -0
  437. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  438. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  439. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  440. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  441. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  442. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  443. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  444. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  445. package/src/prover/smt/solver/seq-subset.ts +165 -0
  446. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  447. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  448. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  449. package/src/prover/smt/solver/smt-logics.ts +66 -0
  450. package/src/prover/smt/solver/smt-setup.ts +544 -0
  451. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  452. package/src/prover/smt/solver/smtlib-parser.ts +3228 -327
  453. package/src/prover/smt/solver/smtlib-script.ts +1843 -0
  454. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  455. package/src/prover/smt/solver/solver.ts +113 -22
  456. package/src/prover/smt/solver/static-features.ts +314 -0
  457. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  458. package/src/prover/smt/solver/tactic.ts +2012 -0
  459. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  460. package/src/prover/smt/solver/theory-array.ts +1240 -0
  461. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  462. package/src/prover/smt/solver/theory-char.ts +355 -0
  463. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  464. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  465. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  466. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  467. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  468. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  469. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  470. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  471. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  472. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  473. package/src/prover/smt/solver/theory-lra.ts +188 -2
  474. package/src/prover/smt/solver/theory-pb.ts +933 -0
  475. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  476. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  477. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  478. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  479. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  480. package/src/prover/smt/solver/theory-seq.ts +961 -0
  481. package/src/prover/smt/solver/theory.ts +189 -0
  482. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  483. package/src/prover/smt/solver/var-subst.ts +36 -14
  484. package/src/prover/smt/table.ts +3 -2
  485. package/src/prover/smt/types.ts +146 -0
  486. package/src/prover/tlapm/cache.ts +37 -16
  487. package/src/prover/tlapm-library.ts +3208 -0
  488. package/src/prover/verdict.ts +2 -0
  489. package/src/prover/zenon/decide.ts +10 -7
  490. package/src/prover/zenon/encode.ts +0 -2
  491. package/src/prover/zenon/eqrel.ts +0 -2
  492. package/src/prover/zenon/equality-rules.ts +24 -2
  493. package/src/prover/zenon/expr.ts +21 -2
  494. package/src/prover/zenon/index-table.ts +7 -4
  495. package/src/prover/zenon/isar-case.ts +1 -3
  496. package/src/prover/zenon/isar.ts +2 -4
  497. package/src/prover/zenon/llproof.ts +0 -2
  498. package/src/prover/zenon/mltoll.ts +0 -2
  499. package/src/prover/zenon/node.ts +20 -5
  500. package/src/prover/zenon/parse.ts +6 -2
  501. package/src/prover/zenon/phrase.ts +1 -3
  502. package/src/prover/zenon/proof.ts +0 -2
  503. package/src/prover/zenon/propositional-rules.ts +0 -2
  504. package/src/prover/zenon/rules.ts +2 -3
  505. package/src/prover/zenon/search.ts +7 -5
  506. package/src/prover/zenon/tla/functions.ts +0 -2
  507. package/src/prover/zenon/tla/llproof.ts +0 -2
  508. package/src/prover/zenon/tla/records.ts +0 -2
  509. package/src/prover/zenon/tla/rewrites.ts +0 -2
  510. package/src/prover/zenon/tla/sets.ts +7 -8
  511. package/src/prover/zenon/tla/terms.ts +0 -2
  512. package/src/prover/zenon/tla/tla.ts +0 -2
  513. package/src/resolve.ts +625 -189
  514. package/src/runtime.ts +7 -1
  515. package/src/sany/builtins.ts +10 -10
  516. package/src/sany/generation.ts +2 -13
  517. package/src/sany/generator-definitions.ts +3 -1
  518. package/src/sany/generator-expressions.ts +36 -30
  519. package/src/sany/generator-proofs.ts +5 -3
  520. package/src/sany/generator.ts +2 -1
  521. package/src/sany/levels.ts +0 -2
  522. package/src/sany/lexer.ts +3 -3
  523. package/src/sany/linter.ts +0 -2
  524. package/src/sany/modules.ts +4 -2
  525. package/src/sany/nodes.ts +1 -1
  526. package/src/sany/selectors.ts +11 -6
  527. package/src/sany/xml.ts +2 -3
  528. package/src/search.ts +209 -56
  529. package/src/simulate.ts +3 -0
  530. package/src/spec-description.ts +2 -2
  531. package/src/standard-definitions.ts +4 -0
  532. package/src/state-graph.ts +0 -2
  533. package/src/subexpressions.ts +265 -94
  534. package/src/successors.ts +2 -1
  535. package/src/symmetry.ts +3 -3
  536. package/src/tableau.ts +2 -2
  537. package/src/tlc/fingerprint.ts +81 -9
  538. package/src/tlc/jar-data.ts +10 -0
  539. package/src/tlc/messages.ts +3 -3
  540. package/src/tlc/order.ts +14 -3
  541. package/src/tlc/summary.ts +29 -14
  542. package/src/tlc/tlc-operators.ts +3 -1
  543. package/src/tlc/tlcext-operators.ts +61 -16
  544. package/src/tlc/trace-spec.ts +5 -5
  545. package/src/typed-tier.ts +6541 -0
  546. package/src/typescript/types.ts +2 -2
  547. package/src/values.ts +46 -27
  548. package/src/prover/isabelle/isar/statement.ts +0 -52
  549. package/src/prover/smt/solver/z3-license.txt +0 -10
  550. package/src/prover/tlaps-module.ts +0 -510
  551. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,923 @@
1
+ import { SmtUnsupportedError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ KIND_VAR,
7
+ OP_ADD,
8
+ OP_AND,
9
+ OP_BADD,
10
+ OP_BMUL,
11
+ OP_BSUB,
12
+ OP_DIV,
13
+ OP_EQ,
14
+ OP_GE,
15
+ OP_IMPLIES,
16
+ OP_ITE,
17
+ OP_LE,
18
+ OP_MOD,
19
+ OP_MUL,
20
+ OP_OR,
21
+ OP_SELECT,
22
+ OP_SUB,
23
+ OP_TO_REAL,
24
+ OP_UMINUS,
25
+ SORT_BOOL,
26
+ SORT_INT,
27
+ SORT_REAL,
28
+ QUANTIFIER_FORALL,
29
+ } from "./ast";
30
+ import { BoundManager } from "./bound-manager";
31
+ import { mkBvApp } from "./bv-decl-plugin";
32
+ import type { Definition, Goal } from "./goal";
33
+ import { ObjMap } from "./hashtable";
34
+ import { Rational } from "./rational";
35
+ import { getSubterms } from "./recfun-decl-plugin";
36
+ import { RefVector } from "./ref-vector";
37
+ import { Rewriter, type RewriterOptions } from "./rewriter";
38
+ import { RewriterTpl } from "./rewriter-tpl";
39
+
40
+ interface SolveEqsOptions {
41
+ isTheorySolver: boolean;
42
+ isIteSolver: boolean;
43
+ isContextSolve: boolean;
44
+ isEliminatingMod: boolean;
45
+ rewriter: RewriterOptions;
46
+ }
47
+
48
+ interface DependentEq {
49
+ orig: number;
50
+ variable: number;
51
+ term: number;
52
+ }
53
+
54
+ interface Signed {
55
+ isNegated: boolean;
56
+ expr: number;
57
+ }
58
+
59
+ interface NestedItem {
60
+ isNegated: boolean;
61
+ depth: number;
62
+ expr: number;
63
+ parent: number;
64
+ }
65
+
66
+ export class SubstReplacer extends RewriterTpl {
67
+ constructor(
68
+ manager: AstManager,
69
+ private substitution: ObjMap<number>,
70
+ ) {
71
+ super(manager);
72
+ }
73
+
74
+ getSubst(expr: number) {
75
+ return this.substitution.get(expr);
76
+ }
77
+ }
78
+
79
+ const getModInverse = (value: bigint, modulus: bigint) => {
80
+ let [oldRemainder, remainder] = [((value % modulus) + modulus) % modulus, modulus];
81
+ let [oldCoefficient, coefficient] = [1n, 0n];
82
+ while (remainder !== 0n) {
83
+ const quotient = oldRemainder / remainder;
84
+ [oldRemainder, remainder] = [remainder, oldRemainder - quotient * remainder];
85
+ [oldCoefficient, coefficient] = [coefficient, oldCoefficient - quotient * coefficient];
86
+ }
87
+ return ((oldCoefficient % modulus) + modulus) % modulus;
88
+ };
89
+
90
+ export class SolveEqs {
91
+ private pinned: RefVector;
92
+ private eqTerms: RefVector;
93
+ private nonzero = new Set<number>();
94
+ private bounds: BoundManager;
95
+ private isAllowingBool = true;
96
+ private var2id = new Map<number, number>();
97
+ private id2var: number[] = [];
98
+ private next: DependentEq[][] = [];
99
+ private id2level: number[] = [];
100
+ private substIds: number[] = [];
101
+ private substitution: ObjMap<number>;
102
+ private definitions: Definition[] = [];
103
+ private containsV = new Set<number>();
104
+ private unsafeVars = new Set<number>();
105
+ private andPositive = new Set<number>();
106
+ private andNegative = new Set<number>();
107
+ private orPositive = new Set<number>();
108
+ private orNegative = new Set<number>();
109
+ private rewriter: Rewriter;
110
+
111
+ constructor(
112
+ private manager: AstManager,
113
+ private goal: Goal,
114
+ private options: SolveEqsOptions,
115
+ ) {
116
+ this.pinned = new RefVector(manager);
117
+ this.eqTerms = new RefVector(manager);
118
+ this.bounds = new BoundManager(manager);
119
+ this.substitution = new ObjMap((expr) => manager.hashes[expr]);
120
+ this.rewriter = new Rewriter(manager, options.rewriter);
121
+ }
122
+
123
+ private pin(expr: number) {
124
+ this.eqTerms.push(expr);
125
+ return expr;
126
+ }
127
+
128
+ private mkApp(op: number, args: number[], sort: number) {
129
+ return this.pin(this.manager.mkApp(op, args, sort));
130
+ }
131
+
132
+ private mkMul(args: number[], sort: number) {
133
+ return args.length === 1 ? args[0] : this.mkApp(OP_MUL, args, sort);
134
+ }
135
+
136
+ private push(eqs: DependentEq[], orig: number, variable: number, term: number) {
137
+ this.eqTerms.push(term);
138
+ eqs.push({ orig, variable, term });
139
+ }
140
+
141
+ private isConst(expr: number) {
142
+ return this.manager.kinds[expr] === KIND_APP && this.manager.isUninterpretedConst(expr);
143
+ }
144
+
145
+ private isEqOf(first: number, second: number) {
146
+ const manager = this.manager;
147
+ if (manager.getOp(first) !== OP_EQ || manager.getOp(second) !== OP_EQ) return undefined;
148
+ const [x1, x2] = manager.getArgs(first);
149
+ const [y1, y2] = manager.getArgs(second);
150
+ if (x1 === y1) return { variable: x1, thenExpr: x2, elseExpr: y2 };
151
+ if (x1 === y2) return { variable: x1, thenExpr: x2, elseExpr: y1 };
152
+ if (x2 === y1) return { variable: x2, thenExpr: x1, elseExpr: y2 };
153
+ return undefined;
154
+ }
155
+
156
+ private isComplementary(first: number, second: number) {
157
+ const manager = this.manager;
158
+ return (
159
+ (manager.isNot(first) && manager.getArg(first, 0) === second) ||
160
+ (manager.isNot(second) && manager.getArg(second, 0) === first)
161
+ );
162
+ }
163
+
164
+ private getBasicEqs(form: number, eqs: DependentEq[]) {
165
+ const manager = this.manager;
166
+ const op = manager.getOp(form);
167
+ if (op === OP_EQ) {
168
+ const [left, right] = manager.getArgs(form);
169
+ if (left === right) return;
170
+ if (!this.isAllowingBool && manager.sorts[left] === SORT_BOOL) return;
171
+ if (this.isConst(left)) this.push(eqs, form, left, right);
172
+ if (this.isConst(right)) this.push(eqs, form, right, left);
173
+ }
174
+ if (this.isAllowingBool) {
175
+ if (this.isConst(form)) this.push(eqs, form, form, manager.trueExpr);
176
+ if (manager.isNot(form) && this.isConst(manager.getArg(form, 0)))
177
+ this.push(eqs, form, manager.getArg(form, 0), manager.falseExpr);
178
+ }
179
+ if (this.goal.isProofsEnabled) return;
180
+ if (this.options.isIteSolver && op === OP_ITE) {
181
+ const [condition, thenExpr, elseExpr] = manager.getArgs(form);
182
+ if (manager.getOp(thenExpr) === OP_EQ && manager.getOp(elseExpr) === OP_EQ) {
183
+ let [x1, y1] = manager.getArgs(thenExpr);
184
+ let [x2, y2] = manager.getArgs(elseExpr);
185
+ if (!this.isAllowingBool && manager.sorts[x1] === SORT_BOOL) return;
186
+ if (x1 === y2 && this.isConst(x1)) [x2, y2] = [y2, x2];
187
+ if (x2 === y2 && this.isConst(x2)) {
188
+ [x2, y2] = [y2, x2];
189
+ [x1, y1] = [y1, x1];
190
+ }
191
+ if (x2 === y1 && this.isConst(x2)) [x1, y1] = [y1, x1];
192
+ if (x1 === x2 && this.isConst(x1))
193
+ this.push(eqs, form, x1, manager.mkApp(OP_ITE, [condition, y1, y2], manager.sorts[y1]));
194
+ }
195
+ }
196
+ const isBinary = (expr: number, binaryOp: number) =>
197
+ manager.getOp(expr) === binaryOp && manager.getNumArgs(expr) === 2;
198
+ const outer = op === OP_OR ? OP_AND : op === OP_AND ? OP_OR : -1;
199
+ if (outer === -1 || !isBinary(form, op)) return;
200
+ const [first, second] = manager.getArgs(form);
201
+ if (!isBinary(first, outer) || !isBinary(second, outer)) return;
202
+ const [x1, x2] = manager.getArgs(first);
203
+ const [y1, y2] = manager.getArgs(second);
204
+ const cases: [number, number, number, number, number][] =
205
+ op === OP_OR
206
+ ? [
207
+ [x1, y1, x2, y2, x2],
208
+ [x1, y2, x2, y1, x2],
209
+ [x2, y2, x1, y1, x1],
210
+ [x2, y1, x1, y2, x1],
211
+ ]
212
+ : [
213
+ [x1, y1, x2, y2, y2],
214
+ [x1, y2, x2, y1, y1],
215
+ [x2, y2, x1, y1, y1],
216
+ [x2, y1, x1, y2, y2],
217
+ ];
218
+ for (const [eqFirst, eqSecond, complementFirst, complementSecond, condition] of cases) {
219
+ const found = this.isEqOf(eqFirst, eqSecond);
220
+ if (found !== undefined && this.isComplementary(complementFirst, complementSecond))
221
+ this.push(
222
+ eqs,
223
+ form,
224
+ found.variable,
225
+ manager.mkApp(
226
+ OP_ITE,
227
+ [condition, found.thenExpr, found.elseExpr],
228
+ manager.sorts[found.thenExpr],
229
+ ),
230
+ );
231
+ }
232
+ }
233
+
234
+ private mkSubTerm(sum: number, index: number, rhs: number) {
235
+ const manager = this.manager;
236
+ const isBv = manager.isBvSort(manager.sorts[rhs]);
237
+ return manager
238
+ .getArgs(sum)
239
+ .reduce(
240
+ (term, arg, other) =>
241
+ other === index
242
+ ? term
243
+ : isBv
244
+ ? this.pin(mkBvApp(manager, OP_BSUB, [term, arg]))
245
+ : this.mkApp(OP_SUB, [term, arg], manager.sorts[rhs]),
246
+ rhs,
247
+ );
248
+ }
249
+
250
+ private isNonzeroFactor(expr: number) {
251
+ const manager = this.manager;
252
+ return (
253
+ this.nonzero.has(expr) ||
254
+ (manager.isNumeral(expr) && !manager.getRationalValue(expr).isZero())
255
+ );
256
+ }
257
+
258
+ private solveArithAdd(orig: number, x: number, y: number, eqs: DependentEq[]) {
259
+ const manager = this.manager;
260
+ if (manager.getOp(x) !== OP_ADD) return;
261
+ for (const [index, arg] of manager.getArgs(x).entries()) {
262
+ if (this.isConst(arg)) {
263
+ this.push(eqs, orig, arg, this.mkSubTerm(x, index, y));
264
+ continue;
265
+ }
266
+ const isReal = manager.sorts[arg] === SORT_REAL;
267
+ if (manager.getOp(arg) === OP_MUL && manager.getNumArgs(arg) === 2) {
268
+ const [coefficient, variable] = manager.getArgs(arg);
269
+ if (manager.isNumeral(coefficient) && this.isConst(variable)) {
270
+ const value = manager.getRationalValue(coefficient);
271
+ if (value.equals(Rational.minusOne))
272
+ this.push(
273
+ eqs,
274
+ orig,
275
+ variable,
276
+ this.mkApp(OP_UMINUS, [this.mkSubTerm(x, index, y)], manager.sorts[y]),
277
+ );
278
+ else if (isReal && !value.isZero())
279
+ this.push(
280
+ eqs,
281
+ orig,
282
+ variable,
283
+ this.mkApp(OP_DIV, [this.mkSubTerm(x, index, y), coefficient], SORT_REAL),
284
+ );
285
+ continue;
286
+ }
287
+ }
288
+ if (!isReal || manager.getOp(arg) !== OP_MUL) continue;
289
+ const factors = manager.getArgs(arg);
290
+ for (const [factorIndex, factor] of factors.entries()) {
291
+ if (!this.isConst(factor)) continue;
292
+ if (
293
+ !factors.every(
294
+ (other, otherIndex) => otherIndex === factorIndex || this.isNonzeroFactor(other),
295
+ )
296
+ )
297
+ continue;
298
+ const others = factors.filter((_value, otherIndex) => otherIndex !== factorIndex);
299
+ const term = this.mkSubTerm(x, index, y);
300
+ this.push(
301
+ eqs,
302
+ orig,
303
+ factor,
304
+ this.mkApp(OP_DIV, [term, this.mkMul(others, SORT_REAL)], SORT_REAL),
305
+ );
306
+ }
307
+ }
308
+ }
309
+
310
+ private solveArithMod(orig: number, x: number, y: number, eqs: DependentEq[]) {
311
+ const manager = this.manager;
312
+ if (!this.options.isEliminatingMod || manager.getOp(x) !== OP_MOD) return;
313
+ const [dividend, divisor] = manager.getArgs(x);
314
+ if (!manager.isNumeral(divisor) || !manager.getRationalValue(divisor).isPositive()) return;
315
+ const fresh = this.pin(manager.mkFreshConst("mod", SORT_INT));
316
+ const term = this.mkApp(OP_ADD, [this.mkApp(OP_MUL, [divisor, fresh], SORT_INT), y], SORT_INT);
317
+ if (this.isConst(dividend)) this.push(eqs, orig, dividend, term);
318
+ else this.solveArithEq(orig, dividend, term, eqs);
319
+ }
320
+
321
+ private solveArithMul(orig: number, x: number, y: number, eqs: DependentEq[]) {
322
+ const manager = this.manager;
323
+ if (manager.getOp(x) !== OP_MUL) return;
324
+ const factors = manager.getArgs(x);
325
+ for (const [index, factor] of factors.entries()) {
326
+ if (!this.isConst(factor) || manager.sorts[factor] !== SORT_REAL) continue;
327
+ if (
328
+ !factors.every((other, otherIndex) => otherIndex === index || this.isNonzeroFactor(other))
329
+ )
330
+ continue;
331
+ const others = factors.filter((_value, otherIndex) => otherIndex !== index);
332
+ this.push(
333
+ eqs,
334
+ orig,
335
+ factor,
336
+ this.mkApp(OP_DIV, [y, this.mkMul(others, SORT_REAL)], SORT_REAL),
337
+ );
338
+ }
339
+ }
340
+
341
+ private solveArithToReal(orig: number, x: number, y: number, eqs: DependentEq[]) {
342
+ const manager = this.manager;
343
+ if (manager.getOp(x) !== OP_TO_REAL || !this.isConst(manager.getArg(x, 0))) return;
344
+ const variable = manager.getArg(x, 0);
345
+ if (manager.getOp(y) === OP_TO_REAL) this.push(eqs, orig, variable, manager.getArg(y, 0));
346
+ else if (manager.isNumeral(y) && manager.getRationalValue(y).isInt())
347
+ this.push(eqs, orig, variable, manager.mkNumeral(manager.getRationalValue(y).num));
348
+ }
349
+
350
+ private solveArithEq(orig: number, x: number, y: number, eqs: DependentEq[]) {
351
+ this.solveArithAdd(orig, x, y, eqs);
352
+ this.solveArithMod(orig, x, y, eqs);
353
+ this.solveArithMul(orig, x, y, eqs);
354
+ this.solveArithToReal(orig, x, y, eqs);
355
+ }
356
+
357
+ private getArithEqs(form: number, eqs: DependentEq[]) {
358
+ const manager = this.manager;
359
+ if (!this.options.isTheorySolver) return;
360
+ if (manager.getOp(form) === OP_EQ) {
361
+ const [x, y] = manager.getArgs(form);
362
+ if (manager.sorts[x] === SORT_INT || manager.sorts[x] === SORT_REAL) {
363
+ this.solveArithEq(form, x, y, eqs);
364
+ this.solveArithEq(form, y, x, eqs);
365
+ }
366
+ }
367
+ if (manager.getOp(form) !== OP_LE) return;
368
+ const [x, y] = manager.getArgs(form);
369
+ const lower = this.bounds.lowers.get(x);
370
+ if (
371
+ !manager.isNumeral(y) ||
372
+ lower === undefined ||
373
+ lower.isStrict ||
374
+ !lower.value.equals(manager.getRationalValue(y))
375
+ )
376
+ return;
377
+ if (this.isConst(x)) this.push(eqs, form, x, y);
378
+ else {
379
+ this.solveArithEq(form, x, y, eqs);
380
+ this.solveArithEq(form, y, x, eqs);
381
+ }
382
+ }
383
+
384
+ private getOddCoefficient(expr: number) {
385
+ const manager = this.manager;
386
+ if (manager.getOp(expr) !== OP_BMUL || manager.getNumArgs(expr) !== 2) return undefined;
387
+ const [coefficient, variable] = manager.getArgs(expr);
388
+ if (!manager.isBvNumeral(coefficient) || !this.isConst(variable)) return undefined;
389
+ const value = manager.getBvNumeralValue(coefficient);
390
+ if (value % 2n === 0n) return undefined;
391
+ const width = manager.getBvSize(manager.sorts[variable]);
392
+ return {
393
+ variable,
394
+ inverse: manager.mkBvNumeral(getModInverse(value, 1n << BigInt(width)), width),
395
+ };
396
+ }
397
+
398
+ private solveBvEq(orig: number, x: number, y: number, eqs: DependentEq[]) {
399
+ const manager = this.manager;
400
+ if (manager.getOp(x) === OP_BADD)
401
+ for (const [index, arg] of manager.getArgs(x).entries()) {
402
+ if (this.isConst(arg)) {
403
+ this.push(eqs, orig, arg, this.mkSubTerm(x, index, y));
404
+ continue;
405
+ }
406
+ const odd = this.getOddCoefficient(arg);
407
+ if (odd === undefined) continue;
408
+ const term = this.mkSubTerm(x, index, y);
409
+ this.push(
410
+ eqs,
411
+ orig,
412
+ odd.variable,
413
+ this.pin(mkBvApp(manager, OP_BMUL, [this.pin(odd.inverse), term])),
414
+ );
415
+ }
416
+ const odd = this.getOddCoefficient(x);
417
+ if (odd !== undefined)
418
+ this.push(
419
+ eqs,
420
+ orig,
421
+ odd.variable,
422
+ this.pin(mkBvApp(manager, OP_BMUL, [this.pin(odd.inverse), y])),
423
+ );
424
+ }
425
+
426
+ private getBvEqs(form: number, eqs: DependentEq[]) {
427
+ const manager = this.manager;
428
+ if (manager.getOp(form) !== OP_EQ) return;
429
+ const [x, y] = manager.getArgs(form);
430
+ if (!manager.isBvSort(manager.sorts[x])) return;
431
+ this.solveBvEq(form, x, y, eqs);
432
+ this.solveBvEq(form, y, x, eqs);
433
+ }
434
+
435
+ private hasSubterm(root: number, isMatch: (expr: number) => boolean) {
436
+ const manager = this.manager;
437
+ const visited = new Set<number>();
438
+ const todo = [root];
439
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
440
+ if (visited.has(expr)) continue;
441
+ visited.add(expr);
442
+ if (isMatch(expr)) return true;
443
+ if (manager.kinds[expr] === KIND_APP || manager.kinds[expr] === KIND_QUANTIFIER)
444
+ manager.pushArgs(expr, todo);
445
+ }
446
+ return false;
447
+ }
448
+
449
+ // Array definitions by a universal quantifier need lambdas, which the port does not have.
450
+ private checkArrayEqs(form: number) {
451
+ const manager = this.manager;
452
+ if (
453
+ manager.kinds[form] !== KIND_QUANTIFIER ||
454
+ manager.getQuantifier(form).kind !== QUANTIFIER_FORALL
455
+ )
456
+ return;
457
+ const numVars = manager.getQuantifier(form).sorts.length;
458
+ const body = manager.getQuantifier(form).body;
459
+ const [guard, eq] =
460
+ manager.getOp(body) === OP_IMPLIES
461
+ ? manager.getArgs(body)
462
+ : manager.getOp(body) === OP_OR && manager.getNumArgs(body) === 2
463
+ ? manager.getOp(manager.getArg(body, 1)) === OP_EQ
464
+ ? manager.getArgs(body)
465
+ : manager.getOp(manager.getArg(body, 0)) === OP_EQ
466
+ ? manager.getArgs(body).reverse()
467
+ : [-1, -1]
468
+ : [-1, body];
469
+ if (eq === -1 || manager.getOp(eq) !== OP_EQ) return;
470
+ const [lhs, rhs] = manager.getArgs(eq);
471
+ const isGuardedIte =
472
+ guard === -1 &&
473
+ manager.getOp(lhs) === OP_ITE &&
474
+ manager.getOp(rhs) === OP_ITE &&
475
+ manager.getArg(lhs, 0) === manager.getArg(rhs, 0) &&
476
+ manager.getArg(lhs, 2) === manager.getArg(rhs, 2);
477
+ const [condition, left, right] = isGuardedIte
478
+ ? [manager.getArg(lhs, 0), manager.getArg(lhs, 1), manager.getArg(rhs, 1)]
479
+ : [guard, lhs, rhs];
480
+ const isSelectOfVars = (expr: number) =>
481
+ manager.getOp(expr) === OP_SELECT &&
482
+ manager.getNumArgs(expr) === numVars + 1 &&
483
+ manager
484
+ .getArgs(expr)
485
+ .slice(1)
486
+ .every(
487
+ (arg, index) =>
488
+ manager.kinds[arg] === KIND_VAR && manager.values[arg] === numVars - index - 1,
489
+ );
490
+ const [select, def] = isSelectOfVars(left)
491
+ ? [left, right]
492
+ : isSelectOfVars(right)
493
+ ? [right, left]
494
+ : [-1, -1];
495
+ if (select === -1) return;
496
+ const array = manager.getArg(select, 0);
497
+ const isQuantifier = (expr: number) => manager.kinds[expr] === KIND_QUANTIFIER;
498
+ const parts = condition === -1 ? [def] : [def, condition];
499
+ if (
500
+ this.isConst(array) &&
501
+ !parts.some((part) => this.hasSubterm(part, (expr) => expr === array)) &&
502
+ !parts.some((part) => this.hasSubterm(part, isQuantifier))
503
+ )
504
+ throw new SmtUnsupportedError("solving for an array defined by a quantifier");
505
+ }
506
+
507
+ private getEqsOf(form: number, eqs: DependentEq[]) {
508
+ if (!this.goal.isProofsEnabled) this.getArithEqs(form, eqs);
509
+ this.getBasicEqs(form, eqs);
510
+ if (!this.goal.isProofsEnabled) {
511
+ this.getBvEqs(form, eqs);
512
+ this.checkArrayEqs(form);
513
+ }
514
+ }
515
+
516
+ private getEqs() {
517
+ const eqs: DependentEq[] = [];
518
+ const forms = this.goal.forms.items;
519
+ if (!this.goal.isProofsEnabled) for (const form of forms) this.getArithEqs(form, eqs);
520
+ for (const form of forms) this.getBasicEqs(form, eqs);
521
+ if (!this.goal.isProofsEnabled) {
522
+ for (const form of forms) this.getBvEqs(form, eqs);
523
+ for (const form of forms) this.checkArrayEqs(form);
524
+ }
525
+ return eqs;
526
+ }
527
+
528
+ private extractDepGraph(eqs: DependentEq[]) {
529
+ this.var2id.clear();
530
+ this.id2var = [];
531
+ for (const eq of eqs) {
532
+ if (this.var2id.has(eq.variable) || !this.canBeVar(eq.variable)) continue;
533
+ this.var2id.set(eq.variable, this.id2var.length);
534
+ this.id2var.push(eq.variable);
535
+ }
536
+ this.next = this.id2var.map(() => []);
537
+ for (const eq of eqs)
538
+ if (this.canBeVar(eq.variable)) this.next[this.var2id.get(eq.variable) as number].push(eq);
539
+ }
540
+
541
+ private extractSubst() {
542
+ const manager = this.manager;
543
+ const size = this.id2var.length;
544
+ this.id2level = this.id2var.map(() => Infinity);
545
+ this.substIds = [];
546
+ this.substitution = new ObjMap((expr) => manager.hashes[expr]);
547
+ let initLevel = 2 ** 32 - 1;
548
+ const todo: number[] = [];
549
+ for (let id = 0; id < size; id++) {
550
+ if (this.id2level[id] !== Infinity) continue;
551
+ if (initLevel < size + 1) return;
552
+ initLevel -= size + 1;
553
+ let currLevel = initLevel;
554
+ todo.push(id);
555
+ for (let next = todo.pop(); next !== undefined; next = todo.pop()) {
556
+ if (this.id2level[next] !== Infinity) continue;
557
+ this.id2level[next] = currLevel++;
558
+ for (const eq of this.next[next]) {
559
+ const todoSize = todo.length;
560
+ let isSafe = true;
561
+ const visited = new Set<number>();
562
+ const stack = [eq.term];
563
+ for (let expr = stack.pop(); expr !== undefined; expr = stack.pop()) {
564
+ if (visited.has(expr)) continue;
565
+ visited.add(expr);
566
+ if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, stack);
567
+ else if (manager.kinds[expr] === KIND_QUANTIFIER)
568
+ stack.push(manager.getQuantifier(expr).body);
569
+ const id = this.var2id.get(expr);
570
+ if (id === undefined) continue;
571
+ if (this.id2level[id] < currLevel) {
572
+ isSafe = false;
573
+ break;
574
+ }
575
+ if (this.id2level[id] === Infinity) todo.push(id);
576
+ }
577
+ if (!isSafe) {
578
+ todo.length = todoSize;
579
+ continue;
580
+ }
581
+ this.next[next][0] = eq;
582
+ this.substIds.push(next);
583
+ break;
584
+ }
585
+ }
586
+ }
587
+ }
588
+
589
+ private normalize() {
590
+ if (this.substIds.length === 0) return;
591
+ const manager = this.manager;
592
+ const replacer = new SubstReplacer(manager, this.substitution);
593
+ this.substIds.sort((first, second) => this.id2level[second] - this.id2level[first]);
594
+ for (const id of this.substIds) {
595
+ manager.limit.checkpoint();
596
+ const eq = this.next[id][0];
597
+ const definition = replacer.rewrite(eq.term);
598
+ this.pinned.pushOwned(definition);
599
+ manager.incRef(eq.variable);
600
+ this.pinned.pushOwned(eq.variable);
601
+ this.substitution.set(eq.variable, definition);
602
+ }
603
+ replacer.release();
604
+ }
605
+
606
+ private applySubst() {
607
+ if (this.substIds.length === 0) return;
608
+ const manager = this.manager;
609
+ const replacer = new SubstReplacer(manager, this.substitution);
610
+ const goal = this.goal;
611
+ const size = goal.forms.size;
612
+ for (let index = 0; index < size && !goal.isInconsistent; index++) {
613
+ const form = goal.forms.items[index];
614
+ const replaced = replacer.rewrite(form);
615
+ const simplified = this.rewriter.rewrite(replaced);
616
+ manager.decRef(replaced);
617
+ if (simplified !== form) goal.update(index, simplified);
618
+ manager.decRef(simplified);
619
+ }
620
+ replacer.release();
621
+ }
622
+
623
+ private saveSubst() {
624
+ for (const [variable, def] of this.substitution.entries())
625
+ this.definitions.push({ decl: this.manager.decls[variable], def });
626
+ }
627
+
628
+ private canBeVar(expr: number) {
629
+ return this.isConst(expr) && !this.unsafeVars.has(expr);
630
+ }
631
+
632
+ // filter_unsafe_vars: the recfun theory unfolds a recursive definition, which a substitution
633
+ // does not reach, so the constants in its body stay.
634
+ private runRound(getEqs: () => DependentEq[]) {
635
+ const manager = this.manager;
636
+ this.unsafeVars = new Set(
637
+ [...manager.recFunDefs.values()]
638
+ .filter((def) => !def.isMacro && def.rhs !== -1)
639
+ .flatMap((def) => getSubterms(manager, def.rhs)),
640
+ );
641
+ this.eqTerms.reset();
642
+ const eqs = getEqs();
643
+ this.extractDepGraph(eqs);
644
+ this.extractSubst();
645
+ this.normalize();
646
+ this.applySubst();
647
+ this.saveSubst();
648
+ }
649
+
650
+ reduce() {
651
+ const goal = this.goal;
652
+ if (!goal.isProofsEnabled && this.options.isTheorySolver)
653
+ for (const form of goal.forms.items) {
654
+ this.markPositive(form);
655
+ this.bounds.add(form);
656
+ }
657
+ for (let count = 0; count < 20; count++) {
658
+ this.runRound(() => this.getEqs());
659
+ if (this.substIds.length === 0) break;
660
+ this.manager.limit.checkpoint();
661
+ }
662
+ if (this.options.isContextSolve && !goal.isProofsEnabled)
663
+ this.runRound(() => this.collectNestedEqualities());
664
+ this.eqTerms.reset();
665
+ goal.elimTrue();
666
+ goal.elimRedundancies();
667
+ goal.depth++;
668
+ if (this.definitions.length > 0) goal.addDefinitions(this.definitions);
669
+ }
670
+
671
+ private markPositive(form: number) {
672
+ const manager = this.manager;
673
+ const isNegated = manager.isNot(form);
674
+ const atom = isNegated ? manager.getArg(form, 0) : form;
675
+ const op = manager.getOp(atom);
676
+ if (op !== OP_LE && op !== OP_GE && op !== OP_EQ) return;
677
+ const [lhs, rhs] = manager.getArgs(atom);
678
+ if (!manager.isNumeral(rhs)) return;
679
+ const value = manager.getRationalValue(rhs);
680
+ const isNonzero = isNegated
681
+ ? (op === OP_LE && !value.isNegative()) ||
682
+ (op === OP_GE && !value.isPositive()) ||
683
+ (op === OP_EQ && value.isZero())
684
+ : (op === OP_LE && value.isNegative()) || (op === OP_GE && value.isPositive());
685
+ if (isNonzero) this.nonzero.add(lhs);
686
+ }
687
+
688
+ private markOccurs(roots: number[], variable: number) {
689
+ const manager = this.manager;
690
+ const occurs = this.containsV;
691
+ const visited = new Set<number>([variable]);
692
+ occurs.add(variable);
693
+ const todo = [...roots];
694
+ while (todo.length > 0) {
695
+ const expr = todo[todo.length - 1];
696
+ if (visited.has(expr)) {
697
+ todo.pop();
698
+ continue;
699
+ }
700
+ if (manager.kinds[expr] === KIND_APP) {
701
+ let isOccurring = false;
702
+ let isAllVisited = true;
703
+ for (const arg of manager.getArgs(expr))
704
+ if (!visited.has(arg)) {
705
+ todo.push(arg);
706
+ isAllVisited = false;
707
+ } else if (occurs.has(arg)) isOccurring = true;
708
+ if (isAllVisited) {
709
+ if (isOccurring) occurs.add(expr);
710
+ else occurs.delete(expr);
711
+ visited.add(expr);
712
+ todo.pop();
713
+ }
714
+ } else if (manager.kinds[expr] === KIND_QUANTIFIER) {
715
+ const body = manager.getQuantifier(expr).body;
716
+ if (visited.has(body)) {
717
+ visited.add(expr);
718
+ if (occurs.has(body)) occurs.add(expr);
719
+ else occurs.delete(expr);
720
+ todo.pop();
721
+ } else todo.push(body);
722
+ } else {
723
+ visited.add(expr);
724
+ todo.pop();
725
+ }
726
+ }
727
+ }
728
+
729
+ private isConjunction(isNegated: boolean, expr: number) {
730
+ const op = this.manager.getOp(expr);
731
+ return (!isNegated && op === OP_AND) || (isNegated && op === OP_OR);
732
+ }
733
+
734
+ private containsConjunctively(form: number, isNegated: boolean, eq: number, conjuncts: Signed[]) {
735
+ const manager = this.manager;
736
+ const todo: Signed[] = [{ isNegated, expr: form }];
737
+ for (let item = todo.pop(); item !== undefined; item = todo.pop()) {
738
+ if (!item.isNegated && item.expr === eq) return true;
739
+ const marks = item.isNegated ? this.andNegative : this.andPositive;
740
+ if (marks.has(item.expr)) continue;
741
+ marks.add(item.expr);
742
+ if (!this.containsV.has(item.expr)) continue;
743
+ const op = manager.getOp(item.expr);
744
+ if ((!item.isNegated && op === OP_AND) || (item.isNegated && op === OP_OR))
745
+ for (const arg of manager.getArgs(item.expr))
746
+ todo.push({ isNegated: item.isNegated, expr: arg });
747
+ else if (manager.isNot(item.expr))
748
+ todo.push({ isNegated: !item.isNegated, expr: manager.getArg(item.expr, 0) });
749
+ else conjuncts.push(item);
750
+ }
751
+ return false;
752
+ }
753
+
754
+ private isDisjunctivelySafe(depth: number, root: number, isNegated: boolean, eq: number) {
755
+ const manager = this.manager;
756
+ const todo: Signed[] = [{ isNegated, expr: root }];
757
+ for (let item = todo.pop(); item !== undefined; item = todo.pop()) {
758
+ const marks = item.isNegated ? this.orNegative : this.orPositive;
759
+ if (marks.has(item.expr)) continue;
760
+ marks.add(item.expr);
761
+ const op = manager.getOp(item.expr);
762
+ if (!item.isNegated && item.expr === eq) continue;
763
+ if (!this.containsV.has(item.expr)) continue;
764
+ if ((item.isNegated && op === OP_AND) || (!item.isNegated && op === OP_OR))
765
+ for (const arg of manager.getArgs(item.expr))
766
+ todo.push({ isNegated: item.isNegated, expr: arg });
767
+ else if (manager.isNot(item.expr))
768
+ todo.push({ isNegated: !item.isNegated, expr: manager.getArg(item.expr, 0) });
769
+ else if (!this.isConjunction(item.isNegated, item.expr)) return false;
770
+ else if (!this.isSafeEqIn(depth + 1, item.expr, item.isNegated, eq)) return false;
771
+ }
772
+ return true;
773
+ }
774
+
775
+ private isSafeEqIn(depth: number, form: number, isNegated: boolean, eq: number): boolean {
776
+ if (!this.containsV.has(form)) return true;
777
+ const conjuncts: Signed[] = [];
778
+ if (this.containsConjunctively(form, isNegated, eq, conjuncts)) return true;
779
+ if (depth > 3) return false;
780
+ return conjuncts.every((conjunct) =>
781
+ this.isDisjunctivelySafe(depth, conjunct.expr, conjunct.isNegated, eq),
782
+ );
783
+ }
784
+
785
+ private isSafeEq(eq: number) {
786
+ this.andPositive.clear();
787
+ this.andNegative.clear();
788
+ this.orPositive.clear();
789
+ this.orNegative.clear();
790
+ return this.goal.forms.items.every((form) => this.isSafeEqIn(0, form, false, eq));
791
+ }
792
+
793
+ private isSafeVar(variable: number, index: number, form: number, todo: NestedItem[]) {
794
+ this.containsV.clear();
795
+ this.markOccurs([form], variable);
796
+ const isParent = (parent: number, child: number) => {
797
+ let current = child;
798
+ while (current !== parent && current !== 0) current = todo[current].parent;
799
+ return current === parent;
800
+ };
801
+ let top = index;
802
+ while (top !== 0) {
803
+ if (todo[top].depth !== todo[index].depth) break;
804
+ top = todo[top].parent;
805
+ }
806
+ return todo.every(
807
+ (item, other) =>
808
+ other === index ||
809
+ !this.containsV.has(item.expr) ||
810
+ isParent(other, index) ||
811
+ isParent(top, other),
812
+ );
813
+ }
814
+
815
+ private collectNestedIn(form: number, visited: Set<number>, eqs: DependentEq[]) {
816
+ const manager = this.manager;
817
+ const todo: NestedItem[] = [{ isNegated: false, depth: 0, expr: form, parent: 0 }];
818
+ const incOr = (depth: number) => (depth % 2 === 0 ? depth + 1 : depth);
819
+ const incAnd = (depth: number) => (depth % 2 === 0 ? depth : depth + 1);
820
+ for (let index = 0; index < todo.length; index++) {
821
+ const item = todo[index];
822
+ if (visited.has(item.expr)) continue;
823
+ visited.add(item.expr);
824
+ const op = manager.getOp(item.expr);
825
+ const pushArgs = (depth: number) => {
826
+ for (const arg of manager.getArgs(item.expr))
827
+ todo.push({ isNegated: item.isNegated, depth, expr: arg, parent: index });
828
+ };
829
+ if ((item.isNegated && op === OP_AND) || (!item.isNegated && op === OP_OR))
830
+ pushArgs(incOr(item.depth));
831
+ if ((!item.isNegated && op === OP_AND) || (item.isNegated && op === OP_OR))
832
+ pushArgs(incAnd(item.depth));
833
+ else if (manager.isNot(item.expr))
834
+ todo.push({
835
+ isNegated: !item.isNegated,
836
+ depth: item.depth,
837
+ expr: manager.getArg(item.expr, 0),
838
+ parent: index,
839
+ });
840
+ else if (!item.isNegated && item.depth >= 1) {
841
+ const start = eqs.length;
842
+ this.isAllowingBool = false;
843
+ this.getEqsOf(item.expr, eqs);
844
+ this.isAllowingBool = true;
845
+ for (let current = start; current < eqs.length; current++)
846
+ if (!this.isSafeVar(eqs[current].variable, index, form, todo)) {
847
+ eqs[current] = eqs[eqs.length - 1];
848
+ current--;
849
+ eqs.pop();
850
+ }
851
+ }
852
+ }
853
+ }
854
+
855
+ private collectNestedEqualities() {
856
+ const manager = this.manager;
857
+ const forms = this.goal.forms.items;
858
+ const visited = new Set<number>();
859
+ const collected: DependentEq[] = [];
860
+ for (const form of forms) this.collectNestedIn(form, visited, collected);
861
+ if (collected.length === 0) return collected;
862
+ const eqs = collected
863
+ .map((eq, index) => ({ eq, index }))
864
+ .sort(
865
+ (first, second) =>
866
+ manager.ids[first.eq.variable] - manager.ids[second.eq.variable] ||
867
+ first.index - second.index,
868
+ )
869
+ .map((entry) => entry.eq);
870
+ const firstOccurrence = new Map<number, number>();
871
+ const lastOccurrence = new Map<number, number>();
872
+ const record = (occurrence: Map<number, number>, order: number[]) => {
873
+ const seen = new Set<number>();
874
+ for (const index of order) {
875
+ const todo = [forms[index]];
876
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
877
+ if (seen.has(expr)) continue;
878
+ seen.add(expr);
879
+ occurrence.set(expr, index);
880
+ if (manager.kinds[expr] === KIND_APP) manager.pushArgs(expr, todo);
881
+ else if (manager.kinds[expr] === KIND_QUANTIFIER) {
882
+ const data = manager.getQuantifier(expr);
883
+ todo.push(data.body, ...data.patterns, ...data.noPatterns);
884
+ }
885
+ }
886
+ }
887
+ };
888
+ record(
889
+ firstOccurrence,
890
+ forms.map((_value, index) => index),
891
+ );
892
+ record(
893
+ lastOccurrence,
894
+ forms.map((_value, index) => forms.length - 1 - index),
895
+ );
896
+ const kept: DependentEq[] = [];
897
+ let lastVar = -1;
898
+ let isUnsafe = false;
899
+ for (const eq of eqs) {
900
+ const first = firstOccurrence.get(eq.variable);
901
+ if (first === undefined || first !== lastOccurrence.get(eq.variable)) continue;
902
+ if (eq.variable !== lastVar) {
903
+ this.containsV.clear();
904
+ this.markOccurs([eq.term], eq.variable);
905
+ lastVar = eq.variable;
906
+ isUnsafe = false;
907
+ if (this.containsV.has(eq.term)) {
908
+ isUnsafe = true;
909
+ continue;
910
+ }
911
+ this.markOccurs([forms[first]], eq.variable);
912
+ } else if (this.containsV.has(eq.term) || isUnsafe) continue;
913
+ if (this.isSafeEq(eq.orig)) kept.push(eq);
914
+ }
915
+ return kept;
916
+ }
917
+
918
+ release() {
919
+ this.rewriter.release();
920
+ this.pinned.reset();
921
+ this.eqTerms.reset();
922
+ }
923
+ }