tla-ts 0.0.10-dev.63a6693bd → 0.0.10-dev.7a3bb1545

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 (538) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +3 -3
  3. package/dist/compile.js +1 -1
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +58 -54
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +4 -1
  8. package/dist/index.d.ts +4 -1
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2682 -426
  15. package/dist/prove.js +2679 -423
  16. package/dist/run.cjs +43 -42
  17. package/dist/run.js +45 -44
  18. package/dist/tlapm.cjs +1 -1
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +43 -40
  21. package/dist/transfer.js +43 -40
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +1 -1
  25. package/src/ast.ts +3 -3
  26. package/src/bags.ts +46 -28
  27. package/src/check-trace.ts +2 -16
  28. package/src/check.ts +336 -88
  29. package/src/cli/runtime-invariants.ts +20 -56
  30. package/src/cli/tlapm.ts +424 -62
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +4 -5
  33. package/src/cli/tlc-usage.ts +0 -1
  34. package/src/cli/tlc.ts +26 -7
  35. package/src/dependencies.ts +23 -2
  36. package/src/dfid.ts +9 -2
  37. package/src/environment.ts +27 -5
  38. package/src/errors.ts +30 -3
  39. package/src/evaluate.ts +9 -3
  40. package/src/exit-codes.ts +5 -2
  41. package/src/instances.ts +1 -1
  42. package/src/levels.ts +3 -2
  43. package/src/lexer.ts +5 -3
  44. package/src/liveness-checker.ts +572 -204
  45. package/src/liveness.ts +47 -32
  46. package/src/obligations/action.ts +10 -6
  47. package/src/obligations/anonymize.ts +33 -14
  48. package/src/obligations/enabled-axioms.ts +218 -0
  49. package/src/obligations/equality.ts +1 -3
  50. package/src/obligations/expression.ts +18 -6
  51. package/src/obligations/format.ts +0 -2
  52. package/src/obligations/generate.ts +22 -17
  53. package/src/obligations/index.ts +36 -6
  54. package/src/obligations/levels.ts +24 -11
  55. package/src/obligations/module.ts +1 -3
  56. package/src/obligations/normalize.ts +24 -13
  57. package/src/obligations/operators.ts +0 -2
  58. package/src/obligations/pragma.ts +53 -16
  59. package/src/obligations/printer.ts +43 -13
  60. package/src/obligations/proof.ts +3 -2
  61. package/src/obligations/regroup.ts +0 -2
  62. package/src/obligations/simplify.ts +17 -7
  63. package/src/obligations/source.ts +71 -17
  64. package/src/obligations/subexpression.ts +45 -18
  65. package/src/obligations/substitution.ts +1 -3
  66. package/src/obligations/temporal.ts +0 -2
  67. package/src/obligations/tuples.ts +0 -2
  68. package/src/parallel-worker.ts +8 -2
  69. package/src/parallel.ts +7 -2
  70. package/src/parser.ts +633 -186
  71. package/src/pretty-print.ts +1 -1
  72. package/src/prover/deciders.ts +11 -8
  73. package/src/prover/isabelle/decide.ts +3 -25
  74. package/src/prover/isabelle/encode.ts +71 -41
  75. package/src/prover/isabelle/isar/attrib.ts +250 -0
  76. package/src/prover/isabelle/isar/context.ts +335 -0
  77. package/src/prover/isabelle/isar/induct.ts +382 -0
  78. package/src/prover/isabelle/isar/inner-syntax.ts +149 -3
  79. package/src/prover/isabelle/isar/method.ts +506 -198
  80. package/src/prover/isabelle/isar/proof.ts +570 -14
  81. package/src/prover/isabelle/isar/rule-cases.ts +226 -0
  82. package/src/prover/isabelle/isar/theory.ts +479 -69
  83. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  84. package/src/prover/isabelle/isar/type-check.ts +83 -8
  85. package/src/prover/isabelle/provers/blast/blast.ts +0 -2
  86. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  87. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  88. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  89. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  90. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  91. package/src/prover/isabelle/provers/clasimp.ts +1 -3
  92. package/src/prover/isabelle/provers/classical.ts +45 -20
  93. package/src/prover/isabelle/provers/hypsubst.ts +2 -4
  94. package/src/prover/isabelle/pure/bicompose.ts +0 -2
  95. package/src/prover/isabelle/pure/consts.ts +0 -2
  96. package/src/prover/isabelle/pure/conv.ts +0 -2
  97. package/src/prover/isabelle/pure/drule.ts +63 -4
  98. package/src/prover/isabelle/pure/envir.ts +0 -2
  99. package/src/prover/isabelle/pure/goal.ts +1 -3
  100. package/src/prover/isabelle/pure/logic.ts +0 -2
  101. package/src/prover/isabelle/pure/name.ts +0 -2
  102. package/src/prover/isabelle/pure/net.ts +0 -2
  103. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  104. package/src/prover/isabelle/pure/pattern.ts +0 -2
  105. package/src/prover/isabelle/pure/raw-simplifier.ts +0 -2
  106. package/src/prover/isabelle/pure/rewriter.ts +1 -8
  107. package/src/prover/isabelle/pure/search.ts +0 -2
  108. package/src/prover/isabelle/pure/seq.ts +0 -2
  109. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  110. package/src/prover/isabelle/pure/table.ts +0 -2
  111. package/src/prover/isabelle/pure/tactic.ts +0 -2
  112. package/src/prover/isabelle/pure/tactical.ts +0 -2
  113. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  114. package/src/prover/isabelle/pure/term.ts +0 -2
  115. package/src/prover/isabelle/pure/thm.ts +0 -2
  116. package/src/prover/isabelle/pure/type.ts +0 -2
  117. package/src/prover/isabelle/pure/unify.ts +0 -2
  118. package/src/prover/isabelle/pure/variable.ts +0 -2
  119. package/src/prover/isabelle/tla/classical-setup.ts +1 -2
  120. package/src/prover/isabelle/tla/context.ts +51 -9
  121. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  122. package/src/prover/isabelle/tla/logic.ts +40 -1
  123. package/src/prover/isabelle/tla/simpdata.ts +0 -2
  124. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  125. package/src/prover/ocaml.ts +4 -1
  126. package/src/prover/prep/action.ts +19 -12
  127. package/src/prover/prep/enabled-axioms.ts +11 -2
  128. package/src/prover/prep/methods.ts +159 -50
  129. package/src/prover/prep/normalize.ts +38 -9
  130. package/src/prover/prove.ts +343 -65
  131. package/src/prover/ptl/decide.ts +95 -50
  132. package/src/prover/ptl/encode.ts +2 -3
  133. package/src/prover/ptl/tableau.ts +28 -2
  134. package/src/prover/smt/arithmetic.ts +310 -0
  135. package/src/prover/smt/axioms.ts +12 -8
  136. package/src/prover/smt/context.ts +42 -6
  137. package/src/prover/smt/data.ts +191 -84
  138. package/src/prover/smt/encode.ts +122 -43
  139. package/src/prover/smt/extensionality.ts +5 -3
  140. package/src/prover/smt/flatten.ts +4 -6
  141. package/src/prover/smt/format.ts +28 -4
  142. package/src/prover/smt/instances.ts +7 -1
  143. package/src/prover/smt/layout.ts +91 -0
  144. package/src/prover/smt/rewrite.ts +483 -116
  145. package/src/prover/smt/simplify.ts +441 -0
  146. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  147. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  148. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  149. package/src/prover/smt/solver/act-cache.ts +0 -1
  150. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  151. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  152. package/src/prover/smt/solver/aig.ts +889 -0
  153. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  154. package/src/prover/smt/solver/arith-terms.ts +121 -0
  155. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  156. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  157. package/src/prover/smt/solver/asserted-formulas.ts +93 -15
  158. package/src/prover/smt/solver/ast-lt.ts +165 -11
  159. package/src/prover/smt/solver/ast-util.ts +160 -2
  160. package/src/prover/smt/solver/ast.ts +1448 -41
  161. package/src/prover/smt/solver/auf-solver.ts +0 -1
  162. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  163. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  164. package/src/prover/smt/solver/bound-manager.ts +196 -0
  165. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  166. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  167. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  168. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  169. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  170. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  171. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  172. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  173. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  174. package/src/prover/smt/solver/card2bv.ts +109 -0
  175. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  176. package/src/prover/smt/solver/cg-table.ts +39 -25
  177. package/src/prover/smt/solver/check-logic.ts +330 -0
  178. package/src/prover/smt/solver/clause.ts +0 -1
  179. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  180. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  181. package/src/prover/smt/solver/context.ts +533 -114
  182. package/src/prover/smt/solver/ctx-simplify.ts +21 -12
  183. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  184. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  185. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  186. package/src/prover/smt/solver/demodulator.ts +786 -0
  187. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  188. package/src/prover/smt/solver/der.ts +38 -10
  189. package/src/prover/smt/solver/diff-neq.ts +205 -0
  190. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  191. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  192. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  193. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  194. package/src/prover/smt/solver/e-matching.ts +6 -7
  195. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  196. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  197. package/src/prover/smt/solver/enode.ts +100 -3
  198. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  199. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  200. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  201. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  202. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  203. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  204. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  205. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  206. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  207. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  208. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  209. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  210. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  211. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  212. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  213. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  214. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  215. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  216. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  217. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  218. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  219. package/src/prover/smt/solver/expr-ref.ts +0 -1
  220. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  221. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  222. package/src/prover/smt/solver/factor.ts +163 -0
  223. package/src/prover/smt/solver/fd-solver.ts +267 -0
  224. package/src/prover/smt/solver/fingerprints.ts +15 -15
  225. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  226. package/src/prover/smt/solver/flat-literals.ts +0 -1
  227. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  228. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  229. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  230. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  231. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  232. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  233. package/src/prover/smt/solver/goal.ts +177 -15
  234. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  235. package/src/prover/smt/solver/guard-set.ts +219 -0
  236. package/src/prover/smt/solver/hash.ts +0 -1
  237. package/src/prover/smt/solver/hashtable.ts +30 -16
  238. package/src/prover/smt/solver/inf-eps.ts +63 -0
  239. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  240. package/src/prover/smt/solver/internalizer.ts +109 -36
  241. package/src/prover/smt/solver/lackr.ts +381 -0
  242. package/src/prover/smt/solver/lbool.ts +0 -1
  243. package/src/prover/smt/solver/lia2card.ts +268 -0
  244. package/src/prover/smt/solver/lia2pb.ts +154 -0
  245. package/src/prover/smt/solver/literal.ts +0 -1
  246. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  247. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  248. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  249. package/src/prover/smt/solver/lp/containers.ts +7 -2
  250. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  251. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  252. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  253. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  254. package/src/prover/smt/solver/lp/dioph-eq.ts +0 -2
  255. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  256. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  257. package/src/prover/smt/solver/lp/hnf-cutter.ts +0 -1
  258. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  259. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  260. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  261. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  262. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  263. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  264. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  265. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  266. package/src/prover/smt/solver/lp/nex.ts +2 -2
  267. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  268. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  269. package/src/prover/smt/solver/lp/nla-core.ts +66 -11
  270. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  271. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  272. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  273. package/src/prover/smt/solver/lp/nla-grobner.ts +167 -85
  274. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  275. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  276. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  277. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  278. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  279. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  280. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  281. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  282. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  283. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  284. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  285. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  286. package/src/prover/smt/solver/lp/nra-solver.ts +163 -99
  287. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  288. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  289. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  290. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  291. package/src/prover/smt/solver/lp/pdd.ts +725 -290
  292. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  293. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  294. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  295. package/src/prover/smt/solver/macro-finder.ts +530 -0
  296. package/src/prover/smt/solver/mam-compiler.ts +118 -88
  297. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  298. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  299. package/src/prover/smt/solver/max-cliques.ts +105 -0
  300. package/src/prover/smt/solver/maxcore.ts +309 -0
  301. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  302. package/src/prover/smt/solver/maxlex.ts +115 -0
  303. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  304. package/src/prover/smt/solver/maxsmt.ts +92 -0
  305. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  306. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  307. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  308. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  309. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  310. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  311. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  312. package/src/prover/smt/solver/model-checker.ts +17 -26
  313. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  314. package/src/prover/smt/solver/model-finder.ts +0 -1
  315. package/src/prover/smt/solver/model-generator.ts +59 -30
  316. package/src/prover/smt/solver/model-macro-solver.ts +38 -27
  317. package/src/prover/smt/solver/model-printer.ts +214 -0
  318. package/src/prover/smt/solver/mpf.ts +709 -0
  319. package/src/prover/smt/solver/mus.ts +50 -0
  320. package/src/prover/smt/solver/muz/dl-context.ts +410 -0
  321. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  322. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  323. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  324. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  325. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  326. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  327. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  328. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  329. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  330. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  331. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  332. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  333. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  334. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  335. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  336. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  337. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  338. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  339. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  340. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  341. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  342. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  343. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  344. package/src/prover/smt/solver/nlqsat.ts +484 -0
  345. package/src/prover/smt/solver/nlsat/algebraic.ts +305 -88
  346. package/src/prover/smt/solver/nlsat/atoms.ts +52 -35
  347. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  348. package/src/prover/smt/solver/nlsat/explain.ts +424 -211
  349. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  350. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -241
  351. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  352. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -683
  353. package/src/prover/smt/solver/nlsat/solver.ts +282 -69
  354. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  355. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  356. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  357. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -7
  358. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -20
  359. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  360. package/src/prover/smt/solver/nnf.ts +105 -23
  361. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  362. package/src/prover/smt/solver/occf.ts +97 -0
  363. package/src/prover/smt/solver/opt-context.ts +792 -0
  364. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  365. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  366. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  367. package/src/prover/smt/solver/opt-solver.ts +311 -0
  368. package/src/prover/smt/solver/opt-value.ts +55 -0
  369. package/src/prover/smt/solver/optsmt.ts +692 -0
  370. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  371. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  372. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  373. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  374. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  375. package/src/prover/smt/solver/probes.ts +511 -0
  376. package/src/prover/smt/solver/propagate-values.ts +37 -21
  377. package/src/prover/smt/solver/proto-model.ts +650 -17
  378. package/src/prover/smt/solver/pull-quant.ts +28 -12
  379. package/src/prover/smt/solver/purify-arith.ts +632 -0
  380. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  381. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  382. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  383. package/src/prover/smt/solver/qe-lite.ts +37 -17
  384. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  385. package/src/prover/smt/solver/qe.ts +1499 -0
  386. package/src/prover/smt/solver/qel.ts +25 -0
  387. package/src/prover/smt/solver/qi-queue.ts +0 -1
  388. package/src/prover/smt/solver/qsat.ts +814 -0
  389. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  390. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  391. package/src/prover/smt/solver/quantifier-analyzer.ts +9 -10
  392. package/src/prover/smt/solver/quantifier-manager.ts +25 -24
  393. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  394. package/src/prover/smt/solver/random-gen.ts +0 -1
  395. package/src/prover/smt/solver/rational.ts +45 -1
  396. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  397. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  398. package/src/prover/smt/solver/reduce-args.ts +225 -0
  399. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  400. package/src/prover/smt/solver/ref-vector.ts +0 -1
  401. package/src/prover/smt/solver/relevancy.ts +1 -2
  402. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  403. package/src/prover/smt/solver/rewriter.ts +475 -36
  404. package/src/prover/smt/solver/rlimit.ts +38 -2
  405. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  406. package/src/prover/smt/solver/sat/big.ts +177 -0
  407. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  408. package/src/prover/smt/solver/sat/clause.ts +203 -0
  409. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  410. package/src/prover/smt/solver/sat/config.ts +122 -0
  411. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  412. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  413. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  414. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  415. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  416. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  417. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  418. package/src/prover/smt/solver/sat/probing.ts +170 -0
  419. package/src/prover/smt/solver/sat/sat-tactic.ts +44 -0
  420. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  421. package/src/prover/smt/solver/sat/scc.ts +142 -0
  422. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  423. package/src/prover/smt/solver/sat/solver.ts +2105 -0
  424. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  425. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  426. package/src/prover/smt/solver/search-tree.ts +284 -0
  427. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  428. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  429. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  430. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  431. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  432. package/src/prover/smt/solver/seq-factory.ts +89 -0
  433. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  434. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  435. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  436. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  437. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  438. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  439. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  440. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  441. package/src/prover/smt/solver/seq-subset.ts +165 -0
  442. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  443. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  444. package/src/prover/smt/solver/smt-kernel.ts +90 -0
  445. package/src/prover/smt/solver/smt-logics.ts +66 -0
  446. package/src/prover/smt/solver/smt-setup.ts +496 -0
  447. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  448. package/src/prover/smt/solver/smtlib-parser.ts +3154 -326
  449. package/src/prover/smt/solver/smtlib-script.ts +1702 -0
  450. package/src/prover/smt/solver/solve-eqs.ts +923 -0
  451. package/src/prover/smt/solver/solver.ts +113 -22
  452. package/src/prover/smt/solver/static-features.ts +314 -0
  453. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  454. package/src/prover/smt/solver/tactic.ts +1995 -0
  455. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  456. package/src/prover/smt/solver/theory-array.ts +1240 -0
  457. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  458. package/src/prover/smt/solver/theory-char.ts +355 -0
  459. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  460. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  461. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  462. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  463. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -5
  464. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -71
  465. package/src/prover/smt/solver/theory-lra-internalize.ts +89 -11
  466. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  467. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -28
  468. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  469. package/src/prover/smt/solver/theory-lra.ts +188 -2
  470. package/src/prover/smt/solver/theory-pb.ts +933 -0
  471. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  472. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  473. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  474. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  475. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  476. package/src/prover/smt/solver/theory-seq.ts +961 -0
  477. package/src/prover/smt/solver/theory.ts +189 -0
  478. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  479. package/src/prover/smt/solver/var-subst.ts +36 -14
  480. package/src/prover/smt/table.ts +3 -2
  481. package/src/prover/smt/types.ts +146 -0
  482. package/src/prover/tlapm/cache.ts +29 -8
  483. package/src/prover/tlapm-library.ts +3208 -0
  484. package/src/prover/verdict.ts +2 -0
  485. package/src/prover/zenon/decide.ts +10 -7
  486. package/src/prover/zenon/encode.ts +0 -2
  487. package/src/prover/zenon/eqrel.ts +0 -2
  488. package/src/prover/zenon/equality-rules.ts +24 -2
  489. package/src/prover/zenon/expr.ts +21 -2
  490. package/src/prover/zenon/index-table.ts +7 -4
  491. package/src/prover/zenon/isar-case.ts +1 -3
  492. package/src/prover/zenon/isar.ts +2 -4
  493. package/src/prover/zenon/llproof.ts +0 -2
  494. package/src/prover/zenon/mltoll.ts +0 -2
  495. package/src/prover/zenon/node.ts +20 -5
  496. package/src/prover/zenon/parse.ts +6 -2
  497. package/src/prover/zenon/phrase.ts +1 -3
  498. package/src/prover/zenon/proof.ts +0 -2
  499. package/src/prover/zenon/propositional-rules.ts +0 -2
  500. package/src/prover/zenon/rules.ts +2 -3
  501. package/src/prover/zenon/search.ts +7 -5
  502. package/src/prover/zenon/tla/functions.ts +0 -2
  503. package/src/prover/zenon/tla/llproof.ts +0 -2
  504. package/src/prover/zenon/tla/records.ts +0 -2
  505. package/src/prover/zenon/tla/rewrites.ts +0 -2
  506. package/src/prover/zenon/tla/sets.ts +7 -8
  507. package/src/prover/zenon/tla/terms.ts +0 -2
  508. package/src/prover/zenon/tla/tla.ts +0 -2
  509. package/src/resolve.ts +72 -36
  510. package/src/runtime.ts +6 -0
  511. package/src/sany/generation.ts +1 -13
  512. package/src/sany/generator-definitions.ts +1 -1
  513. package/src/sany/generator-expressions.ts +9 -17
  514. package/src/sany/generator-proofs.ts +1 -1
  515. package/src/sany/generator.ts +1 -1
  516. package/src/sany/levels.ts +0 -2
  517. package/src/sany/linter.ts +0 -2
  518. package/src/search.ts +198 -45
  519. package/src/simulate.ts +3 -0
  520. package/src/standard-definitions.ts +4 -0
  521. package/src/state-graph.ts +0 -2
  522. package/src/subexpressions.ts +4 -2
  523. package/src/successors.ts +1 -1
  524. package/src/symmetry.ts +2 -2
  525. package/src/tableau.ts +2 -2
  526. package/src/tlc/fingerprint.ts +81 -9
  527. package/src/tlc/jar-data.ts +12 -0
  528. package/src/tlc/order.ts +14 -3
  529. package/src/tlc/summary.ts +29 -14
  530. package/src/tlc/tlcext-operators.ts +61 -16
  531. package/src/tlc/trace-spec.ts +2 -3
  532. package/src/typed-tier.ts +6541 -0
  533. package/src/typescript/types.ts +2 -2
  534. package/src/values.ts +1 -1
  535. package/src/prover/isabelle/isar/statement.ts +0 -52
  536. package/src/prover/smt/solver/z3-license.txt +0 -10
  537. package/src/prover/tlaps-module.ts +0 -510
  538. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,995 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ KIND_APP,
5
+ OP_ADD,
6
+ OP_CHAR_IS_DIGIT,
7
+ OP_CHAR_LE,
8
+ OP_CHAR_TO_INT,
9
+ OP_EQ,
10
+ OP_GE,
11
+ OP_LE,
12
+ OP_MUL,
13
+ OP_NOT,
14
+ OP_SEQ_AT,
15
+ OP_SEQ_CONCAT,
16
+ OP_SEQ_CONTAINS,
17
+ OP_SEQ_EMPTY,
18
+ OP_SEQ_EXTRACT,
19
+ OP_SEQ_INDEX,
20
+ OP_SEQ_LENGTH,
21
+ OP_SEQ_NTH_I,
22
+ OP_SEQ_POWER,
23
+ OP_SEQ_PREFIX,
24
+ OP_SEQ_UNIT,
25
+ OP_STRING_FROM_CODE,
26
+ OP_STRING_LT,
27
+ OP_STRING_STOI,
28
+ OP_STRING_TO_CODE,
29
+ OP_SUB,
30
+ SORT_BOOL,
31
+ SORT_INT,
32
+ } from "./ast";
33
+ import { FALSE_LITERAL, type Literal, TRUE_LITERAL, negate } from "./literal";
34
+ import { isBinaryApp, isEmptySeq, mkConcatOf, mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
35
+ import { SeqSkolem } from "./seq-skolem";
36
+
37
+ interface SeqAxiomsHost {
38
+ rewrite(expr: number): number;
39
+ mkEqLiteral(first: number, second: number): Literal;
40
+ ensureEnode(expr: number): void;
41
+ getLiteral(expr: number): Literal;
42
+ forcePhase(literal: Literal): void;
43
+ addAxiom(literals: Literal[]): void;
44
+ pushTrail(undo: () => void): void;
45
+ }
46
+
47
+ export const getMinLengthOf = (manager: AstManager, seq: number): number => {
48
+ const getLength = (expr: number) =>
49
+ manager.getOp(expr) === OP_SEQ_UNIT ? 1 : (manager.getString(expr)?.length ?? 0);
50
+ let result = 0;
51
+ let current = seq;
52
+ while (isBinaryApp(manager, current, OP_SEQ_CONCAT)) {
53
+ const first = manager.getArg(current, 0);
54
+ result +=
55
+ manager.getOp(first) === OP_SEQ_CONCAT ? getMinLengthOf(manager, first) : getLength(first);
56
+ current = manager.getArg(current, 1);
57
+ }
58
+ return result + getLength(current);
59
+ };
60
+
61
+ const UINT_MAX = 0xffffffff;
62
+
63
+ const getMaxLengthOf = (manager: AstManager, seq: number): number => {
64
+ const getLength = (expr: number) => {
65
+ if (isEmptySeq(manager, expr)) return 0;
66
+ const op = manager.getOp(expr);
67
+ if (op === OP_SEQ_UNIT || op === OP_SEQ_AT) return 1;
68
+ if (op === OP_SEQ_EXTRACT) {
69
+ const length = manager.getNumeral(manager.getArg(expr, 2));
70
+ return length !== undefined && length >= 0n && length <= BigInt(UINT_MAX)
71
+ ? Number(length)
72
+ : UINT_MAX;
73
+ }
74
+ return manager.getString(expr)?.length ?? UINT_MAX;
75
+ };
76
+ const add = (first: number, second: number) => Math.min(UINT_MAX, first + second);
77
+ let result = 0;
78
+ let current = seq;
79
+ while (isBinaryApp(manager, current, OP_SEQ_CONCAT)) {
80
+ const first = manager.getArg(current, 0);
81
+ result = add(
82
+ manager.getOp(first) === OP_SEQ_CONCAT ? getMaxLengthOf(manager, first) : getLength(first),
83
+ result,
84
+ );
85
+ current = manager.getArg(current, 1);
86
+ }
87
+ return add(getLength(current), result);
88
+ };
89
+
90
+ export class SeqAxioms {
91
+ readonly skolem: SeqSkolem;
92
+ private purified = new Map<number, number>();
93
+ private purifyTrail: number[] = [];
94
+ private isDigitsInitialized = false;
95
+
96
+ constructor(
97
+ private manager: AstManager,
98
+ private host: SeqAxiomsHost,
99
+ ) {
100
+ this.skolem = new SeqSkolem(manager, (expr) => host.rewrite(expr));
101
+ }
102
+
103
+ private mkInt(value: number | bigint) {
104
+ return this.manager.mkNumeral(BigInt(value));
105
+ }
106
+
107
+ private mkArith(op: number, args: number[]) {
108
+ return this.manager.mkApp(op, args, op === OP_GE || op === OP_LE ? SORT_BOOL : SORT_INT);
109
+ }
110
+
111
+ private mkSeq(op: number, args: number[]) {
112
+ return mkSeqApp(this.manager, op, args);
113
+ }
114
+
115
+ private mkEq(first: number, second: number) {
116
+ return this.manager.mkApp(OP_EQ, [first, second], SORT_BOOL);
117
+ }
118
+
119
+ rewrite(expr: number) {
120
+ return this.host.rewrite(expr);
121
+ }
122
+
123
+ mkNot(expr: number) {
124
+ const manager = this.manager;
125
+ return manager.isNot(expr) ? manager.getArg(expr, 0) : manager.mkApp(OP_NOT, [expr], SORT_BOOL);
126
+ }
127
+
128
+ private mkConcat(...args: number[]) {
129
+ return mkConcatOf(this.manager, args, this.manager.sorts[args[0]]);
130
+ }
131
+
132
+ private mkNth(seq: number, index: number) {
133
+ return this.mkSeq(OP_SEQ_NTH_I, [seq, this.mkInt(index)]);
134
+ }
135
+
136
+ private mkUnit(expr: number) {
137
+ return this.mkSeq(OP_SEQ_UNIT, [expr]);
138
+ }
139
+
140
+ private mkEmpty(sort: number) {
141
+ return mkEmptySeq(this.manager, sort);
142
+ }
143
+
144
+ mkSub(first: number, second: number) {
145
+ return this.host.rewrite(this.mkArith(OP_SUB, [first, second]));
146
+ }
147
+
148
+ private mkGeE(first: number, second: number) {
149
+ return this.host.rewrite(this.mkArith(OP_GE, [first, second]));
150
+ }
151
+
152
+ private mkLeE(first: number, second: number) {
153
+ return this.host.rewrite(this.mkArith(OP_LE, [first, second]));
154
+ }
155
+
156
+ mkGe(expr: number, bound: number | bigint) {
157
+ return this.mkGeE(expr, this.mkInt(bound));
158
+ }
159
+
160
+ mkLe(expr: number, bound: number | bigint) {
161
+ return this.mkLeE(expr, this.mkInt(bound));
162
+ }
163
+
164
+ private mkSeqEq(first: number, second: number) {
165
+ const result = this.skolem.mkEq(first, second);
166
+ this.host.forcePhase(this.mkLiteral(result));
167
+ return result;
168
+ }
169
+
170
+ private mkEqEmpty(expr: number) {
171
+ return this.mkSeqEq(this.mkEmpty(this.manager.sorts[expr]), expr);
172
+ }
173
+
174
+ private mkLenAxiom(seq: number) {
175
+ const length = this.mkSeq(OP_SEQ_LENGTH, [seq]);
176
+ const result = this.host.rewrite(length);
177
+ if (result !== length) this.addClause([this.mkEq(length, result)]);
178
+ return result;
179
+ }
180
+
181
+ private purify(expr: number) {
182
+ const manager = this.manager;
183
+ if (manager.depths[expr] === 1 || manager.isValue(expr)) return expr;
184
+ if (this.host.rewrite(expr) === expr) return expr;
185
+ let result = this.purified.get(expr);
186
+ if (result === undefined) {
187
+ if (this.purifyTrail.length === 4000) {
188
+ const kept = this.purifyTrail.slice(2000);
189
+ for (const dropped of this.purifyTrail.slice(0, 2000)) manager.decRef(dropped);
190
+ this.purified.clear();
191
+ for (let index = 0; index < 2000; index += 2)
192
+ this.purified.set(kept[index], kept[index + 1]);
193
+ this.purifyTrail = kept;
194
+ }
195
+ result = manager.mkFreshConst("seq.purify", manager.sorts[expr]);
196
+ manager.incRef(expr);
197
+ manager.incRef(result);
198
+ this.purified.set(expr, result);
199
+ this.purifyTrail.push(expr, result);
200
+ }
201
+ this.addClause([this.mkEq(result, expr)]);
202
+ return result;
203
+ }
204
+
205
+ mkLiteral(input: number): Literal {
206
+ const manager = this.manager;
207
+ if (manager.isNot(input)) return negate(this.mkLiteral(manager.getArg(input, 0)));
208
+ if (manager.getOp(input) === OP_EQ)
209
+ return this.host.mkEqLiteral(manager.getArg(input, 0), manager.getArg(input, 1));
210
+ const expr =
211
+ manager.kinds[input] === KIND_APP && manager.getFamily(input) === FAMILY_ARITH
212
+ ? this.host.rewrite(input)
213
+ : input;
214
+ this.host.ensureEnode(expr);
215
+ return this.host.getLiteral(expr);
216
+ }
217
+
218
+ private addClause(clause: number[]) {
219
+ const literals: Literal[] = [];
220
+ for (const expr of clause) {
221
+ const literal = this.mkLiteral(expr);
222
+ if (literal === TRUE_LITERAL) return;
223
+ if (literal !== FALSE_LITERAL) literals.push(this.mkLiteral(expr));
224
+ }
225
+ this.host.addAxiom(literals);
226
+ }
227
+
228
+ isDigit(char: number) {
229
+ return this.mkSeq(OP_CHAR_IS_DIGIT, [char]);
230
+ }
231
+
232
+ private mkDigit2int(char: number) {
233
+ this.ensureDigitAxiom();
234
+ return this.skolem.mkDigit2int(char);
235
+ }
236
+
237
+ private ensureDigitAxiom() {
238
+ if (this.isDigitsInitialized) return;
239
+ for (let digit = 0; digit < 10; digit++) {
240
+ const value = this.skolem.mkDigit2int(this.manager.mkChar(48 + digit));
241
+ this.host.addAxiom([this.host.mkEqLiteral(value, this.mkInt(digit))]);
242
+ }
243
+ this.host.pushTrail(() => {
244
+ this.isDigitsInitialized = false;
245
+ });
246
+ this.isDigitsInitialized = true;
247
+ }
248
+
249
+ extractAxiom(expr: number) {
250
+ const manager = this.manager;
251
+ const [seqArg, indexArg, lengthArg] = manager.getArgs(expr);
252
+ const seq = this.purify(seqArg);
253
+ const index = this.purify(indexArg);
254
+ const length = this.purify(lengthArg);
255
+ if (this.smallSegmentAxiom(expr, seqArg, indexArg, lengthArg)) return;
256
+ if (this.isTail(seq, indexArg, lengthArg)) {
257
+ this.tailAxiom(expr, seq);
258
+ return;
259
+ }
260
+ if (this.isDropLast(seq, indexArg, lengthArg)) {
261
+ this.dropLastAxiom(expr, seq);
262
+ return;
263
+ }
264
+ if (manager.getNumeral(indexArg) === 0n) {
265
+ this.extractPrefixAxiom(expr, seq, length);
266
+ return;
267
+ }
268
+ if (this.isExtractSuffix(seq, indexArg, lengthArg)) {
269
+ this.extractSuffixAxiom(expr, seq, index);
270
+ return;
271
+ }
272
+ const skolem = this.skolem;
273
+ const prefix = skolem.mkPre(seq, index);
274
+ const seqLength = this.mkLenAxiom(seqArg);
275
+ const prefixLength = this.mkLenAxiom(prefix);
276
+ const exprLength = this.mkLenAxiom(expr);
277
+ const remaining = this.mkSub(this.mkSub(seqLength, indexArg), lengthArg);
278
+ const suffix = skolem.mkPost(seq, this.mkArith(OP_ADD, [index, length]));
279
+ this.mkConcat(prefix, expr);
280
+ const whole = this.mkConcat(prefix, expr, suffix);
281
+ const zero = this.mkInt(0);
282
+ const isIndexNonNegative = this.mkGe(indexArg, 0);
283
+ const isIndexAtMostLength = this.mkLe(this.mkSub(indexArg, seqLength), 0);
284
+ const isLengthAtMostIndex = this.mkLe(this.mkSub(seqLength, indexArg), 0);
285
+ const isRemainingNonNegative = this.mkGe(remaining, 0);
286
+ const isLengthNonNegative = this.mkGe(length, 0);
287
+ const isLengthNonPositive = this.mkLe(length, 0);
288
+ const isSeqLengthNonPositive = this.mkLe(seqLength, 0);
289
+ const isExprEmpty = this.mkEq(exprLength, zero);
290
+ const isIndexNegative = this.mkNot(isIndexNonNegative);
291
+ const isIndexAboveLength = this.mkNot(isIndexAtMostLength);
292
+ const isLengthNegative = this.mkNot(isLengthNonNegative);
293
+ this.addClause([
294
+ isIndexNegative,
295
+ isIndexAboveLength,
296
+ isLengthNegative,
297
+ this.mkSeqEq(whole, seq),
298
+ ]);
299
+ this.addClause([isIndexNegative, isIndexAboveLength, this.mkEq(prefixLength, index)]);
300
+ const isRemainingNegative = this.mkNot(isRemainingNonNegative);
301
+ this.addClause([
302
+ isIndexNegative,
303
+ isIndexAboveLength,
304
+ isLengthNegative,
305
+ isRemainingNegative,
306
+ this.mkEq(exprLength, length),
307
+ ]);
308
+ this.addClause([
309
+ isIndexNegative,
310
+ isIndexAboveLength,
311
+ isLengthNegative,
312
+ isRemainingNonNegative,
313
+ this.mkEq(exprLength, this.mkSub(seqLength, index)),
314
+ ]);
315
+ this.addClause([isIndexNonNegative, isExprEmpty]);
316
+ this.addClause([this.mkNot(isLengthAtMostIndex), isExprEmpty]);
317
+ this.addClause([this.mkNot(isSeqLengthNonPositive), isExprEmpty]);
318
+ this.addClause([this.mkNot(isLengthNonPositive), isExprEmpty]);
319
+ this.addClause([
320
+ this.mkNot(isExprEmpty),
321
+ isIndexNegative,
322
+ isLengthAtMostIndex,
323
+ isSeqLengthNonPositive,
324
+ isLengthNonPositive,
325
+ ]);
326
+ }
327
+
328
+ private tailAxiom(expr: number, seq: number) {
329
+ const parts = this.skolem.decompose(seq);
330
+ const isEmpty = this.mkEqEmpty(seq);
331
+ this.addClause([isEmpty, this.mkSeqEq(seq, this.mkConcat(parts.head, expr))]);
332
+ this.addClause([this.mkNot(isEmpty), this.mkEqEmpty(expr)]);
333
+ }
334
+
335
+ private dropLastAxiom(expr: number, seq: number) {
336
+ const isEmpty = this.mkEqEmpty(seq);
337
+ this.addClause([
338
+ isEmpty,
339
+ this.mkSeqEq(seq, this.mkConcat(expr, this.mkUnit(this.skolem.mkLast(seq)))),
340
+ ]);
341
+ this.addClause([this.mkNot(isEmpty), this.mkEqEmpty(expr)]);
342
+ }
343
+
344
+ private isDropLast(seq: number, index: number, length: number) {
345
+ if (this.manager.getNumeral(index) !== 0n) return false;
346
+ const seqLength = this.mkLenAxiom(seq);
347
+ const expected = this.mkSub(seqLength, this.mkInt(1));
348
+ return this.host.rewrite(length) === this.host.rewrite(expected);
349
+ }
350
+
351
+ private smallSegmentAxiom(expr: number, seq: number, index: number, length: number) {
352
+ const start = this.manager.getNumeral(index);
353
+ const count = this.manager.getNumeral(length);
354
+ if (start === undefined || start < 0n || count === undefined || count > 5n) return false;
355
+ const elements: number[] = [];
356
+ for (let offset = 0n; offset < count; offset++)
357
+ elements.push(
358
+ this.mkSeq(OP_SEQ_AT, [seq, this.mkArith(OP_ADD, [index, this.mkInt(offset)])]),
359
+ );
360
+ const result = mkConcatOf(this.manager, elements, this.manager.sorts[seq]);
361
+ this.addClause([this.mkSeqEq(result, expr)]);
362
+ return true;
363
+ }
364
+
365
+ private isTail(seq: number, index: number, length: number) {
366
+ if (this.manager.getNumeral(index) !== 1n) return false;
367
+ const seqLength = this.mkLenAxiom(seq);
368
+ const expected = this.mkSub(seqLength, this.mkInt(1));
369
+ return this.host.rewrite(length) === this.host.rewrite(expected);
370
+ }
371
+
372
+ private isExtractSuffix(seq: number, index: number, length: number) {
373
+ const sum = this.host.rewrite(this.mkArith(OP_ADD, [length, index]));
374
+ return this.manager.getOp(sum) === OP_SEQ_LENGTH && this.manager.getArg(sum, 0) === seq;
375
+ }
376
+
377
+ private extractPrefixAxiom(expr: number, seq: number, length: number) {
378
+ const exprLength = this.mkLenAxiom(expr);
379
+ const seqLength = this.mkLenAxiom(seq);
380
+ this.mkSub(seqLength, length);
381
+ const suffix = this.skolem.mkPost(seq, length);
382
+ const whole = this.mkConcat(expr, suffix);
383
+ const isWithin = this.mkLe(this.mkSub(length, seqLength), 0);
384
+ this.addClause([this.mkSeqEq(seq, whole)]);
385
+ const isPositive = this.mkNot(this.mkLe(length, 0));
386
+ this.addClause([isPositive, this.mkEqEmpty(expr)]);
387
+ const isNegative = this.mkNot(this.mkGe(length, 0));
388
+ const isAbove = this.mkNot(isWithin);
389
+ this.addClause([isNegative, isAbove, this.mkEq(exprLength, length)]);
390
+ this.addClause([isWithin, this.mkEq(expr, seq)]);
391
+ }
392
+
393
+ private extractSuffixAxiom(expr: number, seq: number, index: number) {
394
+ const prefix = this.skolem.mkPre(seq, index);
395
+ const prefixLength = this.mkLenAxiom(prefix);
396
+ const seqLength = this.mkLenAxiom(seq);
397
+ const whole = this.mkConcat(prefix, expr);
398
+ const isEmpty = this.mkEqEmpty(expr);
399
+ const isIndexNonNegative = this.mkGe(index, 0);
400
+ const isIndexWithin = this.mkLe(this.mkSub(index, seqLength), 0);
401
+ this.addClause([this.mkEq(seq, whole)]);
402
+ this.addClause([
403
+ this.mkNot(isIndexNonNegative),
404
+ this.mkNot(isIndexWithin),
405
+ this.mkEq(index, prefixLength),
406
+ ]);
407
+ this.addClause([isIndexNonNegative, isEmpty]);
408
+ this.addClause([isIndexWithin, isEmpty]);
409
+ }
410
+
411
+ private tightestPrefix(pattern: number, prefix: number) {
412
+ const isEmpty = this.mkEqEmpty(pattern);
413
+ if (getMaxLengthOf(this.manager, pattern) <= 1) {
414
+ this.addClause([isEmpty, this.mkNot(this.mkSeq(OP_SEQ_CONTAINS, [prefix, pattern]))]);
415
+ return;
416
+ }
417
+ const first = this.skolem.mkFirst(pattern);
418
+ const last = this.skolem.mkLast(pattern);
419
+ const whole = this.mkConcat(first, this.mkUnit(last));
420
+ this.addClause([isEmpty, this.mkSeqEq(pattern, whole)]);
421
+ this.addClause([
422
+ isEmpty,
423
+ this.mkNot(this.mkSeq(OP_SEQ_CONTAINS, [this.mkConcat(prefix, first), pattern])),
424
+ ]);
425
+ }
426
+
427
+ indexofAxiom(index: number) {
428
+ const manager = this.manager;
429
+ const args = manager.getArgs(index);
430
+ const minusOne = this.mkInt(-1);
431
+ const zero = this.mkInt(0);
432
+ const offset = args.length > 2 ? this.purify(args[2]) : undefined;
433
+ const pattern = this.purify(args[1]);
434
+ const text = this.purify(args[0]);
435
+ const contains = this.mkSeq(OP_SEQ_CONTAINS, [text, pattern]);
436
+ const isMinusOne = this.mkEq(index, minusOne);
437
+ const isZero = this.mkEq(index, zero);
438
+ const isPatternEmpty = this.mkEq(pattern, this.mkEmpty(manager.sorts[pattern]));
439
+ const isTextEmpty = this.mkEqEmpty(text);
440
+ this.addClause([this.mkGe(index, -1)]);
441
+ this.addClause([contains, isMinusOne]);
442
+ this.addClause([this.mkNot(isTextEmpty), isPatternEmpty, isMinusOne]);
443
+ const skolem = this.skolem;
444
+ if (offset === undefined || manager.getNumeral(offset) === 0n) {
445
+ this.addClause([this.mkNot(isPatternEmpty), isZero]);
446
+ const left = skolem.mkIndexofLeft(text, pattern);
447
+ const right = skolem.mkIndexofRight(text, pattern);
448
+ const whole = this.mkConcat(left, pattern, right);
449
+ const leftLength = this.mkLenAxiom(left);
450
+ this.addClause([this.mkNot(contains), isPatternEmpty, this.mkSeqEq(text, whole)]);
451
+ const notContains = this.mkNot(contains);
452
+ this.addClause([notContains, isPatternEmpty, this.mkEq(index, leftLength)]);
453
+ const notContainsAgain = this.mkNot(contains);
454
+ this.addClause([notContainsAgain, this.mkGe(index, 0)]);
455
+ this.tightestPrefix(pattern, left);
456
+ return;
457
+ }
458
+ const textLength = this.mkLenAxiom(text);
459
+ const isOffsetAtLeastLength = this.mkGe(this.mkSub(offset, textLength), 0);
460
+ const isOffsetAtMostLength = this.mkLe(this.mkSub(offset, textLength), 0);
461
+ const isIndexOffset = this.mkEq(index, offset);
462
+ this.addClause([this.mkNot(isOffsetAtLeastLength), isPatternEmpty, isMinusOne]);
463
+ this.addClause([isOffsetAtMostLength, isMinusOne]);
464
+ this.addClause([
465
+ this.mkNot(isOffsetAtLeastLength),
466
+ this.mkNot(isOffsetAtMostLength),
467
+ this.mkNot(isPatternEmpty),
468
+ isIndexOffset,
469
+ ]);
470
+ const left = skolem.mkIndexofLeft(text, pattern, offset);
471
+ const right = skolem.mkIndexofRight(text, pattern, offset);
472
+ const indexof0 = this.mkSeq(OP_SEQ_INDEX, [right, pattern, zero]);
473
+ const shifted = this.mkArith(OP_ADD, [offset, indexof0]);
474
+ const isOffsetNonNegative = this.mkGe(offset, 0);
475
+ this.addClause([
476
+ this.mkNot(isOffsetNonNegative),
477
+ isOffsetAtLeastLength,
478
+ this.mkSeqEq(text, this.mkConcat(left, right)),
479
+ ]);
480
+ const notNonNegative = this.mkNot(isOffsetNonNegative);
481
+ this.addClause([
482
+ notNonNegative,
483
+ isOffsetAtLeastLength,
484
+ this.mkEq(this.mkLenAxiom(left), offset),
485
+ ]);
486
+ const notNonNegativeAgain = this.mkNot(isOffsetNonNegative);
487
+ this.addClause([
488
+ notNonNegativeAgain,
489
+ isOffsetAtLeastLength,
490
+ this.mkNot(this.mkEq(indexof0, minusOne)),
491
+ isMinusOne,
492
+ ]);
493
+ const isOffsetNegative = this.mkNot(isOffsetNonNegative);
494
+ const isIndexof0Negative = this.mkNot(this.mkGe(indexof0, 0));
495
+ this.addClause([
496
+ isOffsetNegative,
497
+ isOffsetAtLeastLength,
498
+ isIndexof0Negative,
499
+ this.mkEq(shifted, index),
500
+ ]);
501
+ this.addClause([isOffsetNonNegative, isMinusOne]);
502
+ }
503
+
504
+ lastIndexofAxiom(index: number) {
505
+ const manager = this.manager;
506
+ const [textArg, patternArg] = manager.getArgs(index);
507
+ const text = this.purify(textArg);
508
+ const pattern = this.purify(patternArg);
509
+ const minusOne = this.mkInt(-1);
510
+ const zero = this.mkInt(0);
511
+ const skolem = this.skolem;
512
+ const left = skolem.mkLastIndexofLeft(text, pattern);
513
+ const right = skolem.mkLastIndexofRight(text, pattern);
514
+ const parts = skolem.decompose(pattern);
515
+ const contains = this.mkSeq(OP_SEQ_CONTAINS, [text, pattern]);
516
+ const containsTail = this.mkSeq(OP_SEQ_CONTAINS, [this.mkConcat(parts.tail, right), pattern]);
517
+ const isMinusOne = this.mkEq(index, minusOne);
518
+ this.mkEq(index, zero);
519
+ const isPatternEmpty = this.mkEqEmpty(pattern);
520
+ const isTextEmpty = this.mkEqEmpty(text);
521
+ const whole = this.mkConcat(left, pattern, right);
522
+ this.addClause([contains, isMinusOne]);
523
+ this.addClause([this.mkNot(isTextEmpty), isPatternEmpty, isMinusOne]);
524
+ this.addClause([this.mkNot(isPatternEmpty), this.mkEq(index, this.mkLenAxiom(text))]);
525
+ this.addClause([isTextEmpty, this.mkNot(contains), this.mkSeqEq(text, whole)]);
526
+ const notContains = this.mkNot(contains);
527
+ this.addClause([isTextEmpty, notContains, this.mkEq(index, this.mkLenAxiom(left))]);
528
+ this.addClause([isPatternEmpty, this.mkEq(pattern, this.mkConcat(parts.head, parts.tail))]);
529
+ this.addClause([isPatternEmpty, this.mkNot(containsTail)]);
530
+ }
531
+
532
+ replaceAxiom(replace: number) {
533
+ const manager = this.manager;
534
+ const [source, patternArg, targetArg] = manager.getArgs(replace);
535
+ const text = this.purify(source);
536
+ const pattern = this.purify(patternArg);
537
+ const target = this.purify(targetArg);
538
+ const skolem = this.skolem;
539
+ const left = skolem.mkIndexofLeft(text, pattern);
540
+ const right = skolem.mkIndexofRight(text, pattern);
541
+ const replaced = this.mkConcat(left, target, right);
542
+ const whole = this.mkConcat(left, pattern, right);
543
+ const isTextEmpty = this.mkEqEmpty(text);
544
+ const isPatternEmpty = this.mkEqEmpty(pattern);
545
+ const contains = this.mkSeq(OP_SEQ_CONTAINS, [text, pattern]);
546
+ this.addClause([
547
+ this.mkNot(isPatternEmpty),
548
+ this.mkSeqEq(replace, this.mkConcat(target, text)),
549
+ ]);
550
+ this.addClause([this.mkNot(isTextEmpty), isPatternEmpty, this.mkSeqEq(replace, text)]);
551
+ this.addClause([contains, this.mkSeqEq(replace, text)]);
552
+ this.addClause([this.mkNot(contains), isTextEmpty, isPatternEmpty, this.mkSeqEq(text, whole)]);
553
+ const notContains = this.mkNot(contains);
554
+ this.addClause([notContains, isTextEmpty, isPatternEmpty, this.mkSeqEq(replace, replaced)]);
555
+ this.tightestPrefix(pattern, left);
556
+ }
557
+
558
+ atAxiom(expr: number) {
559
+ const manager = this.manager;
560
+ const [seqArg, indexArg] = manager.getArgs(expr);
561
+ const seq = this.purify(seqArg);
562
+ const index = this.purify(indexArg);
563
+ this.mkInt(0);
564
+ const one = this.mkInt(1);
565
+ const empty = this.mkEmpty(manager.sorts[expr]);
566
+ this.mkLenAxiom(seq);
567
+ const isIndexNonNegative = this.mkGe(index, 0);
568
+ const isIndexBeyond = this.mkGe(this.mkSub(index, this.mkLenAxiom(seq)), 0);
569
+ const exprLength = this.mkLenAxiom(expr);
570
+ const value = manager.getNumeral(index);
571
+ if (value !== undefined && value >= 0n && value <= BigInt(UINT_MAX)) {
572
+ const elements: number[] = [];
573
+ for (let offset = 0; offset <= Number(value); offset++)
574
+ elements.push(this.mkUnit(this.mkNth(seq, offset)));
575
+ const nth = elements[elements.length - 1];
576
+ elements.push(this.skolem.mkTail(seq, index));
577
+ this.addClause([
578
+ this.mkNot(isIndexNonNegative),
579
+ isIndexBeyond,
580
+ this.mkSeqEq(seq, mkConcatOf(manager, elements, manager.sorts[expr])),
581
+ ]);
582
+ const isNegative = this.mkNot(isIndexNonNegative);
583
+ this.addClause([isNegative, isIndexBeyond, this.mkSeqEq(nth, expr)]);
584
+ } else {
585
+ const prefix = this.skolem.mkPre(seq, index);
586
+ const suffix = this.skolem.mkTail(seq, index);
587
+ const whole = this.mkConcat(prefix, expr, suffix);
588
+ const prefixLength = this.mkLenAxiom(prefix);
589
+ this.addClause([this.mkNot(isIndexNonNegative), isIndexBeyond, this.mkSeqEq(seq, whole)]);
590
+ const isNegative = this.mkNot(isIndexNonNegative);
591
+ this.addClause([isNegative, isIndexBeyond, this.mkEq(index, prefixLength)]);
592
+ }
593
+ this.addClause([isIndexNonNegative, this.mkEq(expr, empty)]);
594
+ const isNotBeyond = this.mkNot(isIndexBeyond);
595
+ this.addClause([isNotBeyond, this.mkEq(expr, empty)]);
596
+ this.addClause([this.mkNot(isIndexNonNegative), isIndexBeyond, this.mkEq(one, exprLength)]);
597
+ this.addClause([this.mkLe(exprLength, 1)]);
598
+ }
599
+
600
+ nthAxiom(expr: number) {
601
+ const manager = this.manager;
602
+ const [seq, index] = manager.getArgs(expr);
603
+ const chars = manager.getString(seq);
604
+ const value = manager.getNumeral(index);
605
+ if (chars !== undefined && value !== undefined && value >= 0n && value < BigInt(chars.length)) {
606
+ this.addClause([this.mkEq(manager.mkChar(chars[Number(value)]), expr)]);
607
+ return;
608
+ }
609
+ const zero = this.mkInt(0);
610
+ const isIndexNonNegative = this.mkGe(index, 0);
611
+ const isIndexBeyond = this.mkGe(this.mkSub(index, this.mkLenAxiom(seq)), 0);
612
+ const unit = this.mkUnit(expr);
613
+ const at =
614
+ manager.getOp(seq) !== OP_SEQ_AT || zero !== index
615
+ ? this.mkSeq(OP_SEQ_AT, [seq, index])
616
+ : seq;
617
+ const rhs = this.host.rewrite(at);
618
+ this.addClause([this.mkNot(isIndexNonNegative), isIndexBeyond, this.mkEq(unit, rhs)]);
619
+ }
620
+
621
+ itosAxiom(expr: number) {
622
+ const manager = this.manager;
623
+ const number = manager.getArg(expr, 0);
624
+ const zero = this.mkInt(0);
625
+ const isEmpty = this.mkEq(expr, this.mkEmpty(manager.sorts[expr]));
626
+ const isNonNegative = this.mkGe(number, 0);
627
+ this.addClause([this.mkNot(isEmpty), this.mkNot(isNonNegative)]);
628
+ this.addClause([isEmpty, isNonNegative]);
629
+ this.addClause([this.mkGe(this.mkLenAxiom(expr), 0)]);
630
+ const stoi = this.mkSeq(OP_STRING_STOI, [expr]);
631
+ const isInverse = this.mkEq(stoi, number);
632
+ this.addClause([this.mkNot(isNonNegative), isInverse]);
633
+ this.host.forcePhase(this.mkLiteral(isInverse));
634
+ const zeroString = this.host.rewrite(manager.mkString([48]));
635
+ const isZero = this.mkEq(number, zero);
636
+ const isAtZero = this.mkEq(this.mkSeq(OP_SEQ_AT, [expr, zero]), zeroString);
637
+ this.addClause([isZero, this.mkNot(isAtZero)]);
638
+ this.addClause([this.mkNot(isZero), this.mkEq(expr, zeroString)]);
639
+ }
640
+
641
+ stoiAxiom(expr: number) {
642
+ const manager = this.manager;
643
+ const isNonNegative = this.mkGe(expr, 0);
644
+ const seq = manager.getArg(expr, 0);
645
+ this.addClause([this.mkGe(expr, -1)]);
646
+ const stoiEmpty = this.mkSeq(OP_STRING_STOI, [this.mkEmpty(manager.sorts[seq])]);
647
+ this.addClause([this.mkEq(stoiEmpty, this.mkInt(-1))]);
648
+ const isNegative = this.mkNot(isNonNegative);
649
+ this.addClause([isNegative, this.isDigit(this.mkNth(seq, 0))]);
650
+ this.addClause([isNegative, this.mkGe(this.mkLenAxiom(seq), 1)]);
651
+ }
652
+
653
+ stoiAxiomOf(expr: number, limit: number) {
654
+ const seq = this.host.rewrite(this.manager.getArg(expr, 0));
655
+ const stoi = (index: number) => this.skolem.mk("seq.stoi", [seq, this.mkInt(index)], SORT_INT);
656
+ const digit = (index: number) => this.mkDigit2int(this.mkNth(seq, index));
657
+ const isDigitAt = (index: number) => this.isDigit(this.mkNth(seq, index));
658
+ const length = this.mkLenAxiom(seq);
659
+ const isNonNegative = this.mkGe(expr, 0);
660
+ const isShort = this.mkLe(length, limit);
661
+ this.addClause([this.mkNot(isShort), this.mkEq(expr, stoi(limit - 1))]);
662
+ {
663
+ const isEmpty = this.mkLe(length, 0);
664
+ const isNotDigit = this.mkNot(isDigitAt(0));
665
+ const value = stoi(0);
666
+ this.addClause([isEmpty, isNotDigit, this.mkEq(value, digit(0))]);
667
+ }
668
+ {
669
+ const isEmpty = this.mkLe(length, 0);
670
+ const isDigitFirst = isDigitAt(0);
671
+ const value = stoi(0);
672
+ this.addClause([isEmpty, isDigitFirst, this.mkEq(value, this.mkInt(-1))]);
673
+ }
674
+ for (let index = 1; index < limit; index++) {
675
+ {
676
+ const isLonger = this.mkNot(this.mkLe(length, index));
677
+ const value = stoi(index);
678
+ this.addClause([isLonger, this.mkEq(value, stoi(index - 1))]);
679
+ }
680
+ {
681
+ const isShortEnough = this.mkLe(length, index);
682
+ const isPreviousNegative = this.mkNot(this.mkGe(stoi(index - 1), 0));
683
+ const isNotDigit = this.mkNot(isDigitAt(index));
684
+ const value = stoi(index);
685
+ const ten = this.mkInt(10);
686
+ const previous = stoi(index - 1);
687
+ const scaled = this.mkArith(OP_MUL, [ten, previous]);
688
+ this.addClause([
689
+ isShortEnough,
690
+ isPreviousNegative,
691
+ isNotDigit,
692
+ this.mkEq(value, this.mkArith(OP_ADD, [scaled, digit(index)])),
693
+ ]);
694
+ }
695
+ {
696
+ const isShortEnough = this.mkLe(length, index);
697
+ const isDigitHere = isDigitAt(index);
698
+ const value = stoi(index);
699
+ this.addClause([isShortEnough, isDigitHere, this.mkEq(value, this.mkInt(-1))]);
700
+ }
701
+ {
702
+ const isShortEnough = this.mkLe(length, index);
703
+ const isPreviousNonNegative = this.mkGe(stoi(index - 1), 0);
704
+ const value = stoi(index);
705
+ this.addClause([isShortEnough, isPreviousNonNegative, this.mkEq(value, this.mkInt(-1))]);
706
+ }
707
+ {
708
+ const isNegative = this.mkNot(isNonNegative);
709
+ const isShortEnough = this.mkLe(length, index);
710
+ this.addClause([isNegative, isShortEnough, isDigitAt(index)]);
711
+ }
712
+ }
713
+ }
714
+
715
+ itosAxiomOf(expr: number, limit: number) {
716
+ const number = this.manager.getArg(expr, 0);
717
+ const length = this.mkLenAxiom(expr);
718
+ {
719
+ const isAtLeastTen = this.mkGe(number, 10);
720
+ this.addClause([isAtLeastTen, this.mkLe(length, 1)]);
721
+ }
722
+ {
723
+ const isNegative = this.mkLe(number, -1);
724
+ this.addClause([isNegative, this.mkGe(length, 1)]);
725
+ }
726
+ let low = 1n;
727
+ for (let index = 1; index <= limit; index++) {
728
+ low *= 10n;
729
+ {
730
+ const isAtLeastLow = this.mkGe(number, low);
731
+ this.addClause([isAtLeastLow, this.mkLe(length, index)]);
732
+ }
733
+ {
734
+ const isBelowLow = this.mkLe(number, low - 1n);
735
+ this.addClause([isBelowLow, this.mkGe(length, index + 1)]);
736
+ }
737
+ }
738
+ }
739
+
740
+ ltAxiom(expr: number) {
741
+ const manager = this.manager;
742
+ const [firstArg, secondArg] = manager.getArgs(expr);
743
+ const first = this.purify(firstArg);
744
+ const second = this.purify(secondArg);
745
+ const charSort = manager.getSeqElementSort(manager.sorts[first]);
746
+ const lt = expr;
747
+ const gt = this.mkSeq(OP_STRING_LT, [second, first]);
748
+ const skolem = this.skolem;
749
+ const x = skolem.mk("str.<.x", [first, second]);
750
+ const y = skolem.mk("str.<.y", [first, second]);
751
+ const z = skolem.mk("str.<.z", [first, second]);
752
+ const c = skolem.mk("str.<.c", [first, second], charSort);
753
+ const d = skolem.mk("str.<.d", [first, second], charSort);
754
+ const xcy = this.mkConcat(x, this.mkUnit(c), y);
755
+ const xdz = this.mkConcat(x, this.mkUnit(d), z);
756
+ const eq = this.mkEq(first, second);
757
+ const prefix21 = this.mkSeq(OP_SEQ_PREFIX, [second, first]);
758
+ const prefix12 = this.mkSeq(OP_SEQ_PREFIX, [first, second]);
759
+ const isFirstXcy = this.mkEq(first, xcy);
760
+ const isSecondXdz = this.mkEq(second, xdz);
761
+ const isCLessD = this.mkNot(this.mkSeq(OP_CHAR_LE, [d, c]));
762
+ const isDLessC = this.mkNot(this.mkSeq(OP_CHAR_LE, [c, d]));
763
+ this.addClause([this.mkNot(lt), prefix12, isSecondXdz]);
764
+ this.addClause([this.mkNot(lt), prefix12, isFirstXcy]);
765
+ this.addClause([this.mkNot(lt), prefix12, isCLessD]);
766
+ this.addClause([lt, prefix21, isFirstXcy]);
767
+ this.addClause([lt, prefix21, isDLessC]);
768
+ this.addClause([lt, prefix21, isSecondXdz]);
769
+ this.addClause([this.mkNot(eq), this.mkNot(lt)]);
770
+ this.addClause([eq, lt, gt]);
771
+ }
772
+
773
+ leAxiom(expr: number) {
774
+ const [first, second] = this.manager.getArgs(expr);
775
+ const lt = this.mkSeq(OP_STRING_LT, [first, second]);
776
+ const eq = this.mkEq(first, second);
777
+ this.addClause([this.mkNot(expr), lt, eq]);
778
+ this.addClause([this.mkNot(eq), expr]);
779
+ this.addClause([this.mkNot(lt), expr]);
780
+ }
781
+
782
+ isDigitAxiom(expr: number) {
783
+ const code = this.mkSeq(OP_STRING_TO_CODE, [this.manager.getArg(expr, 0)]);
784
+ const isAtLeastZero = this.mkGe(code, 48);
785
+ const isAtMostNine = this.mkLe(code, 57);
786
+ this.addClause([this.mkNot(expr), isAtLeastZero]);
787
+ this.addClause([this.mkNot(expr), isAtMostNine]);
788
+ const isBelow = this.mkNot(isAtLeastZero);
789
+ this.addClause([expr, isBelow, this.mkNot(isAtMostNine)]);
790
+ }
791
+
792
+ strToCodeAxiom(expr: number) {
793
+ const manager = this.manager;
794
+ const seq = manager.getArg(expr, 0);
795
+ const length = this.mkLenAxiom(seq);
796
+ const isLengthOne = this.mkEq(length, this.mkInt(1));
797
+ this.addClause([this.mkNot(isLengthOne), this.mkGe(expr, 0)]);
798
+ {
799
+ const notOne = this.mkNot(isLengthOne);
800
+ this.addClause([notOne, this.mkLe(expr, this.manager.maxChar)]);
801
+ }
802
+ {
803
+ const notOne = this.mkNot(isLengthOne);
804
+ const value = this.mkEq(expr, this.mkSeq(OP_CHAR_TO_INT, [this.mkNth(seq, 0)]));
805
+ this.addClause([notOne, value]);
806
+ }
807
+ if (manager.getOp(seq) !== OP_STRING_FROM_CODE) {
808
+ const notOne = this.mkNot(isLengthOne);
809
+ const inverse = this.mkEq(seq, this.mkSeq(OP_STRING_FROM_CODE, [expr]));
810
+ this.addClause([notOne, inverse]);
811
+ }
812
+ this.addClause([isLengthOne, this.mkEq(expr, this.mkInt(-1))]);
813
+ }
814
+
815
+ strFromCodeAxiom(expr: number) {
816
+ const manager = this.manager;
817
+ const code = manager.getArg(expr, 0);
818
+ const isNonNegative = this.mkGe(code, 0);
819
+ const isAtMostMax = this.mkLe(code, this.manager.maxChar);
820
+ const isEmpty = this.mkEq(expr, this.mkEmpty(manager.sorts[expr]));
821
+ {
822
+ const length = this.mkLenAxiom(expr);
823
+ const one = this.mkInt(1);
824
+ this.addClause([this.mkNot(isNonNegative), this.mkNot(isAtMostMax), this.mkEq(length, one)]);
825
+ }
826
+ if (manager.getOp(code) !== OP_STRING_TO_CODE) {
827
+ const notNonNegative = this.mkNot(isNonNegative);
828
+ const notAtMostMax = this.mkNot(isAtMostMax);
829
+ const inverse = this.mkEq(this.mkSeq(OP_STRING_TO_CODE, [expr]), code);
830
+ this.addClause([notNonNegative, notAtMostMax, inverse]);
831
+ }
832
+ this.addClause([isNonNegative, isEmpty]);
833
+ this.addClause([isAtMostMax, isEmpty]);
834
+ }
835
+
836
+ unitAxiom(expr: number) {
837
+ this.addClause([this.mkEq(this.manager.getArg(expr, 0), this.skolem.mkUnitInv(expr))]);
838
+ }
839
+
840
+ powerAxiom(expr: number) {
841
+ const manager = this.manager;
842
+ const [seq, exponent] = manager.getArgs(expr);
843
+ const empty = this.mkEmpty(manager.sorts[expr]);
844
+ const isPositive = this.mkGe(exponent, 1);
845
+ const exprLength = this.mkLenAxiom(expr);
846
+ this.addClause([isPositive, this.mkEq(expr, empty)]);
847
+ {
848
+ const notEmpty = this.mkNot(this.mkEq(seq, empty));
849
+ this.addClause([notEmpty, this.mkEq(expr, empty)]);
850
+ }
851
+ this.addClause([
852
+ this.mkNot(isPositive),
853
+ this.mkEq(exprLength, this.mkArith(OP_MUL, [exponent, this.mkLenAxiom(seq)])),
854
+ ]);
855
+ {
856
+ const notPositive = this.mkNot(isPositive);
857
+ const isSeqEmpty = this.mkEq(seq, empty);
858
+ this.addClause([notPositive, isSeqEmpty, this.mkGeE(exprLength, exponent)]);
859
+ }
860
+ }
861
+
862
+ powerUnfoldAxiom(expr: number, limit: number) {
863
+ const manager = this.manager;
864
+ const [seq, exponent] = manager.getArgs(expr);
865
+ let power = seq;
866
+ const count = manager.getNumeral(exponent);
867
+ if (count !== undefined) {
868
+ if (count <= 0n || count > BigInt(limit)) return;
869
+ for (let index = 1n; index < count; index++) power = this.mkConcat(seq, power);
870
+ this.addClause([this.mkSeqEq(expr, power)]);
871
+ return;
872
+ }
873
+ for (let index = 1; index <= limit; index++) {
874
+ const isOther = this.mkNot(this.mkEq(exponent, this.mkInt(index)));
875
+ this.addClause([isOther, this.mkSeqEq(expr, power)]);
876
+ power = this.mkConcat(seq, power);
877
+ }
878
+ }
879
+
880
+ suffixAxiom(expr: number) {
881
+ this.affixAxiom(expr, "seq.suffix", false);
882
+ }
883
+
884
+ prefixAxiom(expr: number) {
885
+ this.affixAxiom(expr, "seq.prefix", true);
886
+ }
887
+
888
+ private affixAxiom(expr: number, name: string, isPrefix: boolean) {
889
+ const manager = this.manager;
890
+ const [firstArg, secondArg] = manager.getArgs(expr);
891
+ const first = this.purify(firstArg);
892
+ const second = this.purify(secondArg);
893
+ const firstLength = this.mkLenAxiom(first);
894
+ const secondLength = this.mkLenAxiom(second);
895
+ const isLonger = this.mkGe(this.mkSub(firstLength, secondLength), 1);
896
+ const charSort = manager.getSeqElementSort(manager.sorts[first]);
897
+ const skolem = this.skolem;
898
+ const x = skolem.mk(`${name}.x`, [first, second]);
899
+ const y = skolem.mk(`${name}.y`, [first, second]);
900
+ const z = skolem.mk(`${name}.z`, [first, second]);
901
+ const c = skolem.mk(`${name}.c`, [first, second], charSort);
902
+ const d = skolem.mk(`${name}.d`, [first, second], charSort);
903
+ this.addClause([
904
+ expr,
905
+ isLonger,
906
+ this.mkSeqEq(
907
+ first,
908
+ isPrefix ? this.mkConcat(x, this.mkUnit(c), y) : this.mkConcat(y, this.mkUnit(c), x),
909
+ ),
910
+ ]);
911
+ this.addClause([
912
+ expr,
913
+ isLonger,
914
+ this.mkSeqEq(
915
+ second,
916
+ isPrefix ? this.mkConcat(x, this.mkUnit(d), z) : this.mkConcat(z, this.mkUnit(d), x),
917
+ ),
918
+ ]);
919
+ this.addClause([expr, isLonger, this.mkNot(this.mkEq(c, d))]);
920
+ }
921
+
922
+ lengthAxiom(expr: number) {
923
+ const manager = this.manager;
924
+ const seq = manager.getArg(expr, 0);
925
+ const op = manager.getOp(seq);
926
+ if (op === OP_SEQ_EXTRACT) {
927
+ const [source, offset, length] = manager.getArgs(seq);
928
+ const sourceLength = this.mkLenAxiom(source);
929
+ const zero = this.mkInt(0);
930
+ const isLongEnough = this.mkGe(
931
+ this.mkArith(OP_SUB, [sourceLength, this.mkArith(OP_ADD, [offset, length])]),
932
+ 0,
933
+ );
934
+ const isOffsetWithin = this.mkGe(this.mkArith(OP_SUB, [sourceLength, offset]), 0);
935
+ const isOffsetNonNegative = this.mkGe(offset, 0);
936
+ const isLengthNonNegative = this.mkGe(length, 0);
937
+ this.addClause([
938
+ this.mkNot(isOffsetNonNegative),
939
+ this.mkNot(isLengthNonNegative),
940
+ this.mkNot(isLongEnough),
941
+ this.mkEq(expr, length),
942
+ ]);
943
+ this.addClause([isOffsetNonNegative, this.mkEq(expr, zero)]);
944
+ this.addClause([isLengthNonNegative, this.mkEq(expr, zero)]);
945
+ this.addClause([isOffsetWithin, this.mkEq(expr, zero)]);
946
+ this.addClause([
947
+ this.mkNot(isOffsetNonNegative),
948
+ this.mkNot(isOffsetWithin),
949
+ isLongEnough,
950
+ this.mkEq(expr, this.mkArith(OP_SUB, [sourceLength, offset])),
951
+ ]);
952
+ return;
953
+ }
954
+ if (
955
+ op === OP_SEQ_UNIT ||
956
+ op === OP_SEQ_EMPTY ||
957
+ op === OP_SEQ_CONCAT ||
958
+ manager.getString(seq) !== undefined
959
+ ) {
960
+ this.addClause([this.mkEq(this.host.rewrite(expr), expr)]);
961
+ return;
962
+ }
963
+ this.addClause([this.mkGe(expr, 0)]);
964
+ }
965
+
966
+ unrollNotContains(expr: number) {
967
+ const manager = this.manager;
968
+ const [text, pattern] = manager.getArgs(expr);
969
+ const parts = this.skolem.decompose(text);
970
+ const prefix = this.mkSeq(OP_SEQ_PREFIX, [pattern, text]);
971
+ const tailContains = this.mkSeq(OP_SEQ_CONTAINS, [parts.tail, pattern]);
972
+ const isEmpty = this.mkEqEmpty(text);
973
+ this.addClause([expr, this.mkNot(prefix)]);
974
+ this.addClause([expr, isEmpty, this.mkNot(tailContains)]);
975
+ this.addClause([this.mkNot(isEmpty), this.mkEqEmpty(parts.tail)]);
976
+ this.addClause([isEmpty, this.mkEq(text, this.mkConcat(parts.head, parts.tail))]);
977
+ if (this.skolem.isTail(parts.tail))
978
+ this.addClause([
979
+ isEmpty,
980
+ this.mkGeE(this.mkLenAxiom(manager.getArg(parts.tail, 0)), manager.getArg(parts.tail, 1)),
981
+ ]);
982
+ }
983
+
984
+ lengthLimit(seq: number, limit: number) {
985
+ const manager = this.manager;
986
+ const tracker = this.skolem.mkLengthLimit(seq, limit);
987
+ if (manager.getOp(seq) === OP_SEQ_POWER) {
988
+ this.addClause([this.mkNot(tracker), this.mkLe(manager.getArg(seq, 1), limit)]);
989
+ return tracker;
990
+ }
991
+ const target = manager.getOp(seq) === OP_STRING_STOI ? manager.getArg(seq, 0) : seq;
992
+ this.addClause([this.mkNot(tracker), this.mkLe(this.mkLenAxiom(target), limit)]);
993
+ return tracker;
994
+ }
995
+ }