Public report of epfl-lara/stainless, published 21 October 2026. It has the same score, grades and number of findings as the full report. The details of security findings (where they are in the code, which known vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive report Measured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey → Signed and filed in the standard's public register, 21 October 2026, 08:25 UTC · Survey ID cd_52545bf77ba64a1c8aa346cfc26e6cfe

epfl-lara/stainless

Measured 21 October 2026, 08:09 UTC, at code version 9be73d5

CAI score 51out of 100 Adequate
CriticalWeakAdequateStrongExemplary
Down 5 since the last survey

The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.

Performance 100 Exemplary Architecture 93 Adequate Security and Compliance 68 Adequate Production Readiness 55 Adequate Maturity 52 Adequate Code Health 48 Adequate Accessibility 47 Adequate

A medium codebase: 97,336 lines of product code in 9 projects, tests not counted · Estimated rebuild effort: about 0.7 person-years · Weakest lens: Accessibility, 47

Findings by how serious they are

30 critical 546 serious 272 minor

10 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.

This survey was produced by

Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
21 October 2026, 08:09 UTC

A measurement, not a certificate. The Code Assurance Index records a number together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that implements it, and today Watchdog is the only one that does.

The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸

66of 70 dimensions measured by tools. The other 4 are advisory notes from an AI model, which explain the code but don't count towards the score.
825of 848 findings point to an exact file and line, so you can open each one in the code. The other 23 concern the repository as a whole, such as missing documentation.
70dimensions across 7 lenses, read from 97,336 lines of product code in 9 projects.
Chapters

Executive summary

epfl-lara/stainless scores 51 out of 100 and is rated Adequate, while five of its seven lenses score higher still: Performance at 100, rated Exemplary, and Architecture at 93, Security and Compliance at 68, Production Readiness at 55 and Maturity at 52, all rated Adequate. The project hasn't declared a stable release yet, so its lenses are rated against a lower bar than a released product's, while the score itself is worked out as for any repository.

The score is lower than those five because the weakest lens counts most, and here that is Accessibility, which scores 47 and is rated Adequate. Its Visual & motion safety dimension scores 1 out of 10, and until that reaches 4, Accessibility can't be rated higher than Adequate. The first actions are to resolve the 1 No ADRs found finding(s) in ADR Quality and to keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1. The weakest lenses score close to each other, so improving any of them moves the score.

30 findings are critical: 26 in Static Analysis (SAST) and four in IaC & Container Security.

Watchdog couldn't measure 9 dimensions in this code, among them Code Coverage, Test Reliability and Internal API Consistency, so they are left out of the score. The product code is 97,336 lines, which would take an estimated 0.7 person-years, around €97,000, to rebuild.

Code Health 48 Adequate, capped by Nullable reference types Architecture 93 Adequate, capped by Project Cohesion Maturity 52 Adequate, capped by Knowledge Freshness and Architecture documentation Production Readiness 55 Adequate, capped by Security & performance tooling Security and Compliance 68 Adequate, capped by Static Analysis (SAST) and Supply-chain Provenance & Signing Accessibility 47 Adequate, capped by Visual & motion safety Performance 100 ★ Exemplary

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Accessibility 47 · counts for 46%Code Health 48 · counts for 25%Maturity 52 · counts for 14%Production Readiness 55 · counts for 8%Security and Compliance 68 · counts for 4%Architecture 93 · counts for 2%Performance 100 · counts for 1%

The weakest lenses score close to each other, so improving any of them moves the score.

Code composition: what the lines of code are
Product code 95%Tests 5%
New since the last survey: 36 findings

These 36 critical or serious findings weren't in the previous survey, on 5 October 2026.

Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.

Fixed since the last survey: 1 finding

This critical or serious finding was in the previous survey, on 5 October 2026, and is gone from this one.

  • Supply-chain Provenance & Signing REDACTED
Rebuild cost: about €97,000 · Estimate
Cost to rebuild€32,000 to €160,000, for 538 to 1,705 hours of work, about 0.7 person-years for 1 to 2 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 51. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 97,336 lines of product code

How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Resolve the 1 No ADRs found finding(s) in ADR Quality.
Raises the score by about 2 points · Low effort · ADR Quality
2
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Raises the score by about 3 points · Medium effort · Visual & motion safety
3
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
Raises the score by about 2 points · Medium effort · A11y enforcement

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €97,000 to build again, about 0.7 person-years of work. Its weakest lens is Accessibility, at 47 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Resolve the 1 No ADRs found finding(s) in ADR Quality. Of all the actions in this report, it raises the score most for the work it takes: about 2 points for low effort, because it clears the 1 ADR Quality findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 7.1 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 1,326 lines over the last 90 days, which is about 5,378 lines a year. At that pace, the extra work comes to an estimated 0.3 to 1.8 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

989 modules, with 2571 dependencies between them. 4 loops run through 84 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 949 more are left out to keep it readable.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 Enums22 MyTuple53 PatternAlternative14 stainless.algebra.ops5 HOTermination6 stainless.extraction.oo.Trees7 stainless.lang8 stainless.genc.ir.IR9 stainless.extraction.imperative.RefTransform.RefTransformContext.funRefTransformer10 stainless.extraction.innerfuns.Definitions11 stainless.genc12 stainless.extraction.imperative.EffectsAnalyzer13 stainless.genc.ir14 stainless.extraction.imperative15 stainless.extraction.innerclasses16 stainless.extraction17 stainless.extraction.oo18 stainless.extraction.imperative.trees19 stainless.ast.Expressions20 stainless.ast21 stainless.utils22 stainless23 stainless.genc.CAST24 ConstantPropagation25 stainless.extraction.oo.Definitions26 stainless.genc.phases.IR2CImpl27 stainless.codegen.runtime28 Assert429 ErasedMatch30 ExportedMethods131 stainless.extraction.innerfuns32 stainless.frontends.dotc33 stainless.genc.phases34 defs35 stainless.termination36 stainless.transformers.lattices.Core37 stainless.transformers.lattices38 (global)39 stainless.verification40 stainless.equivchk
1 Enums2
2 MyTuple5
3 PatternAlternative1
4 stainless.algebra.ops
5 HOTermination13
6 stainless.extraction.oo.Trees642721735
7 stainless.lang419265
8 stainless.genc.ir.IR412115541
9 stainless.extraction.imperative.RefTransform.RefTransformContext.funRefTransformer111
10 stainless.extraction.innerfuns.Definitions21615941
11 stainless.genc31152311010334
12 stainless.extraction.imperative.EffectsAnalyzer16102271143
13 stainless.genc.ir31121662652
14 stainless.extraction.imperative411131162311927417474
15 stainless.extraction.innerclasses21152115422217233
16 stainless.extraction71711011341
17 stainless.extraction.oo311161118271242931482452
18 stainless.extraction.imperative.trees111121
19 stainless.ast.Expressions1182042441
20 stainless.ast31121323101454
21 stainless.utils3112611168436416
22 stainless44113431177
23 stainless.genc.CAST111111
24 ConstantPropagation477
25 stainless.extraction.oo.Definitions11312154872
26 stainless.genc.phases.IR2CImpl1331
27 stainless.codegen.runtime73101
28 Assert41
29 ErasedMatch11
30 ExportedMethods12
31 stainless.extraction.innerfuns1113121242191612
32 stainless.frontends.dotc3631638232
33 stainless.genc.phases1118231112328111526543
34 defs11431
35 stainless.termination6219131615281310191
36 stainless.transformers.lattices.Core21213110141132
37 stainless.transformers.lattices42124112323217
38 (global)261724123193112122827946670155201
39 stainless.verification51225161423151010723
40 stainless.equivchk22333218147114
Uses a module listed above itPart of a loopThe module itself
1 Enums22 MyTuple53 PatternAlternative14 stainless.algebra.ops5 HOTermination6 stainless.extraction.oo.Trees7 stainless.lang8 stainless.genc.ir.IR9 stainless.extraction.imperative.RefTransform.RefTransformContext.funRefTransformer10 stainless.extraction.innerfuns.Definitions11 stainless.genc12 stainless.extraction.imperative.EffectsAnalyzer13 stainless.genc.ir14 stainless.extraction.imperative15 stainless.extraction.innerclasses16 stainless.extraction17 stainless.extraction.oo18 stainless.extraction.imperative.trees19 stainless.ast.Expressions20 stainless.ast21 stainless.utils22 stainless23 stainless.genc.CAST24 ConstantPropagation25 stainless.extraction.oo.Definitions26 stainless.genc.phases.IR2CImpl27 stainless.codegen.runtime28 Assert429 ErasedMatch30 ExportedMethods131 stainless.extraction.innerfuns32 stainless.frontends.dotc33 stainless.genc.phases34 defs35 stainless.termination36 stainless.transformers.lattices.Core37 stainless.transformers.lattices38 (global)39 stainless.verification40 stainless.equivchkEnums21MyTuple52PatternAlternative13stainless.algebra.ops4HOTermination5stainless.extraction.oo.Trees6stainless.lang7stainless.genc.ir.IR8stainless.extraction.imperative.RefTransform.RefTransformContext.funRefTransformer9stainless.extraction.innerfuns.Definitions10stainless.genc11stainless.extraction.imperative.EffectsAnalyzer12stainless.genc.ir13stainless.extraction.imperative14stainless.extraction.innerclasses15stainless.extraction16stainless.extraction.oo17stainless.extraction.imperative.trees18stainless.ast.Expressions19stainless.ast20stainless.utils21stainless22stainless.genc.CAST23ConstantPropagation24stainless.extraction.oo.Definitions25stainless.genc.phases.IR2CImpl26stainless.codegen.runtime27Assert428ErasedMatch29ExportedMethods130stainless.extraction.innerfuns31stainless.frontends.dotc32stainless.genc.phases33defs34stainless.termination35stainless.transformers.lattices.Core36stainless.transformers.lattices37(global)38stainless.verification39stainless.equivchk401364272173541926541211554111121615941311523110103341610227114331121662652411131162311927417474211521154222172337171101134131116111827124293148245211112111820424413112132310145431126111684364164411343117711111147711312154872133173101111211131212421916123631638232111823111232811152654311431621913161528131019121213110141132421241123232172617241231931121228279466701552015122516142315101072322333218147114+949 more modules (most-connected shown)

At a glance — Code Health · 48% · Adequate · gated by X5 ·

The Good
D3 · Scala God Classes 8.9 D4 · Scala Code Duplication 9.6 D17 · Scala Explicit Debt 9.7 GD1 · Repo Unfinished & placeholder code 10.0 X12 · Repo Unreachable branch 10.0 X13 · Repo Undrained process stream 10.0 X16 · Repo Unfloored truncation loop 10.0 X19 · Repo Unrestored process-global state 10.0 X20 · Repo Mistyped argument guard 10.0 X21 · Repo Side-effecting pattern guard 10.0 X22 · Repo Contradicted release guard 10.0 X23 · Repo Unguarded diagnostic materialisation 10.0 X25 · Repo Inert configuration knob 10.0 X26 · Repo Unsynchronised callback handoff 10.0 X27 · Repo Collection changed while being enumerated 10.0 X28 · Repo Index access outside its own emptiness guard 10.0 X29 · Repo Per-element action decided by a fixed element 10.0 X30 · Repo Support guard that admits what it rejects 10.0
The Bad
D1 · Scala Cyclomatic Complexity 5.1 IC1 · Repo Incompleteness & stubs 6.5 X1 · Repo Async correctness 4.8 X18 · Repo Disposal-pattern correctness 5.4 X3 · Repo Exception handling 5.5
The Ugly
D2 · Scala Cognitive Complexity 4.0 X5 · Repo Nullable reference types 2.0

At a glance — Architecture · 93% · Adequate · gated by D26 ·

The Good
D5 · Scala Coupling 10.0 D6 · Scala Cohesion (LCOM4) 9.6 D35 · Scala Change Coupling 10.0 AX10 · Repo Code composition 10.0 AX3 · Repo Project dependency cycles 10.0 AX4 · Repo Dependency direction 10.0 AX6 · Repo Interface segregation 10.0 AX8 · Repo Test isolation 10.0
The Ugly
D26 · Scala Project Cohesion 0.0

At a glance — Maturity · 52% · Adequate · gated by D34, M2 ·

The Good
D15 · Scala Churn × Complexity Hotspots 9.3 D16 · Scala Bus Factor 9.3 D19 · Scala Documentation Quality 8.0 D21 · Scala Naming Consistency 10.0 M1 · Repo Documentation (README) 7.3 M3 · Repo Folder & project structure 10.0 M4 · Repo Documentation accuracy 8.0
The Ugly
D20 · Scala ADR Quality 0.0 D34 · Scala Knowledge Freshness 1.9 M2 · Repo Architecture documentation 0.0

At a glance — Readiness · 55% · Adequate · gated by P3 ·

The Good
D9 · Scala Test Distribution 10.0 D12 · Scala Dependency Hygiene 9.7 D13 · Scala Secret Scanning 10.0 D14 · Scala License Compliance 10.0 P1 · Repo CI/CD gates 10.0 P10 · Repo Library API & versioning 10.0 P2 · Repo Observability 7.0 P4 · Repo Deployment & Rollback 7.0
The Bad
P6 · Repo Release Hygiene 5.0
The Ugly
P3 · Repo Security & performance tooling 0.0

At a glance — Security · 68% · Adequate · gated by D29, D36 ·

The Good
D28 · Scala Secrets (history) 10.0 D30 · Scala Dependency Vulnerabilities 10.0 D31 · Scala IaC & Container Security 8.6 D43 · Scala Malicious Dependencies 10.0 X14 · Repo Bypassable address classification 10.0 X15 · Repo Unvalidated length from an untrusted reader 10.0 X17 · Repo Uncapped recursion over a caller-supplied document 10.0 X24 · Repo Document value interpolated into markup unescaped 10.0
The Ugly
D29 · Scala Static Analysis (SAST) 2.1 D36 · Scala Supply-chain Provenance & Signing 0.0

At a glance — Accessibility · 47% · Adequate · gated by AC6 ·

The Good
AC2 · Repo Forms & labels 10.0 AC5 · Repo ARIA correctness 10.0
The Bad
AC3 · Repo Page structure 5.2
The Ugly
AC6 · Repo Visual & motion safety 1.0 AC7 · Repo A11y enforcement 4.0

At a glance — Performance · 100% · Exemplary ·

The Good
PF3 · Repo Async & latency hygiene 10.0

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP categoryFindingsSeverity
A05:2025 — Injection26High / Critical
A03:2025 — Software Supply Chain Failures11Medium
A02:2025 — Security Misconfiguration5High / Critical

Roadmap

First, address visual and motion safety by ensuring visible focus styles, respecting reduced motion preferences, and fixing low-contrast colors. Next, enforce accessibility standards by integrating invariant checks into your test suite and gating merges on CI. Simultaneously, resolve the missing architecture decision records and correct page structure issues such as missing language attributes and landmarks. Finally, eliminate null safety risks in Scala by enabling explicit null checks and refactoring code to use Option types instead of raw nulls.

Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.

Do thisHelpsEffortDimension
Resolve the 1 No ADRs found finding(s) in ADR Quality.+2.1 ptsLowADR Quality
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.+2.9 ptsMediumVisual & motion safety
Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.+2.2 ptsMediumA11y enforcement
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.+2.0 ptsMediumPage structure
On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.+1.9 ptsMediumNullable reference types
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+1.9 ptsMediumArchitecture documentation
Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md.+0.7 ptsLowDocumentation Quality
Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.+1.3 ptsMediumSecurity & performance tooling

File quality

Per-file score 0–10 — a quality signature. Of 144 files carrying findings, judged against the Preview bar: 1% slop · 30% mixed · 69% near-clean.

FileScoreBandWorst signal
REDACTED2.7SlopIaC & Container Security: High IaC: REDACTED
REDACTED3.0MixedStatic Analysis (SAST): High: REDACTED
REDACTED3.0MixedStatic Analysis (SAST): High: REDACTED
REDACTED3.0MixedStatic Analysis (SAST): High: REDACTED
REDACTED3.0MixedStatic Analysis (SAST): High: REDACTED
REDACTED3.0MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala5.5MixedCyclomatic Complexity: Checker.traverse (cyclomatic 44)
core/src/main/scala/stainless/ast/Deconstructors.scala5.9MixedCode Duplication: Members sharing a duplicated core (12 members, 50+ identical tokens)
core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala6.0MixedExplicit Debt: XxxComment
frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala6.0MixedExplicit Debt: FixmeComment
core/src/main/scala/stainless/codegen/CodeGeneration.scala6.0MixedExplicit Debt: TodoComment
core/src/main/scala/stainless/verification/TypeChecker.scala6.0MixedExplicit Debt: TodoComment
core/src/main/scala/stainless/transformers/lattices/Core.scala6.0MixedExplicit Debt: TodoComment
frontends/library/stainless/math/FdLibm.scala6.0MixedExplicit Debt: TodoComment
core/src/main/scala/stainless/genc/phases/Scala2IRPhase.scala6.0MixedExplicit Debt: FixmeComment
core/src/main/scala/stainless/genc/phases/IR2CPhase.scala6.0MixedExplicit Debt: TodoComment
core/src/main/scala/stainless/extraction/oo/TypeOps.scala6.0MixedExplicit Debt: TodoComment

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 30

A definite problem that already costs you something and drags the score down: a missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here tends to cause failures elsewhere.

Serious — 546

Likely wrong, but not failing yet. It degrades the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to carry for two years either.

Minor — 272

Recorded, with no effect on how the codebase functions. Present so the survey is complete, not because it needs doing.

Could not be resolved — 10

Something this survey could not settle from the outside, and which could be critical or serious. Either a control was required and no positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean result. These are excluded from the score rather than awarded a pass, so the number on the cover neither rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each one is named under Limitations.

Methodology & how to trust this report

Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 66 of 70 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.

Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.

What we checked — 70 dimensions across the health lenses
D1D2D3D4D5D6D9D12D13D14D15D16D17D19D20D21D26D28D29D30D31D34D35D36D43AC2AC3AC5AC6AC7AX10AX3AX4AX6AX8GD1IC1M1M2M3M4P1P10P2P3P4P6PF3X1X12X13X14X15X16X17X18X19X20X21X22X23X24X25X26X27X28X29X3X30X5

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions
  1. Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 825 of 848 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Watchdog duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivy · checkovSecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3 · 3.2.533✓ deterministic
LLM (sampled · advisory)Documentation quality, ADR conformance, naming — sampled over a bounded sample; advisory, never a deterministic measurementLocal LLM◐ LLM · sampled · advisory

Every finding is locatable in findings.md. Run 01a15d82-8db9-7809-be61-c6c59d504a41.

The exact command behind every deep-scan dimension — tool, version, invocation and retained raw output — is in Appendix B — Reproduction & audit trail.

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.scala) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
  • D11 Test Reliability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.scala) and this repository declares an sbt build (repository root, 34 test files), but it was not re-run: the analyzer environment could not run it. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
  • D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
  • D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala`, `core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala`, `core/src/main/scala/stainless/extraction/innerfuns/FunctionClosure.scala`, `core/src/main/scala/stainless/extraction/methods/Trees.scala`, `core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala`, … (+78 more) produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • D44 Platform End-of-Life — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a REDACTED) is simply not read here yet.
  • AX1 Captive dependencies — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and this repository defines its own container in core/src/main/scala/stainless/ast/Graphs.scala, whose lifetimes are not modelled yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via REDACTED (REDACTED). docker build failed (exit 1) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release. Install the buildx component to build images with BuildKit: https://docs.docker.com/go/bui…; runtime evidence skipped.
  • C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.

Repo exclusion declarations: 1 pattern(s) declared (.gitattributes linguist-generated/vendored, .editorconfig generated_code) excluded 0 source file(s) from code-quality scoring. Declarations are the repo's own visible statement that a tree is machine-written or vendored — auditable in any diff, honored by GitHub the same way.

Limitations & what we did not check

Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.

Per-dimension blind spots

For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D12 Dependency Hygiene: Dependency health reads manifests and lockfiles — a vulnerability in a vendored/copied dependency, or risk from how a dependency is actually used, is outside this view.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
  • D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
  • D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
  • AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
  • AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
  • AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
  • AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

The LLM boundary

LLM-set scores this run (4): D19, D21, D26, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.

Dimensions

D1 · Cyclomatic Complexity5.1 / 10Adequate✓ Tool-verified

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

Maturity: Documented → Verified → Prevented · effective 5.1 / 10 · rule-coverage 100% · ceiling Prevented

96 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was AntiAliasing.extractFunction at 229. A further 25 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being uncoder.combineCtorAlike at 55 — they are counted neither in the figure above nor in this dimension's score. 10 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: core/src/main/scala/stainless/genc/CASTDependencies.scala (CASTTraverser.deconstruct at 42), core/src/main/scala/stainless/genc/ir/IRPrinter.scala (IRPrinter.rec at 34), core/src/main/scala/stainless/genc/ir/Transformer.scala (Transformer.recImpl at 33), core/src/main/scala/stainless/genc/ir/Visitor.scala (Visitor.rec at 30), core/src/main/scala/stainless/ast/Deconstructors.scala (TreeDeconstructor.deconstruct at 25), and 5 more not listed here. They are named here because the per-file figures other dimensions report are taken BEFORE this exclusion, so such a file can show a high maximum complexity elsewhere in this report and nothing here, with nothing to reconcile the two.

AntiAliasing.extractFunction (cyclomatic 229)core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala:99
CodeExtraction.extractTree (cyclomatic 217)frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1396
CodeGeneration.mkExpr (cyclomatic 183)core/src/main/scala/stainless/codegen/CodeGeneration.scala:623
TypeChecker.inferType (cyclomatic 180)core/src/main/scala/stainless/verification/TypeChecker.scala:453
CodeExtraction.extractCall (cyclomatic 153)frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2129

+ 91 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 5 bodies over 120 down to 120 or less in Cyclomatic Complexity — start with AntiAliasing.extractFunction (cyclomatic 229), CodeExtraction.extractTree (cyclomatic 217), CodeGeneration.mkExpr (cyclomatic 183). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 5 together lifts Cyclomatic Complexity from 5.1 to about 5.8/10, projected with the scoring formula itself and assuming each lands exactly at 120; a cleaner split scores higher.
  2. Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.

D2 · Cognitive Complexity4.0 / 10Weak✓ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

Maturity: Documented → Verified → Prevented · effective 4.0 / 10 · rule-coverage 100% · ceiling Prevented

121 method(s) exceeded the cognitive complexity threshold of 15; the worst was Pow.compute at 339.

Pow.compute (cognitive 339)frontends/library/stainless/math/FdLibm.scala:1877
AntiAliasing.extractFunction (cognitive 218)core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala:99
CodeExtraction.extractTree (cognitive 177)frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1396
TypeChecker.inferType (cognitive 167)core/src/main/scala/stainless/verification/TypeChecker.scala:453
EffectsChecker.checkEffects (cognitive 164)core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala:18

+ 116 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Bring the 1 body over 240 down to 240 or less in Cognitive Complexity — start with Pow.compute (cognitive 339). — Refactoring it lifts Cognitive Complexity from 4.0 to about 4.5/10.
  2. Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.

D3 · God Classes8.9 / 10Strong✓ Tool-verified

What it measures: Over-large classes that try to do too much ("god classes").

Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.

Maturity: Documented → Verified → Prevented · effective 8.9 / 10 · rule-coverage 100% · ceiling Prevented

31 god class(es) detected.

FileTooLong: lattices/Core.scala · ×16core/src/main/scala/stainless/transformers/lattices/Core.scala
TooManyMethods: Core · ×11core/src/main/scala/stainless/transformers/lattices/Core.scala:8
ClassTooLong: CodeExtraction · ×3frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:31
MethodTooLong: InnerClasses.getContextcore/src/main/scala/stainless/extraction/innerclasses/InnerClasses.scala:67

What to do

  1. Resolve the 16 FileTooLong finding(s) in God Classes — start with List.scala (2), Core.scala, CodeExtraction.scala. — One of this dimension's main actionable groups (16 warning-level).
  2. Resolve the 11 TooManyMethods finding(s) in God Classes — start with List.scala (2), Core.scala, Definitions.scala. — One of this dimension's main actionable groups (11 warning-level).
  3. Resolve the 3 ClassTooLong finding(s) in God Classes — start with CodeExtraction.scala, Scala2IRPhase.scala, FragmentChecker.scala. — One of this dimension's main actionable groups (3 warning-level).
  4. Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.

D4 · Code Duplication9.6 / 10Stronggated by 86 serious findings✓ Tool-verified

What it measures: Copy-pasted code that should be shared instead.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.

Maturity: Documented → Verified → Prevented · effective 9.6 / 10 · rule-coverage 100% · ceiling Verified

82 duplicated block group(s) detected. A further 4 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.

Duplicated block (5 lines × 2) · ×17core/src/main/scala/stainless/extraction/innerclasses/ExprOps.scala:58
Duplicated block (7 lines × 2) · ×12core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:399
Duplicated block (6 lines × 2) · ×9core/src/main/scala/stainless/ast/ExprOps.scala:398
Duplicated block (9 lines × 2) · ×7core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:120
Duplicated block (8 lines × 2) · ×7core/src/main/scala/stainless/ast/ExprOps.scala:443

+ 25 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 17 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with FdLibm.scala (5), TypeChecker.scala (3), TypeEncoding.scala (2). — One of this dimension's main actionable groups (17 warning-level).
  2. Resolve the 12 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with EquivalenceChecker.scala (2), FdLibm.scala (2), ReturnElimination.scala. — One of this dimension's main actionable groups (12 warning-level).
  3. Resolve the 9 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with CodeGeneration.scala (3), ExprOps.scala, EquivalenceChecker.scala. — One of this dimension's main actionable groups (9 warning-level).
  4. Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.

D5 · Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.

Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.

Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

9 production modules (sbt), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; a dependsOn spread (deps: _*) and a project whose directory a helper computes are not visible there; 0 module(s) off the main sequence, with abstractness counted on 5 of the 9 (the rest declare no modelled class or interface, export only macros, declare types in source no model reads, or have no source directory of their own).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)9.6 / 10Stronggated by 4 serious findings✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

Maturity: Documented → Verified → Prevented · effective 9.6 / 10 · rule-coverage 100% · ceiling Verified

4 of 116 classes have LCOM4 above 3.

Low cohesion: Canonization (LCOM4 8) · ×4core/src/main/scala/stainless/utils/Canonization.scala:8

What to do

  1. Resolve the 4 Low cohesion finding(s) in Cohesion (LCOM4) — start with Canonization.scala, ExprOps.scala, CodeGenEvaluator.scala. — One of this dimension's main actionable groups (4 warning-level).
  2. Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.

D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.

Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

59 test methods: 33 unit, 26 integration, 0 BDD, 0 e2e. The Scala suite contributes 59 test case(s) across 14 file(s) in a test source set declaring at least one — every `test("…")`, `it("…")`, `property("…")` and `"…" in {…}` registration and every JUnit `@Test`, which is how munit, ScalaTest, utest, ZIO Test and specs2 declare a case; a case registered under a computed name is not counted, so this is a floor. Its tier split is INFERRED from paths and file names, except sbt's src/it source set, which the build declares.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

D12 · Dependency Hygiene9.7 / 10Exemplary✓ Tool-verified

What it measures: Whether dependencies are current, secure, and not bloated.

Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Verified

6 outdated direct sbt declarations. An sbt declaration names an EXACT version, so the remedy is an edit to the build file — there is no lockfile refresh that would move it. Test-, Provided- and it-scoped declarations are excluded, because a consumer of this project never receives them. A version held in a Scala val is read only when the val is one string literal: sbt is a program rather than a manifest, and evaluating a computed version would invent the measurement rather than take it. Whether any artifact is DEPRECATED or ABANDONED is not graded and cannot be — Maven Central publishes no such marker, and release age does not stand in for one: the most widely depended-upon libraries are routinely the stalest, being finished rather than abandoned. Known CVEs in this dependency graph are D30's question.

Outdated: com.typesafe:config · ×6

✓ On the Gold path — maintain.

Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.

D13 · Secret Scanning10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Prevented

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

D14 · License Compliance10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Verified

0 of 5 declared sbt dependency artifact(s) use a banned license. Licences were resolved from the POMs Maven Central publishes, over the production coordinates this repository's 1 sbt build file(s) (build.sbt and project/*.scala) declare with a literal version, directly or through a string-literal val — `%%` resolved to the Scala binary suffix Central publishes under, test-scoped declarations excluded — the same declaration-site closure this analysis reads for dependency currency. sbt has no lockfile a checkout carries, so this is deliberately NOT the transitive closure. A further 1 coordinate(s) are not published to Maven Central — another repository (Google's Maven hosts androidx), a SNAPSHOT, or a private artifact — so their licences are not readable from here and they are outside this verdict.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots9.3 / 10Stronggated by 1 serious finding✓ Tool-verified

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

Maturity: Documented → Verified → Prevented · effective 9.3 / 10 · rule-coverage 100% · ceiling Documented

Top hotspots: frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala (2×86=172)

Hotspot: frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scalafrontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2659

What to do

  1. Resolve the 1 Hotspot finding(s) in Churn × Complexity Hotspots — start with CodeExtraction.scala. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.

D16 · Bus Factor9.3 / 10Exemplary✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

Maturity: Documented → Verified → Prevented · effective 9.3 / 10 · rule-coverage 100% · ceiling Documented

20 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is frontends/library/stainless/math/FdLibm.scala. Counted over 271 of the 1801 production source files in this repository: 1520 are under the ~2,400-byte size floor this dimension measures over, and the remaining 10 have no attributable history left to measure.

Off-boarding risk: anonymized user #1 · ×2
Further sole-owners (lower concentration)

✓ On the Gold path — maintain.

Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.

D17 · Explicit Debt9.7 / 10Stronggated by 142 serious findings✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

Maturity: Documented → Verified → Prevented · effective 9.7 / 10 · rule-coverage 100% · ceiling Prevented

142 deducted task-comment markers across 97336 LoC (0.1/KLoC) → score 9.7. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

TodoComment · ×88core/src/main/scala/stainless/MainHelpers.scala:151
FixmeComment · ×53core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:217
XxxCommentcore/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala:70

What to do

  1. Resolve the 88 TodoComment finding(s) in Explicit Debt — start with Core.scala (8), EffectElaboration.scala (7), CellArrayMergeSort.scala (7). — One of this dimension's main actionable groups (88 warning-level).
  2. Resolve the 53 FixmeComment finding(s) in Explicit Debt — start with Streams.scala (6), EffectElaboration.scala (4), CellDataStructuresAndRepr.scala (4). — One of this dimension's main actionable groups (53 warning-level).
  3. Resolve the 1 XxxComment finding(s) in Explicit Debt — start with AntiAliasing.scala. — One of this dimension's main actionable groups (1 warning-level).
  4. Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.

D19 · Documentation QualityStrong◐ Sampled · advisory

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Strong / 10 · rule-coverage 100% · ceiling Documented

The repository's root README (Stainless) gives a strong overview of Stainless as a Scala subset verification framework with links to Inox and Bolts, plus installation notes for git submodules and Scala 3 support. The docs/README is focused on the stainless project itself and describes its core verifier sources, an sbt plugin, and Sphinx documentation. The architecture/design doc AntiAliasing.md covers the imperative-to-functional translation pipeline (where it sits in the chain, the value-memory model, signature rewrite, call-site rewriting, and aliasing rules), with a full outline; all sections exist and are visible.

Documentation: no installation or build instructionsREADME.md

What to do

  1. Resolve the 1 Documentation finding(s) in Documentation Quality — start with README.md. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d19_recommendation.md · top locations in Appendix A, every location in findings.md.

D20 · ADR Quality0.0 / 10Critical✓ Tool-verified

What it measures: Whether architecture decisions are recorded well (context, decision, consequences).

Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

No architecture decision records were found.

No ADRs found

What to do

  1. Resolve the 1 No ADRs found finding(s) in ADR Quality. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.

D21 · Naming ConsistencyExemplary◐ Sampled · advisory

What it measures: Whether names — types, methods, variables — are clear and consistent.

Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.

Maturity: Documented → Verified → Prevented · effective Exemplary / 10 · rule-coverage 100% · ceiling Verified

0 naming inconsistencies across 0 sampled symbols.

✓ On the Gold path — maintain.

Detailed fixes: d21_recommendation.md.

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

What it measures: Whether each project is a focused, coherent unit rather than an oversized grab-bag.

Method: Project size overshoot penalties (LoC / public-type count / namespace count, 2-of-3 flag) weighted by log magnitude. Exhaustive across projects, deterministic, LLM-independent.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 1 build units (sbt) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

  1. Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.

D28 · Secrets (history)10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

gitleaks scanned the full history AND the current working tree and found no secrets.

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)2.1 / 10Critical✓ Tool-verified

What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

Maturity: Documented → Verified → Prevented · effective 2.1 / 10 · rule-coverage 100% · ceiling Documented

26 finding(s): 0 critical, 26 high, 0 medium, 0 low. 17 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 50 file(s) — `core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala`, `core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala`, `core/src/main/scala/stainless/extraction/innerfuns/FunctionClosure.scala`, `core/src/main/scala/stainless/extraction/methods/Trees.scala`, `core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala`, … (+45 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 5 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (5 issue-level).
  2. Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4). — One of this dimension's main actionable groups (4 issue-level).
  3. No action in Static Analysis (SAST) — all 17 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (17 issue-level, 0 of them charged here).

Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.

D30 · Dependency Vulnerabilities10.0 / 10Exemplary○ Nothing flagged

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No known-vulnerable dependencies in any ecosystem this repository declares.

✓ On the Gold path — maintain.

Detailed fixes: d30_recommendation.md.

D31 · IaC & Container Security8.6 / 10Adequategated by 4 critical findings✓ Tool-verified

What it measures: Whether Dockerfiles / Terraform / Kubernetes config follow security best practices.

Method: IaC/container misconfiguration scan via trivy config (REDACTED/Terraform/K8s/Helm/CloudFormation); severity rules to 0-10 moderate normalizer. NotApplicable without manifests. Exhaustive, deterministic.

Maturity: Documented → Verified → Prevented · effective 8.6 / 10 · rule-coverage 100% · ceiling Documented

5 finding(s): 0 critical, 4 high, 1 medium, 0 low.

REDACTED
REDACTED

What to do

  1. Resolve the 4 High IaC finding(s) in IaC & Container Security — start with REDACTED (4). — One of this dimension's main actionable groups (4 issue-level).
  2. Resolve the 1 Medium IaC finding(s) in IaC & Container Security — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.

D34 · Knowledge Freshness1.9 / 10Critical✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

Maturity: Documented → Verified → Prevented · effective 1.9 / 10 · rule-coverage 100% · ceiling Documented

229 of 281 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala. Counted over 281 of the 1801 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file · ×226core/src/main/scala/stainless/verification/CoqEncoder.scala:1
Most significant orphaned file · ×3core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:1
Concentrated knowledge decay

What to do

  1. Resolve the 226 Orphaned file finding(s) in Knowledge Freshness — start with Trees.scala (6), package.scala (5), Definitions.scala (5). — One of this dimension's main actionable groups (226 recommendation-level).
  2. Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with EquivalenceChecker.scala, EffectElaboration.scala, BitVectors.scala. — One of this dimension's main actionable groups (3 recommendation-level).
  3. Resolve the 1 Concentrated knowledge decay finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.

D35 · Change Coupling10.0 / 10Stronggated by 1 serious finding✓ Tool-verified

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

Strongest change-coupling: Deconstructors.scala↔InoxEncoder.scala 64%

Change coupling: Deconstructors.scala ↔ InoxEncoder.scalacore/src/main/scala/stainless/ast/Deconstructors.scala:1

What to do

  1. Resolve the 1 Change coupling finding(s) in Change Coupling — start with Deconstructors.scala. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.

D36 · Supply-chain Provenance & Signing0.0 / 10Critical✓ Tool-verified

What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.

Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.

Maturity: Documented → Verified → Prevented · effective 0.0 / 10 · rule-coverage 100% · ceiling Documented

0/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED
REDACTED
REDACTED
REDACTED

+ 3 more group(s) — more in Appendix A; the complete list is findings.md.

What to do

  1. Resolve the 3 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 warning-level).
  2. Resolve the 2 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 warning-level).
  3. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).

Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.

D43 · Malicious Dependencies10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.

Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.

Maturity: Documented → Verified → Prevented · effective 10.0 / 10 · rule-coverage 100% · ceiling Documented

No dependency in any ecosystem this repository declares is published as malicious.

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

Frontend & cross-cutting dimensions

R = React/JS · M = Maturity · P = Readiness.

AC2 · Forms & labels10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.

Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

AC3 · Page structure5.2 / 10Adequate✓ Tool-verified

Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.

Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • With more than one navigation landmark, each needs an aria-label/aria-labelledby (e.g. "Primary", "Footer") so assistive tech can tell them apart. At least one nav here is unlabelled. — core/src/sphinx/themes/sphinx_rtd_theme/layout.html:17

What to do

  • Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
AC5 · ARIA correctness10.0 / 10Exemplary○ Nothing flagged

Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.

Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.

Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

AC6 · Visual & motion safety1.0 / 10Critical✓ Tool-verified

Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.

Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.

Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.

  • `.rst-versions .rst-current-version.rst-out-of-date` sets color: #fff on background-color: #e74c3c — 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them. — core/src/sphinx/themes/sphinx_rtd_theme/static/css/badge_only.css:1
  • `.btn` sets color: #fff on background-color: #27ae60 — 2.9:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from). — core/src/sphinx/themes/sphinx_rtd_theme/static/css/theme.css:4
  • `select:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — core/src/sphinx/themes/sphinx_rtd_theme/static/css/theme.css:4
  • `.fa-spin` moves (`animation: fa-spin 2s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — core/src/sphinx/themes/sphinx_rtd_theme/static/css/theme.css:4
  • `.fa-pulse` moves (`animation: fa-spin 1s steps(8) infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — core/src/sphinx/themes/sphinx_rtd_theme/static/css/theme.css:4

What to do

  • Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified

Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.

Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.

Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.

  • No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 6 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.

What to do

  • Enforce accessibility in the test suite you already have: assert the accessibility invariants over the HTML your app renders — parse the rendered output in an existing test, or drive a real browser from one — and gate that test in CI so a regression blocks the merge.
AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

What to do

  • The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

AX4 · Dependency direction10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

AX6 · Interface segregation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

GD1 · Unfinished & placeholder code10.0 / 10Exemplary✓ Tool-verified

Other · Code Health — Unreviewed-generation residue in this repository's Scala: methods whose whole body is still `???` or a "not implemented" throw where nothing overrides them, and placeholder text (lorem ipsum, changeme/replace_me…) left in strings of non-test, non-generated code. Scored as a quality signature, never as a claim about authorship.

Method: Roslyn syntax scan: NotImplementedException throws and placeholder string literals in non-test, non-generated shipped code. Deterministic, code-shape signature.

  • `initEnv` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:277
  • `min` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1054
  • `max` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1055
  • `fromByte` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1057
  • `fromShort` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1058
  • `fromInt` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1059
  • `fromLong` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1060
  • `mod` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1070
  • `widen` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1083
  • `narrow` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1084
  • `toSigned` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1085
  • `toUnsigned` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1086
  • `toByte` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1088
  • `toShort` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1089
  • `toInt` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1090
  • `toLong` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1091

What to do

  • Finish or delete the members whose body is still `???` or a "not implemented" throw where nothing overrides them, and replace placeholder text before shipping.
IC1 · Incompleteness & stubs6.5 / 10Adequate✓ Tool-verified

Other · Code Health — Unfinished work detected by code SHAPE, not keywords, in this repository's Scala: methods whose body is `???` or only throws a "not implemented" error, methods that take inputs and return a constant or do nothing, dead `if (false)` branches, and skeleton classes most of whose methods are holes.

Method: Roslyn syntax scan: incompleteness by code shape (constant-returning methods, async-never-await, #if false branches, guards that return what the code already falls through to, tests an earlier guard already decided, comparisons against NaN, skeleton types), not keyword-gated. Deterministic, code-shape heuristic.

  • `initEnv` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:277
  • `StaticChecks` has 4 unfinished members out of 4 declared methods (whether or not each carries a body) — a scaffolded class that was never implemented. — frontends/library/stainless/lang/StaticChecks.scala:5
  • `require` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. (×2) — frontends/library/stainless/lang/StaticChecks.scala:31, frontends/library/stainless/lang/StaticChecks.scala:34
  • `assert` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it. (×2) — frontends/library/stainless/lang/StaticChecks.scala:37, frontends/library/stainless/lang/StaticChecks.scala:40
  • `BitVectors` has 6 unfinished members out of 8 declared methods (whether or not each carries a body) — a scaffolded class that was never implemented. — frontends/library/stainless/math/BitVectors.scala:14
  • `min` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1054
  • `max` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1055
  • `fromByte` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1057
  • `fromShort` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1058
  • `fromInt` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1059
  • `fromLong` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1060
  • `BV` has 9 unfinished members out of 11 declared methods (whether or not each carries a body) — a scaffolded class that was never implemented. — frontends/library/stainless/math/BitVectors.scala:1062
  • `mod` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1070
  • `widen` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1083
  • `narrow` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1084
  • `toSigned` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1085
  • `toUnsigned` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1086
  • `toByte` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1088
  • `toShort` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1089
  • `toInt` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1090
  • `toLong` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface. — frontends/library/stainless/math/BitVectors.scala:1091
  • `inline` has an empty body — confirm it's an intentional no-op and not an unfinished method. — frontends/library/stainless/lang/StaticChecks.scala:26
  • `opaque` has an empty body — confirm it's an intentional no-op and not an unfinished method. — frontends/library/stainless/lang/StaticChecks.scala:27

What to do

  • Finish or delete the unfinished stubs (functions that throw "not implemented", or whose body is empty or a bare constant) — they are dead surface that looks live.
  • Clear the softer debt: re-enable or delete `ignore`d and `pending` tests, decide whether each empty method or UnsupportedOperationException is deliberate (and say so in a comment), and replace a bare `// scalastyle:off` or `@nowarn` with targeted, justified suppressions.
M1 · Documentation (README)7.3 / 10Strong✓ Tool-verified

Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.

Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.

What to do

  • Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
M2 · Architecture documentation0.0 / 10Critical✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
  • No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
  • Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.

Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.

M4 · Documentation accuracy8.0 / 10Strong◐ Sampled · advisory

Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).

Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.

  • docs/README.md names `core/src/scala`, but no file or folder `core/src/scala` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/README.md:3

What to do

  • Reconcile the README with reality: docs/README.md names `core/src/scala`, but no file or folder `core/src/scala` exists.
P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged

Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.

Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.

P2 · Observability7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.

Method: Filesystem/Roslyn scan: structured-logging frameworks (Serilog, NLog), OpenTelemetry, and health-check endpoint patterns. Exhaustive, deterministic.

P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).

Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.

  • No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 16093 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.

What to do

  • Add a SAST step to CI running what this repository's stack ships: scalafix or scapegoat — or `semgrep --config=auto`, which runs on any language — so a security regression fails the build instead of landing.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback7.0 / 10Strong✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

P6 · Release Hygiene5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.

Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.

  • No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)

What to do

  • Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.

Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.

X1 · Async correctness4.8 / 10Adequate✓ Tool-verified

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

  • The `Future` this starts is not kept anywhere, and `scala.concurrent.Future` never reports a failure on its own: `Future { … }` catches any non-fatal exception its body throws and stores it as the future's `Failure` — not rethrown, not printed, not passed to the `ExecutionContext`'s `reportFailure` — so once nobody holds the future the error is gone, and nothing can wait for the work to finish either. Keep the future and compose it into what the caller returns (`for`/`flatMap`, `Future.sequence`), or, for genuine fire-and-forget, attach a handler that reports the failure — `Future { … }.failed.foreach(error => log.error("…", error))` or `.onComplete { case Failure(e) => report(e); case _ => }` — or catch and report inside the body itself. — core/src/main/scala/stainless/utils/FileWatcher.scala:37

What to do

  • Future started here is not kept
X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

X14 · Bypassable address classification10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.

Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.

X16 · Unfloored truncation loop10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.

Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.

X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.

Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.

X18 · Disposal-pattern correctness5.4 / 10Adequate✓ Tool-verified

Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.

Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.

  • `Files.list(…)` opens something that has to be given back — a file descriptor, a socket, a directory handle — and its only use reads `.collect` through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: `Too many open files` under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with `scala.util.Using.resource(Files.list(…)) { r => … }`, which releases it on every path including a throw, or hold it and call `.close()` in a `finally`. (×2) — core/src/main/scala/stainless/frontend/DependencyResolver.scala:156, sbt-plugin/src/main/scala/ch/epfl/lara/sbt/stainless/StainlessPlugin.scala:173

What to do

  • Each finding names the value and the span that decides who owns it — the `new` that created it, or the constructor parameter that handed it over. Confirm ownership from that span, then make the disposal match it: release what this type created, leave what it was injected with to whoever created THAT, and drop a finalizer whose type holds nothing unmanaged to release.
X19 · Unrestored process-global state10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.

Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.

X20 · Mistyped argument guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether an argument guard throws the exception its own condition describes — a guard that rejects a value for being EMPTY and reports it as `NullPointerException` (Java, Kotlin, Scala), `ArgumentError.notNull` (Dart) or `ArgumentNullException` (F#'s `nullArg`) tells the caller a parameter was null when it provably was not.

Method: Roslyn syntax: `throw new ArgumentNullException(nameof(p))` statements controlled by an `if`, whose condition is read for a test that is true of a NON-null `p` — an emptiness test that dereferences it (`p.Count == 0`, `!p.Any()`) or a BCL predicate documented true of the empty value (`string.IsNullOrEmpty(p)`). Deterministic, provable per finding. Advisory.

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

X22 · Contradicted release guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.

Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.

X23 · Unguarded diagnostic materialisation10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.

Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

X26 · Unsynchronised callback handoff10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.

Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for` comprehension or `foreach` leaves the mutable collection it is walking alone — an `ArrayBuffer` or `ListBuffer` counts its changes and its iterator checks the count, an `ArrayDeque` (and `mutable.Queue`/`mutable.Stack`) is walked by index up to its starting length, and a `java.util` collection walked through `asScala` is fail-fast, so a body that adds to or removes from the very collection the loop is walking makes a later step throw `ConcurrentModificationException` (`IndexOutOfBoundsException` for a deque) and the remaining elements are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.

Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.

X3 · Exception handling5.5 / 10Adequate✓ Tool-verified

Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.

Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.

  • `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×3) — core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:751, core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:773, core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:841
  • `case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×4) — frontends/library/stainless/io/FileOutputStream.scala:119, frontends/library/stainless/io/FileOutputStream.scala:145, frontends/library/stainless/io/FileOutputStream.scala:171, …

What to do

  • Swallowed exception (caught, then discarded)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

X5 · Nullable reference types2.0 / 10Critical✓ Tool-verified

Other · Code Health — Whether Scala's null is held to the type system and not undermined by assertions — a file compiled with `-Yexplicit-nulls` is one where `String` excludes null and `String | Null` admits it, a file under WartRemover's `Null` wart or Scalafix's `DisableSyntax.noNulls` is one whose code cannot write `null` and must say `Option`, and each `.nn`, `import scala.language.unsafeNulls` or null-lint suppression is the author overruling that.

Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.

  • No build over this repository's 370 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.

What to do

  • On Scala 3, add `-Yexplicit-nulls` to `scalacOptions` so `String` and `String | Null` mean different things, and type each Java API's result as nullable where it can return null; on Scala 2 (or as a first step), enable WartRemover's `Null` wart (`wartremoverErrors += Wart.Null`) or Scalafix's `DisableSyntax.noNulls = true` so the code holds absence in `Option`. Then pay the assertions down rather than adding to them: each `.nn` is a null the compiler could not rule out — wrap the Java value in `Option(…)` at the boundary, pattern-match on `null` once there, or change the API so the null cannot arrive; an `unsafeNulls` import switches the checking off for everything after it.

WCAG coverage — what static analysis assessed

Statically assessed 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).

DimensionWCAG 2.2 A/AA criteriaCoverage
AC2 · Forms & labels1.3.1, 3.3.2, 4.1.2Partial signal
AC3 · Page structure1.4.4, 2.2.1, 2.4.1, 2.4.2, 3.1.1, 4.1.2Partial signal
AC5 · ARIA correctness4.1.2Partial signal
AC6 · Visual & motion safety1.4.3, 2.4.7Partial — literal CSS only
AC7 · A11y enforcementenforcement — no page criterionEnforcement posture (process)

Not statically assessed — these 45 Level A/AA criteria need runtime or manual evaluation (WCAG-EM): 1.1.1, 1.2.1, 1.2.2, 1.2.3, 1.2.4, 1.2.5, 1.3.2, 1.3.3, 1.3.4, 1.3.5, 1.4.1, 1.4.2, 1.4.5, 1.4.10, 1.4.11, 1.4.12, 1.4.13, 2.1.1, 2.1.2, 2.1.4, 2.2.2, 2.3.1, 2.4.3, 2.4.4, 2.4.5, 2.4.6, 2.4.11, 2.5.1, 2.5.2, 2.5.3, 2.5.4, 2.5.7, 2.5.8, 3.1.2, 3.2.1, 3.2.2, 3.2.3, 3.2.4, 3.2.6, 3.3.1, 3.3.3, 3.3.4, 3.3.7, 3.3.8, 4.1.3.

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

LensScoreRatingImpact
Code Health48%Adequate — gated by X5Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture93%Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity52%Adequate — gated by D34, M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness55%Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security68%Adequate — gated by D29, D36Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Accessibility47%Adequate — gated by AC6Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance100%ExemplaryStrongest area.
Unscored — 1 check(s) recorded observations but carry no score

These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.

  • X10 Duplicated predicate — 18 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 48 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

  • AC1 Text alternatives — No image/media element found in the parsed markup — AC1 not applicable here.
  • AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
  • AX1 Captive dependencies — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. No class in this Scala code is a Play controller, a Cask routes object, a Scalatra servlet, a Finatra controller, an Akka/Pekko HTTP routes holder or a JSR-330/Spring singleton, so no instance is shared between request threads.
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — docker build failed (exit 1) — DEPRECATED: The legacy builder is deprecated and will be removed in a future release. Install the buildx component to build images with BuildKit: https://docs.docker.com/go/bui…; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named column (email, first_name, date_of_birth, phone_number, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, a MongoDB or Cassandra driver, JDBC) imported either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, firstName, dateOfBirth, phoneNumber, …) or stored credential on a Slick table or in a SQL migration's CREATE TABLE or ALTER TABLE — and no database or data-store client (Slick, Doobie, Quill, ScalikeJDBC, Anorm, Skunk, JDBC, MongoDB, Cassandra, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D10 Test Quality — ~5124 lines of test source are present (.scala) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D11 Test Reliability — Test reliability not included — the .scala suite was found but not re-run
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout nor 2+ sibling source directories each declaring an aggregate root. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — No inline comments to assess — comment value is not applicable here.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.scala), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D32 Data Compliance (PII/GDPR) — 83 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage not included — suite not readable by the collector
  • DM1 Domain Modelling — applicable but not scored (2 signals for this style, 2 needed — the count is met but a required primary signal is absent): 1704 value object(s); 18 domain event(s); its domain events are published by services or handlers — no domain entity raises one
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JVM source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`addSbtPlugin("org.scoverage" % "sbt-scoverage" % "<version>")` in `project/plugins.sbt`, then `sbt clean coverage test coverageReport`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for `@Benchmark` in a Java, Kotlin or Scala file importing JMH or kotlinx-benchmark, Jetpack Benchmark's `measureRepeated` in a file importing androidx.benchmark, or JMH/kotlinx-benchmark/androidx.benchmark in a pom.xml, Gradle or sbt build, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not applicable: allocation awareness is rated where code engineers for it — at least 400 production lines that ship benchmarks or already use allocation-aware idioms (8 or more). This repository's Scala code has 72,772 production line(s), 6 such use(s) and no benchmarks, so there is no allocation work to rate. The card is reward-only: its absence costs nothing.
  • S1 Web-Security Posture — No web surface: 348 Scala file(s) were read for weak hashes and ciphers, key material fixed in the source, disabled TLS certificate validation and obsolete TLS versions, and none was found. This repository serves no HTTP of its own — no HTTP-server artifact (akka-http, pekko-http, http4s, Play, Finagle, zio-http, cask, Scalatra, a tapir server, Jetty, Undertow, …) outside test scope in its build, and no server package imported or server bound in its production source — so HTTPS enforcement, HSTS, cookie flags and input validation are N/A here, as they are for a C# library or worker. If this codebase starts serving HTTP, the dimension reactivates automatically.
  • X2 Cancellation propagation — no C# was loaded; this repository's Scala was read, and no request in it can be cancelled by a caller — a Scala request takes no token: a Future cannot be cancelled, and cats-effect, ZIO and Monix interrupt the fiber that made the request from outside the call, not through a parameter
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X4 Structured logging — This check asks whether log calls keep a message's values apart from its text, which needs a logger that can carry them as fields. This repository's Scala was read, and it logs through none that an interpolated message defeats: scala-logging takes an `s"…"` message apart into SLF4J's pattern and arguments at compile time, and log4s, grizzled-slf4j, Play's Logger, Akka's LoggingAdapter, sbt's Logger and Spark's Logging take one finished message (as log4net does in C#). Calls made straight through SLF4J (`org.slf4j.Logger`) would be judged.
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X7 Silent fallback defaults — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 30 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D31 · IaC & Container Security · High IaC · ×4
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
Serious — 546 finding(s)
D17 · Explicit Debt · TodoComment · ×88
  • TodoComment core/src/main/scala/stainless/MainHelpers.scala:151 — // TODO add (optional) customisation points for CallBacks to access intermediate reports(?) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/ast/Definitions.scala:14 — // TODO: Move Erasable to Inox? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/codegen/CodeGeneration.scala:323 — // TODO: externs!! — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/evaluators/FunctionSplitting.scala:24 — // TODO: consider splitting expressions within lambdas/foralls as well. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/Trees.scala:189 — // TODO(gsps): Cache this ClassDef — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/HeapASTExtractors.scala:37 — // TODO(gsps): Cache this ClassDef — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/SymbolOps.scala:38 — // TODO: Add cache — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/ImperativeCodeElimination.scala:208 — // TODO(gsps): Migrate to new specs API — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/ImperativeCodeElimination.scala:345 — //TODO: no support for true mutual recursion — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/ImperativeCodeElimination.scala:352 — //TODO: handle vars in scope, just like LetRec — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/ImperativeCodeElimination.scala:388 — //TODO: this should be handled properly by the Operator case, but there seems to be a subtle bug in the way Let's are lifted — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/ImperativeCodeElimination.scala:396 — //TODO: same as the assert case — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:226 — // TODO: more expressions can be added to be "provably different" — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:11 — // TODO(gsps): Ghost annotations are currently unchecked. Should be able to reuse `GhostChecker`. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:196 — // TODO: Handle mutable types other than classes — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:210 — // TODO: PiType — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:297 — // TODO: Add mechanism to keep freshly allocated objects apart from older ones — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:357 — // TODO(gsps): Add ability to refer back to old state snapshots for any ghost code — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:558 — // TODO(gsps): Support lets and multiple preconditions here. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:747 — // TODO: Even though this copy of the reads expressions is pure and unused, the VC — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/methods/Trees.scala:431 — // TODO: handle implicit arguments and/or default values — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/oo/TypeOps.scala:99 — // TODO: fix for refinements — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/oo/TypeOps.scala:103 — // TODO: fix for refinements — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/oo/Definitions.scala:282 — // TODO: Typedefs — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment core/src/main/scala/stainless/extraction/termination/InductElimination.scala:62 — // TODO: Decide what we want to do with multiple inductions and implement it — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • + 63 more in this group — see findings.md.
D17 · Explicit Debt · FixmeComment · ×53
  • FixmeComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:217 — // FIXME: Transform type arguments in parents? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:234 — // FIXME: This is probably a bad idea, since we might encounter dependent types. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:385 — // FIXME(gsps): Reads and modifies should also be checked within HeapRun. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:414 — // FIXME: Encode the *any reads* and *any writes* cases (when *Dom is None). — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala:482 — // FIXME: This should be `Let` and not `LetVar`, however doing so will cause a crash in e.g. `MapAliasing1` — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/inlining/FunctionSpecialization.scala:163 — // FIXME: Rule out any complex expressions as `targs` and `vargs`? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/inlining/ChooseInjector.scala:41 — // FIXME: Use `specced.wrapLets` as below, so `choose` refers to function parameters? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/innerclasses/Trees.scala:336 — // FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/innerclasses/Trees.scala:337 — // FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/termination/InductElimination.scala:98 — // FIXME: When fd.returnType is a dependent type, we must bind its variables with newParams — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/termination/InductElimination.scala:119 — // FIXME: When fd.returnType is a dependent type, we must bind its variables with newParams — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/extraction/termination/InductElimination.scala:136 — // FIXME: When fd.returnType is a dependent type, we must bind its variables with newParams — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/genc/package.scala:22 — // FIXME: see leon definition — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/genc/ir/Normaliser.scala:405 — // FIXME: Not sure what this is for? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/genc/phases/Scala2IRPhase.scala:642 — // FIXME: Add this warning — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/verification/TypeChecker.scala:1094 — // @romac - FIXME: Properly typecheck Passes — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/verification/TypeChecker.scala:1098 — // @romac - FIXME: What should the result type actually be? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment core/src/main/scala/stainless/verification/CoqExpression.scala:494 — // FIXME: not thread safe — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment frontends/benchmarks/extraction/invalid/GhostCaseClasses.scala:1 — // FIXME: Propagate ghost annotation — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment frontends/benchmarks/extraction/invalid/ErasedCaseClasses.scala:1 — // FIXME: Propagate erased annotation — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment frontends/benchmarks/extraction/invalid/ArrayNested1.scala:5 — // FIXME: Used to be accepted and verified (now rejected at extraction) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment frontends/benchmarks/full-imperative/valid/TreeImmutMap.scala:95 — // FIXME: Times out — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment frontends/benchmarks/full-imperative/valid/TreeImmutMap.scala:132 — // FIXME: Need to know that `tree` is `valid`! — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment frontends/benchmarks/full-imperative/valid/CellDataStructuresAndRepr.scala:87 — // FIXME: Complete the proof of `lemmaListDropTakeConcat`. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • FixmeComment frontends/benchmarks/full-imperative/valid/CellDataStructuresAndRepr.scala:95 — // FIXME: Spurious counterexample when Repr is unsealed — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • + 28 more in this group — see findings.md.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×17
  • Duplicated block (5 lines × 2) core/src/main/scala/stainless/extraction/innerclasses/ExprOps.scala:58 — core/src/main/scala/stainless/extraction/innerclasses/ExprOps.scala:58-62 | core/src/main/scala/stainless/extraction/innerfuns/Trees.scala:214-218 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/innerclasses/ExprOps.scala:58` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:1077 — core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:1077-1081 | core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:1103-1107 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) core/src/main/scala/stainless/extraction/oo/TypeOps.scala:162 — core/src/main/scala/stainless/extraction/oo/TypeOps.scala:162-166 | core/src/main/scala/stainless/extraction/oo/TypeOps.scala:189-193 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/oo/TypeOps.scala:162` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) core/src/main/scala/stainless/solvers/InoxEncoder.scala:115 — core/src/main/scala/stainless/solvers/InoxEncoder.scala:115-119 | core/src/main/scala/stainless/solvers/InoxEncoder.scala:128-132 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) core/src/main/scala/stainless/verification/TypeChecker.scala:837 — core/src/main/scala/stainless/verification/TypeChecker.scala:837-841 | core/src/main/scala/stainless/verification/TypeChecker.scala:851-855 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) core/src/main/scala/stainless/verification/TypeChecker.scala:965 — core/src/main/scala/stainless/verification/TypeChecker.scala:965-969 | core/src/main/scala/stainless/verification/TypeChecker.scala:975-979 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1974 — frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1974-1978 | frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1984-1988 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1974` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2477 — frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2477-2481 | frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2484-2488 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2477` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) frontends/library/stainless/math/FdLibm.scala:1188 — frontends/library/stainless/math/FdLibm.scala:1188-1192 | frontends/library/stainless/math/package.scala:205-209 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:1188` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) frontends/library/stainless/math/FdLibm.scala:1327 — frontends/library/stainless/math/FdLibm.scala:1327-1331 | frontends/library/stainless/math/package.scala:576-580 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:1327` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) frontends/library/stainless/collection/List.scala:602 — frontends/library/stainless/collection/List.scala:602-606 | frontends/library/stainless/covcollection/List.scala:589-593 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (5 lines × 2) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:829 — core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:829-833 | core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:961-965 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (5 lines × 2) core/src/main/scala/stainless/verification/TypeChecker.scala:1009 — core/src/main/scala/stainless/verification/TypeChecker.scala:1009-1013 | core/src/main/scala/stainless/verification/TypeChecker.scala:1048-1052 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/verification/TypeChecker.scala:1009` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) frontends/library/stainless/covcollection/List.scala:471 — frontends/library/stainless/covcollection/List.scala:471-475 | frontends/library/stainless/covcollection/List.scala:484-488 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/covcollection/List.scala:471` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) frontends/library/stainless/math/FdLibm.scala:151 — frontends/library/stainless/math/FdLibm.scala:151-155 | frontends/library/stainless/math/FdLibm.scala:202-206 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:151` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) frontends/library/stainless/math/FdLibm.scala:245 — frontends/library/stainless/math/FdLibm.scala:245-249 | frontends/library/stainless/math/package.scala:174-178 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:245` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (5 lines × 2) frontends/library/stainless/math/FdLibm.scala:2126 — frontends/library/stainless/math/FdLibm.scala:2126-2130 | frontends/library/stainless/math/package.scala:604-608 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:2126` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D3 · God Classes · FileTooLong · ×16
  • FileTooLong: lattices/Core.scala core/src/main/scala/stainless/transformers/lattices/Core.scala — FileTooLong — 2567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2067 over it, 5.13× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: dotc/CodeExtraction.scala frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala — FileTooLong — 2020 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: CodeExtraction (31-2985). The bar is 500 significant lines; this is 1520 over it, 4.04× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: math/FdLibm.scala frontends/library/stainless/math/FdLibm.scala — FileTooLong — 1571 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1071 over it, 3.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: dotc/ASTExtractors.scala frontends/dotty/src/main/scala/stainless/frontends/dotc/ASTExtractors.scala — FileTooLong — 1144 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 644 over it, 2.29× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: verification/TypeChecker.scala core/src/main/scala/stainless/verification/TypeChecker.scala — FileTooLong — 1130 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: TypeChecker (54-1628). The bar is 500 significant lines; this is 630 over it, 2.26× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: math/BitVectors.scala frontends/library/stainless/math/BitVectors.scala — FileTooLong — 1071 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 571 over it, 2.14× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: oo/TypeEncoding.scala core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala — FileTooLong — 999 significant lines (blank, comment-only and punctuation-only lines excluded), about 98% of them inside a single declaration: TypeEncoding (7-1450). The bar is 500 significant lines; this is 499 over it, 2.00× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: imperative/AntiAliasing.scala core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala — FileTooLong — 965 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 465 over it, 1.93× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: equivchk/EquivalenceChecker.scala core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala — FileTooLong — 935 significant lines (blank, comment-only and punctuation-only lines excluded), about 74% of them inside a single declaration: EquivalenceChecker (56-1127). The bar is 500 significant lines; this is 435 over it, 1.87× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: collection/ListMap.scala frontends/library/stainless/collection/ListMap.scala — FileTooLong — 806 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 306 over it, 1.61× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: phases/Scala2IRPhase.scala core/src/main/scala/stainless/genc/phases/Scala2IRPhase.scala — FileTooLong — 720 significant lines (blank, comment-only and punctuation-only lines excluded), about 97% of them inside a single declaration: S2IRImpl (54-1169). The bar is 500 significant lines; this is 220 over it, 1.44× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: imperative/EffectsAnalyzer.scala core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala — FileTooLong — 636 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 136 over it, 1.27× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: collection/List.scala frontends/library/stainless/collection/List.scala — FileTooLong — 596 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: List (14-718). The bar is 500 significant lines; this is 96 over it, 1.19× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: covcollection/List.scala frontends/library/stainless/covcollection/List.scala — FileTooLong — 589 significant lines (blank, comment-only and punctuation-only lines excluded), about 90% of them inside a single declaration: List (13-716). The bar is 500 significant lines; this is 89 over it, 1.18× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
  • FileTooLong: verification/CoqEncoder.scala core/src/main/scala/stainless/verification/CoqEncoder.scala — FileTooLong — 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 over it, 1.12× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: imperative/EffectElaboration.scala core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala — FileTooLong — 508 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 8 over it, 1.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
GD1 · Unfinished & placeholder code · Unfinished stub · ×16
  • Unfinished stub — body is `???` core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:277 — `initEnv` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1054 — `min` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1055 — `max` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1057 — `fromByte` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1058 — `fromShort` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1059 — `fromInt` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1060 — `fromLong` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1070 — `mod` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1083 — `widen` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1084 — `narrow` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1085 — `toSigned` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1086 — `toUnsigned` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1088 — `toByte` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1089 — `toShort` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1090 — `toInt` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is `???` frontends/library/stainless/math/BitVectors.scala:1091 — `toLong` is a shipped member whose whole body is still `???`, and nothing in the repository overrides it — generated scaffolding that was never completed. Implement it or remove the dead surface.
IC1 · Incompleteness & stubs · Unfinished stub · ×16
  • Unfinished stub — body is ??? / NotImplementedError core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:277 — `initEnv` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1054 — `min` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1055 — `max` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1057 — `fromByte` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1058 — `fromShort` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1059 — `fromInt` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1060 — `fromLong` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1070 — `mod` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1083 — `widen` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1084 — `narrow` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1085 — `toSigned` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1086 — `toUnsigned` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1088 — `toByte` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1089 — `toShort` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1090 — `toInt` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
  • Unfinished stub — body is ??? / NotImplementedError frontends/library/stainless/math/BitVectors.scala:1091 — `toLong` is a shipped method whose whole body is `???` (or throws NotImplementedError), and nothing in the repository overrides it — scaffolding that was never completed. Implement it or remove the dead surface.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×12
  • Duplicated block (7 lines × 2) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:399 — core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:399-405 | core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:415-421 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:399` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:399 — core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:399-406 | core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:464-470 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:399` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:350 — core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:350-356 | core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:376-382 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:59 — core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:59-65 | core/src/main/scala/stainless/genc/LeonInlining.scala:67-73 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:59` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:68` calls `exists` and `core/src/main/scala/stainless/genc/LeonInlining.scala:76` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (7 lines × 2) core/src/main/scala/stainless/extraction/oo/TransformerWithType.scala:410 — core/src/main/scala/stainless/extraction/oo/TransformerWithType.scala:410-416 | core/src/main/scala/stainless/extraction/oo/TransformerWithType.scala:423-429 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/oo/TransformerWithType.scala:410` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) core/src/main/scala/stainless/termination/SizeFunctions.scala:102 — core/src/main/scala/stainless/termination/SizeFunctions.scala:102-108 | core/src/main/scala/stainless/termination/SizeFunctions.scala:128-134 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/termination/SizeFunctions.scala:102` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `zero` to `x >=` in one and `x ===` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (7 lines × 2) core/src/main/scala/stainless/termination/TerminationChecker.scala:40 — core/src/main/scala/stainless/termination/TerminationChecker.scala:40-46 | core/src/main/scala/stainless/termination/TerminationChecker.scala:50-56 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/termination/TerminationChecker.scala:40` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) frontends/library/stainless/collection/List.scala:613 — frontends/library/stainless/collection/List.scala:613-619 | frontends/library/stainless/covcollection/List.scala:598-604 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/collection/List.scala:613` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
  • Duplicated block (7 lines × 2) frontends/library/stainless/collection/ListMapLemmas.scala:348 — frontends/library/stainless/collection/ListMapLemmas.scala:348-354 | frontends/library/stainless/collection/ListMapLemmas.scala:364-370 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/collection/ListMapLemmas.scala:348` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:240 — core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:240-246 | core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:262-268 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (7 lines × 2) frontends/library/stainless/math/FdLibm.scala:1392 — frontends/library/stainless/math/FdLibm.scala:1392-1398 | frontends/library/stainless/math/package.scala:279-285 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:1392` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (7 lines × 2) frontends/library/stainless/math/FdLibm.scala:1866 — frontends/library/stainless/math/FdLibm.scala:1866-1872 | frontends/library/stainless/math/package.scala:753-759 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:1866` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D3 · God Classes · TooManyMethods · ×11
  • TooManyMethods: Core core/src/main/scala/stainless/transformers/lattices/Core.scala:8 — TooManyMethods — 83 methods. The bar is 30 methods; this is 53 over it, 2.77× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: Definitions core/src/main/scala/stainless/transformers/lattices/Definitions.scala:7 — TooManyMethods — 80 methods. The bar is 30 methods; this is 50 over it, 2.67× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: List frontends/library/stainless/covcollection/List.scala:12 — TooManyMethods — 72 methods. The bar is 30 methods; this is 42 over it, 2.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: List frontends/library/stainless/collection/List.scala:12 — TooManyMethods — 68 methods. The bar is 30 methods; this is 38 over it, 2.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: math frontends/library/stainless/math/package.scala:139 — TooManyMethods — 66 methods. The bar is 30 methods; this is 36 over it, 2.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: CodeExtraction frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:31 — TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: TupleListOpsGenK frontends/library/stainless/collection/ListMap.scala:147 — TooManyMethods — 43 methods. The bar is 30 methods; this is 13 over it, 1.43× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: ASTExtractors frontends/dotty/src/main/scala/stainless/frontends/dotc/ASTExtractors.scala:23 — TooManyMethods — 38 methods. The bar is 30 methods; this is 8 over it, 1.27× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: S2IRImpl core/src/main/scala/stainless/genc/phases/Scala2IRPhase.scala:54 — TooManyMethods — 37 methods. The bar is 30 methods; this is 7 over it, 1.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: ListMapLemmas frontends/library/stainless/collection/ListMapLemmas.scala:11 — TooManyMethods — 33 methods. The bar is 30 methods; this is 3 over it, 1.10× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • TooManyMethods: CoqEncoder core/src/main/scala/stainless/verification/CoqEncoder.scala:9 — TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×9
  • Duplicated block (6 lines × 2) core/src/main/scala/stainless/ast/ExprOps.scala:398 — core/src/main/scala/stainless/ast/ExprOps.scala:398-403 | core/src/main/scala/stainless/ast/TypeOps.scala:82-87 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/ast/ExprOps.scala:398` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) core/src/main/scala/stainless/codegen/CodeGeneration.scala:1661 — core/src/main/scala/stainless/codegen/CodeGeneration.scala:1661-1666 | core/src/main/scala/stainless/codegen/CodeGeneration.scala:1669-1674 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) core/src/main/scala/stainless/codegen/CodeGeneration.scala:1686 — core/src/main/scala/stainless/codegen/CodeGeneration.scala:1686-1691 | core/src/main/scala/stainless/codegen/CodeGeneration.scala:1694-1699 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) core/src/main/scala/stainless/codegen/CodeGeneration.scala:2292 — core/src/main/scala/stainless/codegen/CodeGeneration.scala:2292-2297 | core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:100-105 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/codegen/CodeGeneration.scala:2292` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:393 — core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:393-398 | core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:409-414 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:393` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) core/src/main/scala/stainless/verification/TypeChecker.scala:1077 — core/src/main/scala/stainless/verification/TypeChecker.scala:1077-1082 | core/src/main/scala/stainless/verification/TypeChecker.scala:1084-1089 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) frontends/library/stainless/collection/ListMap.scala:306 — frontends/library/stainless/collection/ListMap.scala:306-311 | frontends/library/stainless/collection/ListMap.scala:365-370 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (6 lines × 2) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2012 — frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2012-2017 | frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2026-2031 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2012` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (6 lines × 2) frontends/library/stainless/math/FdLibm.scala:1573 — frontends/library/stainless/math/FdLibm.scala:1573-1578 | frontends/library/stainless/math/package.scala:631-636 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:1573` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×7
  • Duplicated block (9 lines × 2) core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:120 — core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:120-128 | core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:132-140 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:120` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:120 — core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:120-128 | core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:139-147 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:176 — core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:176-184 | core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:187-195 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) frontends/dotty/src/main/scala/stainless/frontends/dotc/ASTExtractors.scala:1894 — frontends/dotty/src/main/scala/stainless/frontends/dotc/ASTExtractors.scala:1894-1902 | frontends/dotty/src/main/scala/stainless/frontends/dotc/ASTExtractors.scala:1906-1914 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (9 lines × 2) frontends/library/stainless/math/FdLibm.scala:1271 — frontends/library/stainless/math/FdLibm.scala:1271-1279 | frontends/library/stainless/math/package.scala:251-259 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (9 lines × 2) frontends/library/stainless/math/FdLibm.scala:1503 — frontends/library/stainless/math/FdLibm.scala:1503-1511 | frontends/library/stainless/math/package.scala:706-714 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:1503` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (9 lines × 2) frontends/library/stainless/math/FdLibm.scala:1725 — frontends/library/stainless/math/FdLibm.scala:1725-1733 | frontends/library/stainless/math/package.scala:691-699 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:1725` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×7
  • Duplicated block (8 lines × 2) core/src/main/scala/stainless/ast/ExprOps.scala:443 — core/src/main/scala/stainless/ast/ExprOps.scala:443-450 | core/src/main/scala/stainless/ast/ExprOps.scala:490-497 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/ast/ExprOps.scala:443` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) core/src/main/scala/stainless/extraction/innerclasses/DependencyGraph.scala:64 — core/src/main/scala/stainless/extraction/innerclasses/DependencyGraph.scala:64-71 | core/src/main/scala/stainless/extraction/methods/DependencyGraph.scala:75-82 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/innerclasses/DependencyGraph.scala:64` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) core/src/main/scala/stainless/extraction/innerclasses/TypeOps.scala:46 — core/src/main/scala/stainless/extraction/innerclasses/TypeOps.scala:46-53 | core/src/main/scala/stainless/extraction/innerclasses/TypeOps.scala:69-76 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/innerclasses/TypeOps.scala:46` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) core/src/main/scala/stainless/transformers/lattices/Core.scala:3449 — core/src/main/scala/stainless/transformers/lattices/Core.scala:3449-3456 | core/src/main/scala/stainless/transformers/lattices/Core.scala:3463-3470 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/transformers/lattices/Core.scala:3449` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) frontends/library/stainless/math/FdLibm.scala:1773 — frontends/library/stainless/math/FdLibm.scala:1773-1780 | frontends/library/stainless/math/package.scala:725-732 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:1773` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (8 lines × 2) core/src/main/scala/stainless/frontend/BatchedCallBack.scala:137 — core/src/main/scala/stainless/frontend/BatchedCallBack.scala:137-144 | core/src/main/scala/stainless/frontend/SplitCallBack.scala:217-224 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
  • Duplicated block (8 lines × 2) frontends/library/stainless/math/FdLibm.scala:1652 — frontends/library/stainless/math/FdLibm.scala:1652-1659 | frontends/library/stainless/math/package.scala:645-652 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:1652` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×7
  • Swallowed exception (caught, then discarded) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:751 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:773 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:841 — `case NonFatal(_)` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) frontends/library/stainless/io/FileOutputStream.scala:119 — `case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) frontends/library/stainless/io/FileOutputStream.scala:145 — `case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) frontends/library/stainless/io/FileOutputStream.scala:171 — `case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) frontends/library/stainless/io/FileOutputStream.scala:197 — `case _: Throwable` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×5
  • Duplicated block (13 lines × 2) core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:359 — core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:359-371 | core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:385-397 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:359` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) core/src/main/scala/stainless/extraction/imperative/SymbolOps.scala:24 — core/src/main/scala/stainless/extraction/imperative/SymbolOps.scala:24-36 | core/src/main/scala/stainless/extraction/innerfuns/SymbolOps.scala:24-36 — `core/src/main/scala/stainless/extraction/imperative/SymbolOps.scala` and `core/src/main/scala/stainless/extraction/innerfuns/SymbolOps.scala` are one unit implemented once per sibling directory, so they are most likely parallel implementations of one contract rather than a copy of each other — this scan matched 1 separate duplicated blocks between them, totalling at least 13 lines. If both are selected at run time, neither can be retired in favour of the other, and the lines that DIFFER between them are the reason both exist. The move that pays here is to hoist the identical part into a shared location the whole family can reach and give what differs a parameter or a seam, so a change lands once instead of once per sibling; extracting one helper per block leaves every sibling to drift on its own. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/imperative/SymbolOps.scala:24` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:42 — core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:42-54 | core/src/main/scala/stainless/genc/LeonInlining.scala:44-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:42` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) core/src/main/scala/stainless/genc/ir/Referentiator.scala:74 — core/src/main/scala/stainless/genc/ir/Referentiator.scala:74-86 | core/src/main/scala/stainless/genc/ir/Transformer.scala:56-68 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/genc/ir/Referentiator.scala:74` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (13 lines × 2) core/src/main/scala/stainless/genc/phases/GlobalStateChecker.scala:28 — core/src/main/scala/stainless/genc/phases/GlobalStateChecker.scala:28-40 | core/src/main/scala/stainless/genc/phases/GlobalStateChecker.scala:71-83 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/genc/phases/GlobalStateChecker.scala:28` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×4
  • Duplicated block (11 lines × 2) core/src/main/scala/stainless/ast/Deconstructors.scala:77 — core/src/main/scala/stainless/ast/Deconstructors.scala:77-87 | core/src/main/scala/stainless/ast/Deconstructors.scala:122-132 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (11 lines × 2) core/src/main/scala/stainless/codegen/CodeGeneration.scala:1906 — core/src/main/scala/stainless/codegen/CodeGeneration.scala:1906-1916 | core/src/main/scala/stainless/codegen/CodeGeneration.scala:1969-1979 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/codegen/CodeGeneration.scala:1906` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala:386 — core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala:386-396 | core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala:410-420 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala:386` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (11 lines × 2) frontends/library/stainless/collection/ListMap.scala:292 — frontends/library/stainless/collection/ListMap.scala:292-302 | frontends/library/stainless/collection/ListMap.scala:352-362 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/collection/ListMap.scala:292` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D6 · Cohesion (LCOM4) · Low cohesion · ×4
  • Low cohesion: Canonization (LCOM4 8) core/src/main/scala/stainless/utils/Canonization.scala:8 — Canonization's methods fall into 8 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 8 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: ExprOps (LCOM4 7) core/src/main/scala/stainless/ast/ExprOps.scala:13 — ExprOps's methods fall into 7 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 7 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Monitor (LCOM4 5) core/src/main/scala/stainless/evaluators/CodeGenEvaluator.scala:37 — Monitor's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: FragmentChecker (LCOM4 4) frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala:37 — FragmentChecker's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
IC1 · Incompleteness & stubs · Empty method body · ×4
  • Empty method body — does nothing with its inputs frontends/library/stainless/lang/StaticChecks.scala:31 — `require` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs frontends/library/stainless/lang/StaticChecks.scala:34 — `require` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs frontends/library/stainless/lang/StaticChecks.scala:37 — `assert` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
  • Empty method body — does nothing with its inputs frontends/library/stainless/lang/StaticChecks.scala:40 — `assert` takes parameters but its body is empty — it accepts inputs and does nothing. Either implement it or remove it.
D3 · God Classes · ClassTooLong · ×3
  • ClassTooLong: CodeExtraction frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:31 — ClassTooLong — 1995 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 1595 over it, 4.99× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: S2IRImpl core/src/main/scala/stainless/genc/phases/Scala2IRPhase.scala:54 — ClassTooLong — 697 significant lines (blank, comment-only and punctuation-only lines excluded), 37 methods. The bar is 400 significant lines; this is 297 over it, 1.74× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
  • ClassTooLong: FragmentChecker frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala:37 — ClassTooLong — 426 significant lines (blank, comment-only and punctuation-only lines excluded), 12 methods. The bar is 400 significant lines; this is 26 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
D36 · Supply-chain Provenance & Signing REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×3
  • Duplicated block (10 lines × 2) core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:239 — core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:239-248 | core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:254-263 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:239` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) core/src/main/scala/stainless/extraction/innerclasses/Definitions.scala:30 — core/src/main/scala/stainless/extraction/innerclasses/Definitions.scala:30-39 | core/src/main/scala/stainless/extraction/oo/Definitions.scala:30-39 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/innerclasses/Definitions.scala:30` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (10 lines × 2) core/src/main/scala/stainless/extraction/package.scala:207 — core/src/main/scala/stainless/extraction/package.scala:207-216 | core/src/main/scala/stainless/package.scala:111-120 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/package.scala:207` it runs out through the closing brace of the declaration holding it — the window is that declaration's tail, not a fragment that begins part-way through something, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
IC1 · Incompleteness & stubs · Skeleton type · ×3
  • Skeleton type — most members are unfinished frontends/library/stainless/lang/StaticChecks.scala:5 — `StaticChecks` has 4 unfinished members out of 4 declared methods (whether or not each carries a body) — a scaffolded class that was never implemented.
  • Skeleton type — most members are unfinished frontends/library/stainless/math/BitVectors.scala:14 — `BitVectors` has 6 unfinished members out of 8 declared methods (whether or not each carries a body) — a scaffolded class that was never implemented.
  • Skeleton type — most members are unfinished frontends/library/stainless/math/BitVectors.scala:1062 — `BV` has 9 unfinished members out of 11 declared methods (whether or not each carries a body) — a scaffolded class that was never implemented.
AC6 · Visual & motion safety · Animation without a prefers-reduced-motion guard · ×2
  • Animation without a prefers-reduced-motion guard core/src/sphinx/themes/sphinx_rtd_theme/static/css/theme.css:4 — `.fa-spin` moves (`animation: fa-spin 2s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
  • Animation without a prefers-reduced-motion guard core/src/sphinx/themes/sphinx_rtd_theme/static/css/theme.css:4 — `.fa-pulse` moves (`animation: fa-spin 1s steps(8) infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
D36 · Supply-chain Provenance & Signing REDACTED · ×2
  • REDACTED
  • REDACTED
X18 · Disposal-pattern correctness · Disposable created and abandoned in the function that made it · ×2
  • Disposable created and abandoned in the function that made it core/src/main/scala/stainless/frontend/DependencyResolver.scala:156 — `Files.list(…)` opens something that has to be given back — a file descriptor, a socket, a directory handle — and its only use reads `.collect` through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: `Too many open files` under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with `scala.util.Using.resource(Files.list(…)) { r => … }`, which releases it on every path including a throw, or hold it and call `.close()` in a `finally`.
  • Disposable created and abandoned in the function that made it sbt-plugin/src/main/scala/ch/epfl/lara/sbt/stainless/StainlessPlugin.scala:173 — `Files.list(…)` opens something that has to be given back — a file descriptor, a socket, a directory handle — and its only use reads `.collect` through it and drops it, so this expression both creates the value and is the last place that can release it, and does not. Every call leaks one more open handle until the collector happens to reach it: `Too many open files` under load, and on Windows a file that cannot be replaced or deleted while it is held. Open it with `scala.util.Using.resource(Files.list(…)) { r => … }`, which releases it on every path including a throw, or hold it and call `.close()` in a `finally`.
AC3 · Page structure · Multiple navigation landmarks without distinguishing labels · ×1
  • Multiple navigation landmarks without distinguishing labels core/src/sphinx/themes/sphinx_rtd_theme/layout.html:17 — With more than one navigation landmark, each needs an aria-label/aria-labelledby (e.g. "Primary", "Footer") so assistive tech can tell them apart. At least one nav here is unlabelled.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (3.8 · ×1
  • Low contrast colour pair in CSS (3.8:1) core/src/sphinx/themes/sphinx_rtd_theme/static/css/badge_only.css:1 — `.rst-versions .rst-current-version.rst-out-of-date` sets color: #fff on background-color: #e74c3c — 3.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them.
AC6 · Visual & motion safety · Low contrast colour pair in CSS (2.9 · ×1
  • Low contrast colour pair in CSS (2.9:1) core/src/sphinx/themes/sphinx_rtd_theme/static/css/theme.css:4 — `.btn` sets color: #fff on background-color: #27ae60 — 2.9:1, below the 4.5:1 WCAG AA minimum for normal text. This is a MINIFIED, build-generated sheet — editing the literal here is undone by the next vendor drop or rebuild, so override the rule in your own stylesheet (or fix it upstream / in the source the bundle is built from).
AC6 · Visual & motion safety · Focus outline removed in CSS without a · ×1
  • Focus outline removed in CSS without a :focus replacement core/src/sphinx/themes/sphinx_rtd_theme/static/css/theme.css:4 — `select:focus` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
AC7 · A11y enforcement · Accessibility enforcement below the top rung · ×1
  • Accessibility enforcement below the top rung — No accessibility enforcement found — no automated accessibility check runs over the HTML your app renders. Assert the accessibility invariants over that HTML in the test suite you already have (parse the output and assert, or drive a browser), and gate that test in CI so a regression blocks the merge. What was searched, so you can tell an absence from a miss: the 6 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
D1 · Cyclomatic Complexity · AntiAliasing.extractFunction (cyclomatic 229) · ×1
  • AntiAliasing.extractFunction (cyclomatic 229) core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala:99 — AntiAliasing.extractFunction has cyclomatic complexity 229 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeExtraction.extractTree (cyclomatic 217) · ×1
  • CodeExtraction.extractTree (cyclomatic 217) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1396 — CodeExtraction.extractTree has cyclomatic complexity 217 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeGeneration.mkExpr (cyclomatic 183) · ×1
  • CodeGeneration.mkExpr (cyclomatic 183) core/src/main/scala/stainless/codegen/CodeGeneration.scala:623 — CodeGeneration.mkExpr has cyclomatic complexity 183 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · TypeChecker.inferType (cyclomatic 180) · ×1
  • TypeChecker.inferType (cyclomatic 180) core/src/main/scala/stainless/verification/TypeChecker.scala:453 — TypeChecker.inferType has cyclomatic complexity 180 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeExtraction.extractCall (cyclomatic 153) · ×1
  • CodeExtraction.extractCall (cyclomatic 153) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2129 — CodeExtraction.extractCall has cyclomatic complexity 153 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · TransformerWithType.transform (cyclomatic 119) · ×1
  • TransformerWithType.transform (cyclomatic 119) core/src/main/scala/stainless/extraction/oo/TransformerWithType.scala:69 — TransformerWithType.transform has cyclomatic complexity 119 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · EffectsChecker.checkEffects (cyclomatic 115) · ×1
  • EffectsChecker.checkEffects (cyclomatic 115) core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala:18 — EffectsChecker.checkEffects has cyclomatic complexity 115 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Core.simplifyTopLvl (cyclomatic 107) · ×1
  • Core.simplifyTopLvl (cyclomatic 107) core/src/main/scala/stainless/transformers/lattices/Core.scala:1235 — Core.simplifyTopLvl has cyclomatic complexity 107 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Pow.compute (cyclomatic 97) · ×1
  • Pow.compute (cyclomatic 97) frontends/library/stainless/math/FdLibm.scala:1877 — Pow.compute has cyclomatic complexity 97 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · S2IRImpl.rec (cyclomatic 93) · ×1
  • S2IRImpl.rec (cyclomatic 93) core/src/main/scala/stainless/genc/phases/Scala2IRPhase.scala:877 — S2IRImpl.rec has cyclomatic complexity 93 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeExtraction.extractType (cyclomatic 86) · ×1
  • CodeExtraction.extractType (cyclomatic 86) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2659 — CodeExtraction.extractType has cyclomatic complexity 86 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · GhostChecker.checkGhost (cyclomatic 85) · ×1
  • GhostChecker.checkGhost (cyclomatic 85) core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:10 — GhostChecker.checkGhost has cyclomatic complexity 85 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Core.codeOfExpr (cyclomatic 78) · ×1
  • Core.codeOfExpr (cyclomatic 78) core/src/main/scala/stainless/transformers/lattices/Core.scala:711 — Core.codeOfExpr has cyclomatic complexity 78 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · IR2CImpl.rec (cyclomatic 73) · ×1
  • IR2CImpl.rec (cyclomatic 73) core/src/main/scala/stainless/genc/phases/IR2CPhase.scala:147 — IR2CImpl.rec has cyclomatic complexity 73 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · TypeOps.typeBound (cyclomatic 72) · ×1
  • TypeOps.typeBound (cyclomatic 72) core/src/main/scala/stainless/extraction/oo/TypeOps.scala:12 — TypeOps.typeBound has cyclomatic complexity 72 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · EffectsAnalyzer.getTargets (cyclomatic 71) · ×1
  • EffectsAnalyzer.getTargets (cyclomatic 71) core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:517 — EffectsAnalyzer.getTargets has cyclomatic complexity 71 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CPrinter.pp (cyclomatic 69) · ×1
  • CPrinter.pp (cyclomatic 69) core/src/main/scala/stainless/genc/CPrinter.scala:35 — CPrinter.pp has cyclomatic complexity 69 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CompilationUnit.valueToJVM (cyclomatic 67) · ×1
  • CompilationUnit.valueToJVM (cyclomatic 67) core/src/main/scala/stainless/codegen/CompilationUnit.scala:119 — CompilationUnit.valueToJVM has cyclomatic complexity 67 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Atan2.compute (cyclomatic 56) · ×1
  • Atan2.compute (cyclomatic 56) frontends/library/stainless/math/FdLibm.scala:1206 — Atan2.compute has cyclomatic complexity 56 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · TypeEncoding.instanceOf (cyclomatic 55) · ×1
  • TypeEncoding.instanceOf (cyclomatic 55) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:321 — TypeEncoding.instanceOf has cyclomatic complexity 55 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CoqEncoder.transformTree (cyclomatic 54) · ×1
  • CoqEncoder.transformTree (cyclomatic 54) core/src/main/scala/stainless/verification/CoqEncoder.scala:74 — CoqEncoder.transformTree has cyclomatic complexity 54 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Log1p.compute (cyclomatic 47) · ×1
  • Log1p.compute (cyclomatic 47) frontends/library/stainless/math/FdLibm.scala:1674 — Log1p.compute has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ImperativeCodeElimination.extractFunction (cyclomatic 46) · ×1
  • ImperativeCodeElimination.extractFunction (cyclomatic 46) core/src/main/scala/stainless/extraction/imperative/ImperativeCodeElimination.scala:29 — ImperativeCodeElimination.extractFunction has cyclomatic complexity 46 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeGeneration.mkBranch (cyclomatic 45) · ×1
  • CodeGeneration.mkBranch (cyclomatic 45) core/src/main/scala/stainless/codegen/CodeGeneration.scala:1586 — CodeGeneration.mkBranch has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · EffectsAnalyzer.expressionEffects (cyclomatic 45) · ×1
  • EffectsAnalyzer.expressionEffects (cyclomatic 45) core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:804 — EffectsAnalyzer.expressionEffects has cyclomatic complexity 45 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeExtraction.extractClass (cyclomatic 45) · ×1
  • CodeExtraction.extractClass (cyclomatic 45) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:517 — CodeExtraction.extractClass has cyclomatic complexity 45 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · Checker.traverse (cyclomatic 44) · ×1
  • Checker.traverse (cyclomatic 44) frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala:588 — Checker.traverse has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · AssertionInjector.transform (cyclomatic 40) · ×1
  • AssertionInjector.transform (cyclomatic 40) core/src/main/scala/stainless/verification/AssertionInjector.scala:53 — AssertionInjector.transform has cyclomatic complexity 40 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Printer.ppBody (cyclomatic 39) · ×1
  • Printer.ppBody (cyclomatic 39) core/src/main/scala/stainless/extraction/oo/Trees.scala:261 — Printer.ppBody has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Normaliser.recImpl (cyclomatic 39) · ×1
  • Normaliser.recImpl (cyclomatic 39) core/src/main/scala/stainless/genc/ir/Normaliser.scala:37 — Normaliser.recImpl has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Core.generateCond (cyclomatic 39) · ×1
  • Core.generateCond (cyclomatic 39) core/src/main/scala/stainless/transformers/lattices/Core.scala:1573 — Core.generateCond has cyclomatic complexity 39 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: uncoder.combineCtorAlike (cyclomatic 55) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Hypot.compute (cyclomatic 38) · ×1
  • Hypot.compute (cyclomatic 38) frontends/library/stainless/math/FdLibm.scala:1346 — Hypot.compute has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Printer.ppBody (cyclomatic 37) · ×1
  • Printer.ppBody (cyclomatic 37) core/src/main/scala/stainless/ast/Printers.scala:41 — Printer.ppBody has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · RecursiveEvaluator.e (cyclomatic 37) · ×1
  • RecursiveEvaluator.e (cyclomatic 37) core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:15 — RecursiveEvaluator.e has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · ReturnElimination.extractFunction (cyclomatic 37) · ×1
  • ReturnElimination.extractFunction (cyclomatic 37) core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:109 — ReturnElimination.extractFunction has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Analysis.rec (cyclomatic 37) · ×1
  • Analysis.rec (cyclomatic 37) core/src/main/scala/stainless/termination/ControlFlowAnalysis.scala:191 — Analysis.rec has cyclomatic complexity 37 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Expr.getType (cyclomatic 36) · ×1
  • Expr.getType (cyclomatic 36) core/src/main/scala/stainless/genc/ir/IR.scala:191 — Expr.getType has cyclomatic complexity 36 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · FunctionInlining.extractFunction (cyclomatic 35) · ×1
  • FunctionInlining.extractFunction (cyclomatic 35) core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:36 — FunctionInlining.extractFunction has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · CodeExtraction.extractPattern (cyclomatic 35) · ×1
  • CodeExtraction.extractPattern (cyclomatic 35) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:983 — CodeExtraction.extractPattern has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeExtraction.extractBlock (cyclomatic 35) · ×1
  • CodeExtraction.extractBlock (cyclomatic 35) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1221 — CodeExtraction.extractBlock has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Checker.checkType (cyclomatic 35) · ×1
  • Checker.checkType (cyclomatic 35) frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala:449 — Checker.checkType has cyclomatic complexity 35 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Expm1.compute (cyclomatic 34) · ×1
  • Expm1.compute (cyclomatic 34) frontends/library/stainless/math/FdLibm.scala:1599 — Expm1.compute has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · MethodsAbstractSymbols.ensureWellFormedClass (cyclomatic 33) · ×1
  • MethodsAbstractSymbols.ensureWellFormedClass (cyclomatic 33) core/src/main/scala/stainless/extraction/methods/Trees.scala:104 — MethodsAbstractSymbols.ensureWellFormedClass has cyclomatic complexity 33 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
D1 · Cyclomatic Complexity · CodeExtraction.extractStatic (cyclomatic 31) · ×1
  • CodeExtraction.extractStatic (cyclomatic 31) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:213 — CodeExtraction.extractStatic has cyclomatic complexity 31 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: CodeExtraction.injectCastsImpl (cyclomatic 34) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · CompilationUnit.jvmToValue (cyclomatic 30) · ×1
  • CompilationUnit.jvmToValue (cyclomatic 30) core/src/main/scala/stainless/codegen/CompilationUnit.scala:291 — CompilationUnit.jvmToValue has cyclomatic complexity 30 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodePurity.tryFoldImpl (cyclomatic 30) · ×1
  • CodePurity.tryFoldImpl (cyclomatic 30) core/src/main/scala/stainless/transformers/lattices/Core.scala:1971 — CodePurity.tryFoldImpl has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: uncoder.combineCtorAlike (cyclomatic 55) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · VerificationChecker.checkVC (cyclomatic 29) · ×1
  • VerificationChecker.checkVC (cyclomatic 29) core/src/main/scala/stainless/verification/VerificationChecker.scala:279 — VerificationChecker.checkVC has cyclomatic complexity 29 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Atan.compute (cyclomatic 29) · ×1
  • Atan.compute (cyclomatic 29) frontends/library/stainless/math/FdLibm.scala:1139 — Atan.compute has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · EvaluatorRun.execute (cyclomatic 28) · ×1
  • EvaluatorRun.execute (cyclomatic 28) core/src/main/scala/stainless/evaluators/EvaluatorComponent.scala:74 — EvaluatorRun.execute has cyclomatic complexity 28 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeTryFolder.tryFoldImpl (cyclomatic 28) · ×1
  • CodeTryFolder.tryFoldImpl (cyclomatic 28) core/src/main/scala/stainless/transformers/lattices/Core.scala:2874 — CodeTryFolder.tryFoldImpl has cyclomatic complexity 28 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline. This is NOT this file's highest cyclomatic complexity: uncoder.combineCtorAlike (cyclomatic 55) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Exp.compute (cyclomatic 28) · ×1
  • Exp.compute (cyclomatic 28) frontends/library/stainless/math/FdLibm.scala:1537 — Exp.compute has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · math.atan2 (cyclomatic 28) · ×1
  • math.atan2 (cyclomatic 28) frontends/library/stainless/math/package.scala:242 — math.atan2 has cyclomatic complexity 28 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · RefTransformContext.transformFun (cyclomatic 27) · ×1
  • RefTransformContext.transformFun (cyclomatic 27) core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:468 — RefTransformContext.transformFun has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · EffectsAnalyzer.isExpressionFresh (cyclomatic 27) · ×1
  • EffectsAnalyzer.isExpressionFresh (cyclomatic 27) core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:701 — EffectsAnalyzer.isExpressionFresh has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Strengthener.strengthenApplications (cyclomatic 27) · ×1
  • Strengthener.strengthenApplications (cyclomatic 27) core/src/main/scala/stainless/termination/Strengthener.scala:132 — Strengthener.strengthenApplications has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · OL.latticesLeq (cyclomatic 27) · ×1
  • OL.latticesLeq (cyclomatic 27) core/src/main/scala/stainless/transformers/lattices/OL.scala:29 — OL.latticesLeq has cyclomatic complexity 27 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · FunctionSpecialization.extractFunction (cyclomatic 26) · ×1
  • FunctionSpecialization.extractFunction (cyclomatic 26) core/src/main/scala/stainless/extraction/inlining/FunctionSpecialization.scala:38 — FunctionSpecialization.extractFunction has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · FunctionClosure.extractFunction (cyclomatic 26) · ×1
  • FunctionClosure.extractFunction (cyclomatic 26) core/src/main/scala/stainless/extraction/innerfuns/FunctionClosure.scala:23 — FunctionClosure.extractFunction has cyclomatic complexity 26 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · AbstractReport.usageConstructExtendedSummary (cyclomatic 25) · ×1
  • AbstractReport.usageConstructExtendedSummary (cyclomatic 25) core/src/main/scala/stainless/Report.scala:236 — AbstractReport.usageConstructExtendedSummary has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · EquivalenceChecker.concludeRound (cyclomatic 25) · ×1
  • EquivalenceChecker.concludeRound (cyclomatic 25) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:379 — EquivalenceChecker.concludeRound has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TypeChecker.isType (cyclomatic 25) · ×1
  • TypeChecker.isType (cyclomatic 25) core/src/main/scala/stainless/verification/TypeChecker.scala:341 — TypeChecker.isType has cyclomatic complexity 25 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: TypeChecker.checkType (cyclomatic 33) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Asin.compute (cyclomatic 25) · ×1
  • Asin.compute (cyclomatic 25) frontends/library/stainless/math/FdLibm.scala:1016 — Asin.compute has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · math.pow (cyclomatic 25) · ×1
  • math.pow (cyclomatic 25) frontends/library/stainless/math/package.scala:601 — math.pow has cyclomatic complexity 25 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D1 · Cyclomatic Complexity · GhostRewriteTransformer.transform (cyclomatic 24) · ×1
  • GhostRewriteTransformer.transform (cyclomatic 24) frontends/dotty/src/main/scala/stainless/frontends/dotc/GhostAccessRewriter.scala:89 — GhostRewriteTransformer.transform has cyclomatic complexity 24 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · KernelRemPio2.computeModulo (cyclomatic 24) · ×1
  • KernelRemPio2.computeModulo (cyclomatic 24) frontends/library/stainless/math/FdLibm.scala:748 — KernelRemPio2.computeModulo has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · ScalaPrinter.ppBody (cyclomatic 23) · ×1
  • ScalaPrinter.ppBody (cyclomatic 23) core/src/main/scala/stainless/ast/Printers.scala:205 — ScalaPrinter.ppBody has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · TypeOps.patternIsTyped (cyclomatic 23) · ×1
  • TypeOps.patternIsTyped (cyclomatic 23) core/src/main/scala/stainless/ast/TypeOps.scala:20 — TypeOps.patternIsTyped has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeGeneration.mkUnbox (cyclomatic 23) · ×1
  • CodeGeneration.mkUnbox (cyclomatic 23) core/src/main/scala/stainless/codegen/CodeGeneration.scala:1508 — CodeGeneration.mkUnbox has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Scope.empty (cyclomatic 23) · ×1
  • Scope.empty (cyclomatic 23) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:1028 — Scope.empty has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: TypeEncoding.convert (cyclomatic 37) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · LeonInlining.extractFunction (cyclomatic 23) · ×1
  • LeonInlining.extractFunction (cyclomatic 23) core/src/main/scala/stainless/genc/LeonInlining.scala:38 — LeonInlining.extractFunction has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · TreeEncoder.transform (cyclomatic 23) · ×1
  • TreeEncoder.transform (cyclomatic 23) core/src/main/scala/stainless/solvers/InoxEncoder.scala:91 — TreeEncoder.transform has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · SimplifierWithPC.simplify (cyclomatic 23) · ×1
  • SimplifierWithPC.simplify (cyclomatic 23) core/src/main/scala/stainless/transformers/SimplifierWithPC.scala:14 — SimplifierWithPC.simplify has cyclomatic complexity 23 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Log.compute (cyclomatic 23) · ×1
  • Log.compute (cyclomatic 23) frontends/library/stainless/math/FdLibm.scala:1413 — Log.compute has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · MethodLifting.makeFunction (cyclomatic 22) · ×1
  • MethodLifting.makeFunction (cyclomatic 22) core/src/main/scala/stainless/extraction/methods/MethodLifting.scala:232 — MethodLifting.makeFunction has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Scope.transform (cyclomatic 22) · ×1
  • Scope.transform (cyclomatic 22) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:902 — Scope.transform has cyclomatic complexity 22 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: TypeEncoding.convert (cyclomatic 37) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · InductElimination.extractFunction (cyclomatic 22) · ×1
  • InductElimination.extractFunction (cyclomatic 22) core/src/main/scala/stainless/extraction/termination/InductElimination.scala:26 — InductElimination.extractFunction has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · OL.doSimplifyDisjunction (cyclomatic 22) · ×1
  • OL.doSimplifyDisjunction (cyclomatic 22) core/src/main/scala/stainless/transformers/lattices/OL.scala:149 — OL.doSimplifyDisjunction has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · AbstractReport.emitSummary (cyclomatic 21) · ×1
  • AbstractReport.emitSummary (cyclomatic 21) core/src/main/scala/stainless/Report.scala:155 — AbstractReport.emitSummary has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · RecursiveEvaluator.matchesCase (cyclomatic 21) · ×1
  • RecursiveEvaluator.matchesCase (cyclomatic 21) core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:107 — RecursiveEvaluator.matchesCase has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · funRefTransformer.transform (cyclomatic 21) · ×1
  • funRefTransformer.transform (cyclomatic 21) core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:295 — funRefTransformer.transform has cyclomatic complexity 21 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · GhostAnnotationChecker.traverse (cyclomatic 21) · ×1
  • GhostAnnotationChecker.traverse (cyclomatic 21) frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala:284 — GhostAnnotationChecker.traverse has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · TrimSymbols.run (cyclomatic 20) · ×1
  • TrimSymbols.run (cyclomatic 20) core/src/main/scala/stainless/genc/phases/TrimSymbols.scala:28 — TrimSymbols.run has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · CodeGeneration.compileLambda (cyclomatic 19) · ×1
  • CodeGeneration.compileLambda (cyclomatic 19) core/src/main/scala/stainless/codegen/CodeGeneration.scala:365 — CodeGeneration.compileLambda has cyclomatic complexity 19 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions. This is NOT this file's highest cyclomatic complexity: CodeGeneration.typeToJVM (cyclomatic 23) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · Scope.transform (cyclomatic 19) · ×1
  • Scope.transform (cyclomatic 19) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:803 — Scope.transform has cyclomatic complexity 19 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: TypeEncoding.convert (cyclomatic 37) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · CallGraphPrinter.apply (cyclomatic 18) · ×1
  • CallGraphPrinter.apply (cyclomatic 18) core/src/main/scala/stainless/frontend/CallGraphPrinter.scala:15 — CallGraphPrinter.apply has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · CodePurity.fnPurity (cyclomatic 18) · ×1
  • CodePurity.fnPurity (cyclomatic 18) core/src/main/scala/stainless/transformers/lattices/Core.scala:2077 — CodePurity.fnPurity has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: uncoder.combineCtorAlike (cyclomatic 55) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · OL.arithLeq (cyclomatic 18) · ×1
  • OL.arithLeq (cyclomatic 18) core/src/main/scala/stainless/transformers/lattices/OL.scala:106 — OL.arithLeq has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · EquivalenceChecker.tryCreate (cyclomatic 17) · ×1
  • EquivalenceChecker.tryCreate (cyclomatic 17) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:1168 — EquivalenceChecker.tryCreate has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Tan.__kernel_tan (cyclomatic 17) · ×1
  • Tan.__kernel_tan (cyclomatic 17) frontends/library/stainless/math/FdLibm.scala:268 — Tan.__kernel_tan has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · EquivalenceChecker.pickNextExamination (cyclomatic 16) · ×1
  • EquivalenceChecker.pickNextExamination (cyclomatic 16) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:304 — EquivalenceChecker.pickNextExamination has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · Printer.ppBody (cyclomatic 16) · ×1
  • Printer.ppBody (cyclomatic 16) core/src/main/scala/stainless/extraction/innerclasses/Trees.scala:130 — Printer.ppBody has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Referentiator.recImpl (cyclomatic 16) · ×1
  • Referentiator.recImpl (cyclomatic 16) core/src/main/scala/stainless/genc/ir/Referentiator.scala:125 — Referentiator.recImpl has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · GhostElimination.transform (cyclomatic 16) · ×1
  • GhostElimination.transform (cyclomatic 16) core/src/main/scala/stainless/genc/phases/GhostEliminationPhase.scala:87 — GhostElimination.transform has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
D1 · Cyclomatic Complexity · CodeExtraction.extractAccessor (cyclomatic 16) · ×1
  • CodeExtraction.extractAccessor (cyclomatic 16) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:678 — CodeExtraction.extractAccessor has cyclomatic complexity 16 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing. This is NOT this file's highest cyclomatic complexity: CodeExtraction.injectCastsImpl (cyclomatic 34) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · CodeExtraction.extractFunction (cyclomatic 16) · ×1
  • CodeExtraction.extractFunction (cyclomatic 16) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:815 — CodeExtraction.extractFunction has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This is NOT this file's highest cyclomatic complexity: CodeExtraction.injectCastsImpl (cyclomatic 34) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
D1 · Cyclomatic Complexity · KernelRemPio2.timesPiOverTwo (cyclomatic 16) · ×1
  • KernelRemPio2.timesPiOverTwo (cyclomatic 16) frontends/library/stainless/math/FdLibm.scala:845 — KernelRemPio2.timesPiOverTwo has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D15 · Churn × Complexity Hotspots · Hotspot · ×1
  • Hotspot: frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2659 — frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 86 in CodeExtraction.extractType at line 2659. 1 of those changes was a fix/bug commit, and the other 1 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-20..2026-10-18, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-20 23:40:34 +02:00' --until='2026-10-18 23:40:34 +02:00' --full-history --no-merges -- frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D17 · Explicit Debt · XxxComment · ×1
  • XxxComment core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala:70 — // XXX: since ApplyLetRec stores the type of the corresponding function, — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `// REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
D2 · Cognitive Complexity · Pow.compute (cognitive 339) · ×1
  • Pow.compute (cognitive 339) frontends/library/stainless/math/FdLibm.scala:1877 — Pow.compute has cognitive complexity 339 (threshold 15). Drivers by points: if/else 105 (303 pts), boolean chains 36 (nesting depth added 198). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · AntiAliasing.extractFunction (cognitive 218) · ×1
  • AntiAliasing.extractFunction (cognitive 218) core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala:99 — AntiAliasing.extractFunction has cognitive complexity 218 (threshold 15). Drivers by points: if/else 92 (132 pts), match/switch 35 (47 pts), loops 10 (20 pts), boolean chains 19 (nesting depth added 62). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CodeExtraction.extractTree (cognitive 177) · ×1
  • CodeExtraction.extractTree (cognitive 177) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1396 — CodeExtraction.extractTree has cognitive complexity 177 (threshold 15). Drivers by points: if/else 65 (92 pts), match/switch 32 (71 pts), boolean chains 14 (nesting depth added 66). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · TypeChecker.inferType (cognitive 167) · ×1
  • TypeChecker.inferType (cognitive 167) core/src/main/scala/stainless/verification/TypeChecker.scala:453 — TypeChecker.inferType has cognitive complexity 167 (threshold 15). Drivers by points: if/else 64 (83 pts), match/switch 39 (79 pts), boolean chains 5 (nesting depth added 59). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · EffectsChecker.checkEffects (cognitive 164) · ×1
  • EffectsChecker.checkEffects (cognitive 164) core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala:18 — EffectsChecker.checkEffects has cognitive complexity 164 (threshold 15). Drivers by points: if/else 72 (122 pts), boolean chains 15, match/switch 10 (14 pts), loops 5 (9 pts), error handling 2 (4 pts) (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Log1p.compute (cognitive 156) · ×1
  • Log1p.compute (cognitive 156) frontends/library/stainless/math/FdLibm.scala:1674 — Log1p.compute has cognitive complexity 156 (threshold 15). Drivers by points: if/else 55 (138 pts), boolean chains 18 (nesting depth added 83). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · Core.simplifyTopLvl (cognitive 138) · ×1
  • Core.simplifyTopLvl (cognitive 138) core/src/main/scala/stainless/transformers/lattices/Core.scala:1235 — Core.simplifyTopLvl has cognitive complexity 138 (threshold 15). Drivers by points: if/else 57 (79 pts), match/switch 21 (49 pts), boolean chains 10 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Hypot.compute (cognitive 137) · ×1
  • Hypot.compute (cognitive 137) frontends/library/stainless/math/FdLibm.scala:1346 — Hypot.compute has cognitive complexity 137 (threshold 15). Drivers by points: if/else 56 (128 pts), boolean chains 9 (nesting depth added 72). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CodeGeneration.mkExpr (cognitive 134) · ×1
  • CodeGeneration.mkExpr (cognitive 134) core/src/main/scala/stainless/codegen/CodeGeneration.scala:623 — CodeGeneration.mkExpr has cognitive complexity 134 (threshold 15). Drivers by points: if/else 47 (67 pts), match/switch 15 (35 pts), loops 12 (28 pts), boolean chains 4 (nesting depth added 56). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CodeExtraction.extractCall (cognitive 112) · ×1
  • CodeExtraction.extractCall (cognitive 112) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2129 — CodeExtraction.extractCall has cognitive complexity 112 (threshold 15). Drivers by points: match/switch 16 (56 pts), if/else 32 (53 pts), boolean chains 3 (nesting depth added 61). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CompilationUnit.valueToJVM (cognitive 107) · ×1
  • CompilationUnit.valueToJVM (cognitive 107) core/src/main/scala/stainless/codegen/CompilationUnit.scala:119 — CompilationUnit.valueToJVM has cognitive complexity 107 (threshold 15). Drivers by points: match/switch 17 (63 pts), loops 8 (21 pts), if/else 14 (20 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 66). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Expm1.compute (cognitive 107) · ×1
  • Expm1.compute (cognitive 107) frontends/library/stainless/math/FdLibm.scala:1599 — Expm1.compute has cognitive complexity 107 (threshold 15). Drivers by points: if/else 45 (99 pts), boolean chains 8 (nesting depth added 54). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · Atan2.compute (cognitive 81) · ×1
  • Atan2.compute (cognitive 81) frontends/library/stainless/math/FdLibm.scala:1206 — Atan2.compute has cognitive complexity 81 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 29, match/switch 4 (18 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · Exp.compute (cognitive 77) · ×1
  • Exp.compute (cognitive 77) frontends/library/stainless/math/FdLibm.scala:1537 — Exp.compute has cognitive complexity 77 (threshold 15). Drivers by points: if/else 35 (69 pts), boolean chains 8 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · Log.compute (cognitive 70) · ×1
  • Log.compute (cognitive 70) frontends/library/stainless/math/FdLibm.scala:1413 — Log.compute has cognitive complexity 70 (threshold 15). Drivers by points: if/else 26 (62 pts), boolean chains 8 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · GhostChecker.checkGhost (cognitive 65) · ×1
  • GhostChecker.checkGhost (cognitive 65) core/src/main/scala/stainless/extraction/imperative/GhostChecker.scala:10 — GhostChecker.checkGhost has cognitive complexity 65 (threshold 15). Drivers by points: if/else 16 (24 pts), match/switch 13 (22 pts), boolean chains 19 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · AbstractReport.emitSummary (cognitive 59) · ×1
  • AbstractReport.emitSummary (cognitive 59) core/src/main/scala/stainless/Report.scala:155 — AbstractReport.emitSummary has cognitive complexity 59 (threshold 15). Drivers by points: if/else 40 (59 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Strengthener.strengthenApplications (cognitive 57) · ×1
  • Strengthener.strengthenApplications (cognitive 57) core/src/main/scala/stainless/termination/Strengthener.scala:132 — Strengthener.strengthenApplications has cognitive complexity 57 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 7 (14 pts), match/switch 5 (13 pts), boolean chains 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Checker.traverse (cognitive 57) · ×1
  • Checker.traverse (cognitive 57) frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala:588 — Checker.traverse has cognitive complexity 57 (threshold 15). Drivers by points: if/else 22 (36 pts), boolean chains 11, match/switch 4 (8 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Atan.compute (cognitive 55) · ×1
  • Atan.compute (cognitive 55) frontends/library/stainless/math/FdLibm.scala:1139 — Atan.compute has cognitive complexity 55 (threshold 15). Drivers by points: if/else 24 (42 pts), match/switch 2 (8 pts), boolean chains 5 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · EffectsAnalyzer.getTargets (cognitive 52) · ×1
  • EffectsAnalyzer.getTargets (cognitive 52) core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:517 — EffectsAnalyzer.getTargets has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (33 pts), match/switch 7 (13 pts), boolean chains 6 (nesting depth added 18). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Asin.compute (cognitive 52) · ×1
  • Asin.compute (cognitive 52) frontends/library/stainless/math/FdLibm.scala:1016 — Asin.compute has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (39 pts), boolean chains 13 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · EquivalenceChecker.concludeRound (cognitive 51) · ×1
  • EquivalenceChecker.concludeRound (cognitive 51) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:379 — EquivalenceChecker.concludeRound has cognitive complexity 51 (threshold 15). Drivers by points: if/else 16 (29 pts), match/switch 7 (20 pts), boolean chains 2 (nesting depth added 26). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · TypeOps.typeBound (cognitive 50) · ×1
  • TypeOps.typeBound (cognitive 50) core/src/main/scala/stainless/extraction/oo/TypeOps.scala:12 — TypeOps.typeBound has cognitive complexity 50 (threshold 15). Drivers by points: if/else 25 (33 pts), match/switch 7 (13 pts), boolean chains 4 (nesting depth added 14). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · CodePurity.tryFoldImpl (cognitive 49) · ×1
  • CodePurity.tryFoldImpl (cognitive 49) core/src/main/scala/stainless/transformers/lattices/Core.scala:1971 — CodePurity.tryFoldImpl has cognitive complexity 49 (threshold 15). Drivers by points: if/else 18 (29 pts), match/switch 5 (14 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CodeExtraction.extractClass (cognitive 48) · ×1
  • CodeExtraction.extractClass (cognitive 48) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:517 — CodeExtraction.extractClass has cognitive complexity 48 (threshold 15). Drivers by points: if/else 22 (29 pts), boolean chains 13, match/switch 4 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · RefTransformContext.transformFun (cognitive 47) · ×1
  • RefTransformContext.transformFun (cognitive 47) core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:468 — RefTransformContext.transformFun has cognitive complexity 47 (threshold 15). Drivers by points: if/else 32 (35 pts), match/switch 7 (9 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ImperativeCodeElimination.extractFunction (cognitive 45) · ×1
  • ImperativeCodeElimination.extractFunction (cognitive 45) core/src/main/scala/stainless/extraction/imperative/ImperativeCodeElimination.scala:29 — ImperativeCodeElimination.extractFunction has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (25 pts), match/switch 10 (20 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GlobalStateChecker.checkGlobalUsage (cognitive 45) · ×1
  • GlobalStateChecker.checkGlobalUsage (cognitive 45) core/src/main/scala/stainless/genc/phases/GlobalStateChecker.scala:87 — GlobalStateChecker.checkGlobalUsage has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (26 pts), match/switch 4 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 26). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · EffectsAnalyzer.expressionEffects (cognitive 44) · ×1
  • EffectsAnalyzer.expressionEffects (cognitive 44) core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:804 — EffectsAnalyzer.expressionEffects has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (27 pts), match/switch 6 (10 pts), boolean chains 6, error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FunctionInlining.extractFunction (cognitive 43) · ×1
  • FunctionInlining.extractFunction (cognitive 43) core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:36 — FunctionInlining.extractFunction has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 6 (10 pts), boolean chains 8 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CodeExtraction.extractBlock (cognitive 43) · ×1
  • CodeExtraction.extractBlock (cognitive 43) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1221 — CodeExtraction.extractBlock has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (24 pts), match/switch 11 (17 pts), boolean chains 1, error handling 1 (nesting depth added 11). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Printer.ppBody (cognitive 42) · ×1
  • Printer.ppBody (cognitive 42) core/src/main/scala/stainless/extraction/oo/Trees.scala:261 — Printer.ppBody has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (30 pts), loops 3 (6 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 19). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CodeTryFolder.tryFoldImpl (cognitive 40) · ×1
  • CodeTryFolder.tryFoldImpl (cognitive 40) core/src/main/scala/stainless/transformers/lattices/Core.scala:2874 — CodeTryFolder.tryFoldImpl has cognitive complexity 40 (threshold 15). Drivers by points: loops 15 (39 pts), match/switch 1 (nesting depth added 24). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · RecursiveEvaluator.e (cognitive 39) · ×1
  • RecursiveEvaluator.e (cognitive 39) core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:15 — RecursiveEvaluator.e has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (23 pts), match/switch 5 (9 pts), boolean chains 7 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · IR2CImpl.rec (cognitive 39) · ×1
  • IR2CImpl.rec (cognitive 39) core/src/main/scala/stainless/genc/phases/IR2CPhase.scala:147 — IR2CImpl.rec has cognitive complexity 39 (threshold 15). Drivers by points: match/switch 9 (20 pts), if/else 9 (11 pts), boolean chains 8 (nesting depth added 13). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Checker.checkType (cognitive 39) · ×1
  • Checker.checkType (cognitive 39) frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala:449 — Checker.checkType has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (21 pts), match/switch 6 (10 pts), loops 4 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · KernelRemPio2.computeModulo (cognitive 38) · ×1
  • KernelRemPio2.computeModulo (cognitive 38) frontends/library/stainless/math/FdLibm.scala:748 — KernelRemPio2.computeModulo has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 13, loops 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CallGraphPrinter.apply (cognitive 37) · ×1
  • CallGraphPrinter.apply (cognitive 37) core/src/main/scala/stainless/frontend/CallGraphPrinter.scala:15 — CallGraphPrinter.apply has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 7 (14 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SimplifierWithPC.simplify (cognitive 37) · ×1
  • SimplifierWithPC.simplify (cognitive 37) core/src/main/scala/stainless/transformers/SimplifierWithPC.scala:14 — SimplifierWithPC.simplify has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 8 (18 pts), if/else 9 (13 pts), boolean chains 6 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · VerificationChecker.checkVC (cognitive 37) · ×1
  • VerificationChecker.checkVC (cognitive 37) core/src/main/scala/stainless/verification/VerificationChecker.scala:279 — VerificationChecker.checkVC has cognitive complexity 37 (threshold 15). Drivers by points: match/switch 7 (19 pts), if/else 12 (17 pts), boolean chains 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · MethodsAbstractSymbols.ensureWellFormedClass (cognitive 36) · ×1
  • MethodsAbstractSymbols.ensureWellFormedClass (cognitive 36) core/src/main/scala/stainless/extraction/methods/Trees.scala:104 — MethodsAbstractSymbols.ensureWellFormedClass has cognitive complexity 36 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 8, loops 3 (7 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · ReturnElimination.extractFunction (cognitive 35) · ×1
  • ReturnElimination.extractFunction (cognitive 35) core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:109 — ReturnElimination.extractFunction has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 5 (8 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · FunctionSpecialization.extractFunction (cognitive 35) · ×1
  • FunctionSpecialization.extractFunction (cognitive 35) core/src/main/scala/stainless/extraction/inlining/FunctionSpecialization.scala:38 — FunctionSpecialization.extractFunction has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 14 (20 pts), if/else 12 (15 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Analysis.rec (cognitive 35) · ×1
  • Analysis.rec (cognitive 35) core/src/main/scala/stainless/termination/ControlFlowAnalysis.scala:191 — Analysis.rec has cognitive complexity 35 (threshold 15). Drivers by points: if/else 9 (18 pts), match/switch 6 (13 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · OL.doSimplifyDisjunction (cognitive 35) · ×1
  • OL.doSimplifyDisjunction (cognitive 35) core/src/main/scala/stainless/transformers/lattices/OL.scala:149 — OL.doSimplifyDisjunction has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 9, match/switch 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CodeExtraction.extractType (cognitive 35) · ×1
  • CodeExtraction.extractType (cognitive 35) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2659 — CodeExtraction.extractType has cognitive complexity 35 (threshold 15). Drivers by points: match/switch 10 (18 pts), if/else 8 (9 pts), boolean chains 8 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · RecursiveEvaluator.matchesCase (cognitive 34) · ×1
  • RecursiveEvaluator.matchesCase (cognitive 34) core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala:107 — RecursiveEvaluator.matchesCase has cognitive complexity 34 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · FunctionClosure.extractFunction (cognitive 34) · ×1
  • FunctionClosure.extractFunction (cognitive 34) core/src/main/scala/stainless/extraction/innerfuns/FunctionClosure.scala:23 — FunctionClosure.extractFunction has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (16 pts), match/switch 13 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · CodeExtraction.extractPattern (cognitive 34) · ×1
  • CodeExtraction.extractPattern (cognitive 34) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:983 — CodeExtraction.extractPattern has cognitive complexity 34 (threshold 15). Drivers by points: match/switch 7 (16 pts), if/else 12 (14 pts), boolean chains 4 (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Sinh.compute (cognitive 34) · ×1
  • Sinh.compute (cognitive 34) frontends/library/stainless/math/FdLibm.scala:1740 — Sinh.compute has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · VerificationRun.execute (cognitive 33) · ×1
  • VerificationRun.execute (cognitive 33) core/src/main/scala/stainless/verification/VerificationComponent.scala:82 — VerificationRun.execute has cognitive complexity 33 (threshold 15). Drivers by points: if/else 14 (29 pts), match/switch 1 (4 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · AbstractReport.usageConstructExtendedSummary (cognitive 32) · ×1
  • AbstractReport.usageConstructExtendedSummary (cognitive 32) core/src/main/scala/stainless/Report.scala:236 — AbstractReport.usageConstructExtendedSummary has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (21 pts), match/switch 5 (8 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · CodeGeneration.compileLambda (cognitive 32) · ×1
  • CodeGeneration.compileLambda (cognitive 32) core/src/main/scala/stainless/codegen/CodeGeneration.scala:365 — CodeGeneration.compileLambda has cognitive complexity 32 (threshold 15). Drivers by points: loops 4 (11 pts), match/switch 5 (11 pts), if/else 8 (10 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Core.needsBinding (cognitive 32) · ×1
  • Core.needsBinding (cognitive 32) core/src/main/scala/stainless/transformers/lattices/Core.scala:2210 — Core.needsBinding has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, match/switch 2 (4 pts) (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · MethodLifting.makeFunction (cognitive 31) · ×1
  • MethodLifting.makeFunction (cognitive 31) core/src/main/scala/stainless/extraction/methods/MethodLifting.scala:232 — MethodLifting.makeFunction has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (14 pts), match/switch 8 (11 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Normaliser.recImpl (cognitive 31) · ×1
  • Normaliser.recImpl (cognitive 31) core/src/main/scala/stainless/genc/ir/Normaliser.scala:37 — Normaliser.recImpl has cognitive complexity 31 (threshold 15). Drivers by points: if/else 12 (18 pts), match/switch 6 (12 pts), boolean chains 1 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · InductElimination.extractFunction (cognitive 30) · ×1
  • InductElimination.extractFunction (cognitive 30) core/src/main/scala/stainless/extraction/termination/InductElimination.scala:26 — InductElimination.extractFunction has cognitive complexity 30 (threshold 15). Drivers by points: if/else 19 (22 pts), match/switch 4 (6 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · S2IRImpl.rec (cognitive 30) · ×1
  • S2IRImpl.rec (cognitive 30) core/src/main/scala/stainless/genc/phases/Scala2IRPhase.scala:877 — S2IRImpl.rec has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 6 (12 pts), boolean chains 2 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Core.flattenAssocArith (cognitive 30) · ×1
  • Core.flattenAssocArith (cognitive 30) core/src/main/scala/stainless/transformers/lattices/Core.scala:1748 — Core.flattenAssocArith has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (25 pts), match/switch 3 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · S2IRImpl.rec (cognitive 29) · ×1
  • S2IRImpl.rec (cognitive 29) core/src/main/scala/stainless/genc/phases/Scala2IRPhase.scala:757 — S2IRImpl.rec has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 3 (9 pts), boolean chains 1, match/switch 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CodePurity.fnPurity (cognitive 29) · ×1
  • CodePurity.fnPurity (cognitive 29) core/src/main/scala/stainless/transformers/lattices/Core.scala:2077 — CodePurity.fnPurity has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 5 (7 pts), match/switch 2 (5 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Tan.__kernel_tan (cognitive 29) · ×1
  • Tan.__kernel_tan (cognitive 29) frontends/library/stainless/math/FdLibm.scala:268 — Tan.__kernel_tan has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (21 pts), boolean chains 8 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · TypeEncoding.instanceOf (cognitive 28) · ×1
  • TypeEncoding.instanceOf (cognitive 28) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:321 — TypeEncoding.instanceOf has cognitive complexity 28 (threshold 15). Drivers by points: boolean chains 13, if/else 7 (10 pts), match/switch 3 (5 pts) (nesting depth added 5). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · AssertionInjector.transform (cognitive 28) · ×1
  • AssertionInjector.transform (cognitive 28) core/src/main/scala/stainless/verification/AssertionInjector.scala:53 — AssertionInjector.transform has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (15 pts), match/switch 6 (12 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · RecursionProcessor.run (cognitive 27) · ×1
  • RecursionProcessor.run (cognitive 27) core/src/main/scala/stainless/termination/RecursionProcessor.scala:39 — RecursionProcessor.run has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 6 (19 pts), if/else 7 (8 pts) (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Core.generateCond (cognitive 27) · ×1
  • Core.generateCond (cognitive 27) core/src/main/scala/stainless/transformers/lattices/Core.scala:1573 — Core.generateCond has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 6, match/switch 5 (6 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · math.atan2 (cognitive 27) · ×1
  • math.atan2 (cognitive 27) frontends/library/stainless/math/package.scala:242 — math.atan2 has cognitive complexity 27 (threshold 15). Drivers by points: boolean chains 27. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Sealing.extractClass (cognitive 26) · ×1
  • Sealing.extractClass (cognitive 26) core/src/main/scala/stainless/extraction/methods/Sealing.scala:117 — Sealing.extractClass has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (17 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Scope.empty (cognitive 26) · ×1
  • Scope.empty (cognitive 26) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:1028 — Scope.empty has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (17 pts), match/switch 7 (9 pts) (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CPrinter.pp (cognitive 26) · ×1
  • CPrinter.pp (cognitive 26) core/src/main/scala/stainless/genc/CPrinter.scala:35 — CPrinter.pp has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 4 (8 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Acos.compute (cognitive 26) · ×1
  • Acos.compute (cognitive 26) frontends/library/stainless/math/FdLibm.scala:1069 — Acos.compute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 6 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · Tanh.compute (cognitive 26) · ×1
  • Tanh.compute (cognitive 26) frontends/library/stainless/math/FdLibm.scala:1837 — Tanh.compute has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · Laws.extractFunction (cognitive 25) · ×1
  • Laws.extractFunction (cognitive 25) core/src/main/scala/stainless/extraction/methods/Laws.scala:93 — Laws.extractFunction has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 pts), match/switch 4 (8 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TypeChecker.checkType (cognitive 25) · ×1
  • TypeChecker.checkType (cognitive 25) core/src/main/scala/stainless/verification/TypeChecker.scala:1529 — TypeChecker.checkType has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (16 pts), match/switch 2 (6 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RemPio2.__ieee754_rem_pio2 (cognitive 25) · ×1
  • RemPio2.__ieee754_rem_pio2 (cognitive 25) frontends/library/stainless/math/FdLibm.scala:344 — RemPio2.__ieee754_rem_pio2 has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 7 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CodeExtraction.extractFunction (cognitive 24) · ×1
  • CodeExtraction.extractFunction (cognitive 24) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:815 — CodeExtraction.extractFunction has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 4 (6 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · GhostAnnotationChecker.traverse (cognitive 24) · ×1
  • GhostAnnotationChecker.traverse (cognitive 24) frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala:284 — GhostAnnotationChecker.traverse has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · math.pow (cognitive 24) · ×1
  • math.pow (cognitive 24) frontends/library/stainless/math/package.scala:601 — math.pow has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 24. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · funRefTransformer.transform (cognitive 23) · ×1
  • funRefTransformer.transform (cognitive 23) core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:295 — funRefTransformer.transform has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Scope.transform (cognitive 23) · ×1
  • Scope.transform (cognitive 23) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:803 — Scope.transform has cognitive complexity 23 (threshold 15). Drivers by points: match/switch 7 (13 pts), if/else 7 (10 pts) (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CoqEncoder.transformTree (cognitive 23) · ×1
  • CoqEncoder.transformTree (cognitive 23) core/src/main/scala/stainless/verification/CoqEncoder.scala:74 — CoqEncoder.transformTree has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 4 (7 pts) (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · GhostRewriteTransformer.transform (cognitive 23) · ×1
  • GhostRewriteTransformer.transform (cognitive 23) frontends/dotty/src/main/scala/stainless/frontends/dotc/GhostAccessRewriter.scala:89 — GhostRewriteTransformer.transform has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (10 pts), match/switch 5 (9 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · TypeOps.patternIsTyped (cognitive 22) · ×1
  • TypeOps.patternIsTyped (cognitive 22) core/src/main/scala/stainless/ast/TypeOps.scala:20 — TypeOps.patternIsTyped has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 10, match/switch 5 (9 pts), if/else 3 (nesting depth added 4). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · EquivalenceChecker.pickNextExamination (cognitive 22) · ×1
  • EquivalenceChecker.pickNextExamination (cognitive 22) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:304 — EquivalenceChecker.pickNextExamination has cognitive complexity 22 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 6 (9 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · EquivalenceChecker.allSubFnsMatches (cognitive 22) · ×1
  • EquivalenceChecker.allSubFnsMatches (cognitive 22) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:920 — EquivalenceChecker.allSubFnsMatches has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (9 pts), loops 3 (6 pts), match/switch 4, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CustomPrinter.ppBody (cognitive 22) · ×1
  • CustomPrinter.ppBody (cognitive 22) core/src/main/scala/stainless/testgen/ScalaTestGen.scala:203 — CustomPrinter.ppBody has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 6, match/switch 1 (nesting depth added 4). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · OL.arithLeq (cognitive 22) · ×1
  • OL.arithLeq (cognitive 22) core/src/main/scala/stainless/transformers/lattices/OL.scala:106 — OL.arithLeq has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 1, match/switch 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Log10.compute (cognitive 22) · ×1
  • Log10.compute (cognitive 22) frontends/library/stainless/math/FdLibm.scala:1485 — Log10.compute has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 7 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CodeGeneration.mkBranch (cognitive 21) · ×1
  • CodeGeneration.mkBranch (cognitive 21) core/src/main/scala/stainless/codegen/CodeGeneration.scala:1586 — CodeGeneration.mkBranch has cognitive complexity 21 (threshold 15). Drivers by points: match/switch 8 (15 pts), if/else 4 (5 pts), boolean chains 1 (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CompilationUnit.jvmToValue (cognitive 21) · ×1
  • CompilationUnit.jvmToValue (cognitive 21) core/src/main/scala/stainless/codegen/CompilationUnit.scala:291 — CompilationUnit.jvmToValue has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), match/switch 4 (7 pts), loops 1 (2 pts) (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · Scope.transform (cognitive 21) · ×1
  • Scope.transform (cognitive 21) core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala:902 — Scope.transform has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 4 (7 pts), boolean chains 2 (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · LeonInlining.extractFunction (cognitive 21) · ×1
  • LeonInlining.extractFunction (cognitive 21) core/src/main/scala/stainless/genc/LeonInlining.scala:38 — LeonInlining.extractFunction has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 6, match/switch 3 (4 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Printer.ppBody (cognitive 20) · ×1
  • Printer.ppBody (cognitive 20) core/src/main/scala/stainless/extraction/xlang/Trees.scala:80 — Printer.ppBody has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (19 pts), match/switch 1 (nesting depth added 9). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · TrimSymbols.run (cognitive 20) · ×1
  • TrimSymbols.run (cognitive 20) core/src/main/scala/stainless/genc/phases/TrimSymbols.scala:28 — TrimSymbols.run has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, loops 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Core.simplifiedDisjunction (cognitive 20) · ×1
  • Core.simplifiedDisjunction (cognitive 20) core/src/main/scala/stainless/transformers/lattices/Core.scala:1008 — Core.simplifiedDisjunction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), match/switch 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CoqEncoder.transformFunction (cognitive 20) · ×1
  • CoqEncoder.transformFunction (cognitive 20) core/src/main/scala/stainless/verification/CoqEncoder.scala:440 — CoqEncoder.transformFunction has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 3 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · EquivalenceChecker.tryCreate (cognitive 19) · ×1
  • EquivalenceChecker.tryCreate (cognitive 19) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:1168 — EquivalenceChecker.tryCreate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (17 pts), match/switch 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Path.wrap (cognitive 19) · ×1
  • Path.wrap (cognitive 19) core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:295 — Path.wrap has cognitive complexity 19 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 10). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · ReconstructTuple.unapply (cognitive 19) · ×1
  • ReconstructTuple.unapply (cognitive 19) core/src/main/scala/stainless/extraction/imperative/ImperativeCleanup.scala:55 — ReconstructTuple.unapply has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 4 (9 pts), if/else 6 (8 pts), boolean chains 2 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · DependencyGraph.computeDependencyGraph (cognitive 19) · ×1
  • DependencyGraph.computeDependencyGraph (cognitive 19) core/src/main/scala/stainless/extraction/oo/DependencyGraph.scala:67 — DependencyGraph.computeDependencyGraph has cognitive complexity 19 (threshold 15). Drivers by points: loops 10 (15 pts), if/else 1 (2 pts), match/switch 1 (2 pts) (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · S2IRImpl.rec (cognitive 19) · ×1
  • S2IRImpl.rec (cognitive 19) core/src/main/scala/stainless/genc/phases/Scala2IRPhase.scala:621 — S2IRImpl.rec has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 4, match/switch 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · PartialEvaluator.simplify (cognitive 19) · ×1
  • PartialEvaluator.simplify (cognitive 19) core/src/main/scala/stainless/transformers/PartialEvaluator.scala:11 — PartialEvaluator.simplify has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 5 (9 pts), if/else 6 (8 pts), boolean chains 2 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · OL.latticesLeq (cognitive 19) · ×1
  • OL.latticesLeq (cognitive 19) core/src/main/scala/stainless/transformers/lattices/OL.scala:29 — OL.latticesLeq has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 10, match/switch 2 (5 pts), if/else 4 (nesting depth added 3). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
D2 · Cognitive Complexity · Cosh.compute (cognitive 19) · ×1
  • Cosh.compute (cognitive 19) frontends/library/stainless/math/FdLibm.scala:1786 — Cosh.compute has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: frontends/library/stainless/math/FdLibm.scala holds 17 of the 121 methods over the threshold — including the worst — and 1038 of the 3520 points over it (29%), 2.8× the next-largest file (frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala at 370). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · EquivalenceChecker.evalCheck (cognitive 18) · ×1
  • EquivalenceChecker.evalCheck (cognitive 18) core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:718 — EquivalenceChecker.evalCheck has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 4 (6 pts), error handling 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · MutabilityAnalysis.checkMutability (cognitive 18) · ×1
  • MutabilityAnalysis.checkMutability (cognitive 18) core/src/main/scala/stainless/extraction/methods/MutabilityAnalyzer.scala:87 — MutabilityAnalysis.checkMutability has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (16 pts), boolean chains 2 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · AdtSpecialization.extractClass (cognitive 18) · ×1
  • AdtSpecialization.extractClass (cognitive 18) core/src/main/scala/stainless/extraction/oo/AdtSpecialization.scala:172 — AdtSpecialization.extractClass has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 1 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RelationProcessor.run (cognitive 18) · ×1
  • RelationProcessor.run (cognitive 18) core/src/main/scala/stainless/termination/RelationProcessor.scala:28 — RelationProcessor.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), match/switch 6 (8 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Transformer.transform (cognitive 18) · ×1
  • Transformer.transform (cognitive 18) core/src/main/scala/stainless/transformers/Transformer.scala:66 — Transformer.transform has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5, boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CodeGeneration.compileADTConstructor (cognitive 17) · ×1
  • CodeGeneration.compileADTConstructor (cognitive 17) core/src/main/scala/stainless/codegen/CodeGeneration.scala:2085 — CodeGeneration.compileADTConstructor has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, loops 4 (5 pts), match/switch 2 (5 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CodeGenEvaluator.compile (cognitive 17) · ×1
  • CodeGenEvaluator.compile (cognitive 17) core/src/main/scala/stainless/evaluators/CodeGenEvaluator.scala:149 — CodeGenEvaluator.compile has cognitive complexity 17 (threshold 15). Drivers by points: error handling 7 (14 pts), if/else 2, match/switch 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DebugSymbols.debug (cognitive 17) · ×1
  • DebugSymbols.debug (cognitive 17) core/src/main/scala/stainless/extraction/utils/NamedPipeline.scala:54 — DebugSymbols.debug has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · IgnoredFields.traverse (cognitive 17) · ×1
  • IgnoredFields.traverse (cognitive 17) core/src/main/scala/stainless/extraction/xlang/TreeSanitizer.scala:214 — IgnoredFields.traverse has cognitive complexity 17 (threshold 15). Drivers by points: match/switch 6 (12 pts), if/else 5 (nesting depth added 6). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CodeExtraction.extractStatic (cognitive 17) · ×1
  • CodeExtraction.extractStatic (cognitive 17) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:213 — CodeExtraction.extractStatic has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), match/switch 4 (7 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · GhostAnnotationPropagater.traverse (cognitive 17) · ×1
  • GhostAnnotationPropagater.traverse (cognitive 17) frontends/dotty/src/main/scala/stainless/frontends/dotc/FragmentChecker.scala:183 — GhostAnnotationPropagater.traverse has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), match/switch 2 (5 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 7). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · CodeGeneration.loadTypes (cognitive 16) · ×1
  • CodeGeneration.loadTypes (cognitive 16) core/src/main/scala/stainless/codegen/CodeGeneration.scala:579 — CodeGeneration.loadTypes has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (9 pts), if/else 4 (7 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · FunctionInlining.extractSymbols (cognitive 16) · ×1
  • FunctionInlining.extractSymbols (cognitive 16) core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:168 — FunctionInlining.extractSymbols has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 7, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · TransformerContext.transform (cognitive 16) · ×1
  • TransformerContext.transform (cognitive 16) core/src/main/scala/stainless/extraction/xlang/PartialFunctions.scala:43 — TransformerContext.transform has cognitive complexity 16 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (nesting depth added 7). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
D2 · Cognitive Complexity · GenCTestGen.readExistingTestBodies (cognitive 16) · ×1
  • GenCTestGen.readExistingTestBodies (cognitive 16) core/src/main/scala/stainless/testgen/GenCTestGen.scala:98 — GenCTestGen.readExistingTestBodies has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (12 pts), match/switch 2 (4 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · ASTExtractors.getAnnotations (cognitive 16) · ×1
  • ASTExtractors.getAnnotations (cognitive 16) frontends/dotty/src/main/scala/stainless/frontends/dotc/ASTExtractors.scala:74 — ASTExtractors.getAnnotations has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D3 · God Classes · MethodTooLong · ×1
  • MethodTooLong: InnerClasses.getContext core/src/main/scala/stainless/extraction/innerclasses/InnerClasses.scala:67 — MethodTooLong — getContext runs 284 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 184 over it, 2.84× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
D31 · IaC & Container Security · Medium IaC · ×1
  • REDACTED
D35 · Change Coupling · Change coupling · ×1
  • Change coupling: Deconstructors.scala ↔ InoxEncoder.scala core/src/main/scala/stainless/ast/Deconstructors.scala:1 — `core/src/main/scala/stainless/ast/Deconstructors.scala` and `core/src/main/scala/stainless/solvers/InoxEncoder.scala` change together 64% of the time (29 of the 45 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 29 shared commits counted here, the most recent 3 are `5cbaa712` Bump to scala 3.7.2 (#1660); `32960c31` Add &&& operator and SplitVC flag to split verification conditions; `e90964b8` Remove ImplPrivateInlining and @implPrivate (no longer needed) — run `git show` on any of them.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Edited copy of a member (21 corresponding lines) · ×1
  • Edited copy of a member (21 corresponding lines) frontends/library/stainless/math/FdLibm.scala:1207 — frontends/library/stainless/math/FdLibm.scala:1207-1285 | frontends/library/stainless/math/package.scala:243-265 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (16 corresponding lines) · ×1
  • Edited copy of a member (16 corresponding lines) frontends/library/stainless/math/FdLibm.scala:1878 — frontends/library/stainless/math/FdLibm.scala:1878-2141 | frontends/library/stainless/math/package.scala:602-619 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Members sharing a duplicated core (12 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (12 members, 50+ identical tokens) core/src/main/scala/stainless/ast/Deconstructors.scala:249 — core/src/main/scala/stainless/ast/Deconstructors.scala:249-255 | core/src/main/scala/stainless/extraction/imperative/Trees.scala:267-273 | core/src/main/scala/stainless/extraction/inlining/Trees.scala:18-24 | core/src/main/scala/stainless/extraction/innerclasses/Trees.scala:109-115 | core/src/main/scala/stainless/extraction/innerfuns/Trees.scala:57-63 | core/src/main/scala/stainless/extraction/methods/Trees.scala:338-344 | core/src/main/scala/stainless/extraction/oo/Trees.scala:203-209 | core/src/main/scala/stainless/extraction/package.scala:84-90 | core/src/main/scala/stainless/extraction/termination/Trees.scala:18-24 | core/src/main/scala/stainless/extraction/throwing/Trees.scala:60-66 | core/src/main/scala/stainless/extraction/trace/Trees.scala:18-24 | core/src/main/scala/stainless/extraction/xlang/Trees.scala:58-64 — These 12 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 12 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 12 times.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (4 members, 50+ identical tokens) frontends/library/stainless/math/FdLibm.scala:458 — frontends/library/stainless/math/FdLibm.scala:458-479 | frontends/library/stainless/math/FdLibm.scala:521-542 | frontends/library/stainless/math/FdLibm.scala:569-590 | frontends/library/stainless/math/FdLibm.scala:617-638 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Duplicated block (27–28 lines × 2) · ×1
  • Duplicated block (27–28 lines × 2) core/src/main/scala/stainless/codegen/CodeGeneration.scala:508 — core/src/main/scala/stainless/codegen/CodeGeneration.scala:508-534 | core/src/main/scala/stainless/codegen/CodeGeneration.scala:2239-2266 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/codegen/CodeGeneration.scala:508` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) core/src/main/scala/stainless/codegen/CompilationUnit.scala:221 — core/src/main/scala/stainless/codegen/CompilationUnit.scala:221-239 | core/src/main/scala/stainless/codegen/CompilationUnit.scala:260-278 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/codegen/CompilationUnit.scala:221` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `core/src/main/scala/stainless/codegen/CompilationUnit.scala:259` calls `ArrayType` and `core/src/main/scala/stainless/codegen/CompilationUnit.scala:219` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (17–18 lines × 2) · ×1
  • Duplicated block (17–18 lines × 2) core/src/main/scala/stainless/codegen/CodeGeneration.scala:1863 — core/src/main/scala/stainless/codegen/CodeGeneration.scala:1863-1880 | core/src/main/scala/stainless/codegen/CodeGeneration.scala:1933-1949 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/codegen/CodeGeneration.scala:1863` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×1
  • Duplicated block (18 lines × 2) frontends/library/stainless/io/FileInputStream.scala:231 — frontends/library/stainless/io/FileInputStream.scala:231-248 | frontends/library/stainless/io/StdIn.scala:100-117 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/io/FileInputStream.scala:231` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (15 lines × 4) · ×1
  • Duplicated block (15 lines × 4) frontends/library/stainless/math/FdLibm.scala:458 — frontends/library/stainless/math/FdLibm.scala:458-472 | frontends/library/stainless/math/FdLibm.scala:521-535 | frontends/library/stainless/math/FdLibm.scala:569-583 | frontends/library/stainless/math/FdLibm.scala:617-631 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/math/FdLibm.scala:458` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×1
  • Duplicated block (15 lines × 2) core/src/main/scala/stainless/codegen/CodeGeneration.scala:478 — core/src/main/scala/stainless/codegen/CodeGeneration.scala:478-492 | core/src/main/scala/stainless/codegen/CodeGeneration.scala:2207-2221 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/codegen/CodeGeneration.scala:478` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (14–15 lines × 2) · ×1
  • Duplicated block (14–15 lines × 2) core/src/main/scala/stainless/codegen/CodeGeneration.scala:1886 — core/src/main/scala/stainless/codegen/CodeGeneration.scala:1886-1900 | core/src/main/scala/stainless/codegen/CodeGeneration.scala:1950-1963 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `core/src/main/scala/stainless/codegen/CodeGeneration.scala:1883` calls `mkNewBV` and `core/src/main/scala/stainless/codegen/CodeGeneration.scala:1949` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (13–14 lines × 2) · ×1
  • Duplicated block (13–14 lines × 2) frontends/library/stainless/io/FileInputStream.scala:252 — frontends/library/stainless/io/FileInputStream.scala:252-264 | frontends/library/stainless/io/StdIn.scala:121-134 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/library/stainless/io/FileInputStream.scala:252` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it.
D4 · Code Duplication · Duplicated block (11 lines × 3) · ×1
  • Duplicated block (11 lines × 3) core/src/main/scala/stainless/genc/phases/IR2CPhase.scala:179 — core/src/main/scala/stainless/genc/phases/IR2CPhase.scala:179-189 | core/src/main/scala/stainless/genc/phases/IR2CPhase.scala:194-204 | core/src/main/scala/stainless/genc/phases/IR2CPhase.scala:215-225 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (10–11 lines × 2) · ×1
  • Duplicated block (10–11 lines × 2) core/src/main/scala/stainless/codegen/CodeGeneration.scala:991 — core/src/main/scala/stainless/codegen/CodeGeneration.scala:991-1000 | core/src/main/scala/stainless/codegen/CodeGeneration.scala:1882-1892 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (7–8 lines × 2) · ×1
  • Duplicated block (7–8 lines × 2) core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:331 — core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:331-338 | core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:50-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:331` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:57` calls `FiniteArray`, `forall`, `LargeArray` and `core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala:339` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (6–8 lines × 2) · ×1
  • Duplicated block (6–8 lines × 2) core/src/main/scala/stainless/testgen/GenCTestGen.scala:21 — core/src/main/scala/stainless/testgen/GenCTestGen.scala:21-28 | core/src/main/scala/stainless/testgen/ScalaTestGen.scala:27-32 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/testgen/GenCTestGen.scala:21` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (6–7 lines × 2) · ×1
  • Duplicated block (6–7 lines × 2) core/src/main/scala/stainless/extraction/imperative/SymbolOps.scala:88 — core/src/main/scala/stainless/extraction/imperative/SymbolOps.scala:88-94 | core/src/main/scala/stainless/extraction/methods/MutabilityAnalyzer.scala:29-34 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/extraction/imperative/SymbolOps.scala:88` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (6 lines × 12) · ×1
  • Duplicated block (6 lines × 12) core/src/main/scala/stainless/ast/Deconstructors.scala:250 — core/src/main/scala/stainless/ast/Deconstructors.scala:250-255 | core/src/main/scala/stainless/extraction/imperative/Trees.scala:268-273 | core/src/main/scala/stainless/extraction/inlining/Trees.scala:19-24 | core/src/main/scala/stainless/extraction/innerclasses/Trees.scala:110-115 | core/src/main/scala/stainless/extraction/innerfuns/Trees.scala:58-63 | core/src/main/scala/stainless/extraction/methods/Trees.scala:339-344 | core/src/main/scala/stainless/extraction/oo/Trees.scala:204-209 | core/src/main/scala/stainless/extraction/package.scala:85-90 | core/src/main/scala/stainless/extraction/termination/Trees.scala:19-24 | core/src/main/scala/stainless/extraction/throwing/Trees.scala:61-66 | core/src/main/scala/stainless/extraction/trace/Trees.scala:19-24 | core/src/main/scala/stainless/extraction/xlang/Trees.scala:59-64 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 12 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 12 times. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/ast/Deconstructors.scala:250` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (5–6 lines × 2) · ×1
  • Duplicated block (5–6 lines × 2) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1874 — frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1874-1878 | frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1897-1902 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:1874` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (5 lines × 4) · ×1
  • Duplicated block (5 lines × 4) frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2450 — frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2450-2454 | frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2459-2463 | frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2468-2472 | frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2476-2480 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `frontends/dotty/src/main/scala/stainless/frontends/dotc/CodeExtraction.scala:2450` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (3–5 lines × 3) · ×1
  • Duplicated block (3–5 lines × 3) core/src/main/scala/stainless/verification/AssertionInjector.scala:219 — core/src/main/scala/stainless/verification/AssertionInjector.scala:219-221 | core/src/main/scala/stainless/verification/AssertionInjector.scala:232-236 | core/src/main/scala/stainless/verification/AssertionInjector.scala:245-249 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `core/src/main/scala/stainless/verification/AssertionInjector.scala:219` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `core/src/main/scala/stainless/verification/AssertionInjector.scala:223` calls `RealType`, `FractionLiteral`, `copiedFrom` and `core/src/main/scala/stainless/verification/AssertionInjector.scala:238` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (8 lines × 3) · ×1
  • Duplicated block (8 lines × 3) core/src/main/scala/stainless/ast/Definitions.scala:110 — core/src/main/scala/stainless/ast/Definitions.scala:110-117 | core/src/main/scala/stainless/extraction/innerclasses/Trees.scala:40-47 | core/src/main/scala/stainless/extraction/oo/ClassSymbols.scala:63-70 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `core/src/main/scala/stainless/extraction/innerclasses/Trees.scala:48` calls `traverse` and `core/src/main/scala/stainless/ast/Definitions.scala:118` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
X1 · Async correctness · Future started here is not kept · ×1
  • Future started here is not kept core/src/main/scala/stainless/utils/FileWatcher.scala:37 — The `Future` this starts is not kept anywhere, and `scala.concurrent.Future` never reports a failure on its own: `Future { … }` catches any non-fatal exception its body throws and stores it as the future's `Failure` — not rethrown, not printed, not passed to the `ExecutionContext`'s `reportFailure` — so once nobody holds the future the error is gone, and nothing can wait for the work to finish either. Keep the future and compose it into what the caller returns (`for`/`flatMap`, `Future.sequence`), or, for genuine fire-and-forget, attach a handler that reports the failure — `Future { … }.failed.foreach(error => log.error("…", error))` or `.onComplete { case Failure(e) => report(e); case _ => }` — or catch and report inside the body itself.
Minor — 266 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×226
  • Orphaned file core/src/main/scala/stainless/verification/CoqEncoder.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file frontends/library/stainless/math/package.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/genc/phases/IR2CPhase.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file frontends/benchmarks/genc/valid/ImageProcessing.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/extraction/innerclasses/InnerClasses.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/extraction/imperative/ReturnElimination.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/equivchk/EquivalenceCheckingComponent.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/extraction/oo/Trees.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/termination/ControlFlowAnalysis.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file frontends/benchmarks/verification/valid/GodelNumbering.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/extraction/methods/Trees.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/verification/VerificationChecker.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/genc/ir/IR.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/extraction/xlang/TreeSanitizer.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/verification/AssertionInjector.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/verification/CoqExpression.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/codegen/CompilationUnit.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file frontends/benchmarks/full-imperative/valid/CellDataStructuresAndRepr.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/transformers/lattices/Definitions.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/ast/Expressions.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file frontends/benchmarks/verification/valid/ConcRope.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file frontends/benchmarks/verification/valid/BalancedParentheses.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file frontends/benchmarks/verification/invalid/BadConcRope.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/extraction/xlang/ConstructsUsage.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file core/src/main/scala/stainless/extraction/oo/TypeOps.scala:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • + 201 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×18
  • Duplicated predicate frontends/library/stainless/math/FdLibm.scala:1393 — `((x.isInfinity || y.isInfinity) ==> res.isPosInfinity) && (res.isNaN == (!x.isInfinity && !y.isInfinity && (x.isNaN || y.isNaN))) && (!res.i…` appears character-identically in 2 files — frontends/library/stainless/math/FdLibm.scala, frontends/library/stainless/math/package.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/math/FdLibm.scala:1107 — `((x.isNaN || x < -1.0d || x > 1.0d) == res.isNaN) && ((x.isFinite && x == 1.0d) ==> (res.isPositive && res.isZero)) && ((x.isFinite && x == …` appears character-identically in 2 files — frontends/library/stainless/math/FdLibm.scala, frontends/library/stainless/math/package.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/math/FdLibm.scala:246 — `((x.isNaN || x.isInfinity) ==> res.isNaN) && ((x.isPositive && x.isZero) ==> (res.isPositive && res.isZero)) && ((x.isNegative && x.isZero) …` appears character-identically in 2 files — frontends/library/stainless/math/FdLibm.scala, frontends/library/stainless/math/package.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/math/FdLibm.scala:1726 — `(res.isNaN == (x.isNaN || x < -1)) && ((x.isFinite && x == -1.0) == res.isNegInfinity) && ((x.isZero && x.isPositive) == (res.isZero && res.…` appears character-identically in 2 files — frontends/library/stainless/math/FdLibm.scala, frontends/library/stainless/math/package.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/math/FdLibm.scala:1504 — `(res.isNaN == (x.isNaN || x < 0)) && (x.isZero == res.isNegInfinity) && ((!x.isNaN && x == 1.0) ==> (res.isZero && res.isPositive)) && ((!x.…` appears character-identically in 2 files — frontends/library/stainless/math/FdLibm.scala, frontends/library/stainless/math/package.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/math/FdLibm.scala:1266 — `(res.isNaN == (y.isNaN || x.isNaN)) && ((!y.isNaN && !x.isNaN) ==> (-Pi <= res && res <= Pi)) && ((y.isPositive && x.isPositive) ==> (res.is…` appears character-identically in 2 files — frontends/library/stainless/math/FdLibm.scala, frontends/library/stainless/math/package.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/math/FdLibm.scala:1653 — `(res.isNaN == x.isNaN) && (x.isPosInfinity ==> res.isPosInfinity) && (x.isNegInfinity ==> (res == -1)) && (x.isZero ==> (res == 0)) && (x.is…` appears character-identically in 2 files — frontends/library/stainless/math/FdLibm.scala, frontends/library/stainless/math/package.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/math/FdLibm.scala:2127 — `(y.isZero ==> (res == 1.0)) && ((!x.isNaN && y.isFinite && y == 1.0) ==> (res == x)) && (y.isNaN ==> res.isNaN) && ((x.isNaN && !y.isZero) =…` appears character-identically in 2 files — frontends/library/stainless/math/FdLibm.scala, frontends/library/stainless/math/package.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/covcollection/Option.scala:27 — `_.isDefined == this.isDefined || or.isDefined` appears character-identically in 2 files — frontends/library/stainless/covcollection/Option.scala, frontends/library/stainless/lang/Option.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala:1116 — `cd.parents.isEmpty && cd.children.isEmpty` appears character-identically in 2 files — core/src/main/scala/stainless/extraction/imperative/AntiAliasing.scala, core/src/main/scala/stainless/genc/LeonInlining.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala:58 — `elems.map(_._2).forall(isValue) && isValue(default)` appears character-identically in 2 files — core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala, core/src/main/scala/stainless/genc/LeonInlining.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate core/src/main/scala/stainless/codegen/CodeGeneration.scala:1346 — `flags.contains(DropVCs) || flags.contains(DropConjunct)` appears character-identically in 2 files — core/src/main/scala/stainless/codegen/CodeGeneration.scala, core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate core/src/main/scala/stainless/codegen/CodeGeneration.scala:2294 — `isAnnotatedDrop(pred) || isAnnotatedDrop(pred.body)` appears character-identically in 2 files — core/src/main/scala/stainless/codegen/CodeGeneration.scala, core/src/main/scala/stainless/evaluators/RecursiveEvaluator.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala:205 — `isMutableType(tpe) && !tp.flags.contains(IsMutable)` appears character-identically in 2 files — core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala, core/src/main/scala/stainless/extraction/methods/MutabilityAnalyzer.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/collection/List.scala:617 — `res._1 == filter(p) && res._2 == filterNot(p)` appears character-identically in 2 files — frontends/library/stainless/collection/List.scala, frontends/library/stainless/covcollection/List.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/math/FdLibm.scala:1774 — `res.isNaN == x.isNaN && (x.isPosInfinity ==> res.isPosInfinity) && (x.isNegInfinity ==> res.isNegInfinity) && (x.isZero == res.isZero) && (x…` appears character-identically in 2 files — frontends/library/stainless/math/FdLibm.scala, frontends/library/stainless/math/package.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate frontends/library/stainless/collection/List.scala:603 — `res.size <= this.size && res.content.subsetOf(this.content) && res.forall(!p(_))` appears character-identically in 2 files — frontends/library/stainless/collection/List.scala, frontends/library/stainless/covcollection/List.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate core/src/main/scala/stainless/evaluators/EvaluatorComponent.scala:84 — `spec.kind == LetKind || spec.kind == PreconditionKind` appears character-identically in 3 files — core/src/main/scala/stainless/evaluators/EvaluatorComponent.scala, core/src/main/scala/stainless/extraction/inlining/FunctionInlining.scala, core/src/main/scala/stainless/verification/TypeChecker.scala. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D34 · Knowledge Freshness · Most significant orphaned file · ×3
  • Most significant orphaned file core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file core/src/main/scala/stainless/extraction/imperative/EffectElaboration.scala:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file frontends/library/stainless/math/BitVectors.scala:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
D16 · Bus Factor · Off-boarding risk · ×2
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 10 significant file(s) lose their only recent owner: frontends/library/stainless/math/FdLibm.scala, core/src/main/scala/stainless/Report.scala, core/src/main/scala/stainless/extraction/imperative/EffectsChecker.scala, frontends/library/stainless/collection/List.scala, frontends/library/stainless/collection/ListMapLemmas.scala, core/src/main/scala/stainless/verification/VerificationComponent.scala, frontends/library/stainless/collection/IArray.scala, core/src/main/scala/stainless/genc/GenCComponent.scala (+2 more). Pair on, review, or document these before any departure.
  • Off-boarding risk: anonymized user #2 — If anonymized user #2 becomes unavailable, 5 significant file(s) lose their only recent owner: core/src/main/scala/stainless/ast/ExprOps.scala, frontends/library/stainless/covcollection/List.scala, core/src/main/scala/stainless/extraction/innerfuns/FunctionClosure.scala, core/src/main/scala/stainless/extraction/methods/MethodLifting.scala, core/src/main/scala/stainless/ast/TypeOps.scala. Pair on, review, or document these before any departure.
IC1 · Incompleteness & stubs · Empty method body · ×2
  • Empty method body frontends/library/stainless/lang/StaticChecks.scala:26 — `inline` has an empty body — confirm it's an intentional no-op and not an unfinished method.
  • Empty method body frontends/library/stainless/lang/StaticChecks.scala:27 — `opaque` has an empty body — confirm it's an intentional no-op and not an unfinished method.
D16 · Bus Factor · Further sole-owners (lower concentration) · ×1
  • Further sole-owners (lower concentration) — 2 other contributor(s) are each the sole owner of a small amount of code below the off-boarding threshold — folded into the bus-factor score and metrics (20 single-owned of 271 analysed files in total, counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated and example/demo trees and test files identified by path convention, largest first; 271 of the 1801 production source files in this repository met that bar). They are anonymized user #3 (2 file(s)), anonymized user #4 (2 file(s)) — spread or document their files in the same way, at lower priority than the named off-boarding risks above. The files folded here: core/src/main/scala/stainless/genc/ir/Normaliser.scala, core/src/main/scala/stainless/genc/CPrinter.scala, frontends/dotty/src/main/scala/stainless/frontends/dotc/StainlessPlugin.scala, frontends/dotty/src/main/scala/stainless/frontends/dotc/SymbolMapping.scala.
D19 · Documentation Quality · Documentation · ×1
  • Documentation: no installation or build instructions README.md — The README gives no installation or build instructions for the repository. Add install/build steps (clone with --recursive, submodule update) under 'Quick start' as in the body.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (97336 LoC, 5686 module-visible types across 126 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D34 · Knowledge Freshness · Concentrated knowledge decay · ×1
  • Concentrated knowledge decay — 229 of 281 significant files have no living knowledge, while the repository is still being changed at a low rate (16 commit(s) in the last 90 days) — so this is one repo-wide knowledge-decay state, not 229 separate risks. Counted over 281 of the 1801 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 · Architecture documentation · No architecture diagram/doc · ×1
  • No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
M4 · Documentation accuracy · README/code drift · ×1
  • README/code drift docs/README.md:3 — docs/README.md names `core/src/scala`, but no file or folder `core/src/scala` exists. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST — No static application security testing detected. For this repository's stack, add scalafix or scapegoat (or `semgrep --config=auto`, which runs on any language) as a CI step. What was searched, so you can tell an absence from a miss: the 16093 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P6 · Release Hygiene · No changelog · ×1
  • No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
X5 · Nullable reference types · Scala's null is not held to the type system everywhere · ×1
  • Scala's null is not held to the type system everywhere — No build over this repository's 370 Scala product file(s) passes `-Yexplicit-nulls`, enables WartRemover's `Null` wart or runs Scalafix's `DisableSyntax.noNulls`, so every reference type admits null and nothing reports a `null` written into the code or returned from a Java API — the first one to reach a method call is a `NullPointerException`. `Option` by convention is a habit no tool here holds the code to.
Minor — 6 finding(s)
D12 · Dependency Hygiene · Outdated · ×6
  • Outdated: com.typesafe:config — `com.typesafe %% config` is declared at 1.3.4 in build.sbt, but 1.4.9 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 1.3.4 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: io.circe:circe-core_3 — `io.circe %% circe-core_3` is declared at 0.14.1 in build.sbt, but 0.14.17 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 0.14.1 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: io.circe:circe-generic_3 — `io.circe %% circe-generic_3` is declared at 0.14.1 in build.sbt, but 0.14.17 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 0.14.1 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: io.circe:circe-parser_3 — `io.circe %% circe-parser_3` is declared at 0.14.1 in build.sbt, but 0.14.17 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 0.14.1 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: io.get-coursier:coursier_3 — `io.get-coursier %% coursier_3` is declared at 2.0.16 in build.sbt, but 2.1.26 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 2.0.16 until the declaration is edited — there is no lockfile refresh that would move it.
  • Outdated: org.scala-lang.modules:scala-parallel-collections_3 — `org.scala-lang.modules %% scala-parallel-collections_3` is declared at 1.0.3 in build.sbt, but 1.2.0 is the current release on Maven Central. An sbt declaration names an exact version, so this repository builds against 1.0.3 until the declaration is edited — there is no lockfile refresh that would move it.

Appendix B — Reproduction & audit trail

Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-d47ef2b1ea7e4e1cb56daf11f869aa4f/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/watchdog-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-d47ef2b1ea7e4e1cb56daf11f869aa4f/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/watchdog-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off .26artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-4ee1bb57fb3d4e4ab3c7b9e0308055cc0artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .5artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 83 file(s) — `core/src/main/scala/stainless/equivchk/EquivalenceChecker.scala`, `core/src/main/scala/stainless/extraction/imperative/EffectsAnalyzer.scala`, `core/src/main/scala/stainless/extraction/innerfuns/FunctionClosure.scala`, `core/src/main/scala/stainless/extraction/methods/Trees.scala`, `core/src/main/scala/stainless/extraction/oo/TypeEncoding.scala`, … (+78 more) — so the PII/GDPR sweep did not cover them at all.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm . /tmp/codehealth-osv-sbom-4ee1bb57fb3d4e4ab3c7b9e0308055cc0artifacts/raw/osv-scanner.json

Run 01a15d82-8db9-7809-be61-c6c59d504a41 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Issues: 30 · Warnings: 546 · Recommendations: 266 · Info: 6 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 21-10-2026 @ 08:09 UTC.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

⬇ Findings, MITRE CWE-tagged .sarif⬇ Health changelog .md