tla-ts 0.0.10-dev.28c823e4b → 0.0.10-dev.37a75eb5b

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 (574) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +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.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +43 -42
  15. package/dist/run.js +45 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +43 -40
  19. package/dist/transfer.js +42 -39
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -36
  24. package/src/bags.ts +47 -28
  25. package/src/builtins.ts +4 -13
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +476 -590
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/runtime-invariants.ts +20 -56
  31. package/src/cli/shared.ts +1 -1
  32. package/src/cli/tlapm.ts +433 -70
  33. package/src/cli/tlc-arguments.ts +224 -212
  34. package/src/cli/tlc-output.ts +686 -0
  35. package/src/cli/tlc-usage.ts +1 -2
  36. package/src/cli/tlc.ts +60 -708
  37. package/src/cli/xml-exporter.ts +23 -33
  38. package/src/codegen.ts +5 -10
  39. package/src/coverage.ts +3 -10
  40. package/src/dependencies.ts +30 -14
  41. package/src/dfid.ts +25 -18
  42. package/src/environment-config.ts +315 -0
  43. package/src/environment.ts +73 -338
  44. package/src/errors.ts +33 -5
  45. package/src/evaluate.ts +14 -7
  46. package/src/exit-codes.ts +3 -0
  47. package/src/fingerprints.ts +65 -1
  48. package/src/instances.ts +47 -10
  49. package/src/java-hash.ts +7 -0
  50. package/src/json.ts +4 -7
  51. package/src/levels.ts +42 -44
  52. package/src/lexer.ts +5 -3
  53. package/src/liveness-checker.ts +597 -240
  54. package/src/liveness.ts +94 -86
  55. package/src/obligations/action.ts +14 -17
  56. package/src/obligations/anonymize.ts +37 -16
  57. package/src/obligations/enabled-axioms.ts +218 -0
  58. package/src/obligations/equality.ts +1 -3
  59. package/src/obligations/expression.ts +36 -8
  60. package/src/obligations/format.ts +0 -2
  61. package/src/obligations/generate.ts +66 -54
  62. package/src/obligations/index.ts +38 -8
  63. package/src/obligations/levels.ts +24 -11
  64. package/src/obligations/module.ts +28 -41
  65. package/src/obligations/normalize.ts +26 -14
  66. package/src/obligations/operators.ts +0 -2
  67. package/src/obligations/pragma.ts +53 -16
  68. package/src/obligations/printer.ts +43 -13
  69. package/src/obligations/proof.ts +3 -2
  70. package/src/obligations/regroup.ts +0 -2
  71. package/src/obligations/simplify.ts +55 -50
  72. package/src/obligations/source.ts +118 -74
  73. package/src/obligations/subexpression.ts +45 -18
  74. package/src/obligations/substitution.ts +1 -3
  75. package/src/obligations/temporal.ts +5 -7
  76. package/src/obligations/tuples.ts +0 -2
  77. package/src/parallel-worker.ts +17 -31
  78. package/src/parallel.ts +29 -47
  79. package/src/parser.ts +652 -220
  80. package/src/pretty-print.ts +1 -1
  81. package/src/prover/decide-pool.ts +3 -3
  82. package/src/prover/deciders.ts +12 -9
  83. package/src/prover/isabelle/decide.ts +3 -25
  84. package/src/prover/isabelle/encode.ts +72 -42
  85. package/src/prover/isabelle/isar/attrib.ts +250 -0
  86. package/src/prover/isabelle/isar/context.ts +335 -0
  87. package/src/prover/isabelle/isar/induct.ts +382 -0
  88. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  89. package/src/prover/isabelle/isar/method.ts +509 -212
  90. package/src/prover/isabelle/isar/proof.ts +570 -14
  91. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  92. package/src/prover/isabelle/isar/theory.ts +487 -76
  93. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  94. package/src/prover/isabelle/isar/type-check.ts +89 -14
  95. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  96. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  97. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  98. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  99. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  101. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  102. package/src/prover/isabelle/provers/classical.ts +45 -20
  103. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  104. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  105. package/src/prover/isabelle/pure/consts.ts +0 -2
  106. package/src/prover/isabelle/pure/conv.ts +2 -10
  107. package/src/prover/isabelle/pure/drule.ts +72 -6
  108. package/src/prover/isabelle/pure/envir.ts +0 -2
  109. package/src/prover/isabelle/pure/goal.ts +1 -3
  110. package/src/prover/isabelle/pure/logic.ts +1 -3
  111. package/src/prover/isabelle/pure/name.ts +0 -2
  112. package/src/prover/isabelle/pure/net.ts +0 -2
  113. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  114. package/src/prover/isabelle/pure/pattern.ts +0 -2
  115. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  116. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  117. package/src/prover/isabelle/pure/search.ts +0 -2
  118. package/src/prover/isabelle/pure/seq.ts +0 -2
  119. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  120. package/src/prover/isabelle/pure/table.ts +2 -3
  121. package/src/prover/isabelle/pure/tactic.ts +0 -2
  122. package/src/prover/isabelle/pure/tactical.ts +42 -37
  123. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  124. package/src/prover/isabelle/pure/term.ts +0 -2
  125. package/src/prover/isabelle/pure/thm.ts +14 -13
  126. package/src/prover/isabelle/pure/type.ts +0 -2
  127. package/src/prover/isabelle/pure/unify.ts +0 -2
  128. package/src/prover/isabelle/pure/variable.ts +0 -2
  129. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  130. package/src/prover/isabelle/tla/context.ts +58 -11
  131. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  132. package/src/prover/isabelle/tla/logic.ts +49 -21
  133. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  134. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  135. package/src/prover/ocaml.ts +4 -1
  136. package/src/prover/prep/action.ts +30 -31
  137. package/src/prover/prep/enabled-axioms.ts +11 -2
  138. package/src/prover/prep/fingerprint.ts +2 -5
  139. package/src/prover/prep/methods.ts +181 -51
  140. package/src/prover/prep/normalize.ts +38 -9
  141. package/src/prover/prove.ts +395 -94
  142. package/src/prover/ptl/decide.ts +95 -50
  143. package/src/prover/ptl/encode.ts +2 -3
  144. package/src/prover/ptl/tableau.ts +28 -2
  145. package/src/prover/smt/arithmetic.ts +310 -0
  146. package/src/prover/smt/axioms.ts +12 -8
  147. package/src/prover/smt/context.ts +43 -8
  148. package/src/prover/smt/data.ts +498 -379
  149. package/src/prover/smt/encode.ts +148 -57
  150. package/src/prover/smt/extensionality.ts +5 -3
  151. package/src/prover/smt/flatten.ts +4 -6
  152. package/src/prover/smt/format.ts +28 -4
  153. package/src/prover/smt/instances.ts +7 -1
  154. package/src/prover/smt/layout.ts +91 -0
  155. package/src/prover/smt/rewrite.ts +1021 -618
  156. package/src/prover/smt/simplify.ts +441 -0
  157. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  158. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  159. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  160. package/src/prover/smt/solver/act-cache.ts +0 -1
  161. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  162. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  163. package/src/prover/smt/solver/aig.ts +889 -0
  164. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  165. package/src/prover/smt/solver/arith-terms.ts +121 -0
  166. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  167. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  168. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  169. package/src/prover/smt/solver/ast-lt.ts +166 -12
  170. package/src/prover/smt/solver/ast-util.ts +160 -2
  171. package/src/prover/smt/solver/ast.ts +1427 -41
  172. package/src/prover/smt/solver/auf-solver.ts +2 -6
  173. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  174. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  175. package/src/prover/smt/solver/bound-manager.ts +196 -0
  176. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  177. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  178. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  179. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  180. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  181. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  182. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  183. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  184. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  185. package/src/prover/smt/solver/card2bv.ts +110 -0
  186. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  187. package/src/prover/smt/solver/cg-table.ts +39 -25
  188. package/src/prover/smt/solver/check-logic.ts +330 -0
  189. package/src/prover/smt/solver/clause.ts +0 -1
  190. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  191. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  192. package/src/prover/smt/solver/context.ts +536 -117
  193. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  194. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  195. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  196. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  197. package/src/prover/smt/solver/demodulator.ts +786 -0
  198. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  199. package/src/prover/smt/solver/der.ts +38 -10
  200. package/src/prover/smt/solver/diff-neq.ts +206 -0
  201. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  202. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  203. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  204. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  205. package/src/prover/smt/solver/e-matching.ts +7 -8
  206. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  207. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  208. package/src/prover/smt/solver/enode.ts +100 -3
  209. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  210. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  211. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  212. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  213. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  214. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  215. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  216. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  217. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  218. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  219. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  220. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  221. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  222. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  223. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  224. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  225. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  226. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  227. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  228. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  229. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  230. package/src/prover/smt/solver/expr-ref.ts +0 -1
  231. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  232. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  233. package/src/prover/smt/solver/factor.ts +163 -0
  234. package/src/prover/smt/solver/fd-solver.ts +267 -0
  235. package/src/prover/smt/solver/fingerprints.ts +15 -15
  236. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  237. package/src/prover/smt/solver/flat-literals.ts +0 -1
  238. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  239. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  240. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  241. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  242. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  243. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  244. package/src/prover/smt/solver/goal.ts +177 -15
  245. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  246. package/src/prover/smt/solver/guard-set.ts +219 -0
  247. package/src/prover/smt/solver/hash.ts +0 -1
  248. package/src/prover/smt/solver/hashtable.ts +30 -16
  249. package/src/prover/smt/solver/inf-eps.ts +63 -0
  250. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  251. package/src/prover/smt/solver/internalizer.ts +110 -38
  252. package/src/prover/smt/solver/lackr.ts +381 -0
  253. package/src/prover/smt/solver/lbool.ts +0 -1
  254. package/src/prover/smt/solver/lia2card.ts +268 -0
  255. package/src/prover/smt/solver/lia2pb.ts +154 -0
  256. package/src/prover/smt/solver/literal.ts +0 -1
  257. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  258. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  259. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  260. package/src/prover/smt/solver/lp/containers.ts +7 -2
  261. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  262. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  263. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  264. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  265. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  266. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  267. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  268. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  269. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  270. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  271. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  272. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  273. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  274. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  275. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  276. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  277. package/src/prover/smt/solver/lp/nex.ts +2 -2
  278. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  280. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  281. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  284. package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
  285. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  287. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  288. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  289. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  292. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  295. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  297. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  298. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  299. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  300. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  301. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  302. package/src/prover/smt/solver/lp/pdd.ts +725 -289
  303. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  304. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  305. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  306. package/src/prover/smt/solver/macro-finder.ts +530 -0
  307. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  308. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  309. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  310. package/src/prover/smt/solver/max-cliques.ts +105 -0
  311. package/src/prover/smt/solver/maxcore.ts +309 -0
  312. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  313. package/src/prover/smt/solver/maxlex.ts +115 -0
  314. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  315. package/src/prover/smt/solver/maxsmt.ts +92 -0
  316. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  317. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  318. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  319. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  320. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  321. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  322. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  323. package/src/prover/smt/solver/model-checker.ts +18 -27
  324. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  325. package/src/prover/smt/solver/model-finder.ts +12 -18
  326. package/src/prover/smt/solver/model-generator.ts +56 -29
  327. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  328. package/src/prover/smt/solver/model-printer.ts +214 -0
  329. package/src/prover/smt/solver/mpf.ts +711 -0
  330. package/src/prover/smt/solver/mus.ts +51 -0
  331. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  332. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  333. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  334. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  335. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  336. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  337. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  338. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  339. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  340. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  341. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  342. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  343. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  344. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  345. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  346. package/src/prover/smt/solver/muz/spacer-context.ts +1407 -0
  347. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  348. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  349. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  350. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  351. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  352. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  353. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  354. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  355. package/src/prover/smt/solver/nlqsat.ts +484 -0
  356. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -97
  357. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  358. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  359. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  360. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  361. package/src/prover/smt/solver/nlsat/levelwise.ts +464 -246
  362. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  363. package/src/prover/smt/solver/nlsat/polynomial.ts +2410 -683
  364. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  365. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  366. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  367. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  368. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  369. package/src/prover/smt/solver/nlsat/upolynomial.ts +40 -19
  370. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  371. package/src/prover/smt/solver/nnf.ts +105 -23
  372. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  373. package/src/prover/smt/solver/occf.ts +97 -0
  374. package/src/prover/smt/solver/opt-context.ts +792 -0
  375. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  376. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  377. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  378. package/src/prover/smt/solver/opt-solver.ts +311 -0
  379. package/src/prover/smt/solver/opt-value.ts +55 -0
  380. package/src/prover/smt/solver/optsmt.ts +692 -0
  381. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  382. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  383. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  384. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  385. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  386. package/src/prover/smt/solver/probes.ts +512 -0
  387. package/src/prover/smt/solver/propagate-values.ts +37 -21
  388. package/src/prover/smt/solver/proto-model.ts +648 -19
  389. package/src/prover/smt/solver/pull-quant.ts +28 -12
  390. package/src/prover/smt/solver/purify-arith.ts +632 -0
  391. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  392. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  393. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  394. package/src/prover/smt/solver/qe-lite.ts +37 -17
  395. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  396. package/src/prover/smt/solver/qe.ts +1498 -0
  397. package/src/prover/smt/solver/qel.ts +25 -0
  398. package/src/prover/smt/solver/qi-queue.ts +0 -1
  399. package/src/prover/smt/solver/qsat.ts +814 -0
  400. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  401. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  402. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  403. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  404. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  405. package/src/prover/smt/solver/random-gen.ts +0 -1
  406. package/src/prover/smt/solver/rational.ts +45 -1
  407. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  408. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  409. package/src/prover/smt/solver/reduce-args.ts +225 -0
  410. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  411. package/src/prover/smt/solver/ref-vector.ts +0 -1
  412. package/src/prover/smt/solver/relevancy.ts +1 -2
  413. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  414. package/src/prover/smt/solver/rewriter.ts +475 -36
  415. package/src/prover/smt/solver/rlimit.ts +38 -2
  416. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  417. package/src/prover/smt/solver/sat/big.ts +177 -0
  418. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  419. package/src/prover/smt/solver/sat/clause.ts +203 -0
  420. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  421. package/src/prover/smt/solver/sat/config.ts +122 -0
  422. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  423. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  424. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  425. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  426. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  427. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  428. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  429. package/src/prover/smt/solver/sat/probing.ts +170 -0
  430. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  431. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  432. package/src/prover/smt/solver/sat/scc.ts +142 -0
  433. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  434. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  435. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  436. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  437. package/src/prover/smt/solver/search-tree.ts +284 -0
  438. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  439. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  440. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  441. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  442. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  443. package/src/prover/smt/solver/seq-factory.ts +89 -0
  444. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  445. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  446. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  447. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  448. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  449. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  450. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  451. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  452. package/src/prover/smt/solver/seq-subset.ts +165 -0
  453. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  454. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  455. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  456. package/src/prover/smt/solver/smt-logics.ts +66 -0
  457. package/src/prover/smt/solver/smt-setup.ts +496 -0
  458. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  459. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  460. package/src/prover/smt/solver/smtlib-script.ts +1704 -0
  461. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  462. package/src/prover/smt/solver/solver.ts +113 -22
  463. package/src/prover/smt/solver/static-features.ts +314 -0
  464. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  465. package/src/prover/smt/solver/tactic.ts +1995 -0
  466. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  467. package/src/prover/smt/solver/theory-array.ts +1240 -0
  468. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  469. package/src/prover/smt/solver/theory-char.ts +355 -0
  470. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  471. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  472. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  473. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  474. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  475. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  476. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  477. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  478. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  479. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  480. package/src/prover/smt/solver/theory-lra.ts +188 -1
  481. package/src/prover/smt/solver/theory-pb.ts +934 -0
  482. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  483. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  484. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  485. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  486. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  487. package/src/prover/smt/solver/theory-seq.ts +961 -0
  488. package/src/prover/smt/solver/theory.ts +189 -0
  489. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  490. package/src/prover/smt/solver/var-subst.ts +36 -14
  491. package/src/prover/smt/table.ts +3 -2
  492. package/src/prover/smt/types.ts +146 -0
  493. package/src/prover/tlapm/cache.ts +50 -19
  494. package/src/prover/tlapm/tlapm.ts +15 -9
  495. package/src/prover/tlapm-library.ts +3208 -0
  496. package/src/prover/verdict.ts +9 -0
  497. package/src/prover/zenon/check/check.ts +1 -2
  498. package/src/prover/zenon/check/records.ts +1 -1
  499. package/src/prover/zenon/check/relations.ts +2 -1
  500. package/src/prover/zenon/check/rewrites.ts +2 -15
  501. package/src/prover/zenon/check/sets.ts +40 -58
  502. package/src/prover/zenon/check/terms.ts +1 -2
  503. package/src/prover/zenon/decide.ts +10 -7
  504. package/src/prover/zenon/encode.ts +0 -2
  505. package/src/prover/zenon/eqrel.ts +2 -2
  506. package/src/prover/zenon/equality-rules.ts +24 -2
  507. package/src/prover/zenon/expr.ts +28 -2
  508. package/src/prover/zenon/index-table.ts +11 -21
  509. package/src/prover/zenon/isar-case.ts +0 -2
  510. package/src/prover/zenon/isar.ts +35 -37
  511. package/src/prover/zenon/llproof.ts +2 -13
  512. package/src/prover/zenon/mltoll.ts +12 -30
  513. package/src/prover/zenon/node.ts +20 -5
  514. package/src/prover/zenon/parse.ts +9 -8
  515. package/src/prover/zenon/phrase.ts +0 -2
  516. package/src/prover/zenon/proof.ts +0 -2
  517. package/src/prover/zenon/propositional-rules.ts +0 -2
  518. package/src/prover/zenon/rules.ts +2 -3
  519. package/src/prover/zenon/search.ts +11 -19
  520. package/src/prover/zenon/tla/functions.ts +2 -4
  521. package/src/prover/zenon/tla/llproof.ts +9 -13
  522. package/src/prover/zenon/tla/records.ts +1 -8
  523. package/src/prover/zenon/tla/rewrites.ts +0 -2
  524. package/src/prover/zenon/tla/sets.ts +22 -22
  525. package/src/prover/zenon/tla/terms.ts +0 -2
  526. package/src/prover/zenon/tla/tla.ts +7 -8
  527. package/src/resolve.ts +127 -108
  528. package/src/runtime.ts +6 -0
  529. package/src/sany/generation.ts +382 -0
  530. package/src/sany/generator-def-entries.ts +210 -0
  531. package/src/sany/generator-definitions.ts +686 -0
  532. package/src/sany/generator-expressions.ts +1092 -0
  533. package/src/sany/generator-proofs.ts +662 -0
  534. package/src/sany/generator.ts +155 -2625
  535. package/src/sany/levels.ts +0 -2
  536. package/src/sany/lexer.ts +17 -16
  537. package/src/sany/linter.ts +0 -2
  538. package/src/sany/nodes.ts +6 -13
  539. package/src/sany/report.ts +3 -6
  540. package/src/sany/selectors.ts +35 -38
  541. package/src/sany/xml.ts +23 -55
  542. package/src/search.ts +243 -52
  543. package/src/simulate.ts +160 -133
  544. package/src/spec-description.ts +33 -48
  545. package/src/standard-definitions.ts +4 -0
  546. package/src/standard-modules.ts +16 -32
  547. package/src/state-graph.ts +2 -9
  548. package/src/subexpressions.ts +3 -1
  549. package/src/substitution-levels.ts +5 -4
  550. package/src/successors.ts +6 -8
  551. package/src/symmetry.ts +2 -2
  552. package/src/tableau.ts +2 -2
  553. package/src/tlc/fingerprint.ts +81 -9
  554. package/src/tlc/jar-data.ts +12 -0
  555. package/src/tlc/messages.ts +20 -15
  556. package/src/tlc/order.ts +16 -12
  557. package/src/tlc/random.ts +4 -4
  558. package/src/tlc/replay.ts +8 -15
  559. package/src/tlc/summary.ts +29 -14
  560. package/src/tlc/tlc-operators.ts +2 -3
  561. package/src/tlc/tlcext-operators.ts +61 -16
  562. package/src/tlc/trace-spec.ts +26 -47
  563. package/src/typed-tier.ts +6535 -0
  564. package/src/typescript/actions.ts +2 -4
  565. package/src/typescript/collections.ts +34 -20
  566. package/src/typescript/compile.ts +1 -3
  567. package/src/typescript/formula.ts +5 -3
  568. package/src/typescript/model.ts +4 -5
  569. package/src/typescript/steps.ts +20 -18
  570. package/src/values.ts +63 -158
  571. package/src/prover/isabelle/isar/statement.ts +0 -52
  572. package/src/prover/smt/solver/z3-license.txt +0 -10
  573. package/src/prover/tlaps-module.ts +0 -510
  574. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,907 @@
1
+ import {
2
+ type AstManager,
3
+ OP_ADD,
4
+ OP_AND,
5
+ OP_ARRAY_EXT,
6
+ OP_ARRAY_MAP,
7
+ OP_BADD,
8
+ OP_BAND,
9
+ OP_BCOMP,
10
+ OP_BMUL,
11
+ OP_BOR,
12
+ OP_BXNOR,
13
+ OP_BXOR,
14
+ OP_EQ,
15
+ OP_MUL,
16
+ OP_OR,
17
+ OP_XOR,
18
+ } from "../ast";
19
+ import { CgTable } from "../cg-table";
20
+ import { L_FALSE, L_TRUE, L_UNDEF } from "../lbool";
21
+
22
+ export const NULL_THEORY_VAR = -1;
23
+ export const NULL_BOOL_VAR = -1;
24
+
25
+ const J_AXIOM = 0;
26
+ export const J_CONGRUENCE = 1;
27
+ export const J_EXTERNAL = 2;
28
+
29
+ export interface Justification {
30
+ readonly kind: number;
31
+ readonly isCommutative: boolean;
32
+ readonly external: number;
33
+ }
34
+
35
+ export const AXIOM: Justification = {
36
+ kind: J_AXIOM,
37
+ isCommutative: false,
38
+ external: 0,
39
+ };
40
+
41
+ const CONGRUENCES: readonly Justification[] = [
42
+ { kind: J_CONGRUENCE, isCommutative: false, external: 0 },
43
+ { kind: J_CONGRUENCE, isCommutative: true, external: 0 },
44
+ ];
45
+
46
+ export const mkExternal = (external: number): Justification => ({
47
+ kind: J_EXTERNAL,
48
+ isCommutative: false,
49
+ external,
50
+ });
51
+
52
+ interface ThVar {
53
+ id: number;
54
+ thVar: number;
55
+ }
56
+
57
+ export class Enode {
58
+ root: Enode = this;
59
+ next: Enode = this;
60
+ target: Enode | null = null;
61
+ cg: Enode = this;
62
+ parents: Enode[] = [];
63
+ justification = AXIOM;
64
+ litJustification = AXIOM;
65
+ boolVar = NULL_BOOL_VAR;
66
+ value = L_UNDEF;
67
+ classSize = 1;
68
+ thVars: ThVar[] = [];
69
+ isMarked1 = false;
70
+ isMarked2 = false;
71
+ isMarked3 = false;
72
+ isInterpreted = false;
73
+ isCgcEnabled = true;
74
+ isMergeTfEnabled = false;
75
+ isEquality = false;
76
+ isRelevant = false;
77
+ isShared = L_UNDEF;
78
+ lblHash = -1;
79
+ lbls = 0;
80
+ lblsHigh = 0;
81
+ plbls = 0;
82
+ plblsHigh = 0;
83
+
84
+ constructor(
85
+ readonly owner: number,
86
+ readonly decl: number,
87
+ readonly args: readonly Enode[],
88
+ readonly generation: number,
89
+ readonly isCommutative: boolean,
90
+ ) {}
91
+
92
+ get numArgs() {
93
+ return this.args.length;
94
+ }
95
+
96
+ get isCommutativeTable() {
97
+ return this.isCommutative;
98
+ }
99
+
100
+ getArg(index: number) {
101
+ return this.args[index];
102
+ }
103
+
104
+ get isRoot() {
105
+ return this.root === this;
106
+ }
107
+
108
+ get isCgr() {
109
+ return this.cg === this;
110
+ }
111
+
112
+ get mergeTf() {
113
+ return (
114
+ this.isMergeTfEnabled &&
115
+ (this.classSize > 1 || this.parents.length > 0 || this.args.length > 0)
116
+ );
117
+ }
118
+
119
+ getThVar(id: number) {
120
+ for (const entry of this.thVars) if (entry.id === id) return entry.thVar;
121
+ return NULL_THEORY_VAR;
122
+ }
123
+
124
+ hasThVars() {
125
+ return this.thVars.length > 0;
126
+ }
127
+
128
+ addThVar(thVar: number, id: number) {
129
+ this.thVars.push({ id, thVar });
130
+ }
131
+
132
+ replaceThVar(thVar: number, id: number) {
133
+ for (const entry of this.thVars) if (entry.id === id) entry.thVar = thVar;
134
+ }
135
+
136
+ delThVar(id: number) {
137
+ const index = this.thVars.findIndex((entry) => entry.id === id);
138
+ if (index !== -1) this.thVars.splice(index, 1);
139
+ }
140
+
141
+ classGeneration() {
142
+ let generation = this.generation;
143
+ for (const node of getClass(this)) generation = Math.min(node.generation, generation);
144
+ return generation;
145
+ }
146
+
147
+ congruent(other: Enode) {
148
+ if (this.decl !== other.decl || this.args.length !== other.args.length) return false;
149
+ if (
150
+ this.isCommutative &&
151
+ this.args[0].root === other.args[1].root &&
152
+ this.args[1].root === other.args[0].root
153
+ )
154
+ return true;
155
+ for (let index = this.args.length; index-- > 0;)
156
+ if (this.args[index].root !== other.args[index].root) return false;
157
+ return true;
158
+ }
159
+ }
160
+
161
+ const getClosestThVar = (node: Enode, id: number) => {
162
+ for (let current: Enode | null = node; current !== null; current = current.target) {
163
+ const thVar = current.getThVar(id);
164
+ if (thVar !== NULL_THEORY_VAR) return thVar;
165
+ }
166
+ return NULL_THEORY_VAR;
167
+ };
168
+
169
+ const reverseJustification = (node: Enode) => {
170
+ let current = node.target;
171
+ let previous = node;
172
+ let justification = node.justification;
173
+ previous.target = null;
174
+ previous.justification = AXIOM;
175
+ while (current !== null) {
176
+ const nextCurrent: Enode | null = current.target;
177
+ const nextJustification = current.justification;
178
+ current.target = previous;
179
+ current.justification = justification;
180
+ previous = current;
181
+ justification = nextJustification;
182
+ current = nextCurrent;
183
+ }
184
+ };
185
+
186
+ export const getClass = function* (node: Enode) {
187
+ let current = node;
188
+ do {
189
+ yield current;
190
+ current = current.next;
191
+ } while (current !== node);
192
+ };
193
+
194
+ export interface ThEq {
195
+ readonly id: number;
196
+ readonly v1: number;
197
+ readonly v2: number;
198
+ // child for an equality, the equality atom for a disequality
199
+ readonly child: Enode;
200
+ readonly root: Enode | null;
201
+ }
202
+
203
+ const U_ADD_NODE = 0;
204
+ const U_SET_PARENT = 1;
205
+ const U_TOGGLE_CGC = 2;
206
+ const U_TOGGLE_MERGE_TF = 3;
207
+ const U_ADD_TH_VAR = 4;
208
+ const U_REPLACE_TH_VAR = 5;
209
+ const U_NEW_TH_EQ = 6;
210
+ const U_NEW_TH_EQ_QHEAD = 7;
211
+ const U_INCONSISTENT = 8;
212
+ const U_VALUE_ASSIGNMENT = 9;
213
+ const U_LBL_HASH = 10;
214
+ const U_LBL_SET = 11;
215
+ const U_UPDATE_CHILDREN = 12;
216
+ const U_SET_RELEVANT = 13;
217
+
218
+ interface UpdateRecord {
219
+ tag: number;
220
+ r1: Enode | null;
221
+ n1: Enode | null;
222
+ num: number;
223
+ num2: number;
224
+ }
225
+
226
+ const TO_MERGE_PLAIN = 0;
227
+ const TO_MERGE_COMM = 1;
228
+ const TO_ADD_LITERAL = 2;
229
+
230
+ interface ToMerge {
231
+ a: Enode;
232
+ b: Enode | null;
233
+ kind: number;
234
+ }
235
+
236
+ // func_decl_info::is_commutative, which the decl plugins set by family and kind.
237
+ export const isCommutativeDecl = (manager: AstManager, decl: number): boolean => {
238
+ const funcDecl = manager.funcDecls[decl];
239
+ switch (funcDecl.op) {
240
+ case OP_EQ:
241
+ case OP_AND:
242
+ case OP_OR:
243
+ case OP_XOR:
244
+ case OP_ADD:
245
+ case OP_MUL:
246
+ case OP_BADD:
247
+ case OP_BMUL:
248
+ case OP_BAND:
249
+ case OP_BOR:
250
+ case OP_BXOR:
251
+ case OP_BXNOR:
252
+ case OP_BCOMP:
253
+ case OP_ARRAY_EXT:
254
+ return true;
255
+ case OP_ARRAY_MAP:
256
+ return isCommutativeDecl(manager, funcDecl.parameters[0]);
257
+ default:
258
+ return false;
259
+ }
260
+ };
261
+
262
+ export class Egraph {
263
+ readonly nodes: Enode[] = [];
264
+ private toMerge: ToMerge[] = [];
265
+ private table = new CgTable<Enode>();
266
+ private updates: UpdateRecord[] = [];
267
+ private scopes: number[] = [];
268
+ private expr2enode: (Enode | undefined)[] = [];
269
+ private decl2enodes = new Map<number, Enode[]>();
270
+ private numScopes = 0;
271
+ isInconsistent = false;
272
+ private n1: Enode | null = null;
273
+ private n2: Enode | null = null;
274
+ private conflictJustification = AXIOM;
275
+ private newThEqsQhead = 0;
276
+ private newThEqs: ThEq[] = [];
277
+ private thPropagatesDiseqs: boolean[] = [];
278
+ private todo: Enode[] = [];
279
+ usesCongruence = false;
280
+ isDefaultRelevant = true;
281
+ readonly onMerge: ((root: Enode, other: Enode) => void)[] = [];
282
+ onPropagateLiteral: ((lit: Enode, ante: Enode | null) => void) | null = null;
283
+ onMake: ((node: Enode) => void) | null = null;
284
+ readonly stats = {
285
+ merges: 0,
286
+ thEqs: 0,
287
+ thDiseqs: 0,
288
+ lits: 0,
289
+ eqs: 0,
290
+ conflicts: 0,
291
+ };
292
+
293
+ constructor(private manager: AstManager) {}
294
+
295
+ private push(tag: number, r1: Enode | null, n1: Enode | null = null, num = 0) {
296
+ this.updates.push({ tag, r1, n1, num, num2: 0 });
297
+ }
298
+
299
+ find(expr: number) {
300
+ return this.expr2enode[expr];
301
+ }
302
+
303
+ findCongruent(decl: number, args: readonly Enode[]) {
304
+ return this.table.findFor(
305
+ decl,
306
+ args,
307
+ args.length === 2 && isCommutativeDecl(this.manager, decl),
308
+ );
309
+ }
310
+
311
+ enodesOf(decl: number) {
312
+ return this.decl2enodes.get(decl) ?? [];
313
+ }
314
+
315
+ get numNodes() {
316
+ return this.nodes.length;
317
+ }
318
+
319
+ private forcePush() {
320
+ for (; this.numScopes > 0; this.numScopes--) {
321
+ this.scopes.push(this.updates.length);
322
+ this.push(U_NEW_TH_EQ_QHEAD, null, null, this.newThEqsQhead);
323
+ }
324
+ }
325
+
326
+ private mkEnode(expr: number, generation: number, args: readonly Enode[]) {
327
+ const manager = this.manager;
328
+ const isApp = manager.isApp(expr);
329
+ const decl = isApp ? manager.decls[expr] : -1;
330
+ const node = new Enode(
331
+ expr,
332
+ decl,
333
+ args,
334
+ generation,
335
+ args.length === 2 && isApp && isCommutativeDecl(manager, decl),
336
+ );
337
+ if (this.isDefaultRelevant) node.isRelevant = true;
338
+ this.nodes.push(node);
339
+ if (isApp && args.length > 0) {
340
+ const enodes = this.decl2enodes.get(decl);
341
+ if (enodes === undefined) this.decl2enodes.set(decl, [node]);
342
+ else enodes.push(node);
343
+ }
344
+ while (this.expr2enode.length < expr) this.expr2enode.push(undefined);
345
+ this.expr2enode[expr] = node;
346
+ manager.incRef(expr);
347
+ this.push(U_ADD_NODE, node);
348
+ for (const arg of args) {
349
+ this.setCgcEnabled(arg, true);
350
+ arg.root.isShared = L_UNDEF;
351
+ }
352
+ return node;
353
+ }
354
+
355
+ mk(expr: number, generation: number, args: readonly Enode[]) {
356
+ this.forcePush();
357
+ const manager = this.manager;
358
+ const node = this.mkEnode(expr, generation, args);
359
+ if (args.length === 0 && manager.isUniqueValue(expr)) node.isInterpreted = true;
360
+ this.onMake?.(node);
361
+ if (args.length === 0) return node;
362
+ if (manager.getOp(expr) === OP_EQ && !manager.isBool(args[0].owner)) {
363
+ node.isEquality = true;
364
+ this.reinsertEquality(node);
365
+ }
366
+ const other = this.insertTable(node);
367
+ if (other === node) this.updateChildren(node);
368
+ else this.pushMerge(node, other, this.isComm(node, other));
369
+ return node;
370
+ }
371
+
372
+ private isComm(node: Enode, other: Enode) {
373
+ return node.isCommutative && node.args[0].root !== other.args[0].root;
374
+ }
375
+
376
+ private insertTable(node: Enode) {
377
+ const other = this.table.insert(node);
378
+ node.cg = other;
379
+ return other;
380
+ }
381
+
382
+ private reinsertEquality(node: Enode) {
383
+ if (node.value !== L_TRUE && node.args[0].root === node.args[1].root) {
384
+ this.queueLiteral(node, null);
385
+ if (node.value === L_FALSE && this.onPropagateLiteral === null)
386
+ this.setConflict(node.args[0], node.args[1], node.litJustification);
387
+ }
388
+ }
389
+
390
+ private queueLiteral(node: Enode, ante: Enode | null) {
391
+ if (this.onPropagateLiteral !== null)
392
+ this.toMerge.push({ a: node, b: ante, kind: TO_ADD_LITERAL });
393
+ }
394
+
395
+ private updateChildren(node: Enode) {
396
+ for (const child of node.args) child.root.parents.push(node);
397
+ this.push(U_UPDATE_CHILDREN, node);
398
+ }
399
+
400
+ private pushMerge(a: Enode, b: Enode, isComm: boolean) {
401
+ this.toMerge.push({ a, b, kind: isComm ? TO_MERGE_COMM : TO_MERGE_PLAIN });
402
+ }
403
+
404
+ pushScope() {
405
+ if (this.canPropagate()) this.propagate();
406
+ this.numScopes++;
407
+ }
408
+
409
+ canPropagate() {
410
+ return this.toMerge.length > 0;
411
+ }
412
+
413
+ private addThEq(id: number, v1: number, v2: number, child: Enode, root: Enode) {
414
+ this.newThEqs.push({ id, v1, v2, child, root });
415
+ this.push(U_NEW_TH_EQ, null);
416
+ this.stats.thEqs++;
417
+ }
418
+
419
+ addThDiseq(id: number, v1: number, v2: number, eq: Enode) {
420
+ if (!this.thPropagatesDiseqs[id]) return;
421
+ this.newThEqs.push({ id, v1, v2, child: eq, root: null });
422
+ this.push(U_NEW_TH_EQ, null);
423
+ this.stats.thDiseqs++;
424
+ }
425
+
426
+ private addLiteral(node: Enode, ante: Enode | null) {
427
+ const onPropagate = this.onPropagateLiteral;
428
+ if (onPropagate === null) return;
429
+ if (ante === null) this.stats.eqs++;
430
+ else this.stats.lits++;
431
+ if (ante === null) onPropagate(node, ante);
432
+ else if (this.manager.isTrue(ante.owner) || this.manager.isFalse(ante.owner)) {
433
+ for (const other of getClass(node)) if (other !== ante) onPropagate(other, ante);
434
+ } else
435
+ for (const other of getClass(node)) if (other.value !== ante.value) onPropagate(other, ante);
436
+ }
437
+
438
+ newDiseq(node: Enode) {
439
+ const arg1 = node.args[0];
440
+ const arg2 = node.args[1];
441
+ const r1 = arg1.root;
442
+ const r2 = arg2.root;
443
+ if (r1 === r2) {
444
+ this.addLiteral(node, null);
445
+ return;
446
+ }
447
+ if (!r1.hasThVars() || !r2.hasThVars()) return;
448
+ if (r1.thVars.length === 1 && r2.thVars.length === 1 && r1.thVars[0].id === r2.thVars[0].id) {
449
+ const id = r1.thVars[0].id;
450
+ if (!this.thPropagatesDiseqs[id]) return;
451
+ this.addThDiseq(id, getClosestThVar(arg1, id), getClosestThVar(arg2, id), node);
452
+ return;
453
+ }
454
+ for (const p of r1.thVars) {
455
+ if (!this.thPropagatesDiseqs[p.id]) continue;
456
+ for (const q of r2.thVars) if (p.id === q.id) this.addThDiseq(p.id, p.thVar, q.thVar, node);
457
+ }
458
+ }
459
+
460
+ private addThDiseqs(id: number, v1: number, root: Enode) {
461
+ if (!this.thPropagatesDiseqs[id]) return;
462
+ for (const parent of root.parents) {
463
+ if (!parent.isEquality || parent.value !== L_FALSE) continue;
464
+ const other = (root === parent.args[0].root ? parent.args[1] : parent.args[0]).root;
465
+ const v2 = getClosestThVar(other, id);
466
+ if (v2 !== NULL_THEORY_VAR) this.addThDiseq(id, v1, v2, parent);
467
+ }
468
+ }
469
+
470
+ setThPropagatesDiseqs(id: number) {
471
+ while (this.thPropagatesDiseqs.length <= id) this.thPropagatesDiseqs.push(false);
472
+ this.thPropagatesDiseqs[id] = true;
473
+ }
474
+
475
+ addThVar(node: Enode, thVar: number, id: number) {
476
+ this.forcePush();
477
+ const old = node.getThVar(id);
478
+ const root = node.root;
479
+ if (old === NULL_THEORY_VAR) {
480
+ node.addThVar(thVar, id);
481
+ this.push(U_ADD_TH_VAR, node, null, id);
482
+ if (root !== node) {
483
+ const rootVar = root.getThVar(id);
484
+ if (rootVar === NULL_THEORY_VAR) {
485
+ root.addThVar(thVar, id);
486
+ this.addThDiseqs(id, thVar, root);
487
+ } else this.addThEq(id, thVar, rootVar, node, root);
488
+ }
489
+ return;
490
+ }
491
+ const rootVar = root.getThVar(id);
492
+ node.replaceThVar(thVar, id);
493
+ // Deviation from Z3: the undo gives the node back its own variable, where Z3 gives it the root's and later equates the wrong terms.
494
+ this.updates.push({
495
+ tag: U_REPLACE_TH_VAR,
496
+ r1: node,
497
+ n1: null,
498
+ num: id,
499
+ num2: old,
500
+ });
501
+ this.addThEq(id, thVar, rootVar, node, root);
502
+ }
503
+
504
+ private undoAddThVar(node: Enode, id: number) {
505
+ const thVar = node.getThVar(id);
506
+ node.delThVar(id);
507
+ const root = node.root;
508
+ if (root !== node && root.getThVar(id) === thVar) root.delThVar(id);
509
+ }
510
+
511
+ setMergeTfEnabled(node: Enode, isEnabled: boolean) {
512
+ if (!this.manager.isBool(node.owner)) return;
513
+ if (isEnabled !== node.mergeTf) {
514
+ node.isMergeTfEnabled = isEnabled;
515
+ this.push(U_TOGGLE_MERGE_TF, node);
516
+ }
517
+ }
518
+
519
+ setCgcEnabled(node: Enode, isEnabled: boolean) {
520
+ if (isEnabled === node.isCgcEnabled) return;
521
+ this.toggleCgcEnabled(node, false);
522
+ this.push(U_TOGGLE_CGC, node);
523
+ }
524
+
525
+ setRelevant(node: Enode) {
526
+ if (node.isRelevant) return;
527
+ node.isRelevant = true;
528
+ this.push(U_SET_RELEVANT, node);
529
+ }
530
+
531
+ private toggleCgcEnabled(node: Enode, isBacktracking: boolean) {
532
+ const isEnabled = !node.isCgcEnabled;
533
+ node.isCgcEnabled = isEnabled;
534
+ if (node.args.length === 0) return;
535
+ if (isEnabled) {
536
+ const other = this.insertTable(node);
537
+ if (other !== node && !isBacktracking) this.pushMerge(node, other, this.isComm(node, other));
538
+ } else if (node.isCgr) this.table.erase(node);
539
+ }
540
+
541
+ setValue(node: Enode, value: number, justification: Justification) {
542
+ if (node.value !== L_UNDEF) return;
543
+ this.forcePush();
544
+ node.value = value;
545
+ node.litJustification = justification;
546
+ this.push(U_VALUE_ASSIGNMENT, node);
547
+ if (node.isEquality && value === L_FALSE) this.newDiseq(node);
548
+ }
549
+
550
+ setLblHash(node: Enode, hash: number) {
551
+ this.push(U_LBL_HASH, node, null, node.lblHash);
552
+ node.lblHash = hash;
553
+ const root = node.root;
554
+ const isLow = hash < 32;
555
+ const bit = 1 << hash;
556
+ if (((isLow ? root.lbls : root.lblsHigh) & bit) !== 0) return;
557
+ this.updates.push({ tag: U_LBL_SET, r1: root, n1: null, num: root.lbls, num2: root.lblsHigh });
558
+ if (isLow) root.lbls |= bit;
559
+ else root.lblsHigh |= bit;
560
+ }
561
+
562
+ popScopes(numScopes: number) {
563
+ if (numScopes <= this.numScopes) {
564
+ this.numScopes -= numScopes;
565
+ this.toMerge = [];
566
+ return;
567
+ }
568
+ numScopes -= this.numScopes;
569
+ this.numScopes = 0;
570
+ const oldLim = this.scopes.length - numScopes;
571
+ const numUpdates = this.scopes[oldLim];
572
+ const manager = this.manager;
573
+ for (let index = this.updates.length; index-- > numUpdates;) {
574
+ const record = this.updates[index];
575
+ const r1 = record.r1 as Enode;
576
+ switch (record.tag) {
577
+ case U_ADD_NODE: {
578
+ const node = this.nodes.pop() as Enode;
579
+ if (node.args.length > 0 && node.isCgr) this.table.erase(node);
580
+ this.expr2enode[node.owner] = undefined;
581
+ manager.decRef(node.owner);
582
+ if (node.args.length > 0) this.decl2enodes.get(node.decl)?.pop();
583
+ break;
584
+ }
585
+ case U_TOGGLE_CGC:
586
+ this.toggleCgcEnabled(r1, true);
587
+ break;
588
+ case U_TOGGLE_MERGE_TF:
589
+ r1.isMergeTfEnabled = !r1.mergeTf;
590
+ break;
591
+ case U_SET_PARENT:
592
+ this.undoEq(r1, record.n1 as Enode, record.num);
593
+ break;
594
+ case U_ADD_TH_VAR:
595
+ this.undoAddThVar(r1, record.num);
596
+ break;
597
+ case U_REPLACE_TH_VAR:
598
+ r1.replaceThVar(record.num2, record.num);
599
+ break;
600
+ case U_NEW_TH_EQ:
601
+ this.newThEqs.pop();
602
+ break;
603
+ case U_NEW_TH_EQ_QHEAD:
604
+ this.newThEqsQhead = record.num;
605
+ break;
606
+ case U_INCONSISTENT:
607
+ this.isInconsistent = false;
608
+ break;
609
+ case U_VALUE_ASSIGNMENT:
610
+ r1.value = L_UNDEF;
611
+ break;
612
+ case U_LBL_HASH:
613
+ r1.lblHash = record.num;
614
+ break;
615
+ case U_LBL_SET:
616
+ r1.lbls = record.num;
617
+ r1.lblsHigh = record.num2;
618
+ break;
619
+ case U_SET_RELEVANT:
620
+ r1.isRelevant = false;
621
+ break;
622
+ case U_UPDATE_CHILDREN:
623
+ for (const arg of r1.args) arg.root.parents.pop();
624
+ break;
625
+ }
626
+ }
627
+ this.updates.length = numUpdates;
628
+ this.scopes.length = oldLim;
629
+ this.toMerge = [];
630
+ }
631
+
632
+ merge(n1: Enode, n2: Enode, reason: number) {
633
+ this.mergeWith(n1, n2, mkExternal(reason));
634
+ }
635
+
636
+ private mergeWith(n1: Enode, n2: Enode, justification: Justification) {
637
+ if (!n1.isCgcEnabled && !n2.isCgcEnabled) return;
638
+ let r1 = n1.root;
639
+ let r2 = n2.root;
640
+ if (r1 === r2) return;
641
+ this.forcePush();
642
+ this.stats.merges++;
643
+ if (r1.isInterpreted && r2.isInterpreted) {
644
+ this.setConflict(n1, n2, justification);
645
+ return;
646
+ }
647
+ if (r1.value !== r2.value && r1.value !== L_UNDEF && r2.value !== L_UNDEF) {
648
+ this.setConflict(n1, n2, justification);
649
+ return;
650
+ }
651
+ if (
652
+ !r2.isInterpreted &&
653
+ (r1.classSize > r2.classSize || r1.isInterpreted || r1.value !== L_UNDEF)
654
+ ) {
655
+ [r1, r2] = [r2, r1];
656
+ [n1, n2] = [n2, n1];
657
+ }
658
+ this.removeParents(r1);
659
+ this.push(U_SET_PARENT, r1, n1, r2.parents.length);
660
+ reverseJustification(n1);
661
+ n1.target = n2;
662
+ n1.justification = justification;
663
+ for (const node of getClass(n1)) node.root = r2;
664
+ const next = r1.next;
665
+ r1.next = r2.next;
666
+ r2.next = next;
667
+ r2.classSize += r1.classSize;
668
+ r2.isShared = L_UNDEF;
669
+ this.mergeThEq(r1, r2);
670
+ this.reinsertParents(r1, r2);
671
+ const manager = this.manager;
672
+ if (
673
+ justification.kind === J_CONGRUENCE &&
674
+ (manager.isFalse(r2.owner) || manager.isTrue(r2.owner))
675
+ )
676
+ this.addLiteral(n1, r2);
677
+ else if (n2.value !== L_UNDEF && n1.value !== n2.value) this.addLiteral(n1, n2);
678
+ else if (n1.value !== L_UNDEF && n2.value !== n1.value) this.addLiteral(n2, n1);
679
+ for (const onMerge of this.onMerge) onMerge(r2, r1);
680
+ }
681
+
682
+ private removeParents(root: Enode) {
683
+ for (const parent of root.parents) {
684
+ if (parent.isMarked1) continue;
685
+ if (parent.isCgcEnabled) {
686
+ if (!parent.isCgr) continue;
687
+ parent.isMarked1 = true;
688
+ this.table.erase(parent);
689
+ } else if (parent.isEquality) parent.isMarked1 = true;
690
+ }
691
+ }
692
+
693
+ private reinsertParents(r1: Enode, r2: Enode) {
694
+ for (const parent of r1.parents) {
695
+ if (!parent.isMarked1) continue;
696
+ parent.isMarked1 = false;
697
+ if (parent.isCgcEnabled) {
698
+ const other = this.insertTable(parent);
699
+ if (other !== parent) this.pushMerge(other, parent, this.isComm(other, parent));
700
+ else r2.parents.push(parent);
701
+ if (parent.isEquality) this.reinsertEquality(parent);
702
+ } else if (parent.isEquality) {
703
+ r2.parents.push(parent);
704
+ this.reinsertEquality(parent);
705
+ }
706
+ }
707
+ }
708
+
709
+ private mergeThEq(node: Enode, root: Enode) {
710
+ for (const entry of node.thVars) {
711
+ const rootVar = root.getThVar(entry.id);
712
+ if (rootVar === NULL_THEORY_VAR) {
713
+ root.addThVar(entry.thVar, entry.id);
714
+ this.push(U_ADD_TH_VAR, root, null, entry.id);
715
+ this.addThDiseqs(entry.id, entry.thVar, root);
716
+ } else this.addThEq(entry.id, rootVar, entry.thVar, node, root);
717
+ }
718
+ }
719
+
720
+ private undoEq(r1: Enode, n1: Enode, r2NumParents: number) {
721
+ const r2 = r1.root;
722
+ r2.classSize -= r1.classSize;
723
+ r2.isShared = L_UNDEF;
724
+ const next = r1.next;
725
+ r1.next = r2.next;
726
+ r2.next = next;
727
+ for (let index = r2NumParents; index < r2.parents.length; index++) {
728
+ const parent = r2.parents[index];
729
+ if (parent.isCgcEnabled) this.table.erase(parent);
730
+ }
731
+ for (const node of getClass(r1)) node.root = r1;
732
+ for (const parent of r1.parents)
733
+ if (parent.isCgcEnabled && (parent.isCgr || !parent.congruent(parent.cg)))
734
+ this.insertTable(parent);
735
+ r2.parents.length = r2NumParents;
736
+ n1.target = null;
737
+ n1.justification = AXIOM;
738
+ reverseJustification(n1.root);
739
+ }
740
+
741
+ propagate() {
742
+ this.forcePush();
743
+ const toMerge = this.toMerge;
744
+ for (
745
+ let index = 0;
746
+ index < toMerge.length && this.manager.limit.inc() && !this.isInconsistent;
747
+ index++
748
+ ) {
749
+ const item = toMerge[index];
750
+ switch (item.kind) {
751
+ case TO_MERGE_PLAIN:
752
+ case TO_MERGE_COMM:
753
+ this.mergeWith(item.a, item.b as Enode, CONGRUENCES[item.kind]);
754
+ break;
755
+ case TO_ADD_LITERAL:
756
+ this.addLiteral(item.a, item.b);
757
+ break;
758
+ }
759
+ }
760
+ this.toMerge = [];
761
+ return this.newThEqsQhead < this.newThEqs.length || this.isInconsistent;
762
+ }
763
+
764
+ private setConflict(n1: Enode, n2: Enode, justification: Justification) {
765
+ this.stats.conflicts++;
766
+ if (this.isInconsistent) return;
767
+ this.isInconsistent = true;
768
+ this.push(U_INCONSISTENT, null);
769
+ this.n1 = n1;
770
+ this.n2 = n2;
771
+ this.conflictJustification = justification;
772
+ }
773
+
774
+ hasThEq() {
775
+ return this.newThEqsQhead < this.newThEqs.length;
776
+ }
777
+
778
+ getThEq() {
779
+ return this.newThEqs[this.newThEqsQhead];
780
+ }
781
+
782
+ nextThEq() {
783
+ this.forcePush();
784
+ this.newThEqsQhead++;
785
+ }
786
+
787
+ areDiseq(a: Enode, b: Enode) {
788
+ const ra = a.root;
789
+ const rb = b.root;
790
+ if (ra === rb) return false;
791
+ if (ra.isInterpreted && rb.isInterpreted) return true;
792
+ if (this.manager.sorts[ra.owner] !== this.manager.sorts[rb.owner]) return true;
793
+ const eq = this.tmpEq(ra, rb);
794
+ return eq !== null && eq.root.value === L_FALSE;
795
+ }
796
+
797
+ tmpEq(a: Enode, b: Enode) {
798
+ if (a.parents.length > b.parents.length) [a, b] = [b, a];
799
+ for (const parent of a.parents)
800
+ if (parent.isEquality && (b === parent.args[0].root || b === parent.args[1].root))
801
+ return parent;
802
+ return null;
803
+ }
804
+
805
+ private pushCongruence(n1: Enode, n2: Enode, isComm: boolean) {
806
+ this.usesCongruence = true;
807
+ if (isComm && n1.args[0].root === n2.args[1].root && n1.args[1].root === n2.args[0].root) {
808
+ this.pushLca(n1.args[0], n2.args[1]);
809
+ this.pushLca(n1.args[1], n2.args[0]);
810
+ return;
811
+ }
812
+ for (let index = 0; index < n1.args.length; index++)
813
+ this.pushLca(n1.args[index], n2.args[index]);
814
+ }
815
+
816
+ private findLca(a: Enode, b: Enode) {
817
+ for (let node: Enode | null = a; node !== null; node = node.target) node.isMarked2 = true;
818
+ let lca = b;
819
+ while (!lca.isMarked2) lca = lca.target as Enode;
820
+ for (let node: Enode | null = a; node !== null; node = node.target) node.isMarked2 = false;
821
+ return lca;
822
+ }
823
+
824
+ private pushToLca(node: Enode, lca: Enode) {
825
+ for (let current = node; current !== lca; current = current.target as Enode)
826
+ this.todo.push(current);
827
+ }
828
+
829
+ private pushLca(a: Enode, b: Enode) {
830
+ const lca = this.findLca(a, b);
831
+ this.pushToLca(a, lca);
832
+ this.pushToLca(b, lca);
833
+ }
834
+
835
+ private pushTodo(node: Enode | null) {
836
+ for (let current = node; current !== null; current = current.target) this.todo.push(current);
837
+ }
838
+
839
+ beginExplain() {
840
+ this.usesCongruence = false;
841
+ }
842
+
843
+ endExplain() {
844
+ for (const node of this.todo) node.isMarked1 = false;
845
+ this.todo = [];
846
+ }
847
+
848
+ explain(justifications: number[]) {
849
+ this.pushTodo(this.n1);
850
+ this.pushTodo(this.n2);
851
+ this.explainJustification(
852
+ justifications,
853
+ this.n1 as Enode,
854
+ this.n2 as Enode,
855
+ this.conflictJustification,
856
+ );
857
+ this.explainTodo(justifications);
858
+ }
859
+
860
+ private explainJustification(
861
+ justifications: number[],
862
+ a: Enode,
863
+ b: Enode,
864
+ justification: Justification,
865
+ ) {
866
+ if (justification.kind === J_EXTERNAL) justifications.push(justification.external);
867
+ else if (justification.kind === J_CONGRUENCE)
868
+ this.pushCongruence(a, b, justification.isCommutative);
869
+ }
870
+
871
+ explainEq(justifications: number[], a: Enode, b: Enode) {
872
+ const lca = this.findLca(a, b);
873
+ this.pushToLca(a, lca);
874
+ this.pushToLca(b, lca);
875
+ this.explainTodo(justifications);
876
+ }
877
+
878
+ // Returns the Boolean variable of the false equality that explains the disequality, or -1.
879
+ explainDiseq(justifications: number[], a: Enode, b: Enode) {
880
+ const ra = a.root;
881
+ const rb = b.root;
882
+ if (ra.isInterpreted && rb.isInterpreted) {
883
+ this.explainEq(justifications, a, ra);
884
+ this.explainEq(justifications, b, rb);
885
+ return NULL_BOOL_VAR;
886
+ }
887
+ const eq = this.tmpEq(ra, rb) as Enode;
888
+ this.explainEq(justifications, eq, eq.root);
889
+ return eq.root.boolVar;
890
+ }
891
+
892
+ private explainTodo(justifications: number[]) {
893
+ const manager = this.manager;
894
+ for (let index = 0; index < this.todo.length; index++) {
895
+ const node = this.todo[index];
896
+ if (node.isMarked1) continue;
897
+ if (node.target !== null) {
898
+ node.isMarked1 = true;
899
+ this.explainJustification(justifications, node, node.target, node.justification);
900
+ } else if (node.value !== L_UNDEF) {
901
+ node.isMarked1 = true;
902
+ if (manager.isTrue(node.owner) || manager.isFalse(node.owner)) continue;
903
+ justifications.push(node.litJustification.external);
904
+ }
905
+ }
906
+ }
907
+ }