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

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (586) hide show
  1. package/README.md +2 -1
  2. package/dist/compile.cjs +6 -6
  3. package/dist/compile.js +10 -10
  4. package/dist/deciders.cjs +41 -37
  5. package/dist/deciders.js +57 -53
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +37 -0
  8. package/dist/index.d.ts +37 -0
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove.cjs +2683 -427
  13. package/dist/prove.js +2681 -425
  14. package/dist/run.cjs +45 -44
  15. package/dist/run.js +45 -44
  16. package/dist/tlapm.cjs +2 -2
  17. package/dist/tlapm.js +2 -2
  18. package/dist/transfer.cjs +44 -41
  19. package/dist/transfer.js +45 -42
  20. package/dist/worker.cjs +7 -7
  21. package/dist/worker.js +7 -7
  22. package/package.json +1 -1
  23. package/src/ast.ts +41 -41
  24. package/src/bags.ts +2 -5
  25. package/src/builtins.ts +5 -21
  26. package/src/check-failure.ts +116 -0
  27. package/src/check-trace.ts +268 -0
  28. package/src/check.ts +578 -757
  29. package/src/cli/options.ts +6 -31
  30. package/src/cli/run.ts +0 -2
  31. package/src/cli/runtime-invariants.ts +27 -62
  32. package/src/cli/shared.ts +1 -5
  33. package/src/cli/tlapm.ts +433 -70
  34. package/src/cli/tlc-arguments.ts +246 -240
  35. package/src/cli/tlc-output.ts +686 -0
  36. package/src/cli/tlc-usage.ts +3 -5
  37. package/src/cli/tlc.ts +59 -707
  38. package/src/cli/xml-exporter.ts +23 -33
  39. package/src/codegen.ts +5 -10
  40. package/src/coverage.ts +3 -10
  41. package/src/dependencies.ts +30 -14
  42. package/src/dfid.ts +16 -16
  43. package/src/environment-config.ts +315 -0
  44. package/src/environment.ts +73 -338
  45. package/src/errors.ts +33 -5
  46. package/src/evaluate.ts +34 -107
  47. package/src/exit-codes.ts +3 -0
  48. package/src/fingerprints.ts +65 -1
  49. package/src/instances.ts +47 -10
  50. package/src/java-hash.ts +7 -0
  51. package/src/java-overrides.ts +4 -9
  52. package/src/json-reader.ts +1 -2
  53. package/src/json.ts +8 -18
  54. package/src/levels.ts +46 -57
  55. package/src/lexer.ts +76 -85
  56. package/src/liveness-checker.ts +634 -306
  57. package/src/liveness.ts +104 -120
  58. package/src/obligations/action.ts +14 -17
  59. package/src/obligations/anonymize.ts +37 -16
  60. package/src/obligations/enabled-axioms.ts +218 -0
  61. package/src/obligations/equality.ts +1 -3
  62. package/src/obligations/expression.ts +36 -8
  63. package/src/obligations/format.ts +0 -2
  64. package/src/obligations/generate.ts +66 -54
  65. package/src/obligations/index.ts +38 -8
  66. package/src/obligations/levels.ts +24 -11
  67. package/src/obligations/module.ts +28 -41
  68. package/src/obligations/normalize.ts +26 -14
  69. package/src/obligations/operators.ts +0 -2
  70. package/src/obligations/pragma.ts +53 -16
  71. package/src/obligations/printer.ts +43 -13
  72. package/src/obligations/proof.ts +3 -2
  73. package/src/obligations/regroup.ts +0 -2
  74. package/src/obligations/simplify.ts +55 -50
  75. package/src/obligations/source.ts +118 -74
  76. package/src/obligations/subexpression.ts +45 -18
  77. package/src/obligations/substitution.ts +1 -3
  78. package/src/obligations/temporal.ts +5 -7
  79. package/src/obligations/tuples.ts +0 -2
  80. package/src/parallel-worker.ts +17 -31
  81. package/src/parallel.ts +55 -80
  82. package/src/parser.ts +722 -385
  83. package/src/pcal/ast.ts +53 -65
  84. package/src/pcal/parse.ts +144 -191
  85. package/src/pcal/tokenize.ts +91 -115
  86. package/src/pcal/translate.ts +83 -98
  87. package/src/pcal/validate.ts +48 -50
  88. package/src/pretty-print.ts +7 -7
  89. package/src/prover/decide-pool.ts +3 -3
  90. package/src/prover/deciders.ts +12 -9
  91. package/src/prover/isabelle/decide.ts +3 -25
  92. package/src/prover/isabelle/encode.ts +72 -42
  93. package/src/prover/isabelle/isar/attrib.ts +250 -0
  94. package/src/prover/isabelle/isar/context.ts +335 -0
  95. package/src/prover/isabelle/isar/induct.ts +382 -0
  96. package/src/prover/isabelle/isar/inner-syntax.ts +158 -7
  97. package/src/prover/isabelle/isar/method.ts +509 -212
  98. package/src/prover/isabelle/isar/proof.ts +570 -14
  99. package/src/prover/isabelle/isar/rule-cases.ts +224 -0
  100. package/src/prover/isabelle/isar/theory.ts +487 -76
  101. package/src/prover/isabelle/isar/toplevel.ts +331 -0
  102. package/src/prover/isabelle/isar/type-check.ts +89 -14
  103. package/src/prover/isabelle/provers/blast/blast.ts +7 -65
  104. package/src/prover/isabelle/provers/blast/branch.ts +0 -2
  105. package/src/prover/isabelle/provers/blast/prove.ts +0 -2
  106. package/src/prover/isabelle/provers/blast/rules.ts +0 -2
  107. package/src/prover/isabelle/provers/blast/state.ts +0 -2
  108. package/src/prover/isabelle/provers/blast/term.ts +0 -2
  109. package/src/prover/isabelle/provers/clasimp.ts +0 -2
  110. package/src/prover/isabelle/provers/classical.ts +45 -20
  111. package/src/prover/isabelle/provers/hypsubst.ts +17 -28
  112. package/src/prover/isabelle/pure/bicompose.ts +9 -27
  113. package/src/prover/isabelle/pure/consts.ts +0 -2
  114. package/src/prover/isabelle/pure/conv.ts +2 -10
  115. package/src/prover/isabelle/pure/drule.ts +72 -6
  116. package/src/prover/isabelle/pure/envir.ts +0 -2
  117. package/src/prover/isabelle/pure/goal.ts +1 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -3
  119. package/src/prover/isabelle/pure/name.ts +0 -2
  120. package/src/prover/isabelle/pure/net.ts +0 -2
  121. package/src/prover/isabelle/pure/object-logic.ts +13 -7
  122. package/src/prover/isabelle/pure/pattern.ts +0 -2
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +4 -15
  124. package/src/prover/isabelle/pure/rewriter.ts +6 -17
  125. package/src/prover/isabelle/pure/search.ts +0 -2
  126. package/src/prover/isabelle/pure/seq.ts +0 -2
  127. package/src/prover/isabelle/pure/simplifier.ts +26 -7
  128. package/src/prover/isabelle/pure/table.ts +2 -3
  129. package/src/prover/isabelle/pure/tactic.ts +0 -2
  130. package/src/prover/isabelle/pure/tactical.ts +42 -37
  131. package/src/prover/isabelle/pure/term-ord.ts +0 -2
  132. package/src/prover/isabelle/pure/term.ts +0 -2
  133. package/src/prover/isabelle/pure/thm.ts +14 -13
  134. package/src/prover/isabelle/pure/type.ts +0 -2
  135. package/src/prover/isabelle/pure/unify.ts +0 -2
  136. package/src/prover/isabelle/pure/variable.ts +0 -2
  137. package/src/prover/isabelle/tla/classical-setup.ts +18 -16
  138. package/src/prover/isabelle/tla/context.ts +58 -11
  139. package/src/prover/isabelle/tla/logic-data.ts +1 -1
  140. package/src/prover/isabelle/tla/logic.ts +49 -21
  141. package/src/prover/isabelle/tla/simpdata.ts +1 -12
  142. package/src/prover/isabelle/tools/intuitionistic.ts +28 -12
  143. package/src/prover/ocaml.ts +4 -1
  144. package/src/prover/prep/action.ts +30 -31
  145. package/src/prover/prep/enabled-axioms.ts +11 -2
  146. package/src/prover/prep/fingerprint.ts +2 -5
  147. package/src/prover/prep/methods.ts +181 -51
  148. package/src/prover/prep/normalize.ts +38 -9
  149. package/src/prover/prove.ts +395 -94
  150. package/src/prover/ptl/decide.ts +95 -50
  151. package/src/prover/ptl/encode.ts +2 -3
  152. package/src/prover/ptl/tableau.ts +28 -2
  153. package/src/prover/smt/arithmetic.ts +310 -0
  154. package/src/prover/smt/axioms.ts +12 -8
  155. package/src/prover/smt/context.ts +43 -8
  156. package/src/prover/smt/data.ts +498 -379
  157. package/src/prover/smt/encode.ts +148 -57
  158. package/src/prover/smt/extensionality.ts +5 -3
  159. package/src/prover/smt/flatten.ts +4 -6
  160. package/src/prover/smt/format.ts +28 -4
  161. package/src/prover/smt/instances.ts +7 -1
  162. package/src/prover/smt/layout.ts +91 -0
  163. package/src/prover/smt/rewrite.ts +1021 -618
  164. package/src/prover/smt/simplify.ts +441 -0
  165. package/src/prover/smt/solver/ackermannize-bv-tactic.ts +61 -0
  166. package/src/prover/smt/solver/ackr-helper.ts +179 -0
  167. package/src/prover/smt/solver/ackr-model-converter.ts +105 -0
  168. package/src/prover/smt/solver/act-cache.ts +0 -1
  169. package/src/prover/smt/solver/add-bounds-tactic.ts +59 -0
  170. package/src/prover/smt/solver/aig-tactic.ts +52 -0
  171. package/src/prover/smt/solver/aig.ts +889 -0
  172. package/src/prover/smt/solver/arith-rewriter.ts +613 -6
  173. package/src/prover/smt/solver/arith-terms.ts +121 -0
  174. package/src/prover/smt/solver/array-decl-plugin.ts +175 -0
  175. package/src/prover/smt/solver/array-rewriter.ts +309 -0
  176. package/src/prover/smt/solver/asserted-formulas.ts +87 -16
  177. package/src/prover/smt/solver/ast-lt.ts +166 -12
  178. package/src/prover/smt/solver/ast-util.ts +160 -2
  179. package/src/prover/smt/solver/ast.ts +1427 -41
  180. package/src/prover/smt/solver/auf-solver.ts +2 -6
  181. package/src/prover/smt/solver/bit-blast-tactic.ts +582 -0
  182. package/src/prover/smt/solver/bit-blaster.ts +871 -0
  183. package/src/prover/smt/solver/bound-manager.ts +196 -0
  184. package/src/prover/smt/solver/bound-simplifier.ts +600 -0
  185. package/src/prover/smt/solver/bv-bound-chk.ts +492 -0
  186. package/src/prover/smt/solver/bv-decl-plugin.ts +338 -0
  187. package/src/prover/smt/solver/bv-divrem-bounds.ts +95 -0
  188. package/src/prover/smt/solver/bv-rewriter.ts +1901 -0
  189. package/src/prover/smt/solver/bv1-blast.ts +214 -0
  190. package/src/prover/smt/solver/bv2fpa-converter.ts +174 -0
  191. package/src/prover/smt/solver/bv2int-rewriter.ts +544 -0
  192. package/src/prover/smt/solver/bv2real-rewriter.ts +533 -0
  193. package/src/prover/smt/solver/card2bv.ts +110 -0
  194. package/src/prover/smt/solver/case-split-queue.ts +0 -2
  195. package/src/prover/smt/solver/cg-table.ts +39 -25
  196. package/src/prover/smt/solver/check-logic.ts +330 -0
  197. package/src/prover/smt/solver/clause.ts +0 -1
  198. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +278 -0
  199. package/src/prover/smt/solver/conflict-resolution.ts +78 -2
  200. package/src/prover/smt/solver/context.ts +516 -115
  201. package/src/prover/smt/solver/ctx-simplify.ts +20 -10
  202. package/src/prover/smt/solver/ctx-solver-simplify.ts +122 -0
  203. package/src/prover/smt/solver/datatype-decl-plugin.ts +572 -0
  204. package/src/prover/smt/solver/datatype-rewriter.ts +82 -0
  205. package/src/prover/smt/solver/demodulator.ts +786 -0
  206. package/src/prover/smt/solver/dependent-expr-state.ts +81 -0
  207. package/src/prover/smt/solver/der.ts +38 -10
  208. package/src/prover/smt/solver/diff-neq.ts +206 -0
  209. package/src/prover/smt/solver/distribute-forall.ts +57 -0
  210. package/src/prover/smt/solver/dom-simplify.ts +511 -0
  211. package/src/prover/smt/solver/dt2bv-tactic.ts +260 -0
  212. package/src/prover/smt/solver/dyn-ack.ts +0 -1
  213. package/src/prover/smt/solver/e-matching.ts +7 -8
  214. package/src/prover/smt/solver/elim-small-bv-tactic.ts +129 -0
  215. package/src/prover/smt/solver/elim-uncnstr.ts +545 -0
  216. package/src/prover/smt/solver/enode.ts +100 -3
  217. package/src/prover/smt/solver/eq2bv-tactic.ts +218 -0
  218. package/src/prover/smt/solver/euf/arith-axioms.ts +403 -0
  219. package/src/prover/smt/solver/euf/arith-internalize.ts +653 -0
  220. package/src/prover/smt/solver/euf/arith-solver.ts +889 -0
  221. package/src/prover/smt/solver/euf/array-axioms.ts +527 -0
  222. package/src/prover/smt/solver/euf/array-internalize.ts +428 -0
  223. package/src/prover/smt/solver/euf/array-solver.ts +306 -0
  224. package/src/prover/smt/solver/euf/bv-ackerman.ts +162 -0
  225. package/src/prover/smt/solver/euf/bv-internalize.ts +748 -0
  226. package/src/prover/smt/solver/euf/bv-solver.ts +449 -0
  227. package/src/prover/smt/solver/euf/dt-solver.ts +618 -0
  228. package/src/prover/smt/solver/euf/egraph.ts +908 -0
  229. package/src/prover/smt/solver/euf/euf-solver.ts +1205 -0
  230. package/src/prover/smt/solver/euf/fpa-solver.ts +317 -0
  231. package/src/prover/smt/solver/euf/mam.ts +1050 -0
  232. package/src/prover/smt/solver/euf/q-ematch.ts +830 -0
  233. package/src/prover/smt/solver/euf/q-mbi.ts +587 -0
  234. package/src/prover/smt/solver/euf/q-model-fixer.ts +296 -0
  235. package/src/prover/smt/solver/euf/q-solver.ts +361 -0
  236. package/src/prover/smt/solver/euf/th-solver.ts +335 -0
  237. package/src/prover/smt/solver/euf/th-solvers.ts +30 -0
  238. package/src/prover/smt/solver/expr-ref.ts +0 -1
  239. package/src/prover/smt/solver/expr-safe-replace.ts +26 -2
  240. package/src/prover/smt/solver/expr2polynomial.ts +146 -0
  241. package/src/prover/smt/solver/factor.ts +141 -0
  242. package/src/prover/smt/solver/fd-solver.ts +265 -0
  243. package/src/prover/smt/solver/fingerprints.ts +15 -15
  244. package/src/prover/smt/solver/fix-dl-var.ts +148 -0
  245. package/src/prover/smt/solver/flat-literals.ts +0 -1
  246. package/src/prover/smt/solver/fm-tactic.ts +884 -0
  247. package/src/prover/smt/solver/fpa-decl-plugin.ts +618 -0
  248. package/src/prover/smt/solver/fpa-rewriter.ts +640 -0
  249. package/src/prover/smt/solver/fpa2bv-converter.ts +2249 -0
  250. package/src/prover/smt/solver/fpa2bv-rewriter.ts +348 -0
  251. package/src/prover/smt/solver/fpa2bv-tactic.ts +73 -0
  252. package/src/prover/smt/solver/goal.ts +175 -15
  253. package/src/prover/smt/solver/goal2nlsat.ts +189 -0
  254. package/src/prover/smt/solver/guard-set.ts +219 -0
  255. package/src/prover/smt/solver/hash.ts +0 -1
  256. package/src/prover/smt/solver/hashtable.ts +30 -16
  257. package/src/prover/smt/solver/inf-eps.ts +63 -0
  258. package/src/prover/smt/solver/inj-axiom.ts +101 -0
  259. package/src/prover/smt/solver/internalizer.ts +110 -38
  260. package/src/prover/smt/solver/lackr.ts +381 -0
  261. package/src/prover/smt/solver/lbool.ts +0 -1
  262. package/src/prover/smt/solver/lia2card.ts +268 -0
  263. package/src/prover/smt/solver/lia2pb.ts +154 -0
  264. package/src/prover/smt/solver/literal.ts +0 -1
  265. package/src/prover/smt/solver/logic-tactics.ts +345 -0
  266. package/src/prover/smt/solver/lp/bound-propagator.ts +0 -1
  267. package/src/prover/smt/solver/lp/constraints.ts +0 -1
  268. package/src/prover/smt/solver/lp/containers.ts +7 -2
  269. package/src/prover/smt/solver/lp/core-solver.ts +18 -3
  270. package/src/prover/smt/solver/lp/cross-nested.ts +1 -4
  271. package/src/prover/smt/solver/lp/dep-intervals.ts +0 -3
  272. package/src/prover/smt/solver/lp/dependency.ts +0 -2
  273. package/src/prover/smt/solver/lp/dioph-eq.ts +1 -10
  274. package/src/prover/smt/solver/lp/explanation.ts +0 -1
  275. package/src/prover/smt/solver/lp/gomory.ts +0 -1
  276. package/src/prover/smt/solver/lp/hnf-cutter.ts +1 -2
  277. package/src/prover/smt/solver/lp/hnf.ts +0 -3
  278. package/src/prover/smt/solver/lp/int-cube.ts +3 -4
  279. package/src/prover/smt/solver/lp/int-solver.ts +0 -2
  280. package/src/prover/smt/solver/lp/lar-solver.ts +40 -4
  281. package/src/prover/smt/solver/lp/lar-term.ts +0 -1
  282. package/src/prover/smt/solver/lp/lp-settings.ts +0 -1
  283. package/src/prover/smt/solver/lp/maximize-term.ts +59 -10
  284. package/src/prover/smt/solver/lp/nex-creator.ts +3 -3
  285. package/src/prover/smt/solver/lp/nex.ts +2 -2
  286. package/src/prover/smt/solver/lp/nla-backoff.ts +0 -2
  287. package/src/prover/smt/solver/lp/nla-basics.ts +46 -3
  288. package/src/prover/smt/solver/lp/nla-core.ts +67 -16
  289. package/src/prover/smt/solver/lp/nla-divisions.ts +0 -2
  290. package/src/prover/smt/solver/lp/nla-emonics.ts +0 -1
  291. package/src/prover/smt/solver/lp/nla-factorization.ts +0 -1
  292. package/src/prover/smt/solver/lp/nla-grobner.ts +165 -83
  293. package/src/prover/smt/solver/lp/nla-horner.ts +0 -2
  294. package/src/prover/smt/solver/lp/nla-intervals.ts +0 -1
  295. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +0 -2
  296. package/src/prover/smt/solver/lp/nla-monotone.ts +0 -1
  297. package/src/prover/smt/solver/lp/nla-order.ts +0 -2
  298. package/src/prover/smt/solver/lp/nla-patcher.ts +0 -1
  299. package/src/prover/smt/solver/lp/nla-powers.ts +220 -0
  300. package/src/prover/smt/solver/lp/nla-tangents.ts +0 -2
  301. package/src/prover/smt/solver/lp/nla-throttle.ts +0 -1
  302. package/src/prover/smt/solver/lp/nla-transcendentals.ts +324 -0
  303. package/src/prover/smt/solver/lp/nla-types.ts +0 -2
  304. package/src/prover/smt/solver/lp/nla-var-eqs.ts +0 -1
  305. package/src/prover/smt/solver/lp/nra-solver.ts +122 -64
  306. package/src/prover/smt/solver/lp/numeric-pair.ts +0 -1
  307. package/src/prover/smt/solver/lp/pdd-interval.ts +6 -3
  308. package/src/prover/smt/solver/lp/pdd-simplifier.ts +60 -21
  309. package/src/prover/smt/solver/lp/pdd-solver.ts +72 -41
  310. package/src/prover/smt/solver/lp/pdd.ts +725 -289
  311. package/src/prover/smt/solver/lp/random-updater.ts +0 -2
  312. package/src/prover/smt/solver/lp/static-matrix.ts +0 -1
  313. package/src/prover/smt/solver/lp/union-find.ts +7 -2
  314. package/src/prover/smt/solver/macro-finder.ts +530 -0
  315. package/src/prover/smt/solver/mam-compiler.ts +122 -90
  316. package/src/prover/smt/solver/mam-interpreter.ts +0 -1
  317. package/src/prover/smt/solver/max-bv-sharing-tactic.ts +17 -0
  318. package/src/prover/smt/solver/max-cliques.ts +105 -0
  319. package/src/prover/smt/solver/maxcore.ts +309 -0
  320. package/src/prover/smt/solver/maximize-ac-sharing.ts +8 -6
  321. package/src/prover/smt/solver/maxlex.ts +115 -0
  322. package/src/prover/smt/solver/maxsmt-base.ts +105 -0
  323. package/src/prover/smt/solver/maxsmt.ts +92 -0
  324. package/src/prover/smt/solver/mbp/mbp-arith.ts +467 -0
  325. package/src/prover/smt/solver/mbp/mbp-basic-tg.ts +101 -0
  326. package/src/prover/smt/solver/mbp/mbp-plugin.ts +287 -0
  327. package/src/prover/smt/solver/mbp/mbp-qel.ts +48 -0
  328. package/src/prover/smt/solver/mbp/mbp-solve-plugin.ts +271 -0
  329. package/src/prover/smt/solver/mbp/mbp-term-graph.ts +606 -0
  330. package/src/prover/smt/solver/model-based-opt.ts +844 -0
  331. package/src/prover/smt/solver/model-checker.ts +18 -27
  332. package/src/prover/smt/solver/model-evaluator.ts +188 -12
  333. package/src/prover/smt/solver/model-finder.ts +12 -18
  334. package/src/prover/smt/solver/model-generator.ts +56 -29
  335. package/src/prover/smt/solver/model-macro-solver.ts +49 -46
  336. package/src/prover/smt/solver/model-printer.ts +214 -0
  337. package/src/prover/smt/solver/mpf.ts +711 -0
  338. package/src/prover/smt/solver/mus.ts +51 -0
  339. package/src/prover/smt/solver/muz/dl-context.ts +404 -0
  340. package/src/prover/smt/solver/muz/dl-mk-bit-blast.ts +97 -0
  341. package/src/prover/smt/solver/muz/dl-mk-coi-filter.ts +167 -0
  342. package/src/prover/smt/solver/muz/dl-mk-elim-term-ite.ts +125 -0
  343. package/src/prover/smt/solver/muz/dl-mk-interp-tail-simplifier.ts +299 -0
  344. package/src/prover/smt/solver/muz/dl-mk-rule-inliner.ts +455 -0
  345. package/src/prover/smt/solver/muz/dl-mk-slice.ts +340 -0
  346. package/src/prover/smt/solver/muz/dl-mk-subsumption-checker.ts +163 -0
  347. package/src/prover/smt/solver/muz/dl-rule-set.ts +273 -0
  348. package/src/prover/smt/solver/muz/dl-rule-transformer.ts +123 -0
  349. package/src/prover/smt/solver/muz/dl-rule.ts +496 -0
  350. package/src/prover/smt/solver/muz/hnf.ts +201 -0
  351. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +176 -0
  352. package/src/prover/smt/solver/muz/horn-tactic.ts +201 -0
  353. package/src/prover/smt/solver/muz/rule-properties.ts +337 -0
  354. package/src/prover/smt/solver/muz/spacer-context.ts +1406 -0
  355. package/src/prover/smt/solver/muz/spacer-dl-interface.ts +52 -0
  356. package/src/prover/smt/solver/muz/spacer-generalizers.ts +241 -0
  357. package/src/prover/smt/solver/muz/spacer-manager.ts +127 -0
  358. package/src/prover/smt/solver/muz/spacer-pdr.ts +218 -0
  359. package/src/prover/smt/solver/muz/spacer-prop-solver.ts +333 -0
  360. package/src/prover/smt/solver/muz/spacer-util.ts +282 -0
  361. package/src/prover/smt/solver/muz/substitution.ts +203 -0
  362. package/src/prover/smt/solver/nla2bv-tactic.ts +285 -0
  363. package/src/prover/smt/solver/nlqsat.ts +484 -0
  364. package/src/prover/smt/solver/nlsat/algebraic.ts +125 -12
  365. package/src/prover/smt/solver/nlsat/atoms.ts +20 -6
  366. package/src/prover/smt/solver/nlsat/evaluator.ts +0 -1
  367. package/src/prover/smt/solver/nlsat/explain.ts +63 -23
  368. package/src/prover/smt/solver/nlsat/interval-set.ts +1 -2
  369. package/src/prover/smt/solver/nlsat/levelwise.ts +3 -9
  370. package/src/prover/smt/solver/nlsat/mpbq.ts +45 -1
  371. package/src/prover/smt/solver/nlsat/polynomial.ts +13 -6
  372. package/src/prover/smt/solver/nlsat/solver.ts +236 -45
  373. package/src/prover/smt/solver/nlsat/transcendental-eval.ts +310 -0
  374. package/src/prover/smt/solver/nlsat/transcendentals.ts +367 -0
  375. package/src/prover/smt/solver/nlsat/types.ts +0 -2
  376. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -4
  377. package/src/prover/smt/solver/nlsat/upolynomial.ts +0 -2
  378. package/src/prover/smt/solver/nlsat-tactic.ts +82 -0
  379. package/src/prover/smt/solver/nnf.ts +105 -23
  380. package/src/prover/smt/solver/normalize-bounds.ts +53 -0
  381. package/src/prover/smt/solver/occf.ts +97 -0
  382. package/src/prover/smt/solver/opt-context.ts +787 -0
  383. package/src/prover/smt/solver/opt-nlsat.ts +375 -0
  384. package/src/prover/smt/solver/opt-pareto.ts +282 -0
  385. package/src/prover/smt/solver/opt-preprocess.ts +101 -0
  386. package/src/prover/smt/solver/opt-solver.ts +308 -0
  387. package/src/prover/smt/solver/opt-value.ts +55 -0
  388. package/src/prover/smt/solver/optsmt.ts +692 -0
  389. package/src/prover/smt/solver/parallel-tactic.ts +299 -0
  390. package/src/prover/smt/solver/pattern-inference.ts +19 -11
  391. package/src/prover/smt/solver/pb-rewriter.ts +284 -0
  392. package/src/prover/smt/solver/pb2bv-tactic.ts +540 -0
  393. package/src/prover/smt/solver/poly-rewriter.ts +202 -57
  394. package/src/prover/smt/solver/probes.ts +512 -0
  395. package/src/prover/smt/solver/propagate-values.ts +37 -21
  396. package/src/prover/smt/solver/proto-model.ts +648 -19
  397. package/src/prover/smt/solver/pull-quant.ts +28 -12
  398. package/src/prover/smt/solver/purify-arith.ts +632 -0
  399. package/src/prover/smt/solver/qe-arith-plugin.ts +1098 -0
  400. package/src/prover/smt/solver/qe-lite-der.ts +2 -3
  401. package/src/prover/smt/solver/qe-lite-fm.ts +3 -4
  402. package/src/prover/smt/solver/qe-lite.ts +37 -17
  403. package/src/prover/smt/solver/qe-mbp.ts +270 -0
  404. package/src/prover/smt/solver/qe.ts +1498 -0
  405. package/src/prover/smt/solver/qel.ts +25 -0
  406. package/src/prover/smt/solver/qi-queue.ts +0 -1
  407. package/src/prover/smt/solver/qsat.ts +814 -0
  408. package/src/prover/smt/solver/quant-hoist.ts +196 -0
  409. package/src/prover/smt/solver/quant-tactics.ts +16 -56
  410. package/src/prover/smt/solver/quantifier-analyzer.ts +19 -20
  411. package/src/prover/smt/solver/quantifier-manager.ts +8 -16
  412. package/src/prover/smt/solver/quasi-macros.ts +243 -0
  413. package/src/prover/smt/solver/random-gen.ts +0 -1
  414. package/src/prover/smt/solver/rational.ts +45 -1
  415. package/src/prover/smt/solver/recfun-decl-plugin.ts +261 -0
  416. package/src/prover/smt/solver/recfun-rewriter.ts +107 -0
  417. package/src/prover/smt/solver/reduce-args.ts +225 -0
  418. package/src/prover/smt/solver/reduce-bv-size.ts +119 -0
  419. package/src/prover/smt/solver/ref-vector.ts +0 -1
  420. package/src/prover/smt/solver/relevancy.ts +1 -2
  421. package/src/prover/smt/solver/rewriter-tpl.ts +77 -10
  422. package/src/prover/smt/solver/rewriter.ts +475 -36
  423. package/src/prover/smt/solver/rlimit.ts +38 -2
  424. package/src/prover/smt/solver/sat/asymm-branch.ts +325 -0
  425. package/src/prover/smt/solver/sat/big.ts +177 -0
  426. package/src/prover/smt/solver/sat/clause-use-list.ts +71 -0
  427. package/src/prover/smt/solver/sat/clause.ts +203 -0
  428. package/src/prover/smt/solver/sat/cleaner.ts +94 -0
  429. package/src/prover/smt/solver/sat/config.ts +122 -0
  430. package/src/prover/smt/solver/sat/consequences.ts +203 -0
  431. package/src/prover/smt/solver/sat/elim-eqs.ts +142 -0
  432. package/src/prover/smt/solver/sat/goal2sat.ts +526 -0
  433. package/src/prover/smt/solver/sat/inc-sat-solver.ts +378 -0
  434. package/src/prover/smt/solver/sat/model-converter.ts +136 -0
  435. package/src/prover/smt/solver/sat/pb-constraint.ts +261 -0
  436. package/src/prover/smt/solver/sat/pb-solver.ts +1577 -0
  437. package/src/prover/smt/solver/sat/probing.ts +170 -0
  438. package/src/prover/smt/solver/sat/sat-tactic.ts +43 -0
  439. package/src/prover/smt/solver/sat/sat2goal.ts +165 -0
  440. package/src/prover/smt/solver/sat/scc.ts +142 -0
  441. package/src/prover/smt/solver/sat/simplifier.ts +1618 -0
  442. package/src/prover/smt/solver/sat/solver.ts +2127 -0
  443. package/src/prover/smt/solver/sat/var-queue.ts +117 -0
  444. package/src/prover/smt/solver/sat/watch-list.ts +140 -0
  445. package/src/prover/smt/solver/search-tree.ts +284 -0
  446. package/src/prover/smt/solver/seq-axioms.ts +1010 -0
  447. package/src/prover/smt/solver/seq-decl-plugin.ts +819 -0
  448. package/src/prover/smt/solver/seq-derive.ts +1298 -0
  449. package/src/prover/smt/solver/seq-eq-approx.ts +236 -0
  450. package/src/prover/smt/solver/seq-eq-solver.ts +439 -0
  451. package/src/prover/smt/solver/seq-factory.ts +89 -0
  452. package/src/prover/smt/solver/seq-monadic.ts +728 -0
  453. package/src/prover/smt/solver/seq-range-predicate.ts +235 -0
  454. package/src/prover/smt/solver/seq-re-rewriter.ts +1170 -0
  455. package/src/prover/smt/solver/seq-re-util.ts +758 -0
  456. package/src/prover/smt/solver/seq-regex-bisim.ts +144 -0
  457. package/src/prover/smt/solver/seq-regex-live.ts +200 -0
  458. package/src/prover/smt/solver/seq-rewriter.ts +2402 -0
  459. package/src/prover/smt/solver/seq-skolem.ts +317 -0
  460. package/src/prover/smt/solver/seq-subset.ts +165 -0
  461. package/src/prover/smt/solver/seq-view-witness.ts +353 -0
  462. package/src/prover/smt/solver/smt-consequences.ts +297 -0
  463. package/src/prover/smt/solver/smt-kernel.ts +83 -0
  464. package/src/prover/smt/solver/smt-logics.ts +66 -0
  465. package/src/prover/smt/solver/smt-setup.ts +496 -0
  466. package/src/prover/smt/solver/smt2-printer.ts +765 -0
  467. package/src/prover/smt/solver/smtlib-parser.ts +3126 -316
  468. package/src/prover/smt/solver/smtlib-script.ts +1631 -0
  469. package/src/prover/smt/solver/solve-eqs.ts +929 -0
  470. package/src/prover/smt/solver/solver.ts +113 -22
  471. package/src/prover/smt/solver/static-features.ts +314 -0
  472. package/src/prover/smt/solver/sticky-generations.ts +0 -1
  473. package/src/prover/smt/solver/tactic.ts +1986 -0
  474. package/src/prover/smt/solver/term-enumeration.ts +205 -0
  475. package/src/prover/smt/solver/theory-array.ts +1240 -0
  476. package/src/prover/smt/solver/theory-bv.ts +1200 -0
  477. package/src/prover/smt/solver/theory-char.ts +355 -0
  478. package/src/prover/smt/solver/theory-datatype.ts +598 -0
  479. package/src/prover/smt/solver/theory-finite-set.ts +30 -0
  480. package/src/prover/smt/solver/theory-fpa.ts +389 -0
  481. package/src/prover/smt/solver/theory-lra-axioms.ts +53 -2
  482. package/src/prover/smt/solver/theory-lra-bounds.ts +31 -6
  483. package/src/prover/smt/solver/theory-lra-final-check.ts +56 -70
  484. package/src/prover/smt/solver/theory-lra-internalize.ts +94 -27
  485. package/src/prover/smt/solver/theory-lra-model.ts +20 -35
  486. package/src/prover/smt/solver/theory-lra-propagate.ts +24 -26
  487. package/src/prover/smt/solver/theory-lra-state.ts +6 -22
  488. package/src/prover/smt/solver/theory-lra.ts +188 -1
  489. package/src/prover/smt/solver/theory-pb.ts +934 -0
  490. package/src/prover/smt/solver/theory-polymorphism.ts +58 -0
  491. package/src/prover/smt/solver/theory-recfun.ts +307 -0
  492. package/src/prover/smt/solver/theory-seq-regex.ts +867 -0
  493. package/src/prover/smt/solver/theory-seq-solve.ts +1373 -0
  494. package/src/prover/smt/solver/theory-seq-state.ts +871 -0
  495. package/src/prover/smt/solver/theory-seq.ts +961 -0
  496. package/src/prover/smt/solver/theory.ts +189 -0
  497. package/src/prover/smt/solver/tseitin-cnf.ts +485 -0
  498. package/src/prover/smt/solver/var-subst.ts +36 -14
  499. package/src/prover/smt/table.ts +3 -2
  500. package/src/prover/smt/types.ts +146 -0
  501. package/src/prover/tlapm/cache.ts +50 -19
  502. package/src/prover/tlapm/tlapm.ts +15 -9
  503. package/src/prover/tlapm-library.ts +3208 -0
  504. package/src/prover/verdict.ts +9 -0
  505. package/src/prover/zenon/check/check.ts +1 -2
  506. package/src/prover/zenon/check/records.ts +1 -1
  507. package/src/prover/zenon/check/relations.ts +2 -1
  508. package/src/prover/zenon/check/rewrites.ts +2 -15
  509. package/src/prover/zenon/check/sets.ts +40 -58
  510. package/src/prover/zenon/check/terms.ts +1 -2
  511. package/src/prover/zenon/decide.ts +10 -7
  512. package/src/prover/zenon/encode.ts +0 -2
  513. package/src/prover/zenon/eqrel.ts +2 -2
  514. package/src/prover/zenon/equality-rules.ts +24 -2
  515. package/src/prover/zenon/expr.ts +28 -2
  516. package/src/prover/zenon/index-table.ts +11 -21
  517. package/src/prover/zenon/isar-case.ts +0 -2
  518. package/src/prover/zenon/isar.ts +35 -37
  519. package/src/prover/zenon/llproof.ts +2 -13
  520. package/src/prover/zenon/mltoll.ts +12 -30
  521. package/src/prover/zenon/node.ts +20 -5
  522. package/src/prover/zenon/parse.ts +9 -8
  523. package/src/prover/zenon/phrase.ts +0 -2
  524. package/src/prover/zenon/proof.ts +0 -2
  525. package/src/prover/zenon/propositional-rules.ts +0 -2
  526. package/src/prover/zenon/rules.ts +2 -3
  527. package/src/prover/zenon/search.ts +11 -19
  528. package/src/prover/zenon/tla/functions.ts +2 -4
  529. package/src/prover/zenon/tla/llproof.ts +9 -13
  530. package/src/prover/zenon/tla/records.ts +1 -8
  531. package/src/prover/zenon/tla/rewrites.ts +0 -2
  532. package/src/prover/zenon/tla/sets.ts +22 -22
  533. package/src/prover/zenon/tla/terms.ts +0 -2
  534. package/src/prover/zenon/tla/tla.ts +7 -8
  535. package/src/randomization.ts +1 -4
  536. package/src/resolve.ts +67 -143
  537. package/src/runtime.ts +17 -18
  538. package/src/sany/builtins.ts +1 -3
  539. package/src/sany/generation.ts +394 -0
  540. package/src/sany/generator-def-entries.ts +210 -0
  541. package/src/sany/generator-definitions.ts +686 -0
  542. package/src/sany/generator-expressions.ts +1100 -0
  543. package/src/sany/generator-proofs.ts +662 -0
  544. package/src/sany/generator.ts +160 -2683
  545. package/src/sany/levels.ts +5 -11
  546. package/src/sany/lexer.ts +57 -60
  547. package/src/sany/linter.ts +0 -3
  548. package/src/sany/nodes.ts +6 -13
  549. package/src/sany/report.ts +3 -6
  550. package/src/sany/selectors.ts +35 -38
  551. package/src/sany/xml.ts +23 -55
  552. package/src/search.ts +244 -53
  553. package/src/simulate.ts +202 -184
  554. package/src/spec-description.ts +56 -82
  555. package/src/standard-definitions.ts +4 -3
  556. package/src/standard-modules.ts +17 -44
  557. package/src/state-graph.ts +3 -17
  558. package/src/subexpressions.ts +38 -47
  559. package/src/substitution-levels.ts +5 -4
  560. package/src/successors.ts +20 -43
  561. package/src/symmetry.ts +6 -21
  562. package/src/tableau.ts +2 -2
  563. package/src/tlc/fingerprint.ts +96 -30
  564. package/src/tlc/jar-data.ts +0 -1
  565. package/src/tlc/messages.ts +22 -36
  566. package/src/tlc/order.ts +36 -50
  567. package/src/tlc/random.ts +22 -34
  568. package/src/tlc/replay.ts +21 -48
  569. package/src/tlc/summary.ts +64 -58
  570. package/src/tlc/tlc-operators.ts +6 -17
  571. package/src/tlc/tlcext-operators.ts +70 -29
  572. package/src/tlc/trace-spec.ts +26 -51
  573. package/src/tlc/value-stream.ts +9 -13
  574. package/src/tlc/version.ts +0 -1
  575. package/src/typed-tier.ts +6535 -0
  576. package/src/typescript/actions.ts +2 -4
  577. package/src/typescript/collections.ts +34 -20
  578. package/src/typescript/compile.ts +1 -3
  579. package/src/typescript/formula.ts +5 -3
  580. package/src/typescript/model.ts +4 -5
  581. package/src/typescript/steps.ts +20 -18
  582. package/src/values.ts +136 -338
  583. package/src/prover/isabelle/isar/statement.ts +0 -52
  584. package/src/prover/smt/solver/z3-license.txt +0 -10
  585. package/src/prover/tlaps-module.ts +0 -510
  586. package/src/prover/zenon/LICENSE +0 -32
@@ -0,0 +1,1240 @@
1
+ import { SmtInvariantError } from "../../../errors";
2
+ import { mkArrayApp, mkArrayDecl, mkAsArray } from "./array-decl-plugin";
3
+ import {
4
+ type AstManager,
5
+ FAMILY_ARRAY,
6
+ OP_ARRAY_DEFAULT,
7
+ OP_ARRAY_EXT,
8
+ OP_ARRAY_MAP,
9
+ OP_AS_ARRAY,
10
+ OP_CONST_ARRAY,
11
+ OP_SELECT,
12
+ OP_STORE,
13
+ SORT_BOOL,
14
+ SORT_SIZE_INFINITE,
15
+ SORT_SIZE_VERY_BIG,
16
+ } from "./ast";
17
+ import type { Context } from "./context";
18
+ import { type Enode, TheoryJustification } from "./enode";
19
+ import { FALSE_LITERAL, getVar, isNegated, type Literal, negate, TRUE_LITERAL } from "./literal";
20
+ import { UnionFind } from "./lp/union-find";
21
+ import { FuncInterp, type ProtoModel } from "./proto-model";
22
+ import {
23
+ type DependentValue,
24
+ type ExtraFreshValue,
25
+ FC_CONTINUE,
26
+ FC_DONE,
27
+ FC_GIVEUP,
28
+ Theory,
29
+ } from "./theory";
30
+
31
+ // The theory itself as the data of a fingerprint, which no expression is.
32
+ const THEORY_DATA = -1;
33
+ const EXTENSIONALITY_FINGERPRINT = 0;
34
+ const DEFAULT_MAP_FINGERPRINT = 0xffffffff - 112;
35
+ const DEFAULT_STORE_FINGERPRINT = 0xffffffff - 113;
36
+ const DEFAULT_CONST_FINGERPRINT = 0xffffffff - 115;
37
+ const LARGE_DOMAIN_SIZE = 1n << 14n;
38
+
39
+ const getDomainSizes = (manager: AstManager, array: number) =>
40
+ manager
41
+ .getSortParameters(manager.sorts[array])
42
+ .slice(0, -1)
43
+ .map((domain) => manager.getSortSize(domain));
44
+
45
+ export const hasUnitaryDomain = (manager: AstManager, array: number) =>
46
+ getDomainSizes(manager, array).every((size) => size === 1n);
47
+
48
+ export const hasLargeDomain = (manager: AstManager, array: number) => {
49
+ let size = 1n;
50
+ for (const domainSize of getDomainSizes(manager, array)) {
51
+ if (domainSize === SORT_SIZE_INFINITE || domainSize === SORT_SIZE_VERY_BIG) return true;
52
+ size *= domainSize;
53
+ if (size >= LARGE_DOMAIN_SIZE) return true;
54
+ }
55
+ return false;
56
+ };
57
+
58
+ interface Reach {
59
+ root: Enode;
60
+ parent: Reach | null;
61
+ store: Enode | null;
62
+ }
63
+
64
+ export class TheoryArray extends Theory {
65
+ readonly name = "array";
66
+ private unionFind: UnionFind;
67
+ private trail: (() => void)[] = [];
68
+ private trailLimits: number[] = [];
69
+ private stores: Enode[][] = [];
70
+ private parentSelects: Enode[][] = [];
71
+ private parentStores: Enode[][] = [];
72
+ private isPropUpward: boolean[] = [];
73
+ private consts: Enode[][] = [];
74
+ private asArrays: Enode[][] = [];
75
+ private maps: Enode[][] = [];
76
+ private parentMaps: Enode[][] = [];
77
+ private axiom1Todo: Enode[] = [];
78
+ private axiom2Todo: Enode[] = [];
79
+ private extensionalityTodo: Enode[] = [];
80
+ private sortSkolems = new Map<number, number[]>();
81
+ private sortsTrail: number[] = [];
82
+ private sortsTrailLimits: number[] = [];
83
+ private isUnsupportedOpFound = false;
84
+ private finalCheckIndex = 0;
85
+ private assignedEqs = new Set<string>();
86
+ private epsilons = new Map<number, number>();
87
+ private diags = new Map<number, number>();
88
+ private asArrayNodes: Enode[] = [];
89
+ private model: ProtoModel | undefined;
90
+ private isUnspecifiedDefault = false;
91
+ private defaults: (Enode | null)[] = [];
92
+ private elseValues: (number | ExtraFreshValue | undefined)[] = [];
93
+ private mgParents: number[] = [];
94
+ private selectSets = new Map<Enode, Map<string, Enode>>();
95
+
96
+ constructor(context: Context) {
97
+ super(context, FAMILY_ARRAY);
98
+ this.unionFind = new UnionFind(this.trail);
99
+ this.unionFind.handler = { mergeEh: (root, joining) => this.mergeEh(root, joining) };
100
+ }
101
+
102
+ private isOp(node: Enode, op: number) {
103
+ return this.manager.getOp(node.owner) === op;
104
+ }
105
+
106
+ private isArrayNode(node: Enode) {
107
+ return this.manager.isArraySort(this.manager.sorts[node.owner]);
108
+ }
109
+
110
+ private pushBack(list: Enode[], node: Enode) {
111
+ list.push(node);
112
+ this.trail.push(() => list.pop());
113
+ }
114
+
115
+ private foundUnsupportedOp() {
116
+ if (this.isUnsupportedOpFound || this.context.params.isArrayFakeSupport) return;
117
+ this.isUnsupportedOpFound = true;
118
+ this.context.pushTrail(() => {
119
+ this.isUnsupportedOpFound = false;
120
+ });
121
+ }
122
+
123
+ private mkSelect(args: number[]) {
124
+ return mkArrayApp(this.manager, OP_SELECT, args);
125
+ }
126
+
127
+ private mkDefault(array: number) {
128
+ return mkArrayApp(this.manager, OP_ARRAY_DEFAULT, [array]);
129
+ }
130
+
131
+ private mkEq(first: number, second: number): Literal {
132
+ if (first === second) return TRUE_LITERAL;
133
+ if (this.manager.areDistinct(first, second)) return FALSE_LITERAL;
134
+ const eq = this.context.mkEqAtom(first, second);
135
+ this.context.internalize(eq, true);
136
+ return this.context.getLiteral(eq);
137
+ }
138
+
139
+ private addFingerprint(data: number, dataHash: number, args: Enode[]) {
140
+ return this.context.fingerprints.insert(data, dataHash, args) !== null;
141
+ }
142
+
143
+ private getIndexArgs(node: Enode) {
144
+ const args: Enode[] = [];
145
+ for (let index = 1; index < node.numArgs; index++) args.push(node.getArg(index));
146
+ return args;
147
+ }
148
+
149
+ private registerSort(sort: number) {
150
+ if (this.sortSkolems.has(sort)) return;
151
+ const manager = this.manager;
152
+ const skolems: number[] = [];
153
+ for (let index = 0; index < manager.getArrayArity(sort); index++)
154
+ skolems.push(mkArrayDecl(manager, OP_ARRAY_EXT, [sort, sort], [index]));
155
+ this.sortSkolems.set(sort, skolems);
156
+ this.sortsTrail.push(sort);
157
+ }
158
+
159
+ private mkVar(node: Enode) {
160
+ const manager = this.manager;
161
+ const thVar = this.varEnodes.length;
162
+ this.varEnodes.push(node);
163
+ this.unionFind.mkVar();
164
+ const isStore = this.isOp(node, OP_STORE);
165
+ this.stores.push(isStore ? [node] : []);
166
+ this.parentSelects.push([]);
167
+ this.parentStores.push([]);
168
+ this.isPropUpward.push(false);
169
+ const sort = manager.sorts[node.owner];
170
+ if (manager.isArraySort(sort)) this.registerSort(sort);
171
+ this.context.attachThVar(node, this, thVar);
172
+ if (isStore) this.axiom1Todo.push(node);
173
+ this.consts.push([]);
174
+ this.asArrays.push([]);
175
+ this.maps.push([]);
176
+ this.parentMaps.push([]);
177
+ if (this.isOp(node, OP_ARRAY_MAP)) {
178
+ this.instantiateDefaultMapAxiom(node);
179
+ this.maps[thVar].push(node);
180
+ } else if (this.isOp(node, OP_CONST_ARRAY)) {
181
+ this.instantiateDefaultConstAxiom(node);
182
+ this.consts[thVar].push(node);
183
+ } else if (this.isOp(node, OP_AS_ARRAY)) this.asArrays[thVar].push(node);
184
+ return thVar;
185
+ }
186
+
187
+ private getVar(node: Enode) {
188
+ return node.getThVar(this.id);
189
+ }
190
+
191
+ private ensureVar(node: Enode) {
192
+ if (!this.isAttachedToVar(node)) this.mkVar(node);
193
+ }
194
+
195
+ private getArgNode(term: number, index: number) {
196
+ const node = this.context.getEnode(this.manager.getArg(term, index));
197
+ if (node === undefined) throw new SmtInvariantError("an argument was not internalized");
198
+ return node;
199
+ }
200
+
201
+ private internalizeTermCore(term: number) {
202
+ const context = this.context;
203
+ const manager = this.manager;
204
+ const numArgs = manager.getNumArgs(term);
205
+ for (let index = 0; index < numArgs; index++)
206
+ context.internalize(manager.getArg(term, index), false);
207
+ for (let index = 0; index < numArgs; index++) {
208
+ const arg = manager.getArg(term, index);
209
+ if (manager.isBool(arg)) context.internalize(arg, false);
210
+ }
211
+ if (context.isEInternalized(term)) return false;
212
+ for (let index = 0; index < numArgs; index++) {
213
+ const arg = manager.getArg(term, index);
214
+ if (!context.isEInternalized(arg)) context.mkEnode(arg, true, manager.isBool(arg), false);
215
+ }
216
+ const node = context.mkEnode(term, false, false, true);
217
+ this.ensureVar(node);
218
+ if (manager.sorts[term] === SORT_BOOL) context.setVarTheory(context.mkBoolVar(term), this.id);
219
+ return true;
220
+ }
221
+
222
+ internalizeAtom(atom: number) {
223
+ return this.internalizeTerm(atom);
224
+ }
225
+
226
+ internalizeTerm(term: number) {
227
+ const context = this.context;
228
+ const manager = this.manager;
229
+ if (context.isEInternalized(term)) return true;
230
+ const op = manager.getOp(term);
231
+ if (op === OP_STORE || op === OP_SELECT) {
232
+ if (!this.internalizeTermCore(term)) return true;
233
+ const array = this.getArgNode(term, 0);
234
+ this.ensureVar(array);
235
+ const node = context.getEnode(term);
236
+ if (context.relevancy.isEnabled || node === undefined) return true;
237
+ if (op === OP_SELECT) this.addParentSelect(this.getVar(array), node);
238
+ else this.addParentStore(this.getVar(array), node);
239
+ return true;
240
+ }
241
+ if (
242
+ op !== OP_CONST_ARRAY &&
243
+ op !== OP_ARRAY_DEFAULT &&
244
+ op !== OP_ARRAY_MAP &&
245
+ op !== OP_AS_ARRAY
246
+ ) {
247
+ if (op !== OP_ARRAY_EXT) this.foundUnsupportedOp();
248
+ return false;
249
+ }
250
+ if (!this.internalizeTermCore(term)) return true;
251
+ const numArgs = manager.getNumArgs(term);
252
+ if (op === OP_ARRAY_MAP)
253
+ for (let index = 0; index < numArgs; index++) this.ensureVar(this.getArgNode(term, index));
254
+ else if (op === OP_ARRAY_DEFAULT) this.ensureVar(this.getArgNode(term, 0));
255
+ const node = context.getEnode(term);
256
+ if (node === undefined) return true;
257
+ this.ensureVar(node);
258
+ if (op === OP_ARRAY_DEFAULT) this.addParentDefault(this.getVar(this.getArgNode(term, 0)));
259
+ else if (op === OP_ARRAY_MAP) {
260
+ for (let index = 0; index < numArgs; index++)
261
+ this.addParentMap(this.getVar(this.getArgNode(term, index)), node);
262
+ this.instantiateDefaultMapAxiom(node);
263
+ } else if (op === OP_CONST_ARRAY) this.instantiateDefaultConstAxiom(node);
264
+ else if (op === OP_AS_ARRAY) {
265
+ const asArrayNodes = this.asArrayNodes;
266
+ asArrayNodes.push(node);
267
+ context.pushTrail(() => asArrayNodes.pop());
268
+ }
269
+ if (!context.relevancy.isEnabled) this.relevantEh(term);
270
+ return true;
271
+ }
272
+
273
+ applySortCnstr(node: Enode) {
274
+ this.ensureVar(node);
275
+ }
276
+
277
+ newEqEh(first: number, second: number) {
278
+ this.unionFind.merge(first, second);
279
+ }
280
+
281
+ newDiseqEh(inputFirst: number, inputSecond: number) {
282
+ const first = this.unionFind.find(inputFirst);
283
+ const second = this.unionFind.find(inputSecond);
284
+ if (this.isArrayNode(this.getEnode(first)))
285
+ this.assertExtensionality(this.getEnode(first), this.getEnode(second));
286
+ }
287
+
288
+ private mergeEh(first: number, second: number) {
289
+ if (!this.isPropUpward[first] && this.isPropUpward[second]) this.setPropUpwardVar(first);
290
+ const stores = this.stores[second];
291
+ for (let index = 0; index < stores.length; index++) this.addStore(first, stores[index]);
292
+ const parentStores = this.parentStores[second];
293
+ for (let index = 0; index < parentStores.length; index++)
294
+ this.addParentStore(first, parentStores[index]);
295
+ const parentSelects = this.parentSelects[second];
296
+ for (let index = 0; index < parentSelects.length; index++)
297
+ this.addParentSelect(first, parentSelects[index]);
298
+ const maps = this.maps[second];
299
+ for (let index = 0; index < maps.length; index++) this.addMap(first, maps[index]);
300
+ const parentMaps = this.parentMaps[second];
301
+ for (let index = 0; index < parentMaps.length; index++)
302
+ this.addParentMap(first, parentMaps[index]);
303
+ const consts = this.consts[second];
304
+ for (let index = 0; index < consts.length; index++) this.addConst(first, consts[index]);
305
+ const asArrays = this.asArrays[second];
306
+ for (let index = 0; index < asArrays.length; index++) this.addAsArray(first, asArrays[index]);
307
+ }
308
+
309
+ private addParentSelect(inputVar: number, select: Enode) {
310
+ const thVar = this.unionFind.find(inputVar);
311
+ this.pushBack(this.parentSelects[thVar], select);
312
+ const stores = this.stores[thVar];
313
+ for (let index = 0; index < stores.length; index++)
314
+ this.assertStoreAxiom2(stores[index], select);
315
+ const consts = this.consts[thVar];
316
+ for (let index = 0; index < consts.length; index++)
317
+ this.instantiateSelectConstAxiom(select, consts[index]);
318
+ const maps = this.maps[thVar];
319
+ for (let index = 0; index < maps.length; index++)
320
+ this.instantiateSelectMapAxiom(select, maps[index]);
321
+ }
322
+
323
+ private addParentStore(inputVar: number, store: Enode) {
324
+ this.pushBack(this.parentStores[this.unionFind.find(inputVar)], store);
325
+ }
326
+
327
+ private addStore(inputVar: number, store: Enode) {
328
+ const thVar = this.unionFind.find(inputVar);
329
+ this.setPropUpwardStores(thVar);
330
+ this.pushBack(this.stores[thVar], store);
331
+ const parentSelects = this.parentSelects[thVar];
332
+ for (let index = 0; index < parentSelects.length; index++)
333
+ this.assertStoreAxiom2(store, parentSelects[index]);
334
+ this.setPropUpwardNode(store);
335
+ }
336
+
337
+ private addMap(inputVar: number, map: Enode) {
338
+ const thVar = this.unionFind.find(inputVar);
339
+ this.setPropUpwardStores(thVar);
340
+ this.pushBack(this.maps[thVar], map);
341
+ const parentSelects = this.parentSelects[thVar];
342
+ for (let index = 0; index < parentSelects.length; index++)
343
+ this.instantiateSelectMapAxiom(parentSelects[index], map);
344
+ this.setPropUpwardNode(map);
345
+ }
346
+
347
+ private addParentMap(inputVar: number, map: Enode) {
348
+ this.pushBack(this.parentMaps[this.unionFind.find(inputVar)], map);
349
+ }
350
+
351
+ // add_const and add_as_array take the variable as it is, the root that merge_eh passes.
352
+ private addConst(thVar: number, constArray: Enode) {
353
+ this.setPropUpwardStores(thVar);
354
+ this.pushBack(this.consts[thVar], constArray);
355
+ this.instantiateDefaultConstAxiom(constArray);
356
+ const parentSelects = this.parentSelects[thVar];
357
+ for (let index = 0; index < parentSelects.length; index++)
358
+ this.instantiateSelectConstAxiom(parentSelects[index], constArray);
359
+ }
360
+
361
+ private addAsArray(thVar: number, asArray: Enode) {
362
+ this.setPropUpwardStores(thVar);
363
+ this.pushBack(this.asArrays[thVar], asArray);
364
+ const parentSelects = this.parentSelects[thVar];
365
+ for (let index = 0; index < parentSelects.length; index++)
366
+ this.instantiateSelectAsArrayAxiom(parentSelects[index], asArray);
367
+ }
368
+
369
+ private addParentDefault(inputVar: number) {
370
+ const stores = this.stores[this.unionFind.find(inputVar)];
371
+ for (let index = 0; index < stores.length; index++)
372
+ if (this.isOp(stores[index], OP_STORE)) this.instantiateDefaultStoreAxiom(stores[index]);
373
+ }
374
+
375
+ private setPropUpwardVar(inputVar: number) {
376
+ const thVar = this.unionFind.find(inputVar);
377
+ if (this.isPropUpward[thVar]) return;
378
+ this.isPropUpward[thVar] = true;
379
+ this.trail.push(() => {
380
+ this.isPropUpward[thVar] = false;
381
+ });
382
+ for (const node of this.stores[thVar]) this.setPropUpwardNode(node);
383
+ for (const node of this.maps[thVar]) this.setPropUpwardNode(node);
384
+ for (const node of this.consts[thVar]) this.setPropUpwardNode(node);
385
+ }
386
+
387
+ private setPropUpwardNode(node: Enode) {
388
+ if (this.isOp(node, OP_STORE)) this.setPropUpwardVar(this.getVar(node.getArg(0)));
389
+ else if (this.isOp(node, OP_ARRAY_MAP))
390
+ for (let index = 0; index < node.numArgs; index++)
391
+ this.setPropUpwardVar(this.getVar(node.getArg(index)));
392
+ }
393
+
394
+ private setPropUpwardStores(thVar: number) {
395
+ for (const node of this.stores[thVar]) this.setPropUpwardNode(node);
396
+ }
397
+
398
+ relevantEh(expr: number) {
399
+ const context = this.context;
400
+ const manager = this.manager;
401
+ const op = manager.getOp(expr);
402
+ if (context.relevancy.isEnabled && (op === OP_STORE || op === OP_SELECT)) {
403
+ if (!context.isEInternalized(expr)) context.internalize(expr, false);
404
+ const node = context.getEnode(expr);
405
+ const array = this.getArgNode(expr, 0);
406
+ if (node !== undefined && op === OP_SELECT) this.addParentSelect(this.getVar(array), node);
407
+ else if (node !== undefined) this.addParentStore(this.getVar(array), node);
408
+ }
409
+ if (
410
+ op !== OP_ARRAY_DEFAULT &&
411
+ op !== OP_SELECT &&
412
+ op !== OP_ARRAY_MAP &&
413
+ op !== OP_CONST_ARRAY &&
414
+ op !== OP_AS_ARRAY
415
+ )
416
+ return;
417
+ if (!context.isEInternalized(expr)) context.internalize(expr, false);
418
+ const node = context.getEnode(expr);
419
+ if (node === undefined) return;
420
+ if (op === OP_SELECT)
421
+ this.addParentSelect(this.unionFind.find(this.getVar(this.getArgNode(expr, 0))), node);
422
+ else if (op === OP_ARRAY_DEFAULT) {
423
+ const thVar = this.getVar(this.getArgNode(expr, 0));
424
+ this.setPropUpwardVar(thVar);
425
+ this.addParentDefault(this.unionFind.find(thVar));
426
+ } else if (op === OP_CONST_ARRAY) {
427
+ this.instantiateDefaultConstAxiom(node);
428
+ const thVar = this.getVar(node);
429
+ this.setPropUpwardVar(thVar);
430
+ this.addParentDefault(this.unionFind.find(thVar));
431
+ } else if (op === OP_ARRAY_MAP) {
432
+ for (let index = 0; index < node.numArgs; index++) {
433
+ const thVar = this.unionFind.find(this.getVar(node.getArg(index)));
434
+ this.addParentMap(thVar, node);
435
+ this.setPropUpwardVar(thVar);
436
+ }
437
+ this.instantiateDefaultMapAxiom(node);
438
+ }
439
+ }
440
+
441
+ private assertStoreAxiom2(store: Enode, select: Enode) {
442
+ if (this.isOp(store, OP_STORE)) {
443
+ let index = 1;
444
+ while (index < select.numArgs && store.getArg(index).root === select.getArg(index).root)
445
+ index++;
446
+ if (index === select.numArgs) return false;
447
+ }
448
+ if (!this.addFingerprint(store.owner, this.manager.ids[store.owner], this.getIndexArgs(select)))
449
+ return false;
450
+ this.axiom2Todo.push(store, select);
451
+ return true;
452
+ }
453
+
454
+ private assertStoreAxiom1Core(store: Enode) {
455
+ const context = this.context;
456
+ const manager = this.manager;
457
+ const args = manager.getArgs(store.owner);
458
+ const select = this.mkSelect([store.owner, ...args.slice(1, -1)]);
459
+ context.internalize(select, false);
460
+ const selectNode = context.getEnode(select);
461
+ const valueNode = context.getEnode(args[args.length - 1]);
462
+ if (selectNode === undefined || valueNode === undefined) return;
463
+ context.pushEq(selectNode, valueNode, { kind: "axiom" });
464
+ context.markAsRelevant(select);
465
+ }
466
+
467
+ private assertStoreAxiom2Core(store: Enode, select: Enode) {
468
+ const context = this.context;
469
+ const manager = this.manager;
470
+ const indices = this.getIndexArgs(select).map((node) => node.owner);
471
+ let conseq: Literal | undefined;
472
+ for (let index = 0; index < indices.length; index++) {
473
+ const storeIndex = store.getArg(index + 1);
474
+ const selectIndex = select.getArg(index + 1);
475
+ if (storeIndex.root === selectIndex.root) continue;
476
+ if (conseq === undefined) {
477
+ const first = this.mkSelect([store.owner, ...indices]);
478
+ const second = this.mkSelect([store.getArg(0).owner, ...indices]);
479
+ if (first === second) break;
480
+ conseq = this.mkEq(first, second);
481
+ }
482
+ if (manager.areDistinct(storeIndex.owner, selectIndex.owner)) {
483
+ context.markLiteralAsRelevant(conseq);
484
+ context.mkThAxiom([conseq]);
485
+ continue;
486
+ }
487
+ const ante = this.mkEq(storeIndex.owner, selectIndex.owner);
488
+ context.markLiteralAsRelevant(ante);
489
+ const target = context.boolVar2Expr[getVar(conseq)];
490
+ context.relevancy.addWatch(context.boolVar2Expr[getVar(ante)], isNegated(ante), () =>
491
+ context.relevancy.markAsRelevant(target),
492
+ );
493
+ context.mkThAxiom([ante, conseq]);
494
+ }
495
+ }
496
+
497
+ private assertExtensionality(inputFirst: Enode, inputSecond: Enode) {
498
+ const ids = this.manager.ids;
499
+ const isSwapped = ids[inputFirst.owner] > ids[inputSecond.owner];
500
+ const first = isSwapped ? inputSecond : inputFirst;
501
+ const second = isSwapped ? inputFirst : inputSecond;
502
+ if (!this.addFingerprint(THEORY_DATA, EXTENSIONALITY_FINGERPRINT, [first, second])) return;
503
+ if (this.isAlreadyDiseq(first, second)) return;
504
+ this.extensionalityTodo.push(first, second);
505
+ }
506
+
507
+ private getSelectKey(select: Enode) {
508
+ let key = "";
509
+ for (let index = 1; index < select.numArgs; index++)
510
+ key += `${select.getArg(index).root.owner},`;
511
+ return key;
512
+ }
513
+
514
+ private isRelevantSelectOf(parent: Enode, root: Enode) {
515
+ return (
516
+ parent.isCgr() &&
517
+ this.context.isRelevant(parent.owner) &&
518
+ this.isOp(parent, OP_SELECT) &&
519
+ parent.getArg(0).root === root
520
+ );
521
+ }
522
+
523
+ private isAlreadyDiseq(first: Enode, second: Enode) {
524
+ const isSwapped = first.root.classSize > second.root.classSize;
525
+ const smaller = isSwapped ? second.root : first.root;
526
+ const larger = isSwapped ? first.root : second.root;
527
+ const values = new Map<string, Enode>();
528
+ for (const parent of smaller.parents)
529
+ if (this.isRelevantSelectOf(parent, smaller)) values.set(this.getSelectKey(parent), parent);
530
+ for (const parent of larger.parents) {
531
+ if (!this.isRelevantSelectOf(parent, larger)) continue;
532
+ const other = values.get(this.getSelectKey(parent));
533
+ if (other !== undefined && this.context.isDiseq(parent, other, false)) return true;
534
+ }
535
+ return false;
536
+ }
537
+
538
+ private assertExtensionalityCore(first: Enode, second: Enode) {
539
+ const context = this.context;
540
+ const manager = this.manager;
541
+ const skolems = this.sortSkolems.get(manager.sorts[first.owner]);
542
+ if (skolems === undefined) throw new SmtInvariantError("the array sort was not registered");
543
+ const witnesses = skolems.map((skolem) =>
544
+ manager.mkApp(skolem, [first.owner, second.owner], manager.funcDecls[skolem].range),
545
+ );
546
+ const firstSelect = this.mkSelect([first.owner, ...witnesses]);
547
+ const secondSelect = this.mkSelect([second.owner, ...witnesses]);
548
+ const arraysEq = this.mkEq(first.owner, second.owner);
549
+ const selectsEq = this.mkEq(firstSelect, secondSelect);
550
+ context.markLiteralAsRelevant(arraysEq);
551
+ context.markLiteralAsRelevant(selectsEq);
552
+ context.mkThAxiom([arraysEq, negate(selectsEq)]);
553
+ }
554
+
555
+ canPropagate() {
556
+ return (
557
+ this.axiom1Todo.length > 0 || this.axiom2Todo.length > 0 || this.extensionalityTodo.length > 0
558
+ );
559
+ }
560
+
561
+ propagate() {
562
+ while (this.canPropagate()) {
563
+ for (let index = 0; index < this.axiom1Todo.length; index++)
564
+ this.assertStoreAxiom1Core(this.axiom1Todo[index]);
565
+ this.axiom1Todo.length = 0;
566
+ for (let index = 0; index < this.axiom2Todo.length; index += 2)
567
+ this.assertStoreAxiom2Core(this.axiom2Todo[index], this.axiom2Todo[index + 1]);
568
+ this.axiom2Todo.length = 0;
569
+ for (let index = 0; index < this.extensionalityTodo.length; index += 2)
570
+ this.assertExtensionalityCore(
571
+ this.extensionalityTodo[index],
572
+ this.extensionalityTodo[index + 1],
573
+ );
574
+ this.extensionalityTodo.length = 0;
575
+ }
576
+ }
577
+
578
+ isShared(thVar: number) {
579
+ const root = this.getEnode(thVar).root;
580
+ let isArray = false;
581
+ let isIndex = false;
582
+ let isValue = false;
583
+ let numRoles = 0;
584
+ const setArray = (arg: Enode) => {
585
+ if (arg.root === root && !isArray) {
586
+ isArray = true;
587
+ numRoles++;
588
+ }
589
+ return numRoles > 1;
590
+ };
591
+ const setIndex = (arg: Enode) => {
592
+ if (arg.root === root && !isIndex) {
593
+ isIndex = true;
594
+ numRoles++;
595
+ }
596
+ return numRoles > 1;
597
+ };
598
+ const setValue = (arg: Enode) => {
599
+ if (arg.root === root && !isValue) {
600
+ isValue = true;
601
+ numRoles++;
602
+ }
603
+ return numRoles > 1;
604
+ };
605
+ for (const parent of root.parents) {
606
+ const numArgs = parent.numArgs;
607
+ if (this.isOp(parent, OP_STORE)) {
608
+ if (setArray(parent.getArg(0))) return true;
609
+ for (let index = 1; index < numArgs - 1; index++)
610
+ if (setIndex(parent.getArg(index))) return true;
611
+ if (setValue(parent.getArg(numArgs - 1))) return true;
612
+ } else if (this.isOp(parent, OP_SELECT)) {
613
+ if (setArray(parent.getArg(0))) return true;
614
+ for (let index = 1; index < numArgs; index++)
615
+ if (setIndex(parent.getArg(index))) return true;
616
+ } else if (this.isOp(parent, OP_CONST_ARRAY) && setValue(parent.getArg(0))) return true;
617
+ }
618
+ return false;
619
+ }
620
+
621
+ isBetaRedex(parent: Enode, node: Enode) {
622
+ if (this.isOp(parent, OP_SELECT)) return parent.getArg(0).root === node.root;
623
+ return this.isOp(parent, OP_ARRAY_MAP) || this.isOp(parent, OP_STORE);
624
+ }
625
+
626
+ private isSelectArg(root: Enode) {
627
+ for (const parent of root.parents)
628
+ if (this.isOp(parent, OP_SELECT))
629
+ for (let index = 1; index < parent.numArgs; index++)
630
+ if (root === parent.getArg(index).root) return true;
631
+ return false;
632
+ }
633
+
634
+ private collectSharedVars() {
635
+ const context = this.context;
636
+ const result: number[] = [];
637
+ const marked: Enode[] = [];
638
+ for (let thVar = 0; thVar < this.getNumVars(); thVar++) {
639
+ const node = this.getEnode(thVar);
640
+ if (!context.isRelevant(node.owner) || !this.isArrayNode(node)) continue;
641
+ const root = node.root;
642
+ if (root.isMarked) continue;
643
+ if (context.isShared(root) || this.isSelectArg(root)) result.push(this.getVar(root));
644
+ root.isMarked = true;
645
+ marked.push(root);
646
+ }
647
+ for (const node of marked) node.isMarked = false;
648
+ return result;
649
+ }
650
+
651
+ private mkInterfaceEqs() {
652
+ const context = this.context;
653
+ const manager = this.manager;
654
+ const roots = this.collectSharedVars();
655
+ let result = 0;
656
+ for (let index = 0; index < roots.length; index++) {
657
+ const first = this.getEnode(roots[index]);
658
+ for (let other = index + 1; other < roots.length; other++) {
659
+ const second = this.getEnode(roots[other]);
660
+ if (manager.sorts[first.owner] !== manager.sorts[second.owner]) continue;
661
+ if (context.isDiseq(first, second)) continue;
662
+ const eq = context.mkEqAtom(first.owner, second.owner);
663
+ if (context.isBInternalized(eq) && context.isRelevant(eq)) continue;
664
+ result++;
665
+ context.internalize(eq, true);
666
+ context.markAsRelevant(eq);
667
+ }
668
+ }
669
+ return result;
670
+ }
671
+
672
+ initSearchEh() {
673
+ this.finalCheckIndex = 0;
674
+ }
675
+
676
+ finalCheckEh() {
677
+ this.finalCheckIndex++;
678
+ const delayed = this.finalCheckIndex % 2 === 1 ? this.assertDelayedAxioms() : FC_DONE;
679
+ const result =
680
+ delayed !== FC_DONE
681
+ ? delayed
682
+ : this.mkInterfaceEqs() > 0
683
+ ? FC_CONTINUE
684
+ : this.finalCheckIndex % 2 === 1
685
+ ? FC_DONE
686
+ : this.assertDelayedAxioms();
687
+ return result === FC_DONE && this.isUnsupportedOpFound ? FC_GIVEUP : result;
688
+ }
689
+
690
+ private instantiateAxiom2bFor(thVar: number) {
691
+ let result = false;
692
+ for (const store of this.parentStores[thVar])
693
+ for (const select of this.parentSelects[thVar])
694
+ if (this.assertStoreAxiom2(store, select)) result = true;
695
+ return result;
696
+ }
697
+
698
+ private instantiateAxiomMapFor(thVar: number) {
699
+ let result = false;
700
+ for (const map of this.parentMaps[thVar])
701
+ for (const select of this.parentSelects[thVar])
702
+ if (this.instantiateSelectMapAxiom(select, map)) result = true;
703
+ return result;
704
+ }
705
+
706
+ private instantiateParentStoresDefault(inputVar: number) {
707
+ let result = false;
708
+ for (const store of this.parentStores[this.unionFind.find(inputVar)])
709
+ if (this.instantiateDefaultStoreAxiom(store)) result = true;
710
+ return result;
711
+ }
712
+
713
+ private assertDelayedAxioms() {
714
+ let result = FC_DONE;
715
+ for (let thVar = 0; thVar < this.getNumVars(); thVar++)
716
+ if (this.isPropUpward[thVar] && this.instantiateAxiom2bFor(thVar)) result = FC_CONTINUE;
717
+ for (let thVar = 0; thVar < this.getNumVars(); thVar++) {
718
+ if (!this.isPropUpward[thVar]) continue;
719
+ if (this.instantiateAxiomMapFor(thVar)) result = FC_CONTINUE;
720
+ if (this.instantiateParentStoresDefault(thVar)) result = FC_CONTINUE;
721
+ }
722
+ if (result === FC_DONE) {
723
+ const constArrays = this.checkConstArrays();
724
+ if (constArrays < 0) result = FC_CONTINUE;
725
+ else if (constArrays === 0) result = FC_GIVEUP;
726
+ }
727
+ if (result === FC_DONE && this.canPropagate()) result = FC_CONTINUE;
728
+ if (result === FC_DONE && (this.isUnsupportedOpFound || this.hasNonBetaAsArray()))
729
+ result = FC_GIVEUP;
730
+ return result;
731
+ }
732
+
733
+ private hasNonBetaAsArray() {
734
+ const context = this.context;
735
+ const manager = this.manager;
736
+ if (context.params.isArrayFakeSupport) return false;
737
+ for (const node of this.asArrayNodes)
738
+ for (const parent of node.parents)
739
+ if (
740
+ context.isRelevant(parent.owner) &&
741
+ !context.getTheory(manager.getFamily(parent.owner))?.isBetaRedex(parent, node)
742
+ )
743
+ return true;
744
+ return false;
745
+ }
746
+
747
+ private tryAssignEq(first: number, second: number) {
748
+ const key = `${first}:${second}`;
749
+ if (this.assignedEqs.has(key)) return false;
750
+ this.assignedEqs.add(key);
751
+ const eq = this.mkEq(first, second);
752
+ this.context.markLiteralAsRelevant(eq);
753
+ this.context.mkThAxiom([eq]);
754
+ return true;
755
+ }
756
+
757
+ private mkMappedApp(map: Enode, args: number[]) {
758
+ const manager = this.manager;
759
+ const decl = manager.funcDecls[map.decl].parameters[0];
760
+ const app = manager.mkApp(decl, args, manager.getArrayRange(manager.sorts[map.owner]));
761
+ manager.incRef(app);
762
+ const rewritten = this.context.rewriter.rewrite(app);
763
+ manager.decRef(app);
764
+ return rewritten;
765
+ }
766
+
767
+ private instantiateSelectMapAxiom(select: Enode, map: Enode) {
768
+ const context = this.context;
769
+ const manager = this.manager;
770
+ if (!this.addFingerprint(map.owner, manager.ids[map.owner], this.getIndexArgs(select)))
771
+ return false;
772
+ const indices = this.getIndexArgs(select).map((node) => node.owner);
773
+ const selects = manager.mapArgs(map.owner, (arg) => this.mkSelect([arg, ...indices]));
774
+ const mapSelect = this.mkSelect([map.owner, ...indices]);
775
+ const applied = this.mkMappedApp(map, selects);
776
+ context.internalize(mapSelect, false);
777
+ context.internalize(applied, false);
778
+ const result = this.tryAssignEq(mapSelect, applied);
779
+ manager.decRef(applied);
780
+ return result;
781
+ }
782
+
783
+ private instantiateDefaultMapAxiom(map: Enode) {
784
+ const context = this.context;
785
+ const manager = this.manager;
786
+ if (!this.addFingerprint(THEORY_DATA, DEFAULT_MAP_FINGERPRINT, [map])) return false;
787
+ const applied = this.mkMappedApp(
788
+ map,
789
+ manager.mapArgs(map.owner, (arg) => this.mkDefault(arg)),
790
+ );
791
+ const mapDefault = this.mkDefault(map.owner);
792
+ context.internalize(mapDefault, false);
793
+ context.internalize(applied, false);
794
+ const result = this.tryAssignEq(mapDefault, applied);
795
+ manager.decRef(applied);
796
+ return result;
797
+ }
798
+
799
+ private instantiateDefaultConstAxiom(constArray: Enode) {
800
+ if (!this.addFingerprint(THEORY_DATA, DEFAULT_CONST_FINGERPRINT, [constArray])) return false;
801
+ const constDefault = this.mkDefault(constArray.owner);
802
+ this.context.internalize(constDefault, false);
803
+ return this.tryAssignEq(constArray.getArg(0).owner, constDefault);
804
+ }
805
+
806
+ private instantiateSelectConstAxiom(select: Enode, constArray: Enode) {
807
+ const manager = this.manager;
808
+ const indices = this.getIndexArgs(select);
809
+ if (!this.addFingerprint(constArray.owner, manager.ids[constArray.owner], indices))
810
+ return false;
811
+ const constSelect = this.mkSelect([constArray.owner, ...indices.map((node) => node.owner)]);
812
+ this.context.internalize(constSelect, false);
813
+ return this.tryAssignEq(constSelect, constArray.getArg(0).owner);
814
+ }
815
+
816
+ private instantiateSelectAsArrayAxiom(select: Enode, asArray: Enode) {
817
+ const context = this.context;
818
+ const manager = this.manager;
819
+ const indices = this.getIndexArgs(select);
820
+ if (!this.addFingerprint(asArray.owner, manager.ids[asArray.owner], indices)) return false;
821
+ const indexExprs = indices.map((node) => node.owner);
822
+ const asArraySelect = this.mkSelect([asArray.owner, ...indexExprs]);
823
+ const decl = manager.funcDecls[manager.decls[asArray.owner]].parameters[0];
824
+ const value = manager.mkApp(decl, indexExprs, manager.funcDecls[decl].range);
825
+ context.internalize(asArraySelect, false);
826
+ context.internalize(value, false);
827
+ return this.tryAssignEq(asArraySelect, value);
828
+ }
829
+
830
+ private mkEpsilon(sort: number) {
831
+ const manager = this.manager;
832
+ let epsilon = this.epsilons.get(sort);
833
+ if (epsilon === undefined) {
834
+ const created = manager.mkFreshConst("epsilon", sort);
835
+ manager.incRef(created);
836
+ this.epsilons.set(sort, created);
837
+ this.trail.push(() => {
838
+ this.epsilons.delete(sort);
839
+ manager.decRef(created);
840
+ });
841
+ epsilon = created;
842
+ }
843
+ let diag = this.diags.get(sort);
844
+ if (diag === undefined) {
845
+ const created = manager.mkFreshFuncDecl("diag", [sort], sort);
846
+ manager.incDeclRef(created);
847
+ this.diags.set(sort, created);
848
+ this.trail.push(() => {
849
+ this.diags.delete(sort);
850
+ manager.decDeclRef(created);
851
+ });
852
+ diag = created;
853
+ }
854
+ return { epsilon, diag };
855
+ }
856
+
857
+ private instantiateDefaultStoreAxiom(store: Enode) {
858
+ const context = this.context;
859
+ const manager = this.manager;
860
+ const args: Enode[] = [];
861
+ for (let index = 0; index < store.numArgs; index++) args.push(store.getArg(index));
862
+ if (!this.addFingerprint(THEORY_DATA, DEFAULT_STORE_FINGERPRINT, args)) return false;
863
+ const storeExpr = store.owner;
864
+ const array = store.getArg(0).owner;
865
+ const storeDefault = this.mkDefault(storeExpr);
866
+ const arrayDefault = hasUnitaryDomain(manager, storeExpr)
867
+ ? store.getArg(store.numArgs - 1).owner
868
+ : this.mkDefault(array);
869
+ if (!hasUnitaryDomain(manager, storeExpr) && !hasLargeDomain(manager, storeExpr)) {
870
+ const epsilons: number[] = [];
871
+ const diagonals: number[] = [];
872
+ for (let index = 1; index + 1 < store.numArgs; index++) {
873
+ const arg = store.getArg(index).owner;
874
+ const sort = manager.sorts[arg];
875
+ const epsilon = this.mkEpsilon(sort);
876
+ epsilons.push(epsilon.epsilon);
877
+ diagonals.push(manager.mkApp(epsilon.diag, [arg], sort));
878
+ }
879
+ const storeSelect = this.mkSelect([storeExpr, ...epsilons]);
880
+ const arraySelect = this.mkSelect([array, ...epsilons]);
881
+ context.internalize(storeDefault, false);
882
+ context.internalize(arrayDefault, false);
883
+ const isNew =
884
+ this.tryAssignEq(storeDefault, storeSelect) || this.tryAssignEq(arrayDefault, arraySelect);
885
+ const storeDiagonal = this.mkSelect([storeExpr, ...diagonals]);
886
+ const arrayDiagonal = this.mkSelect([array, ...diagonals]);
887
+ return this.tryAssignEq(storeDiagonal, arrayDiagonal) || isNew;
888
+ }
889
+ context.internalize(storeDefault, false);
890
+ context.internalize(arrayDefault, false);
891
+ return this.tryAssignEq(storeDefault, arrayDefault);
892
+ }
893
+
894
+ private getReachable(constArray: Enode) {
895
+ const context = this.context;
896
+ const initial: Reach = { root: constArray.root, parent: null, store: null };
897
+ const result = [initial];
898
+ const visited = new Set([constArray.root]);
899
+ for (let qhead = 0; qhead < result.length; qhead++) {
900
+ const current = result[qhead];
901
+ const thVar = this.getVar(current.root);
902
+ if (thVar < 0) continue;
903
+ for (const store of this.parentStores[this.unionFind.find(thVar)]) {
904
+ if (
905
+ !this.isOp(store, OP_STORE) ||
906
+ !context.isRelevant(store.owner) ||
907
+ store.getArg(0).root !== current.root
908
+ )
909
+ continue;
910
+ if (visited.has(store.root)) continue;
911
+ visited.add(store.root);
912
+ result.push({ root: store.root, parent: current, store });
913
+ }
914
+ }
915
+ return result;
916
+ }
917
+
918
+ private isSameIndex(first: Enode, second: Enode) {
919
+ if (first.numArgs !== second.numArgs) return false;
920
+ for (let index = 1; index + 1 < first.numArgs; index++)
921
+ if (first.getArg(index).root !== second.getArg(index).root) return false;
922
+ return true;
923
+ }
924
+
925
+ private addIndices(inputPath: Reach, indices: Enode[], eqs: Enode[]) {
926
+ for (let path = inputPath; path.store !== null && path.parent !== null; path = path.parent) {
927
+ const store = path.store;
928
+ const old = indices.find((index) => this.isSameIndex(store, index));
929
+ if (old === undefined) {
930
+ indices.push(store);
931
+ continue;
932
+ }
933
+ for (let index = 1; index + 1 < store.numArgs; index++)
934
+ if (store.getArg(index) !== old.getArg(index))
935
+ eqs.push(store.getArg(index), old.getArg(index));
936
+ }
937
+ }
938
+
939
+ private addPathEqs(constArray: Enode, inputPath: Reach, eqs: Enode[]) {
940
+ let initial = inputPath;
941
+ while (initial.parent !== null) initial = initial.parent;
942
+ if (constArray !== initial.root) eqs.push(constArray, initial.root);
943
+ for (let path = inputPath; path.store !== null && path.parent !== null; path = path.parent) {
944
+ if (path.store.getArg(0) !== path.parent.root)
945
+ eqs.push(path.store.getArg(0), path.parent.root);
946
+ if (path.store !== path.root) eqs.push(path.store, path.root);
947
+ }
948
+ }
949
+
950
+ private internalizeConstSelect(constArray: Enode, indices: number[]) {
951
+ const context = this.context;
952
+ const select = this.mkSelect([constArray.owner, ...indices]);
953
+ let isNew = !context.isEInternalized(select);
954
+ context.internalize(select, false);
955
+ if (!context.isRelevant(select)) {
956
+ context.markAsRelevant(select);
957
+ isNew = true;
958
+ }
959
+ return isNew;
960
+ }
961
+
962
+ // l_false as -1, l_undef as 0 and l_true as 1.
963
+ private checkConstArrays() {
964
+ const context = this.context;
965
+ const manager = this.manager;
966
+ const constArrays: Enode[] = [];
967
+ const seen = new Set<Enode>();
968
+ for (let thVar = 0; thVar < this.getNumVars(); thVar++)
969
+ for (const constArray of this.consts[thVar])
970
+ if (!seen.has(constArray.root) && context.isRelevant(constArray.owner)) {
971
+ seen.add(constArray.root);
972
+ constArrays.push(constArray);
973
+ }
974
+ if (constArrays.length < 2) return 1;
975
+ const reachables = constArrays.map((constArray) => this.getReachable(constArray));
976
+ let hasUninterpreted = false;
977
+ for (let first = 0; first < constArrays.length; first++) {
978
+ const firstValue = constArrays[first].getArg(0);
979
+ for (let second = first + 1; second < constArrays.length; second++) {
980
+ const secondValue = constArrays[second].getArg(0);
981
+ if (firstValue.root === secondValue.root) continue;
982
+ let firstPath: Reach | undefined;
983
+ let secondPath: Reach | undefined;
984
+ for (const firstReach of reachables[first]) {
985
+ secondPath = reachables[second].find((reach) => reach.root === firstReach.root);
986
+ if (secondPath !== undefined) {
987
+ firstPath = firstReach;
988
+ break;
989
+ }
990
+ }
991
+ if (firstPath === undefined || secondPath === undefined) continue;
992
+ const indices: Enode[] = [];
993
+ const eqs: Enode[] = [];
994
+ this.addIndices(firstPath, indices, eqs);
995
+ this.addIndices(secondPath, indices, eqs);
996
+ const sort = manager.sorts[constArrays[first].owner];
997
+ const numIndices = BigInt(indices.length);
998
+ let isDomainExceedingIndices = false;
999
+ let domainSize = 1n;
1000
+ let hasUninterp = false;
1001
+ for (const domain of manager.getSortParameters(sort).slice(0, -1)) {
1002
+ if (manager.isUninterpretedSort(domain)) {
1003
+ hasUninterp = true;
1004
+ continue;
1005
+ }
1006
+ const size = manager.getSortSize(domain);
1007
+ if (size < 0n || size > numIndices || domainSize > numIndices / size) {
1008
+ isDomainExceedingIndices = true;
1009
+ break;
1010
+ }
1011
+ domainSize *= size;
1012
+ }
1013
+ if (isDomainExceedingIndices || domainSize > numIndices) {
1014
+ this.addPathEqs(constArrays[first], firstPath, eqs);
1015
+ this.addPathEqs(constArrays[second], secondPath, eqs);
1016
+ const justification = new TheoryJustification(this.id, [], eqs);
1017
+ context.pushEq(firstValue, secondValue, { kind: "justification", justification });
1018
+ return -1;
1019
+ }
1020
+ let isNew = false;
1021
+ for (const store of indices) {
1022
+ const storeIndices: number[] = [];
1023
+ for (let index = 1; index + 1 < store.numArgs; index++)
1024
+ storeIndices.push(store.getArg(index).owner);
1025
+ isNew = this.internalizeConstSelect(constArrays[first], storeIndices) || isNew;
1026
+ isNew = this.internalizeConstSelect(constArrays[second], storeIndices) || isNew;
1027
+ }
1028
+ if (isNew) return -1;
1029
+ if (hasUninterp) hasUninterpreted = true;
1030
+ }
1031
+ }
1032
+ return hasUninterpreted ? 0 : 1;
1033
+ }
1034
+
1035
+ pushScopeEh() {
1036
+ this.sortsTrailLimits.push(this.sortsTrail.length);
1037
+ super.pushScopeEh();
1038
+ this.trailLimits.push(this.trail.length);
1039
+ }
1040
+
1041
+ popScopeEh(numScopes: number) {
1042
+ const newLevel = this.trailLimits.length - numScopes;
1043
+ const limit = this.trailLimits[newLevel];
1044
+ for (let index = this.trail.length - 1; index >= limit; index--) this.trail[index]();
1045
+ this.trail.length = limit;
1046
+ this.trailLimits.length = newLevel;
1047
+ const numOldVars = this.getOldNumVars(numScopes);
1048
+ for (const list of [
1049
+ this.stores,
1050
+ this.parentSelects,
1051
+ this.parentStores,
1052
+ this.consts,
1053
+ this.asArrays,
1054
+ this.maps,
1055
+ this.parentMaps,
1056
+ ])
1057
+ list.length = numOldVars;
1058
+ this.isPropUpward.length = numOldVars;
1059
+ this.axiom1Todo.length = 0;
1060
+ this.axiom2Todo.length = 0;
1061
+ this.extensionalityTodo.length = 0;
1062
+ const sortsLimit = this.sortsTrailLimits[this.sortsTrailLimits.length - numScopes];
1063
+ for (let index = this.sortsTrail.length - 1; index >= sortsLimit; index--)
1064
+ this.sortSkolems.delete(this.sortsTrail[index]);
1065
+ this.sortsTrail.length = sortsLimit;
1066
+ this.sortsTrailLimits.length -= numScopes;
1067
+ super.popScopeEh(numScopes);
1068
+ this.assignedEqs.clear();
1069
+ }
1070
+
1071
+ // The model is free to choose the defaults when no store, const or default term is relevant.
1072
+ private isUnspecifiedDefaultOk() {
1073
+ for (let thVar = 0; thVar < this.getNumVars(); thVar++) {
1074
+ const node = this.getEnode(thVar);
1075
+ if (!this.context.isRelevant(node.owner)) continue;
1076
+ if (this.isOp(node, OP_STORE) || this.isOp(node, OP_CONST_ARRAY)) return false;
1077
+ if (this.isOp(node, OP_ARRAY_DEFAULT)) return false;
1078
+ }
1079
+ return true;
1080
+ }
1081
+
1082
+ private mgFind(thVar: number) {
1083
+ let root = thVar;
1084
+ while (this.mgParents[root] >= 0) root = this.mgParents[root];
1085
+ let current = thVar;
1086
+ while (this.mgParents[current] >= 0) {
1087
+ const next = this.mgParents[current];
1088
+ this.mgParents[current] = root;
1089
+ current = next;
1090
+ }
1091
+ return root;
1092
+ }
1093
+
1094
+ private mgMerge(inputFirst: number, inputSecond: number) {
1095
+ const first = this.mgFind(inputFirst);
1096
+ const second = this.mgFind(inputSecond);
1097
+ if (first === second) return;
1098
+ const isSwapped = this.mgParents[first] > this.mgParents[second];
1099
+ const root = isSwapped ? second : first;
1100
+ const child = isSwapped ? first : second;
1101
+ this.mgParents[root] += this.mgParents[child];
1102
+ this.mgParents[child] = root;
1103
+ this.defaults[root] ??= this.defaults[child];
1104
+ }
1105
+
1106
+ private setDefault(thVar: number, node: Enode) {
1107
+ const root = this.mgFind(thVar);
1108
+ this.defaults[root] ??= node;
1109
+ }
1110
+
1111
+ private collectDefaults() {
1112
+ const numVars = this.getNumVars();
1113
+ this.defaults = Array.from({ length: numVars }, () => null);
1114
+ this.elseValues = Array.from({ length: numVars }, () => undefined);
1115
+ this.mgParents = Array.from({ length: numVars }, () => -1);
1116
+ if (this.isUnspecifiedDefault) return;
1117
+ for (let thVar = 0; thVar < numVars; thVar++) {
1118
+ const node = this.getEnode(thVar);
1119
+ if (!this.context.isRelevant(node.owner)) continue;
1120
+ this.mgMerge(thVar, this.unionFind.find(thVar));
1121
+ if (this.isOp(node, OP_STORE))
1122
+ this.mgMerge(thVar, this.unionFind.find(this.getVar(node.getArg(0))));
1123
+ else if (this.isOp(node, OP_CONST_ARRAY)) this.setDefault(thVar, node.getArg(0));
1124
+ else if (this.isOp(node, OP_ARRAY_DEFAULT))
1125
+ this.setDefault(this.getVar(node.getArg(0)), node);
1126
+ }
1127
+ }
1128
+
1129
+ private getSelectSet(node: Enode) {
1130
+ const root = node.root;
1131
+ const existing = this.selectSets.get(root);
1132
+ if (existing !== undefined) return existing;
1133
+ const created = new Map<string, Enode>();
1134
+ this.selectSets.set(root, created);
1135
+ return created;
1136
+ }
1137
+
1138
+ private collectSelects() {
1139
+ this.selectSets.clear();
1140
+ const context = this.context;
1141
+ for (let thVar = 0; thVar < this.getNumVars(); thVar++) {
1142
+ const root = this.getEnode(thVar).root;
1143
+ if (this.unionFind.find(thVar) !== thVar || !context.isRelevant(root.owner)) continue;
1144
+ for (const parent of root.parents)
1145
+ if (
1146
+ parent.cg === parent &&
1147
+ context.isRelevant(parent.owner) &&
1148
+ this.isOp(parent, OP_SELECT) &&
1149
+ parent.getArg(0).root === root
1150
+ ) {
1151
+ const set = this.getSelectSet(root);
1152
+ const key = this.getSelectKey(parent);
1153
+ if (!set.has(key)) set.set(key, parent);
1154
+ }
1155
+ }
1156
+ }
1157
+
1158
+ private propagateSelectToStoreParents(root: Enode, select: Enode, todo: [Enode, Enode][]) {
1159
+ const context = this.context;
1160
+ if (!context.isRelevant(root.owner)) return;
1161
+ for (const parent of root.parents) {
1162
+ if (
1163
+ !context.isRelevant(parent.owner) ||
1164
+ !this.isOp(parent, OP_STORE) ||
1165
+ parent.getArg(0).root !== root
1166
+ )
1167
+ continue;
1168
+ const parentSet = this.getSelectSet(parent);
1169
+ const key = this.getSelectKey(select);
1170
+ if (parentSet.has(key)) continue;
1171
+ let index = 1;
1172
+ while (index < select.numArgs && select.getArg(index).root === parent.getArg(index).root)
1173
+ index++;
1174
+ if (index < select.numArgs) {
1175
+ parentSet.set(key, select);
1176
+ todo.push([parent.root, select]);
1177
+ }
1178
+ }
1179
+ }
1180
+
1181
+ private propagateSelects() {
1182
+ const todo: [Enode, Enode][] = [];
1183
+ // Propagating adds to the sets, so it goes over the selects found before it.
1184
+ for (const [root, set] of Array.from(this.selectSets))
1185
+ for (const select of Array.from(set.values()))
1186
+ this.propagateSelectToStoreParents(root, select, todo);
1187
+ for (let head = 0; head < todo.length; head++)
1188
+ this.propagateSelectToStoreParents(todo[head][0], todo[head][1], todo);
1189
+ }
1190
+
1191
+ initModel(model: ProtoModel) {
1192
+ this.model = model;
1193
+ this.isUnspecifiedDefault = this.isUnspecifiedDefaultOk();
1194
+ this.collectDefaults();
1195
+ this.collectSelects();
1196
+ this.propagateSelects();
1197
+ }
1198
+
1199
+ mkValue(node: Enode): DependentValue {
1200
+ const manager = this.manager;
1201
+ const model = this.model;
1202
+ if (model === undefined) throw new SmtInvariantError("the model was not initialized");
1203
+ const thVar = this.getVar(node);
1204
+ const sort = manager.sorts[node.owner];
1205
+ const parameters = manager.getSortParameters(sort);
1206
+ const domain = parameters.slice(0, -1);
1207
+ const range = manager.getArrayRange(sort);
1208
+ const root = this.mgFind(thVar);
1209
+ const defaultNode = this.isUnspecifiedDefault ? null : this.defaults[root];
1210
+ if (!this.isUnspecifiedDefault && defaultNode === null && this.elseValues[root] === undefined)
1211
+ this.elseValues[root] =
1212
+ manager.getSortSize(range) === SORT_SIZE_INFINITE
1213
+ ? { sort: range, value: undefined }
1214
+ : model.getSomeValue(range);
1215
+ const elseValue = defaultNode ?? this.elseValues[root];
1216
+ const dependencies: (Enode | ExtraFreshValue)[] =
1217
+ elseValue === undefined || typeof elseValue === "number" ? [] : [elseValue];
1218
+ for (const select of this.selectSets.get(node.root)?.values() ?? []) {
1219
+ for (let index = 1; index < select.numArgs; index++) dependencies.push(select.getArg(index));
1220
+ dependencies.push(select);
1221
+ }
1222
+ const isElseDependent = elseValue !== undefined && typeof elseValue !== "number";
1223
+ return {
1224
+ dependencies,
1225
+ mkValue: (values) => {
1226
+ const decl = manager.mkFreshFuncDecl(null, domain, range);
1227
+ const interp = new FuncInterp(manager, domain.length);
1228
+ model.registerFunc(decl, interp);
1229
+ if (isElseDependent) interp.setElse(values[0]);
1230
+ else if (typeof elseValue === "number") interp.setElse(elseValue);
1231
+ for (let start = isElseDependent ? 1 : 0; start < values.length; start += domain.length + 1)
1232
+ interp.insertEntry(
1233
+ values.slice(start, start + domain.length),
1234
+ values[start + domain.length],
1235
+ );
1236
+ return mkAsArray(manager, decl);
1237
+ },
1238
+ };
1239
+ }
1240
+ }