tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

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 (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  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 +109 -10
  8. package/dist/index.d.ts +109 -10
  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 +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,871 @@
1
+ import {
2
+ type AstManager,
3
+ OP_ADD,
4
+ OP_GE,
5
+ OP_LE,
6
+ OP_SEQ_CONCAT,
7
+ OP_SEQ_LENGTH,
8
+ OP_SEQ_MAP,
9
+ OP_SEQ_MAPI,
10
+ OP_SEQ_NTH_U,
11
+ OP_SEQ_UNIT,
12
+ OP_SUB,
13
+ SORT_BOOL,
14
+ SORT_INT,
15
+ } from "./ast";
16
+ import type { Context } from "./context";
17
+ import { type Enode, TheoryJustification } from "./enode";
18
+ import { L_TRUE, L_UNDEF } from "./lbool";
19
+ import { FALSE_LITERAL, type Literal, mkLiteral, negate, TRUE_LITERAL } from "./literal";
20
+ import { type Dependency, linearize, mkJoin, mkLeaf } from "./lp/dependency";
21
+ import { Rational } from "./rational";
22
+ import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
23
+ import { SeqAxioms } from "./seq-axioms";
24
+ import { getConcatUnits, isEmptySeq, mkConcatOf, mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
25
+ import { SeqEqSolver } from "./seq-eq-solver";
26
+ import { SeqRewriter } from "./seq-rewriter";
27
+ import type { SeqSkolem } from "./seq-skolem";
28
+ import { Theory } from "./theory";
29
+
30
+ interface Assumption {
31
+ first: Enode | undefined;
32
+ second: Enode | undefined;
33
+ literal: Literal | undefined;
34
+ }
35
+
36
+ export interface DepEq {
37
+ id: number;
38
+ ls: number[];
39
+ rs: number[];
40
+ dep: Dependency;
41
+ }
42
+
43
+ export interface DecomposedEq {
44
+ ls: number[];
45
+ rs: number[];
46
+ }
47
+
48
+ export interface Ne {
49
+ left: number;
50
+ right: number;
51
+ eqs: DecomposedEq[];
52
+ literals: Literal[];
53
+ dep: Dependency;
54
+ }
55
+
56
+ export interface Nc {
57
+ contains: number;
58
+ lengthGreater: Literal;
59
+ dep: Dependency;
60
+ }
61
+
62
+ interface ExprDep {
63
+ expr: number;
64
+ dep: Dependency;
65
+ }
66
+
67
+ export class ScopedVector<T> {
68
+ items: T[] = [];
69
+ private undoIndexes: number[] = [];
70
+ private undoValues: T[] = [];
71
+ private sizes: number[] = [];
72
+ private undoLimits: number[] = [];
73
+
74
+ get size() {
75
+ return this.items.length;
76
+ }
77
+
78
+ push(item: T) {
79
+ this.items.push(item);
80
+ }
81
+
82
+ set(index: number, item: T) {
83
+ this.undoIndexes.push(index);
84
+ this.undoValues.push(this.items[index]);
85
+ this.items[index] = item;
86
+ }
87
+
88
+ eraseAndSwap(index: number) {
89
+ const last = this.items.length - 1;
90
+ if (index !== last) this.set(index, this.items[last]);
91
+ this.undoIndexes.push(last);
92
+ this.undoValues.push(this.items[last]);
93
+ this.items.pop();
94
+ }
95
+
96
+ pushScope() {
97
+ this.sizes.push(this.items.length);
98
+ this.undoLimits.push(this.undoIndexes.length);
99
+ }
100
+
101
+ popScope(numScopes: number) {
102
+ if (numScopes === 0) return;
103
+ const level = this.sizes.length - numScopes;
104
+ const limit = this.undoLimits[level];
105
+ for (let index = this.undoIndexes.length - 1; index >= limit; index--)
106
+ this.items[this.undoIndexes[index]] = this.undoValues[index];
107
+ this.undoIndexes.length = limit;
108
+ this.undoValues.length = limit;
109
+ this.items.length = this.sizes[level];
110
+ this.sizes.length = level;
111
+ this.undoLimits.length = level;
112
+ }
113
+ }
114
+
115
+ class TrailStack {
116
+ private undos: (() => void)[] = [];
117
+ private limits: number[] = [];
118
+
119
+ push(undo: () => void) {
120
+ this.undos.push(undo);
121
+ }
122
+
123
+ pushScope() {
124
+ this.limits.push(this.undos.length);
125
+ }
126
+
127
+ popScope(numScopes: number) {
128
+ if (numScopes === 0) return;
129
+ const level = this.limits.length - numScopes;
130
+ const limit = this.limits[level];
131
+ for (let index = this.undos.length - 1; index >= limit; index--) this.undos[index]();
132
+ this.undos.length = limit;
133
+ this.limits.length = level;
134
+ }
135
+ }
136
+
137
+ const INSERT = 0;
138
+ const DELETE = 1;
139
+
140
+ class SolutionMap {
141
+ private map = new Map<number, ExprDep>();
142
+ private cache = new Map<number, ExprDep>();
143
+ private updates: number[] = [];
144
+ private lefts: number[] = [];
145
+ private rights: number[] = [];
146
+ private deps: Dependency[] = [];
147
+ private limits: number[] = [];
148
+
149
+ get isEmpty() {
150
+ return this.map.size === 0;
151
+ }
152
+
153
+ private reducesTo(input: number, expr: number) {
154
+ let current = input;
155
+ while (current !== expr) {
156
+ const value = this.map.get(current);
157
+ if (value === undefined) return false;
158
+ current = value.expr;
159
+ }
160
+ return true;
161
+ }
162
+
163
+ update(expr: number, rep: number, dep: Dependency) {
164
+ if (expr === rep || this.reducesTo(rep, expr)) return;
165
+ this.cache.clear();
166
+ const value = this.map.get(expr);
167
+ if (value !== undefined) this.addTrail(DELETE, expr, value.expr, value.dep);
168
+ this.map.set(expr, { expr: rep, dep });
169
+ this.addTrail(INSERT, expr, rep, dep);
170
+ }
171
+
172
+ private addTrail(op: number, left: number, right: number, dep: Dependency) {
173
+ this.updates.push(op);
174
+ this.lefts.push(left);
175
+ this.rights.push(right);
176
+ this.deps.push(dep);
177
+ }
178
+
179
+ addCache(expr: number, rep: number, dep: Dependency) {
180
+ this.cache.set(expr, { expr: rep, dep });
181
+ }
182
+
183
+ findCache(expr: number) {
184
+ return this.cache.get(expr);
185
+ }
186
+
187
+ findWithDep(input: number) {
188
+ let dep: Dependency = null;
189
+ let expr = input;
190
+ for (let value = this.map.get(expr); value !== undefined; value = this.map.get(expr)) {
191
+ dep = mkJoin(dep, value.dep);
192
+ expr = value.expr;
193
+ }
194
+ return { expr, dep };
195
+ }
196
+
197
+ find(input: number) {
198
+ let expr = input;
199
+ for (let value = this.map.get(expr); value !== undefined; value = this.map.get(expr))
200
+ expr = value.expr;
201
+ return expr;
202
+ }
203
+
204
+ find1(expr: number) {
205
+ return this.map.get(expr);
206
+ }
207
+
208
+ isRoot(expr: number) {
209
+ return !this.map.has(expr);
210
+ }
211
+
212
+ pushScope() {
213
+ this.limits.push(this.updates.length);
214
+ }
215
+
216
+ popScope(numScopes: number) {
217
+ if (numScopes === 0) return;
218
+ this.cache.clear();
219
+ const start = this.limits[this.limits.length - numScopes];
220
+ for (let index = this.updates.length - 1; index >= start; index--) {
221
+ if (this.updates[index] === INSERT) this.map.delete(this.lefts[index]);
222
+ else this.map.set(this.lefts[index], { expr: this.rights[index], dep: this.deps[index] });
223
+ }
224
+ this.updates.length = start;
225
+ this.lefts.length = start;
226
+ this.rights.length = start;
227
+ this.deps.length = start;
228
+ this.limits.length -= numScopes;
229
+ }
230
+ }
231
+
232
+ class ExclusionTable {
233
+ private table = new Set<string>();
234
+ private lefts: number[] = [];
235
+ private rights: number[] = [];
236
+ private limits: number[] = [];
237
+
238
+ constructor(private manager: AstManager) {}
239
+
240
+ get isEmpty() {
241
+ return this.table.size === 0;
242
+ }
243
+
244
+ private getKey(first: number, second: number) {
245
+ return this.manager.ids[first] > this.manager.ids[second]
246
+ ? `${second},${first}`
247
+ : `${first},${second}`;
248
+ }
249
+
250
+ contains(first: number, second: number) {
251
+ return this.table.has(this.getKey(first, second));
252
+ }
253
+
254
+ update(first: number, second: number) {
255
+ const key = this.getKey(first, second);
256
+ if (first === second || this.table.has(key)) return;
257
+ this.lefts.push(first);
258
+ this.rights.push(second);
259
+ this.table.add(key);
260
+ }
261
+
262
+ pushScope() {
263
+ this.limits.push(this.lefts.length);
264
+ }
265
+
266
+ popScope(numScopes: number) {
267
+ if (numScopes === 0) return;
268
+ const start = this.limits[this.limits.length - numScopes];
269
+ for (let index = start; index < this.lefts.length; index++)
270
+ this.table.delete(this.getKey(this.lefts[index], this.rights[index]));
271
+ this.lefts.length = start;
272
+ this.rights.length = start;
273
+ this.limits.length -= numScopes;
274
+ }
275
+ }
276
+
277
+ class UnionFind {
278
+ private finds: number[] = [];
279
+ private sizes: number[] = [];
280
+ private nexts: number[] = [];
281
+
282
+ constructor(private trail: TrailStack) {}
283
+
284
+ mkVar() {
285
+ const thVar = this.finds.length;
286
+ this.finds.push(thVar);
287
+ this.sizes.push(1);
288
+ this.nexts.push(thVar);
289
+ this.trail.push(() => {
290
+ this.finds.pop();
291
+ this.sizes.pop();
292
+ this.nexts.pop();
293
+ });
294
+ }
295
+
296
+ find(input: number) {
297
+ let thVar = input;
298
+ while (this.finds[thVar] !== thVar) thVar = this.finds[thVar];
299
+ return thVar;
300
+ }
301
+
302
+ merge(first: number, second: number) {
303
+ let firstRoot = this.find(first);
304
+ let secondRoot = this.find(second);
305
+ if (firstRoot === secondRoot) return;
306
+ if (this.sizes[firstRoot] > this.sizes[secondRoot]) {
307
+ const swapped = firstRoot;
308
+ firstRoot = secondRoot;
309
+ secondRoot = swapped;
310
+ }
311
+ this.finds[firstRoot] = secondRoot;
312
+ this.sizes[secondRoot] += this.sizes[firstRoot];
313
+ const next = this.nexts[firstRoot];
314
+ this.nexts[firstRoot] = this.nexts[secondRoot];
315
+ this.nexts[secondRoot] = next;
316
+ const root = firstRoot;
317
+ const other = secondRoot;
318
+ this.trail.push(() => {
319
+ const restored = this.nexts[root];
320
+ this.nexts[root] = this.nexts[other];
321
+ this.nexts[other] = restored;
322
+ this.sizes[other] -= this.sizes[root];
323
+ this.finds[root] = root;
324
+ });
325
+ }
326
+ }
327
+
328
+ export abstract class TheorySeqState extends Theory {
329
+ protected assumptions: Assumption[] = [];
330
+ private assumptionLimits: number[] = [];
331
+ protected rep = new SolutionMap();
332
+ protected eqs = new ScopedVector<DepEq>();
333
+ protected nqs = new ScopedVector<Ne>();
334
+ protected ncs = new ScopedVector<Nc>();
335
+ protected lts = new ScopedVector<number>();
336
+ protected recfuns = new ScopedVector<number>();
337
+ protected isLtsChecked = false;
338
+ protected eqId = 0;
339
+ protected unionFind: UnionFind;
340
+ protected overlapLeft = new Map<number, boolean>();
341
+ protected overlapRight = new Map<number, boolean>();
342
+ protected exclude: ExclusionTable;
343
+ protected axioms: number[] = [];
344
+ protected axiomSet = new Set<number>();
345
+ protected axiomsHead = 0;
346
+ protected intStrings: number[] = [];
347
+ protected hasLengthSet = new Set<number>();
348
+ protected lengths: number[] = [];
349
+ protected lengthLimits: number[] = [];
350
+ protected replay: (() => void)[] = [];
351
+ protected strRewriter: Rewriter;
352
+ protected rewriter: Rewriter;
353
+ protected seqRewriter: SeqRewriter;
354
+ protected ax: SeqAxioms;
355
+ protected sk: SeqSkolem;
356
+ protected eqSolver: SeqEqSolver;
357
+ protected trailStack = new TrailStack();
358
+ protected maxUnfoldingDepth = 1;
359
+ protected maxUnfoldingLiteral: Literal | undefined;
360
+ protected unhandledExpr: number | undefined;
361
+ protected hasSeq: boolean;
362
+ protected isNewSolution = false;
363
+ protected isNewPropagation = false;
364
+ protected fixed = new Set<number>();
365
+ protected expandTodo: number[] = [];
366
+ protected eqDeps: Dependency = null;
367
+ protected nthEq2Cache = new Set<string>();
368
+ protected branchStart = new Map<number, number>();
369
+
370
+ constructor(context: Context, family: number) {
371
+ super(context, family);
372
+ const manager = context.manager;
373
+ this.unionFind = new UnionFind(this.trailStack);
374
+ this.exclude = new ExclusionTable(manager);
375
+ this.rewriter = new Rewriter(manager, { ...TACTIC_REWRITER_OPTIONS, isCoalescingChars: false });
376
+ this.strRewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
377
+ this.seqRewriter = new SeqRewriter(manager);
378
+ this.ax = new SeqAxioms(manager, {
379
+ rewrite: (expr) => this.rewrite(expr),
380
+ mkEqLiteral: (first, second) => this.mkEqLiteral(first, second, false),
381
+ ensureEnode: (expr) => this.ensureEnodeOf(expr),
382
+ getLiteral: (expr) => context.getLiteral(expr),
383
+ forcePhase: (literal) => context.forcePhase(literal),
384
+ addAxiom: (literals) => this.addAxiom(literals),
385
+ pushTrail: (undo) => context.pushTrail(undo),
386
+ });
387
+ this.sk = this.ax.skolem;
388
+ this.eqSolver = new SeqEqSolver(
389
+ manager,
390
+ {
391
+ addConsequence: (isUsingDeps, clause) => this.addConsequence(isUsingDeps, clause),
392
+ addSolution: (variable, term) => {
393
+ this.addSolution(variable, term, this.eqDeps);
394
+ },
395
+ expr2rep: (expr) => this.expr2rep(expr),
396
+ getLength: (expr) => {
397
+ const value = this.getLengthValue(expr);
398
+ return { isKnown: value !== undefined, value: value ?? Rational.zero };
399
+ },
400
+ },
401
+ this.ax,
402
+ );
403
+ this.hasSeq = manager.isSeqUsed;
404
+ }
405
+
406
+ protected keep(expr: number) {
407
+ this.manager.incRef(expr);
408
+ return expr;
409
+ }
410
+
411
+ protected rewrite(expr: number) {
412
+ return this.rewriter.rewrite(expr);
413
+ }
414
+
415
+ protected isSeq(expr: number) {
416
+ return this.manager.isSeqSort(this.manager.sorts[expr]);
417
+ }
418
+
419
+ protected isRe(expr: number) {
420
+ return this.manager.isReSort(this.manager.sorts[expr]);
421
+ }
422
+
423
+ protected isOp(expr: number, op: number) {
424
+ return this.manager.getOp(expr) === op;
425
+ }
426
+
427
+ protected isConcat(expr: number) {
428
+ return this.isOp(expr, OP_SEQ_CONCAT) && this.manager.getNumArgs(expr) === 2;
429
+ }
430
+
431
+ protected isEmpty(expr: number) {
432
+ return isEmptySeq(this.manager, expr);
433
+ }
434
+
435
+ protected isUnit(expr: number) {
436
+ return this.isOp(expr, OP_SEQ_UNIT);
437
+ }
438
+
439
+ protected isString(expr: number) {
440
+ return this.manager.getString(expr) !== undefined;
441
+ }
442
+
443
+ protected isNthU(expr: number) {
444
+ return this.isOp(expr, OP_SEQ_NTH_U);
445
+ }
446
+
447
+ protected mkInt(value: number | bigint) {
448
+ return this.manager.mkNumeral(BigInt(value));
449
+ }
450
+
451
+ protected mkArith(op: number, args: number[]) {
452
+ return this.manager.mkApp(op, args, op === OP_GE || op === OP_LE ? SORT_BOOL : SORT_INT);
453
+ }
454
+
455
+ protected mkConcat(args: readonly number[], sort?: number) {
456
+ return mkConcatOf(this.manager, args, sort ?? this.manager.sorts[args[0]]);
457
+ }
458
+
459
+ protected mkConcat2(first: number, second: number) {
460
+ return mkSeqApp(this.manager, OP_SEQ_CONCAT, [first, second]);
461
+ }
462
+
463
+ protected mkEmpty(sort: number) {
464
+ return mkEmptySeq(this.manager, sort);
465
+ }
466
+
467
+ protected mkLen(seq: number) {
468
+ return this.seqRewriter.mkLengthOf(seq);
469
+ }
470
+
471
+ protected mkSub(first: number, second: number) {
472
+ return this.rewrite(this.mkArith(OP_SUB, [first, second]));
473
+ }
474
+
475
+ protected mkAdd(first: number, second: number) {
476
+ return this.rewrite(this.mkArith(OP_ADD, [first, second]));
477
+ }
478
+
479
+ protected mkLength(seq: number) {
480
+ return mkSeqApp(this.manager, OP_SEQ_LENGTH, [seq]);
481
+ }
482
+
483
+ protected getConcatUnits(expr: number, result: number[]) {
484
+ return getConcatUnits(this.manager, expr, result);
485
+ }
486
+
487
+ protected mkEqDep(left: number, right: number, dep: Dependency): DepEq {
488
+ const ls = this.getConcatUnits(left, []).map((expr) => this.keep(expr));
489
+ const rs = this.getConcatUnits(right, []).map((expr) => this.keep(expr));
490
+ return { id: this.eqId++, ls, rs, dep };
491
+ }
492
+
493
+ protected mkDepEq(id: number, ls: readonly number[], rs: readonly number[], dep: Dependency) {
494
+ return {
495
+ id,
496
+ ls: ls.map((expr) => this.keep(expr)),
497
+ rs: rs.map((expr) => this.keep(expr)),
498
+ dep,
499
+ };
500
+ }
501
+
502
+ protected mkAssumption(assumption: Assumption) {
503
+ this.assumptions.push(assumption);
504
+ return mkLeaf(this.assumptions.length - 1);
505
+ }
506
+
507
+ protected mkLiteralLeaf(literal: Literal) {
508
+ return this.mkAssumption({ first: undefined, second: undefined, literal });
509
+ }
510
+
511
+ protected mkJoinLiteral(dep: Dependency, literal: Literal) {
512
+ return mkJoin(dep, this.mkLiteralLeaf(literal));
513
+ }
514
+
515
+ protected mkJoinLiterals(input: Dependency, literals: readonly Literal[]) {
516
+ let dep = input;
517
+ for (const literal of literals) dep = this.mkJoinLiteral(dep, literal);
518
+ return dep;
519
+ }
520
+
521
+ protected addDependency(dep: Dependency, first: Enode, second: Enode) {
522
+ return first === second
523
+ ? dep
524
+ : mkJoin(dep, this.mkAssumption({ first, second, literal: undefined }));
525
+ }
526
+
527
+ protected linearizeOf(dep: Dependency, eqs: Enode[], literals: Literal[]) {
528
+ for (const index of linearize([dep])) {
529
+ const assumption = this.assumptions[index];
530
+ if (assumption.literal !== undefined && assumption.literal !== TRUE_LITERAL)
531
+ literals.push(assumption.literal);
532
+ if (assumption.first !== undefined) eqs.push(assumption.first, assumption.second!);
533
+ }
534
+ }
535
+
536
+ protected pushScopeDeps() {
537
+ this.assumptionLimits.push(this.assumptions.length);
538
+ }
539
+
540
+ protected popScopeDeps(numScopes: number) {
541
+ const level = this.assumptionLimits.length - numScopes;
542
+ this.assumptions.length = this.assumptionLimits[level];
543
+ this.assumptionLimits.length = level;
544
+ }
545
+
546
+ private getEnodeOf(expr: number) {
547
+ return this.context.isEInternalized(expr) ? this.context.getEnode(expr) : undefined;
548
+ }
549
+
550
+ protected getNumValue(expr: number) {
551
+ const node = this.getEnodeOf(expr);
552
+ if (node === undefined) return undefined;
553
+ let next = node;
554
+ do {
555
+ const value = this.context.arith?.getValueOf(next);
556
+ if (value !== undefined) return value.isInt() ? value : undefined;
557
+ next = next.next;
558
+ } while (next !== node);
559
+ return undefined;
560
+ }
561
+
562
+ protected lowerBound(expr: number) {
563
+ const node = this.getEnodeOf(expr);
564
+ const bound = node === undefined ? undefined : this.context.arith?.getLower(node);
565
+ return bound !== undefined && !bound.isStrict && bound.value.isInt() ? bound.value : undefined;
566
+ }
567
+
568
+ protected upperBound(expr: number) {
569
+ const node = this.getEnodeOf(expr);
570
+ const bound = node === undefined ? undefined : this.context.arith?.getUpper(node);
571
+ return bound !== undefined && !bound.isStrict && bound.value.isInt() ? bound.value : undefined;
572
+ }
573
+
574
+ protected lowerBound2(seq: number) {
575
+ const node = this.getEnodeOf(this.mkLen(seq));
576
+ if (node === undefined) return undefined;
577
+ let lower: Rational | undefined;
578
+ let isStrict = false;
579
+ let next = node;
580
+ do {
581
+ const bound = this.context.arith?.getLower(next);
582
+ if (
583
+ bound !== undefined &&
584
+ (lower === undefined ||
585
+ bound.value.compare(lower) > 0 ||
586
+ (bound.value.equals(lower) && bound.isStrict))
587
+ ) {
588
+ lower = bound.value;
589
+ isStrict = bound.isStrict;
590
+ }
591
+ next = next.next;
592
+ } while (next !== node);
593
+ return isStrict ? undefined : lower;
594
+ }
595
+
596
+ protected getLengthValue(input: number) {
597
+ const manager = this.manager;
598
+ let value = Rational.zero;
599
+ const todo = [input];
600
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
601
+ const op = manager.getOp(expr);
602
+ const chars = manager.getString(expr);
603
+ if (this.isConcat(expr)) todo.push(manager.getArg(expr, 0), manager.getArg(expr, 1));
604
+ else if (op === OP_SEQ_UNIT) value = value.add(Rational.one);
605
+ else if (this.isEmpty(expr)) continue;
606
+ else if (this.isOp(expr, OP_SEQ_MAP)) todo.push(manager.getArg(expr, 1));
607
+ else if (this.isOp(expr, OP_SEQ_MAPI)) todo.push(manager.getArg(expr, 2));
608
+ else if (chars !== undefined) value = value.add(Rational.of(BigInt(chars.length)));
609
+ else {
610
+ const length = this.mkLen(expr);
611
+ if (!this.hasLength(expr)) {
612
+ this.addAxiomOf(this.mkLiteralOf(this.mkArith(OP_GE, [length, this.mkInt(0)])));
613
+ return undefined;
614
+ }
615
+ const node = this.getEnodeOf(length);
616
+ const lengthValue = node === undefined ? undefined : this.context.arith?.getValueOf(node);
617
+ if (lengthValue === undefined || lengthValue.isNegative()) return undefined;
618
+ value = value.add(lengthValue);
619
+ }
620
+ }
621
+ return value.isInt() ? value : undefined;
622
+ }
623
+
624
+ protected hasLength(expr: number) {
625
+ return this.hasLengthSet.has(expr);
626
+ }
627
+
628
+ protected expr2rep(expr: number) {
629
+ const context = this.context;
630
+ const manager = this.manager;
631
+ if (manager.isBool(expr) && context.isBInternalized(expr)) {
632
+ const value = context.getAssignment(mkLiteral(context.getBoolVar(expr)));
633
+ if (value === L_TRUE) return manager.trueExpr;
634
+ if (value !== L_UNDEF) return manager.falseExpr;
635
+ }
636
+ if (!context.isEInternalized(expr)) return expr;
637
+ return context.getEnode(expr)!.root.owner;
638
+ }
639
+
640
+ protected mkEqEmpty(expr: number, isPositive = true) {
641
+ const manager = this.manager;
642
+ if (this.isEmpty(expr)) return TRUE_LITERAL;
643
+ for (const unit of this.getConcatUnits(expr, [])) {
644
+ if (this.isUnit(unit)) return FALSE_LITERAL;
645
+ const chars = manager.getString(unit);
646
+ if (chars !== undefined && chars.length > 0) return FALSE_LITERAL;
647
+ }
648
+ const literal = this.mkEqLiteral(expr, this.mkEmpty(manager.sorts[expr]), false);
649
+ this.context.forcePhase(isPositive ? literal : negate(literal));
650
+ this.context.markLiteralAsRelevant(literal);
651
+ return literal;
652
+ }
653
+
654
+ protected mkSeqEq(first: number, second: number) {
655
+ return this.mkLiteralOf(this.sk.mkEq(first, second));
656
+ }
657
+
658
+ protected mkSimplifiedLiteral(expr: number) {
659
+ return this.mkLiteralOf(this.rewrite(expr));
660
+ }
661
+
662
+ protected mkGeLiteral(expr: number, bound: number | bigint) {
663
+ return this.mkLiteralOf(this.mkArith(OP_GE, [expr, this.mkInt(bound)]));
664
+ }
665
+
666
+ protected mkLeLiteral(expr: number, bound: number | bigint) {
667
+ return this.mkLiteralOf(this.mkArith(OP_LE, [expr, this.mkInt(bound)]));
668
+ }
669
+
670
+ protected addAxiomOf(...inputs: Literal[]) {
671
+ if (inputs.includes(TRUE_LITERAL)) return;
672
+ this.addAxiom(inputs.filter((literal) => literal !== FALSE_LITERAL));
673
+ }
674
+
675
+ protected addAxiom(literals: Literal[]) {
676
+ const context = this.context;
677
+ for (const literal of literals)
678
+ if (context.getAssignment(literal) === L_TRUE && context.getAssignLevel(literal) === 0)
679
+ return;
680
+ for (const literal of literals) context.markLiteralAsRelevant(literal);
681
+ this.isNewPropagation = true;
682
+ context.mkThAxiom(literals);
683
+ }
684
+
685
+ protected propagateLit(dep: Dependency, antecedents: readonly Literal[], literal: Literal) {
686
+ const context = this.context;
687
+ if (literal === TRUE_LITERAL || context.getAssignment(literal) === L_TRUE) return false;
688
+ const literals = [...antecedents];
689
+ if (literal === FALSE_LITERAL) {
690
+ this.setConflict(dep, literals);
691
+ return true;
692
+ }
693
+ context.markLiteralAsRelevant(literal);
694
+ const eqs: Enode[] = [];
695
+ this.linearizeOf(dep, eqs, literals);
696
+ this.isNewPropagation = true;
697
+ context.assign(literal, new TheoryJustification(this.id, literals, eqs));
698
+ return true;
699
+ }
700
+
701
+ protected setConflict(dep: Dependency, antecedents: readonly Literal[] = []) {
702
+ const eqs: Enode[] = [];
703
+ const literals = [...antecedents];
704
+ this.linearizeOf(dep, eqs, literals);
705
+ this.isNewPropagation = true;
706
+ this.context.setConflict(new TheoryJustification(this.id, literals, eqs), null);
707
+ }
708
+
709
+ protected conflictOrAxiom(literals: Literal[], dep: Dependency) {
710
+ const context = this.context;
711
+ if (literals.every((literal) => context.getAssignment(literal) === L_TRUE)) {
712
+ this.setConflict(dep, literals);
713
+ return;
714
+ }
715
+ const clause = literals.map((literal) => negate(literal));
716
+ const eqs: Enode[] = [];
717
+ const depLiterals: Literal[] = [];
718
+ this.linearizeOf(dep, eqs, depLiterals);
719
+ for (const literal of depLiterals) clause.push(negate(literal));
720
+ for (let index = 0; index < eqs.length; index += 2)
721
+ clause.push(negate(this.mkEqLiteral(eqs[index].owner, eqs[index + 1].owner, false)));
722
+ this.addAxiom(clause);
723
+ }
724
+
725
+ protected propagateEqNodes(dep: Dependency, first: Enode, second: Enode) {
726
+ if (first.root === second.root) return false;
727
+ const literals: Literal[] = [];
728
+ const eqs: Enode[] = [];
729
+ this.linearizeOf(dep, eqs, literals);
730
+ this.context.pushEq(first, second, {
731
+ kind: "justification",
732
+ justification: new TheoryJustification(this.id, literals, eqs),
733
+ });
734
+ this.isNewPropagation = true;
735
+ this.enforceLengthCoherence(first, second);
736
+ return true;
737
+ }
738
+
739
+ protected propagateEq(
740
+ inputDep: Dependency,
741
+ antecedents: readonly Literal[],
742
+ firstExpr: number,
743
+ secondExpr: number,
744
+ isAddingToEqs = true,
745
+ ) {
746
+ const context = this.context;
747
+ const manager = this.manager;
748
+ manager.incRef(firstExpr);
749
+ manager.incRef(secondExpr);
750
+ const first = this.ensureEnodeOf(firstExpr);
751
+ const second = this.ensureEnodeOf(secondExpr);
752
+ manager.decRef(secondExpr);
753
+ manager.decRef(firstExpr);
754
+ if (first.root === second.root) return false;
755
+ context.markAsRelevant(first.owner);
756
+ context.markAsRelevant(second.owner);
757
+ const literals = [...antecedents];
758
+ const eqs: Enode[] = [];
759
+ this.linearizeOf(inputDep, eqs, literals);
760
+ if (isAddingToEqs) this.newEqEhOf(this.mkJoinLiterals(inputDep, antecedents), first, second);
761
+ this.isNewPropagation = true;
762
+ context.pushEq(first, second, {
763
+ kind: "justification",
764
+ justification: new TheoryJustification(this.id, literals, eqs),
765
+ });
766
+ return true;
767
+ }
768
+
769
+ protected enforceLengthCoherence(first: Enode, second: Enode) {
770
+ const firstExpr = first.owner;
771
+ const secondExpr = second.owner;
772
+ if (this.isOp(firstExpr, OP_SEQ_CONCAT) && this.isOp(secondExpr, OP_SEQ_CONCAT)) return;
773
+ if (this.hasLength(firstExpr) && !this.hasLength(secondExpr)) this.addLengthToEqc(secondExpr);
774
+ else if (this.hasLength(secondExpr) && !this.hasLength(firstExpr))
775
+ this.addLengthToEqc(firstExpr);
776
+ }
777
+
778
+ protected addLength(length: number) {
779
+ const expr = this.manager.getArg(length, 0);
780
+ if (this.hasLength(expr)) return;
781
+ this.lengths.push(this.keep(length));
782
+ this.hasLengthSet.add(expr);
783
+ this.trailStack.push(() => {
784
+ this.lengths.pop();
785
+ });
786
+ this.trailStack.push(() => {
787
+ this.hasLengthSet.delete(expr);
788
+ });
789
+ }
790
+
791
+ protected addLengthToEqc(expr: number) {
792
+ const first = this.ensureEnodeOf(expr);
793
+ let node = first;
794
+ let isChanged = false;
795
+ do {
796
+ const owner = node.owner;
797
+ if (!this.hasLength(owner)) {
798
+ const length = this.mkLength(owner);
799
+ this.addLength(length);
800
+ this.ensureEnodeOf(length);
801
+ isChanged = true;
802
+ }
803
+ node = node.next;
804
+ } while (node !== first);
805
+ return isChanged;
806
+ }
807
+
808
+ protected addConsequence(isUsingDeps: boolean, clause: number[]) {
809
+ const dep = isUsingDeps ? this.eqDeps : null;
810
+ this.isNewPropagation = true;
811
+ if (clause.length === 1) {
812
+ this.propagateLit(dep, [], this.mkLiteralOf(clause[0]));
813
+ return;
814
+ }
815
+ const eqs: Enode[] = [];
816
+ const literals: Literal[] = [];
817
+ this.linearizeOf(dep, eqs, literals);
818
+ const axiom = literals.map((literal) => negate(literal));
819
+ for (let index = 0; index < eqs.length; index += 2)
820
+ axiom.push(negate(this.mkEqLiteral(eqs[index].owner, eqs[index + 1].owner, false)));
821
+ for (const expr of clause) axiom.push(this.mkLiteralOf(expr));
822
+ this.addAxiom(axiom);
823
+ }
824
+
825
+ protected addSolution(left: number, right: number, dep: Dependency) {
826
+ if (left === right) return false;
827
+ this.isNewSolution = true;
828
+ this.rep.update(this.keep(left), this.keep(right), dep);
829
+ const first = this.ensureEnodeOf(left);
830
+ const second = this.ensureEnodeOf(right);
831
+ const lengthParents: number[] = [];
832
+ const isSeq = this.isSeq(right);
833
+ if (isSeq)
834
+ for (const node of [first, second])
835
+ for (const parent of node.parents)
836
+ if (this.isOp(parent.owner, OP_SEQ_LENGTH)) lengthParents.push(parent.owner);
837
+ this.propagateEqNodes(dep, first, second);
838
+ if (isSeq) {
839
+ const length = this.rewrite(this.mkLength(right));
840
+ for (const parent of lengthParents) this.propagateEq(dep, [], parent, length, false);
841
+ }
842
+ return true;
843
+ }
844
+
845
+ protected isVar(expr: number) {
846
+ return this.eqSolver.isVar(expr);
847
+ }
848
+
849
+ protected setEmpty(expr: number) {
850
+ const isZeroLength = this.mkEqLiteral(this.mkInt(0), this.mkLen(expr), false);
851
+ this.addAxiomOf(negate(isZeroLength), this.mkEqEmpty(expr));
852
+ return true;
853
+ }
854
+
855
+ protected decompose(expr: number) {
856
+ return this.sk.decompose(expr);
857
+ }
858
+
859
+ protected mkDecompose(expr: number) {
860
+ const decomposition = this.decompose(expr);
861
+ const isEmpty = this.mkEqEmpty(expr);
862
+ this.addAxiomOf(negate(isEmpty), this.mkEqEmpty(decomposition.tail));
863
+ this.addAxiomOf(
864
+ isEmpty,
865
+ this.mkEqLiteral(expr, this.mkConcat2(decomposition.head, decomposition.tail), false),
866
+ );
867
+ return decomposition;
868
+ }
869
+
870
+ protected abstract newEqEhOf(dep: Dependency, first: Enode, second: Enode): void;
871
+ }