tla-ts 0.0.10-dev.99796fe03 → 0.0.10-dev.a17d6d9fa

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 (226) hide show
  1. package/dist/compile.cjs +3 -3
  2. package/dist/compile.js +1 -1
  3. package/dist/deciders.cjs +36 -36
  4. package/dist/deciders.js +54 -54
  5. package/dist/index.cjs +1 -1
  6. package/dist/index.d.cts +3 -2
  7. package/dist/index.d.ts +3 -2
  8. package/dist/index.js +1 -1
  9. package/dist/parallel-worker.cjs +1 -1
  10. package/dist/parallel-worker.js +1 -1
  11. package/dist/prove-worker.cjs +1 -1
  12. package/dist/prove-worker.js +1 -1
  13. package/dist/prove.cjs +60 -60
  14. package/dist/prove.js +78 -78
  15. package/dist/run.cjs +42 -44
  16. package/dist/run.js +44 -46
  17. package/dist/tlapm.cjs +1 -1
  18. package/dist/tlapm.js +2 -2
  19. package/dist/transfer.cjs +43 -43
  20. package/dist/transfer.js +39 -39
  21. package/dist/worker.cjs +6 -6
  22. package/dist/worker.js +6 -6
  23. package/package.json +1 -1
  24. package/src/ast.ts +1 -0
  25. package/src/bags.ts +50 -29
  26. package/src/builtins.ts +4 -3
  27. package/src/check-failure.ts +1 -1
  28. package/src/check-trace.ts +90 -51
  29. package/src/check.ts +367 -178
  30. package/src/cli/runtime-invariants.ts +20 -56
  31. package/src/cli/tlc-arguments.ts +2 -2
  32. package/src/cli/tlc-output.ts +1 -2
  33. package/src/cli/tlc.ts +16 -10
  34. package/src/cli/xml-exporter.ts +1 -1
  35. package/src/codegen.ts +26 -9
  36. package/src/dependencies.ts +49 -9
  37. package/src/dfid.ts +22 -10
  38. package/src/environment.ts +58 -33
  39. package/src/errors.ts +7 -0
  40. package/src/evaluate.ts +117 -41
  41. package/src/exit-codes.ts +4 -2
  42. package/src/instances.ts +5 -5
  43. package/src/java-hash.ts +14 -0
  44. package/src/java-overrides.ts +2 -2
  45. package/src/levels.ts +138 -90
  46. package/src/liveness-checker.ts +81 -33
  47. package/src/liveness.ts +49 -11
  48. package/src/obligations/index.ts +1 -1
  49. package/src/obligations/normalize.ts +1 -4
  50. package/src/obligations/printer.ts +5 -5
  51. package/src/parallel-worker.ts +8 -2
  52. package/src/parallel.ts +5 -0
  53. package/src/parser.ts +112 -145
  54. package/src/prover/isabelle/isar/attrib.ts +4 -4
  55. package/src/prover/isabelle/isar/rule-cases.ts +8 -6
  56. package/src/prover/isabelle/provers/clasimp.ts +1 -1
  57. package/src/prover/isabelle/provers/hypsubst.ts +2 -2
  58. package/src/prover/isabelle/pure/rewriter.ts +3 -3
  59. package/src/prover/isabelle/pure/term.ts +3 -3
  60. package/src/prover/prep/md5.ts +26 -29
  61. package/src/prover/smt/rewrite.ts +2 -7
  62. package/src/prover/smt/simplify.ts +1 -1
  63. package/src/prover/smt/solver/arith-rewriter.ts +11 -3
  64. package/src/prover/smt/solver/array-rewriter.ts +12 -2
  65. package/src/prover/smt/solver/asserted-formulas.ts +169 -58
  66. package/src/prover/smt/solver/ast-lt.ts +1 -1
  67. package/src/prover/smt/solver/ast.ts +63 -14
  68. package/src/prover/smt/solver/auf-solver.ts +23 -12
  69. package/src/prover/smt/solver/bit-blast-tactic.ts +26 -0
  70. package/src/prover/smt/solver/blast-term-ite.ts +47 -0
  71. package/src/prover/smt/solver/bound-simplifier.ts +11 -13
  72. package/src/prover/smt/solver/bv-decl-plugin.ts +13 -10
  73. package/src/prover/smt/solver/bv-rewriter.ts +1 -1
  74. package/src/prover/smt/solver/card2bv.ts +32 -18
  75. package/src/prover/smt/solver/cofactor-elim-term-ite.ts +39 -24
  76. package/src/prover/smt/solver/context.ts +47 -9
  77. package/src/prover/smt/solver/ctx-simplify.ts +1 -2
  78. package/src/prover/smt/solver/datatype-decl-plugin.ts +15 -7
  79. package/src/prover/smt/solver/dependent-expr-state.ts +9 -4
  80. package/src/prover/smt/solver/diff-neq.ts +1 -2
  81. package/src/prover/smt/solver/elim-bounds.ts +89 -0
  82. package/src/prover/smt/solver/elim-term-ite-tactic.ts +48 -0
  83. package/src/prover/smt/solver/elim-uncnstr.ts +5 -8
  84. package/src/prover/smt/solver/euf/arith-internalize.ts +1 -1
  85. package/src/prover/smt/solver/euf/array-internalize.ts +1 -1
  86. package/src/prover/smt/solver/euf/bv-internalize.ts +1 -1
  87. package/src/prover/smt/solver/euf/egraph.ts +4 -11
  88. package/src/prover/smt/solver/euf/euf-solver.ts +1 -2
  89. package/src/prover/smt/solver/euf/mam.ts +1 -5
  90. package/src/prover/smt/solver/euf/q-ematch.ts +1 -2
  91. package/src/prover/smt/solver/euf/th-solver.ts +0 -7
  92. package/src/prover/smt/solver/expr2polynomial.ts +204 -79
  93. package/src/prover/smt/solver/factor.ts +36 -14
  94. package/src/prover/smt/solver/fd-solver.ts +2 -0
  95. package/src/prover/smt/solver/fix-dl-var.ts +1 -2
  96. package/src/prover/smt/solver/fpa-rewriter.ts +1 -2
  97. package/src/prover/smt/solver/fpa2bv-converter.ts +3 -1
  98. package/src/prover/smt/solver/fpa2bv-rewriter.ts +1 -0
  99. package/src/prover/smt/solver/goal.ts +6 -3
  100. package/src/prover/smt/solver/goal2nlsat.ts +57 -30
  101. package/src/prover/smt/solver/hashtable.ts +4 -0
  102. package/src/prover/smt/solver/internalizer.ts +1 -1
  103. package/src/prover/smt/solver/logic-tactics.ts +9 -2
  104. package/src/prover/smt/solver/lp/lp-settings.ts +5 -1
  105. package/src/prover/smt/solver/lp/nla-core.ts +1 -1
  106. package/src/prover/smt/solver/lp/nla-grobner.ts +2 -2
  107. package/src/prover/smt/solver/lp/nra-solver.ts +45 -39
  108. package/src/prover/smt/solver/lp/pdd.ts +2 -3
  109. package/src/prover/smt/solver/lp/union-find.ts +1 -1
  110. package/src/prover/smt/solver/mam-compiler.ts +1 -1
  111. package/src/prover/smt/solver/model-based-opt.ts +1 -1
  112. package/src/prover/smt/solver/model-evaluator.ts +2 -0
  113. package/src/prover/smt/solver/model-generator.ts +85 -43
  114. package/src/prover/smt/solver/mpf.ts +2 -4
  115. package/src/prover/smt/solver/mus.ts +2 -3
  116. package/src/prover/smt/solver/muz/dl-context.ts +10 -4
  117. package/src/prover/smt/solver/muz/dl-mk-slice.ts +3 -3
  118. package/src/prover/smt/solver/muz/dl-rule.ts +2 -2
  119. package/src/prover/smt/solver/muz/horn-subsume-model-converter.ts +1 -1
  120. package/src/prover/smt/solver/muz/horn-tactic.ts +1 -1
  121. package/src/prover/smt/solver/muz/spacer-context.ts +2 -4
  122. package/src/prover/smt/solver/muz/spacer-pdr.ts +1 -0
  123. package/src/prover/smt/solver/nlqsat.ts +1 -1
  124. package/src/prover/smt/solver/nlsat/algebraic.ts +196 -92
  125. package/src/prover/smt/solver/nlsat/atoms.ts +52 -33
  126. package/src/prover/smt/solver/nlsat/explain.ts +375 -217
  127. package/src/prover/smt/solver/nlsat/levelwise.ts +460 -240
  128. package/src/prover/smt/solver/nlsat/polynomial.ts +2366 -681
  129. package/src/prover/smt/solver/nlsat/solver.ts +74 -64
  130. package/src/prover/smt/solver/nlsat/transcendentals.ts +41 -17
  131. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +8 -4
  132. package/src/prover/smt/solver/nlsat/upolynomial.ts +41 -18
  133. package/src/prover/smt/solver/nlsat-tactic.ts +1 -1
  134. package/src/prover/smt/solver/nnf.ts +6 -2
  135. package/src/prover/smt/solver/opt-context.ts +20 -7
  136. package/src/prover/smt/solver/opt-nlsat.ts +29 -18
  137. package/src/prover/smt/solver/opt-pareto.ts +19 -0
  138. package/src/prover/smt/solver/opt-preprocess.ts +1 -1
  139. package/src/prover/smt/solver/opt-solver.ts +9 -5
  140. package/src/prover/smt/solver/optsmt.ts +1 -1
  141. package/src/prover/smt/solver/pb-rewriter.ts +1 -4
  142. package/src/prover/smt/solver/poly-rewriter.ts +75 -18
  143. package/src/prover/smt/solver/probes.ts +88 -23
  144. package/src/prover/smt/solver/proto-model.ts +8 -8
  145. package/src/prover/smt/solver/push-app-ite.ts +37 -0
  146. package/src/prover/smt/solver/qe-arith-plugin.ts +2 -4
  147. package/src/prover/smt/solver/qe-lite.ts +2 -2
  148. package/src/prover/smt/solver/qe.ts +3 -2
  149. package/src/prover/smt/solver/qsat.ts +16 -6
  150. package/src/prover/smt/solver/quantifier-manager.ts +14 -9
  151. package/src/prover/smt/solver/recfun-decl-plugin.ts +2 -1
  152. package/src/prover/smt/solver/rewriter.ts +31 -25
  153. package/src/prover/smt/solver/rlimit.ts +4 -0
  154. package/src/prover/smt/solver/sat/config.ts +1 -1
  155. package/src/prover/smt/solver/sat/goal2sat.ts +0 -1
  156. package/src/prover/smt/solver/sat/inc-sat-solver.ts +39 -5
  157. package/src/prover/smt/solver/sat/model-converter.ts +1 -1
  158. package/src/prover/smt/solver/sat/pb-solver.ts +1 -1
  159. package/src/prover/smt/solver/sat/sat-tactic.ts +13 -5
  160. package/src/prover/smt/solver/sat/simplifier.ts +1 -1
  161. package/src/prover/smt/solver/sat/solver.ts +25 -47
  162. package/src/prover/smt/solver/seq-axioms.ts +20 -35
  163. package/src/prover/smt/solver/seq-decl-plugin.ts +1 -1
  164. package/src/prover/smt/solver/seq-derive.ts +2 -2
  165. package/src/prover/smt/solver/seq-eq-solver.ts +2 -2
  166. package/src/prover/smt/solver/seq-monadic.ts +7 -5
  167. package/src/prover/smt/solver/seq-re-rewriter.ts +2 -1
  168. package/src/prover/smt/solver/seq-re-util.ts +1 -1
  169. package/src/prover/smt/solver/seq-regex-bisim.ts +1 -1
  170. package/src/prover/smt/solver/seq-regex-live.ts +2 -2
  171. package/src/prover/smt/solver/seq-rewriter.ts +31 -29
  172. package/src/prover/smt/solver/seq-skolem.ts +0 -23
  173. package/src/prover/smt/solver/seq-view-witness.ts +4 -4
  174. package/src/prover/smt/solver/smt-kernel.ts +39 -5
  175. package/src/prover/smt/solver/smt-setup.ts +96 -10
  176. package/src/prover/smt/solver/smtlib-parser.ts +584 -223
  177. package/src/prover/smt/solver/smtlib-script.ts +509 -154
  178. package/src/prover/smt/solver/solve-eqs.ts +36 -37
  179. package/src/prover/smt/solver/solver.ts +18 -3
  180. package/src/prover/smt/solver/tactic.ts +284 -168
  181. package/src/prover/smt/solver/theory-bv.ts +13 -3
  182. package/src/prover/smt/solver/theory-fpa.ts +1 -1
  183. package/src/prover/smt/solver/theory-lra-final-check.ts +1 -0
  184. package/src/prover/smt/solver/theory-lra-internalize.ts +2 -0
  185. package/src/prover/smt/solver/theory-lra-propagate.ts +11 -3
  186. package/src/prover/smt/solver/theory-lra.ts +1 -1
  187. package/src/prover/smt/solver/theory-pb.ts +24 -7
  188. package/src/prover/smt/solver/theory-seq-solve.ts +1 -1
  189. package/src/prover/smt/solver/theory-seq-state.ts +2 -21
  190. package/src/prover/smt/solver/tseitin-cnf.ts +1 -0
  191. package/src/prover/tlapm/cache.ts +8 -8
  192. package/src/prover/zenon/index-table.ts +5 -2
  193. package/src/prover/zenon/isar-case.ts +1 -1
  194. package/src/prover/zenon/isar.ts +2 -2
  195. package/src/prover/zenon/phrase.ts +1 -1
  196. package/src/resolve.ts +959 -243
  197. package/src/runtime.ts +7 -1
  198. package/src/sany/builtins.ts +10 -10
  199. package/src/sany/generation.ts +2 -13
  200. package/src/sany/generator-definitions.ts +3 -1
  201. package/src/sany/generator-expressions.ts +36 -30
  202. package/src/sany/generator-proofs.ts +5 -3
  203. package/src/sany/generator.ts +2 -1
  204. package/src/sany/lexer.ts +3 -3
  205. package/src/sany/modules.ts +4 -2
  206. package/src/sany/nodes.ts +1 -1
  207. package/src/sany/selectors.ts +11 -6
  208. package/src/sany/xml.ts +2 -3
  209. package/src/search.ts +166 -101
  210. package/src/simulate.ts +110 -50
  211. package/src/spec-description.ts +5 -6
  212. package/src/standard-modules.ts +15 -6
  213. package/src/subexpressions.ts +398 -108
  214. package/src/successors.ts +4 -2
  215. package/src/symmetry.ts +1 -1
  216. package/src/tlc/jar-data.ts +10 -0
  217. package/src/tlc/messages.ts +3 -3
  218. package/src/tlc/order.ts +14 -3
  219. package/src/tlc/random.ts +2 -1
  220. package/src/tlc/replay.ts +3 -2
  221. package/src/tlc/tlc-operators.ts +10 -8
  222. package/src/tlc/tlcext-operators.ts +44 -15
  223. package/src/tlc/trace-spec.ts +9 -22
  224. package/src/typed-tier.ts +32 -25
  225. package/src/typescript/types.ts +2 -2
  226. package/src/values.ts +135 -78
@@ -74,7 +74,7 @@ const RANDOM_MAX_VALUE = 0x7fff;
74
74
  const S_SAT = 0;
75
75
  const S_UNSAT = 1;
76
76
 
77
- export class Ema {
77
+ class Ema {
78
78
  private beta = 1;
79
79
  value = 0;
80
80
  private period = 0;
@@ -139,7 +139,6 @@ export class Solver {
139
139
  model = new Int8Array(0);
140
140
  isModelCurrent = false;
141
141
  isInconsistent = false;
142
- isSearching = false;
143
142
  conflictJustLevel = 0;
144
143
  conflictLevel = 0;
145
144
  conflictVal = 0;
@@ -147,7 +146,6 @@ export class Solver {
147
146
  notL = NULL_LITERAL;
148
147
  clauses: number[] = [];
149
148
  learned: number[] = [];
150
- numFrozen = 0;
151
149
  watches: WatchList[] = [];
152
150
  assignment = new Int8Array(16);
153
151
  justLevel = new Uint32Array(8);
@@ -196,7 +194,6 @@ export class Solver {
196
194
  scopes: Scope[] = [];
197
195
  core: number[] = [];
198
196
  conflicts = 0;
199
- decisions = 0;
200
197
  conflictsSinceInit = 0;
201
198
  restarts = 0;
202
199
  conflictsSinceRestart = 0;
@@ -392,7 +389,6 @@ export class Solver {
392
389
  }
393
390
 
394
391
  delClause(clause: number) {
395
- if (this.arena.isFrozen(clause)) this.numFrozen--;
396
392
  this.arena.delClause(clause);
397
393
  }
398
394
 
@@ -879,38 +875,33 @@ export class Solver {
879
875
  check(assumptions: readonly number[] = []) {
880
876
  this.reasonUnknown = "no reason given";
881
877
  this.popToBaseLevel();
882
- this.isSearching = true;
883
878
  this.isGivenUp = false;
884
- try {
885
- this.initSearch();
886
- if (this.checkInconsistent()) return L_FALSE;
887
- this.propagate(false);
888
- if (this.checkInconsistent()) return L_FALSE;
889
- this.initAssumptions(assumptions);
890
- this.propagate(false);
879
+ this.initSearch();
880
+ if (this.checkInconsistent()) return L_FALSE;
881
+ this.propagate(false);
882
+ if (this.checkInconsistent()) return L_FALSE;
883
+ this.initAssumptions(assumptions);
884
+ this.propagate(false);
885
+ if (this.checkInconsistent()) return L_FALSE;
886
+ if (this.config.isForcingCleanup) this.doCleanup(true);
887
+ if (this.config.isGcBurst) {
888
+ this.conflictsSinceGc = this.gcThreshold + 1;
889
+ this.doGc();
890
+ }
891
+ if (this.config.isEnablingPreSimplify) {
892
+ this.doSimplify();
891
893
  if (this.checkInconsistent()) return L_FALSE;
892
- if (this.config.isForcingCleanup) this.doCleanup(true);
893
- if (this.config.isGcBurst) {
894
- this.conflictsSinceGc = this.gcThreshold + 1;
895
- this.doGc();
896
- }
897
- if (this.config.isEnablingPreSimplify) {
898
- this.doSimplify();
899
- if (this.checkInconsistent()) return L_FALSE;
900
- }
901
- if (this.config.maxConflicts === 0) return L_UNDEF;
902
- if (this.config.maxConflicts > 0 && this.config.burstSearch > 0) {
903
- this.restartThreshold = this.config.burstSearch;
904
- const result = this.boundedSearch();
905
- if (result !== L_UNDEF || this.isGivenUp) return result;
906
- this.popReinit(this.scopeLvl);
907
- this.conflictsSinceRestart = 0;
908
- this.restartThreshold = this.config.restartInitial;
909
- }
910
- return this.basicSearch();
911
- } finally {
912
- this.isSearching = false;
913
894
  }
895
+ if (this.config.maxConflicts === 0) return L_UNDEF;
896
+ if (this.config.maxConflicts > 0 && this.config.burstSearch > 0) {
897
+ this.restartThreshold = this.config.burstSearch;
898
+ const result = this.boundedSearch();
899
+ if (result !== L_UNDEF || this.isGivenUp) return result;
900
+ this.popReinit(this.scopeLvl);
901
+ this.conflictsSinceRestart = 0;
902
+ this.restartThreshold = this.config.restartInitial;
903
+ }
904
+ return this.basicSearch();
914
905
  }
915
906
 
916
907
  checkInconsistent() {
@@ -1126,7 +1117,6 @@ export class Solver {
1126
1117
  const next = this.nextVar();
1127
1118
  if (next === -1) return false;
1128
1119
  this.push();
1129
- this.decisions++;
1130
1120
  this.assignScoped(2 * next + (this.guess(next) ? 0 : 1));
1131
1121
  return true;
1132
1122
  }
@@ -1932,16 +1922,6 @@ export class Solver {
1932
1922
  this.activityInc >>>= 14;
1933
1923
  }
1934
1924
 
1935
- numClauses() {
1936
- let numClauses = this.trail.length;
1937
- for (let lit = 0; lit < this.watches.length; lit++) {
1938
- const wlist = this.watches[lit];
1939
- for (let index = 0; index < wlist.size; index++)
1940
- if (wlist.isBinary(index) && (lit ^ 1) < wlist.getLiteral(index)) numClauses++;
1941
- }
1942
- return numClauses + this.clauses.length + this.learned.length;
1943
- }
1944
-
1945
1925
  doCleanup(isForced: boolean) {
1946
1926
  if (this.conflictsSinceInit === 0 && !isForced) return false;
1947
1927
  return this.atBaseLvl() && !this.isInconsistent && this.cleaner.run(isForced);
@@ -2063,12 +2043,10 @@ export class Solver {
2063
2043
  this.detachClause(clause);
2064
2044
  arena.inactRounds[clause] = 0;
2065
2045
  arena.setFrozen(clause, true);
2066
- this.numFrozen++;
2067
2046
  }
2068
2047
  }
2069
2048
  } else if (this.psm(clause) <= Math.trunc(arena.size[clause] * this.minDTk)) {
2070
2049
  arena.setFrozen(clause, false);
2071
- this.numFrozen--;
2072
2050
  if (!this.activateFrozenClause(clause)) {
2073
2051
  this.delClause(clause);
2074
2052
  continue;
@@ -1,4 +1,3 @@
1
- import { SmtUnsupportedError } from "../../../errors";
2
1
  import {
3
2
  type AstManager,
4
3
  FAMILY_ARITH,
@@ -24,7 +23,6 @@ import {
24
23
  OP_SEQ_PREFIX,
25
24
  OP_SEQ_UNIT,
26
25
  OP_STRING_FROM_CODE,
27
- OP_STRING_ITOS,
28
26
  OP_STRING_LT,
29
27
  OP_STRING_STOI,
30
28
  OP_STRING_TO_CODE,
@@ -36,7 +34,7 @@ import { FALSE_LITERAL, type Literal, TRUE_LITERAL, negate } from "./literal";
36
34
  import { isBinaryApp, isEmptySeq, mkConcatOf, mkEmptySeq, mkSeqApp } from "./seq-decl-plugin";
37
35
  import { SeqSkolem } from "./seq-skolem";
38
36
 
39
- export interface SeqAxiomsHost {
37
+ interface SeqAxiomsHost {
40
38
  rewrite(expr: number): number;
41
39
  mkEqLiteral(first: number, second: number): Literal;
42
40
  ensureEnode(expr: number): void;
@@ -62,7 +60,7 @@ export const getMinLengthOf = (manager: AstManager, seq: number): number => {
62
60
 
63
61
  const UINT_MAX = 0xffffffff;
64
62
 
65
- export const getMaxLengthOf = (manager: AstManager, seq: number): number => {
63
+ const getMaxLengthOf = (manager: AstManager, seq: number): number => {
66
64
  const getLength = (expr: number) => {
67
65
  if (isEmptySeq(manager, expr)) return 0;
68
66
  const op = manager.getOp(expr);
@@ -180,13 +178,8 @@ export class SeqAxioms {
180
178
  return result;
181
179
  }
182
180
 
183
- mkLen(seq: number) {
184
- return this.host.rewrite(this.mkSeq(OP_SEQ_LENGTH, [seq]));
185
- }
186
-
187
- private purify(expr: number | undefined) {
181
+ private purify(expr: number) {
188
182
  const manager = this.manager;
189
- if (expr === undefined) return undefined;
190
183
  if (manager.depths[expr] === 1 || manager.isValue(expr)) return expr;
191
184
  if (this.host.rewrite(expr) === expr) return expr;
192
185
  let result = this.purified.get(expr);
@@ -256,9 +249,9 @@ export class SeqAxioms {
256
249
  extractAxiom(expr: number) {
257
250
  const manager = this.manager;
258
251
  const [seqArg, indexArg, lengthArg] = manager.getArgs(expr);
259
- const seq = this.purify(seqArg)!;
260
- const index = this.purify(indexArg)!;
261
- const length = this.purify(lengthArg)!;
252
+ const seq = this.purify(seqArg);
253
+ const index = this.purify(indexArg);
254
+ const length = this.purify(lengthArg);
262
255
  if (this.smallSegmentAxiom(expr, seqArg, indexArg, lengthArg)) return;
263
256
  if (this.isTail(seq, indexArg, lengthArg)) {
264
257
  this.tailAxiom(expr, seq);
@@ -436,9 +429,9 @@ export class SeqAxioms {
436
429
  const args = manager.getArgs(index);
437
430
  const minusOne = this.mkInt(-1);
438
431
  const zero = this.mkInt(0);
439
- const offset = this.purify(args[2]);
440
- const pattern = this.purify(args[1])!;
441
- const text = this.purify(args[0])!;
432
+ const offset = args.length > 2 ? this.purify(args[2]) : undefined;
433
+ const pattern = this.purify(args[1]);
434
+ const text = this.purify(args[0]);
442
435
  const contains = this.mkSeq(OP_SEQ_CONTAINS, [text, pattern]);
443
436
  const isMinusOne = this.mkEq(index, minusOne);
444
437
  const isZero = this.mkEq(index, zero);
@@ -511,8 +504,8 @@ export class SeqAxioms {
511
504
  lastIndexofAxiom(index: number) {
512
505
  const manager = this.manager;
513
506
  const [textArg, patternArg] = manager.getArgs(index);
514
- const text = this.purify(textArg)!;
515
- const pattern = this.purify(patternArg)!;
507
+ const text = this.purify(textArg);
508
+ const pattern = this.purify(patternArg);
516
509
  const minusOne = this.mkInt(-1);
517
510
  const zero = this.mkInt(0);
518
511
  const skolem = this.skolem;
@@ -539,9 +532,9 @@ export class SeqAxioms {
539
532
  replaceAxiom(replace: number) {
540
533
  const manager = this.manager;
541
534
  const [source, patternArg, targetArg] = manager.getArgs(replace);
542
- const text = this.purify(source)!;
543
- const pattern = this.purify(patternArg)!;
544
- const target = this.purify(targetArg)!;
535
+ const text = this.purify(source);
536
+ const pattern = this.purify(patternArg);
537
+ const target = this.purify(targetArg);
545
538
  const skolem = this.skolem;
546
539
  const left = skolem.mkIndexofLeft(text, pattern);
547
540
  const right = skolem.mkIndexofRight(text, pattern);
@@ -565,8 +558,8 @@ export class SeqAxioms {
565
558
  atAxiom(expr: number) {
566
559
  const manager = this.manager;
567
560
  const [seqArg, indexArg] = manager.getArgs(expr);
568
- const seq = this.purify(seqArg)!;
569
- const index = this.purify(indexArg)!;
561
+ const seq = this.purify(seqArg);
562
+ const index = this.purify(indexArg);
570
563
  this.mkInt(0);
571
564
  const one = this.mkInt(1);
572
565
  const empty = this.mkEmpty(manager.sorts[expr]);
@@ -747,8 +740,8 @@ export class SeqAxioms {
747
740
  ltAxiom(expr: number) {
748
741
  const manager = this.manager;
749
742
  const [firstArg, secondArg] = manager.getArgs(expr);
750
- const first = this.purify(firstArg)!;
751
- const second = this.purify(secondArg)!;
743
+ const first = this.purify(firstArg);
744
+ const second = this.purify(secondArg);
752
745
  const charSort = manager.getSeqElementSort(manager.sorts[first]);
753
746
  const lt = expr;
754
747
  const gt = this.mkSeq(OP_STRING_LT, [second, first]);
@@ -895,8 +888,8 @@ export class SeqAxioms {
895
888
  private affixAxiom(expr: number, name: string, isPrefix: boolean) {
896
889
  const manager = this.manager;
897
890
  const [firstArg, secondArg] = manager.getArgs(expr);
898
- const first = this.purify(firstArg)!;
899
- const second = this.purify(secondArg)!;
891
+ const first = this.purify(firstArg);
892
+ const second = this.purify(secondArg);
900
893
  const firstLength = this.mkLenAxiom(first);
901
894
  const secondLength = this.mkLenAxiom(second);
902
895
  const isLonger = this.mkGe(this.mkSub(firstLength, secondLength), 1);
@@ -999,12 +992,4 @@ export class SeqAxioms {
999
992
  this.addClause([this.mkNot(tracker), this.mkLe(this.mkLenAxiom(target), limit)]);
1000
993
  return tracker;
1001
994
  }
1002
-
1003
- ubvAxiom(): never {
1004
- throw new SmtUnsupportedError("str.from_ubv in the theory of sequences");
1005
- }
1006
-
1007
- isItos(expr: number) {
1008
- return this.manager.getOp(expr) === OP_STRING_ITOS;
1009
- }
1010
995
  }
@@ -271,7 +271,7 @@ const SEQ_VARIANTS = new Map([
271
271
  [OP_INTERNAL_STRING_SUBSTR, OP_SEQ_EXTRACT],
272
272
  ]);
273
273
 
274
- const STRING_VARIANTS = new Map([...SEQ_VARIANTS].map(([variant, op]) => [op, variant]));
274
+ const STRING_VARIANTS = new Map([...SEQ_VARIANTS].map((entry) => [entry[1], entry[0]]));
275
275
 
276
276
  const getPsig = (op: number) => {
277
277
  const sig = SIGS.get(op);
@@ -63,7 +63,7 @@ import {
63
63
  import { type ReRewriter, getResultExpr } from "./seq-re-rewriter";
64
64
 
65
65
  export const DERIVATIVE_ANTIMIROV = 0;
66
- export const DERIVATIVE_BRZOZOWSKI = 1;
66
+ const DERIVATIVE_BRZOZOWSKI = 1;
67
67
  export const TRANSITION_BRZOZOWSKI = 0;
68
68
  export const TRANSITION_LIGHT_ANTIMIROV = 1;
69
69
 
@@ -1243,7 +1243,7 @@ export class Derive {
1243
1243
 
1244
1244
  derivativeCofactors(regex: number, result: RefVector) {
1245
1245
  const derivative = this.deriveSymbolic(DERIVATIVE_BRZOZOWSKI, regex);
1246
- // Like Z3, a cached derivative leaves the element unset here, which stops the interval pruning.
1246
+ // Like Z3, a cached derivative whose lookup reset the op caches leaves the element unset, which stops the interval pruning.
1247
1247
  this.getCofactors(this.element, derivative, result);
1248
1248
  }
1249
1249
 
@@ -27,7 +27,7 @@ export interface SeqLength {
27
27
  value: Rational;
28
28
  }
29
29
 
30
- export interface SeqEqSolverHost {
30
+ interface SeqEqSolverHost {
31
31
  addConsequence(isUsingDeps: boolean, clause: number[]): void;
32
32
  addSolution(variable: number, term: number): void;
33
33
  expr2rep(expr: number): number;
@@ -41,7 +41,7 @@ export interface BinaryEq {
41
41
  y: number;
42
42
  }
43
43
 
44
- export interface TernaryEq {
44
+ interface TernaryEq {
45
45
  x: number;
46
46
  xs: number[];
47
47
  y1: number;
@@ -35,15 +35,15 @@ import {
35
35
  ViewWitness,
36
36
  } from "./seq-view-witness";
37
37
 
38
- export const ORIENTATION_FORWARD = 0;
39
- export const ORIENTATION_REVERSED = 1;
38
+ const ORIENTATION_FORWARD = 0;
39
+ const ORIENTATION_REVERSED = 1;
40
40
  export const ORIENTATION_RETRY = 2;
41
41
 
42
42
  const LIVE_STATE_CAP = 1 << 12;
43
43
  const COFACTOR_CACHE_CAP = 1 << 16;
44
44
  const LENGTH_CONSTRAINING_KEY = 2 ** 40;
45
45
 
46
- export interface Memberships {
46
+ interface Memberships {
47
47
  terms: number[];
48
48
  regexes: number[];
49
49
  deps: number[];
@@ -133,8 +133,10 @@ export class Monadic {
133
133
  this.pins.push(regex);
134
134
  this.pins.push(element);
135
135
  this.pins.pushOwned(derivative);
136
- if (!this.derivativeCache.has(regex)) this.derivativeCache.set(regex, new Map());
137
- this.derivativeCache.get(regex)!.set(element, derivative);
136
+ const derivatives = this.derivativeCache.get(regex);
137
+ if (derivatives === undefined)
138
+ this.derivativeCache.set(regex, new Map([[element, derivative]]));
139
+ else derivatives.set(element, derivative);
138
140
  return derivative;
139
141
  }
140
142
 
@@ -484,7 +484,8 @@ export class ReRewriter {
484
484
  left === right ? 0 : getId(left) < getId(right) ? -1 : 1;
485
485
  const composeResult = (suffix: number) => {
486
486
  let result = suffix;
487
- while (prefix.length > 0) result = compose(prefix.pop()!, result);
487
+ for (let regex = prefix.pop(); regex !== undefined; regex = prefix.pop())
488
+ result = compose(regex, result);
488
489
  return result;
489
490
  };
490
491
  let left = first;
@@ -57,7 +57,7 @@ export interface LenAbs {
57
57
  residues: bigint;
58
58
  }
59
59
 
60
- export interface ReInfo extends LenAbs {
60
+ interface ReInfo extends LenAbs {
61
61
  isKnown: boolean;
62
62
  isInterpreted: boolean;
63
63
  nullable: number;
@@ -117,7 +117,7 @@ export class RegexBisim {
117
117
  this.worklist.pop();
118
118
  const cofactors = new RefVector(manager);
119
119
  derive.derivativeCofactors(regex, cofactors);
120
- const leaves = cofactors.items.filter((_, index) => index % 2 === 1);
120
+ const leaves = cofactors.items.filter((_value, index) => index % 2 === 1);
121
121
  const status = this.areLeavesEquivalent(leaves);
122
122
  if (status === L_TRUE)
123
123
  for (const leaf of leaves) {
@@ -5,8 +5,8 @@ import type { ReRewriter } from "./seq-re-rewriter";
5
5
  import { isReEmpty } from "./seq-re-util";
6
6
 
7
7
  export const LIVE_FAILURE_NONE = 0;
8
- export const LIVE_FAILURE_STATE_CAP = 1;
9
- export const LIVE_FAILURE_RESOURCE = 2;
8
+ const LIVE_FAILURE_STATE_CAP = 1;
9
+ const LIVE_FAILURE_RESOURCE = 2;
10
10
 
11
11
  const NULLABLE_UNKNOWN = 2;
12
12
  const NULLABLE_UNDEF = 3;
@@ -182,7 +182,7 @@ const isDigit = (code: number) => code >= 48 && code <= 57;
182
182
  const getCount = (bag: Map<number, number>, key: number) => bag.get(key) ?? 0;
183
183
 
184
184
  const isSameBag = (first: Map<number, number>, second: Map<number, number>) =>
185
- first.size === second.size && [...first].every(([key, count]) => second.get(key) === count);
185
+ first.size === second.size && [...first].every((entry) => second.get(entry[0]) === entry[1]);
186
186
 
187
187
  export class SeqRewriter {
188
188
  readonly re: ReRewriter;
@@ -499,8 +499,7 @@ export class SeqRewriter {
499
499
  return manager.mkString([...firstChars, ...secondChars]);
500
500
  const elements: number[] = [];
501
501
  const todo = [second, first];
502
- while (todo.length > 0) {
503
- const expr = todo.pop()!;
502
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
504
503
  if (this.isConcat2(expr)) {
505
504
  todo.push(this.getArg(expr, 1), this.getArg(expr, 0));
506
505
  continue;
@@ -510,7 +509,8 @@ export class SeqRewriter {
510
509
  if (elements.length === 0) return this.mkEmpty(manager.sorts[first]);
511
510
  const coalesced: number[] = [];
512
511
  for (const element of elements) {
513
- const previous = coalesced.length > 0 ? manager.getString(coalesced.at(-1)!) : undefined;
512
+ const previous =
513
+ coalesced.length > 0 ? manager.getString(coalesced[coalesced.length - 1]) : undefined;
514
514
  const chars = manager.getString(element);
515
515
  if (this.isCoalescingChars && previous !== undefined && chars !== undefined)
516
516
  coalesced[coalesced.length - 1] = manager.mkString([...previous, ...chars]);
@@ -518,7 +518,10 @@ export class SeqRewriter {
518
518
  }
519
519
  return coalesced
520
520
  .slice(0, -1)
521
- .reduceRight((tail, element) => this.mkConcat(element, tail), coalesced.at(-1)!);
521
+ .reduceRight(
522
+ (tail, element) => this.mkConcat(element, tail),
523
+ coalesced[coalesced.length - 1],
524
+ );
522
525
  }
523
526
 
524
527
  private mkSeqLength(seq: number): Result {
@@ -765,8 +768,7 @@ export class SeqRewriter {
765
768
  let isOtherFactorAtLeastOne = true;
766
769
  const todo = [offset];
767
770
  const visited = new Set<number>();
768
- while (todo.length > 0) {
769
- const arg = todo.pop()!;
771
+ for (let arg = todo.pop(); arg !== undefined; arg = todo.pop()) {
770
772
  if (visited.has(arg)) continue;
771
773
  visited.add(arg);
772
774
  if (this.isOp(arg, OP_MUL)) todo.push(...manager.getArgs(arg));
@@ -956,7 +958,7 @@ export class SeqRewriter {
956
958
  let start = 0;
957
959
  let end = seqUnits.length;
958
960
  const first = otherUnits[0];
959
- const last = otherUnits.at(-1)!;
961
+ const last = otherUnits[otherUnits.length - 1];
960
962
  while (start < seqUnits.length && this.isNotContainingPrefix(seqUnits[start], first)) start++;
961
963
  while (end > start && this.isNotContainingSuffix(seqUnits[end - 1], last)) end--;
962
964
  if (start === end) return rewrite(this.mkIsEmpty(other), BR_REWRITE2);
@@ -1701,7 +1703,7 @@ export class SeqRewriter {
1701
1703
  const seq = this.getArg(value, 0);
1702
1704
  const maxLength = this.getMaxLength(seq);
1703
1705
  if (!maxLength.isBounded || maxLength.length > 1n) return undefined;
1704
- const eqs = Array.from({ length: 10 }, (_, digit) =>
1706
+ const eqs = Array.from({ length: 10 }, (_value, digit) =>
1705
1707
  this.mkEq(seq, manager.mkString([48 + digit])),
1706
1708
  );
1707
1709
  const isDigitString = manager.mkApp(OP_OR, eqs, SORT_BOOL);
@@ -1738,8 +1740,8 @@ export class SeqRewriter {
1738
1740
  }
1739
1741
  const units = getConcatUnits(manager, seq, []);
1740
1742
  if (units.length === 0) return this.minusOne();
1741
- if (this.isUnit(units.at(-1)!)) {
1742
- const tail = this.mkSeq(OP_STRING_STOI, [units.at(-1)!]);
1743
+ if (this.isUnit(units[units.length - 1])) {
1744
+ const tail = this.mkSeq(OP_STRING_STOI, [units[units.length - 1]]);
1743
1745
  const head = this.mkConcatOf(units.slice(0, -1), manager.sorts[seq]);
1744
1746
  const headValue = this.mkSeq(OP_STRING_STOI, [head]);
1745
1747
  const isHeadValid = this.mkGe(headValue, this.zero());
@@ -1789,24 +1791,20 @@ export class SeqRewriter {
1789
1791
  if (isVisited) cache.set(expr, { isBounded: isValid, length: count });
1790
1792
  return isVisited;
1791
1793
  } else if (this.isOp(expr, OP_ITE)) {
1792
- const size = pending.length;
1793
1794
  const thenLength = cache.get(this.getArg(expr, 1));
1794
1795
  const elseLength = cache.get(this.getArg(expr, 2));
1795
1796
  if (thenLength === undefined) pending.push(this.getArg(expr, 1));
1796
1797
  if (elseLength === undefined) pending.push(this.getArg(expr, 2));
1797
- if (size !== pending.length) return false;
1798
+ if (thenLength === undefined || elseLength === undefined) return false;
1798
1799
  cache.set(expr, {
1799
1800
  isBounded:
1800
- thenLength!.isBounded &&
1801
- elseLength!.isBounded &&
1802
- thenLength!.length === elseLength!.length,
1803
- length: Math.min(thenLength!.length, elseLength!.length),
1801
+ thenLength.isBounded && elseLength.isBounded && thenLength.length === elseLength.length,
1802
+ length: Math.min(thenLength.length, elseLength.length),
1804
1803
  });
1805
1804
  } else cache.set(expr, { isBounded: false, length: 0 });
1806
1805
  return true;
1807
1806
  };
1808
- while (todo.length > 0) {
1809
- const expr = todo.pop()!;
1807
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
1810
1808
  const chars = manager.getString(expr);
1811
1809
  if (this.isUnit(expr)) length++;
1812
1810
  else if (this.isEmpty(expr)) continue;
@@ -1816,7 +1814,7 @@ export class SeqRewriter {
1816
1814
  const thenExpr = this.getArg(expr, 1);
1817
1815
  const elseExpr = this.getArg(expr, 2);
1818
1816
  pending.push(thenExpr, elseExpr);
1819
- while (pending.length > 0) if (visit(pending.at(-1)!)) pending.pop();
1817
+ while (pending.length > 0) if (visit(pending[pending.length - 1])) pending.pop();
1820
1818
  const thenLength = cache.get(thenExpr) ?? { isBounded: false, length: 0 };
1821
1819
  const elseLength = cache.get(elseExpr) ?? { isBounded: false, length: 0 };
1822
1820
  if (
@@ -1835,8 +1833,7 @@ export class SeqRewriter {
1835
1833
  const manager = this.manager;
1836
1834
  const todo = [seq];
1837
1835
  let length = 0n;
1838
- while (todo.length > 0) {
1839
- const expr = todo.pop()!;
1836
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
1840
1837
  const chars = manager.getString(expr);
1841
1838
  if (this.isUnit(expr) || this.isApp(expr, OP_SEQ_AT, 2)) length += 1n;
1842
1839
  else if (chars !== undefined) length += BigInt(chars.length);
@@ -2036,8 +2033,7 @@ export class SeqRewriter {
2036
2033
  const manager = this.manager;
2037
2034
  const elements: number[] = [];
2038
2035
  const todo = [seq];
2039
- while (todo.length > 0) {
2040
- const expr = todo.pop()!;
2036
+ for (let expr = todo.pop(); expr !== undefined; expr = todo.pop()) {
2041
2037
  if (this.isOp(expr, OP_SEQ_CONCAT)) {
2042
2038
  todo.push(...manager.getArgs(expr));
2043
2039
  continue;
@@ -2113,10 +2109,13 @@ export class SeqRewriter {
2113
2109
  private reduceBack(pair: SeqPair, eqs: EqPair[]) {
2114
2110
  const manager = this.manager;
2115
2111
  while (pair.left.length > 0 && pair.right.length > 0) {
2116
- if (this.isUnit(pair.right.at(-1)!) && manager.getString(pair.left.at(-1)!) !== undefined)
2112
+ if (
2113
+ this.isUnit(pair.right[pair.right.length - 1]) &&
2114
+ manager.getString(pair.left[pair.left.length - 1]) !== undefined
2115
+ )
2117
2116
  this.swap(pair);
2118
- const left = pair.left.at(-1)!;
2119
- const right = pair.right.at(-1)!;
2117
+ const left = pair.left[pair.left.length - 1];
2118
+ const right = pair.right[pair.right.length - 1];
2120
2119
  const rightChars = manager.getString(right);
2121
2120
  const leftChars = manager.getString(left);
2122
2121
  if (left === right) {
@@ -2128,7 +2127,10 @@ export class SeqRewriter {
2128
2127
  pair.left.pop();
2129
2128
  pair.right.pop();
2130
2129
  } else if (this.isUnit(left) && rightChars !== undefined) {
2131
- eqs.push({ left: manager.mkChar(rightChars.at(-1)!), right: this.getArg(left, 0) });
2130
+ eqs.push({
2131
+ left: manager.mkChar(rightChars[rightChars.length - 1]),
2132
+ right: this.getArg(left, 0),
2133
+ });
2132
2134
  pair.left.pop();
2133
2135
  if (rightChars.length === 1) pair.right.pop();
2134
2136
  else pair.right[pair.right.length - 1] = manager.mkString(rightChars.slice(0, -1));
@@ -2229,7 +2231,7 @@ export class SeqRewriter {
2229
2231
  for (const expr of right) {
2230
2232
  const index = remaining.indexOf(expr);
2231
2233
  if (index !== -1) {
2232
- remaining[index] = remaining.at(-1)!;
2234
+ remaining[index] = remaining[remaining.length - 1];
2233
2235
  remaining.pop();
2234
2236
  continue;
2235
2237
  }
@@ -48,10 +48,6 @@ export class SeqSkolem {
48
48
  return this.manager.mkNumeral(BigInt(value));
49
49
  }
50
50
 
51
- mkAlign(args: number[]) {
52
- return this.mk("seq.align", args);
53
- }
54
-
55
51
  mkAlignL(args: number[]) {
56
52
  return this.mk("seq.align.l", args);
57
53
  }
@@ -201,12 +197,6 @@ export class SeqSkolem {
201
197
  return this.isNamed(expr, TAIL);
202
198
  }
203
199
 
204
- getTailIndex(expr: number) {
205
- if (!this.isTail(expr)) return undefined;
206
- const index = this.manager.getNumeral(this.manager.getArg(expr, 1));
207
- return index !== undefined && index >= 0n && index <= 0xffffffffn ? Number(index) : undefined;
208
- }
209
-
210
200
  isSeqFirst(expr: number) {
211
201
  return this.isNamed(expr, SEQ_FIRST);
212
202
  }
@@ -231,10 +221,6 @@ export class SeqSkolem {
231
221
  return this.isNamed(expr, EQ) && this.manager.getNumArgs(expr) === 2;
232
222
  }
233
223
 
234
- isDigit(expr: number) {
235
- return this.isNamed(expr, "seq.is_digit");
236
- }
237
-
238
224
  isMaxUnfolding(expr: number) {
239
225
  return this.isNamed(expr, MAX_UNFOLDING);
240
226
  }
@@ -257,15 +243,6 @@ export class SeqSkolem {
257
243
  return this.isNamed(expr, "seq.align.r");
258
244
  }
259
245
 
260
- isRegexSkolem(expr: number) {
261
- return (
262
- this.isNamed(expr, ACCEPT) ||
263
- this.isNamed(expr, "re.is_empty") ||
264
- this.isNamed(expr, "re.is_non_empty") ||
265
- this.isNamed(expr, "aut.step")
266
- );
267
- }
268
-
269
246
  decompose(input: number): Decomposition {
270
247
  const manager = this.manager;
271
248
  const mkNthUnit = (seq: number, index: number | bigint) =>
@@ -8,12 +8,12 @@ import type { ReRewriter } from "./seq-re-rewriter";
8
8
  import { isReEmpty } from "./seq-re-util";
9
9
 
10
10
  export const VIEW_FAILURE_NONE = 0;
11
- export const VIEW_FAILURE_UNSUPPORTED = 1;
11
+ const VIEW_FAILURE_UNSUPPORTED = 1;
12
12
  export const VIEW_FAILURE_BUDGET = 2;
13
13
  export const VIEW_FAILURE_RESOURCE = 3;
14
14
  export const VIEW_FAILURE_STATE_EXPANSION = 4;
15
- export const VIEW_FAILURE_NULLABILITY = 5;
16
- export const VIEW_FAILURE_GUARD = 6;
15
+ const VIEW_FAILURE_NULLABILITY = 5;
16
+ const VIEW_FAILURE_GUARD = 6;
17
17
 
18
18
  const INNER_LIMIT = 1 << 16;
19
19
  const RANGE_CACHE_CAP = 1 << 16;
@@ -24,7 +24,7 @@ interface IntervalList {
24
24
  isOk: boolean;
25
25
  }
26
26
 
27
- export interface ProductResult {
27
+ interface ProductResult {
28
28
  status: number;
29
29
  word: number;
30
30
  }