tla-ts 0.0.9 → 0.0.10-dev.63a6693bd

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