FA-4226 / Sequence semantics / Open access
Occurrence ordinal per position · case 01
The operation returns a result or retained state that violates this contract: Return each occurrence ordinal within its equal-value subsequence, starting at one.
ROOT CAUSE
Global frequency replaces the occurrence number at the current position.
THE FAILURE
Global frequency replaces the occurrence number at the current position.
Unsuccessful approach: The current occurrence is excluded from its own ordinal count.
Case contract
Return each occurrence ordinal within its equal-value subsequence, starting at one. Inputs are the finite Python values shown by the executable fixtures; no concurrent execution is assumed.
Why this case matters
A controlled local-runtime regression for collection APIs, language semantics, or ownership wrappers. Fixtures include boundary and interaction cases.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(x, y=None):
return [x.count(v) for v in x]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('empty collection', solve([]), [])
check('singleton collection', solve(['a']), [1])
check('two distinct elements', solve(['a', 'b']), [1, 1])
check('nonadjacent duplicate and unsorted order', solve(['b', 'a', 'b', 'c']), [1, 1, 2, 1])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| empty collection | [] | [] | Passed |
| singleton collection | [1] | [1] | Passed |
| two distinct elements | [1, 1] | [1, 1] | Passed |
| nonadjacent duplicate and unsorted order | [2, 1, 2, 1] | [1, 1, 2, 1] | Failed |
SHA-256 / c35b8025cf7b6b2f6c1482e9fb8448fddc14bbec094323346a2846cdb78ebd36
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(x, y=None):
return [x[:i].count(v) for i,v in enumerate(x)]
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('empty collection', solve([]), [])
check('singleton collection', solve(['a']), [1])
check('two distinct elements', solve(['a', 'b']), [1, 1])
check('nonadjacent duplicate and unsorted order', solve(['b', 'a', 'b', 'c']), [1, 1, 2, 1])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| empty collection | [] | [] | Passed |
| singleton collection | [0] | [1] | Failed |
| two distinct elements | [0, 0] | [1, 1] | Failed |
| nonadjacent duplicate and unsorted order | [0, 0, 1, 0] | [1, 1, 2, 1] | Failed |
SHA-256 / 0ec3c3dd00c5f223cce43fdf30d8fbde0d7f1f60441a3b7e2ffef634889ff6f3
HELD IN THE MEMBER ARCHIVE
The verified repair and its recorded checks are member-only.
This mechanism has 4 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.
Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.
Member access is invitation-based. Sign in with your invited account to inspect the repair.
Sign in to the archive ↗Verification & scope
This reproducer isolates one failure mechanism. Results cover the supplied fixtures. Variants within a family share a test contract and should remain grouped when constructing evaluation splits. Related mechanisms with a shared evaluation_group must also remain together; these controlled models are not independent production incidents.
Observations recorded using Python 3.12.14 at 2026-09-29T14:37:37.101538+00:00.
Case digest / 782d0a8601bc6bbd8c1baf35ed86905f58e4768281c07ebf53c9123d05941bfe