FAILURE MAP

Understand the failure.
Verify the repair.

Small, reproducible software failures. The broken implementation, the fix that didn’t work, and the one that passed—preserved together.

Explore the cases ↓How results are verified ↗
100840Executable case variants
20168Distinct failure mechanisms
302520Executed implementations
20168Open-access cases

WHAT THE ARCHIVE CONTAINS

100840 executable cases. 20168 are open.

Every case records the implementation that fails, the fix that did not work, and the repair that passed its checks—with recorded outputs and source hashes. This release adds 100840 cases across 20168 failure mechanisms and 254 domains.

The open tier gives you the failure and the unsuccessful fix for one case in every mechanism. The remaining 80672 cases, 5 variants per mechanism, are member-only: the verified repair, its recorded checks, and the full fixture suite are held in the member archive. Read the methodology ↗

A RECORD OF WHAT WENT WRONG

Browse the archive / 100840

Python · Standard library
REFERENCEFAILURE MECHANISMDOMAINACCESS
FA-11401

A global recursion guard erases a repeated label branch · case 01

Shared text is lost in a label-reference graph, or a cycle prevents termination.

Accessibility interaction semantics● Open access↗
FA-11402

A global recursion guard erases a repeated label branch · case 02

Shared text is lost in a label-reference graph, or a cycle prevents termination.

Accessibility interaction semantics◈ Members↗
FA-11403

A global recursion guard erases a repeated label branch · case 03

Shared text is lost in a label-reference graph, or a cycle prevents termination.

Accessibility interaction semantics◈ Members↗
FA-11404

A global recursion guard erases a repeated label branch · case 04

Shared text is lost in a label-reference graph, or a cycle prevents termination.

Accessibility interaction semantics◈ Members↗
FA-11405

A global recursion guard erases a repeated label branch · case 05

Shared text is lost in a label-reference graph, or a cycle prevents termination.

Accessibility interaction semantics◈ Members↗
FA-11406

Name flattening leaves line breaks as spoken separators · case 01

Text fragments produce excess spaces or lose intentional nonbreaking characters.

Accessibility interaction semantics● Open access↗
FA-11407

Name flattening leaves line breaks as spoken separators · case 02

Text fragments produce excess spaces or lose intentional nonbreaking characters.

Accessibility interaction semantics◈ Members↗
FA-11408

Name flattening leaves line breaks as spoken separators · case 03

Text fragments produce excess spaces or lose intentional nonbreaking characters.

Accessibility interaction semantics◈ Members↗
FA-11409

Name flattening leaves line breaks as spoken separators · case 04

Text fragments produce excess spaces or lose intentional nonbreaking characters.

Accessibility interaction semantics◈ Members↗
FA-11410

Name flattening leaves line breaks as spoken separators · case 05

Text fragments produce excess spaces or lose intentional nonbreaking characters.

Accessibility interaction semantics◈ Members↗
FA-11411

Table headers leak across row groups or override explicit associations · case 01

A cell announces a group header belonging to a different section or inferred headers alongside explicit ones.

Accessibility interaction semantics● Open access↗
FA-11412

Table headers leak across row groups or override explicit associations · case 02

A cell announces a group header belonging to a different section or inferred headers alongside explicit ones.

Accessibility interaction semantics◈ Members↗
FA-11413

Table headers leak across row groups or override explicit associations · case 03

A cell announces a group header belonging to a different section or inferred headers alongside explicit ones.

Accessibility interaction semantics◈ Members↗
FA-11414

Table headers leak across row groups or override explicit associations · case 04

A cell announces a group header belonging to a different section or inferred headers alongside explicit ones.

Accessibility interaction semantics◈ Members↗
FA-11415

Table headers leak across row groups or override explicit associations · case 05

A cell announces a group header belonging to a different section or inferred headers alongside explicit ones.

Accessibility interaction semantics◈ Members↗
FA-11416

A virtual window reports local positions as global set positions · case 01

The first rendered row is announced as item one even when earlier items are offscreen.

Accessibility interaction semantics● Open access↗
FA-11417

A virtual window reports local positions as global set positions · case 02

The first rendered row is announced as item one even when earlier items are offscreen.

Accessibility interaction semantics◈ Members↗
FA-11418

A virtual window reports local positions as global set positions · case 03

The first rendered row is announced as item one even when earlier items are offscreen.

Accessibility interaction semantics◈ Members↗
FA-11419

A virtual window reports local positions as global set positions · case 04

The first rendered row is announced as item one even when earlier items are offscreen.

Accessibility interaction semantics◈ Members↗
FA-11420

A virtual window reports local positions as global set positions · case 05

The first rendered row is announced as item one even when earlier items are offscreen.

Accessibility interaction semantics◈ Members↗
FA-11421

Error text replaces persistent instructions in the description channel · case 01

Invalid controls lose their usage hint, or error text remains announced after validation succeeds.

Accessibility interaction semantics● Open access↗
FA-11422

Error text replaces persistent instructions in the description channel · case 02

Invalid controls lose their usage hint, or error text remains announced after validation succeeds.

Accessibility interaction semantics◈ Members↗
FA-11423

Error text replaces persistent instructions in the description channel · case 03

Invalid controls lose their usage hint, or error text remains announced after validation succeeds.

Accessibility interaction semantics◈ Members↗
FA-11424

Error text replaces persistent instructions in the description channel · case 04

Invalid controls lose their usage hint, or error text remains announced after validation succeeds.

Accessibility interaction semantics◈ Members↗
FA-11425

Error text replaces persistent instructions in the description channel · case 05

Invalid controls lose their usage hint, or error text remains announced after validation succeeds.

Accessibility interaction semantics◈ Members↗
FA-11426

A removal is announced under an additions-only live policy · case 01

Live-region mutation filtering emits irrelevant event kinds or loses text edits under the default policy.

Accessibility interaction semantics● Open access↗
FA-11427

A removal is announced under an additions-only live policy · case 02

Live-region mutation filtering emits irrelevant event kinds or loses text edits under the default policy.

Accessibility interaction semantics◈ Members↗
FA-11428

A removal is announced under an additions-only live policy · case 03

Live-region mutation filtering emits irrelevant event kinds or loses text edits under the default policy.

Accessibility interaction semantics◈ Members↗
FA-11429

A removal is announced under an additions-only live policy · case 04

Live-region mutation filtering emits irrelevant event kinds or loses text edits under the default policy.

Accessibility interaction semantics◈ Members↗
FA-11430

A removal is announced under an additions-only live policy · case 05

Live-region mutation filtering emits irrelevant event kinds or loses text edits under the default policy.

Accessibility interaction semantics◈ Members↗
FA-11431

A nested header is exposed as a page-wide banner landmark · case 01

Section-local headers and footers appear in the page landmark inventory, or unnamed sections create noisy regions.

Accessibility interaction semantics● Open access↗
FA-11432

A nested header is exposed as a page-wide banner landmark · case 02

Section-local headers and footers appear in the page landmark inventory, or unnamed sections create noisy regions.

Accessibility interaction semantics◈ Members↗
FA-11433

A nested header is exposed as a page-wide banner landmark · case 03

Section-local headers and footers appear in the page landmark inventory, or unnamed sections create noisy regions.

Accessibility interaction semantics◈ Members↗
FA-11434

A nested header is exposed as a page-wide banner landmark · case 04

Section-local headers and footers appear in the page landmark inventory, or unnamed sections create noisy regions.

Accessibility interaction semantics◈ Members↗
FA-11435

A nested header is exposed as a page-wide banner landmark · case 05

Section-local headers and footers appear in the page landmark inventory, or unnamed sections create noisy regions.

Accessibility interaction semantics◈ Members↗
FA-11436

An owned node appears under two accessibility parents · case 01

An explicit ownership edge adds a second copy instead of moving the child.

Accessibility interaction semantics● Open access↗
FA-11437

An owned node appears under two accessibility parents · case 02

An explicit ownership edge adds a second copy instead of moving the child.

Accessibility interaction semantics◈ Members↗
FA-11438

An owned node appears under two accessibility parents · case 03

An explicit ownership edge adds a second copy instead of moving the child.

Accessibility interaction semantics◈ Members↗
FA-11439

An owned node appears under two accessibility parents · case 04

An explicit ownership edge adds a second copy instead of moving the child.

Accessibility interaction semantics◈ Members↗
FA-11440

An owned node appears under two accessibility parents · case 05

An explicit ownership edge adds a second copy instead of moving the child.

Accessibility interaction semantics◈ Members↗
FA-11441

Constant propagation retains a fact after an unknown assignment · case 01

Constant propagation retains a fact after an unknown assignment.

Compiler transformation correctness● Open access↗
FA-11442

Constant propagation retains a fact after an unknown assignment · case 02

Constant propagation retains a fact after an unknown assignment.

Compiler transformation correctness◈ Members↗
FA-11443

Constant propagation retains a fact after an unknown assignment · case 03

Constant propagation retains a fact after an unknown assignment.

Compiler transformation correctness◈ Members↗
FA-11444

Constant propagation retains a fact after an unknown assignment · case 04

Constant propagation retains a fact after an unknown assignment.

Compiler transformation correctness◈ Members↗
FA-11445

Constant propagation retains a fact after an unknown assignment · case 05

Constant propagation retains a fact after an unknown assignment.

Compiler transformation correctness◈ Members↗
FA-11446

Dead-result elimination deletes a volatile read · case 01

Dead-result elimination deletes a volatile read.

Compiler transformation correctness● Open access↗
FA-11447

Dead-result elimination deletes a volatile read · case 02

Dead-result elimination deletes a volatile read.

Compiler transformation correctness◈ Members↗
FA-11448

Dead-result elimination deletes a volatile read · case 03

Dead-result elimination deletes a volatile read.

Compiler transformation correctness◈ Members↗
FA-11449

Dead-result elimination deletes a volatile read · case 04

Dead-result elimination deletes a volatile read.

Compiler transformation correctness◈ Members↗
FA-11450

Dead-result elimination deletes a volatile read · case 05

Dead-result elimination deletes a volatile read.

Compiler transformation correctness◈ Members↗
FA-11451

Expression numbering commutes subtraction operands · case 01

Expression numbering commutes subtraction operands.

Compiler transformation correctness● Open access↗
FA-11452

Expression numbering commutes subtraction operands · case 02

Expression numbering commutes subtraction operands.

Compiler transformation correctness◈ Members↗
FA-11453

Expression numbering commutes subtraction operands · case 03

Expression numbering commutes subtraction operands.

Compiler transformation correctness◈ Members↗
FA-11454

Expression numbering commutes subtraction operands · case 04

Expression numbering commutes subtraction operands.

Compiler transformation correctness◈ Members↗
FA-11455

Expression numbering commutes subtraction operands · case 05

Expression numbering commutes subtraction operands.

Compiler transformation correctness◈ Members↗
FA-11456

Phi lowering selects operands by block position · case 01

Phi lowering selects operands by block position.

Compiler transformation correctness● Open access↗
FA-11457

Phi lowering selects operands by block position · case 02

Phi lowering selects operands by block position.

Compiler transformation correctness◈ Members↗
FA-11458

Phi lowering selects operands by block position · case 03

Phi lowering selects operands by block position.

Compiler transformation correctness◈ Members↗
FA-11459

Phi lowering selects operands by block position · case 04

Phi lowering selects operands by block position.

Compiler transformation correctness◈ Members↗
FA-11460

Phi lowering selects operands by block position · case 05

Phi lowering selects operands by block position.

Compiler transformation correctness◈ Members↗
FA-11461

Loop invariant motion speculates a trapping operation on a zero-trip loop · case 01

Loop invariant motion speculates a trapping operation on a zero-trip loop.

Compiler transformation correctness● Open access↗
FA-11462

Loop invariant motion speculates a trapping operation on a zero-trip loop · case 02

Loop invariant motion speculates a trapping operation on a zero-trip loop.

Compiler transformation correctness◈ Members↗
FA-11463

Loop invariant motion speculates a trapping operation on a zero-trip loop · case 03

Loop invariant motion speculates a trapping operation on a zero-trip loop.

Compiler transformation correctness◈ Members↗
FA-11464

Loop invariant motion speculates a trapping operation on a zero-trip loop · case 04

Loop invariant motion speculates a trapping operation on a zero-trip loop.

Compiler transformation correctness◈ Members↗
FA-11465

Loop invariant motion speculates a trapping operation on a zero-trip loop · case 05

Loop invariant motion speculates a trapping operation on a zero-trip loop.

Compiler transformation correctness◈ Members↗
FA-11466

Division strength reduction rounds negative dividends downward · case 01

Division strength reduction rounds negative dividends downward.

Compiler transformation correctness● Open access↗
FA-11467

Division strength reduction rounds negative dividends downward · case 02

Division strength reduction rounds negative dividends downward.

Compiler transformation correctness◈ Members↗
FA-11468

Division strength reduction rounds negative dividends downward · case 03

Division strength reduction rounds negative dividends downward.

Compiler transformation correctness◈ Members↗
FA-11469

Division strength reduction rounds negative dividends downward · case 04

Division strength reduction rounds negative dividends downward.

Compiler transformation correctness◈ Members↗
FA-11470

Division strength reduction rounds negative dividends downward · case 05

Division strength reduction rounds negative dividends downward.

Compiler transformation correctness◈ Members↗
FA-11471

Inlining chooses a local name already used by the caller · case 01

Inlining chooses a local name already used by the caller.

Compiler transformation correctness● Open access↗
FA-11472

Inlining chooses a local name already used by the caller · case 02

Inlining chooses a local name already used by the caller.

Compiler transformation correctness◈ Members↗
FA-11473

Inlining chooses a local name already used by the caller · case 03

Inlining chooses a local name already used by the caller.

Compiler transformation correctness◈ Members↗
FA-11474

Inlining chooses a local name already used by the caller · case 04

Inlining chooses a local name already used by the caller.

Compiler transformation correctness◈ Members↗
FA-11475

Inlining chooses a local name already used by the caller · case 05

Inlining chooses a local name already used by the caller.

Compiler transformation correctness◈ Members↗
FA-11476

Boolean simplification erases evaluation of an effectful left operand · case 01

Boolean simplification erases evaluation of an effectful left operand.

Compiler transformation correctness● Open access↗
FA-11477

Boolean simplification erases evaluation of an effectful left operand · case 02

Boolean simplification erases evaluation of an effectful left operand.

Compiler transformation correctness◈ Members↗
FA-11478

Boolean simplification erases evaluation of an effectful left operand · case 03

Boolean simplification erases evaluation of an effectful left operand.

Compiler transformation correctness◈ Members↗
FA-11479

Boolean simplification erases evaluation of an effectful left operand · case 04

Boolean simplification erases evaluation of an effectful left operand.

Compiler transformation correctness◈ Members↗
FA-11480

Boolean simplification erases evaluation of an effectful left operand · case 05

Boolean simplification erases evaluation of an effectful left operand.

Compiler transformation correctness◈ Members↗
FA-11481

Store forwarding crosses an intervening may-alias write · case 01

Store forwarding crosses an intervening may-alias write.

Compiler transformation correctness● Open access↗
FA-11482

Store forwarding crosses an intervening may-alias write · case 02

Store forwarding crosses an intervening may-alias write.

Compiler transformation correctness◈ Members↗
FA-11483

Store forwarding crosses an intervening may-alias write · case 03

Store forwarding crosses an intervening may-alias write.

Compiler transformation correctness◈ Members↗
FA-11484

Store forwarding crosses an intervening may-alias write · case 04

Store forwarding crosses an intervening may-alias write.

Compiler transformation correctness◈ Members↗
FA-11485

Store forwarding crosses an intervening may-alias write · case 05

Store forwarding crosses an intervening may-alias write.

Compiler transformation correctness◈ Members↗
FA-11486

Instruction swapping ignores a write after an earlier read · case 01

Instruction swapping ignores a write after an earlier read.

Compiler transformation correctness● Open access↗
FA-11487

Instruction swapping ignores a write after an earlier read · case 02

Instruction swapping ignores a write after an earlier read.

Compiler transformation correctness◈ Members↗
FA-11488

Instruction swapping ignores a write after an earlier read · case 03

Instruction swapping ignores a write after an earlier read.

Compiler transformation correctness◈ Members↗
FA-11489

Instruction swapping ignores a write after an earlier read · case 04

Instruction swapping ignores a write after an earlier read.

Compiler transformation correctness◈ Members↗
FA-11490

Instruction swapping ignores a write after an earlier read · case 05

Instruction swapping ignores a write after an earlier read.

Compiler transformation correctness◈ Members↗
FA-11491

Joining branch intervals discards a reachable endpoint · case 01

Joining branch intervals discards a reachable endpoint.

Static analysis soundness● Open access↗
FA-11492

Joining branch intervals discards a reachable endpoint · case 02

Joining branch intervals discards a reachable endpoint.

Static analysis soundness◈ Members↗
FA-11493

Joining branch intervals discards a reachable endpoint · case 03

Joining branch intervals discards a reachable endpoint.

Static analysis soundness◈ Members↗
FA-11494

Joining branch intervals discards a reachable endpoint · case 04

Joining branch intervals discards a reachable endpoint.

Static analysis soundness◈ Members↗
FA-11495

Joining branch intervals discards a reachable endpoint · case 05

Joining branch intervals discards a reachable endpoint.

Static analysis soundness◈ Members↗
FA-11496

Widening retains an escaping lower bound · case 01

Widening retains an escaping lower bound.

Static analysis soundness● Open access↗
FA-11497

Widening retains an escaping lower bound · case 02

Widening retains an escaping lower bound.

Static analysis soundness◈ Members↗
FA-11498

Widening retains an escaping lower bound · case 03

Widening retains an escaping lower bound.

Static analysis soundness◈ Members↗
FA-11499

Widening retains an escaping lower bound · case 04

Widening retains an escaping lower bound.

Static analysis soundness◈ Members↗
FA-11500

Widening retains an escaping lower bound · case 05

Widening retains an escaping lower bound.

Static analysis soundness◈ Members↗

INSPECTABLE BY DESIGN

Every result has a runnable source.

Runnable implementations with recorded outputs, source hashes, and explicit contracts. Related variants share a failure mechanism and belong together in evaluation splits.

Read the methodology ↗