BMC vs Unbounded Proof Strategies: Expanded Case Study

Extended case study

A formal regression involving BMC vs Unbounded Proof Strategies reopens late in the release cycle after RTL and constraint updates.

Background

Earlier runs were stable, but model assumptions drifted and property intent was not re-audited after implementation changes.

Symptoms observed

• Bound depth achieved, k-induction success rate, and ratio of bug-find to full-proof properties. trends worsen while status dashboards look superficially stable.

• counterexample patterns recur across related properties.

• reviewers disagree on whether failures are real bugs or modeling artifacts.

Investigation timeline

1. Hour 0: freeze RTL, assumptions, and tool settings for reproducibility.

2. Hour 1: classify failures into bug, model mismatch, or weak-property buckets.

3. Hour 2: isolate first divergence and map to requirement intent.

4. Hour 3: apply one constrained change and rerun focused property set.

5. Hour 4: confirm reachability and vacuity quality did not regress.

6. Hour 5: replay representative traces in simulation or equivalent flow.

7. Hour 6: publish closure memo with residual risk classification.

Root cause

Root cause traced to BMC vs Unbounded Proof Strategies: Bounded model checking (BMC) searches for counterexamples up to depth k and is excellent for quickly finding shallow bugs, initialization escapes, and protocol startup issues.

Fix and validation

• Correct assumption/property scope to preserve legal behavior.

• Add targeted helper checks that expose key intermediate invariants.

• Update runbook and requirement traceability for future regression stability.

Lessons learned

• Status color is not proof quality; audit supporting evidence.

• First-divergence classification outperforms broad trace inspection.

• Constraint and abstraction governance must be versioned and reviewed.

CASE STUDY - BMC vs Unbounded Proof Strategies
closure slope / vacuity trend / inconclusive aging / replay confidence

Formal deep dive

Convergence requires engine strategy, invariant quality, and model realism to move together with measurable progress.

Concept diagram

CONVERGENCE DECISION FLOW

property bucket -> engine strategy -> helper invariants -> convergence audit -> closure

Metric graph

CONVERGENCE BURNDOWN

open hard properties    ███████
inconclusive aging      █████
closed with audit       ████████

Metrics and artifacts to collect

• engine effectiveness by property class

• induction and helper-lemma success ratio

• stalled-property aging dashboard

• runtime vs closure-quality movement

Mini case study

A stalled set closed only after case-splitting by mode and auditing fairness assumptions for realism.

Debug branches

• Bucket properties by structure and intent before tuning.

• Inspect proof core stability, not runtime alone.

• Reject speed gains that reduce legal reachability.

Senior review question

Ask: which requirement intent is proven, under which assumptions, and what residual risk remains?

Key takeaways

• Tie each proof claim to assumption boundaries and reachability evidence.

• Prefer minimal reversible fixes and preserve legal behavior visibility.

Common pitfalls

• Treating runtime reduction as proof-quality improvement without audits.

• Declaring closure while critical covers remain unreachable.

• Using broad waivers instead of first-divergence root-cause ownership.

Principal formal review addendum

BMC vs Unbounded Proof Strategies should be reviewed as a requirement-evidence workflow, not a single status report.

Use Bound depth achieved, k-induction success rate, and ratio of bug-find to full-proof properties. as the monitoring lens and Proof intent matrix mapping each property to BMC depth goals, unbounded targets, and escalation criteria. as closure proof.

Convergence is an engineering loop: classify hard properties, tune engines, strengthen invariants, and audit constraints continuously. Strong teams preserve legal reachability while improving convergence.