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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (587) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +41 -37
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +21 -4
  8. package/dist/index.d.ts +21 -4
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2681 -425
  15. package/dist/prove.js +2681 -425
  16. package/dist/run.cjs +41 -42
  17. package/dist/run.js +41 -42
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +97 -89
  21. package/dist/transfer.js +97 -89
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +72 -39
  26. package/src/bags.ts +50 -29
  27. package/src/builtins.ts +8 -16
  28. package/src/check-failure.ts +118 -0
  29. package/src/check-trace.ts +321 -0
  30. package/src/check.ts +828 -770
  31. package/src/cli/options.ts +6 -31
  32. package/src/cli/runtime-invariants.ts +20 -56
  33. package/src/cli/shared.ts +1 -1
  34. package/src/cli/tlapm.ts +433 -70
  35. package/src/cli/tlc-arguments.ts +224 -212
  36. package/src/cli/tlc-output.ts +701 -0
  37. package/src/cli/tlc-usage.ts +1 -2
  38. package/src/cli/tlc.ts +65 -712
  39. package/src/cli/xml-exporter.ts +23 -33
  40. package/src/codegen.ts +28 -20
  41. package/src/coverage.ts +255 -20
  42. package/src/dependencies.ts +96 -27
  43. package/src/dfid.ts +115 -50
  44. package/src/environment-config.ts +315 -0
  45. package/src/environment.ts +175 -373
  46. package/src/errors.ts +40 -5
  47. package/src/evaluate.ts +429 -139
  48. package/src/exit-codes.ts +28 -12
  49. package/src/fingerprints.ts +65 -1
  50. package/src/instances.ts +178 -17
  51. package/src/java-hash.ts +14 -0
  52. package/src/java-overrides.ts +2 -2
  53. package/src/json.ts +4 -7
  54. package/src/levels.ts +708 -272
  55. package/src/lexer.ts +17 -5
  56. package/src/liveness-checker.ts +707 -249
  57. package/src/liveness.ts +148 -95
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +39 -9
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +27 -18
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +48 -18
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +120 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +29 -47
  82. package/src/parser.ts +757 -326
  83. package/src/pretty-print.ts +1 -1
  84. package/src/prover/decide-pool.ts +3 -3
  85. package/src/prover/deciders.ts +12 -9
  86. package/src/prover/isabelle/decide.ts +3 -25
  87. package/src/prover/isabelle/encode.ts +72 -42
  88. package/src/prover/isabelle/isar/attrib.ts +250 -0
  89. package/src/prover/isabelle/isar/context.ts +335 -0
  90. package/src/prover/isabelle/isar/induct.ts +382 -0
  91. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  92. package/src/prover/isabelle/isar/method.ts +509 -212
  93. package/src/prover/isabelle/isar/proof.ts +570 -14
  94. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  95. package/src/prover/isabelle/isar/theory.ts +487 -76
  96. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  97. package/src/prover/isabelle/isar/type-check.ts +89 -14
  98. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  99. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  100. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  101. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  102. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  103. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  104. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  105. package/src/prover/isabelle/provers/classical.ts +45 -20
  106. package/src/prover/isabelle/provers/hypsubst.ts +19 -30
  107. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  108. package/src/prover/isabelle/pure/consts.ts +0 -2
  109. package/src/prover/isabelle/pure/conv.ts +2 -10
  110. package/src/prover/isabelle/pure/drule.ts +72 -6
  111. package/src/prover/isabelle/pure/envir.ts +0 -2
  112. package/src/prover/isabelle/pure/goal.ts +1 -3
  113. package/src/prover/isabelle/pure/logic.ts +1 -3
  114. package/src/prover/isabelle/pure/name.ts +0 -2
  115. package/src/prover/isabelle/pure/net.ts +0 -2
  116. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  117. package/src/prover/isabelle/pure/pattern.ts +0 -2
  118. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  119. package/src/prover/isabelle/pure/rewriter.ts +9 -20
  120. package/src/prover/isabelle/pure/search.ts +0 -2
  121. package/src/prover/isabelle/pure/seq.ts +0 -2
  122. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  123. package/src/prover/isabelle/pure/table.ts +2 -3
  124. package/src/prover/isabelle/pure/tactic.ts +0 -2
  125. package/src/prover/isabelle/pure/tactical.ts +42 -37
  126. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  127. package/src/prover/isabelle/pure/term.ts +3 -5
  128. package/src/prover/isabelle/pure/thm.ts +14 -13
  129. package/src/prover/isabelle/pure/type.ts +0 -2
  130. package/src/prover/isabelle/pure/unify.ts +0 -2
  131. package/src/prover/isabelle/pure/variable.ts +0 -2
  132. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  133. package/src/prover/isabelle/tla/context.ts +58 -11
  134. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  135. package/src/prover/isabelle/tla/logic.ts +49 -21
  136. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  137. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  138. package/src/prover/ocaml.ts +4 -1
  139. package/src/prover/prep/action.ts +30 -31
  140. package/src/prover/prep/enabled-axioms.ts +11 -2
  141. package/src/prover/prep/fingerprint.ts +2 -5
  142. package/src/prover/prep/md5.ts +26 -29
  143. package/src/prover/prep/methods.ts +181 -51
  144. package/src/prover/prep/normalize.ts +38 -9
  145. package/src/prover/prove.ts +395 -94
  146. package/src/prover/ptl/decide.ts +95 -50
  147. package/src/prover/ptl/encode.ts +2 -3
  148. package/src/prover/ptl/tableau.ts +28 -2
  149. package/src/prover/smt/arithmetic.ts +310 -0
  150. package/src/prover/smt/axioms.ts +12 -8
  151. package/src/prover/smt/context.ts +43 -8
  152. package/src/prover/smt/data.ts +498 -379
  153. package/src/prover/smt/encode.ts +148 -57
  154. package/src/prover/smt/extensionality.ts +5 -3
  155. package/src/prover/smt/flatten.ts +4 -6
  156. package/src/prover/smt/format.ts +28 -4
  157. package/src/prover/smt/instances.ts +7 -1
  158. package/src/prover/smt/layout.ts +91 -0
  159. package/src/prover/smt/rewrite.ts +1016 -618
  160. package/src/prover/smt/simplify.ts +441 -0
  161. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +62 -0
  162. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  163. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  164. package/src/prover/smt/solver/act-cache.ts +0 -1
  165. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  166. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  167. package/src/prover/smt/solver/aig.ts +889 -0
  168. package/src/prover/smt/solver/arith-rewriter.ts +624 -9
  169. package/src/prover/smt/solver/arith-terms.ts +121 -0
  170. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  171. package/src/prover/smt/solver/array-rewriter.ts +319 -0
  172. package/src/prover/smt/solver/asserted-formulas.ts +240 -56
  173. package/src/prover/smt/solver/ast-lt.ts +165 -11
  174. package/src/prover/smt/solver/ast-util.ts +160 -2
  175. package/src/prover/smt/solver/ast.ts +1483 -45
  176. package/src/prover/smt/solver/auf-solver.ts +25 -18
  177. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  178. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  179. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  180. package/src/prover/smt/solver/bound-manager.ts +196 -0
  181. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  182. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  183. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  184. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  185. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  186. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  187. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  188. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  189. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  190. package/src/prover/smt/solver/card2bv.ts +127 -0
  191. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  192. package/src/prover/smt/solver/cg-table.ts +39 -25
  193. package/src/prover/smt/solver/check-logic.ts +330 -0
  194. package/src/prover/smt/solver/clause.ts +0 -1
  195. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  196. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  197. package/src/prover/smt/solver/context.ts +598 -128
  198. package/src/prover/smt/solver/ctx-simplify.ts +29 -14
  199. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  200. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  201. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  202. package/src/prover/smt/solver/demodulator.ts +786 -0
  203. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  204. package/src/prover/smt/solver/der.ts +38 -10
  205. package/src/prover/smt/solver/diff-neq.ts +207 -0
  206. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  207. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  208. package/src/prover/smt/solver/dt2bv-tactic.ts +298 -0
  209. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  210. package/src/prover/smt/solver/e-matching.ts +7 -8
  211. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  212. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  213. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  214. package/src/prover/smt/solver/elim-uncnstr.ts +548 -0
  215. package/src/prover/smt/solver/enode.ts +100 -3
  216. package/src/prover/smt/solver/eq2bv-tactic.ts +227 -0
  217. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  218. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  219. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  220. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  221. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  222. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  223. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  224. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  225. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  226. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  227. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  228. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  229. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  230. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  231. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  232. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  233. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  234. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  235. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  236. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  237. package/src/prover/smt/solver/expr-ref.ts +0 -1
  238. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  239. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  240. package/src/prover/smt/solver/factor.ts +163 -0
  241. package/src/prover/smt/solver/fd-solver.ts +734 -0
  242. package/src/prover/smt/solver/fingerprints.ts +15 -15
  243. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  244. package/src/prover/smt/solver/flat-literals.ts +0 -1
  245. package/src/prover/smt/solver/fm-tactic.ts +886 -0
  246. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  247. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  248. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  249. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  250. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  251. package/src/prover/smt/solver/goal.ts +178 -15
  252. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  253. package/src/prover/smt/solver/guard-set.ts +219 -0
  254. package/src/prover/smt/solver/hash.ts +0 -1
  255. package/src/prover/smt/solver/hashtable.ts +34 -16
  256. package/src/prover/smt/solver/inf-eps.ts +63 -0
  257. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  258. package/src/prover/smt/solver/internalizer.ts +111 -39
  259. package/src/prover/smt/solver/lackr.ts +381 -0
  260. package/src/prover/smt/solver/lbool.ts +0 -1
  261. package/src/prover/smt/solver/lia2card.ts +268 -0
  262. package/src/prover/smt/solver/lia2pb.ts +154 -0
  263. package/src/prover/smt/solver/literal.ts +0 -1
  264. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  265. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  266. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  267. package/src/prover/smt/solver/lp/containers.ts +7 -2
  268. package/src/prover/smt/solver/lp/core-solver.ts +30 -11
  269. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  270. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  271. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  272. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  273. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  274. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  275. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  276. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  277. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  278. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  279. package/src/prover/smt/solver/lp/lar-solver.ts +41 -5
  280. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  281. package/src/prover/smt/solver/lp/lp-settings.ts +6 -3
  282. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  283. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  284. package/src/prover/smt/solver/lp/nex.ts +2 -2
  285. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  286. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  287. package/src/prover/smt/solver/lp/nla-core.ts +68 -17
  288. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  289. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  290. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  292. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  293. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  294. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  295. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  296. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  297. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  298. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  299. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  300. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  301. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  302. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  303. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  304. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  305. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  306. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  307. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  308. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  309. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  310. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  311. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  312. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  313. package/src/prover/smt/solver/macro-finder.ts +530 -0
  314. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  315. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  316. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  317. package/src/prover/smt/solver/max-cliques.ts +105 -0
  318. package/src/prover/smt/solver/maxcore.ts +310 -0
  319. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  320. package/src/prover/smt/solver/maxlex.ts +115 -0
  321. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  322. package/src/prover/smt/solver/maxsmt.ts +92 -0
  323. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  324. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  325. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  326. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  327. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  328. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  329. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  330. package/src/prover/smt/solver/model-checker.ts +19 -28
  331. package/src/prover/smt/solver/model-evaluator.ts +190 -12
  332. package/src/prover/smt/solver/model-finder.ts +12 -18
  333. package/src/prover/smt/solver/model-generator.ts +104 -35
  334. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  335. package/src/prover/smt/solver/model-printer.ts +214 -0
  336. package/src/prover/smt/solver/mpf.ts +709 -0
  337. package/src/prover/smt/solver/mus.ts +50 -0
  338. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  339. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  340. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  341. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  342. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  343. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  344. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  345. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  346. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  347. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  348. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  349. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  350. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  351. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  352. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  353. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  354. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  355. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  356. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  357. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  358. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  359. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  360. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  361. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  362. package/src/prover/smt/solver/nlqsat.ts +485 -0
  363. package/src/prover/smt/solver/nlsat/algebraic.ts +315 -98
  364. package/src/prover/smt/solver/nlsat/atoms.ts +71 -38
  365. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  366. package/src/prover/smt/solver/nlsat/explain.ts +427 -229
  367. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  368. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -246
  369. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  370. package/src/prover/smt/solver/nlsat/polynomial.ts +2376 -684
  371. package/src/prover/smt/solver/nlsat/solver.ts +293 -92
  372. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  373. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  374. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  375. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -8
  376. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  377. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  378. package/src/prover/smt/solver/nnf.ts +110 -24
  379. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  380. package/src/prover/smt/solver/occf.ts +97 -0
  381. package/src/prover/smt/solver/opt-context.ts +801 -0
  382. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  383. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  384. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  385. package/src/prover/smt/solver/opt-solver.ts +312 -0
  386. package/src/prover/smt/solver/opt-value.ts +55 -0
  387. package/src/prover/smt/solver/optsmt.ts +692 -0
  388. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  389. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  390. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  391. package/src/prover/smt/solver/pb2bv-tactic.ts +546 -0
  392. package/src/prover/smt/solver/poly-rewriter.ts +259 -57
  393. package/src/prover/smt/solver/probes.ts +577 -0
  394. package/src/prover/smt/solver/propagate-values.ts +37 -21
  395. package/src/prover/smt/solver/proto-model.ts +648 -19
  396. package/src/prover/smt/solver/pull-quant.ts +28 -12
  397. package/src/prover/smt/solver/purify-arith.ts +634 -0
  398. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +39 -19
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1499 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +829 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +22 -25
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +82 -14
  422. package/src/prover/smt/solver/rewriter.ts +505 -60
  423. package/src/prover/smt/solver/rlimit.ts +45 -5
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +589 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +480 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +72 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +190 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +589 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3535 -360
  468. package/src/prover/smt/solver/smtlib-script.ts +2136 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  470. package/src/prover/smt/solver/solver.ts +128 -23
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +2176 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +57 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +35 -28
  487. package/src/prover/smt/solver/theory-lra-state.ts +7 -23
  488. package/src/prover/smt/solver/theory-lra.ts +189 -2
  489. package/src/prover/smt/solver/theory-pb.ts +951 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  497. package/src/prover/smt/solver/theory.ts +189 -0
  498. package/src/prover/smt/solver/tseitin-cnf.ts +495 -0
  499. package/src/prover/smt/solver/var-subst.ts +36 -14
  500. package/src/prover/smt/table.ts +3 -2
  501. package/src/prover/smt/types.ts +146 -0
  502. package/src/prover/tlapm/cache.ts +57 -26
  503. package/src/prover/tlapm/tlapm.ts +15 -9
  504. package/src/prover/tlapm-library.ts +3208 -0
  505. package/src/prover/verdict.ts +9 -0
  506. package/src/prover/zenon/check/check.ts +1 -2
  507. package/src/prover/zenon/check/records.ts +1 -1
  508. package/src/prover/zenon/check/relations.ts +2 -1
  509. package/src/prover/zenon/check/rewrites.ts +2 -15
  510. package/src/prover/zenon/check/sets.ts +40 -58
  511. package/src/prover/zenon/check/terms.ts +1 -2
  512. package/src/prover/zenon/decide.ts +10 -7
  513. package/src/prover/zenon/encode.ts +0 -2
  514. package/src/prover/zenon/eqrel.ts +2 -2
  515. package/src/prover/zenon/equality-rules.ts +24 -2
  516. package/src/prover/zenon/expr.ts +28 -2
  517. package/src/prover/zenon/index-table.ts +16 -23
  518. package/src/prover/zenon/isar-case.ts +1 -3
  519. package/src/prover/zenon/isar.ts +37 -39
  520. package/src/prover/zenon/llproof.ts +2 -13
  521. package/src/prover/zenon/mltoll.ts +12 -30
  522. package/src/prover/zenon/node.ts +20 -5
  523. package/src/prover/zenon/parse.ts +9 -8
  524. package/src/prover/zenon/phrase.ts +1 -3
  525. package/src/prover/zenon/proof.ts +0 -2
  526. package/src/prover/zenon/propositional-rules.ts +0 -2
  527. package/src/prover/zenon/rules.ts +2 -3
  528. package/src/prover/zenon/search.ts +11 -19
  529. package/src/prover/zenon/tla/functions.ts +2 -4
  530. package/src/prover/zenon/tla/llproof.ts +9 -13
  531. package/src/prover/zenon/tla/records.ts +1 -8
  532. package/src/prover/zenon/tla/rewrites.ts +0 -2
  533. package/src/prover/zenon/tla/sets.ts +22 -22
  534. package/src/prover/zenon/tla/terms.ts +0 -2
  535. package/src/prover/zenon/tla/tla.ts +7 -8
  536. package/src/resolve.ts +1327 -328
  537. package/src/runtime.ts +25 -2
  538. package/src/sany/builtins.ts +10 -10
  539. package/src/sany/generation.ts +384 -0
  540. package/src/sany/generator-def-entries.ts +297 -0
  541. package/src/sany/generator-definitions.ts +688 -0
  542. package/src/sany/generator-expressions.ts +1123 -0
  543. package/src/sany/generator-proofs.ts +668 -0
  544. package/src/sany/generator.ts +161 -2625
  545. package/src/sany/levels.ts +0 -2
  546. package/src/sany/lexer.ts +32 -23
  547. package/src/sany/linter.ts +0 -2
  548. package/src/sany/modules.ts +4 -2
  549. package/src/sany/nodes.ts +3 -4
  550. package/src/sany/report.ts +3 -6
  551. package/src/sany/selectors.ts +46 -44
  552. package/src/sany/xml.ts +25 -58
  553. package/src/search.ts +513 -165
  554. package/src/simulate.ts +340 -251
  555. package/src/spec-description.ts +48 -55
  556. package/src/standard-definitions.ts +5 -0
  557. package/src/standard-modules.ts +72 -54
  558. package/src/state-graph.ts +0 -2
  559. package/src/subexpressions.ts +564 -138
  560. package/src/substitution-levels.ts +5 -4
  561. package/src/successors.ts +56 -28
  562. package/src/symmetry.ts +4 -3
  563. package/src/tableau.ts +2 -2
  564. package/src/tlc/fingerprint.ts +81 -9
  565. package/src/tlc/jar-data.ts +10 -0
  566. package/src/tlc/messages.ts +23 -18
  567. package/src/tlc/order.ts +14 -3
  568. package/src/tlc/random.ts +6 -5
  569. package/src/tlc/replay.ts +152 -58
  570. package/src/tlc/summary.ts +29 -14
  571. package/src/tlc/tlc-operators.ts +12 -11
  572. package/src/tlc/tlcext-operators.ts +87 -26
  573. package/src/tlc/trace-spec.ts +27 -60
  574. package/src/trace-liveness.ts +529 -0
  575. package/src/typed-tier.ts +6556 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/typescript/types.ts +2 -2
  583. package/src/values.ts +208 -227
  584. package/src/prover/isabelle/isar/statement.ts +0 -52
  585. package/src/prover/smt/solver/z3-license.txt +0 -10
  586. package/src/prover/tlaps-module.ts +0 -510
  587. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,889 @@
1
+ // A node is 2 * id for a variable and 2 * (id - FIRST_NODE_ID) + 1 for an and, and a literal is 2 *
2
+ // node, plus 1 when inverted.
3
+ import { SmtTacticError } from "../../../errors";
4
+ import {
5
+ type AstManager,
6
+ KIND_APP,
7
+ OP_AND,
8
+ OP_EQ,
9
+ OP_FALSE,
10
+ OP_IMPLIES,
11
+ OP_ITE,
12
+ OP_NOT,
13
+ OP_OR,
14
+ OP_TRUE,
15
+ OP_XOR,
16
+ SORT_BOOL,
17
+ } from "./ast";
18
+ import { combineHash } from "./hash";
19
+ import { ObjMap } from "./hashtable";
20
+ import { RefVector } from "./ref-vector";
21
+
22
+ const FIRST_NODE_ID = 2147483647;
23
+ const NULL_LIT = -1;
24
+ const TRUE_LIT = 0;
25
+ const FALSE_LIT = 1;
26
+ const INITIAL_NODES = 64;
27
+ const INITIAL_TABLE = 64;
28
+
29
+ const AIG_AND = 0;
30
+ const AIG_AUX_AND = 1;
31
+ const AIG_ITE = 2;
32
+
33
+ const CONNECTIVE_OPS = new Set([OP_NOT, OP_OR, OP_AND, OP_XOR, OP_IMPLIES, OP_ITE]);
34
+
35
+ const isInverted = (lit: number) => (lit & 1) === 1;
36
+ const isVar = (node: number) => (node & 1) === 0;
37
+ const getId = (node: number) => (isVar(node) ? node >> 1 : FIRST_NODE_ID + (node >> 1));
38
+ const isNotEq = (first: number, second: number) => (first ^ second) === 1;
39
+
40
+ const compareLits = (first: number, second: number) => {
41
+ const firstId = getId(first >> 1);
42
+ const secondId = getId(second >> 1);
43
+ return firstId === secondId ? (second & 1) - (first & 1) : firstId - secondId;
44
+ };
45
+
46
+ const sortRange = (lits: number[], start: number) => {
47
+ const sorted = lits.slice(start).sort(compareLits);
48
+ for (const [offset, lit] of sorted.entries()) lits[start + offset] = lit;
49
+ };
50
+
51
+ const getGrown = (array: Int32Array, size: number, fill: number) => {
52
+ const grown = new Int32Array(size).fill(fill);
53
+ grown.set(array);
54
+ return grown;
55
+ };
56
+
57
+ export class AigManager {
58
+ refCounts = new Int32Array(INITIAL_NODES);
59
+ lefts = new Int32Array(INITIAL_NODES);
60
+ rights = new Int32Array(INITIAL_NODES);
61
+ readonly varExprs: RefVector;
62
+ iteCond = NULL_LIT;
63
+ iteThen = NULL_LIT;
64
+ iteElse = NULL_LIT;
65
+ private nextVarId = 0;
66
+ private readonly freeVarIds: number[] = [];
67
+ private nextNodeIndex = 0;
68
+ private readonly freeNodeIndexes: number[] = [];
69
+ private table = new Int32Array(INITIAL_TABLE).fill(-1);
70
+ private tableSize = 0;
71
+ private readonly toDelete: number[] = [];
72
+
73
+ constructor(readonly manager: AstManager) {
74
+ this.varExprs = new RefVector(manager);
75
+ this.mkVar(manager.trueExpr);
76
+ this.incRef(TRUE_LIT);
77
+ this.incRef(FALSE_LIT);
78
+ }
79
+
80
+ release() {
81
+ this.decRef(TRUE_LIT);
82
+ this.decRef(FALSE_LIT);
83
+ this.varExprs.reset();
84
+ }
85
+
86
+ incRef(lit: number) {
87
+ this.refCounts[lit >> 1]++;
88
+ }
89
+
90
+ decRef(lit: number) {
91
+ this.decRefCore(lit >> 1);
92
+ for (let node = this.toDelete.pop(); node !== undefined; node = this.toDelete.pop())
93
+ this.deleteNode(node);
94
+ }
95
+
96
+ decRefResult(lit: number) {
97
+ this.refCounts[lit >> 1]--;
98
+ }
99
+
100
+ private decRefCore(node: number) {
101
+ this.refCounts[node]--;
102
+ if (this.refCounts[node] === 0) this.toDelete.push(node);
103
+ }
104
+
105
+ private deleteNode(node: number) {
106
+ if (isVar(node)) {
107
+ this.freeVarIds.push(node >> 1);
108
+ this.varExprs.set(node >> 1, -1);
109
+ return;
110
+ }
111
+ this.eraseNode(node);
112
+ this.freeNodeIndexes.push(node >> 1);
113
+ this.decRefCore(this.lefts[node] >> 1);
114
+ this.decRefCore(this.rights[node] >> 1);
115
+ }
116
+
117
+ private reserve(node: number) {
118
+ if (node < this.refCounts.length) return;
119
+ const size = Math.max(node + 1, 2 * this.refCounts.length);
120
+ this.refCounts = getGrown(this.refCounts, size, 0);
121
+ this.lefts = getGrown(this.lefts, size, 0);
122
+ this.rights = getGrown(this.rights, size, 0);
123
+ }
124
+
125
+ private getHash(left: number, right: number) {
126
+ return combineHash(left, right) & (this.table.length - 1);
127
+ }
128
+
129
+ private findNode(left: number, right: number) {
130
+ const mask = this.table.length - 1;
131
+ for (let slot = this.getHash(left, right); ; slot = (slot + 1) & mask) {
132
+ const node = this.table[slot];
133
+ if (node === -1 || (this.lefts[node] === left && this.rights[node] === right)) return node;
134
+ }
135
+ }
136
+
137
+ private insertNode(node: number) {
138
+ if (2 * (this.tableSize + 1) > this.table.length) {
139
+ const old = this.table;
140
+ this.table = new Int32Array(2 * old.length).fill(-1);
141
+ for (const entry of old) if (entry !== -1) this.placeNode(entry);
142
+ }
143
+ this.placeNode(node);
144
+ this.tableSize++;
145
+ }
146
+
147
+ private placeNode(node: number) {
148
+ const mask = this.table.length - 1;
149
+ let slot = this.getHash(this.lefts[node], this.rights[node]);
150
+ while (this.table[slot] !== -1) slot = (slot + 1) & mask;
151
+ this.table[slot] = node;
152
+ }
153
+
154
+ private eraseNode(node: number) {
155
+ const mask = this.table.length - 1;
156
+ let hole = this.getHash(this.lefts[node], this.rights[node]);
157
+ while (this.table[hole] !== node) hole = (hole + 1) & mask;
158
+ for (let next = (hole + 1) & mask; this.table[next] !== -1; next = (next + 1) & mask) {
159
+ const home = this.getHash(this.lefts[this.table[next]], this.rights[this.table[next]]);
160
+ if (((next - home) & mask) < ((next - hole) & mask)) continue;
161
+ this.table[hole] = this.table[next];
162
+ hole = next;
163
+ }
164
+ this.table[hole] = -1;
165
+ this.tableSize--;
166
+ }
167
+
168
+ mkVar(expr: number) {
169
+ const id = this.freeVarIds.pop() ?? this.nextVarId++;
170
+ const node = 2 * id;
171
+ this.reserve(node);
172
+ this.refCounts[node] = 0;
173
+ if (id === this.varExprs.size) this.varExprs.push(expr);
174
+ else this.varExprs.set(id, expr);
175
+ return 2 * node;
176
+ }
177
+
178
+ private mkNodeCore(left: number, right: number) {
179
+ const found = this.findNode(left, right);
180
+ if (found !== -1) return 2 * found;
181
+ const node = 2 * (this.freeNodeIndexes.pop() ?? this.nextNodeIndex++) + 1;
182
+ this.reserve(node);
183
+ this.lefts[node] = left;
184
+ this.rights[node] = right;
185
+ this.refCounts[node] = 0;
186
+ this.insertNode(node);
187
+ this.incRef(left);
188
+ this.incRef(right);
189
+ return 2 * node;
190
+ }
191
+
192
+ mkAnd(first: number, second: number) {
193
+ let left = first;
194
+ let right = second;
195
+ for (;;) {
196
+ const isLeftInverted = isInverted(left);
197
+ const leftNode = left >> 1;
198
+ const isRightInverted = isInverted(right);
199
+ const rightNode = right >> 1;
200
+ if (leftNode === 0) return isLeftInverted ? FALSE_LIT : right;
201
+ if (rightNode === 0) return isRightInverted ? FALSE_LIT : left;
202
+ if (leftNode === rightNode) return isLeftInverted === isRightInverted ? left : FALSE_LIT;
203
+ if (!isVar(leftNode)) {
204
+ const a = this.lefts[leftNode];
205
+ const b = this.rights[leftNode];
206
+ if (isNotEq(a, right) || isNotEq(b, right)) return isLeftInverted ? right : FALSE_LIT;
207
+ if (a === right) {
208
+ if (!isLeftInverted) return left;
209
+ left = b ^ 1;
210
+ continue;
211
+ }
212
+ if (b === right) {
213
+ if (!isLeftInverted) return left;
214
+ left = a ^ 1;
215
+ continue;
216
+ }
217
+ if (!isVar(rightNode)) {
218
+ const c = this.lefts[rightNode];
219
+ const d = this.rights[rightNode];
220
+ const isComplementary = isNotEq(a, c) || isNotEq(a, d) || isNotEq(b, c) || isNotEq(b, d);
221
+ if (!isLeftInverted && !isRightInverted) {
222
+ if (isComplementary) return FALSE_LIT;
223
+ if (a === c || b === c) {
224
+ right = d;
225
+ continue;
226
+ }
227
+ if (b === c || b === d) {
228
+ left = a;
229
+ continue;
230
+ }
231
+ if (a === d || b === d) {
232
+ right = c;
233
+ continue;
234
+ }
235
+ if (a === c || a === d) {
236
+ left = b;
237
+ continue;
238
+ }
239
+ }
240
+ if (isLeftInverted && !isRightInverted) {
241
+ if (isComplementary) return right;
242
+ if (b === c || b === d) {
243
+ left = a ^ 1;
244
+ continue;
245
+ }
246
+ if (a === c || a === d) {
247
+ left = b ^ 1;
248
+ continue;
249
+ }
250
+ }
251
+ if (!isLeftInverted && isRightInverted) {
252
+ if (isComplementary) return left;
253
+ if (c === a || c === b) {
254
+ right = d ^ 1;
255
+ continue;
256
+ }
257
+ if (d === a || d === b) {
258
+ right = c ^ 1;
259
+ continue;
260
+ }
261
+ }
262
+ if (isLeftInverted && isRightInverted) {
263
+ if (a === c && isNotEq(b, d)) return a ^ 1;
264
+ if (isNotEq(a, c) && b === d) return b ^ 1;
265
+ }
266
+ }
267
+ }
268
+ if (!isVar(rightNode)) {
269
+ const a = this.lefts[rightNode];
270
+ const b = this.rights[rightNode];
271
+ if (isNotEq(left, a) || isNotEq(left, b)) return isRightInverted ? left : FALSE_LIT;
272
+ if (a === left) {
273
+ if (!isRightInverted) return right;
274
+ right = b ^ 1;
275
+ continue;
276
+ }
277
+ if (b === left) {
278
+ if (!isRightInverted) return right;
279
+ right = a ^ 1;
280
+ continue;
281
+ }
282
+ }
283
+ return getId(leftNode) > getId(rightNode)
284
+ ? this.mkNodeCore(right, left)
285
+ : this.mkNodeCore(left, right);
286
+ }
287
+ }
288
+
289
+ mkOr(first: number, second: number) {
290
+ return this.mkAnd(first ^ 1, second ^ 1) ^ 1;
291
+ }
292
+
293
+ // Sorts the literals from start on in place, since the caller releases them in that order.
294
+ mkJunction(lits: number[], start: number, isOr: boolean) {
295
+ const count = lits.length - start;
296
+ if (count === 0) return isOr ? FALSE_LIT : TRUE_LIT;
297
+ if (count === 1) return lits[start];
298
+ const mk = (first: number, second: number) =>
299
+ isOr ? this.mkOr(first, second) : this.mkAnd(first, second);
300
+ if (count === 2) return mk(lits[start], lits[start + 1]);
301
+ sortRange(lits, start);
302
+ let result = mk(lits[start], lits[start + 1]);
303
+ this.incRef(result);
304
+ for (let index = start + 2; index < lits.length; index++) {
305
+ const next = mk(result, lits[index]);
306
+ this.incRef(next);
307
+ this.decRef(result);
308
+ result = next;
309
+ }
310
+ this.decRefResult(result);
311
+ return result;
312
+ }
313
+
314
+ mkIte(cond: number, then: number, otherwise: number) {
315
+ const first = this.mkAnd(cond, then ^ 1);
316
+ const second = this.mkAnd(cond ^ 1, otherwise ^ 1);
317
+ return this.mkGate(first, second);
318
+ }
319
+
320
+ mkIff(left: number, right: number) {
321
+ const first = this.mkAnd(left, right ^ 1);
322
+ const second = this.mkAnd(left ^ 1, right);
323
+ return this.mkGate(first, second);
324
+ }
325
+
326
+ private mkGate(first: number, second: number) {
327
+ this.incRef(first);
328
+ this.incRef(second);
329
+ const result = this.mkAnd(first ^ 1, second ^ 1);
330
+ this.incRef(result);
331
+ this.decRef(first);
332
+ this.decRef(second);
333
+ this.decRefResult(result);
334
+ return result;
335
+ }
336
+
337
+ mkXor(left: number, right: number) {
338
+ return this.mkIff(left ^ 1, right);
339
+ }
340
+
341
+ mkImplies(left: number, right: number) {
342
+ return this.mkOr(left ^ 1, right);
343
+ }
344
+
345
+ private setIte(cond: number, then: number, otherwise: number) {
346
+ this.iteCond = cond;
347
+ this.iteThen = then;
348
+ this.iteElse = otherwise;
349
+ return true;
350
+ }
351
+
352
+ isIte(node: number) {
353
+ if (isVar(node)) return false;
354
+ const left = this.lefts[node];
355
+ const right = this.rights[node];
356
+ if (!isInverted(left) || !isInverted(right)) return false;
357
+ const leftNode = left >> 1;
358
+ const rightNode = right >> 1;
359
+ if (isVar(leftNode) || isVar(rightNode)) return false;
360
+ const left1 = this.lefts[leftNode] ^ 1;
361
+ const left2 = this.rights[leftNode] ^ 1;
362
+ const right1 = this.lefts[rightNode] ^ 1;
363
+ const right2 = this.rights[rightNode] ^ 1;
364
+ if (isNotEq(left1, right1))
365
+ return isInverted(left1)
366
+ ? this.setIte(right1, left2, right2)
367
+ : this.setIte(left1, right2, left2);
368
+ if (isNotEq(left1, right2))
369
+ return isInverted(left1)
370
+ ? this.setIte(right2, left2, right1)
371
+ : this.setIte(left1, right1, left2);
372
+ if (isNotEq(left2, right1))
373
+ return isInverted(left2)
374
+ ? this.setIte(right1, left1, right2)
375
+ : this.setIte(left2, right2, left1);
376
+ if (isNotEq(left2, right2))
377
+ return isInverted(left2)
378
+ ? this.setIte(right2, left1, right1)
379
+ : this.setIte(left2, right1, left1);
380
+ return false;
381
+ }
382
+
383
+ mkAig(expr: number) {
384
+ const converter = new Expr2Aig(this);
385
+ const result = converter.convert(expr);
386
+ this.incRef(result);
387
+ converter.release();
388
+ this.decRefResult(result);
389
+ return result;
390
+ }
391
+
392
+ maxSharing(lit: number) {
393
+ return new MaxSharing(this).apply(lit);
394
+ }
395
+
396
+ // The result comes with a reference.
397
+ toFormula(lit: number) {
398
+ const converter = new Aig2Expr(this);
399
+ const result = converter.convert(lit);
400
+ converter.release();
401
+ return result;
402
+ }
403
+ }
404
+
405
+ class Expr2Aig {
406
+ private readonly frameExprs: number[] = [];
407
+ private readonly frameIndexes: number[] = [];
408
+ private readonly frameStarts: number[] = [];
409
+ private readonly results: number[] = [];
410
+ private readonly cache: ObjMap<number>;
411
+
412
+ constructor(private readonly aigs: AigManager) {
413
+ this.cache = new ObjMap((expr) => aigs.manager.hashes[expr]);
414
+ }
415
+
416
+ release() {
417
+ for (const [, lit] of this.cache) this.aigs.decRef(lit);
418
+ this.restoreResults(0);
419
+ }
420
+
421
+ private saveResult(lit: number) {
422
+ this.aigs.incRef(lit);
423
+ this.results.push(lit);
424
+ }
425
+
426
+ private cacheResult(expr: number, lit: number) {
427
+ this.aigs.incRef(lit);
428
+ this.cache.set(expr, lit);
429
+ }
430
+
431
+ private isCached(expr: number) {
432
+ const lit = this.cache.get(expr);
433
+ if (lit === undefined) return false;
434
+ this.saveResult(lit);
435
+ return true;
436
+ }
437
+
438
+ private visit(expr: number) {
439
+ const manager = this.aigs.manager;
440
+ if (manager.kinds[expr] === KIND_APP) {
441
+ const op = manager.getOp(expr);
442
+ if (op === OP_TRUE || op === OP_FALSE) {
443
+ this.saveResult(op === OP_TRUE ? TRUE_LIT : FALSE_LIT);
444
+ return true;
445
+ }
446
+ if (CONNECTIVE_OPS.has(op) || (op === OP_EQ && manager.isBool(manager.getArg(expr, 0)))) {
447
+ if (manager.getRefCount(expr) > 1 && this.isCached(expr)) return true;
448
+ this.frameExprs.push(expr);
449
+ this.frameIndexes.push(0);
450
+ this.frameStarts.push(this.results.length);
451
+ return false;
452
+ }
453
+ }
454
+ if (this.isCached(expr)) return true;
455
+ const lit = this.aigs.mkVar(expr);
456
+ this.cacheResult(expr, lit);
457
+ this.saveResult(lit);
458
+ return true;
459
+ }
460
+
461
+ private restoreResults(size: number) {
462
+ for (let index = size; index < this.results.length; index++)
463
+ this.aigs.decRef(this.results[index]);
464
+ this.results.length = size;
465
+ }
466
+
467
+ private saveNodeResult(start: number, lit: number) {
468
+ this.aigs.incRef(lit);
469
+ this.restoreResults(start);
470
+ this.saveResult(lit);
471
+ this.aigs.decRef(lit);
472
+ }
473
+
474
+ private mkXor(start: number) {
475
+ const results = this.results;
476
+ if (results.length === start) return FALSE_LIT;
477
+ let lit = results[start];
478
+ for (let index = start + 1; index < results.length; index++)
479
+ lit = this.aigs.mkXor(lit, results[index]);
480
+ return lit;
481
+ }
482
+
483
+ private mkAig(expr: number, start: number) {
484
+ const aigs = this.aigs;
485
+ const results = this.results;
486
+ const op = aigs.manager.getOp(expr);
487
+ if (op === OP_NOT) results[start] ^= 1;
488
+ else if (op === OP_OR || op === OP_AND)
489
+ this.saveNodeResult(start, aigs.mkJunction(results, start, op === OP_OR));
490
+ else if (op === OP_EQ) {
491
+ if (start + 2 !== results.length)
492
+ throw new SmtTacticError("aig conversion assumes expressions have been simplified");
493
+ this.saveNodeResult(start, aigs.mkIff(results[start], results[start + 1]));
494
+ } else if (op === OP_XOR) this.saveNodeResult(start, this.mkXor(start));
495
+ else if (op === OP_IMPLIES)
496
+ this.saveNodeResult(start, aigs.mkImplies(results[start], results[start + 1]));
497
+ else
498
+ this.saveNodeResult(
499
+ start,
500
+ aigs.mkIte(results[start], results[start + 1], results[start + 2]),
501
+ );
502
+ if (aigs.manager.getRefCount(expr) > 1) this.cacheResult(expr, results[results.length - 1]);
503
+ }
504
+
505
+ convert(root: number) {
506
+ const manager = this.aigs.manager;
507
+ if (!this.visit(root))
508
+ while (this.frameExprs.length > 0) {
509
+ manager.limit.checkpoint();
510
+ const top = this.frameExprs.length - 1;
511
+ const expr = this.frameExprs[top];
512
+ if (this.frameIndexes[top] === 0 && manager.getRefCount(expr) > 1 && this.isCached(expr)) {
513
+ this.popFrame();
514
+ continue;
515
+ }
516
+ const numArgs = manager.getNumArgs(expr);
517
+ let isDescending = false;
518
+ while (!isDescending && this.frameIndexes[top] < numArgs) {
519
+ const arg = manager.getArg(expr, this.frameIndexes[top]);
520
+ this.frameIndexes[top]++;
521
+ isDescending = !this.visit(arg);
522
+ }
523
+ if (isDescending) continue;
524
+ this.mkAig(expr, this.frameStarts[top]);
525
+ this.popFrame();
526
+ }
527
+ const result = this.results[this.results.length - 1];
528
+ this.results.pop();
529
+ this.aigs.decRefResult(result);
530
+ return result;
531
+ }
532
+
533
+ private popFrame() {
534
+ this.frameExprs.pop();
535
+ this.frameIndexes.pop();
536
+ this.frameStarts.pop();
537
+ }
538
+ }
539
+
540
+ class MaxSharing {
541
+ private readonly frameNodes: number[] = [];
542
+ private readonly frameIndexes: number[] = [];
543
+ private readonly results: number[] = [];
544
+ private cache = new Int32Array(0);
545
+ private readonly saved: number[] = [];
546
+
547
+ constructor(private readonly aigs: AigManager) {}
548
+
549
+ private pushResult(lit: number) {
550
+ this.results.push(lit);
551
+ if (lit !== NULL_LIT) this.aigs.incRef(lit);
552
+ }
553
+
554
+ private isCached(node: number) {
555
+ if (this.aigs.refCounts[node] <= 1) return false;
556
+ const lit = node >> 1 < this.cache.length ? this.cache[node >> 1] : NULL_LIT;
557
+ if (lit === NULL_LIT) return false;
558
+ this.pushResult(lit);
559
+ return true;
560
+ }
561
+
562
+ private visit(node: number) {
563
+ if (isVar(node)) {
564
+ this.pushResult(NULL_LIT);
565
+ return true;
566
+ }
567
+ if (this.isCached(node)) return true;
568
+ this.frameNodes.push(node);
569
+ this.frameIndexes.push(0);
570
+ return false;
571
+ }
572
+
573
+ private saveResult(original: number, lit: number) {
574
+ const aigs = this.aigs;
575
+ if (aigs.refCounts[original] > 1) {
576
+ const index = original >> 1;
577
+ if (index >= this.cache.length)
578
+ this.cache = getGrown(this.cache, Math.max(index + 1, 2 * this.cache.length), NULL_LIT);
579
+ this.cache[index] = lit;
580
+ this.saved.push(original, lit >> 1);
581
+ aigs.incRef(2 * original);
582
+ aigs.incRef(lit);
583
+ }
584
+ this.pushResult(original === lit >> 1 ? NULL_LIT : lit);
585
+ }
586
+
587
+ private pop2Results() {
588
+ const size = this.results.length;
589
+ const first = this.results[size - 1];
590
+ const second = this.results[size - 2];
591
+ this.results.length = size - 2;
592
+ if (first !== NULL_LIT) this.aigs.decRef(first);
593
+ if (second !== NULL_LIT) this.aigs.decRef(second);
594
+ }
595
+
596
+ private improveSharingLeft(original: number, lit: number) {
597
+ const aigs = this.aigs;
598
+ const leftNode = aigs.lefts[lit >> 1] >> 1;
599
+ const a = aigs.lefts[leftNode];
600
+ const b = aigs.rights[leftNode];
601
+ const c = aigs.rights[lit >> 1];
602
+ return (
603
+ this.tryShared(original, lit, b, c, a, false) || this.tryShared(original, lit, a, c, b, false)
604
+ );
605
+ }
606
+
607
+ private improveSharingRight(original: number, lit: number) {
608
+ const aigs = this.aigs;
609
+ const a = aigs.lefts[lit >> 1];
610
+ const rightNode = aigs.rights[lit >> 1] >> 1;
611
+ const b = aigs.lefts[rightNode];
612
+ const c = aigs.rights[rightNode];
613
+ return (
614
+ this.tryShared(original, lit, a, b, c, true) || this.tryShared(original, lit, a, c, b, true)
615
+ );
616
+ }
617
+
618
+ private tryShared(
619
+ original: number,
620
+ lit: number,
621
+ first: number,
622
+ second: number,
623
+ rest: number,
624
+ isInnerLeft: boolean,
625
+ ) {
626
+ const aigs = this.aigs;
627
+ const inner = aigs.mkAnd(first, second);
628
+ aigs.incRef(inner);
629
+ const isShared = aigs.refCounts[inner >> 1] > 1;
630
+ if (isShared) {
631
+ const result = isInnerLeft ? aigs.mkAnd(inner, rest) : aigs.mkAnd(rest, inner);
632
+ this.saveResult(original, isInverted(lit) ? result ^ 1 : result);
633
+ }
634
+ aigs.decRef(inner);
635
+ return isShared;
636
+ }
637
+
638
+ private improveSharingCore(original: number, lit: number) {
639
+ const aigs = this.aigs;
640
+ const node = lit >> 1;
641
+ if (!isVar(node)) {
642
+ const left = aigs.lefts[node];
643
+ if (
644
+ !isInverted(left) &&
645
+ aigs.refCounts[left >> 1] === 1 &&
646
+ !isVar(left >> 1) &&
647
+ this.improveSharingLeft(original, lit)
648
+ )
649
+ return;
650
+ const right = aigs.rights[node];
651
+ if (
652
+ !isInverted(right) &&
653
+ aigs.refCounts[right >> 1] === 1 &&
654
+ !isVar(right >> 1) &&
655
+ this.improveSharingRight(original, lit)
656
+ )
657
+ return;
658
+ }
659
+ this.saveResult(original, lit);
660
+ }
661
+
662
+ private improveSharing(node: number) {
663
+ const aigs = this.aigs;
664
+ const size = this.results.length;
665
+ const newLeft = this.results[size - 2];
666
+ const newRight = this.results[size - 1];
667
+ if (newLeft === NULL_LIT && newRight === NULL_LIT) {
668
+ this.pop2Results();
669
+ this.improveSharingCore(node, 2 * node);
670
+ return;
671
+ }
672
+ const oldLeft = aigs.lefts[node];
673
+ const oldRight = aigs.rights[node];
674
+ const left = newLeft === NULL_LIT ? oldLeft : newLeft ^ (oldLeft & 1);
675
+ const right = newRight === NULL_LIT ? oldRight : newRight ^ (oldRight & 1);
676
+ const lit = aigs.mkAnd(left, right);
677
+ aigs.incRef(lit);
678
+ this.pop2Results();
679
+ this.improveSharingCore(node, lit);
680
+ aigs.decRef(lit);
681
+ }
682
+
683
+ private process(root: number) {
684
+ if (this.visit(root)) return;
685
+ while (this.frameNodes.length > 0) {
686
+ const top = this.frameNodes.length - 1;
687
+ const node = this.frameNodes[top];
688
+ if (this.frameIndexes[top] === 0) {
689
+ this.frameIndexes[top]++;
690
+ if (!this.visit(this.aigs.lefts[node] >> 1)) continue;
691
+ }
692
+ if (this.frameIndexes[top] === 1) {
693
+ this.frameIndexes[top]++;
694
+ if (!this.visit(this.aigs.rights[node] >> 1)) continue;
695
+ }
696
+ if (!this.isCached(node)) this.improveSharing(node);
697
+ this.frameNodes.pop();
698
+ this.frameIndexes.pop();
699
+ }
700
+ }
701
+
702
+ apply(lit: number) {
703
+ const aigs = this.aigs;
704
+ this.process(lit >> 1);
705
+ const top = this.results[this.results.length - 1];
706
+ this.cache = new Int32Array(0);
707
+ for (const node of this.saved) aigs.decRef(2 * node);
708
+ this.saved.length = 0;
709
+ const result = top === NULL_LIT ? lit : top ^ (lit & 1);
710
+ if (top === NULL_LIT) aigs.incRef(result);
711
+ this.results.pop();
712
+ aigs.decRefResult(result);
713
+ return result;
714
+ }
715
+ }
716
+
717
+ class Aig2Expr {
718
+ private readonly cache: RefVector;
719
+ private readonly frameNodes: number[] = [];
720
+ private readonly frameKinds: number[] = [];
721
+ private readonly frameIsFirst: boolean[] = [];
722
+ private readonly andChildren: number[] = [];
723
+ private readonly andTodo: number[] = [];
724
+
725
+ constructor(private readonly aigs: AigManager) {
726
+ this.cache = new RefVector(aigs.manager);
727
+ }
728
+
729
+ release() {
730
+ this.cache.reset();
731
+ }
732
+
733
+ private getCachedNode(node: number) {
734
+ return this.cache.items[node >> 1];
735
+ }
736
+
737
+ private getNodeExpr(node: number) {
738
+ return isVar(node) ? this.aigs.varExprs.items[node >> 1] : this.getCachedNode(node);
739
+ }
740
+
741
+ private invert(expr: number) {
742
+ const manager = this.aigs.manager;
743
+ if (manager.isNot(expr)) return manager.getArg(expr, 0);
744
+ if (manager.isTrue(expr)) return manager.falseExpr;
745
+ return manager.mkApp(OP_NOT, [expr], SORT_BOOL);
746
+ }
747
+
748
+ private getLitExpr(lit: number) {
749
+ const expr = this.getNodeExpr(lit >> 1);
750
+ return isInverted(lit) ? this.invert(expr) : expr;
751
+ }
752
+
753
+ private isCached(node: number) {
754
+ if (isVar(node)) return true;
755
+ if (node >> 1 >= this.cache.size) {
756
+ this.cache.resize((node >> 1) + 1);
757
+ return false;
758
+ }
759
+ return this.getCachedNode(node) !== -1;
760
+ }
761
+
762
+ private pushFrame(node: number, kind: number) {
763
+ this.frameNodes.push(node);
764
+ this.frameKinds.push(kind);
765
+ this.frameIsFirst.push(true);
766
+ return 1;
767
+ }
768
+
769
+ private visitAndChild(lit: number) {
770
+ const node = lit >> 1;
771
+ if (this.isCached(node)) return 0;
772
+ if (this.aigs.isIte(node)) return this.pushFrame(node, AIG_ITE);
773
+ if (!isInverted(lit) && this.aigs.refCounts[node] === 1)
774
+ return this.pushFrame(node, AIG_AUX_AND);
775
+ return this.pushFrame(node, AIG_AND);
776
+ }
777
+
778
+ private visitIteChild(lit: number) {
779
+ const node = lit >> 1;
780
+ if (this.isCached(node)) return 0;
781
+ return this.pushFrame(node, this.aigs.isIte(node) ? AIG_ITE : AIG_AND);
782
+ }
783
+
784
+ private addChild(lit: number) {
785
+ const node = lit >> 1;
786
+ if (isInverted(lit)) this.andChildren.push(this.getNodeExpr(node));
787
+ else if (this.isCached(node)) this.andChildren.push(this.invert(this.getNodeExpr(node)));
788
+ else this.andTodo.push(node);
789
+ }
790
+
791
+ private mkAnd(node: number) {
792
+ const aigs = this.aigs;
793
+ this.andChildren.length = 0;
794
+ this.andTodo.length = 0;
795
+ this.addChild(aigs.lefts[node]);
796
+ this.addChild(aigs.rights[node]);
797
+ for (let todo = this.andTodo.pop(); todo !== undefined; todo = this.andTodo.pop()) {
798
+ this.addChild(aigs.lefts[todo]);
799
+ this.addChild(aigs.rights[todo]);
800
+ }
801
+ const manager = aigs.manager;
802
+ const disjunction = manager.mkApp(OP_OR, this.andChildren, SORT_BOOL);
803
+ this.cache.set(node >> 1, manager.mkApp(OP_NOT, [disjunction], SORT_BOOL));
804
+ }
805
+
806
+ private mkIte(node: number) {
807
+ const aigs = this.aigs;
808
+ const manager = aigs.manager;
809
+ aigs.isIte(node);
810
+ const isSwapped = isInverted(aigs.iteCond);
811
+ const cond = aigs.iteCond & ~1;
812
+ const then = isSwapped ? aigs.iteElse : aigs.iteThen;
813
+ const otherwise = isSwapped ? aigs.iteThen : aigs.iteElse;
814
+ const condExpr = this.getLitExpr(cond);
815
+ const thenExpr = this.getLitExpr(then);
816
+ this.cache.set(
817
+ node >> 1,
818
+ isNotEq(then, otherwise)
819
+ ? manager.mkEq(condExpr, thenExpr)
820
+ : manager.mkApp(OP_ITE, [condExpr, thenExpr, this.getLitExpr(otherwise)], SORT_BOOL),
821
+ );
822
+ }
823
+
824
+ private processRoot(root: number) {
825
+ const aigs = this.aigs;
826
+ if (this.isCached(root)) return this.getNodeExpr(root);
827
+ this.pushFrame(root, aigs.isIte(root) ? AIG_ITE : AIG_AND);
828
+ while (this.frameNodes.length > 0) {
829
+ aigs.manager.limit.checkpoint();
830
+ const top = this.frameNodes.length - 1;
831
+ const node = this.frameNodes[top];
832
+ if (this.isCached(node)) {
833
+ this.popFrame();
834
+ continue;
835
+ }
836
+ const kind = this.frameKinds[top];
837
+ if (this.frameIsFirst[top]) {
838
+ this.frameIsFirst[top] = false;
839
+ if (kind !== AIG_ITE) {
840
+ const pushed =
841
+ this.visitAndChild(aigs.lefts[node]) + this.visitAndChild(aigs.rights[node]);
842
+ if (pushed > 0) continue;
843
+ } else {
844
+ const leftNode = aigs.lefts[node] >> 1;
845
+ const rightNode = aigs.rights[node] >> 1;
846
+ const a = aigs.lefts[leftNode];
847
+ const b = aigs.rights[leftNode];
848
+ const c = aigs.lefts[rightNode];
849
+ const d = aigs.rights[rightNode];
850
+ const isNew = (lit: number) => lit >> 1 !== a >> 1 && lit >> 1 !== b >> 1;
851
+ const pushed =
852
+ this.visitIteChild(a) +
853
+ this.visitIteChild(b) +
854
+ (isNew(c) ? this.visitIteChild(c) : 0) +
855
+ (isNew(d) ? this.visitIteChild(d) : 0);
856
+ if (pushed > 0) continue;
857
+ }
858
+ }
859
+ if (kind === AIG_AND) this.mkAnd(node);
860
+ else if (kind === AIG_ITE) this.mkIte(node);
861
+ this.popFrame();
862
+ }
863
+ return this.getNodeExpr(root);
864
+ }
865
+
866
+ private popFrame() {
867
+ this.frameNodes.pop();
868
+ this.frameKinds.pop();
869
+ this.frameIsFirst.pop();
870
+ }
871
+
872
+ convert(lit: number) {
873
+ const aigs = this.aigs;
874
+ const manager = aigs.manager;
875
+ const roots = [lit];
876
+ const conjuncts = new RefVector(manager);
877
+ for (let current = roots.pop(); current !== undefined; current = roots.pop()) {
878
+ const node = current >> 1;
879
+ if (isInverted(current)) conjuncts.push(this.invert(this.processRoot(node)));
880
+ else if (aigs.isIte(node)) conjuncts.push(this.processRoot(node));
881
+ else if (isVar(node)) conjuncts.push(aigs.varExprs.items[node >> 1]);
882
+ else roots.push(aigs.lefts[node], aigs.rights[node]);
883
+ }
884
+ const result = manager.mkAnd(conjuncts.items);
885
+ manager.incRef(result);
886
+ conjuncts.reset();
887
+ return result;
888
+ }
889
+ }