tla-ts 0.0.10-dev.b4a856304 → 0.0.10-dev.d618a2d79

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 (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +47 -44
  15. package/dist/run.js +47 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +44 -41
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +474 -718
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +8 -7
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +244 -238
  35. package/src/cli/tlc-output.ts +687 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +49 -702
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +55 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +31 -106
  47. package/src/exit-codes.ts +2 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +616 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +10 -30
  81. package/src/parallel.ts +50 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +9 -5
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -1
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +0 -1
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +0 -2
  310. package/src/prover/smt/solver/lp/pdd.ts +2 -2
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +15 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +206 -44
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +22 -47
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +54 -26
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,758 @@
1
+ import { SmtUnsupportedError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ KIND_APP,
5
+ OP_AND,
6
+ OP_CHAR_LE,
7
+ OP_EQ,
8
+ OP_ITE,
9
+ OP_NOT,
10
+ OP_RE_COMPLEMENT,
11
+ OP_RE_CONCAT,
12
+ OP_RE_DIFF,
13
+ OP_RE_EMPTY_SET,
14
+ OP_RE_FULL_CHAR_SET,
15
+ OP_RE_FULL_SEQ_SET,
16
+ OP_RE_INTERSECT,
17
+ OP_RE_LOOP,
18
+ OP_RE_OF_PRED,
19
+ OP_RE_OPTION,
20
+ OP_RE_PLUS,
21
+ OP_RE_RANGE,
22
+ OP_RE_REVERSE,
23
+ OP_RE_STAR,
24
+ OP_RE_UNION,
25
+ OP_RE_XOR,
26
+ OP_SEQ_AT,
27
+ OP_SEQ_CONCAT,
28
+ OP_SEQ_EXTRACT,
29
+ OP_SEQ_TO_RE,
30
+ OP_SEQ_UNIT,
31
+ FAMILY_SEQ,
32
+ } from "./ast";
33
+ import { L_FALSE, L_TRUE, L_UNDEF } from "./lbool";
34
+ import { RefVector } from "./ref-vector";
35
+ import { isBinaryApp, isEmptySeq, mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
36
+
37
+ export const UINT_MAX = 0xffffffff;
38
+ const MAX_PERIOD = 64;
39
+
40
+ export const addTruncate = (first: number, second: number) =>
41
+ first + second > UINT_MAX ? UINT_MAX : first + second;
42
+
43
+ const mulTruncate = (first: number, second: number) =>
44
+ first * second > UINT_MAX ? UINT_MAX : first * second;
45
+
46
+ const getGcd = (first: number, second: number): number => {
47
+ let a = first;
48
+ let b = second;
49
+ while (b !== 0) [a, b] = [b, a % b];
50
+ return a;
51
+ };
52
+
53
+ export interface LenAbs {
54
+ lo: number;
55
+ hi: number;
56
+ period: number;
57
+ residues: bigint;
58
+ }
59
+
60
+ export interface ReInfo extends LenAbs {
61
+ isKnown: boolean;
62
+ isInterpreted: boolean;
63
+ nullable: number;
64
+ isClassical: boolean;
65
+ }
66
+
67
+ const mkLenAbs = (lo: number, hi: number, period = 1, residues = 1n): LenAbs => ({
68
+ lo,
69
+ hi,
70
+ period,
71
+ residues,
72
+ });
73
+
74
+ const getBit = (index: number) => 1n << BigInt(index);
75
+
76
+ const getFullMask = (modulus: number) =>
77
+ modulus >= MAX_PERIOD ? (1n << 64n) - 1n : getBit(modulus) - 1n;
78
+
79
+ const getBoundedLcm = (first: number, second: number) => {
80
+ if (first === 0) return second;
81
+ if (second === 0) return first;
82
+ const lcm = (first / getGcd(first, second)) * second;
83
+ return lcm > MAX_PERIOD ? 0 : lcm;
84
+ };
85
+
86
+ const getCommonPeriod = (first: number, second: number) => {
87
+ const lcm = getBoundedLcm(first, second);
88
+ const modulus = lcm === 0 ? getGcd(first, second) : lcm;
89
+ return modulus === 0 ? 1 : modulus;
90
+ };
91
+
92
+ const getEffectivePeriod = (abs: LenAbs) => (abs.lo === abs.hi ? 0 : abs.period);
93
+
94
+ const isLenAbsEmpty = (abs: LenAbs) => {
95
+ if (abs.lo > abs.hi || abs.residues === 0n) return true;
96
+ if (abs.period <= 1) return false;
97
+ if (abs.hi === UINT_MAX || abs.hi - abs.lo >= abs.period - 1) return false;
98
+ for (let length = abs.lo; length <= abs.hi; length++)
99
+ if ((abs.residues & getBit(length % abs.period)) !== 0n) return false;
100
+ return true;
101
+ };
102
+
103
+ const getResiduesMod = (abs: LenAbs, modulus: number) => {
104
+ if (modulus === 0 || isLenAbsEmpty(abs)) return 0n;
105
+ if (modulus >= MAX_PERIOD) return getFullMask(modulus);
106
+ let result = 0n;
107
+ if (abs.hi !== UINT_MAX && abs.hi - abs.lo < MAX_PERIOD) {
108
+ for (let length = abs.lo; length <= abs.hi; length++)
109
+ if ((abs.residues & getBit(length % abs.period)) !== 0n) result |= getBit(length % modulus);
110
+ return result;
111
+ }
112
+ if (modulus <= abs.period && abs.period % modulus === 0) {
113
+ for (let residue = 0; residue < abs.period; residue++)
114
+ if ((abs.residues & getBit(residue)) !== 0n) result |= getBit(residue % modulus);
115
+ return result;
116
+ }
117
+ if (modulus > abs.period && modulus % abs.period === 0) {
118
+ for (let residue = 0; residue < abs.period; residue++)
119
+ if ((abs.residues & getBit(residue)) !== 0n)
120
+ for (let lifted = residue; lifted < modulus; lifted += abs.period) result |= getBit(lifted);
121
+ return result;
122
+ }
123
+ return getFullMask(modulus);
124
+ };
125
+
126
+ const getLenAbsGcd = (abs: LenAbs) => {
127
+ if (isLenAbsEmpty(abs)) return 0;
128
+ let gcd = 0;
129
+ const span = abs.period > (UINT_MAX - abs.lo) / 2 ? UINT_MAX : abs.lo + 2 * abs.period;
130
+ const hi = Math.min(abs.hi, span);
131
+ for (let length = abs.lo; length <= hi; length++) {
132
+ if ((abs.residues & getBit(length % abs.period)) !== 0n) gcd = getGcd(gcd, length);
133
+ if (gcd === 1) return 1;
134
+ }
135
+ return abs.hi === UINT_MAX ? getGcd(gcd, abs.period) : gcd;
136
+ };
137
+
138
+ const getSumset = (first: bigint, second: bigint, modulus: number) => {
139
+ let result = 0n;
140
+ for (let left = 0; left < modulus; left++) {
141
+ if ((first & getBit(left)) === 0n) continue;
142
+ for (let right = 0; right < modulus; right++)
143
+ if ((second & getBit(right)) !== 0n) result |= getBit((left + right) % modulus);
144
+ }
145
+ return result;
146
+ };
147
+
148
+ const concatLenAbs = (abs: LenAbs, other: LenAbs) => {
149
+ const result = mkLenAbs(addTruncate(abs.lo, other.lo), addTruncate(abs.hi, other.hi));
150
+ const gcd = getGcd(getEffectivePeriod(abs), getEffectivePeriod(other));
151
+ if (gcd > 1) {
152
+ result.period = gcd;
153
+ result.residues = getSumset(getResiduesMod(abs, gcd), getResiduesMod(other, gcd), gcd);
154
+ }
155
+ return result;
156
+ };
157
+
158
+ const uniteLenAbs = (abs: LenAbs, other: LenAbs) => {
159
+ const result = mkLenAbs(Math.min(abs.lo, other.lo), Math.max(abs.hi, other.hi));
160
+ const modulus = getCommonPeriod(getEffectivePeriod(abs), getEffectivePeriod(other));
161
+ if (modulus > 1) {
162
+ result.period = modulus;
163
+ result.residues = getResiduesMod(abs, modulus) | getResiduesMod(other, modulus);
164
+ }
165
+ return result;
166
+ };
167
+
168
+ const meetLenAbs = (abs: LenAbs, other: LenAbs) => {
169
+ const result = mkLenAbs(Math.max(abs.lo, other.lo), Math.min(abs.hi, other.hi));
170
+ const modulus = getCommonPeriod(getEffectivePeriod(abs), getEffectivePeriod(other));
171
+ if (modulus > 1) {
172
+ result.period = modulus;
173
+ result.residues = getResiduesMod(abs, modulus) & getResiduesMod(other, modulus);
174
+ }
175
+ return result;
176
+ };
177
+
178
+ const starLenAbs = (abs: LenAbs, lo: number) => {
179
+ const result = mkLenAbs(lo, abs.hi === 0 ? 0 : UINT_MAX);
180
+ const gcd = getLenAbsGcd(abs);
181
+ if (gcd > 1 && gcd <= MAX_PERIOD) {
182
+ result.period = gcd;
183
+ result.residues = 1n;
184
+ }
185
+ return result;
186
+ };
187
+
188
+ const loopLenAbs = (abs: LenAbs, lower: number, upper: number) => {
189
+ const result = mkLenAbs(mulTruncate(abs.lo, lower), mulTruncate(abs.hi, upper));
190
+ if (upper === UINT_MAX || upper > MAX_PERIOD) {
191
+ const gcd = getLenAbsGcd(abs);
192
+ if (gcd > 1 && gcd <= MAX_PERIOD) {
193
+ result.period = gcd;
194
+ result.residues = 1n;
195
+ }
196
+ return result;
197
+ }
198
+ const modulus = abs.period > 1 ? abs.period : getLenAbsGcd(abs);
199
+ if (modulus <= 1 || modulus > MAX_PERIOD) return result;
200
+ const base = getResiduesMod(abs, modulus);
201
+ let accumulated = 0n;
202
+ let current = 1n;
203
+ for (let count = 0; count <= upper; count++) {
204
+ if (count >= lower) accumulated |= current;
205
+ current = getSumset(current, base, modulus);
206
+ }
207
+ result.period = modulus;
208
+ result.residues = accumulated;
209
+ return result;
210
+ };
211
+
212
+ const isResidueReachable = (period: number, residues: bigint, constant: number, stride: number) => {
213
+ if (period === 0) return true;
214
+ const offset = constant % period;
215
+ const gcd = stride === 0 ? period : getGcd(stride, period);
216
+ for (let residue = 0; residue < period; residue++) {
217
+ if ((residues & getBit(residue)) === 0n) continue;
218
+ if (stride === 0 ? residue === offset : (residue + period - offset) % gcd === 0) return true;
219
+ }
220
+ return false;
221
+ };
222
+
223
+ const UNKNOWN_INFO: ReInfo = {
224
+ isKnown: false,
225
+ isInterpreted: false,
226
+ nullable: L_UNDEF,
227
+ isClassical: true,
228
+ ...mkLenAbs(0, UINT_MAX),
229
+ };
230
+
231
+ const mkInfo = (
232
+ isInterpreted: boolean,
233
+ nullable: number,
234
+ minLength: number,
235
+ maxLength: number,
236
+ isClassical: boolean,
237
+ abs?: LenAbs,
238
+ ): ReInfo => ({
239
+ isKnown: true,
240
+ isInterpreted,
241
+ nullable,
242
+ isClassical,
243
+ ...(abs ?? mkLenAbs(minLength, maxLength)),
244
+ });
245
+
246
+ const starInfo = (info: ReInfo) =>
247
+ mkInfo(info.isInterpreted, L_TRUE, 0, 0, info.isClassical, starLenAbs(info, 0));
248
+
249
+ const plusInfo = (info: ReInfo) =>
250
+ info.isKnown
251
+ ? mkInfo(info.isInterpreted, info.nullable, 0, 0, info.isClassical, starLenAbs(info, info.lo))
252
+ : info;
253
+
254
+ const optInfo = (info: ReInfo) =>
255
+ mkInfo(
256
+ info.isInterpreted,
257
+ L_TRUE,
258
+ 0,
259
+ 0,
260
+ info.isClassical,
261
+ mkLenAbs(0, info.hi, info.period, info.residues | 1n),
262
+ );
263
+
264
+ const complementInfo = (info: ReInfo) => {
265
+ if (!info.isKnown) return info;
266
+ const nullable = -info.nullable;
267
+ return mkInfo(info.isInterpreted, nullable, nullable === L_FALSE ? 1 : 0, UINT_MAX, false);
268
+ };
269
+
270
+ const concatInfo = (info: ReInfo, other: ReInfo) => {
271
+ if (!info.isKnown) return info;
272
+ if (!other.isKnown) return other;
273
+ const nullable =
274
+ info.nullable === L_FALSE || other.nullable === L_FALSE
275
+ ? L_FALSE
276
+ : info.nullable === L_TRUE && other.nullable === L_TRUE
277
+ ? L_TRUE
278
+ : L_UNDEF;
279
+ return mkInfo(
280
+ info.isInterpreted && other.isInterpreted,
281
+ nullable,
282
+ 0,
283
+ 0,
284
+ info.isClassical && other.isClassical,
285
+ concatLenAbs(info, other),
286
+ );
287
+ };
288
+
289
+ const disjInfo = (info: ReInfo, other: ReInfo) => {
290
+ if (!info.isKnown && !other.isKnown) return other;
291
+ const nullable =
292
+ info.nullable === L_TRUE || other.nullable === L_TRUE
293
+ ? L_TRUE
294
+ : info.nullable === L_FALSE && other.nullable === L_FALSE
295
+ ? L_FALSE
296
+ : L_UNDEF;
297
+ return mkInfo(
298
+ info.isInterpreted && other.isInterpreted,
299
+ nullable,
300
+ 0,
301
+ 0,
302
+ info.isClassical && other.isClassical,
303
+ uniteLenAbs(info, other),
304
+ );
305
+ };
306
+
307
+ const conjInfo = (info: ReInfo, other: ReInfo) => {
308
+ if (!info.isKnown) return info;
309
+ if (!other.isKnown) return other;
310
+ const nullable =
311
+ info.nullable === L_TRUE && other.nullable === L_TRUE
312
+ ? L_TRUE
313
+ : info.nullable === L_FALSE || other.nullable === L_FALSE
314
+ ? L_FALSE
315
+ : L_UNDEF;
316
+ return mkInfo(
317
+ info.isInterpreted && other.isInterpreted,
318
+ nullable,
319
+ 0,
320
+ 0,
321
+ false,
322
+ meetLenAbs(info, other),
323
+ );
324
+ };
325
+
326
+ const diffInfo = (info: ReInfo, other: ReInfo) => {
327
+ if (!info.isKnown) return info;
328
+ if (!other.isKnown) return other;
329
+ const nullable =
330
+ info.nullable === L_TRUE && other.nullable === L_FALSE
331
+ ? L_TRUE
332
+ : info.nullable === L_FALSE
333
+ ? L_FALSE
334
+ : L_UNDEF;
335
+ return mkInfo(
336
+ info.isInterpreted && other.isInterpreted,
337
+ nullable,
338
+ 0,
339
+ 0,
340
+ false,
341
+ mkLenAbs(info.lo, info.hi, info.period, info.residues),
342
+ );
343
+ };
344
+
345
+ const xorInfo = (info: ReInfo, other: ReInfo) => {
346
+ if (!info.isKnown) return info;
347
+ if (!other.isKnown) return other;
348
+ const nullable =
349
+ info.nullable !== L_UNDEF && other.nullable !== L_UNDEF
350
+ ? info.nullable === other.nullable
351
+ ? L_FALSE
352
+ : L_TRUE
353
+ : L_UNDEF;
354
+ const abs = uniteLenAbs(info, other);
355
+ abs.lo = 0;
356
+ abs.hi = UINT_MAX;
357
+ return mkInfo(info.isInterpreted && other.isInterpreted, nullable, 0, UINT_MAX, false, abs);
358
+ };
359
+
360
+ const orElseInfo = (info: ReInfo, other: ReInfo) => {
361
+ if (!info.isKnown) return info;
362
+ if (!other.isKnown) return other;
363
+ const nullable =
364
+ info.nullable === L_TRUE && other.nullable === L_TRUE
365
+ ? L_TRUE
366
+ : info.nullable === L_FALSE && other.nullable === L_FALSE
367
+ ? L_FALSE
368
+ : L_UNDEF;
369
+ return mkInfo(
370
+ false,
371
+ nullable,
372
+ 0,
373
+ 0,
374
+ info.isClassical && other.isClassical,
375
+ uniteLenAbs(info, other),
376
+ );
377
+ };
378
+
379
+ const loopInfo = (info: ReInfo, lower: number, upper: number) =>
380
+ info.isKnown
381
+ ? mkInfo(
382
+ info.isInterpreted,
383
+ info.nullable === L_TRUE || lower === 0 ? L_TRUE : info.nullable,
384
+ 0,
385
+ 0,
386
+ info.isClassical,
387
+ loopLenAbs(info, lower, upper),
388
+ )
389
+ : info;
390
+
391
+ const getConstChar = (manager: AstManager, expr: number) => {
392
+ const chars = manager.getString(expr);
393
+ if (chars !== undefined) return chars.length === 1 ? chars[0] : -1;
394
+ return manager.getOp(expr) === OP_SEQ_UNIT ? manager.getChar(manager.getArg(expr, 0)) : -1;
395
+ };
396
+
397
+ const mkInfoRec = (manager: AstManager, table: (ReInfo | undefined)[], expr: number): ReInfo => {
398
+ const getRec = (arg: number) => getInfoRec(manager, table, arg);
399
+ const numArgs = manager.getNumArgs(expr);
400
+ if (manager.getFamily(expr) === FAMILY_SEQ) {
401
+ const op = manager.getOp(expr);
402
+ const getBinary = (combine: (first: ReInfo, second: ReInfo) => ReInfo) =>
403
+ numArgs === 1
404
+ ? getRec(manager.getArg(expr, 0))
405
+ : numArgs === 2
406
+ ? combine(getRec(manager.getArg(expr, 0)), getRec(manager.getArg(expr, 1)))
407
+ : UNKNOWN_INFO;
408
+ switch (op) {
409
+ case OP_RE_EMPTY_SET:
410
+ return mkInfo(true, L_FALSE, UINT_MAX, 0, false);
411
+ case OP_RE_FULL_SEQ_SET:
412
+ return mkInfo(true, L_TRUE, 0, UINT_MAX, true);
413
+ case OP_RE_STAR:
414
+ return starInfo(getRec(manager.getArg(expr, 0)));
415
+ case OP_RE_OPTION:
416
+ return optInfo(getRec(manager.getArg(expr, 0)));
417
+ case OP_RE_RANGE: {
418
+ const lo = getConstChar(manager, manager.getArg(expr, 0));
419
+ const hi = getConstChar(manager, manager.getArg(expr, 1));
420
+ const isInterpreted = lo !== -1 && hi !== -1;
421
+ return mkInfo(isInterpreted, L_FALSE, 1, 1, isInterpreted && lo <= hi);
422
+ }
423
+ case OP_RE_FULL_CHAR_SET:
424
+ case OP_RE_OF_PRED:
425
+ return mkInfo(true, L_FALSE, 1, 1, false);
426
+ case OP_RE_CONCAT:
427
+ return getBinary(concatInfo);
428
+ case OP_RE_UNION:
429
+ return getBinary(disjInfo);
430
+ case OP_RE_INTERSECT:
431
+ return getBinary(conjInfo);
432
+ case OP_SEQ_TO_RE: {
433
+ const seq = manager.getArg(expr, 0);
434
+ const minLength = getStrMinLength(manager, seq);
435
+ const isValue = manager.isValue(seq);
436
+ const nullable = isValue && minLength === 0 ? L_TRUE : minLength > 0 ? L_FALSE : L_UNDEF;
437
+ return mkInfo(isValue, nullable, minLength, getStrMaxLength(manager, seq), true);
438
+ }
439
+ case OP_RE_REVERSE:
440
+ return getRec(manager.getArg(expr, 0));
441
+ case OP_RE_PLUS:
442
+ return plusInfo(getRec(manager.getArg(expr, 0)));
443
+ case OP_RE_COMPLEMENT:
444
+ return complementInfo(getRec(manager.getArg(expr, 0)));
445
+ case OP_RE_LOOP: {
446
+ const body = getRec(manager.getArg(expr, 0));
447
+ if (numArgs === 1) {
448
+ const parameters = manager.funcDecls[manager.decls[expr]].parameters;
449
+ const lower = parameters.length >= 1 ? parameters[0] : 0;
450
+ const upper = parameters.length === 2 ? parameters[1] : UINT_MAX;
451
+ return loopInfo(body, lower, upper);
452
+ }
453
+ if (numArgs !== 2 && numArgs !== 3) return UNKNOWN_INFO;
454
+ const lower = getUnsigned(manager, manager.getArg(expr, 1));
455
+ if (lower === undefined) return UNKNOWN_INFO;
456
+ if (numArgs === 2) return loopInfo(body, lower, UINT_MAX);
457
+ const upper = getUnsigned(manager, manager.getArg(expr, 2));
458
+ return upper === undefined ? UNKNOWN_INFO : loopInfo(body, lower, upper);
459
+ }
460
+ case OP_RE_DIFF:
461
+ return numArgs === 2
462
+ ? diffInfo(getRec(manager.getArg(expr, 0)), getRec(manager.getArg(expr, 1)))
463
+ : UNKNOWN_INFO;
464
+ case OP_RE_XOR:
465
+ return getBinary(xorInfo);
466
+ default:
467
+ return UNKNOWN_INFO;
468
+ }
469
+ }
470
+ if (manager.getOp(expr) === OP_ITE)
471
+ return orElseInfo(getRec(manager.getArg(expr, 1)), getRec(manager.getArg(expr, 2)));
472
+ return UNKNOWN_INFO;
473
+ };
474
+
475
+ const getInfoRec = (manager: AstManager, table: (ReInfo | undefined)[], expr: number): ReInfo => {
476
+ const cached = table[expr];
477
+ if (cached !== undefined) return cached;
478
+ const result = manager.kinds[expr] === KIND_APP ? mkInfoRec(manager, table, expr) : UNKNOWN_INFO;
479
+ table[expr] = result;
480
+ return result;
481
+ };
482
+
483
+ // Each seq_util of Z3 caches the infos and pins the expressions it computed them for, until it is
484
+ // destroyed.
485
+ export class ReInfoCache {
486
+ private infos: (ReInfo | undefined)[] = [];
487
+ private pins: RefVector;
488
+
489
+ constructor(readonly manager: AstManager) {
490
+ this.pins = new RefVector(manager);
491
+ }
492
+
493
+ getInfo(expr: number) {
494
+ const cached = this.infos[expr];
495
+ if (cached !== undefined) return cached;
496
+ this.pins.push(expr);
497
+ return getInfoRec(this.manager, this.infos, expr);
498
+ }
499
+
500
+ clone() {
501
+ const copy = new ReInfoCache(this.manager);
502
+ copy.infos = [...this.infos];
503
+ for (const expr of this.pins.items) copy.pins.push(expr);
504
+ return copy;
505
+ }
506
+
507
+ release() {
508
+ this.pins.reset();
509
+ this.infos = [];
510
+ }
511
+ }
512
+
513
+ export const isReGround = (info: ReInfoCache, expr: number) => info.getInfo(expr).isInterpreted;
514
+
515
+ const getUnsigned = (manager: AstManager, expr: number) => {
516
+ const value = manager.getNumeral(expr);
517
+ return value !== undefined && value >= 0n && value <= BigInt(UINT_MAX)
518
+ ? Number(value)
519
+ : undefined;
520
+ };
521
+
522
+ export const isReOp = (manager: AstManager, expr: number, op: number) =>
523
+ manager.getFamily(expr) === FAMILY_SEQ && manager.getOp(expr) === op;
524
+
525
+ export const isReBinary = (manager: AstManager, expr: number, op: number) =>
526
+ isReOp(manager, expr, op) && manager.getNumArgs(expr) === 2;
527
+
528
+ export const isReUnary = (manager: AstManager, expr: number, op: number) =>
529
+ isReOp(manager, expr, op) && manager.getNumArgs(expr) === 1;
530
+
531
+ export const isReEmpty = (manager: AstManager, expr: number) =>
532
+ isReOp(manager, expr, OP_RE_EMPTY_SET);
533
+
534
+ export const isFullChar = (manager: AstManager, expr: number) =>
535
+ isReOp(manager, expr, OP_RE_FULL_CHAR_SET);
536
+
537
+ export const isFullSeq = (manager: AstManager, expr: number) =>
538
+ isReOp(manager, expr, OP_RE_FULL_SEQ_SET) ||
539
+ (isReUnary(manager, expr, OP_RE_STAR) && isFullChar(manager, manager.getArg(expr, 0)));
540
+
541
+ export const isDotPlus = (manager: AstManager, expr: number) => {
542
+ if (isReUnary(manager, expr, OP_RE_PLUS) && isFullChar(manager, manager.getArg(expr, 0)))
543
+ return true;
544
+ if (!isReBinary(manager, expr, OP_RE_CONCAT)) return false;
545
+ const first = manager.getArg(expr, 0);
546
+ const second = manager.getArg(expr, 1);
547
+ return (
548
+ (isFullChar(manager, first) && isFullSeq(manager, second)) ||
549
+ (isFullChar(manager, second) && isFullSeq(manager, first))
550
+ );
551
+ };
552
+
553
+ export const isEpsilon = (manager: AstManager, expr: number) =>
554
+ isReUnary(manager, expr, OP_SEQ_TO_RE) && isEmptySeq(manager, manager.getArg(expr, 0));
555
+
556
+ export const getRangeChars = (manager: AstManager, expr: number) => {
557
+ if (!isReBinary(manager, expr, OP_RE_RANGE)) return undefined;
558
+ const lo = manager.getString(manager.getArg(expr, 0));
559
+ const hi = manager.getString(manager.getArg(expr, 1));
560
+ if (lo === undefined || hi === undefined || lo.length !== 1 || hi.length !== 1) return undefined;
561
+ return [lo[0], hi[0]] as const;
562
+ };
563
+
564
+ export interface LoopBounds {
565
+ body: number;
566
+ lo: number;
567
+ hi: number;
568
+ }
569
+
570
+ export const getLoopBounds = (manager: AstManager, expr: number): LoopBounds | undefined => {
571
+ if (!isReUnary(manager, expr, OP_RE_LOOP)) return undefined;
572
+ const parameters = manager.funcDecls[manager.decls[expr]].parameters;
573
+ if (parameters.length !== 2) return undefined;
574
+ return { body: manager.getArg(expr, 0), lo: parameters[0], hi: parameters[1] };
575
+ };
576
+
577
+ export const getLoopLower = (manager: AstManager, expr: number): LoopBounds | undefined => {
578
+ if (!isReUnary(manager, expr, OP_RE_LOOP)) return undefined;
579
+ const parameters = manager.funcDecls[manager.decls[expr]].parameters;
580
+ if (parameters.length !== 1) return undefined;
581
+ return { body: manager.getArg(expr, 0), lo: parameters[0], hi: UINT_MAX };
582
+ };
583
+
584
+ export const mkRe = (manager: AstManager, op: number, args: number[], parameters: number[] = []) =>
585
+ mkSeqApp(manager, op, args, parameters);
586
+
587
+ export const mkReEmpty = (manager: AstManager, reSort: number) =>
588
+ mkSeqApp(manager, OP_RE_EMPTY_SET, [], [], reSort);
589
+
590
+ export const mkFullSeq = (manager: AstManager, reSort: number) =>
591
+ mkSeqApp(manager, OP_RE_FULL_SEQ_SET, [], [], reSort);
592
+
593
+ export const mkFullChar = (manager: AstManager, reSort: number) =>
594
+ mkSeqApp(manager, OP_RE_FULL_CHAR_SET, [], [], reSort);
595
+
596
+ export const mkToRe = (manager: AstManager, seq: number) => mkSeqApp(manager, OP_SEQ_TO_RE, [seq]);
597
+
598
+ export const mkEpsilon = (manager: AstManager, seqSort: number) =>
599
+ mkToRe(manager, mkEmptySeq(manager, seqSort));
600
+
601
+ export const mkReLoop = (manager: AstManager, body: number, lo: number, hi?: number) =>
602
+ mkSeqApp(manager, OP_RE_LOOP, [body], hi === undefined ? [lo] : [lo, hi]);
603
+
604
+ export const mkReRange = (manager: AstManager, reSort: number, lo: number, hi: number) => {
605
+ if (lo > hi) return mkReEmpty(manager, reSort);
606
+ if (lo === 0 && hi === manager.maxChar) return mkFullChar(manager, reSort);
607
+ const loString = manager.mkString([lo]);
608
+ if (lo === hi) return mkToRe(manager, loString);
609
+ return mkSeqApp(manager, OP_RE_RANGE, [loString, manager.mkString([hi])]);
610
+ };
611
+
612
+ export const getStrMinLength = (manager: AstManager, seq: number): number => {
613
+ const getLength = (part: number) =>
614
+ manager.getOp(part) === OP_SEQ_UNIT ? 1 : (manager.getString(part)?.length ?? 0);
615
+ let result = 0;
616
+ let current = seq;
617
+ while (isBinaryApp(manager, current, OP_SEQ_CONCAT)) {
618
+ const first = manager.getArg(current, 0);
619
+ result +=
620
+ manager.getOp(first) === OP_SEQ_CONCAT ? getStrMinLength(manager, first) : getLength(first);
621
+ current = manager.getArg(current, 1);
622
+ }
623
+ return result + getLength(current);
624
+ };
625
+
626
+ const getStrMaxLength = (manager: AstManager, seq: number): number => {
627
+ const getLength = (part: number) => {
628
+ if (isEmptySeq(manager, part)) return 0;
629
+ const op = manager.getOp(part);
630
+ if (op === OP_SEQ_UNIT || op === OP_SEQ_AT) return 1;
631
+ if (op === OP_SEQ_EXTRACT) return getUnsigned(manager, manager.getArg(part, 2)) ?? UINT_MAX;
632
+ return manager.getString(part)?.length ?? UINT_MAX;
633
+ };
634
+ let result = 0;
635
+ let current = seq;
636
+ while (isBinaryApp(manager, current, OP_SEQ_CONCAT)) {
637
+ const first = manager.getArg(current, 0);
638
+ result = addTruncate(
639
+ manager.getOp(first) === OP_SEQ_CONCAT ? getStrMaxLength(manager, first) : getLength(first),
640
+ result,
641
+ );
642
+ current = manager.getArg(current, 1);
643
+ }
644
+ return addTruncate(getLength(current), result);
645
+ };
646
+
647
+ const getLengthShape = (manager: AstManager, seq: number) => {
648
+ let constant = 0;
649
+ let stride = 0;
650
+ const multiplicities = new Map<number, number>();
651
+ const todo = [seq];
652
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
653
+ if (isBinaryApp(manager, expr, OP_SEQ_CONCAT)) {
654
+ todo.push(manager.getArg(expr, 0), manager.getArg(expr, 1));
655
+ continue;
656
+ }
657
+ if (isEmptySeq(manager, expr)) continue;
658
+ if (manager.getOp(expr) === OP_SEQ_UNIT) {
659
+ constant++;
660
+ continue;
661
+ }
662
+ const chars = manager.getString(expr);
663
+ if (chars !== undefined) {
664
+ constant += chars.length;
665
+ continue;
666
+ }
667
+ multiplicities.set(expr, (multiplicities.get(expr) ?? 0) + 1);
668
+ }
669
+ for (const count of multiplicities.values()) stride = getGcd(stride, count);
670
+ return { constant, stride };
671
+ };
672
+
673
+ export const canBeMember = (infos: ReInfoCache, seq: number, regex: number) => {
674
+ const info = infos.getInfo(regex);
675
+ if (!info.isKnown || info.period <= 1) return true;
676
+ const shape = getLengthShape(infos.manager, seq);
677
+ return isResidueReachable(info.period, info.residues, shape.constant, shape.stride);
678
+ };
679
+
680
+ const isCharLe = (manager: AstManager, expr: number) =>
681
+ manager.getOp(expr) === OP_CHAR_LE && manager.getNumArgs(expr) === 2;
682
+
683
+ export interface CharRange {
684
+ lo: number;
685
+ hi: number;
686
+ isNegated: boolean;
687
+ }
688
+
689
+ export const getCharConstRange = (
690
+ manager: AstManager,
691
+ variable: number,
692
+ expr: number,
693
+ ): CharRange | undefined => {
694
+ const isNegated = manager.getOp(expr) === OP_NOT;
695
+ const atom = isNegated ? manager.getArg(expr, 0) : expr;
696
+ const op = manager.getOp(atom);
697
+ if (op === OP_EQ) {
698
+ const first = manager.getArg(atom, 0);
699
+ const second = manager.getArg(atom, 1);
700
+ if (first === variable && manager.getChar(second) !== -1) {
701
+ const code = manager.getChar(second);
702
+ return { lo: code, hi: code, isNegated };
703
+ }
704
+ if (second === variable && manager.getChar(first) !== -1) {
705
+ const code = manager.getChar(first);
706
+ return { lo: code, hi: code, isNegated };
707
+ }
708
+ return undefined;
709
+ }
710
+ if (isCharLe(manager, atom)) {
711
+ const first = manager.getArg(atom, 0);
712
+ const second = manager.getArg(atom, 1);
713
+ if (first === variable && manager.getChar(second) !== -1)
714
+ return { lo: 0, hi: manager.getChar(second), isNegated };
715
+ if (second === variable && manager.getChar(first) !== -1)
716
+ return { lo: manager.getChar(first), hi: manager.maxChar, isNegated };
717
+ return undefined;
718
+ }
719
+ if (op !== OP_AND || manager.getNumArgs(atom) !== 2) return undefined;
720
+ const first = manager.getArg(atom, 0);
721
+ const second = manager.getArg(atom, 1);
722
+ if (!isCharLe(manager, first) || !isCharLe(manager, second)) return undefined;
723
+ const [firstLeft, firstRight] = [manager.getArg(first, 0), manager.getArg(first, 1)];
724
+ const [secondLeft, secondRight] = [manager.getArg(second, 0), manager.getArg(second, 1)];
725
+ if (
726
+ firstRight === variable &&
727
+ manager.getChar(firstLeft) !== -1 &&
728
+ secondLeft === variable &&
729
+ manager.getChar(secondRight) !== -1
730
+ )
731
+ return { lo: manager.getChar(firstLeft), hi: manager.getChar(secondRight), isNegated };
732
+ if (
733
+ firstLeft === variable &&
734
+ manager.getChar(firstRight) !== -1 &&
735
+ secondRight === variable &&
736
+ manager.getChar(secondLeft) !== -1
737
+ )
738
+ return { lo: manager.getChar(secondLeft), hi: manager.getChar(firstRight), isNegated };
739
+ return undefined;
740
+ };
741
+
742
+ export const mkCharLe = (manager: AstManager, first: number, second: number) => {
743
+ if (first === second) return manager.trueExpr;
744
+ if (!manager.isCharSort(manager.sorts[first]))
745
+ throw new SmtUnsupportedError("range comparisons of non-character elements");
746
+ const firstCode = manager.getChar(first);
747
+ const secondCode = manager.getChar(second);
748
+ if (firstCode !== -1 && secondCode !== -1)
749
+ return firstCode <= secondCode ? manager.trueExpr : manager.falseExpr;
750
+ if (firstCode === 0 || secondCode === manager.maxChar) return manager.trueExpr;
751
+ return mkSeqApp(manager, OP_CHAR_LE, [first, second]);
752
+ };
753
+
754
+ export const getUnitStringChar = (manager: AstManager, seq: number) => {
755
+ const chars = manager.getString(seq);
756
+ if (chars !== undefined) return chars.length === 1 ? manager.mkChar(chars[0]) : -1;
757
+ return manager.getOp(seq) === OP_SEQ_UNIT ? manager.getArg(seq, 0) : -1;
758
+ };