tla-ts 0.0.9 → 0.0.10

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 (390) hide show
  1. package/README.md +29 -1
  2. package/dist/compile.cjs +23 -0
  3. package/dist/compile.js +23 -0
  4. package/dist/deciders.cjs +28 -28
  5. package/dist/deciders.js +43 -43
  6. package/dist/index.cjs +1 -1
  7. package/dist/index.d.cts +72 -10
  8. package/dist/index.d.ts +72 -10
  9. package/dist/index.js +1 -1
  10. package/dist/parallel-worker.cjs +1 -1
  11. package/dist/parallel-worker.js +1 -1
  12. package/dist/prove-worker.cjs +1 -1
  13. package/dist/prove-worker.js +1 -1
  14. package/dist/prove.cjs +116 -36
  15. package/dist/prove.js +116 -36
  16. package/dist/run.cjs +143 -31
  17. package/dist/run.js +143 -31
  18. package/dist/tlapm.cjs +2 -2
  19. package/dist/tlapm.js +2 -2
  20. package/dist/transfer.cjs +128 -103
  21. package/dist/transfer.js +128 -103
  22. package/dist/worker.cjs +7 -7
  23. package/dist/worker.js +7 -7
  24. package/package.json +3 -1
  25. package/src/ast.ts +7 -21
  26. package/src/bags.ts +99 -99
  27. package/src/builtins.ts +44 -75
  28. package/src/bundled-modules.ts +1 -8
  29. package/src/check.ts +576 -300
  30. package/src/cli/options.ts +11 -6
  31. package/src/cli/run.ts +2 -2
  32. package/src/cli/runtime-invariants.ts +135 -0
  33. package/src/cli/shared.ts +20 -9
  34. package/src/cli/tlapm.ts +0 -12
  35. package/src/cli/tlc-arguments.ts +646 -0
  36. package/src/cli/tlc-usage.ts +362 -0
  37. package/src/cli/tlc.ts +538 -220
  38. package/src/cli/typescript.ts +23 -0
  39. package/src/cli/xml-exporter.ts +4 -16
  40. package/src/cli.ts +0 -1
  41. package/src/codegen.ts +191 -64
  42. package/src/config.ts +140 -109
  43. package/src/coverage.ts +837 -0
  44. package/src/dependencies.ts +6 -40
  45. package/src/dfid.ts +618 -0
  46. package/src/environment.ts +240 -118
  47. package/src/errors.ts +70 -55
  48. package/src/evaluate.ts +630 -297
  49. package/src/exit-codes.ts +37 -3
  50. package/src/fingerprints.ts +10 -10
  51. package/src/index.ts +3 -0
  52. package/src/instances.ts +79 -11
  53. package/src/java-overrides.ts +2 -12
  54. package/src/json-reader.ts +456 -0
  55. package/src/json.ts +262 -139
  56. package/src/levels.ts +2 -3
  57. package/src/lexer.ts +17 -26
  58. package/src/liveness-checker.ts +10 -18
  59. package/src/liveness.ts +121 -49
  60. package/src/obligations/action.ts +4 -28
  61. package/src/obligations/anonymize.ts +84 -80
  62. package/src/obligations/equality.ts +1 -1
  63. package/src/obligations/expression.ts +2 -19
  64. package/src/obligations/format.ts +1 -9
  65. package/src/obligations/generate.ts +1 -11
  66. package/src/obligations/index.ts +0 -11
  67. package/src/obligations/levels.ts +4 -8
  68. package/src/obligations/module.ts +1 -15
  69. package/src/obligations/normalize.ts +5 -24
  70. package/src/obligations/operators.ts +1 -2
  71. package/src/obligations/pragma.ts +1 -10
  72. package/src/obligations/printer.ts +47 -46
  73. package/src/obligations/proof.ts +1 -5
  74. package/src/obligations/regroup.ts +1 -4
  75. package/src/obligations/simplify.ts +3 -14
  76. package/src/obligations/source.ts +1 -21
  77. package/src/obligations/subexpression.ts +5 -11
  78. package/src/obligations/substitution.ts +1 -3
  79. package/src/obligations/temporal.ts +8 -14
  80. package/src/obligations/tuples.ts +3 -9
  81. package/src/parallel-worker.ts +29 -39
  82. package/src/parallel.ts +29 -13
  83. package/src/parser.ts +436 -90
  84. package/src/pcal/ast.ts +7 -28
  85. package/src/pcal/parse.ts +11 -39
  86. package/src/pcal/tokenize.ts +4 -20
  87. package/src/pcal/translate.ts +10 -42
  88. package/src/pcal/validate.ts +3 -21
  89. package/src/pretty-print.ts +1 -2
  90. package/src/prover/decide-pool.ts +5 -10
  91. package/src/prover/deciders.ts +0 -4
  92. package/src/prover/first-order.ts +0 -11
  93. package/src/prover/isabelle/decide.ts +0 -6
  94. package/src/prover/isabelle/encode.ts +11 -23
  95. package/src/prover/isabelle/isar/inner-syntax.ts +108 -114
  96. package/src/prover/isabelle/isar/method.ts +25 -38
  97. package/src/prover/isabelle/isar/proof.ts +1 -10
  98. package/src/prover/isabelle/isar/statement.ts +1 -6
  99. package/src/prover/isabelle/isar/theory.ts +15 -26
  100. package/src/prover/isabelle/isar/type-check.ts +11 -25
  101. package/src/prover/isabelle/provers/blast/blast.ts +10 -41
  102. package/src/prover/isabelle/provers/blast/branch.ts +1 -32
  103. package/src/prover/isabelle/provers/blast/prove.ts +1 -35
  104. package/src/prover/isabelle/provers/blast/rules.ts +6 -44
  105. package/src/prover/isabelle/provers/blast/state.ts +2 -28
  106. package/src/prover/isabelle/provers/blast/term.ts +9 -36
  107. package/src/prover/isabelle/provers/clasimp.ts +1 -13
  108. package/src/prover/isabelle/provers/classical.ts +14 -42
  109. package/src/prover/isabelle/provers/hypsubst.ts +11 -25
  110. package/src/prover/isabelle/pure/bicompose.ts +16 -13
  111. package/src/prover/isabelle/pure/consts.ts +1 -7
  112. package/src/prover/isabelle/pure/conv.ts +1 -9
  113. package/src/prover/isabelle/pure/drule.ts +24 -40
  114. package/src/prover/isabelle/pure/envir.ts +3 -52
  115. package/src/prover/isabelle/pure/goal.ts +1 -7
  116. package/src/prover/isabelle/pure/interrupt.ts +0 -5
  117. package/src/prover/isabelle/pure/list.ts +0 -3
  118. package/src/prover/isabelle/pure/logic.ts +1 -14
  119. package/src/prover/isabelle/pure/name.ts +2 -9
  120. package/src/prover/isabelle/pure/net.ts +3 -59
  121. package/src/prover/isabelle/pure/object-logic.ts +3 -10
  122. package/src/prover/isabelle/pure/pattern.ts +2 -19
  123. package/src/prover/isabelle/pure/raw-simplifier.ts +13 -49
  124. package/src/prover/isabelle/pure/rewriter.ts +26 -58
  125. package/src/prover/isabelle/pure/search.ts +3 -10
  126. package/src/prover/isabelle/pure/seq.ts +1 -10
  127. package/src/prover/isabelle/pure/simplifier.ts +4 -12
  128. package/src/prover/isabelle/pure/table.ts +1 -31
  129. package/src/prover/isabelle/pure/tactic.ts +12 -22
  130. package/src/prover/isabelle/pure/tactical.ts +6 -12
  131. package/src/prover/isabelle/pure/term-ord.ts +2 -6
  132. package/src/prover/isabelle/pure/term.ts +2 -43
  133. package/src/prover/isabelle/pure/thm.ts +13 -36
  134. package/src/prover/isabelle/pure/type.ts +2 -15
  135. package/src/prover/isabelle/pure/unify.ts +20 -30
  136. package/src/prover/isabelle/pure/variable.ts +3 -7
  137. package/src/prover/isabelle/tla/classical-setup.ts +9 -19
  138. package/src/prover/isabelle/tla/context.ts +8 -16
  139. package/src/prover/isabelle/tla/logic.ts +4 -11
  140. package/src/prover/isabelle/tla/simpdata.ts +46 -34
  141. package/src/prover/isabelle/tools/intuitionistic.ts +1 -10
  142. package/src/prover/ocaml.ts +0 -6
  143. package/src/prover/prep/action.ts +4 -36
  144. package/src/prover/prep/enabled-axioms.ts +12 -19
  145. package/src/prover/prep/fingerprint.ts +0 -16
  146. package/src/prover/prep/level-comparison.ts +8 -12
  147. package/src/prover/prep/md5.ts +0 -2
  148. package/src/prover/prep/methods.ts +9 -36
  149. package/src/prover/prep/normalize.ts +4 -28
  150. package/src/prover/prove-worker.ts +0 -2
  151. package/src/prover/prove.ts +0 -36
  152. package/src/prover/ptl/decide.ts +7 -12
  153. package/src/prover/ptl/encode.ts +14 -36
  154. package/src/prover/ptl/sat.ts +24 -32
  155. package/src/prover/ptl/tableau.ts +12 -26
  156. package/src/prover/smt/axioms.ts +0 -7
  157. package/src/prover/smt/context.ts +19 -26
  158. package/src/prover/smt/data.ts +51 -54
  159. package/src/prover/smt/encode.ts +14 -35
  160. package/src/prover/smt/extensionality.ts +0 -10
  161. package/src/prover/smt/flatten.ts +3 -22
  162. package/src/prover/smt/format.ts +5 -10
  163. package/src/prover/smt/instances.ts +0 -10
  164. package/src/prover/smt/rewrite.ts +66 -101
  165. package/src/prover/smt/solver/act-cache.ts +0 -15
  166. package/src/prover/smt/solver/arith-rewriter.ts +3 -48
  167. package/src/prover/smt/solver/array.ts +1 -3
  168. package/src/prover/smt/solver/asserted-formulas.ts +1 -43
  169. package/src/prover/smt/solver/ast-lt.ts +1 -11
  170. package/src/prover/smt/solver/ast-util.ts +1 -6
  171. package/src/prover/smt/solver/ast.ts +1 -143
  172. package/src/prover/smt/solver/auf-solver.ts +6 -39
  173. package/src/prover/smt/solver/case-split-queue.ts +1 -9
  174. package/src/prover/smt/solver/cg-table.ts +1 -18
  175. package/src/prover/smt/solver/clause.ts +1 -27
  176. package/src/prover/smt/solver/conflict-resolution.ts +0 -9
  177. package/src/prover/smt/solver/context.ts +4 -61
  178. package/src/prover/smt/solver/ctx-simplify.ts +14 -41
  179. package/src/prover/smt/solver/der.ts +2 -21
  180. package/src/prover/smt/solver/dyn-ack.ts +1 -11
  181. package/src/prover/smt/solver/e-matching.ts +3 -34
  182. package/src/prover/smt/solver/enode.ts +1 -21
  183. package/src/prover/smt/solver/expr-ref.ts +1 -5
  184. package/src/prover/smt/solver/expr-safe-replace.ts +0 -5
  185. package/src/prover/smt/solver/fingerprints.ts +1 -12
  186. package/src/prover/smt/solver/flat-literals.ts +1 -9
  187. package/src/prover/smt/solver/goal.ts +2 -14
  188. package/src/prover/smt/solver/hash.ts +0 -8
  189. package/src/prover/smt/solver/hashtable.ts +1 -12
  190. package/src/prover/smt/solver/internalizer.ts +6 -98
  191. package/src/prover/smt/solver/lbool.ts +1 -2
  192. package/src/prover/smt/solver/literal.ts +0 -3
  193. package/src/prover/smt/solver/lp/bound-propagator.ts +8 -26
  194. package/src/prover/smt/solver/lp/constraints.ts +2 -8
  195. package/src/prover/smt/solver/lp/containers.ts +12 -30
  196. package/src/prover/smt/solver/lp/core-solver.ts +10 -31
  197. package/src/prover/smt/solver/lp/cross-nested.ts +6 -20
  198. package/src/prover/smt/solver/lp/dep-intervals.ts +7 -22
  199. package/src/prover/smt/solver/lp/dependency.ts +1 -4
  200. package/src/prover/smt/solver/lp/dioph-eq.ts +12 -98
  201. package/src/prover/smt/solver/lp/explanation.ts +1 -6
  202. package/src/prover/smt/solver/lp/gomory.ts +9 -22
  203. package/src/prover/smt/solver/lp/hnf-cutter.ts +17 -23
  204. package/src/prover/smt/solver/lp/hnf.ts +11 -26
  205. package/src/prover/smt/solver/lp/int-cube.ts +15 -36
  206. package/src/prover/smt/solver/lp/int-solver.ts +4 -34
  207. package/src/prover/smt/solver/lp/lar-solver.ts +32 -81
  208. package/src/prover/smt/solver/lp/lar-term.ts +1 -5
  209. package/src/prover/smt/solver/lp/lp-settings.ts +1 -14
  210. package/src/prover/smt/solver/lp/maximize-term.ts +20 -45
  211. package/src/prover/smt/solver/lp/nex-creator.ts +5 -28
  212. package/src/prover/smt/solver/lp/nex.ts +1 -6
  213. package/src/prover/smt/solver/lp/nla-backoff.ts +1 -4
  214. package/src/prover/smt/solver/lp/nla-basics.ts +5 -30
  215. package/src/prover/smt/solver/lp/nla-core.ts +35 -130
  216. package/src/prover/smt/solver/lp/nla-divisions.ts +32 -42
  217. package/src/prover/smt/solver/lp/nla-emonics.ts +4 -21
  218. package/src/prover/smt/solver/lp/nla-factorization.ts +1 -4
  219. package/src/prover/smt/solver/lp/nla-grobner.ts +15 -69
  220. package/src/prover/smt/solver/lp/nla-horner.ts +3 -11
  221. package/src/prover/smt/solver/lp/nla-intervals.ts +2 -12
  222. package/src/prover/smt/solver/lp/nla-monomial-bounds.ts +16 -41
  223. package/src/prover/smt/solver/lp/nla-monotone.ts +2 -6
  224. package/src/prover/smt/solver/lp/nla-order.ts +2 -13
  225. package/src/prover/smt/solver/lp/nla-patcher.ts +4 -7
  226. package/src/prover/smt/solver/lp/nla-tangents.ts +1 -9
  227. package/src/prover/smt/solver/lp/nla-throttle.ts +1 -6
  228. package/src/prover/smt/solver/lp/nla-types.ts +1 -11
  229. package/src/prover/smt/solver/lp/nla-var-eqs.ts +4 -25
  230. package/src/prover/smt/solver/lp/nra-solver.ts +5 -52
  231. package/src/prover/smt/solver/lp/numeric-pair.ts +1 -4
  232. package/src/prover/smt/solver/lp/pdd-interval.ts +1 -3
  233. package/src/prover/smt/solver/lp/pdd-simplifier.ts +2 -14
  234. package/src/prover/smt/solver/lp/pdd-solver.ts +4 -33
  235. package/src/prover/smt/solver/lp/pdd.ts +7 -70
  236. package/src/prover/smt/solver/lp/random-updater.ts +1 -8
  237. package/src/prover/smt/solver/lp/static-matrix.ts +9 -19
  238. package/src/prover/smt/solver/lp/union-find.ts +1 -6
  239. package/src/prover/smt/solver/mam-compiler.ts +14 -56
  240. package/src/prover/smt/solver/mam-interpreter.ts +1 -21
  241. package/src/prover/smt/solver/maximize-ac-sharing.ts +2 -17
  242. package/src/prover/smt/solver/model-checker.ts +2 -36
  243. package/src/prover/smt/solver/model-evaluator.ts +3 -29
  244. package/src/prover/smt/solver/model-finder.ts +3 -15
  245. package/src/prover/smt/solver/model-generator.ts +1 -12
  246. package/src/prover/smt/solver/model-macro-solver.ts +12 -69
  247. package/src/prover/smt/solver/nlsat/algebraic.ts +55 -151
  248. package/src/prover/smt/solver/nlsat/atoms.ts +5 -19
  249. package/src/prover/smt/solver/nlsat/evaluator.ts +17 -22
  250. package/src/prover/smt/solver/nlsat/explain.ts +3 -47
  251. package/src/prover/smt/solver/nlsat/interval-set.ts +9 -50
  252. package/src/prover/smt/solver/nlsat/levelwise.ts +48 -129
  253. package/src/prover/smt/solver/nlsat/mpbq.ts +3 -14
  254. package/src/prover/smt/solver/nlsat/polynomial.ts +17 -156
  255. package/src/prover/smt/solver/nlsat/solver.ts +7 -67
  256. package/src/prover/smt/solver/nlsat/types.ts +1 -8
  257. package/src/prover/smt/solver/nlsat/upolynomial-factorization.ts +1 -44
  258. package/src/prover/smt/solver/nlsat/upolynomial.ts +11 -92
  259. package/src/prover/smt/solver/nnf.ts +3 -38
  260. package/src/prover/smt/solver/pattern-inference.ts +2 -15
  261. package/src/prover/smt/solver/poly-rewriter.ts +3 -23
  262. package/src/prover/smt/solver/propagate-values.ts +1 -10
  263. package/src/prover/smt/solver/proto-model.ts +3 -48
  264. package/src/prover/smt/solver/pull-quant.ts +1 -12
  265. package/src/prover/smt/solver/qe-lite-der.ts +1 -29
  266. package/src/prover/smt/solver/qe-lite-fm.ts +2 -25
  267. package/src/prover/smt/solver/qe-lite.ts +3 -33
  268. package/src/prover/smt/solver/qi-queue.ts +1 -16
  269. package/src/prover/smt/solver/quant-tactics.ts +5 -22
  270. package/src/prover/smt/solver/quantifier-analyzer.ts +17 -37
  271. package/src/prover/smt/solver/quantifier-manager.ts +1 -8
  272. package/src/prover/smt/solver/random-gen.ts +1 -2
  273. package/src/prover/smt/solver/rational.ts +1 -8
  274. package/src/prover/smt/solver/ref-vector.ts +1 -6
  275. package/src/prover/smt/solver/relevancy.ts +2 -15
  276. package/src/prover/smt/solver/rewriter-tpl.ts +3 -147
  277. package/src/prover/smt/solver/rewriter.ts +3 -85
  278. package/src/prover/smt/solver/rlimit.ts +2 -20
  279. package/src/prover/smt/solver/smtlib-parser.ts +2 -37
  280. package/src/prover/smt/solver/solver.ts +23 -34
  281. package/src/prover/smt/solver/sort.ts +1 -5
  282. package/src/prover/smt/solver/sticky-generations.ts +0 -5
  283. package/src/prover/smt/solver/theory-lra-axioms.ts +3 -24
  284. package/src/prover/smt/solver/theory-lra-bounds.ts +0 -5
  285. package/src/prover/smt/solver/theory-lra-final-check.ts +4 -22
  286. package/src/prover/smt/solver/theory-lra-internalize.ts +1 -27
  287. package/src/prover/smt/solver/theory-lra-model.ts +4 -19
  288. package/src/prover/smt/solver/theory-lra-propagate.ts +1 -15
  289. package/src/prover/smt/solver/theory-lra-state.ts +3 -8
  290. package/src/prover/smt/solver/theory-lra.ts +1 -8
  291. package/src/prover/smt/solver/var-subst.ts +2 -26
  292. package/src/prover/smt/table.ts +0 -8
  293. package/src/prover/tlapm/cache.ts +20 -25
  294. package/src/prover/tlapm/ocaml-marshal.ts +19 -21
  295. package/src/prover/tlapm/tlapm.ts +12 -17
  296. package/src/prover/verdict.ts +0 -2
  297. package/src/prover/zenon/check/check.ts +0 -9
  298. package/src/prover/zenon/check/definitions.ts +5 -15
  299. package/src/prover/zenon/check/equality.ts +0 -8
  300. package/src/prover/zenon/check/functions.ts +0 -4
  301. package/src/prover/zenon/check/keys.ts +0 -7
  302. package/src/prover/zenon/check/propositional.ts +0 -3
  303. package/src/prover/zenon/check/records.ts +0 -5
  304. package/src/prover/zenon/check/relations.ts +0 -13
  305. package/src/prover/zenon/check/rewrites.ts +0 -6
  306. package/src/prover/zenon/check/sets.ts +0 -3
  307. package/src/prover/zenon/check/terms.ts +0 -17
  308. package/src/prover/zenon/check/tla.ts +0 -6
  309. package/src/prover/zenon/decide.ts +0 -12
  310. package/src/prover/zenon/encode.ts +1 -8
  311. package/src/prover/zenon/eqrel.ts +0 -13
  312. package/src/prover/zenon/equality-rules.ts +0 -4
  313. package/src/prover/zenon/expr.ts +1 -26
  314. package/src/prover/zenon/index-table.ts +17 -38
  315. package/src/prover/zenon/isar-case.ts +9 -19
  316. package/src/prover/zenon/isar.ts +1 -29
  317. package/src/prover/zenon/limits.ts +0 -4
  318. package/src/prover/zenon/llproof.ts +0 -9
  319. package/src/prover/zenon/mltoll.ts +54 -76
  320. package/src/prover/zenon/node.ts +1 -11
  321. package/src/prover/zenon/ocaml.ts +1 -17
  322. package/src/prover/zenon/parse.ts +2 -7
  323. package/src/prover/zenon/phrase.ts +1 -11
  324. package/src/prover/zenon/proof.ts +0 -9
  325. package/src/prover/zenon/propositional-rules.ts +0 -5
  326. package/src/prover/zenon/rules.ts +2 -6
  327. package/src/prover/zenon/search.ts +1 -17
  328. package/src/prover/zenon/tla/functions.ts +57 -29
  329. package/src/prover/zenon/tla/llproof.ts +63 -70
  330. package/src/prover/zenon/tla/records.ts +56 -27
  331. package/src/prover/zenon/tla/rewrites.ts +12 -19
  332. package/src/prover/zenon/tla/sets.ts +68 -39
  333. package/src/prover/zenon/tla/terms.ts +0 -6
  334. package/src/prover/zenon/tla/tla.ts +59 -58
  335. package/src/randomization.ts +84 -35
  336. package/src/resolve.ts +18 -60
  337. package/src/runtime.ts +11 -4
  338. package/src/sany/builtins.ts +3 -4
  339. package/src/sany/generator.ts +119 -169
  340. package/src/sany/levels.ts +6 -30
  341. package/src/sany/lexer.ts +7 -23
  342. package/src/sany/linter.ts +1 -8
  343. package/src/sany/modules.ts +1 -5
  344. package/src/sany/nodes.ts +0 -31
  345. package/src/sany/parse-error.ts +39 -117
  346. package/src/sany/report.ts +29 -63
  347. package/src/sany/selectors.ts +15 -39
  348. package/src/sany/source.ts +1 -17
  349. package/src/sany/xml.ts +13 -63
  350. package/src/search.ts +494 -154
  351. package/src/simulate.ts +694 -0
  352. package/src/spec-description.ts +166 -48
  353. package/src/standard-definitions.ts +2 -3
  354. package/src/standard-modules.ts +264 -68
  355. package/src/state-graph.ts +51 -18
  356. package/src/subexpressions.ts +31 -5
  357. package/src/substitution-levels.ts +2 -3
  358. package/src/successors.ts +267 -77
  359. package/src/symmetry.ts +31 -8
  360. package/src/tableau.ts +27 -24
  361. package/src/tlc/fingerprint.ts +183 -61
  362. package/src/tlc/jar-data.ts +113 -6
  363. package/src/tlc/messages.ts +122 -37
  364. package/src/tlc/order.ts +33 -38
  365. package/src/tlc/random.ts +16 -16
  366. package/src/tlc/replay.ts +563 -211
  367. package/src/tlc/summary.ts +2 -4
  368. package/src/tlc/tlc-operators.ts +81 -36
  369. package/src/tlc/tlcext-operators.ts +138 -117
  370. package/src/tlc/trace-spec.ts +273 -0
  371. package/src/tlc/value-stream.ts +143 -0
  372. package/src/tlc/version.ts +2 -4
  373. package/src/transfer.ts +22 -25
  374. package/src/typescript/actions.ts +481 -0
  375. package/src/typescript/collections.ts +600 -0
  376. package/src/typescript/compile.ts +65 -0
  377. package/src/typescript/context.ts +94 -0
  378. package/src/typescript/emit.ts +121 -0
  379. package/src/typescript/expressions.ts +496 -0
  380. package/src/typescript/formula.ts +152 -0
  381. package/src/typescript/functions.ts +284 -0
  382. package/src/typescript/model.ts +163 -0
  383. package/src/typescript/names.ts +114 -0
  384. package/src/typescript/program.ts +48 -0
  385. package/src/typescript/properties.ts +139 -0
  386. package/src/typescript/scope.ts +112 -0
  387. package/src/typescript/steps.ts +165 -0
  388. package/src/typescript/types.ts +171 -0
  389. package/src/values.ts +826 -276
  390. package/src/worker.ts +7 -8
@@ -0,0 +1,837 @@
1
+ import {
2
+ isLocallyResolved,
3
+ type Bound,
4
+ type Definition,
5
+ type Expression,
6
+ type SourceLocation,
7
+ type SourceRange,
8
+ } from "./ast";
9
+ import { formatRange } from "./errors";
10
+ import type { Environment, Scope } from "./evaluate";
11
+ import { getTlcFingerprint } from "./tlc/fingerprint";
12
+ import type { Value } from "./values";
13
+
14
+ export type CoverageKind = "init" | "next" | "invariant" | "constraint" | "implied";
15
+
16
+ interface CoverageRelation {
17
+ kind: CoverageKind;
18
+ label: string;
19
+ expression: Expression;
20
+ scope: Scope | undefined;
21
+ node: number;
22
+ }
23
+
24
+ export interface Coverage {
25
+ current: number;
26
+ expressions: (Expression | undefined)[];
27
+ ranges: (SourceRange | undefined)[];
28
+ firstChild: number[];
29
+ lastChild: number[];
30
+ nextSibling: number[];
31
+ prefixes: number[];
32
+ isPart: boolean[];
33
+ isPrimed: boolean[];
34
+ isUnchanged: boolean[];
35
+ recursive: number[];
36
+ lets: (number[] | undefined)[];
37
+ roots: number[];
38
+ primary: number[];
39
+ secondary: number[];
40
+ covered: WeakSet<Expression>;
41
+ values: WeakMap<object, number>;
42
+ registers: Uint8Array;
43
+ relations: CoverageRelation[];
44
+ }
45
+
46
+ export interface CoverageReport {
47
+ variables: CoverageVariable[];
48
+ relations: CoverageRelationReport[];
49
+ }
50
+
51
+ interface CoverageVariable {
52
+ label: string;
53
+ distinct: number;
54
+ }
55
+
56
+ interface CoverageRelationReport {
57
+ kind: CoverageKind;
58
+ label: string;
59
+ distinct: number;
60
+ generated: number;
61
+ expressions: CoverageExpression[];
62
+ }
63
+
64
+ interface CoverageExpression {
65
+ location: string;
66
+ depth: number;
67
+ count: number;
68
+ cost: number;
69
+ }
70
+
71
+ interface Local {
72
+ name: string;
73
+ definition: Definition | undefined;
74
+ scope: Local | undefined;
75
+ parent: Local | undefined;
76
+ }
77
+
78
+ interface Resolved {
79
+ definition: Definition;
80
+ scope: Local | undefined;
81
+ }
82
+
83
+ const STANDARD_MODULES = new Set([
84
+ "FiniteSets",
85
+ "Sequences",
86
+ "Bags",
87
+ "Naturals",
88
+ "Integers",
89
+ "Reals",
90
+ "RealTime",
91
+ "Randomization",
92
+ "TLC",
93
+ ]);
94
+
95
+ const REGISTER_BITS = 10;
96
+ const REGISTERS = 1 << REGISTER_BITS;
97
+
98
+ export const createCoverage = (variableCount: number): Coverage => ({
99
+ current: -1,
100
+ expressions: [],
101
+ ranges: [],
102
+ firstChild: [],
103
+ lastChild: [],
104
+ nextSibling: [],
105
+ prefixes: [],
106
+ isPart: [],
107
+ isPrimed: [],
108
+ isUnchanged: [],
109
+ recursive: [],
110
+ lets: [],
111
+ roots: [],
112
+ primary: [],
113
+ secondary: [],
114
+ covered: new WeakSet(),
115
+ values: new WeakMap(),
116
+ registers: new Uint8Array(variableCount * REGISTERS),
117
+ relations: [],
118
+ });
119
+
120
+ const addNode = (
121
+ coverage: Coverage,
122
+ expression: Expression | undefined,
123
+ range: SourceRange | undefined,
124
+ parent: number,
125
+ isPart: boolean,
126
+ ) => {
127
+ const node = coverage.expressions.length;
128
+ coverage.expressions.push(expression);
129
+ coverage.ranges.push(range);
130
+ coverage.firstChild.push(-1);
131
+ coverage.lastChild.push(-1);
132
+ coverage.nextSibling.push(-1);
133
+ coverage.prefixes.push(-1);
134
+ coverage.isPart.push(isPart);
135
+ coverage.isPrimed.push(false);
136
+ coverage.isUnchanged.push(expression?.kind === "Unchanged");
137
+ coverage.recursive.push(-1);
138
+ coverage.lets.push(undefined);
139
+ coverage.roots.push(parent === -1 ? node : coverage.roots[parent]);
140
+ coverage.primary.push(0);
141
+ coverage.secondary.push(0);
142
+ if (expression) coverage.covered.add(expression);
143
+ if (parent === -1) return node;
144
+ const last = coverage.lastChild[parent];
145
+ if (last === -1) coverage.firstChild[parent] = node;
146
+ if (last !== -1) coverage.nextSibling[last] = node;
147
+ coverage.lastChild[parent] = node;
148
+ return node;
149
+ };
150
+
151
+ const findCoverageRelation = (coverage: Coverage, kind: CoverageKind, expression: Expression) =>
152
+ coverage.relations.find(
153
+ (relation) => relation.kind === kind && relation.expression === expression,
154
+ )?.node;
155
+
156
+ export const addCoverageRelation = (
157
+ coverage: Coverage,
158
+ kind: CoverageKind,
159
+ label: string,
160
+ expression: Expression,
161
+ scope?: Scope,
162
+ ) => {
163
+ const shared = kind === "next" ? findCoverageRelation(coverage, kind, expression) : undefined;
164
+ if (shared !== undefined) return shared;
165
+ const node = addNode(coverage, undefined, expression.location.range, -1, false);
166
+ coverage.relations.push({ kind, label, expression, scope, node });
167
+ return node;
168
+ };
169
+
170
+ const isSameRange = (left: SourceRange | undefined, right: SourceRange | undefined) =>
171
+ left !== undefined &&
172
+ right !== undefined &&
173
+ left.module === right.module &&
174
+ left.start.line === right.start.line &&
175
+ left.start.column === right.start.column &&
176
+ left.end.line === right.end.line &&
177
+ left.end.column === right.end.column;
178
+
179
+ export const getCoverageLabel = (
180
+ name: string | undefined,
181
+ expression: Expression,
182
+ environment: Environment,
183
+ ) => {
184
+ const definition = name === undefined ? undefined : environment.definitions.get(name);
185
+ const head = definition?.kind === "Operator" ? definition.head : undefined;
186
+ const range = expression.location.range;
187
+ if (!definition || !head) return `Action ${range ? formatRange(range) : "Unknown location"}`;
188
+ if (isSameRange(definition.body.location.range, range) || !range) {
189
+ return `${definition.name} ${formatRange(head)}`;
190
+ }
191
+ return `${definition.name} ${formatRange(head)} (${range.start.line} ${range.start.column} ${range.end.line} ${range.end.column})`;
192
+ };
193
+
194
+ const getRangeKey = (range: SourceRange) =>
195
+ `${range.module}:${range.start.line}:${range.start.column}:${range.end.line}:${range.end.column}`;
196
+
197
+ const spanRanges = (first: SourceRange | undefined, last: SourceRange | undefined) =>
198
+ first && last ? { module: first.module, start: first.start, end: last.end } : undefined;
199
+
200
+ const getStartRange = (location: SourceLocation, last: SourceRange | undefined) =>
201
+ last && {
202
+ module: last.module,
203
+ start: location.range?.start ?? { line: location.line, column: location.column },
204
+ end: last.end,
205
+ };
206
+
207
+ const getJavaHashCode = (text: string) =>
208
+ Array.from({ length: text.length }, (_value, index) => text.charCodeAt(index)).reduce(
209
+ (hash, code) => (Math.imul(hash, 31) + code) | 0,
210
+ 0,
211
+ ) & 0x7fffffff;
212
+
213
+ const getHashtableOrder = (definitions: Definition[]) => {
214
+ let buckets = Array.from({ length: 11 }, (): Definition[] => []);
215
+ definitions.forEach((definition, count) => {
216
+ if (count >= Math.floor(buckets.length * 0.75)) {
217
+ const grown = Array.from({ length: buckets.length * 2 + 1 }, (): Definition[] => []);
218
+ for (let index = buckets.length - 1; index >= 0; index--) {
219
+ buckets[index].forEach((entry) =>
220
+ grown[getJavaHashCode(entry.name) % grown.length].unshift(entry),
221
+ );
222
+ }
223
+ buckets = grown;
224
+ }
225
+ buckets[getJavaHashCode(definition.name) % buckets.length].unshift(definition);
226
+ });
227
+ return buckets.toReversed().flat();
228
+ };
229
+
230
+ const getBoundSets = (bounds: Bound[]) =>
231
+ bounds.flatMap((bound, index) =>
232
+ index > 0 && bounds[index - 1].set === bound.set ? [] : [bound.set],
233
+ );
234
+
235
+ const bindNames = (names: string[], locals: Local | undefined) =>
236
+ names.reduce<Local | undefined>(
237
+ (parent, name) => ({ name, definition: undefined, scope: undefined, parent }),
238
+ locals,
239
+ );
240
+
241
+ const getBoundNames = (bounds: Bound[]) =>
242
+ bounds.flatMap((bound) =>
243
+ bound.pattern.kind === "Name" ? [bound.pattern.name] : bound.pattern.names,
244
+ );
245
+
246
+ export const buildCoverage = (
247
+ coverage: Coverage,
248
+ environment: Environment,
249
+ primedRanges: SourceRange[],
250
+ ) => {
251
+ const primed = new Set(primedRanges.map(getRangeKey));
252
+ const stack: number[] = [];
253
+ const definitions: (Definition | undefined)[] = [];
254
+ const walking: Definition[] = [];
255
+ const letBodies = new Map<Expression, Expression>();
256
+
257
+ const resolve = (expression: Expression, name: string, locals: Local | undefined) => {
258
+ if (isLocallyResolved(expression)) {
259
+ for (let local = locals; local; local = local.parent) {
260
+ if (local.name !== name) continue;
261
+ return local.definition && { definition: local.definition, scope: local.scope };
262
+ }
263
+ return undefined;
264
+ }
265
+ const target = environment.substitutions.get(name) ?? name;
266
+ if (environment.variableIndex.has(target) || environment.constants.has(target)) {
267
+ return undefined;
268
+ }
269
+ const definition = environment.definitions.get(target);
270
+ const module = definition?.location.range?.module ?? definition?.body.location.range?.module;
271
+ return definition && !STANDARD_MODULES.has(module ?? "")
272
+ ? { definition, scope: undefined }
273
+ : undefined;
274
+ };
275
+
276
+ const enter = (
277
+ expression: Expression | undefined,
278
+ range: SourceRange | undefined,
279
+ walkChildren: () => void,
280
+ isPart = false,
281
+ definition?: Definition,
282
+ ) => {
283
+ const node = addNode(coverage, expression, range, stack.at(-1) ?? -1, isPart);
284
+ coverage.isPrimed[node] = range !== undefined && primed.has(getRangeKey(range));
285
+ const body = expression && letBodies.get(expression);
286
+ if (body) {
287
+ stack.forEach((outer) => {
288
+ if (coverage.expressions[outer] === body) (coverage.lets[outer] ??= []).push(node);
289
+ });
290
+ }
291
+ if (definition?.kind === "Operator" && definition.isRecursive) {
292
+ const outer = stack.findLast((item) => definitions[item] === definition);
293
+ if (outer !== undefined) coverage.recursive[node] = outer;
294
+ }
295
+ definitions[node] = definition;
296
+ stack.push(node);
297
+ walkChildren();
298
+ stack.pop();
299
+ return node;
300
+ };
301
+
302
+ const walkDefinition = (resolved: Resolved) => {
303
+ const definition = resolved.definition;
304
+ if (walking.includes(definition)) return;
305
+ walking.push(definition);
306
+ const names =
307
+ definition.kind === "Function"
308
+ ? getBoundNames(definition.bounds)
309
+ : definition.params.map((param) => param.name);
310
+ walk(definition.body, bindNames(names, resolved.scope));
311
+ if (definition.kind === "Function") {
312
+ getBoundSets(definition.bounds).forEach((set) => walk(set, resolved.scope));
313
+ }
314
+ walking.pop();
315
+ };
316
+
317
+ const hasParams = (resolved: Resolved | undefined) =>
318
+ resolved?.definition.kind === "Operator" && resolved.definition.params.length > 0;
319
+
320
+ const walkArgument = (
321
+ argument: Expression,
322
+ index: number,
323
+ callee: Definition | undefined,
324
+ locals: Local | undefined,
325
+ ) => {
326
+ if (argument.kind === "Lambda") {
327
+ walk(argument.body, bindNames(argument.params, locals));
328
+ return;
329
+ }
330
+ if (argument.kind === "Identifier") {
331
+ const resolved = resolve(argument, argument.name, locals);
332
+ const isOperator =
333
+ (callee?.kind === "Operator" && (callee.params[index]?.arity ?? 0) > 0) ||
334
+ hasParams(resolved);
335
+ if (isOperator) {
336
+ if (resolved) walkDefinition(resolved);
337
+ return;
338
+ }
339
+ }
340
+ walk(argument, locals);
341
+ };
342
+
343
+ const walkJunction = (
344
+ expression: Expression & { kind: "And" | "Or" },
345
+ count: number,
346
+ range: SourceRange | undefined,
347
+ locals: Local | undefined,
348
+ ): number =>
349
+ enter(
350
+ count === expression.operands.length ? expression : undefined,
351
+ range,
352
+ () => {
353
+ const operands = expression.operands;
354
+ if (count > 2 && !expression.isBulleted) {
355
+ const end = expression.prefixEnds?.[count - 3];
356
+ const prefix = walkJunction(
357
+ expression,
358
+ count - 1,
359
+ range && end ? { ...range, end } : range,
360
+ locals,
361
+ );
362
+ coverage.prefixes[stack.at(-1) ?? -1] = prefix;
363
+ walk(operands[count - 1], locals);
364
+ return;
365
+ }
366
+ operands.slice(0, count).forEach((operand) => walk(operand, locals));
367
+ },
368
+ count < expression.operands.length,
369
+ );
370
+
371
+ const walk = (expression: Expression, locals: Local | undefined): void => {
372
+ const range = expression.location.range;
373
+ const walkAll = (expressions: Expression[]) =>
374
+ expressions.forEach((item) => walk(item, locals));
375
+ switch (expression.kind) {
376
+ case "Number":
377
+ case "Decimal":
378
+ case "String":
379
+ case "ExceptAt":
380
+ case "Bracket":
381
+ case "Subexpression":
382
+ case "OperatorReference":
383
+ return;
384
+ case "Label":
385
+ walk(expression.body, bindNames(expression.params, locals));
386
+ return;
387
+ case "Lambda":
388
+ walk(expression.body, bindNames(expression.params, locals));
389
+ return;
390
+ case "Let": {
391
+ const inner = expression.definitions.reduce<Local | undefined>(
392
+ (parent, definition) => ({ name: definition.name, definition, scope: undefined, parent }),
393
+ locals,
394
+ );
395
+ for (let local = inner; local !== locals && local; local = local.parent) {
396
+ local.scope = inner;
397
+ }
398
+ expression.definitions.forEach((definition) => {
399
+ if (definition.kind === "Operator") letBodies.set(definition.body, expression.body);
400
+ });
401
+ getHashtableOrder(expression.definitions).forEach((definition) =>
402
+ walkDefinition({ definition, scope: inner }),
403
+ );
404
+ walk(expression.body, inner);
405
+ return;
406
+ }
407
+ case "Identifier": {
408
+ const resolved = resolve(expression, expression.name, locals);
409
+ enter(
410
+ expression,
411
+ range,
412
+ () => {
413
+ if (resolved) walkDefinition(resolved);
414
+ },
415
+ false,
416
+ resolved?.definition,
417
+ );
418
+ return;
419
+ }
420
+ case "Apply": {
421
+ const resolved = resolve(expression, expression.operator, locals);
422
+ enter(
423
+ expression,
424
+ range,
425
+ () => {
426
+ if (resolved) walkDefinition(resolved);
427
+ expression.args.forEach((argument, index) =>
428
+ walkArgument(argument, index, resolved?.definition, locals),
429
+ );
430
+ },
431
+ false,
432
+ resolved?.definition,
433
+ );
434
+ return;
435
+ }
436
+ case "And":
437
+ case "Or":
438
+ walkJunction(expression, expression.operands.length, range, locals);
439
+ return;
440
+ case "Case":
441
+ enter(expression, range, () => {
442
+ expression.arms.forEach((arm) =>
443
+ enter(
444
+ undefined,
445
+ spanRanges(arm.condition.location.range, arm.body.location.range),
446
+ () => walkAll([arm.condition, arm.body]),
447
+ true,
448
+ ),
449
+ );
450
+ const other = expression.other;
451
+ if (other) enter(undefined, expression.otherRange, () => walk(other, locals), true);
452
+ });
453
+ return;
454
+ case "Record":
455
+ case "RecordSet":
456
+ enter(expression, range, () =>
457
+ expression.fields.forEach((field) =>
458
+ enter(
459
+ undefined,
460
+ getStartRange(field.location, field.value.location.range),
461
+ () => walk(field.value, locals),
462
+ true,
463
+ ),
464
+ ),
465
+ );
466
+ return;
467
+ case "FunctionApplication":
468
+ enter(expression, range, () => {
469
+ walk(expression.function, locals);
470
+ const args = expression.args;
471
+ if (args.length === 1) walk(args[0], locals);
472
+ else {
473
+ enter(
474
+ undefined,
475
+ spanRanges(args[0]?.location.range, args.at(-1)?.location.range),
476
+ () => walkAll(args),
477
+ true,
478
+ );
479
+ }
480
+ });
481
+ return;
482
+ case "Forall":
483
+ case "Exists":
484
+ case "FunctionConstruction":
485
+ enter(expression, range, () => {
486
+ walk(expression.body, bindNames(getBoundNames(expression.bounds), locals));
487
+ walkAll(getBoundSets(expression.bounds));
488
+ });
489
+ return;
490
+ case "SetMap":
491
+ enter(expression, range, () => {
492
+ walk(expression.expression, bindNames(getBoundNames(expression.bounds), locals));
493
+ walkAll(getBoundSets(expression.bounds));
494
+ });
495
+ return;
496
+ case "SetFilter":
497
+ enter(expression, range, () => {
498
+ walk(expression.predicate, bindNames(getBoundNames([expression.bound]), locals));
499
+ walk(expression.bound.set, locals);
500
+ });
501
+ return;
502
+ case "Choose":
503
+ enter(expression, range, () => {
504
+ const pattern = expression.pattern;
505
+ walk(
506
+ expression.body,
507
+ bindNames(pattern.kind === "Name" ? [pattern.name] : pattern.names, locals),
508
+ );
509
+ if (expression.set) walk(expression.set, locals);
510
+ });
511
+ return;
512
+ case "UnboundedQuantifier":
513
+ enter(expression, range, () => walk(expression.body, bindNames(expression.names, locals)));
514
+ return;
515
+ case "Except":
516
+ enter(expression, range, () => {
517
+ walk(expression.function, locals);
518
+ expression.updates.forEach((update) => {
519
+ update.path.forEach((step) => {
520
+ if (step.kind === "Index") walkAll(step.args);
521
+ });
522
+ walk(update.value, locals);
523
+ });
524
+ });
525
+ return;
526
+ case "Prime":
527
+ case "Unchanged":
528
+ case "Enabled":
529
+ case "Always":
530
+ case "Eventually":
531
+ enter(expression, range, () => walk(expression.expression, locals));
532
+ return;
533
+ case "If":
534
+ enter(expression, range, () =>
535
+ walkAll([expression.condition, expression.consequent, expression.alternative]),
536
+ );
537
+ return;
538
+ case "SetEnumeration":
539
+ case "Tuple":
540
+ enter(expression, range, () => walkAll(expression.elements));
541
+ return;
542
+ case "Product":
543
+ enter(expression, range, () => walkAll(expression.factors));
544
+ return;
545
+ case "FunctionSet":
546
+ enter(expression, range, () => walkAll([expression.domain, expression.range]));
547
+ return;
548
+ case "FieldAccess":
549
+ enter(expression, range, () => walk(expression.record, locals));
550
+ return;
551
+ case "BoxAction":
552
+ case "AngleAction":
553
+ enter(expression, range, () => walkAll([expression.action, expression.subscript]));
554
+ return;
555
+ case "WeakFairness":
556
+ case "StrongFairness":
557
+ enter(expression, range, () => walkAll([expression.subscript, expression.action]));
558
+ }
559
+ };
560
+
561
+ coverage.relations.forEach((relation) => {
562
+ stack.push(relation.node);
563
+ walk(relation.expression, undefined);
564
+ stack.pop();
565
+ });
566
+ };
567
+
568
+ const findChild = (coverage: Coverage, node: number, expression: Expression): number => {
569
+ for (let child = coverage.firstChild[node]; child !== -1; child = coverage.nextSibling[child]) {
570
+ if (coverage.expressions[child] === expression) return child;
571
+ if (coverage.isPart[child]) {
572
+ const found = findChild(coverage, child, expression);
573
+ if (found !== -1) return found;
574
+ }
575
+ }
576
+ return -1;
577
+ };
578
+
579
+ export const getCoverageNode = (coverage: Coverage, node: number, expression: Expression) => {
580
+ if (coverage.expressions[node] === expression) return node;
581
+ const child = findChild(coverage, node, expression);
582
+ if (child !== -1) return child;
583
+ const recursive = coverage.recursive[node];
584
+ const inner = recursive === -1 ? -1 : findChild(coverage, recursive, expression);
585
+ if (inner !== -1) return inner;
586
+ return coverage.lets[node]?.find((item) => coverage.expressions[item] === expression) ?? node;
587
+ };
588
+
589
+ export const countCoverage = (coverage: Coverage, node: number) => {
590
+ for (let item = node; item !== -1; item = coverage.prefixes[item]) coverage.primary[item]++;
591
+ };
592
+
593
+ export const runAtCoverageNode = <Result>(
594
+ coverage: Coverage,
595
+ node: number,
596
+ run: () => Result,
597
+ ): Result => {
598
+ const outer = coverage.current;
599
+ coverage.current = node;
600
+ try {
601
+ return run();
602
+ } finally {
603
+ coverage.current = outer;
604
+ }
605
+ };
606
+
607
+ export const costCoverage = (coverage: Coverage, value: Value, cost: number) => {
608
+ const node = typeof value === "object" ? coverage.values.get(value) : undefined;
609
+ if (node !== undefined) coverage.secondary[node] += cost;
610
+ };
611
+
612
+ const getLeadingZeros = (value: bigint) => {
613
+ const high = Number(value >> 32n);
614
+ return high === 0 ? 32 + Math.clz32(Number(value & 0xffffffffn)) : Math.clz32(high);
615
+ };
616
+
617
+ export const countCoverageVariables = (coverage: Coverage, state: Value[]) =>
618
+ state.forEach((value, variable) => {
619
+ const fingerprint = getTlcFingerprint([value]);
620
+ const register = Number(fingerprint >> BigInt(64 - REGISTER_BITS));
621
+ const rest = BigInt.asUintN(64, (fingerprint << BigInt(REGISTER_BITS)) | (1n << 9n));
622
+ const index = variable * REGISTERS + register;
623
+ coverage.registers[index] = Math.max(coverage.registers[index], getLeadingZeros(rest) + 1);
624
+ });
625
+
626
+ export const getDistinctCount = (coverage: Coverage, variable: number) => {
627
+ const registers = coverage.registers.subarray(variable * REGISTERS, (variable + 1) * REGISTERS);
628
+ const alpha = 0.7213 / (1 + 1.079 / REGISTERS);
629
+ const sum = registers.reduce((total, register) => total + 2 ** -register, 0);
630
+ const estimate = (alpha * REGISTERS * REGISTERS) / sum;
631
+ const zeros = registers.filter((register) => register === 0).length;
632
+ if (estimate <= 2.5 * REGISTERS) {
633
+ return Math.trunc(zeros === 0 ? estimate : REGISTERS * Math.log(REGISTERS / zeros));
634
+ }
635
+ return Math.trunc(
636
+ estimate > 2 ** 64 / 30 ? -(2 ** 64) * Math.log(1 - estimate / 2 ** 64) : estimate,
637
+ );
638
+ };
639
+
640
+ interface Pair {
641
+ primary: number;
642
+ secondary: number;
643
+ }
644
+
645
+ const getPairHash = (pair: Pair) => {
646
+ const hash = (Math.imul(31, 31 + pair.primary) + pair.secondary) | 0;
647
+ return hash ^ (hash >>> 16);
648
+ };
649
+
650
+ const getFirstPair = (pairs: Pair[]) => {
651
+ let capacity = 16;
652
+ while (pairs.length > capacity * 0.75) capacity *= 2;
653
+ const getBucket = (pair: Pair) => getPairHash(pair) & (capacity - 1);
654
+ return pairs.reduce((first, pair) => (getBucket(pair) < getBucket(first) ? pair : first));
655
+ };
656
+
657
+ const addPair = (pairs: Pair[], pair: Pair) => {
658
+ if (!pairs.some((item) => item.primary === pair.primary && item.secondary === pair.secondary)) {
659
+ pairs.push(pair);
660
+ }
661
+ };
662
+
663
+ const isNodePrimed = (coverage: Coverage, node: number) =>
664
+ coverage.isPrimed[node] || coverage.isUnchanged[node];
665
+
666
+ const getChildren = (coverage: Coverage, node: number) => {
667
+ const children: number[] = [];
668
+ for (let child = coverage.firstChild[node]; child !== -1; child = coverage.nextSibling[child]) {
669
+ children.push(child);
670
+ }
671
+ return children;
672
+ };
673
+
674
+ const getRelationCounts = (coverage: Coverage, relation: CoverageRelation) => {
675
+ const primary = coverage.primary[relation.node];
676
+ const secondary = coverage.secondary[relation.node];
677
+ if (relation.kind === "init") return { distinct: primary, generated: primary + secondary };
678
+ if (relation.kind === "next") return { distinct: secondary, generated: primary };
679
+ if (relation.kind === "constraint") {
680
+ return { distinct: secondary, generated: primary + secondary };
681
+ }
682
+ return { distinct: 0, generated: 0 };
683
+ };
684
+
685
+ const getExpressions = (coverage: Coverage, root: number) => {
686
+ const expressions: CoverageExpression[] = [];
687
+ const subtrees = new Map<number, Pair[]>();
688
+ const collect = (node: number): Pair[] => {
689
+ const pairs: Pair[] = [];
690
+ const own = { primary: coverage.primary[node], secondary: coverage.secondary[node] };
691
+ if (own.primary > 0 || own.secondary > 0 || isNodePrimed(coverage, node)) addPair(pairs, own);
692
+ getChildren(coverage, node).forEach((child) =>
693
+ collect(child).forEach((pair) => addPair(pairs, pair)),
694
+ );
695
+ subtrees.set(node, pairs);
696
+ return pairs;
697
+ };
698
+ const add = (node: number, depth: number, count: number, cost: number) => {
699
+ const range = coverage.ranges[node];
700
+ expressions.push({
701
+ location: range ? formatRange(range) : "Unknown location",
702
+ depth,
703
+ count,
704
+ cost,
705
+ });
706
+ };
707
+ const addSelf = (node: number, depth: number) =>
708
+ add(node, depth, coverage.primary[node], coverage.secondary[node]);
709
+ const print = (node: number, depth: number) => {
710
+ const children = getChildren(coverage, node);
711
+ const collected: Pair[] = [];
712
+ children.forEach((child) =>
713
+ (subtrees.get(child) ?? collect(child)).forEach((pair) => addPair(collected, pair)),
714
+ );
715
+ const own = { primary: coverage.primary[node], secondary: coverage.secondary[node] };
716
+ const isPrimed = isNodePrimed(coverage, node);
717
+ const printChildren = (level: number) => children.forEach((child) => print(child, level));
718
+ if (coverage.isUnchanged[node]) {
719
+ const changed = collected.filter((pair) => pair.primary !== 0 || pair.secondary !== 0);
720
+ if (changed.length === 0) addSelf(node, depth);
721
+ else add(node, depth, Math.max(own.primary, getFirstPair(changed).primary), 0);
722
+ return;
723
+ }
724
+ if (collected.length === 0) {
725
+ if (own.primary !== 0 || isPrimed) addSelf(node, depth);
726
+ return;
727
+ }
728
+ const isZero = own.primary === 0 && own.secondary === 0;
729
+ if (collected.length === 1) {
730
+ const consistent = collected[0];
731
+ const isConsistentZero = consistent.primary === 0 && consistent.secondary === 0;
732
+ if (consistent.primary < own.primary) {
733
+ addSelf(node, depth);
734
+ printChildren(depth + 1);
735
+ return;
736
+ }
737
+ if (!isPrimed && isZero && !isConsistentZero) {
738
+ add(node, depth, consistent.primary, consistent.secondary);
739
+ return;
740
+ }
741
+ if (isZero && isConsistentZero) {
742
+ if (isPrimed) addSelf(node, depth);
743
+ printChildren(isPrimed ? depth + 1 : depth);
744
+ return;
745
+ }
746
+ if (own.primary === consistent.primary && own.secondary === consistent.secondary) {
747
+ addSelf(node, depth);
748
+ return;
749
+ }
750
+ }
751
+ const isPrinted = !isZero || isPrimed;
752
+ if (isPrinted) addSelf(node, depth);
753
+ printChildren(isPrinted ? depth + 1 : depth);
754
+ };
755
+ getChildren(coverage, root).forEach((child) => {
756
+ collect(child);
757
+ print(child, 0);
758
+ });
759
+ return expressions;
760
+ };
761
+
762
+ const KIND_ORDER: CoverageKind[] = ["init", "next", "invariant", "constraint", "implied"];
763
+
764
+ const compareRanges = (left: SourceRange | undefined, right: SourceRange | undefined) => {
765
+ if (!left || !right) return left ? 1 : right ? -1 : 0;
766
+ if (left.module !== right.module) return left.module < right.module ? -1 : 1;
767
+ return (
768
+ left.start.line - right.start.line ||
769
+ left.start.column - right.start.column ||
770
+ left.end.line - right.end.line ||
771
+ left.end.column - right.end.column
772
+ );
773
+ };
774
+
775
+ const getReportedRelations = (coverage: Coverage) =>
776
+ KIND_ORDER.flatMap((kind) => {
777
+ const relations = coverage.relations.filter((relation) => relation.kind === kind);
778
+ if (kind !== "next") return relations;
779
+ return relations
780
+ .toSorted((left, right) =>
781
+ compareRanges(left.expression.location.range, right.expression.location.range),
782
+ )
783
+ .filter(
784
+ (relation, index, sorted) =>
785
+ index === 0 ||
786
+ compareRanges(
787
+ sorted[index - 1].expression.location.range,
788
+ relation.expression.location.range,
789
+ ) !== 0,
790
+ );
791
+ });
792
+
793
+ export const getCoverageReport = (
794
+ coverage: Coverage,
795
+ environment: Environment,
796
+ variableLocations: SourceLocation[],
797
+ variableOrder: number[],
798
+ ): CoverageReport => ({
799
+ variables: variableOrder.map((index) => {
800
+ const range = variableLocations[index]?.range;
801
+ return {
802
+ label: `${environment.variables[index]} ${range ? formatRange(range) : "Unknown location"}`,
803
+ distinct: getDistinctCount(coverage, index),
804
+ };
805
+ }),
806
+ relations: getReportedRelations(coverage).map((relation) => ({
807
+ kind: relation.kind,
808
+ label: relation.label,
809
+ ...getRelationCounts(coverage, relation),
810
+ expressions: getExpressions(coverage, relation.node),
811
+ })),
812
+ });
813
+
814
+ export const getCoverageCounts = (
815
+ coverage: Coverage,
816
+ kind: CoverageKind,
817
+ expression: Expression,
818
+ ): [string, number][] | undefined => {
819
+ const node = findCoverageRelation(coverage, kind, expression);
820
+ if (node === undefined) return undefined;
821
+ const primary = coverage.primary[node];
822
+ const secondary = coverage.secondary[node];
823
+ if (kind === "init") {
824
+ return [
825
+ ["generated", primary + secondary],
826
+ ["distinct", primary],
827
+ ];
828
+ }
829
+ if (kind === "next") {
830
+ return [
831
+ ["generated", primary],
832
+ ["distinct", secondary],
833
+ ];
834
+ }
835
+ const child = coverage.firstChild[node];
836
+ return [["count", child === -1 ? primary : coverage.primary[child]]];
837
+ };