tla-ts 0.0.9 → 0.0.10-dev.06b481ee0

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 (631) 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 +48 -44
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +122 -12
  8. package/dist/index.d.ts +122 -12
  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 +144 -31
  17. package/dist/run.js +144 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +134 -104
  21. package/dist/transfer.js +134 -104
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +56 -60
  26. package/src/bags.ts +128 -110
  27. package/src/builtins.ts +31 -77
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check-failure.ts +118 -0
  30. package/src/check-trace.ts +320 -0
  31. package/src/check.ts +1156 -888
  32. package/src/cli/options.ts +12 -32
  33. package/src/cli/run.ts +0 -2
  34. package/src/cli/runtime-invariants.ts +100 -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 +701 -0
  39. package/src/cli/tlc-usage.ts +360 -0
  40. package/src/cli/tlc.ts +330 -659
  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 +217 -82
  45. package/src/config.ts +140 -109
  46. package/src/coverage.ts +1019 -0
  47. package/src/dependencies.ts +101 -66
  48. package/src/dfid.ts +683 -0
  49. package/src/environment-config.ts +315 -0
  50. package/src/environment.ts +263 -370
  51. package/src/errors.ts +107 -57
  52. package/src/evaluate.ts +898 -369
  53. package/src/exit-codes.ts +63 -13
  54. package/src/fingerprints.ts +75 -11
  55. package/src/index.ts +3 -0
  56. package/src/instances.ts +137 -22
  57. package/src/java-hash.ts +21 -0
  58. package/src/java-overrides.ts +6 -21
  59. package/src/json-reader.ts +455 -0
  60. package/src/json.ts +252 -139
  61. package/src/levels.ts +231 -154
  62. package/src/lexer.ts +83 -101
  63. package/src/liveness-checker.ts +743 -322
  64. package/src/liveness.ts +230 -133
  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 +39 -20
  73. package/src/obligations/levels.ts +27 -18
  74. package/src/obligations/module.ts +28 -55
  75. package/src/obligations/normalize.ts +31 -41
  76. package/src/obligations/operators.ts +0 -3
  77. package/src/obligations/pragma.ts +52 -24
  78. package/src/obligations/printer.ts +94 -63
  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 +121 -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 +36 -60
  88. package/src/parallel.ts +64 -73
  89. package/src/parser.ts +1184 -531
  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 +226 -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 +1 -15
  118. package/src/prover/isabelle/provers/classical.ts +58 -61
  119. package/src/prover/isabelle/provers/hypsubst.ts +29 -54
  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 +34 -77
  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 +4 -47
  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 +26 -31
  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 +1021 -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 +626 -56
  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 +319 -0
  190. package/src/prover/smt/solver/array.ts +1 -3
  191. package/src/prover/smt/solver/asserted-formulas.ts +241 -99
  192. package/src/prover/smt/solver/ast-lt.ts +165 -21
  193. package/src/prover/smt/solver/ast-util.ts +160 -7
  194. package/src/prover/smt/solver/ast.ts +1480 -184
  195. package/src/prover/smt/solver/auf-solver.ts +30 -56
  196. package/src/prover/smt/solver/bit-blast-tactic.ts +608 -0
  197. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  198. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  199. package/src/prover/smt/solver/bound-manager.ts +196 -0
  200. package/src/prover/smt/solver/bound-simplifier.ts +598 -0
  201. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  202. package/src/prover/smt/solver/bv-decl-plugin.ts +341 -0
  203. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  204. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  205. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  206. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  207. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  208. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  209. package/src/prover/smt/solver/card2bv.ts +127 -0
  210. package/src/prover/smt/solver/case-split-queue.ts +0 -10
  211. package/src/prover/smt/solver/cg-table.ts +39 -42
  212. package/src/prover/smt/solver/check-logic.ts +330 -0
  213. package/src/prover/smt/solver/clause.ts +0 -27
  214. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +293 -0
  215. package/src/prover/smt/solver/conflict-resolution.ts +78 -11
  216. package/src/prover/smt/solver/context.ts +600 -187
  217. package/src/prover/smt/solver/ctx-simplify.ts +34 -52
  218. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  219. package/src/prover/smt/solver/datatype-decl-plugin.ts +580 -0
  220. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  221. package/src/prover/smt/solver/demodulator.ts +786 -0
  222. package/src/prover/smt/solver/dependent-expr-state.ts +93 -0
  223. package/src/prover/smt/solver/der.ts +39 -30
  224. package/src/prover/smt/solver/diff-neq.ts +205 -0
  225. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  226. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  227. package/src/prover/smt/solver/dt2bv-tactic.ts +296 -0
  228. package/src/prover/smt/solver/dyn-ack.ts +0 -11
  229. package/src/prover/smt/solver/e-matching.ts +9 -41
  230. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  231. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  232. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  233. package/src/prover/smt/solver/elim-uncnstr.ts +542 -0
  234. package/src/prover/smt/solver/enode.ts +100 -23
  235. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  236. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  237. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  238. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  239. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  240. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  241. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  242. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  243. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  244. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  245. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  246. package/src/prover/smt/solver/euf/egraph.ts +901 -0
  247. package/src/prover/smt/solver/euf/euf-solver.ts +1204 -0
  248. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  249. package/src/prover/smt/solver/euf/mam.ts +1046 -0
  250. package/src/prover/smt/solver/euf/q-ematch.ts +829 -0
  251. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  252. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  253. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  254. package/src/prover/smt/solver/euf/th-solver.ts +328 -0
  255. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  256. package/src/prover/smt/solver/expr-ref.ts +0 -5
  257. package/src/prover/smt/solver/expr-safe-replace.ts +26 -7
  258. package/src/prover/smt/solver/expr2polynomial.ts +271 -0
  259. package/src/prover/smt/solver/factor.ts +163 -0
  260. package/src/prover/smt/solver/fd-solver.ts +734 -0
  261. package/src/prover/smt/solver/fingerprints.ts +15 -26
  262. package/src/prover/smt/solver/fix-dl-var.ts +147 -0
  263. package/src/prover/smt/solver/flat-literals.ts +0 -9
  264. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  265. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  266. package/src/prover/smt/solver/fpa-rewriter.ts +639 -0
  267. package/src/prover/smt/solver/fpa2bv-converter.ts +2251 -0
  268. package/src/prover/smt/solver/fpa2bv-rewriter.ts +349 -0
  269. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  270. package/src/prover/smt/solver/goal.ts +179 -28
  271. package/src/prover/smt/solver/goal2nlsat.ts +216 -0
  272. package/src/prover/smt/solver/guard-set.ts +219 -0
  273. package/src/prover/smt/solver/hash.ts +0 -9
  274. package/src/prover/smt/solver/hashtable.ts +30 -23
  275. package/src/prover/smt/solver/inf-eps.ts +63 -0
  276. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  277. package/src/prover/smt/solver/internalizer.ts +113 -133
  278. package/src/prover/smt/solver/lackr.ts +381 -0
  279. package/src/prover/smt/solver/lbool.ts +0 -2
  280. package/src/prover/smt/solver/lia2card.ts +268 -0
  281. package/src/prover/smt/solver/lia2pb.ts +154 -0
  282. package/src/prover/smt/solver/literal.ts +0 -4
  283. package/src/prover/smt/solver/logic-tactics.ts +355 -0
  284. package/src/prover/smt/solver/lp/bound-propagator.ts +7 -26
  285. package/src/prover/smt/solver/lp/constraints.ts +1 -8
  286. package/src/prover/smt/solver/lp/containers.ts +18 -31
  287. package/src/prover/smt/solver/lp/core-solver.ts +35 -37
  288. package/src/prover/smt/solver/lp/cross-nested.ts +4 -21
  289. package/src/prover/smt/solver/lp/dep-intervals.ts +6 -24
  290. package/src/prover/smt/solver/lp/dependency.ts +0 -5
  291. package/src/prover/smt/solver/lp/dioph-eq.ts +8 -103
  292. package/src/prover/smt/solver/lp/explanation.ts +0 -6
  293. package/src/prover/smt/solver/lp/gomory.ts +8 -22
  294. package/src/prover/smt/solver/lp/hnf-cutter.ts +16 -23
  295. package/src/prover/smt/solver/lp/hnf.ts +10 -28
  296. package/src/prover/smt/solver/lp/int-cube.ts +17 -39
  297. package/src/prover/smt/solver/lp/int-solver.ts +3 -35
  298. package/src/prover/smt/solver/lp/lar-solver.ts +70 -83
  299. package/src/prover/smt/solver/lp/lar-term.ts +0 -5
  300. package/src/prover/smt/solver/lp/lp-settings.ts +6 -16
  301. package/src/prover/smt/solver/lp/maximize-term.ts +76 -52
  302. package/src/prover/smt/solver/lp/nex-creator.ts +7 -30
  303. package/src/prover/smt/solver/lp/nex.ts +2 -7
  304. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -5
  305. package/src/prover/smt/solver/lp/nla-basics.ts +48 -30
  306. package/src/prover/smt/solver/lp/nla-core.ts +92 -136
  307. package/src/prover/smt/solver/lp/nla-divisions.ts +31 -43
  308. package/src/prover/smt/solver/lp/nla-emonics.ts +3 -21
  309. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -4
  310. package/src/prover/smt/solver/lp/nla-grobner.ts +177 -149
  311. package/src/prover/smt/solver/lp/nla-horner.ts +2 -12
  312. package/src/prover/smt/solver/lp/nla-intervals.ts +1 -12
  313. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +15 -42
  314. package/src/prover/smt/solver/lp/nla-monotone.ts +1 -6
  315. package/src/prover/smt/solver/lp/nla-order.ts +0 -13
  316. package/src/prover/smt/solver/lp/nla-patcher.ts +3 -7
  317. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  318. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -10
  319. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -6
  320. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  321. package/src/prover/smt/solver/lp/nla-types.ts +0 -12
  322. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -26
  323. package/src/prover/smt/solver/lp/nra-solver.ts +164 -147
  324. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -4
  325. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -5
  326. package/src/prover/smt/solver/lp/pdd-simplifier.ts +61 -34
  327. package/src/prover/smt/solver/lp/pdd-solver.ts +74 -72
  328. package/src/prover/smt/solver/lp/pdd.ts +730 -358
  329. package/src/prover/smt/solver/lp/random-updater.ts +0 -9
  330. package/src/prover/smt/solver/lp/static-matrix.ts +8 -19
  331. package/src/prover/smt/solver/lp/union-find.ts +5 -5
  332. package/src/prover/smt/solver/macro-finder.ts +530 -0
  333. package/src/prover/smt/solver/mam-compiler.ts +129 -139
  334. package/src/prover/smt/solver/mam-interpreter.ts +0 -21
  335. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  336. package/src/prover/smt/solver/max-cliques.ts +105 -0
  337. package/src/prover/smt/solver/maxcore.ts +310 -0
  338. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -21
  339. package/src/prover/smt/solver/maxlex.ts +115 -0
  340. package/src/prover/smt/solver/maxsmt-base.ts +106 -0
  341. package/src/prover/smt/solver/maxsmt.ts +92 -0
  342. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  343. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  344. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  345. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  346. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  347. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  348. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  349. package/src/prover/smt/solver/model-checker.ts +20 -63
  350. package/src/prover/smt/solver/model-evaluator.ts +192 -40
  351. package/src/prover/smt/solver/model-finder.ts +14 -32
  352. package/src/prover/smt/solver/model-generator.ts +104 -46
  353. package/src/prover/smt/solver/model-macro-solver.ts +60 -114
  354. package/src/prover/smt/solver/model-printer.ts +214 -0
  355. package/src/prover/smt/solver/mpf.ts +709 -0
  356. package/src/prover/smt/solver/mus.ts +50 -0
  357. package/src/prover/smt/solver/muz/dl-context.ts +382 -0
  358. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  359. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  360. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  361. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  362. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  363. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  364. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  365. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  366. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  367. package/src/prover/smt/solver/muz/dl-rule.ts +495 -0
  368. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  369. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  370. package/src/prover/smt/solver/muz/horn-tactic.ts +214 -0
  371. package/src/prover/smt/solver/muz/rule-properties.ts +359 -0
  372. package/src/prover/smt/solver/muz/spacer-context.ts +1404 -0
  373. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  374. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  375. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  376. package/src/prover/smt/solver/muz/spacer-pdr.ts +219 -0
  377. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  378. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  379. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  380. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  381. package/src/prover/smt/solver/nlqsat.ts +484 -0
  382. package/src/prover/smt/solver/nlsat/algebraic.ts +357 -236
  383. package/src/prover/smt/solver/nlsat/atoms.ts +73 -54
  384. package/src/prover/smt/solver/nlsat/evaluator.ts +16 -22
  385. package/src/prover/smt/solver/nlsat/explain.ts +429 -275
  386. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -51
  387. package/src/prover/smt/solver/nlsat/levelwise.ts +477 -344
  388. package/src/prover/smt/solver/nlsat/mpbq.ts +47 -14
  389. package/src/prover/smt/solver/nlsat/polynomial.ts +2385 -832
  390. package/src/prover/smt/solver/nlsat/solver.ts +297 -156
  391. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  392. package/src/prover/smt/solver/nlsat/transcendentals.ts +391 -0
  393. package/src/prover/smt/solver/nlsat/types.ts +0 -9
  394. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +9 -51
  395. package/src/prover/smt/solver/nlsat/upolynomial.ts +49 -109
  396. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  397. package/src/prover/smt/solver/nnf.ts +112 -61
  398. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  399. package/src/prover/smt/solver/occf.ts +97 -0
  400. package/src/prover/smt/solver/opt-context.ts +801 -0
  401. package/src/prover/smt/solver/opt-nlsat.ts +386 -0
  402. package/src/prover/smt/solver/opt-pareto.ts +301 -0
  403. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  404. package/src/prover/smt/solver/opt-solver.ts +312 -0
  405. package/src/prover/smt/solver/opt-value.ts +55 -0
  406. package/src/prover/smt/solver/optsmt.ts +692 -0
  407. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  408. package/src/prover/smt/solver/pattern-inference.ts +21 -26
  409. package/src/prover/smt/solver/pb-rewriter.ts +281 -0
  410. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  411. package/src/prover/smt/solver/poly-rewriter.ts +261 -79
  412. package/src/prover/smt/solver/probes.ts +577 -0
  413. package/src/prover/smt/solver/propagate-values.ts +37 -30
  414. package/src/prover/smt/solver/proto-model.ts +650 -66
  415. package/src/prover/smt/solver/pull-quant.ts +28 -23
  416. package/src/prover/smt/solver/purify-arith.ts +632 -0
  417. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  418. package/src/prover/smt/solver/qe-arith-plugin.ts +1096 -0
  419. package/src/prover/smt/solver/qe-lite-der.ts +2 -31
  420. package/src/prover/smt/solver/qe-lite-fm.ts +4 -28
  421. package/src/prover/smt/solver/qe-lite.ts +41 -51
  422. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  423. package/src/prover/smt/solver/qe.ts +1499 -0
  424. package/src/prover/smt/solver/qel.ts +25 -0
  425. package/src/prover/smt/solver/qi-queue.ts +0 -16
  426. package/src/prover/smt/solver/qsat.ts +829 -0
  427. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  428. package/src/prover/smt/solver/quant-tactics.ts +17 -74
  429. package/src/prover/smt/solver/quantifier-analyzer.ts +26 -47
  430. package/src/prover/smt/solver/quantifier-manager.ts +22 -32
  431. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  432. package/src/prover/smt/solver/random-gen.ts +0 -2
  433. package/src/prover/smt/solver/rational.ts +45 -8
  434. package/src/prover/smt/solver/recfun-decl-plugin.ts +262 -0
  435. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  436. package/src/prover/smt/solver/reduce-args.ts +225 -0
  437. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  438. package/src/prover/smt/solver/ref-vector.ts +0 -6
  439. package/src/prover/smt/solver/relevancy.ts +2 -16
  440. package/src/prover/smt/solver/rewriter-tpl.ts +59 -135
  441. package/src/prover/smt/solver/rewriter.ts +507 -144
  442. package/src/prover/smt/solver/rlimit.ts +46 -24
  443. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  444. package/src/prover/smt/solver/sat/big.ts +177 -0
  445. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  446. package/src/prover/smt/solver/sat/clause.ts +203 -0
  447. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  448. package/src/prover/smt/solver/sat/config.ts +122 -0
  449. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  450. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  451. package/src/prover/smt/solver/sat/goal2sat.ts +579 -0
  452. package/src/prover/smt/solver/sat/inc-sat-solver.ts +464 -0
  453. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  454. package/src/prover/smt/solver/sat/pb-constraint.ts +268 -0
  455. package/src/prover/smt/solver/sat/pb-solver.ts +1596 -0
  456. package/src/prover/smt/solver/sat/probing.ts +170 -0
  457. package/src/prover/smt/solver/sat/sat-tactic.ts +53 -0
  458. package/src/prover/smt/solver/sat/sat2goal.ts +189 -0
  459. package/src/prover/smt/solver/sat/scc.ts +142 -0
  460. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  461. package/src/prover/smt/solver/sat/solver.ts +2107 -0
  462. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  463. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  464. package/src/prover/smt/solver/search-tree.ts +284 -0
  465. package/src/prover/smt/solver/seq-axioms.ts +995 -0
  466. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  467. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  468. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  469. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  470. package/src/prover/smt/solver/seq-factory.ts +89 -0
  471. package/src/prover/smt/solver/seq-monadic.ts +730 -0
  472. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  473. package/src/prover/smt/solver/seq-re-rewriter.ts +1171 -0
  474. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  475. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  476. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  477. package/src/prover/smt/solver/seq-rewriter.ts +2404 -0
  478. package/src/prover/smt/solver/seq-skolem.ts +294 -0
  479. package/src/prover/smt/solver/seq-subset.ts +165 -0
  480. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  481. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  482. package/src/prover/smt/solver/smt-kernel.ts +124 -0
  483. package/src/prover/smt/solver/smt-logics.ts +66 -0
  484. package/src/prover/smt/solver/smt-setup.ts +589 -0
  485. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  486. package/src/prover/smt/solver/smtlib-parser.ts +3546 -406
  487. package/src/prover/smt/solver/smtlib-script.ts +2134 -0
  488. package/src/prover/smt/solver/solve-eqs.ts +928 -0
  489. package/src/prover/smt/solver/solver.ts +135 -40
  490. package/src/prover/smt/solver/sort.ts +1 -5
  491. package/src/prover/smt/solver/static-features.ts +314 -0
  492. package/src/prover/smt/solver/sticky-generations.ts +0 -6
  493. package/src/prover/smt/solver/tactic.ts +2141 -0
  494. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  495. package/src/prover/smt/solver/theory-array.ts +1240 -0
  496. package/src/prover/smt/solver/theory-bv.ts +1210 -0
  497. package/src/prover/smt/solver/theory-char.ts +355 -0
  498. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  499. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  500. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  501. package/src/prover/smt/solver/theory-lra-axioms.ts +55 -25
  502. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -11
  503. package/src/prover/smt/solver/theory-lra-final-check.ts +60 -91
  504. package/src/prover/smt/solver/theory-lra-internalize.ts +96 -53
  505. package/src/prover/smt/solver/theory-lra-model.ts +23 -53
  506. package/src/prover/smt/solver/theory-lra-propagate.ts +34 -42
  507. package/src/prover/smt/solver/theory-lra-state.ts +7 -28
  508. package/src/prover/smt/solver/theory-lra.ts +189 -9
  509. package/src/prover/smt/solver/theory-pb.ts +951 -0
  510. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  511. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  512. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  513. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  514. package/src/prover/smt/solver/theory-seq-state.ts +852 -0
  515. package/src/prover/smt/solver/theory-seq.ts +961 -0
  516. package/src/prover/smt/solver/theory-without-terms.ts +24 -0
  517. package/src/prover/smt/solver/theory.ts +189 -0
  518. package/src/prover/smt/solver/tseitin-cnf.ts +486 -0
  519. package/src/prover/smt/solver/var-subst.ts +37 -39
  520. package/src/prover/smt/table.ts +3 -10
  521. package/src/prover/smt/types.ts +146 -0
  522. package/src/prover/tlapm/cache.ts +74 -48
  523. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  524. package/src/prover/tlapm/tlapm.ts +21 -20
  525. package/src/prover/tlapm-library.ts +3208 -0
  526. package/src/prover/verdict.ts +9 -2
  527. package/src/prover/zenon/check/check.ts +1 -11
  528. package/src/prover/zenon/check/definitions.ts +5 -15
  529. package/src/prover/zenon/check/equality.ts +0 -8
  530. package/src/prover/zenon/check/functions.ts +0 -4
  531. package/src/prover/zenon/check/keys.ts +0 -7
  532. package/src/prover/zenon/check/propositional.ts +0 -3
  533. package/src/prover/zenon/check/records.ts +1 -6
  534. package/src/prover/zenon/check/relations.ts +2 -14
  535. package/src/prover/zenon/check/rewrites.ts +2 -21
  536. package/src/prover/zenon/check/sets.ts +40 -61
  537. package/src/prover/zenon/check/terms.ts +1 -19
  538. package/src/prover/zenon/check/tla.ts +0 -6
  539. package/src/prover/zenon/decide.ts +10 -19
  540. package/src/prover/zenon/encode.ts +0 -9
  541. package/src/prover/zenon/eqrel.ts +2 -15
  542. package/src/prover/zenon/equality-rules.ts +24 -6
  543. package/src/prover/zenon/expr.ts +29 -28
  544. package/src/prover/zenon/index-table.ts +33 -61
  545. package/src/prover/zenon/isar-case.ts +9 -21
  546. package/src/prover/zenon/isar.ts +37 -67
  547. package/src/prover/zenon/limits.ts +0 -4
  548. package/src/prover/zenon/llproof.ts +2 -22
  549. package/src/prover/zenon/mltoll.ts +66 -106
  550. package/src/prover/zenon/node.ts +20 -15
  551. package/src/prover/zenon/ocaml.ts +1 -17
  552. package/src/prover/zenon/parse.ts +9 -13
  553. package/src/prover/zenon/phrase.ts +2 -14
  554. package/src/prover/zenon/proof.ts +0 -11
  555. package/src/prover/zenon/propositional-rules.ts +0 -7
  556. package/src/prover/zenon/rules.ts +3 -8
  557. package/src/prover/zenon/search.ts +11 -35
  558. package/src/prover/zenon/tla/functions.ts +59 -33
  559. package/src/prover/zenon/tla/llproof.ts +67 -78
  560. package/src/prover/zenon/tla/records.ts +57 -35
  561. package/src/prover/zenon/tla/rewrites.ts +12 -21
  562. package/src/prover/zenon/tla/sets.ts +88 -59
  563. package/src/prover/zenon/tla/terms.ts +0 -8
  564. package/src/prover/zenon/tla/tla.ts +66 -66
  565. package/src/randomization.ts +81 -35
  566. package/src/resolve.ts +1132 -430
  567. package/src/runtime.ts +33 -23
  568. package/src/sany/builtins.ts +11 -14
  569. package/src/sany/generation.ts +383 -0
  570. package/src/sany/generator-def-entries.ts +210 -0
  571. package/src/sany/generator-definitions.ts +688 -0
  572. package/src/sany/generator-expressions.ts +1108 -0
  573. package/src/sany/generator-proofs.ts +665 -0
  574. package/src/sany/generator.ts +192 -2764
  575. package/src/sany/levels.ts +5 -35
  576. package/src/sany/lexer.ts +61 -80
  577. package/src/sany/linter.ts +0 -10
  578. package/src/sany/modules.ts +5 -7
  579. package/src/sany/nodes.ts +6 -44
  580. package/src/sany/parse-error.ts +39 -117
  581. package/src/sany/report.ts +32 -69
  582. package/src/sany/selectors.ts +60 -82
  583. package/src/sany/source.ts +1 -17
  584. package/src/sany/xml.ts +37 -120
  585. package/src/search.ts +913 -227
  586. package/src/simulate.ts +765 -0
  587. package/src/spec-description.ts +198 -104
  588. package/src/standard-definitions.ts +4 -4
  589. package/src/standard-modules.ts +302 -99
  590. package/src/state-graph.ts +52 -33
  591. package/src/subexpressions.ts +578 -166
  592. package/src/substitution-levels.ts +7 -7
  593. package/src/successors.ts +299 -108
  594. package/src/symmetry.ts +37 -28
  595. package/src/tableau.ts +29 -26
  596. package/src/tlc/fingerprint.ts +267 -79
  597. package/src/tlc/jar-data.ts +122 -6
  598. package/src/tlc/messages.ts +127 -56
  599. package/src/tlc/order.ts +53 -72
  600. package/src/tlc/random.ts +38 -49
  601. package/src/tlc/replay.ts +579 -230
  602. package/src/tlc/summary.ts +64 -60
  603. package/src/tlc/tlc-operators.ts +83 -47
  604. package/src/tlc/tlcext-operators.ts +205 -127
  605. package/src/tlc/trace-spec.ts +235 -0
  606. package/src/tlc/value-stream.ts +139 -0
  607. package/src/tlc/version.ts +1 -4
  608. package/src/trace-liveness.ts +529 -0
  609. package/src/transfer.ts +22 -25
  610. package/src/typed-tier.ts +6556 -0
  611. package/src/typescript/actions.ts +479 -0
  612. package/src/typescript/collections.ts +614 -0
  613. package/src/typescript/compile.ts +63 -0
  614. package/src/typescript/context.ts +94 -0
  615. package/src/typescript/emit.ts +121 -0
  616. package/src/typescript/expressions.ts +496 -0
  617. package/src/typescript/formula.ts +154 -0
  618. package/src/typescript/functions.ts +284 -0
  619. package/src/typescript/model.ts +162 -0
  620. package/src/typescript/names.ts +114 -0
  621. package/src/typescript/program.ts +48 -0
  622. package/src/typescript/properties.ts +139 -0
  623. package/src/typescript/scope.ts +112 -0
  624. package/src/typescript/steps.ts +167 -0
  625. package/src/typescript/types.ts +171 -0
  626. package/src/values.ts +945 -526
  627. package/src/worker.ts +7 -8
  628. package/src/prover/isabelle/isar/statement.ts +0 -57
  629. package/src/prover/smt/solver/z3-license.txt +0 -10
  630. package/src/prover/tlaps-module.ts +0 -510
  631. package/src/prover/zenon/LICENSE +0 -32
@@ -1,32 +1,78 @@
1
- // Ported from Z3 (src/smt/proto_model/proto_model.cpp, src/model/func_interp.cpp,
2
- // src/model/value_factory.cpp, src/model/model_core.cpp), MIT license, see z3-license.txt. The
3
- // model that the SMT kernel builds from a satisfying assignment, and that model-based quantifier
4
- // instantiation completes and checks.
1
+ import { TermEnumeration } from "./term-enumeration";
5
2
  import {
6
- AstManager,
3
+ type AstManager,
4
+ FAMILY_ARRAY,
5
+ FAMILY_BV,
6
+ FAMILY_SEQ,
7
7
  KIND_APP,
8
+ KIND_QUANTIFIER,
8
9
  KIND_VAR,
9
10
  OP_AND,
11
+ OP_ARRAY_MAP,
12
+ OP_AS_ARRAY,
13
+ OP_BIT2BOOL,
10
14
  OP_EQ,
15
+ OP_EXTRACT,
16
+ OP_CONST_ARRAY,
11
17
  OP_ITE,
18
+ OP_SEQ_TO_RE,
19
+ OP_STORE,
20
+ QUANTIFIER_LAMBDA,
12
21
  SORT_BOOL,
13
22
  isArithSort,
14
23
  } from "./ast";
24
+ import {
25
+ getDatatypeConstructors,
26
+ getNonRecConstructor,
27
+ isRecursiveDatatype,
28
+ } from "./datatype-decl-plugin";
29
+ import { mkArrayApp, mkAsArray } from "./array-decl-plugin";
30
+ import { mkFpNumeral, mkRmNumeral } from "./fpa-decl-plugin";
31
+ import { MPF_ROUND_TOWARD_ZERO, mkNan, mkZero } from "./mpf";
15
32
  import { RandomGen } from "./random-gen";
33
+ import { mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
16
34
  import { Rational } from "./rational";
17
35
  import { ObjHashtable, ObjMap } from "./hashtable";
18
36
  import { ModelEvaluator } from "./model-evaluator";
37
+ import { ExprSafeReplace } from "./expr-safe-replace";
19
38
  import { RefVector } from "./ref-vector";
39
+ import { CharFactory, SeqFactory } from "./seq-factory";
20
40
  import { Rewriter, TACTIC_REWRITER_OPTIONS } from "./rewriter";
41
+ import { VarSubst } from "./var-subst";
42
+ import { mkBvApp } from "./bv-decl-plugin";
43
+
44
+ export const getManagerSomeValue = (manager: AstManager, sort: number): number => {
45
+ if (sort === SORT_BOOL) return manager.falseExpr;
46
+ if (manager.isRmSort(sort)) return mkRmNumeral(manager, MPF_ROUND_TOWARD_ZERO);
47
+ if (manager.isFpSort(sort))
48
+ return mkFpNumeral(manager, mkNan(manager.getEbits(sort), manager.getSbits(sort)));
49
+ if (isArithSort(sort)) return manager.mkNumeralOfSort(Rational.zero, sort);
50
+ if (manager.isBvSort(sort)) return manager.mkBvNumeral(0n, manager.getBvSize(sort));
51
+ if (manager.isArraySort(sort))
52
+ return mkArrayApp(
53
+ manager,
54
+ OP_CONST_ARRAY,
55
+ [getManagerSomeValue(manager, manager.getArrayRange(sort))],
56
+ [sort],
57
+ );
58
+ if (manager.isSeqSort(sort)) return mkEmptySeq(manager, sort);
59
+ if (manager.isReSort(sort))
60
+ return mkSeqApp(manager, OP_SEQ_TO_RE, [mkEmptySeq(manager, manager.getReSeqSort(sort))]);
61
+ if (manager.isCharSort(sort)) return manager.mkChar(65);
62
+ if (!manager.isDatatypeSort(sort)) return manager.mkModelValue(0, sort);
63
+ const constructor = getNonRecConstructor(manager, sort);
64
+ return manager.mkApp(
65
+ constructor,
66
+ manager.funcDecls[constructor].domain.map((argSort) => getManagerSomeValue(manager, argSort)),
67
+ sort,
68
+ );
69
+ };
21
70
 
22
71
  interface FuncEntry {
23
72
  args: number[];
24
73
  result: number;
25
74
  }
26
75
 
27
- // func_interp: a finite table of entries and an else expression over the variables (:var i) for
28
- // argument i. It holds the arguments and result of each entry, the else expression and the cached
29
- // interpretation.
30
76
  export class FuncInterp {
31
77
  entries: FuncEntry[] = [];
32
78
  private entryTable = new Map<string, FuncEntry>();
@@ -49,7 +95,6 @@ export class FuncInterp {
49
95
  insertNewEntry(args: number[], result: number) {
50
96
  const manager = this.manager;
51
97
  this.resetInterpCache();
52
- // func_entry: the result is held first, then the arguments.
53
98
  manager.incRef(result);
54
99
  for (const arg of args) manager.incRef(arg);
55
100
  const entry = { args: [...args], result };
@@ -57,6 +102,15 @@ export class FuncInterp {
57
102
  this.entryTable.set(args.join(","), entry);
58
103
  }
59
104
 
105
+ delEntry(index: number) {
106
+ this.resetInterpCache();
107
+ const entry = this.entries[index];
108
+ this.entries[index] = this.entries[this.entries.length - 1];
109
+ this.entries.pop();
110
+ this.entryTable.delete(entry.args.join(","));
111
+ this.releaseEntry(entry);
112
+ }
113
+
60
114
  insertEntry(args: number[], result: number) {
61
115
  this.resetInterpCache();
62
116
  const entry = this.getEntry(args);
@@ -64,7 +118,6 @@ export class FuncInterp {
64
118
  this.insertNewEntry(args, result);
65
119
  return;
66
120
  }
67
- // func_entry::set_result.
68
121
  this.manager.incRef(result);
69
122
  this.manager.decRef(entry.result);
70
123
  entry.result = result;
@@ -75,25 +128,22 @@ export class FuncInterp {
75
128
  this.interp = null;
76
129
  }
77
130
 
78
- // func_entry::deallocate.
79
131
  private releaseEntry(entry: FuncEntry) {
80
132
  for (const arg of entry.args) this.manager.decRef(arg);
81
133
  this.manager.decRef(entry.result);
82
134
  }
83
135
 
84
- // ~func_interp.
85
136
  release() {
86
137
  for (const entry of this.entries) this.releaseEntry(entry);
87
138
  if (this.elseExpr !== null) this.manager.decRef(this.elseExpr);
88
139
  this.resetInterpCache();
89
140
  }
90
141
 
91
- // is_fi_entry_expr: (ite (and (= (:var 0) a0) ...) t e) with a ground t.
92
142
  private getEntryArgs(expr: number) {
93
143
  const manager = this.manager;
94
144
  if (manager.getOp(expr) !== OP_ITE) return undefined;
95
145
  const condition = manager.getArg(expr, 0);
96
- if (!manager.isGround(manager.getArg(expr, 1)) || this.arity === 0) return undefined;
146
+ if (!manager.isGroundApp(manager.getArg(expr, 1)) || this.arity === 0) return undefined;
97
147
  if (this.arity === 1 && manager.getOp(condition) !== OP_EQ) return undefined;
98
148
  if (
99
149
  this.arity > 1 &&
@@ -129,9 +179,16 @@ export class FuncInterp {
129
179
  this.elseExpr = current;
130
180
  }
131
181
 
182
+ copy() {
183
+ const copied = new FuncInterp(this.manager, this.arity);
184
+ for (const entry of this.entries) copied.insertNewEntry(entry.args, entry.result);
185
+ if (this.elseExpr !== null) copied.setElse(this.elseExpr);
186
+ return copied;
187
+ }
188
+
132
189
  isConstant() {
133
190
  const elseExpr = this.elseExpr;
134
- if (elseExpr === null || !this.manager.isGround(elseExpr)) return false;
191
+ if (elseExpr === null || !this.manager.isGroundApp(elseExpr)) return false;
135
192
  return this.entries.every((entry) => entry.result === elseExpr);
136
193
  }
137
194
 
@@ -150,11 +207,10 @@ export class FuncInterp {
150
207
  return best;
151
208
  }
152
209
 
153
- // compress: drops the entries whose result is the else value, and recognizes the identity.
154
210
  compress() {
155
211
  const manager = this.manager;
156
212
  const elseExpr = this.elseExpr;
157
- if (elseExpr === null || this.entries.length === 0 || !manager.isGround(elseExpr)) return;
213
+ if (elseExpr === null || this.entries.length === 0 || !manager.isGroundApp(elseExpr)) return;
158
214
  const kept = this.entries.filter((entry) => {
159
215
  if (entry.result !== elseExpr) return true;
160
216
  this.releaseEntry(entry);
@@ -177,7 +233,6 @@ export class FuncInterp {
177
233
  }
178
234
  }
179
235
 
180
- // is_identity: only Bool has a finite number of elements among tlapm's sorts.
181
236
  private isIdentity() {
182
237
  const manager = this.manager;
183
238
  const elseExpr = this.elseExpr;
@@ -189,7 +244,49 @@ export class FuncInterp {
189
244
  return this.entries.length + 1 === 2;
190
245
  }
191
246
 
192
- // get_interp: the interpretation as an expression over the argument variables, which it caches.
247
+ // get_array_interp: an interpretation that is not ground becomes a lambda.
248
+ getArrayInterp(decl: number) {
249
+ const manager = this.manager;
250
+ const elseExpr = this.elseExpr;
251
+ if (elseExpr === null) return undefined;
252
+ const domain = manager.funcDecls[decl].domain;
253
+ const isGround =
254
+ manager.isGroundApp(elseExpr) &&
255
+ this.entries.every(
256
+ (entry) =>
257
+ manager.isGroundApp(entry.result) && entry.args.every((arg) => manager.isGroundApp(arg)),
258
+ );
259
+ if (!isGround) {
260
+ const interp = this.getInterp();
261
+ if (interp === null) return undefined;
262
+ const subst = new VarSubst(manager, false);
263
+ const body = subst.apply(
264
+ interp,
265
+ domain.map((sort, index) => manager.mkVar(this.arity - index - 1, sort)),
266
+ );
267
+ const lambda = manager.mkQuantifier({
268
+ kind: QUANTIFIER_LAMBDA,
269
+ sorts: [...domain],
270
+ names: domain.map((_value, index) => index),
271
+ body,
272
+ patterns: [],
273
+ noPatterns: [],
274
+ weight: 0,
275
+ qid: "",
276
+ });
277
+ manager.decRef(body);
278
+ return lambda;
279
+ }
280
+ const sort = manager.mkArraySort([...domain, manager.sorts[elseExpr]]);
281
+ return this.entries.reduce(
282
+ (array, entry) =>
283
+ entry.result === elseExpr
284
+ ? array
285
+ : mkArrayApp(manager, OP_STORE, [array, ...entry.args, entry.result]),
286
+ mkArrayApp(manager, OP_CONST_ARRAY, [elseExpr], [sort]),
287
+ );
288
+ }
289
+
193
290
  getInterp() {
194
291
  if (this.interp !== null) return this.interp;
195
292
  const manager = this.manager;
@@ -219,27 +316,33 @@ export class FuncInterp {
219
316
  }
220
317
 
221
318
  export class ProtoModel {
222
- // m_interp and m_const_decls: the value of each constant, and the constants in the order they were
223
- // registered.
224
319
  readonly constInterps: ObjMap<number>;
225
320
  private constDecls: number[] = [];
226
- // m_finterp, in Z3's slot order, and m_func_decls, in the order they were registered.
227
321
  readonly funcInterps: ObjMap<FuncInterp>;
228
322
  private funcDecls: number[] = [];
229
323
  private auxDecls: ObjHashtable;
230
- // user_sort_factory and the arith_factory: the values of each sort, in Z3's hash order, and the
231
- // values each factory holds, in the order it made or registered them.
232
324
  private values = new Map<number, ObjHashtable>();
233
325
  private userSortValues: RefVector;
234
326
  private arithValues: RefVector;
327
+ private bvValues: RefVector;
328
+ private datatypeValues: RefVector;
329
+ private enumeratedTerms: RefVector;
330
+ private freshEnumerations = new Map<number, TermEnumeration>();
235
331
  private nextValue = new Map<number, number>();
332
+ // array_factory::m_ranges: the ranges whose fresh value an array's fresh value is waiting for.
333
+ private freshArrayRanges: number[] = [];
236
334
  private finiteSorts = new Set<number>();
335
+ // model::m_usort2universe, the universes registered in order.
336
+ private universes = new Map<number, RefVector>();
237
337
  private boolRandom: RandomGen;
238
338
  private evaluator: ModelEvaluator;
239
- // m_rewrite: the th_rewriter that cleanup simplifies the interpretations with.
240
339
  private rewriter: Rewriter;
241
- // The holders of a proto_model and a model are counted, and the last one releases it.
242
340
  private refCount = 0;
341
+ // A model, rather than the proto_model it was made from, takes its values from the manager.
342
+ private isFinal = false;
343
+ private isCompact = false;
344
+ private seqFactory: SeqFactory | undefined;
345
+ private charFactory: CharFactory | undefined;
243
346
 
244
347
  constructor(readonly manager: AstManager) {
245
348
  this.boolRandom = new RandomGen(manager.getNumAsts());
@@ -247,12 +350,14 @@ export class ProtoModel {
247
350
  this.funcInterps = new ObjMap((decl) => manager.getDeclHash(decl));
248
351
  this.userSortValues = new RefVector(manager);
249
352
  this.arithValues = new RefVector(manager);
353
+ this.bvValues = new RefVector(manager);
354
+ this.datatypeValues = new RefVector(manager);
355
+ this.enumeratedTerms = new RefVector(manager);
250
356
  this.auxDecls = new ObjHashtable((decl) => manager.getDeclHash(decl));
251
357
  this.evaluator = new ModelEvaluator(manager, this);
252
358
  this.rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
253
359
  }
254
360
 
255
- // model_core::register_decl: the model holds the declaration and the value.
256
361
  registerConst(decl: number, value: number) {
257
362
  const old = this.constInterps.get(decl);
258
363
  if (old === undefined) this.manager.incDeclRef(decl);
@@ -262,16 +367,46 @@ export class ProtoModel {
262
367
  this.constInterps.set(decl, value);
263
368
  }
264
369
 
265
- // model_core::register_decl: the interpretation replaces the old one, which is released. The model
266
- // holds the declaration.
267
370
  registerFunc(decl: number, interp: FuncInterp) {
371
+ this.updateFuncInterp(decl, interp)?.release();
372
+ }
373
+
374
+ // model_core::update_func_interp: the replaced interpretation goes to the caller.
375
+ updateFuncInterp(decl: number, interp: FuncInterp) {
268
376
  const old = this.funcInterps.get(decl);
269
377
  if (old === undefined) {
270
378
  this.funcDecls.push(decl);
271
379
  this.manager.incDeclRef(decl);
272
380
  }
273
381
  this.funcInterps.set(decl, interp);
274
- old?.release();
382
+ return old;
383
+ }
384
+
385
+ // add_rec_funs: a recursive function without an interpretation takes its definition, whose
386
+ // variables a function interpretation numbers from the first argument.
387
+ addRecFuns() {
388
+ const manager = this.manager;
389
+ for (const entry of manager.macros)
390
+ if (!this.constInterps.has(entry[0])) this.registerConst(entry[0], entry[1]);
391
+ for (const def of manager.recFunDefs.values()) {
392
+ if (def.rhs === -1 || this.constInterps.has(def.decl) || this.funcInterps.has(def.decl))
393
+ continue;
394
+ const domain = manager.funcDecls[def.decl].domain;
395
+ if (domain.length === 0) {
396
+ this.registerConst(def.decl, def.rhs);
397
+ continue;
398
+ }
399
+ const subst = new ExprSafeReplace(manager);
400
+ domain.forEach((sort, index) =>
401
+ subst.insert(manager.mkVar(domain.length - index - 1, sort), manager.mkVar(index, sort)),
402
+ );
403
+ const body = subst.apply(def.rhs);
404
+ subst.release();
405
+ const interp = new FuncInterp(manager, domain.length);
406
+ interp.setElse(body);
407
+ manager.decRef(body);
408
+ this.registerFunc(def.decl, interp);
409
+ }
275
410
  }
276
411
 
277
412
  registerAuxDecl(decl: number, interp?: FuncInterp) {
@@ -279,7 +414,6 @@ export class ProtoModel {
279
414
  this.auxDecls.add(decl);
280
415
  }
281
416
 
282
- // reregister_decl: the old interpretation of decl moves to auxDecl.
283
417
  reregisterDecl(decl: number, interp: FuncInterp, auxDecl: number) {
284
418
  const old = this.funcInterps.get(decl);
285
419
  if (old === undefined) {
@@ -291,11 +425,32 @@ export class ProtoModel {
291
425
  this.funcInterps.set(decl, interp);
292
426
  }
293
427
 
294
- // eval: the result comes with a reference, which the caller releases.
295
428
  eval(expr: number, isModelCompletion: boolean) {
296
429
  this.evaluator.setModelCompletion(isModelCompletion);
297
- const result = this.evaluator.rewrite(expr);
298
- return result;
430
+ return this.evaluator.rewrite(expr);
431
+ }
432
+
433
+ resetEvalCache() {
434
+ this.evaluator.reset();
435
+ }
436
+
437
+ // model::unfold_as_array: the array an as-array denotes, from its function's interpretation.
438
+ unfoldAsArray(expr: number) {
439
+ const manager = this.manager;
440
+ if (!manager.isApp(expr) || !isAsArray(manager, manager.decls[expr])) return expr;
441
+ const decl = manager.funcDecls[manager.decls[expr]].parameters[0];
442
+ return this.funcInterps.get(decl)?.getArrayInterp(decl) ?? expr;
443
+ }
444
+
445
+ registerUsort(sort: number, universe: readonly number[]) {
446
+ const values = new RefVector(this.manager);
447
+ for (const value of universe) values.push(value);
448
+ this.universes.get(sort)?.reset();
449
+ this.universes.set(sort, values);
450
+ }
451
+
452
+ getUniverse(sort: number): readonly number[] | undefined {
453
+ return this.universes.get(sort)?.items;
299
454
  }
300
455
 
301
456
  private getValueSet(sort: number) {
@@ -306,19 +461,26 @@ export class ProtoModel {
306
461
  return created;
307
462
  }
308
463
 
309
- // arith_factory's values are the integers, of either sort.
310
464
  private mkIndexedValue(index: number, sort: number) {
465
+ const manager = this.manager;
311
466
  return isArithSort(sort)
312
- ? this.manager.mkNumeralOfSort(Rational.of(BigInt(index)), sort)
313
- : this.manager.mkModelValue(index, sort);
467
+ ? manager.mkNumeralOfSort(Rational.of(BigInt(index)), sort)
468
+ : manager.isBvSort(sort)
469
+ ? manager.mkBvNumeral(BigInt(index), manager.getBvSize(sort))
470
+ : manager.mkModelValue(index, sort);
314
471
  }
315
472
 
316
- // mk_value and register_value: a value is inserted only when it is new, since inserting grows the
317
- // table even for a value it has.
318
473
  private addValue(sort: number, value: number) {
319
474
  const set = this.getValueSet(sort);
320
475
  if (set.has(value)) return;
321
- (isArithSort(sort) ? this.arithValues : this.userSortValues).push(value);
476
+ (isArithSort(sort)
477
+ ? this.arithValues
478
+ : this.manager.isBvSort(sort)
479
+ ? this.bvValues
480
+ : this.manager.isDatatypeSort(sort)
481
+ ? this.datatypeValues
482
+ : this.userSortValues
483
+ ).push(value);
322
484
  set.add(value);
323
485
  }
324
486
 
@@ -328,16 +490,67 @@ export class ProtoModel {
328
490
  return value;
329
491
  }
330
492
 
493
+ getSeqFactory() {
494
+ this.seqFactory ??= new SeqFactory(this.manager, this);
495
+ return this.seqFactory;
496
+ }
497
+
498
+ getCharFactory() {
499
+ this.charFactory ??= new CharFactory(this.manager);
500
+ return this.charFactory;
501
+ }
502
+
331
503
  registerValue(value: number) {
332
- const sort = this.manager.sorts[value];
504
+ const manager = this.manager;
505
+ const sort = manager.sorts[value];
506
+ if (this.charFactory !== undefined && manager.isCharSort(sort)) {
507
+ this.charFactory.registerValue(manager.getChar(value));
508
+ return;
509
+ }
510
+ if (this.seqFactory !== undefined && manager.getSortFamily(sort) === FAMILY_SEQ) {
511
+ this.seqFactory.registerValue(value);
512
+ return;
513
+ }
333
514
  if (sort !== SORT_BOOL) this.addValue(sort, value);
334
515
  }
335
516
 
336
517
  getSomeValue(sort: number): number {
337
518
  const manager = this.manager;
519
+ if (this.charFactory !== undefined && manager.isCharSort(sort))
520
+ return manager.mkChar(this.charFactory.getSomeValue());
521
+ if (manager.isFpSort(sort) && !this.isFinal)
522
+ return mkFpNumeral(manager, mkZero(manager.getEbits(sort), manager.getSbits(sort), false));
523
+ if (
524
+ manager.isFpSort(sort) ||
525
+ manager.isRmSort(sort) ||
526
+ manager.getSortFamily(sort) === FAMILY_SEQ ||
527
+ manager.isCharSort(sort)
528
+ )
529
+ return getManagerSomeValue(manager, sort);
530
+ if (this.isFinal) {
531
+ const first = manager.isUninterpretedSort(sort)
532
+ ? (this.universes.get(sort)?.items[0] ??
533
+ this.values.get(sort)?.[Symbol.iterator]().next().value)
534
+ : undefined;
535
+ return first ?? getManagerSomeValue(manager, sort);
536
+ }
338
537
  if (sort === SORT_BOOL)
339
538
  return this.boolRandom.next() % 2 === 0 ? manager.falseExpr : manager.trueExpr;
340
539
  const set = this.values.get(sort);
540
+ if (manager.isDatatypeSort(sort)) {
541
+ if (set !== undefined && set.size > 0) {
542
+ const first = set[Symbol.iterator]().next();
543
+ if (first.done !== true) return first.value;
544
+ }
545
+ const constructor = getNonRecConstructor(manager, sort);
546
+ const value = manager.mkApp(
547
+ constructor,
548
+ manager.funcDecls[constructor].domain.map((argSort) => this.getSomeValue(argSort)),
549
+ sort,
550
+ );
551
+ this.addValue(sort, value);
552
+ return value;
553
+ }
341
554
  if (this.finiteSorts.has(sort) && set !== undefined) {
342
555
  const random = new RandomGen(manager.getNumAsts());
343
556
  let count = 1;
@@ -350,21 +563,129 @@ export class ProtoModel {
350
563
  }
351
564
  if (set !== undefined && set.size > 0)
352
565
  return set[Symbol.iterator]().next().value ?? this.mkValue(0, sort);
566
+ if (manager.isArraySort(sort)) {
567
+ const array = this.mkArrayInterp(sort);
568
+ array.interp.setElse(this.getSomeValue(manager.getArrayRange(sort)));
569
+ return array.value;
570
+ }
353
571
  return this.mkValue(0, sort);
354
572
  }
355
573
 
574
+ // array_factory::mk_array_interp: as-array of a fresh function, whose interpretation the caller
575
+ // fills in.
576
+ private mkArrayInterp(sort: number) {
577
+ const manager = this.manager;
578
+ const domain = manager.getSortParameters(sort).slice(0, -1);
579
+ const decl = manager.mkFreshFuncDecl(null, domain, manager.getArrayRange(sort));
580
+ const interp = new FuncInterp(manager, domain.length);
581
+ this.registerFunc(decl, interp);
582
+ const value = mkAsArray(manager, decl);
583
+ this.addValue(sort, value);
584
+ return { value, interp };
585
+ }
586
+
587
+ // array_factory::get_fresh_value. Z3 falls back to two fresh indexes when the range has no fresh
588
+ // value; that case is left to the caller as a failure.
589
+ private getFreshArrayValue(sort: number) {
590
+ const manager = this.manager;
591
+ if (this.getValueSet(sort).size === 0) return this.getSomeValue(sort);
592
+ const range = manager.getArrayRange(sort);
593
+ if (this.freshArrayRanges.includes(range)) return null;
594
+ this.freshArrayRanges.push(range);
595
+ const rangeValue = this.getFreshValue(range);
596
+ this.freshArrayRanges.pop();
597
+ if (rangeValue === null) return null;
598
+ const array = this.mkArrayInterp(sort);
599
+ array.interp.setElse(rangeValue);
600
+ return array.value;
601
+ }
602
+
603
+ private getFreshRecursiveValue(sort: number) {
604
+ const set = this.getValueSet(sort);
605
+ const enumeration = this.freshEnumerations.get(sort) ?? this.mkTermEnumeration(sort);
606
+ this.freshEnumerations.set(sort, enumeration);
607
+ for (let term = enumeration.current; term !== null; term = enumeration.current) {
608
+ enumeration.advance();
609
+ if (!set.has(term)) {
610
+ this.addValue(sort, term);
611
+ return term;
612
+ }
613
+ }
614
+ return null;
615
+ }
616
+
617
+ private mkTermEnumeration(sort: number) {
618
+ const manager = this.manager;
619
+ const constructors: number[] = [];
620
+ const visited = new Set([sort]);
621
+ const todo = [sort];
622
+ for (let current = todo.pop(); current !== undefined; current = todo.pop()) {
623
+ const nested = manager.isDatatypeSort(current)
624
+ ? getDatatypeConstructors(manager, current).flatMap((constructor) => {
625
+ constructors.push(constructor);
626
+ return manager.funcDecls[constructor].domain;
627
+ })
628
+ : [];
629
+ for (const next of [...nested, ...manager.getSortParameters(current)]) {
630
+ if (visited.has(next)) continue;
631
+ visited.add(next);
632
+ todo.push(next);
633
+ }
634
+ }
635
+ return new TermEnumeration(
636
+ manager,
637
+ [...new Set(constructors)],
638
+ sort,
639
+ (argSort) => this.getSomeValue(argSort),
640
+ (term) => this.enumeratedTerms.push(term),
641
+ );
642
+ }
643
+
644
+ private getFreshDatatypeValue(sort: number): number | null {
645
+ const manager = this.manager;
646
+ if (isRecursiveDatatype(manager, sort)) return this.getFreshRecursiveValue(sort);
647
+ const set = this.getValueSet(sort);
648
+ for (const constructor of getDatatypeConstructors(manager, sort)) {
649
+ let isFreshArgFound = false;
650
+ const args = manager.funcDecls[constructor].domain.map((argSort) => {
651
+ const fresh = isFreshArgFound ? null : this.getFreshValue(argSort);
652
+ if (fresh === null) return this.getSomeValue(argSort);
653
+ isFreshArgFound = true;
654
+ return fresh;
655
+ });
656
+ const value = manager.mkApp(constructor, args, sort);
657
+ if (!set.has(value)) {
658
+ this.addValue(sort, value);
659
+ return value;
660
+ }
661
+ }
662
+ return set.size === 0 ? this.getSomeValue(sort) : null;
663
+ }
664
+
356
665
  getFreshValue(sort: number): number | null {
357
666
  if (sort === SORT_BOOL || this.finiteSorts.has(sort)) return null;
667
+ if (this.charFactory !== undefined && this.manager.isCharSort(sort))
668
+ return this.manager.mkChar(this.charFactory.getFreshValue());
669
+ if (this.seqFactory !== undefined && this.manager.getSortFamily(sort) === FAMILY_SEQ)
670
+ return this.seqFactory.getFreshValue(sort);
671
+ if (this.manager.isFpSort(sort) || this.manager.isRmSort(sort))
672
+ return getManagerSomeValue(this.manager, sort);
673
+ if (this.manager.isDatatypeSort(sort)) return this.getFreshDatatypeValue(sort);
674
+ if (this.manager.isArraySort(sort)) return this.getFreshArrayValue(sort);
358
675
  const set = this.getValueSet(sort);
359
- let next = this.nextValue.get(sort) ?? 0;
676
+ const start = this.nextValue.get(sort) ?? 0;
677
+ const manager = this.manager;
678
+ const maxSize =
679
+ manager.isBvSort(sort) && manager.getBvSize(sort) < 32 ? 2 ** manager.getBvSize(sort) : -1;
680
+ let next = start;
360
681
  for (;;) {
361
682
  const value = this.mkIndexedValue(next, sort);
683
+ const isNew = !set.has(value);
684
+ if (isNew) this.addValue(sort, value);
362
685
  next++;
363
- if (!set.has(value)) {
364
- this.addValue(sort, value);
365
- this.nextValue.set(sort, next);
366
- return value;
367
- }
686
+ this.nextValue.set(sort, next);
687
+ if (maxSize !== -1 && next > maxSize + start) return null;
688
+ if (isNew) return value;
368
689
  }
369
690
  }
370
691
 
@@ -379,14 +700,212 @@ export class ProtoModel {
379
700
  return this.manager.isUninterpretedSort(sort) && this.finiteSorts.has(sort);
380
701
  }
381
702
 
703
+ getConstDecls(): readonly number[] {
704
+ return this.constDecls;
705
+ }
706
+
707
+ getFuncDecls(): readonly number[] {
708
+ return this.funcDecls;
709
+ }
710
+
711
+ getUninterpretedSorts() {
712
+ return [...this.values.keys()].filter((sort) => this.manager.isUninterpretedSort(sort));
713
+ }
714
+
715
+ // A registered universe keeps its order, as model::get_universe does.
382
716
  getKnownUniverse(sort: number): number[] {
383
- return [...(this.values.get(sort) ?? [])];
717
+ return [...(this.universes.get(sort)?.items ?? this.values.get(sort) ?? [])];
384
718
  }
385
719
 
386
720
  compress() {
387
721
  for (const decl of this.funcDecls) this.funcInterps.get(decl)?.compress();
388
722
  }
389
723
 
724
+ // model::compress, which get-model and get-value apply, unlike the compress of a proto_model: it
725
+ // inlines the skolem functions and the arrays that the other interpretations use, and drops the
726
+ // skolem declarations that none uses.
727
+ compact() {
728
+ if (this.isCompact) return;
729
+ const manager = this.manager;
730
+ const getHash = (decl: number) => manager.getDeclHash(decl);
731
+ for (;;) {
732
+ const sort = new DeclTopSort();
733
+ const occurCounts = new Map<number, number>();
734
+ const collectDeps = (decl: number, exprs: number[]) => {
735
+ const deps = new ObjHashtable(getHash);
736
+ for (const expr of exprs)
737
+ forEachExpr(manager, expr, (term) => {
738
+ if (manager.kinds[term] !== KIND_APP) return;
739
+ const termDecl = manager.decls[term];
740
+ const used = isAsArray(manager, termDecl)
741
+ ? manager.funcDecls[termDecl].parameters[0]
742
+ : termDecl;
743
+ if (!this.constInterps.has(used) && !this.funcInterps.has(used)) return;
744
+ deps.add(used);
745
+ occurCounts.set(used, (occurCounts.get(used) ?? 0) + 1);
746
+ });
747
+ sort.insert(decl, deps);
748
+ };
749
+ for (const [decl, interp] of this.funcInterps) {
750
+ if (manager.recFunDefs.has(decl)) continue;
751
+ interp.compress();
752
+ collectDeps(decl, [
753
+ ...(interp.elseExpr === null ? [] : [interp.elseExpr]),
754
+ ...interp.entries.flatMap((entry) => [...entry.args, entry.result]),
755
+ ]);
756
+ }
757
+ for (const [decl, value] of this.constInterps)
758
+ if (!manager.recFunDefs.has(decl) && !manager.macros.has(decl)) collectDeps(decl, [value]);
759
+ sort.sort();
760
+ const rewriter = new Rewriter(manager, TACTIC_REWRITER_OPTIONS);
761
+ for (const decl of sort.sorted) {
762
+ const partition = sort.partitions.get(decl) as number;
763
+ const cleanup = (expr: number) =>
764
+ this.compactExpr(rewriter, expr, partition, sort.partitions, occurCounts);
765
+ const value = this.constInterps.get(decl);
766
+ if (value !== undefined) {
767
+ const cleaned = cleanup(value);
768
+ if (cleaned !== value) this.registerConst(decl, cleaned);
769
+ manager.decRef(cleaned);
770
+ continue;
771
+ }
772
+ const interp = this.funcInterps.get(decl);
773
+ if (interp === undefined) continue;
774
+ if (interp.elseExpr !== null) {
775
+ const cleaned = cleanup(interp.elseExpr);
776
+ interp.setElse(cleaned);
777
+ manager.decRef(cleaned);
778
+ }
779
+ for (const entry of interp.entries) {
780
+ const cleaned = cleanup(entry.result);
781
+ if (cleaned !== entry.result) interp.insertEntry(entry.args, cleaned);
782
+ manager.decRef(cleaned);
783
+ }
784
+ }
785
+ rewriter.release();
786
+ const occurrences = new Map<number, number>();
787
+ const collectOccs = (expr: number) => {
788
+ const decls = new Set<number>();
789
+ forEachExpr(manager, expr, (term) => {
790
+ if (manager.kinds[term] !== KIND_APP) return;
791
+ const termDecl = manager.decls[term];
792
+ decls.add(termDecl);
793
+ if (isAsArray(manager, termDecl) || isArrayMap(manager, termDecl))
794
+ decls.add(manager.funcDecls[termDecl].parameters[0]);
795
+ });
796
+ for (const decl of decls) occurrences.set(decl, (occurrences.get(decl) ?? 0) + 1);
797
+ };
798
+ for (const decl of sort.sorted) {
799
+ const value = this.constInterps.get(decl);
800
+ const interp = this.funcInterps.get(decl);
801
+ if (value !== undefined) collectOccs(value);
802
+ else if (interp !== undefined) {
803
+ if (interp.elseExpr !== null) collectOccs(interp.elseExpr);
804
+ for (const entry of interp.entries) {
805
+ collectOccs(entry.result);
806
+ for (const arg of entry.args) collectOccs(arg);
807
+ }
808
+ }
809
+ }
810
+ const removed = sort.sorted.filter(
811
+ (decl) => manager.funcDecls[decl].isSkolem && !occurrences.has(decl),
812
+ );
813
+ for (const decl of removed) this.unregisterDecl(decl);
814
+ if (removed.length === 0) break;
815
+ }
816
+ this.isCompact = true;
817
+ }
818
+
819
+ // can_inline_def: an interpretation that more than one other uses is inlined when it is small.
820
+ private canInlineDef(decl: number, occurCounts: Map<number, number>) {
821
+ if ((occurCounts.get(decl) ?? 0) <= 1) return true;
822
+ const interp = this.funcInterps.get(decl);
823
+ if (interp === undefined || interp.elseExpr === null) return false;
824
+ const subterms = new Set<number>();
825
+ const todo = [interp.elseExpr];
826
+ while (todo.length > 0) {
827
+ if (interp.entries.length + subterms.size > 8) return false;
828
+ const expr = todo.pop() as number;
829
+ if (subterms.has(expr)) continue;
830
+ subterms.add(expr);
831
+ if (this.manager.kinds[expr] === KIND_APP) todo.push(...this.manager.getArgs(expr));
832
+ else if (this.manager.kinds[expr] === KIND_QUANTIFIER)
833
+ todo.push(this.manager.getQuantifier(expr).body);
834
+ }
835
+ return true;
836
+ }
837
+
838
+ // model::cleanup_expr: the result comes with a reference, which the caller releases.
839
+ private compactExpr(
840
+ rewriter: Rewriter,
841
+ expr: number,
842
+ partition: number,
843
+ partitions: Map<number, number>,
844
+ occurCounts: Map<number, number>,
845
+ ) {
846
+ const manager = this.manager;
847
+ const trail = new RefVector(manager);
848
+ const cache = new Map<number, number>();
849
+ const todo = [expr];
850
+ while (todo.length > 0) {
851
+ const current = todo[todo.length - 1];
852
+ // A numeral carries its value, so the rewriter keeps every constant as it is.
853
+ if (
854
+ manager.kinds[current] !== KIND_APP ||
855
+ (manager.getNumArgs(current) === 0 && !isAsArray(manager, manager.decls[current]))
856
+ ) {
857
+ todo.pop();
858
+ cache.set(current, current);
859
+ continue;
860
+ }
861
+ const numTodo = todo.length;
862
+ for (let index = 0; index < manager.getNumArgs(current); index++) {
863
+ const arg = manager.getArg(current, index);
864
+ if (!cache.has(arg)) todo.push(arg);
865
+ }
866
+ if (todo.length > numTodo) continue;
867
+ todo.pop();
868
+ const decl = manager.decls[current];
869
+ const funcDecl = manager.funcDecls[decl];
870
+ const args = manager.mapArgs(current, (arg) => cache.get(arg) as number);
871
+ const arrayDecl = isAsArray(manager, decl) ? funcDecl.parameters[0] : -1;
872
+ const interp = this.funcInterps.get(arrayDecl === -1 ? decl : arrayDecl);
873
+ const result = manager.withTemporaries(() => {
874
+ if (arrayDecl !== -1 && interp !== undefined && this.canInlineDef(arrayDecl, occurCounts)) {
875
+ const arrayInterp = interp.getArrayInterp(arrayDecl);
876
+ if (arrayInterp !== undefined) return arrayInterp;
877
+ }
878
+ if (
879
+ arrayDecl === -1 &&
880
+ funcDecl.isSkolem &&
881
+ interp !== undefined &&
882
+ this.canInlineDef(decl, occurCounts) &&
883
+ interp.getInterp() !== null &&
884
+ partitions.get(decl) !== partition
885
+ ) {
886
+ const subst = new VarSubst(manager, false);
887
+ const substituted = subst.apply(interp.getInterp() as number, args);
888
+ subst.release();
889
+ manager.releaseLater(substituted);
890
+ return substituted;
891
+ }
892
+ if (funcDecl.family === FAMILY_BV && funcDecl.op === OP_BIT2BOOL) {
893
+ const index = funcDecl.parameters[0];
894
+ return manager.mkEq(
895
+ mkBvApp(manager, OP_EXTRACT, [args[0]], [index, index]),
896
+ manager.mkBvNumeral(1n, 1),
897
+ );
898
+ }
899
+ return rewriter.mkApp(decl, args, manager.sorts[current]);
900
+ });
901
+ trail.pushOwned(result);
902
+ cache.set(current, result);
903
+ }
904
+ const result = rewriter.rewrite(cache.get(expr) as number);
905
+ trail.reset();
906
+ return result;
907
+ }
908
+
390
909
  completePartialFunc(decl: number, isUsingFresh: boolean) {
391
910
  const interp = this.funcInterps.get(decl);
392
911
  if (interp === undefined || !interp.isPartial()) return;
@@ -396,14 +915,10 @@ export class ProtoModel {
396
915
  }
397
916
 
398
917
  completePartialFuncs(isUsingFresh: boolean) {
399
- // get_some_value may register more declarations, which the loop then completes too.
400
918
  for (let index = 0; index < this.funcDecls.length; index++)
401
919
  this.completePartialFunc(this.funcDecls[index], isUsingFresh);
402
920
  }
403
921
 
404
- // cleanup_expr: replaces the uninterpreted constants in an else expression with their values. Like
405
- // Z3, it walks a todo stack, so it rewrites the last argument of a term first. The trail holds the
406
- // terms it rewrote until the next call.
407
922
  private cleanupExpr(trail: RefVector, expr: number, foundAuxDecls: ObjHashtable) {
408
923
  const manager = this.manager;
409
924
  trail.reset();
@@ -448,12 +963,10 @@ export class ProtoModel {
448
963
  return cache.get(expr) ?? expr;
449
964
  }
450
965
 
451
- // cleanup: also removes the auxiliary declarations that no interpretation uses.
452
966
  cleanup() {
453
967
  const manager = this.manager;
454
968
  const foundAuxDecls = new ObjHashtable((decl) => manager.getDeclHash(decl));
455
969
  const trail = new RefVector(manager);
456
- // Like Z3, it collects the interpretations before it cleans them up.
457
970
  const interps = Array.from(this.funcInterps, (entry) => entry[1]);
458
971
  for (const interp of interps)
459
972
  if (interp.elseExpr !== null)
@@ -465,7 +978,6 @@ export class ProtoModel {
465
978
  if (cleaned !== value) this.registerConst(decl, cleaned);
466
979
  }
467
980
  if (foundAuxDecls.size !== this.auxDecls.size) {
468
- // remove_aux_decls_not_in_set.
469
981
  this.funcDecls = this.funcDecls.filter(
470
982
  (decl) => !this.auxDecls.has(decl) || foundAuxDecls.has(decl),
471
983
  );
@@ -475,9 +987,8 @@ export class ProtoModel {
475
987
  trail.reset();
476
988
  }
477
989
 
478
- // model_core::unregister_decl: releases the value or the interpretation. The last constant takes
479
- // the place of a removed one.
480
- private unregisterDecl(decl: number) {
990
+ // The last constant takes the place of a removed one.
991
+ unregisterDecl(decl: number) {
481
992
  const value = this.constInterps.get(decl);
482
993
  if (value !== undefined) {
483
994
  const index = this.constDecls.indexOf(decl);
@@ -506,13 +1017,15 @@ export class ProtoModel {
506
1017
  if (this.refCount === 0) this.release();
507
1018
  }
508
1019
 
509
- // ~proto_model: the rewriter, the evaluator and the factories go before the interpretations, and
510
- // the user sort factory before the arith_factory.
511
1020
  private release() {
512
1021
  this.rewriter.release();
513
1022
  this.evaluator.release();
1023
+ for (const universe of this.universes.values()) universe.reset();
514
1024
  this.userSortValues.reset();
515
1025
  this.arithValues.reset();
1026
+ this.bvValues.reset();
1027
+ this.datatypeValues.reset();
1028
+ this.enumeratedTerms.reset();
516
1029
  for (const entry of this.constInterps) {
517
1030
  this.manager.decDeclRef(entry[0]);
518
1031
  this.manager.decRef(entry[1]);
@@ -523,10 +1036,20 @@ export class ProtoModel {
523
1036
  }
524
1037
  }
525
1038
 
526
- // mk_model: the model holds the values of the constants and the universes of the uninterpreted
527
- // sorts, and takes the interpretations of the functions.
1039
+ copy() {
1040
+ const model = new ProtoModel(this.manager);
1041
+ model.isFinal = this.isFinal;
1042
+ for (const entry of this.constInterps) model.registerConst(entry[0], entry[1]);
1043
+ for (const entry of this.funcInterps) model.registerFunc(entry[0], entry[1].copy());
1044
+ for (const sort of this.getUninterpretedSorts())
1045
+ for (const value of this.getKnownUniverse(sort)) model.registerValue(value);
1046
+ for (const entry of this.universes) model.registerUsort(entry[0], entry[1].items);
1047
+ return model;
1048
+ }
1049
+
528
1050
  mkModel() {
529
1051
  const model = new ProtoModel(this.manager);
1052
+ model.isFinal = true;
530
1053
  for (const entry of this.constInterps) model.registerConst(entry[0], entry[1]);
531
1054
  for (const entry of this.funcInterps) {
532
1055
  model.registerFunc(entry[0], entry[1]);
@@ -536,16 +1059,77 @@ export class ProtoModel {
536
1059
  this.funcDecls = [];
537
1060
  for (const entry of this.values)
538
1061
  if (!isArithSort(entry[0])) for (const value of entry[1]) model.registerValue(value);
1062
+ for (const entry of this.universes) model.registerUsort(entry[0], entry[1].items);
539
1063
  return model;
540
1064
  }
541
1065
 
542
- // model::get_some_const_interp.
543
1066
  getSomeConstInterp(decl: number) {
544
1067
  return this.constInterps.get(decl) ?? this.getSomeValue(this.manager.funcDecls[decl].range);
545
1068
  }
1069
+ }
1070
+
1071
+ const isAsArray = (manager: AstManager, decl: number) =>
1072
+ manager.funcDecls[decl].family === FAMILY_ARRAY && manager.funcDecls[decl].op === OP_AS_ARRAY;
1073
+
1074
+ const isArrayMap = (manager: AstManager, decl: number) =>
1075
+ manager.funcDecls[decl].family === FAMILY_ARRAY && manager.funcDecls[decl].op === OP_ARRAY_MAP;
1076
+
1077
+ // for_each_expr: each distinct subterm, after its arguments.
1078
+ const forEachExpr = (manager: AstManager, expr: number, visit: (term: number) => void) => {
1079
+ const visited = new Set<number>();
1080
+ const walk = (term: number) => {
1081
+ if (visited.has(term)) return;
1082
+ visited.add(term);
1083
+ if (manager.kinds[term] === KIND_APP) for (const arg of manager.getArgs(term)) walk(arg);
1084
+ else if (manager.kinds[term] === KIND_QUANTIFIER) walk(manager.getQuantifier(term).body);
1085
+ visit(term);
1086
+ };
1087
+ walk(expr);
1088
+ };
546
1089
 
547
- // model::are_equal for values.
548
- areEqual(first: number, second: number) {
549
- return first === second;
1090
+ // top_sort: each declaration comes after the ones its interpretation uses. Like Z3's, it never pops
1091
+ // the path stack, so the declarations of a cycle get partitions of their own.
1092
+ class DeclTopSort {
1093
+ readonly sorted: number[] = [];
1094
+ readonly partitions = new Map<number, number>();
1095
+ private deps = new Map<number, ObjHashtable>();
1096
+ private dfsNums = new Map<number, number>();
1097
+ private stackS: number[] = [];
1098
+ private stackP: number[] = [];
1099
+
1100
+ insert(decl: number, deps: ObjHashtable) {
1101
+ this.deps.set(decl, deps);
1102
+ }
1103
+
1104
+ sort() {
1105
+ for (const decl of this.deps.keys()) this.traverse(decl);
1106
+ }
1107
+
1108
+ private traverse(decl: number) {
1109
+ const dfsNum = this.dfsNums.get(decl);
1110
+ if (dfsNum !== undefined) {
1111
+ if (this.partitions.has(decl)) return;
1112
+ for (
1113
+ let top = this.stackP.at(-1);
1114
+ top !== undefined && (this.partitions.get(top) ?? -1) > dfsNum;
1115
+ top = this.stackP.at(-1)
1116
+ )
1117
+ this.stackP.pop();
1118
+ return;
1119
+ }
1120
+ const deps = this.deps.get(decl);
1121
+ if (deps === undefined) return;
1122
+ this.dfsNums.set(decl, this.dfsNums.size);
1123
+ this.stackS.push(decl);
1124
+ this.stackP.push(decl);
1125
+ for (const dep of deps) this.traverse(dep);
1126
+ if (decl !== this.stackP.at(-1)) return;
1127
+ const partition = this.sorted.length;
1128
+ for (let top = this.stackS.pop(); top !== undefined; top = this.stackS.pop()) {
1129
+ this.sorted.push(top);
1130
+ this.partitions.set(top, partition);
1131
+ if (top === decl) break;
1132
+ }
1133
+ this.stackP.pop();
550
1134
  }
551
1135
  }