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-3901

Replacement counting reports matches instead of actual replacements · case 01

Replacement counting reports matches instead of actual replacements.

Regular expressions● Open access↗
FA-3902

Replacement counting reports matches instead of actual replacements · case 02

Replacement counting reports matches instead of actual replacements.

Regular expressions◈ Members↗
FA-3903

Replacement counting reports matches instead of actual replacements · case 03

Replacement counting reports matches instead of actual replacements.

Regular expressions◈ Members↗
FA-3904

Replacement counting reports matches instead of actual replacements · case 04

Replacement counting reports matches instead of actual replacements.

Regular expressions◈ Members↗
FA-3905

Replacement counting reports matches instead of actual replacements · case 05

Replacement counting reports matches instead of actual replacements.

Regular expressions◈ Members↗
FA-3906

Repeated token validation compares shape rather than content · case 01

Repeated token validation compares shape rather than content.

Regular expressions● Open access↗
FA-3907

Repeated token validation compares shape rather than content · case 02

Repeated token validation compares shape rather than content.

Regular expressions◈ Members↗
FA-3908

Repeated token validation compares shape rather than content · case 03

Repeated token validation compares shape rather than content.

Regular expressions◈ Members↗
FA-3909

Repeated token validation compares shape rather than content · case 04

Repeated token validation compares shape rather than content.

Regular expressions◈ Members↗
FA-3910

Repeated token validation compares shape rather than content · case 05

Repeated token validation compares shape rather than content.

Regular expressions◈ Members↗
FA-3911

A choice validator anchors only one alternative · case 01

A choice validator anchors only one alternative.

Regular expressions● Open access↗
FA-3912

A choice validator anchors only one alternative · case 02

A choice validator anchors only one alternative.

Regular expressions◈ Members↗
FA-3913

A choice validator anchors only one alternative · case 03

A choice validator anchors only one alternative.

Regular expressions◈ Members↗
FA-3914

A choice validator anchors only one alternative · case 04

A choice validator anchors only one alternative.

Regular expressions◈ Members↗
FA-3915

A choice validator anchors only one alternative · case 05

A choice validator anchors only one alternative.

Regular expressions◈ Members↗
FA-3916

A minimal token matcher yields empty tokens between characters · case 01

A minimal token matcher yields empty tokens between characters.

Regular expressions● Open access↗
FA-3917

A minimal token matcher yields empty tokens between characters · case 02

A minimal token matcher yields empty tokens between characters.

Regular expressions◈ Members↗
FA-3918

A minimal token matcher yields empty tokens between characters · case 03

A minimal token matcher yields empty tokens between characters.

Regular expressions◈ Members↗
FA-3919

A minimal token matcher yields empty tokens between characters · case 04

A minimal token matcher yields empty tokens between characters.

Regular expressions◈ Members↗
FA-3920

A minimal token matcher yields empty tokens between characters · case 05

A minimal token matcher yields empty tokens between characters.

Regular expressions◈ Members↗
FA-3921

A byte-budget truncation returns a partial UTF-8 scalar · case 01

A byte-budget truncation returns a partial UTF-8 scalar.

Encodings● Open access↗
FA-3922

A byte-budget truncation returns a partial UTF-8 scalar · case 02

A byte-budget truncation returns a partial UTF-8 scalar.

Encodings◈ Members↗
FA-3923

A byte-budget truncation returns a partial UTF-8 scalar · case 03

A byte-budget truncation returns a partial UTF-8 scalar.

Encodings◈ Members↗
FA-3924

A byte-budget truncation returns a partial UTF-8 scalar · case 04

A byte-budget truncation returns a partial UTF-8 scalar.

Encodings◈ Members↗
FA-3925

A byte-budget truncation returns a partial UTF-8 scalar · case 05

A byte-budget truncation returns a partial UTF-8 scalar.

Encodings◈ Members↗
FA-3926

UTF-16 code units are interpreted as Unicode scalars · case 01

UTF-16 code units are interpreted as Unicode scalars.

Encodings● Open access↗
FA-3927

UTF-16 code units are interpreted as Unicode scalars · case 02

UTF-16 code units are interpreted as Unicode scalars.

Encodings◈ Members↗
FA-3928

UTF-16 code units are interpreted as Unicode scalars · case 03

UTF-16 code units are interpreted as Unicode scalars.

Encodings◈ Members↗
FA-3929

UTF-16 code units are interpreted as Unicode scalars · case 04

UTF-16 code units are interpreted as Unicode scalars.

Encodings◈ Members↗
FA-3930

UTF-16 code units are interpreted as Unicode scalars · case 05

UTF-16 code units are interpreted as Unicode scalars.

Encodings◈ Members↗
FA-3931

An optional BOM is appended instead of prepended · case 01

An optional BOM is appended instead of prepended.

Encodings● Open access↗
FA-3932

An optional BOM is appended instead of prepended · case 02

An optional BOM is appended instead of prepended.

Encodings◈ Members↗
FA-3933

An optional BOM is appended instead of prepended · case 03

An optional BOM is appended instead of prepended.

Encodings◈ Members↗
FA-3934

An optional BOM is appended instead of prepended · case 04

An optional BOM is appended instead of prepended.

Encodings◈ Members↗
FA-3935

An optional BOM is appended instead of prepended · case 05

An optional BOM is appended instead of prepended.

Encodings◈ Members↗
FA-3936

A literal plus is not escaped in UTF-7 · case 01

A literal plus is not escaped in UTF-7.

Encodings● Open access↗
FA-3937

A literal plus is not escaped in UTF-7 · case 02

A literal plus is not escaped in UTF-7.

Encodings◈ Members↗
FA-3938

A literal plus is not escaped in UTF-7 · case 03

A literal plus is not escaped in UTF-7.

Encodings◈ Members↗
FA-3939

A literal plus is not escaped in UTF-7 · case 04

A literal plus is not escaped in UTF-7.

Encodings◈ Members↗
FA-3940

A literal plus is not escaped in UTF-7 · case 05

A literal plus is not escaped in UTF-7.

Encodings◈ Members↗
FA-3941

Unicode escape encoding mistakes literal escape text for a character · case 01

Unicode escape encoding mistakes literal escape text for a character.

Encodings● Open access↗
FA-3942

Unicode escape encoding mistakes literal escape text for a character · case 02

Unicode escape encoding mistakes literal escape text for a character.

Encodings◈ Members↗
FA-3943

Unicode escape encoding mistakes literal escape text for a character · case 03

Unicode escape encoding mistakes literal escape text for a character.

Encodings◈ Members↗
FA-3944

Unicode escape encoding mistakes literal escape text for a character · case 04

Unicode escape encoding mistakes literal escape text for a character.

Encodings◈ Members↗
FA-3945

Unicode escape encoding mistakes literal escape text for a character · case 05

Unicode escape encoding mistakes literal escape text for a character.

Encodings◈ Members↗
FA-3946

A common prefix routine chooses the shortest whole input · case 01

A common prefix routine chooses the shortest whole input.

Text processing● Open access↗
FA-3947

A common prefix routine chooses the shortest whole input · case 02

A common prefix routine chooses the shortest whole input.

Text processing◈ Members↗
FA-3948

A common prefix routine chooses the shortest whole input · case 03

A common prefix routine chooses the shortest whole input.

Text processing◈ Members↗
FA-3949

A common prefix routine chooses the shortest whole input · case 04

A common prefix routine chooses the shortest whole input.

Text processing◈ Members↗
FA-3950

A common prefix routine chooses the shortest whole input · case 05

A common prefix routine chooses the shortest whole input.

Text processing◈ Members↗
FA-3951

A suffix comparison scans from the front · case 01

A suffix comparison scans from the front.

Text processing● Open access↗
FA-3952

A suffix comparison scans from the front · case 02

A suffix comparison scans from the front.

Text processing◈ Members↗
FA-3953

A suffix comparison scans from the front · case 03

A suffix comparison scans from the front.

Text processing◈ Members↗
FA-3954

A suffix comparison scans from the front · case 04

A suffix comparison scans from the front.

Text processing◈ Members↗
FA-3955

A suffix comparison scans from the front · case 05

A suffix comparison scans from the front.

Text processing◈ Members↗
FA-3956

Cascaded substitutions rewrite newly inserted text · case 01

Cascaded substitutions rewrite newly inserted text.

Text processing● Open access↗
FA-3957

Cascaded substitutions rewrite newly inserted text · case 02

Cascaded substitutions rewrite newly inserted text.

Text processing◈ Members↗
FA-3958

Cascaded substitutions rewrite newly inserted text · case 03

Cascaded substitutions rewrite newly inserted text.

Text processing◈ Members↗
FA-3959

Cascaded substitutions rewrite newly inserted text · case 04

Cascaded substitutions rewrite newly inserted text.

Text processing◈ Members↗
FA-3960

Cascaded substitutions rewrite newly inserted text · case 05

Cascaded substitutions rewrite newly inserted text.

Text processing◈ Members↗
FA-3961

A replacement repeats until newly created matches disappear · case 01

A replacement repeats until newly created matches disappear.

Text processing● Open access↗
FA-3962

A replacement repeats until newly created matches disappear · case 02

A replacement repeats until newly created matches disappear.

Text processing◈ Members↗
FA-3963

A replacement repeats until newly created matches disappear · case 03

A replacement repeats until newly created matches disappear.

Text processing◈ Members↗
FA-3964

A replacement repeats until newly created matches disappear · case 04

A replacement repeats until newly created matches disappear.

Text processing◈ Members↗
FA-3965

A replacement repeats until newly created matches disappear · case 05

A replacement repeats until newly created matches disappear.

Text processing◈ Members↗
FA-3966

Character bigram extraction omits the last window · case 01

Character bigram extraction omits the last window.

Text processing● Open access↗
FA-3967

Character bigram extraction omits the last window · case 02

Character bigram extraction omits the last window.

Text processing◈ Members↗
FA-3968

Character bigram extraction omits the last window · case 03

Character bigram extraction omits the last window.

Text processing◈ Members↗
FA-3969

Character bigram extraction omits the last window · case 04

Character bigram extraction omits the last window.

Text processing◈ Members↗
FA-3970

Character bigram extraction omits the last window · case 05

Character bigram extraction omits the last window.

Text processing◈ Members↗
FA-3971

Word bigrams cross a record boundary · case 01

Word bigrams cross a record boundary.

Tokenization● Open access↗
FA-3972

Word bigrams cross a record boundary · case 02

Word bigrams cross a record boundary.

Tokenization◈ Members↗
FA-3973

Word bigrams cross a record boundary · case 03

Word bigrams cross a record boundary.

Tokenization◈ Members↗
FA-3974

Word bigrams cross a record boundary · case 04

Word bigrams cross a record boundary.

Tokenization◈ Members↗
FA-3975

Word bigrams cross a record boundary · case 05

Word bigrams cross a record boundary.

Tokenization◈ Members↗
FA-3976

Stopword removal deletes a substring of another word · case 01

Stopword removal deletes a substring of another word.

Text processing● Open access↗
FA-3977

Stopword removal deletes a substring of another word · case 02

Stopword removal deletes a substring of another word.

Text processing◈ Members↗
FA-3978

Stopword removal deletes a substring of another word · case 03

Stopword removal deletes a substring of another word.

Text processing◈ Members↗
FA-3979

Stopword removal deletes a substring of another word · case 04

Stopword removal deletes a substring of another word.

Text processing◈ Members↗
FA-3980

Stopword removal deletes a substring of another word · case 05

Stopword removal deletes a substring of another word.

Text processing◈ Members↗
FA-3981

Text edit distance counts only length difference · case 01

Text edit distance counts only length difference.

Text processing● Open access↗
FA-3982

Text edit distance counts only length difference · case 02

Text edit distance counts only length difference.

Text processing◈ Members↗
FA-3983

Text edit distance counts only length difference · case 03

Text edit distance counts only length difference.

Text processing◈ Members↗
FA-3984

Text edit distance counts only length difference · case 04

Text edit distance counts only length difference.

Text processing◈ Members↗
FA-3985

Text edit distance counts only length difference · case 05

Text edit distance counts only length difference.

Text processing◈ Members↗
FA-3986

A trie prefix is reported as a complete word · case 01

A trie prefix is reported as a complete word.

Parsing● Open access↗
FA-3987

A trie prefix is reported as a complete word · case 02

A trie prefix is reported as a complete word.

Parsing◈ Members↗
FA-3988

A trie prefix is reported as a complete word · case 03

A trie prefix is reported as a complete word.

Parsing◈ Members↗
FA-3989

A trie prefix is reported as a complete word · case 04

A trie prefix is reported as a complete word.

Parsing◈ Members↗
FA-3990

A trie prefix is reported as a complete word · case 05

A trie prefix is reported as a complete word.

Parsing◈ Members↗
FA-3991

Entity decoding keeps only the first resulting codepoint · case 01

Entity decoding keeps only the first resulting codepoint.

Markup● Open access↗
FA-3992

Entity decoding keeps only the first resulting codepoint · case 02

Entity decoding keeps only the first resulting codepoint.

Markup◈ Members↗
FA-3993

Entity decoding keeps only the first resulting codepoint · case 03

Entity decoding keeps only the first resulting codepoint.

Markup◈ Members↗
FA-3994

Entity decoding keeps only the first resulting codepoint · case 04

Entity decoding keeps only the first resulting codepoint.

Markup◈ Members↗
FA-3995

Entity decoding keeps only the first resulting codepoint · case 05

Entity decoding keeps only the first resulting codepoint.

Markup◈ Members↗
FA-3996

CDATA serialization emits an embedded terminator · case 01

CDATA serialization emits an embedded terminator.

Markup● Open access↗
FA-3997

CDATA serialization emits an embedded terminator · case 02

CDATA serialization emits an embedded terminator.

Markup◈ Members↗
FA-3998

CDATA serialization emits an embedded terminator · case 03

CDATA serialization emits an embedded terminator.

Markup◈ Members↗
FA-3999

CDATA serialization emits an embedded terminator · case 04

CDATA serialization emits an embedded terminator.

Markup◈ Members↗
FA-4000

CDATA serialization emits an embedded terminator · case 05

CDATA serialization emits an embedded terminator.

Markup◈ 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 ↗