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 ↗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
Bipartite validation ignores an unvisited odd-cycle component · case 01
Bipartite validation ignores an unvisited odd-cycle component.
Bipartite validation ignores an unvisited odd-cycle component · case 02
Bipartite validation ignores an unvisited odd-cycle component.
Bipartite validation ignores an unvisited odd-cycle component · case 03
Bipartite validation ignores an unvisited odd-cycle component.
Bipartite validation ignores an unvisited odd-cycle component · case 04
Bipartite validation ignores an unvisited odd-cycle component.
Bipartite validation ignores an unvisited odd-cycle component · case 05
Bipartite validation ignores an unvisited odd-cycle component.
Duplicate dependency declarations strand a valid topological vertex · case 01
Duplicate dependency declarations strand a valid topological vertex.
Duplicate dependency declarations strand a valid topological vertex · case 02
Duplicate dependency declarations strand a valid topological vertex.
Duplicate dependency declarations strand a valid topological vertex · case 03
Duplicate dependency declarations strand a valid topological vertex.
Duplicate dependency declarations strand a valid topological vertex · case 04
Duplicate dependency declarations strand a valid topological vertex.
Duplicate dependency declarations strand a valid topological vertex · case 05
Duplicate dependency declarations strand a valid topological vertex.
Euler trail feasibility checks parity without edge connectivity · case 01
Euler trail feasibility checks parity without edge connectivity.
Euler trail feasibility checks parity without edge connectivity · case 02
Euler trail feasibility checks parity without edge connectivity.
Euler trail feasibility checks parity without edge connectivity · case 03
Euler trail feasibility checks parity without edge connectivity.
Euler trail feasibility checks parity without edge connectivity · case 04
Euler trail feasibility checks parity without edge connectivity.
Euler trail feasibility checks parity without edge connectivity · case 05
Euler trail feasibility checks parity without edge connectivity.
Matching freezes an early choice instead of following an augmenting path · case 01
Matching freezes an early choice instead of following an augmenting path.
Matching freezes an early choice instead of following an augmenting path · case 02
Matching freezes an early choice instead of following an augmenting path.
Matching freezes an early choice instead of following an augmenting path · case 03
Matching freezes an early choice instead of following an augmenting path.
Matching freezes an early choice instead of following an augmenting path · case 04
Matching freezes an early choice instead of following an augmenting path.
Matching freezes an early choice instead of following an augmenting path · case 05
Matching freezes an early choice instead of following an augmenting path.
Transitive reduction lets the candidate edge justify its own removal · case 01
Transitive reduction lets the candidate edge justify its own removal.
Transitive reduction lets the candidate edge justify its own removal · case 02
Transitive reduction lets the candidate edge justify its own removal.
Transitive reduction lets the candidate edge justify its own removal · case 03
Transitive reduction lets the candidate edge justify its own removal.
Transitive reduction lets the candidate edge justify its own removal · case 04
Transitive reduction lets the candidate edge justify its own removal.
Transitive reduction lets the candidate edge justify its own removal · case 05
Transitive reduction lets the candidate edge justify its own removal.
Core decomposition stops after deleting only the initial low-degree frontier · case 01
Core decomposition stops after deleting only the initial low-degree frontier.
Core decomposition stops after deleting only the initial low-degree frontier · case 02
Core decomposition stops after deleting only the initial low-degree frontier.
Core decomposition stops after deleting only the initial low-degree frontier · case 03
Core decomposition stops after deleting only the initial low-degree frontier.
Core decomposition stops after deleting only the initial low-degree frontier · case 04
Core decomposition stops after deleting only the initial low-degree frontier.
Core decomposition stops after deleting only the initial low-degree frontier · case 05
Core decomposition stops after deleting only the initial low-degree frontier.
Articulation detection compares against one component in a disconnected graph · case 01
Articulation detection compares against one component in a disconnected graph.
Articulation detection compares against one component in a disconnected graph · case 02
Articulation detection compares against one component in a disconnected graph.
Articulation detection compares against one component in a disconnected graph · case 03
Articulation detection compares against one component in a disconnected graph.
Articulation detection compares against one component in a disconnected graph · case 04
Articulation detection compares against one component in a disconnected graph.
Articulation detection compares against one component in a disconnected graph · case 05
Articulation detection compares against one component in a disconnected graph.
Triangle counting includes closed walks through self loops · case 01
Triangle counting includes closed walks through self loops.
Triangle counting includes closed walks through self loops · case 02
Triangle counting includes closed walks through self loops.
Triangle counting includes closed walks through self loops · case 03
Triangle counting includes closed walks through self loops.
Triangle counting includes closed walks through self loops · case 04
Triangle counting includes closed walks through self loops.
Triangle counting includes closed walks through self loops · case 05
Triangle counting includes closed walks through self loops.
Decimal spelling loses plural operands · case 01
Decimal spelling loses plural operands.
Decimal spelling loses plural operands · case 02
Decimal spelling loses plural operands.
Decimal spelling loses plural operands · case 03
Decimal spelling loses plural operands.
Decimal spelling loses plural operands · case 04
Decimal spelling loses plural operands.
Decimal spelling loses plural operands · case 05
Decimal spelling loses plural operands.
Last-digit plural rules misclassify teen quantities · case 01
Last-digit plural rules misclassify teen quantities.
Last-digit plural rules misclassify teen quantities · case 02
Last-digit plural rules misclassify teen quantities.
Last-digit plural rules misclassify teen quantities · case 03
Last-digit plural rules misclassify teen quantities.
Last-digit plural rules misclassify teen quantities · case 04
Last-digit plural rules misclassify teen quantities.
Last-digit plural rules misclassify teen quantities · case 05
Last-digit plural rules misclassify teen quantities.
Ordinal selection reuses cardinal categories · case 01
Ordinal selection reuses cardinal categories.
Ordinal selection reuses cardinal categories · case 02
Ordinal selection reuses cardinal categories.
Ordinal selection reuses cardinal categories · case 03
Ordinal selection reuses cardinal categories.
Ordinal selection reuses cardinal categories · case 04
Ordinal selection reuses cardinal categories.
Ordinal selection reuses cardinal categories · case 05
Ordinal selection reuses cardinal categories.
Plural offset shifts exact-value selectors · case 01
Plural offset shifts exact-value selectors.
Plural offset shifts exact-value selectors · case 02
Plural offset shifts exact-value selectors.
Plural offset shifts exact-value selectors · case 03
Plural offset shifts exact-value selectors.
Plural offset shifts exact-value selectors · case 04
Plural offset shifts exact-value selectors.
Plural offset shifts exact-value selectors · case 05
Plural offset shifts exact-value selectors.
Contextual translations collapse identical source words · case 01
Contextual translations collapse identical source words.
Contextual translations collapse identical source words · case 02
Contextual translations collapse identical source words.
Contextual translations collapse identical source words · case 03
Contextual translations collapse identical source words.
Contextual translations collapse identical source words · case 04
Contextual translations collapse identical source words.
Contextual translations collapse identical source words · case 05
Contextual translations collapse identical source words.
Regional lookup skips an intermediate locale · case 01
Regional lookup skips an intermediate locale.
Regional lookup skips an intermediate locale · case 02
Regional lookup skips an intermediate locale.
Regional lookup skips an intermediate locale · case 03
Regional lookup skips an intermediate locale.
Regional lookup skips an intermediate locale · case 04
Regional lookup skips an intermediate locale.
Regional lookup skips an intermediate locale · case 05
Regional lookup skips an intermediate locale.
Fallback messages use the requested locale plural rule · case 01
Fallback messages use the requested locale plural rule.
Fallback messages use the requested locale plural rule · case 02
Fallback messages use the requested locale plural rule.
Fallback messages use the requested locale plural rule · case 03
Fallback messages use the requested locale plural rule.
Fallback messages use the requested locale plural rule · case 04
Fallback messages use the requested locale plural rule.
Fallback messages use the requested locale plural rule · case 05
Fallback messages use the requested locale plural rule.
Inserted message arguments are parsed again · case 01
Inserted message arguments are parsed again.
Inserted message arguments are parsed again · case 02
Inserted message arguments are parsed again.
Inserted message arguments are parsed again · case 03
Inserted message arguments are parsed again.
Inserted message arguments are parsed again · case 04
Inserted message arguments are parsed again.
Inserted message arguments are parsed again · case 05
Inserted message arguments are parsed again.
Unselected message branches demand unavailable variables · case 01
Unselected message branches demand unavailable variables.
Unselected message branches demand unavailable variables · case 02
Unselected message branches demand unavailable variables.
Unselected message branches demand unavailable variables · case 03
Unselected message branches demand unavailable variables.
Unselected message branches demand unavailable variables · case 04
Unselected message branches demand unavailable variables.
Unselected message branches demand unavailable variables · case 05
Unselected message branches demand unavailable variables.
Locale negotiation ignores preference weights or explicit exclusions · case 01
Locale negotiation ignores preference weights or explicit exclusions.
Locale negotiation ignores preference weights or explicit exclusions · case 02
Locale negotiation ignores preference weights or explicit exclusions.
Locale negotiation ignores preference weights or explicit exclusions · case 03
Locale negotiation ignores preference weights or explicit exclusions.
Locale negotiation ignores preference weights or explicit exclusions · case 04
Locale negotiation ignores preference weights or explicit exclusions.
Locale negotiation ignores preference weights or explicit exclusions · case 05
Locale negotiation ignores preference weights or explicit exclusions.
Section footnote restarts reuse stale reference-number assignments · case 01
Section footnote restarts reuse stale reference-number assignments in the controlled document model.
Section footnote restarts reuse stale reference-number assignments · case 02
Section footnote restarts reuse stale reference-number assignments in the controlled document model.
Section footnote restarts reuse stale reference-number assignments · case 03
Section footnote restarts reuse stale reference-number assignments in the controlled document model.
Section footnote restarts reuse stale reference-number assignments · case 04
Section footnote restarts reuse stale reference-number assignments in the controlled document model.
Section footnote restarts reuse stale reference-number assignments · case 05
Section footnote restarts reuse stale reference-number assignments in the controlled document model.
An explicitly empty section header incorrectly inherits content · case 01
An explicitly empty section header incorrectly inherits content in the controlled document model.
An explicitly empty section header incorrectly inherits content · case 02
An explicitly empty section header incorrectly inherits content in the controlled document model.
An explicitly empty section header incorrectly inherits content · case 03
An explicitly empty section header incorrectly inherits content in the controlled document model.
An explicitly empty section header incorrectly inherits content · case 04
An explicitly empty section header incorrectly inherits content in the controlled document model.
An explicitly empty section header incorrectly inherits content · case 05
An explicitly empty section header incorrectly inherits content in the controlled document model.
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 ↗