tla-ts 0.0.9 → 0.0.10-dev.09e53c2a6

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (625) hide show
  1. package/README.md +30 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +109 -10
  8. package/dist/index.d.ts +109 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +2746 -410
  15. package/dist/prove.js +2745 -409
  16. package/dist/run.cjs +146 -31
  17. package/dist/run.js +146 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +132 -104
  21. package/dist/transfer.js +132 -104
  22. package/dist/worker.cjs +6 -6
  23. package/dist/worker.js +6 -6
  24. package/package.json +3 -1
  25. package/src/ast.ts +45 -59
  26. package/src/bags.ts +99 -102
  27. package/src/builtins.ts +28 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +116 -0
  30. package/src/check-trace.ts +282 -0
  31. package/src/check.ts +797 -782
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +136 -0
  35. package/src/cli/shared.ts +19 -12
  36. package/src/cli/tlapm.ts +433 -82
  37. package/src/cli/tlc-arguments.ts +652 -0
  38. package/src/cli/tlc-output.ts +687 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +323 -658
  41. package/src/cli/typescript.ts +23 -0
  42. package/src/cli/xml-exporter.ts +27 -49
  43. package/src/cli.ts +0 -1
  44. package/src/codegen.ts +196 -74
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +830 -0
  47. package/src/dependencies.ts +36 -54
  48. package/src/dfid.ts +618 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +178 -339
  51. package/src/errors.ts +100 -57
  52. package/src/evaluate.ts +598 -340
  53. package/src/exit-codes.ts +38 -3
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +126 -21
  57. package/src/java-hash.ts +7 -0
  58. package/src/java-overrides.ts +4 -19
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +46 -58
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +590 -311
  64. package/src/liveness.ts +180 -124
  65. package/src/obligations/action.ts +17 -44
  66. package/src/obligations/anonymize.ts +120 -95
  67. package/src/obligations/enabled-axioms.ts +218 -0
  68. package/src/obligations/equality.ts +1 -3
  69. package/src/obligations/expression.ts +37 -26
  70. package/src/obligations/format.ts +0 -10
  71. package/src/obligations/generate.ts +66 -64
  72. package/src/obligations/index.ts +38 -19
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +30 -37
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +89 -58
  79. package/src/obligations/proof.ts +3 -6
  80. package/src/obligations/regroup.ts +0 -5
  81. package/src/obligations/simplify.ts +57 -63
  82. package/src/obligations/source.ts +119 -95
  83. package/src/obligations/subexpression.ts +49 -28
  84. package/src/obligations/substitution.ts +1 -5
  85. package/src/obligations/temporal.ts +12 -20
  86. package/src/obligations/tuples.ts +2 -10
  87. package/src/parallel-worker.ts +30 -60
  88. package/src/parallel.ts +59 -73
  89. package/src/parser.ts +1082 -399
  90. package/src/pcal/ast.ts +53 -86
  91. package/src/pcal/parse.ts +144 -219
  92. package/src/pcal/tokenize.ts +91 -131
  93. package/src/pcal/translate.ts +83 -130
  94. package/src/pcal/validate.ts +48 -68
  95. package/src/pretty-print.ts +7 -8
  96. package/src/prover/decide-pool.ts +8 -13
  97. package/src/prover/deciders.ts +12 -13
  98. package/src/prover/first-order.ts +0 -11
  99. package/src/prover/isabelle/decide.ts +3 -31
  100. package/src/prover/isabelle/encode.ts +82 -64
  101. package/src/prover/isabelle/isar/attrib.ts +250 -0
  102. package/src/prover/isabelle/isar/context.ts +335 -0
  103. package/src/prover/isabelle/isar/induct.ts +382 -0
  104. package/src/prover/isabelle/isar/inner-syntax.ts +262 -117
  105. package/src/prover/isabelle/isar/method.ts +510 -226
  106. package/src/prover/isabelle/isar/proof.ts +570 -23
  107. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  108. package/src/prover/isabelle/isar/theory.ts +488 -88
  109. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  110. package/src/prover/isabelle/isar/type-check.ts +99 -38
  111. package/src/prover/isabelle/provers/blast/blast.ts +16 -105
  112. package/src/prover/isabelle/provers/blast/branch.ts +0 -33
  113. package/src/prover/isabelle/provers/blast/prove.ts +0 -36
  114. package/src/prover/isabelle/provers/blast/rules.ts +5 -45
  115. package/src/prover/isabelle/provers/blast/state.ts +1 -29
  116. package/src/prover/isabelle/provers/blast/term.ts +8 -37
  117. package/src/prover/isabelle/provers/clasimp.ts +0 -14
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +27 -52
  120. package/src/prover/isabelle/pure/bicompose.ts +24 -39
  121. package/src/prover/isabelle/pure/consts.ts +0 -8
  122. package/src/prover/isabelle/pure/conv.ts +2 -18
  123. package/src/prover/isabelle/pure/drule.ts +95 -45
  124. package/src/prover/isabelle/pure/envir.ts +2 -53
  125. package/src/prover/isabelle/pure/goal.ts +1 -9
  126. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  127. package/src/prover/isabelle/pure/list.ts +0 -3
  128. package/src/prover/isabelle/pure/logic.ts +1 -16
  129. package/src/prover/isabelle/pure/name.ts +1 -10
  130. package/src/prover/isabelle/pure/net.ts +2 -60
  131. package/src/prover/isabelle/pure/object-logic.ts +15 -16
  132. package/src/prover/isabelle/pure/pattern.ts +1 -20
  133. package/src/prover/isabelle/pure/raw-simplifier.ts +16 -63
  134. package/src/prover/isabelle/pure/rewriter.ts +31 -74
  135. package/src/prover/isabelle/pure/search.ts +2 -11
  136. package/src/prover/isabelle/pure/seq.ts +0 -11
  137. package/src/prover/isabelle/pure/simplifier.ts +27 -16
  138. package/src/prover/isabelle/pure/table.ts +2 -33
  139. package/src/prover/isabelle/pure/tactic.ts +11 -23
  140. package/src/prover/isabelle/pure/tactical.ts +47 -48
  141. package/src/prover/isabelle/pure/term-ord.ts +1 -7
  142. package/src/prover/isabelle/pure/term.ts +1 -44
  143. package/src/prover/isabelle/pure/thm.ts +26 -48
  144. package/src/prover/isabelle/pure/type.ts +1 -16
  145. package/src/prover/isabelle/pure/unify.ts +19 -31
  146. package/src/prover/isabelle/pure/variable.ts +2 -8
  147. package/src/prover/isabelle/tla/classical-setup.ts +17 -25
  148. package/src/prover/isabelle/tla/context.ts +65 -26
  149. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  150. package/src/prover/isabelle/tla/logic.ts +53 -32
  151. package/src/prover/isabelle/tla/simpdata.ts +45 -44
  152. package/src/prover/isabelle/tools/intuitionistic.ts +28 -21
  153. package/src/prover/ocaml.ts +4 -7
  154. package/src/prover/prep/action.ts +33 -66
  155. package/src/prover/prep/enabled-axioms.ts +22 -20
  156. package/src/prover/prep/fingerprint.ts +2 -21
  157. package/src/prover/prep/level-comparison.ts +8 -12
  158. package/src/prover/prep/md5.ts +0 -2
  159. package/src/prover/prep/methods.ts +189 -86
  160. package/src/prover/prep/normalize.ts +42 -37
  161. package/src/prover/prove-worker.ts +0 -2
  162. package/src/prover/prove.ts +398 -133
  163. package/src/prover/ptl/decide.ts +96 -56
  164. package/src/prover/ptl/encode.ts +15 -38
  165. package/src/prover/ptl/sat.ts +24 -32
  166. package/src/prover/ptl/tableau.ts +40 -28
  167. package/src/prover/smt/arithmetic.ts +310 -0
  168. package/src/prover/smt/axioms.ts +12 -15
  169. package/src/prover/smt/context.ts +60 -32
  170. package/src/prover/smt/data.ts +517 -401
  171. package/src/prover/smt/encode.ts +155 -85
  172. package/src/prover/smt/extensionality.ts +5 -13
  173. package/src/prover/smt/flatten.ts +7 -28
  174. package/src/prover/smt/format.ts +33 -14
  175. package/src/prover/smt/instances.ts +7 -11
  176. package/src/prover/smt/layout.ts +91 -0
  177. package/src/prover/smt/rewrite.ts +1026 -658
  178. package/src/prover/smt/simplify.ts +441 -0
  179. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  180. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  181. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  182. package/src/prover/smt/solver/act-cache.ts +0 -16
  183. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  184. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  185. package/src/prover/smt/solver/aig.ts +889 -0
  186. package/src/prover/smt/solver/arith-rewriter.ts +615 -53
  187. package/src/prover/smt/solver/arith-terms.ts +121 -0
  188. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  189. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +87 -58
  192. package/src/prover/smt/solver/ast-lt.ts +166 -22
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1424 -180
  195. package/src/prover/smt/solver/auf-solver.ts +7 -44
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/bound-manager.ts +196 -0
  199. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  200. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  201. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  202. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  203. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  204. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  205. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  206. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  207. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  208. package/src/prover/smt/solver/card2bv.ts +110 -0
  209. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  210. package/src/prover/smt/solver/cg-table.ts +39 -42
  211. package/src/prover/smt/solver/check-logic.ts +330 -0
  212. package/src/prover/smt/solver/clause.ts +0 -27
  213. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  214. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  215. package/src/prover/smt/solver/context.ts +519 -175
  216. package/src/prover/smt/solver/ctx-simplify.ts +33 -50
  217. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  218. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  219. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  220. package/src/prover/smt/solver/demodulator.ts +786 -0
  221. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  222. package/src/prover/smt/solver/der.ts +39 -30
  223. package/src/prover/smt/solver/diff-neq.ts +206 -0
  224. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  225. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  226. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  227. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  228. package/src/prover/smt/solver/e-matching.ts +9 -41
  229. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  230. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  231. package/src/prover/smt/solver/enode.ts +100 -23
  232. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  233. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  234. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  235. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  236. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  237. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  238. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  239. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  240. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  241. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  242. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  243. package/src/prover/smt/solver/euf/egraph.ts +907 -0
  244. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  245. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  246. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  247. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  248. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  249. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  250. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  251. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  252. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  253. package/src/prover/smt/solver/expr-ref.ts +0 -5
  254. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  255. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  256. package/src/prover/smt/solver/factor.ts +141 -0
  257. package/src/prover/smt/solver/fd-solver.ts +265 -0
  258. package/src/prover/smt/solver/fingerprints.ts +15 -26
  259. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  260. package/src/prover/smt/solver/flat-literals.ts +0 -9
  261. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  262. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  263. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  264. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  265. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  266. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  267. package/src/prover/smt/solver/goal.ts +176 -28
  268. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  269. package/src/prover/smt/solver/guard-set.ts +219 -0
  270. package/src/prover/smt/solver/hash.ts +0 -9
  271. package/src/prover/smt/solver/hashtable.ts +26 -23
  272. package/src/prover/smt/solver/inf-eps.ts +63 -0
  273. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  274. package/src/prover/smt/solver/internalizer.ts +112 -132
  275. package/src/prover/smt/solver/lackr.ts +381 -0
  276. package/src/prover/smt/solver/lbool.ts +0 -2
  277. package/src/prover/smt/solver/lia2card.ts +268 -0
  278. package/src/prover/smt/solver/lia2pb.ts +154 -0
  279. package/src/prover/smt/solver/literal.ts +0 -4
  280. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  281. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  282. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  283. package/src/prover/smt/solver/lp/containers.ts +11 -30
  284. package/src/prover/smt/solver/lp/core-solver.ts +23 -29
  285. package/src/prover/smt/solver/lp/cross-nested.ts +5 -20
  286. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  287. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  288. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  289. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  290. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  291. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  292. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  293. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  294. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  295. package/src/prover/smt/solver/lp/lar-solver.ts +69 -82
  296. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  297. package/src/prover/smt/solver/lp/lp-settings.ts +0 -14
  298. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  299. package/src/prover/smt/solver/lp/nex-creator.ts +4 -28
  300. package/src/prover/smt/solver/lp/nex.ts +0 -6
  301. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  302. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  303. package/src/prover/smt/solver/lp/nla-core.ts +91 -135
  304. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  305. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  306. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  307. package/src/prover/smt/solver/lp/nla-grobner.ts +22 -72
  308. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  309. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  310. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  311. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  312. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  313. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  314. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  315. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  316. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  317. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  318. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  319. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  320. package/src/prover/smt/solver/lp/nra-solver.ts +123 -112
  321. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  322. package/src/prover/smt/solver/lp/pdd-interval.ts +0 -3
  323. package/src/prover/smt/solver/lp/pdd-simplifier.ts +1 -14
  324. package/src/prover/smt/solver/lp/pdd-solver.ts +2 -33
  325. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  326. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  327. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  328. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  329. package/src/prover/smt/solver/macro-finder.ts +530 -0
  330. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  331. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  332. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  333. package/src/prover/smt/solver/max-cliques.ts +105 -0
  334. package/src/prover/smt/solver/maxcore.ts +309 -0
  335. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  336. package/src/prover/smt/solver/maxlex.ts +115 -0
  337. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  338. package/src/prover/smt/solver/maxsmt.ts +92 -0
  339. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  340. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  341. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  342. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  343. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  344. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  345. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  346. package/src/prover/smt/solver/model-checker.ts +19 -62
  347. package/src/prover/smt/solver/model-evaluator.ts +190 -40
  348. package/src/prover/smt/solver/model-finder.ts +14 -32
  349. package/src/prover/smt/solver/model-generator.ts +56 -40
  350. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  351. package/src/prover/smt/solver/model-printer.ts +214 -0
  352. package/src/prover/smt/solver/mpf.ts +711 -0
  353. package/src/prover/smt/solver/mus.ts +51 -0
  354. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  355. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  356. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  357. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  358. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  359. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  360. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  361. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  362. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  363. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  364. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  365. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  366. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  367. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  368. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  369. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  370. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  371. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  372. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  373. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  374. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  375. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  376. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  377. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  378. package/src/prover/smt/solver/nlqsat.ts +484 -0
  379. package/src/prover/smt/solver/nlsat/algebraic.ts +177 -160
  380. package/src/prover/smt/solver/nlsat/atoms.ts +24 -24
  381. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  382. package/src/prover/smt/solver/nlsat/explain.ts +65 -69
  383. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  384. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -135
  385. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  386. package/src/prover/smt/solver/nlsat/polynomial.ts +29 -161
  387. package/src/prover/smt/solver/nlsat/solver.ts +241 -110
  388. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  389. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  390. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  391. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -47
  392. package/src/prover/smt/solver/nlsat/upolynomial.ts +10 -93
  393. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  394. package/src/prover/smt/solver/nnf.ts +107 -60
  395. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  396. package/src/prover/smt/solver/occf.ts +97 -0
  397. package/src/prover/smt/solver/opt-context.ts +787 -0
  398. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  399. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  400. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  401. package/src/prover/smt/solver/opt-solver.ts +308 -0
  402. package/src/prover/smt/solver/opt-value.ts +55 -0
  403. package/src/prover/smt/solver/optsmt.ts +692 -0
  404. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  405. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  406. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  407. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  408. package/src/prover/smt/solver/poly-rewriter.ts +204 -79
  409. package/src/prover/smt/solver/probes.ts +512 -0
  410. package/src/prover/smt/solver/propagate-values.ts +37 -30
  411. package/src/prover/smt/solver/proto-model.ts +650 -66
  412. package/src/prover/smt/solver/pull-quant.ts +28 -23
  413. package/src/prover/smt/solver/purify-arith.ts +632 -0
  414. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  415. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  416. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  417. package/src/prover/smt/solver/qe-lite.ts +39 -49
  418. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  419. package/src/prover/smt/solver/qe.ts +1498 -0
  420. package/src/prover/smt/solver/qel.ts +25 -0
  421. package/src/prover/smt/solver/qi-queue.ts +0 -16
  422. package/src/prover/smt/solver/qsat.ts +814 -0
  423. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  424. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  425. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  426. package/src/prover/smt/solver/quantifier-manager.ts +8 -23
  427. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  428. package/src/prover/smt/solver/random-gen.ts +0 -2
  429. package/src/prover/smt/solver/rational.ts +45 -8
  430. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  431. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  432. package/src/prover/smt/solver/reduce-args.ts +225 -0
  433. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  434. package/src/prover/smt/solver/ref-vector.ts +0 -6
  435. package/src/prover/smt/solver/relevancy.ts +2 -16
  436. package/src/prover/smt/solver/rewriter-tpl.ts +52 -129
  437. package/src/prover/smt/solver/rewriter.ts +477 -120
  438. package/src/prover/smt/solver/rlimit.ts +39 -21
  439. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  440. package/src/prover/smt/solver/sat/big.ts +177 -0
  441. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  442. package/src/prover/smt/solver/sat/clause.ts +203 -0
  443. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  444. package/src/prover/smt/solver/sat/config.ts +122 -0
  445. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  446. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  447. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  448. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  449. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  450. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  451. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  452. package/src/prover/smt/solver/sat/probing.ts +170 -0
  453. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  454. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  455. package/src/prover/smt/solver/sat/scc.ts +142 -0
  456. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  457. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  458. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  459. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  460. package/src/prover/smt/solver/search-tree.ts +284 -0
  461. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  462. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  463. package/src/prover/smt/solver/seq-derive.ts +1301 -0
  464. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  465. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  466. package/src/prover/smt/solver/seq-factory.ts +89 -0
  467. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  468. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  469. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  470. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  471. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  472. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  473. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  474. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  475. package/src/prover/smt/solver/seq-subset.ts +165 -0
  476. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  477. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  478. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  479. package/src/prover/smt/solver/smt-logics.ts +66 -0
  480. package/src/prover/smt/solver/smt-setup.ts +496 -0
  481. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  482. package/src/prover/smt/solver/smtlib-parser.ts +3140 -365
  483. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  484. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  485. package/src/prover/smt/solver/solver.ts +119 -39
  486. package/src/prover/smt/solver/sort.ts +1 -5
  487. package/src/prover/smt/solver/static-features.ts +314 -0
  488. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  489. package/src/prover/smt/solver/tactic.ts +1986 -0
  490. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  491. package/src/prover/smt/solver/theory-array.ts +1240 -0
  492. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  493. package/src/prover/smt/solver/theory-char.ts +355 -0
  494. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  495. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  496. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  497. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  498. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  499. package/src/prover/smt/solver/theory-lra-final-check.ts +59 -91
  500. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -53
  501. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  502. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -40
  503. package/src/prover/smt/solver/theory-lra-state.ts +6 -27
  504. package/src/prover/smt/solver/theory-lra.ts +188 -8
  505. package/src/prover/smt/solver/theory-pb.ts +934 -0
  506. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  507. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  508. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  509. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  510. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  511. package/src/prover/smt/solver/theory-seq.ts +961 -0
  512. package/src/prover/smt/solver/theory.ts +189 -0
  513. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  514. package/src/prover/smt/solver/var-subst.ts +37 -39
  515. package/src/prover/smt/table.ts +3 -10
  516. package/src/prover/smt/types.ts +146 -0
  517. package/src/prover/tlapm/cache.ts +67 -41
  518. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  519. package/src/prover/tlapm/tlapm.ts +21 -20
  520. package/src/prover/tlapm-library.ts +3208 -0
  521. package/src/prover/verdict.ts +9 -2
  522. package/src/prover/zenon/check/check.ts +1 -11
  523. package/src/prover/zenon/check/definitions.ts +5 -15
  524. package/src/prover/zenon/check/equality.ts +0 -8
  525. package/src/prover/zenon/check/functions.ts +0 -4
  526. package/src/prover/zenon/check/keys.ts +0 -7
  527. package/src/prover/zenon/check/propositional.ts +0 -3
  528. package/src/prover/zenon/check/records.ts +1 -6
  529. package/src/prover/zenon/check/relations.ts +2 -14
  530. package/src/prover/zenon/check/rewrites.ts +2 -21
  531. package/src/prover/zenon/check/sets.ts +40 -61
  532. package/src/prover/zenon/check/terms.ts +1 -19
  533. package/src/prover/zenon/check/tla.ts +0 -6
  534. package/src/prover/zenon/decide.ts +10 -19
  535. package/src/prover/zenon/encode.ts +0 -9
  536. package/src/prover/zenon/eqrel.ts +2 -15
  537. package/src/prover/zenon/equality-rules.ts +0 -6
  538. package/src/prover/zenon/expr.ts +8 -28
  539. package/src/prover/zenon/index-table.ts +26 -59
  540. package/src/prover/zenon/isar-case.ts +8 -20
  541. package/src/prover/zenon/isar.ts +35 -65
  542. package/src/prover/zenon/limits.ts +0 -4
  543. package/src/prover/zenon/llproof.ts +2 -22
  544. package/src/prover/zenon/mltoll.ts +66 -106
  545. package/src/prover/zenon/node.ts +20 -15
  546. package/src/prover/zenon/ocaml.ts +1 -17
  547. package/src/prover/zenon/parse.ts +9 -13
  548. package/src/prover/zenon/phrase.ts +1 -13
  549. package/src/prover/zenon/proof.ts +0 -11
  550. package/src/prover/zenon/propositional-rules.ts +0 -7
  551. package/src/prover/zenon/rules.ts +2 -8
  552. package/src/prover/zenon/search.ts +11 -35
  553. package/src/prover/zenon/tla/functions.ts +59 -33
  554. package/src/prover/zenon/tla/llproof.ts +67 -78
  555. package/src/prover/zenon/tla/records.ts +57 -35
  556. package/src/prover/zenon/tla/rewrites.ts +12 -21
  557. package/src/prover/zenon/tla/sets.ts +88 -59
  558. package/src/prover/zenon/tla/terms.ts +0 -8
  559. package/src/prover/zenon/tla/tla.ts +66 -66
  560. package/src/randomization.ts +81 -35
  561. package/src/resolve.ts +67 -185
  562. package/src/runtime.ts +26 -22
  563. package/src/sany/builtins.ts +2 -5
  564. package/src/sany/generation.ts +394 -0
  565. package/src/sany/generator-def-entries.ts +210 -0
  566. package/src/sany/generator-definitions.ts +686 -0
  567. package/src/sany/generator-expressions.ts +1100 -0
  568. package/src/sany/generator-proofs.ts +662 -0
  569. package/src/sany/generator.ts +191 -2764
  570. package/src/sany/levels.ts +5 -35
  571. package/src/sany/lexer.ts +58 -77
  572. package/src/sany/linter.ts +0 -10
  573. package/src/sany/modules.ts +1 -5
  574. package/src/sany/nodes.ts +5 -43
  575. package/src/sany/parse-error.ts +39 -117
  576. package/src/sany/report.ts +32 -69
  577. package/src/sany/selectors.ts +49 -76
  578. package/src/sany/source.ts +1 -17
  579. package/src/sany/xml.ts +35 -117
  580. package/src/search.ts +671 -169
  581. package/src/simulate.ts +712 -0
  582. package/src/spec-description.ts +192 -100
  583. package/src/standard-definitions.ts +4 -4
  584. package/src/standard-modules.ts +264 -95
  585. package/src/state-graph.ts +52 -33
  586. package/src/subexpressions.ts +69 -52
  587. package/src/substitution-levels.ts +7 -7
  588. package/src/successors.ts +267 -100
  589. package/src/symmetry.ts +35 -27
  590. package/src/tableau.ts +29 -26
  591. package/src/tlc/fingerprint.ts +267 -79
  592. package/src/tlc/jar-data.ts +112 -6
  593. package/src/tlc/messages.ts +125 -54
  594. package/src/tlc/order.ts +39 -69
  595. package/src/tlc/random.ts +37 -49
  596. package/src/tlc/replay.ts +553 -228
  597. package/src/tlc/summary.ts +64 -60
  598. package/src/tlc/tlc-operators.ts +78 -44
  599. package/src/tlc/tlcext-operators.ts +171 -122
  600. package/src/tlc/trace-spec.ts +249 -0
  601. package/src/tlc/value-stream.ts +139 -0
  602. package/src/tlc/version.ts +1 -4
  603. package/src/transfer.ts +22 -25
  604. package/src/typed-tier.ts +6535 -0
  605. package/src/typescript/actions.ts +479 -0
  606. package/src/typescript/collections.ts +614 -0
  607. package/src/typescript/compile.ts +63 -0
  608. package/src/typescript/context.ts +94 -0
  609. package/src/typescript/emit.ts +121 -0
  610. package/src/typescript/expressions.ts +496 -0
  611. package/src/typescript/formula.ts +154 -0
  612. package/src/typescript/functions.ts +284 -0
  613. package/src/typescript/model.ts +162 -0
  614. package/src/typescript/names.ts +114 -0
  615. package/src/typescript/program.ts +48 -0
  616. package/src/typescript/properties.ts +139 -0
  617. package/src/typescript/scope.ts +112 -0
  618. package/src/typescript/steps.ts +167 -0
  619. package/src/typescript/types.ts +171 -0
  620. package/src/values.ts +832 -484
  621. package/src/worker.ts +7 -8
  622. package/src/prover/isabelle/isar/statement.ts +0 -57
  623. package/src/prover/smt/solver/z3-license.txt +0 -10
  624. package/src/prover/tlaps-module.ts +0 -510
  625. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,141 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ OP_AND,
5
+ OP_EQ,
6
+ OP_GE,
7
+ OP_GT,
8
+ OP_LE,
9
+ OP_LT,
10
+ OP_MUL,
11
+ OP_OR,
12
+ OP_POWER,
13
+ SORT_BOOL,
14
+ SORT_INT,
15
+ SORT_REAL,
16
+ } from "./ast";
17
+ import { runSimplifier } from "./dependent-expr-state";
18
+ import { Expr2Polynomial } from "./expr2polynomial";
19
+ import type { Goal } from "./goal";
20
+ import { getLcm, Rational } from "./rational";
21
+ import { PolynomialManager } from "./nlsat/polynomial";
22
+ import type { Rewrite } from "./rewriter-tpl";
23
+ import { RewriterTpl } from "./rewriter-tpl";
24
+
25
+ const FLIPPED = new Map([
26
+ [OP_LT, OP_GT],
27
+ [OP_LE, OP_GE],
28
+ [OP_GT, OP_LT],
29
+ [OP_GE, OP_LE],
30
+ ]);
31
+
32
+ class FactorRewriter extends RewriterTpl {
33
+ readonly expr2poly: Expr2Polynomial;
34
+
35
+ constructor(
36
+ manager: AstManager,
37
+ private isSplittingFactors: boolean,
38
+ ) {
39
+ super(manager);
40
+ this.expr2poly = new Expr2Polynomial(manager, new PolynomialManager());
41
+ }
42
+
43
+ private mkZeroFor(expr: number) {
44
+ const sort = this.manager.sorts[expr] === SORT_INT ? SORT_INT : SORT_REAL;
45
+ return this.manager.mkNumeralOfSort(Rational.of(0n), sort);
46
+ }
47
+
48
+ private mkMul(args: number[]) {
49
+ return args.length === 1
50
+ ? args[0]
51
+ : this.manager.mkApp(OP_MUL, args, this.manager.sorts[args[0]]);
52
+ }
53
+
54
+ private factor(op: number, lhs: number, rhs: number): number {
55
+ const manager = this.manager;
56
+ const pm = this.expr2poly.pm;
57
+ const first = this.expr2poly.toPolynomial(lhs);
58
+ const second = this.expr2poly.toPolynomial(rhs);
59
+ const lcm = getLcm(first.denominator, second.denominator);
60
+ const polynomial = pm.addmul(
61
+ lcm / first.denominator,
62
+ first.polynomial,
63
+ -(lcm / second.denominator),
64
+ second.polynomial,
65
+ );
66
+ if (pm.isConst(polynomial)) return -1;
67
+ const factors = pm.factor(polynomial);
68
+ if (factors.factors.length === 1 && factors.degrees[0] === 1) return -1;
69
+ const terms = factors.factors.map((factor) => this.expr2poly.toExpr(factor, true));
70
+ if (op === OP_EQ) {
71
+ if (!this.isSplittingFactors)
72
+ return manager.mkEq(this.mkMul(terms), this.mkZeroFor(terms[terms.length - 1]));
73
+ const eqs = terms.map((term) => manager.mkEq(term, this.mkZeroFor(term)));
74
+ return eqs.length === 1 ? eqs[0] : manager.mkApp(OP_OR, eqs, SORT_BOOL);
75
+ }
76
+ const kind = factors.constant < 0n ? (FLIPPED.get(op) as number) : op;
77
+ if (!this.isSplittingFactors) {
78
+ const args = terms.map((term, index) =>
79
+ factors.degrees[index] % 2 === 0
80
+ ? manager.mkApp(
81
+ OP_POWER,
82
+ [term, manager.mkNumeralOfSort(Rational.of(2n), manager.sorts[term])],
83
+ SORT_REAL,
84
+ )
85
+ : term,
86
+ );
87
+ const product = this.mkMul(args);
88
+ return manager.mkApp(kind, [product, this.mkZeroFor(product)], SORT_BOOL);
89
+ }
90
+ const isStrict = kind === OP_LT || kind === OP_GT;
91
+ const args: number[] = [];
92
+ const oddFactors: number[] = [];
93
+ for (const [index, term] of terms.entries()) {
94
+ if (factors.degrees[index] % 2 !== 0) {
95
+ oddFactors.push(term);
96
+ continue;
97
+ }
98
+ const eq = manager.mkEq(term, this.mkZeroFor(term));
99
+ args.push(isStrict ? manager.mkNot(eq) : eq);
100
+ }
101
+ if (oddFactors.length === 0) {
102
+ if (kind === OP_LT) return manager.falseExpr;
103
+ if (kind === OP_GE) return manager.trueExpr;
104
+ } else {
105
+ const product = this.mkMul(oddFactors);
106
+ args.push(manager.mkApp(kind, [product, this.mkZeroFor(oddFactors[0])], SORT_BOOL));
107
+ }
108
+ if (args.length === 1) return args[0];
109
+ return manager.mkApp(isStrict ? OP_AND : OP_OR, args, SORT_BOOL);
110
+ }
111
+
112
+ reduceApp(decl: number, args: number[]): number | Rewrite {
113
+ const manager = this.manager;
114
+ if (args.length !== 2) return -1;
115
+ const funcDecl = manager.funcDecls[decl];
116
+ const isArith = (expr: number) => manager.getFamily(expr) === FAMILY_ARITH;
117
+ const isFactoring =
118
+ (funcDecl.op === OP_EQ &&
119
+ (isArith(args[0]) || isArith(args[1])) &&
120
+ !manager.isBool(args[0])) ||
121
+ (funcDecl.family === FAMILY_ARITH && FLIPPED.has(funcDecl.op));
122
+ if (!isFactoring) return -1;
123
+ const outer = manager.beginTemporaries();
124
+ const result = this.factor(funcDecl.op, args[0], args[1]);
125
+ if (result !== -1) manager.incRef(result);
126
+ manager.endTemporaries(outer);
127
+ return result;
128
+ }
129
+ }
130
+
131
+ export const factor = (manager: AstManager, goal: Goal, isSplittingFactors: boolean) =>
132
+ runSimplifier(goal, false, (state) => {
133
+ const rewriter = new FactorRewriter(manager, isSplittingFactors);
134
+ return {
135
+ reduce: () => state.rewriteEach((form) => rewriter.rewrite(form)),
136
+ release: () => {
137
+ rewriter.expr2poly.release();
138
+ rewriter.release();
139
+ },
140
+ };
141
+ });
@@ -0,0 +1,265 @@
1
+ import { SmtCanceledError } from "../../../errors";
2
+ import {
3
+ type AstManager,
4
+ KIND_APP,
5
+ KIND_QUANTIFIER,
6
+ OP_ADD,
7
+ OP_AND,
8
+ OP_EQ,
9
+ OP_IMPLIES,
10
+ OP_UBV2INT,
11
+ OP_ULEQ,
12
+ SORT_BOOL,
13
+ SORT_INT,
14
+ } from "./ast";
15
+ import { BoundManager } from "./bound-manager";
16
+ import { mkBvApp } from "./bv-decl-plugin";
17
+ import { Bv2IntContext, Bv2IntRewriter } from "./bv2int-rewriter";
18
+ import { card2bv } from "./card2bv";
19
+ import { runEnum2Bv } from "./dt2bv-tactic";
20
+ import { ExprSafeReplace } from "./expr-safe-replace";
21
+ import { type Definition, Goal } from "./goal";
22
+ import { ObjMap } from "./hashtable";
23
+ import { L_FALSE, L_TRUE } from "./lbool";
24
+ import { RefVector } from "./ref-vector";
25
+ import { Rewriter } from "./rewriter";
26
+ import { convertModel, getRewriterOptions } from "./tactic";
27
+ import { UINT_MAX } from "./sat/clause";
28
+ import type { SatParams } from "./sat/config";
29
+ import { IncSatSolver } from "./sat/inc-sat-solver";
30
+ import { SubstReplacer } from "./solve-eqs";
31
+
32
+ const getNumBits = (value: bigint) => {
33
+ let bound = 1n;
34
+ let numBits = 1;
35
+ while (bound <= value) {
36
+ numBits++;
37
+ bound *= 2n;
38
+ }
39
+ return numBits;
40
+ };
41
+
42
+ const collectBounds = (manager: AstManager, bounds: BoundManager, form: number) => {
43
+ if (manager.getOp(form) !== OP_AND) {
44
+ bounds.add(form);
45
+ return;
46
+ }
47
+ for (const arg of manager.getArgs(form)) collectBounds(manager, bounds, arg);
48
+ };
49
+
50
+ // bounded_int2bv_simplifier: an integer constant between two bounds becomes an unsigned
51
+ // bit-vector plus the lower bound.
52
+ const runBoundedInt2Bv = (manager: AstManager, goal: Goal) => {
53
+ const bounds = new BoundManager(manager);
54
+ for (const form of goal.forms.items) collectBounds(manager, bounds, form);
55
+ const substitution = new ObjMap<number>((expr) => manager.hashes[expr]);
56
+ const trail = new RefVector(manager);
57
+ const sideConditions = new RefVector(manager);
58
+ const definitions: Definition[] = [];
59
+ for (const expr of bounds.boundedVars) {
60
+ const lower = bounds.lowers.get(expr);
61
+ const upper = bounds.uppers.get(expr);
62
+ if (
63
+ lower === undefined ||
64
+ upper === undefined ||
65
+ lower.value.compare(upper.value) > 0 ||
66
+ lower.isStrict ||
67
+ upper.isStrict ||
68
+ manager.sorts[expr] !== SORT_INT
69
+ )
70
+ continue;
71
+ const domainSize = upper.value.sub(lower.value).num + 1n;
72
+ const numBits = getNumBits(domainSize);
73
+ const bits = manager.mkFreshConst("b", manager.mkBvSort(numBits));
74
+ trail.push(bits);
75
+ const offset = lower.value;
76
+ const unsigned = mkBvApp(manager, OP_UBV2INT, [bits]);
77
+ const replacement = offset.isZero()
78
+ ? unsigned
79
+ : manager.mkApp(OP_ADD, [unsigned, manager.mkNumeral(offset.num)], SORT_INT);
80
+ trail.push(replacement);
81
+ definitions.push(
82
+ { decl: manager.decls[bits], def: -1 },
83
+ { decl: manager.decls[expr], def: replacement },
84
+ );
85
+ if (!offset.isZero() && (domainSize & (domainSize - 1n)) !== 0n)
86
+ sideConditions.push(
87
+ mkBvApp(manager, OP_ULEQ, [bits, manager.mkBvNumeral(domainSize - 1n, numBits)]),
88
+ );
89
+ substitution.set(expr, replacement);
90
+ }
91
+ if (substitution.size > 0) {
92
+ const replacer = new SubstReplacer(manager, substitution);
93
+ const context = new Bv2IntContext(manager, UINT_MAX);
94
+ const rewriter = new Bv2IntRewriter(manager, context);
95
+ for (let index = 0; index < goal.forms.size; index++) {
96
+ const form = goal.forms.items[index];
97
+ const replaced = replacer.rewrite(form);
98
+ const result = rewriter.rewrite(replaced);
99
+ manager.decRef(replaced);
100
+ if (result !== form) goal.update(index, result);
101
+ manager.decRef(result);
102
+ }
103
+ rewriter.release();
104
+ context.release();
105
+ replacer.release();
106
+ }
107
+ for (const condition of sideConditions.items) goal.assert(condition);
108
+ if (definitions.length > 0) goal.addDefinitions(definitions);
109
+ sideConditions.reset();
110
+ trail.reset();
111
+ };
112
+
113
+ const runFdSimplifier = (manager: AstManager, forms: readonly number[]) => {
114
+ const fmls = new Goal(manager);
115
+ for (const form of forms) fmls.assert(form);
116
+ runBoundedInt2Bv(manager, fmls);
117
+ card2bv(manager, fmls, getRewriterOptions(manager, new Map()));
118
+ runEnum2Bv(manager, fmls);
119
+ return fmls;
120
+ };
121
+
122
+ // The sole uninterpreted constant of a term, which stands for it in the SAT solver.
123
+ const getRepresentative = (manager: AstManager, expr: number) => {
124
+ const visited = new Set<number>();
125
+ const todo = [expr];
126
+ let result = -1;
127
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
128
+ if (visited.has(current)) continue;
129
+ visited.add(current);
130
+ if (manager.isUninterpretedConst(current)) {
131
+ if (result !== -1 && result !== current) return -1;
132
+ result = current;
133
+ } else if (manager.kinds[current] === KIND_QUANTIFIER)
134
+ todo.push(manager.getQuantifier(current).body);
135
+ else if (manager.kinds[current] === KIND_APP) manager.pushArgs(current, todo);
136
+ }
137
+ return result;
138
+ };
139
+
140
+ // simplifier_solver::get_consequences over the fd solver: a variable the simplifier defines is
141
+ // queried through the constant of its definition, and its value is decoded from that constant's.
142
+ export const getFdConsequences = (
143
+ manager: AstManager,
144
+ params: SatParams,
145
+ forms: readonly number[],
146
+ assumptions: readonly number[],
147
+ vars: readonly number[],
148
+ ) => {
149
+ const fmls = runFdSimplifier(manager, forms);
150
+ const trail = new RefVector(manager);
151
+ const definitions = new ExprSafeReplace(manager);
152
+ for (const converter of fmls.converters)
153
+ if ("definitions" in converter)
154
+ for (const definition of converter.definitions) {
155
+ const decl = manager.funcDecls[definition.decl];
156
+ if (definition.def !== -1 && decl.domain.length === 0)
157
+ definitions.insert(manager.mkApp(definition.decl, [], decl.range), definition.def);
158
+ }
159
+ const rewriter = new Rewriter(manager, getRewriterOptions(manager, new Map()));
160
+ const rewrite = (expr: number) => {
161
+ const result = rewriter.rewrite(expr);
162
+ trail.pushOwned(result);
163
+ return result;
164
+ };
165
+ const flush = (expr: number) => {
166
+ const replaced = definitions.apply(expr);
167
+ trail.pushOwned(replaced);
168
+ return rewrite(replaced);
169
+ };
170
+ const asms1 = assumptions.map(flush);
171
+ const vars1 = vars.map(flush);
172
+ const queryVars = vars1.map((expr) => {
173
+ const representative = getRepresentative(manager, expr);
174
+ return representative === -1 ? expr : representative;
175
+ });
176
+ const solver = new IncSatSolver(manager, params);
177
+ try {
178
+ for (const form of fmls.forms.items) solver.assertExpr(form);
179
+ if (fmls.isInconsistent) solver.assertExpr(manager.falseExpr);
180
+ const found = solver.getConsequences(asms1, queryVars);
181
+ const coreReplace = new ExprSafeReplace(manager);
182
+ asms1.forEach((assumption, index) => coreReplace.insert(assumption, assumptions[index]));
183
+ const consequences = new RefVector(manager);
184
+ for (const consequence of found.consequences) {
185
+ const premise = manager.getArg(consequence, 0);
186
+ const conclusion = manager.getArg(consequence, 1);
187
+ const [query, value] = (() => {
188
+ if (manager.decls[conclusion] === OP_EQ) {
189
+ const lhs = manager.getArg(conclusion, 0);
190
+ const rhs = manager.getArg(conclusion, 1);
191
+ for (const queryVar of queryVars) {
192
+ if (lhs === queryVar) return [lhs, rhs];
193
+ if (rhs === queryVar) return [rhs, lhs];
194
+ }
195
+ return [-1, -1];
196
+ }
197
+ if (manager.isUninterpretedConst(conclusion)) return [conclusion, manager.trueExpr];
198
+ if (
199
+ manager.isNot(conclusion) &&
200
+ manager.isUninterpretedConst(manager.getArg(conclusion, 0))
201
+ )
202
+ return [manager.getArg(conclusion, 0), manager.falseExpr];
203
+ return [-1, -1];
204
+ })();
205
+ const index = queryVars.findIndex(
206
+ (queryVar, position) => queryVar === query && vars[position] !== vars1[position],
207
+ );
208
+ const decoded = (() => {
209
+ if (query === -1 || index === -1) return consequence;
210
+ const substitution = new ExprSafeReplace(manager);
211
+ substitution.insert(query, value);
212
+ const replaced = substitution.apply(vars1[index]);
213
+ trail.pushOwned(replaced);
214
+ substitution.release();
215
+ return manager.mkApp(
216
+ OP_IMPLIES,
217
+ [premise, manager.mkEq(vars[index], rewrite(replaced))],
218
+ SORT_BOOL,
219
+ );
220
+ })();
221
+ consequences.pushOwned(coreReplace.apply(decoded));
222
+ }
223
+ coreReplace.release();
224
+ const model = found.result === L_TRUE ? solver.getModel() : null;
225
+ model?.incRef();
226
+ return {
227
+ result: found.result,
228
+ consequences,
229
+ model: model === null ? undefined : convertModel(fmls, model),
230
+ };
231
+ } finally {
232
+ solver.release();
233
+ rewriter.release();
234
+ definitions.release();
235
+ trail.reset();
236
+ }
237
+ };
238
+
239
+ // qffd without parallel.enable: solver2tactic over simplifier_solver(inc_sat_solver, fd_simplifier).
240
+ export const createFdTactic = (manager: AstManager, params: SatParams) => (goal: Goal) => {
241
+ const fmls = runFdSimplifier(manager, goal.forms.items);
242
+ const solver = new IncSatSolver(manager, params, false);
243
+ try {
244
+ for (const form of fmls.forms.items) solver.assertExpr(form);
245
+ const result = fmls.isInconsistent ? L_FALSE : solver.check();
246
+ goal.reset();
247
+ if (result === L_TRUE) {
248
+ const model = solver.getModel();
249
+ model?.incRef();
250
+ if (model !== null) {
251
+ goal.converters = [...goal.converters, ...fmls.converters];
252
+ goal.model = model;
253
+ }
254
+ } else if (result === L_FALSE) goal.assert(manager.falseExpr);
255
+ else {
256
+ if (!manager.limit.inc()) throw new SmtCanceledError();
257
+ for (const form of solver.getAssertions()) goal.assert(form);
258
+ goal.converters = [...goal.converters, ...fmls.converters, ...solver.getConverters()];
259
+ }
260
+ goal.depth++;
261
+ return [goal];
262
+ } finally {
263
+ solver.release();
264
+ }
265
+ };
@@ -1,62 +1,51 @@
1
- // Ported from Z3 (src/smt/fingerprints.cpp), MIT license, see z3-license.txt. The set of
2
- // quantifier instances already found, so a match on equal terms is not instantiated twice. Scopes
3
- // undo the insertions.
4
1
  import type { AstManager } from "./ast";
5
2
  import type { Enode } from "./enode";
6
3
  import { getCompositeHash } from "./hash";
7
4
  import { shrink } from "./array";
8
5
 
9
6
  export class FingerprintSet {
10
- // The quantifier, hash and roots of each fingerprint, in the order of insertion.
11
- private quantifiers: number[] = [];
7
+ private datas: number[] = [];
12
8
  private hashes: number[] = [];
13
9
  private roots: Enode[][] = [];
14
- // Open addressing with linear probing over the indices of the fingerprints, -1 for an empty slot.
15
- // Scopes remove the newest fingerprints first, and the table grows by inserting them in order, so
16
- // emptying the slot of a removed fingerprint never cuts the probe of one that remains.
17
10
  private slots = new Int32Array(1024).fill(-1);
18
11
  private scopes: number[] = [];
19
- // The hashes and the roots of the bindings of the instance being inserted.
20
12
  private bindingHashes: number[] = [];
21
13
  private bindingRoots: Enode[] = [];
22
14
 
23
15
  constructor(private manager: AstManager) {}
24
16
 
25
- // fingerprint_set::insert: the roots of the bindings, which a new fingerprint keeps, or null when
26
- // the instance is already in the set. The hash comes from the bindings themselves, and the set is
27
- // searched with the bindings and then with their roots.
28
- insert(quantifier: number, bindings: Enode[]) {
17
+ // The hash comes from the bindings themselves, and the set is searched with the bindings and
18
+ // then with their roots.
19
+ insert(data: number, dataHash: number, bindings: Enode[]) {
29
20
  const manager = this.manager;
30
21
  const bindingHashes = this.bindingHashes;
31
22
  shrink(bindingHashes, 0);
32
23
  for (const binding of bindings) bindingHashes.push(manager.hashes[binding.owner]);
33
- const hash = getCompositeHash(bindingHashes, manager.ids[quantifier]);
34
- if (this.find(quantifier, hash, bindings) === -1) return null;
24
+ const hash = getCompositeHash(bindingHashes, dataHash);
25
+ if (this.find(data, hash, bindings) === -1) return null;
35
26
  const bindingRoots = this.bindingRoots;
36
27
  shrink(bindingRoots, 0);
37
28
  for (const binding of bindings) bindingRoots.push(binding.root);
38
- const slot = this.find(quantifier, hash, bindingRoots);
29
+ const slot = this.find(data, hash, bindingRoots);
39
30
  if (slot === -1) return null;
40
31
  const roots = bindingRoots.slice();
41
- this.quantifiers.push(quantifier);
32
+ this.datas.push(data);
42
33
  this.hashes.push(hash);
43
34
  this.roots.push(roots);
44
- if (2 * this.quantifiers.length <= this.slots.length)
45
- this.slots[slot] = this.quantifiers.length - 1;
35
+ if (2 * this.datas.length <= this.slots.length) this.slots[slot] = this.datas.length - 1;
46
36
  else {
47
37
  this.slots = new Int32Array(2 * this.slots.length).fill(-1);
48
- for (let index = 0; index < this.quantifiers.length; index++) this.place(index);
38
+ for (let index = 0; index < this.datas.length; index++) this.place(index);
49
39
  }
50
40
  return roots;
51
41
  }
52
42
 
53
- // The empty slot that ends the probe for the fingerprint, or -1 when the set has it.
54
- private find(quantifier: number, hash: number, args: Enode[]) {
43
+ private find(data: number, hash: number, args: Enode[]) {
55
44
  const mask = this.slots.length - 1;
56
45
  let slot = hash & mask;
57
46
  for (; this.slots[slot] !== -1; slot = (slot + 1) & mask) {
58
47
  const index = this.slots[slot];
59
- if (this.hashes[index] !== hash || this.quantifiers[index] !== quantifier) continue;
48
+ if (this.hashes[index] !== hash || this.datas[index] !== data) continue;
60
49
  const existing = this.roots[index];
61
50
  let position = 0;
62
51
  while (position < args.length && existing[position] === args[position]) position++;
@@ -73,18 +62,18 @@ export class FingerprintSet {
73
62
  }
74
63
 
75
64
  push() {
76
- this.scopes.push(this.quantifiers.length);
65
+ this.scopes.push(this.datas.length);
77
66
  }
78
67
 
79
68
  pop(numScopes: number) {
80
69
  const limit = this.scopes[this.scopes.length - numScopes];
81
70
  const mask = this.slots.length - 1;
82
- for (let index = this.quantifiers.length - 1; index >= limit; index--) {
71
+ for (let index = this.datas.length - 1; index >= limit; index--) {
83
72
  let slot = this.hashes[index] & mask;
84
73
  while (this.slots[slot] !== index) slot = (slot + 1) & mask;
85
74
  this.slots[slot] = -1;
86
75
  }
87
- shrink(this.quantifiers, limit);
76
+ shrink(this.datas, limit);
88
77
  shrink(this.hashes, limit);
89
78
  shrink(this.roots, limit);
90
79
  shrink(this.scopes, this.scopes.length - numScopes);
@@ -0,0 +1,148 @@
1
+ import {
2
+ type AstManager,
3
+ FAMILY_ARITH,
4
+ FAMILY_USER,
5
+ KIND_APP,
6
+ OP_ADD,
7
+ OP_EQ,
8
+ isArithSort,
9
+ } from "./ast";
10
+ import type { Goal } from "./goal";
11
+ import { ObjMap } from "./hashtable";
12
+ import { Rational } from "./rational";
13
+ import { Rewriter, type RewriterOptions } from "./rewriter";
14
+
15
+ class TargetFinder {
16
+ private visited = new Set<number>();
17
+ private todo: number[] = [];
18
+ readonly occs: ObjMap<number>;
19
+ readonly nonNestedOccs: ObjMap<number>;
20
+
21
+ constructor(private manager: AstManager) {
22
+ this.occs = new ObjMap((expr) => manager.hashes[expr]);
23
+ this.nonNestedOccs = new ObjMap((expr) => manager.hashes[expr]);
24
+ }
25
+
26
+ private isUninterp(expr: number) {
27
+ const manager = this.manager;
28
+ return manager.kinds[expr] === KIND_APP && manager.getFamily(expr) === FAMILY_USER;
29
+ }
30
+
31
+ private isArith(expr: number) {
32
+ return isArithSort(this.manager.sorts[expr]);
33
+ }
34
+
35
+ private visit(expr: number, isNested: boolean) {
36
+ if (this.isUninterp(expr) && this.manager.getNumArgs(expr) === 0 && this.isArith(expr)) {
37
+ this.occs.set(expr, (this.occs.get(expr) ?? 0) + 1);
38
+ if (!isNested) this.nonNestedOccs.set(expr, (this.nonNestedOccs.get(expr) ?? 0) + 1);
39
+ }
40
+ if (this.visited.has(expr)) return;
41
+ this.visited.add(expr);
42
+ this.todo.push(expr);
43
+ }
44
+
45
+ private processApp(expr: number) {
46
+ if (!this.isUninterp(expr) && !this.isArith(expr)) return false;
47
+ for (const arg of this.manager.getArgs(expr)) this.visit(arg, false);
48
+ return true;
49
+ }
50
+
51
+ private processAtom(first: number, second: number, isNested: boolean) {
52
+ const manager = this.manager;
53
+ if (this.isUninterp(first) && this.isUninterp(second)) {
54
+ this.visit(first, isNested);
55
+ this.visit(second, isNested);
56
+ return true;
57
+ }
58
+ const [lhs, rhs] = manager.isNumeral(first) ? [second, first] : [first, second];
59
+ if (!manager.isNumeral(rhs) || manager.getOp(lhs) !== OP_ADD || manager.getNumArgs(lhs) !== 2)
60
+ return false;
61
+ const term = manager.getArg(lhs, 0);
62
+ const subtracted = manager.getTimesMinusOneArg(manager.getArg(lhs, 1));
63
+ if (subtracted === undefined || !this.isUninterp(term) || !this.isUninterp(subtracted))
64
+ return false;
65
+ this.visit(term, isNested);
66
+ this.visit(subtracted, isNested);
67
+ return true;
68
+ }
69
+
70
+ private processArith(expr: number, isNested: boolean) {
71
+ const manager = this.manager;
72
+ const args = manager.getArgs(expr);
73
+ if (!this.isArith(expr) && args.length === 2)
74
+ return this.processAtom(args[0], args[1], isNested);
75
+ if (
76
+ manager.getOp(expr) !== OP_ADD ||
77
+ args.length !== 2 ||
78
+ !this.isUninterp(args[1]) ||
79
+ !manager.isNumeral(args[0])
80
+ )
81
+ return false;
82
+ this.visit(args[1], isNested);
83
+ return true;
84
+ }
85
+
86
+ private isArithApp(expr: number) {
87
+ const manager = this.manager;
88
+ return manager.kinds[expr] === KIND_APP && manager.getFamily(expr) === FAMILY_ARITH;
89
+ }
90
+
91
+ // Constants visited at the top stay on the work list until a later formula drains it.
92
+ process(form: number) {
93
+ const manager = this.manager;
94
+ if (this.visited.has(form)) return true;
95
+ let expr = form;
96
+ while (manager.isNot(expr)) expr = manager.getArg(expr, 0);
97
+ if (this.isArithApp(expr)) return this.processArith(expr, false);
98
+ this.todo.push(expr);
99
+ this.visited.add(expr);
100
+ while (this.todo.length > 0) {
101
+ const current = this.todo.pop() as number;
102
+ const isProcessed =
103
+ manager.kinds[current] !== KIND_APP
104
+ ? false
105
+ : manager.getOp(current) === OP_EQ && this.isArith(manager.getArg(current, 0))
106
+ ? this.processAtom(manager.getArg(current, 0), manager.getArg(current, 1), true)
107
+ : manager.getOp(current) !== OP_EQ && this.isArithApp(current)
108
+ ? this.processArith(current, true)
109
+ : this.processApp(current);
110
+ if (!isProcessed) return false;
111
+ }
112
+ return true;
113
+ }
114
+ }
115
+
116
+ const getMostOccs = (occs: ObjMap<number>) => {
117
+ let best = 0;
118
+ let found = -1;
119
+ for (const [expr, count] of occs.entries())
120
+ if (count > best) {
121
+ best = count;
122
+ found = expr;
123
+ }
124
+ return { found, best };
125
+ };
126
+
127
+ export const fixDlVar = (manager: AstManager, goal: Goal, options: RewriterOptions) => {
128
+ const finder = new TargetFinder(manager);
129
+ if (!goal.forms.items.every((form) => finder.process(form))) return;
130
+ const nonNested = getMostOccs(finder.nonNestedOccs);
131
+ const all = getMostOccs(finder.occs);
132
+ const variable = all.best > 10 * nonNested.best ? all.found : nonNested.found;
133
+ if (variable === -1) return;
134
+ const zero = manager.mkNumeralOfSort(Rational.zero, manager.sorts[variable]);
135
+ manager.incRef(zero);
136
+ goal.addDefinitions([{ decl: manager.decls[variable], def: zero }]);
137
+ const rewriter = new Rewriter(manager, options);
138
+ rewriter.setSubstitution(new Map([[variable, zero]]));
139
+ const size = goal.forms.size;
140
+ for (let index = 0; index < size && !goal.isInconsistent; index++) {
141
+ const rewritten = rewriter.rewrite(goal.forms.items[index]);
142
+ goal.update(index, rewritten, goal.getDependency(index));
143
+ manager.decRef(rewritten);
144
+ }
145
+ rewriter.release();
146
+ manager.decRef(zero);
147
+ goal.depth++;
148
+ };
@@ -1,9 +1,3 @@
1
- // Ported from Z3 (src/ast/rewriter/bool_rewriter.cpp), MIT license, see z3-license.txt. The
2
- // literals of a flattened conjunction or disjunction, without duplicates. Like the expr_fast_mark1
3
- // and expr_fast_mark2 of mk_nflat_and_core, it marks the literals and the negated atoms it holds,
4
- // here with a stamp for each use, so it finds a complementary pair without creating each negation.
5
- // Its manager owns the one instance that its rewriters share: a list is filled and read before any
6
- // other starts, so like Z3's ptr_buffer it reuses one array.
7
1
  import { shrink } from "./array";
8
2
  import type { AstManager } from "./ast";
9
3
 
@@ -15,14 +9,11 @@ export class FlatLiterals {
15
9
 
16
10
  constructor(private manager: AstManager) {}
17
11
 
18
- // Starts a new, empty list.
19
12
  clear() {
20
13
  shrink(this.list, 0);
21
14
  this.stamp++;
22
15
  }
23
16
 
24
- // Adds a literal, and returns whether its complement is already there. An expression's arguments
25
- // are older than it, so their ids are smaller.
26
17
  add(literal: number) {
27
18
  const manager = this.manager;
28
19
  if (literal >= this.literalStamps.length) {