{"abstract":"The operation returns a result or retained state that violates this contract: Return each occurrence ordinal within its equal-value subsequence, starting at one.","category":"Sequence semantics","checks":4,"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.","contract_signature":"x, y=None","evaluation_group":"model-38794aba794a5209","failed_approach":"The current occurrence is excluded from its own ordinal count.","family":"xr-occurrence-ordinal-per-position","id":"FA-4226","implementations":{"attempt":{"sha256":"0ec3c3dd00c5f223cce43fdf30d8fbde0d7f1f60441a3b7e2ffef634889ff6f3","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x, y=None):\n    return [x[:i].count(v) for i,v in enumerate(x)]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('empty collection', solve([]), [])\ncheck('singleton collection', solve(['a']), [1])\ncheck('two distinct elements', solve(['a', 'b']), [1, 1])\ncheck('nonadjacent duplicate and unsorted order', solve(['b', 'a', 'b', 'c']), [1, 1, 2, 1])\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"},"broken":{"sha256":"c35b8025cf7b6b2f6c1482e9fb8448fddc14bbec094323346a2846cdb78ebd36","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x, y=None):\n    return [x.count(v) for v in x]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('empty collection', solve([]), [])\ncheck('singleton collection', solve(['a']), [1])\ncheck('two distinct elements', solve(['a', 'b']), [1, 1])\ncheck('nonadjacent duplicate and unsorted order', solve(['b', 'a', 'b', 'c']), [1, 1, 2, 1])\nprint(json.dumps({\"observations\": observations, \"passed\": all(x[\"passed\"] for x in observations)}, ensure_ascii=False))\nraise SystemExit(0 if all(x[\"passed\"] for x in observations) else 1)\n"}},"limitations":" 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.","method":"Deterministic executable model with adversarial boundary fixtures.","provenance":{"created_by":"Failure Map","dependencies":"Python standard library","family":"xr-occurrence-ordinal-per-position","generated_at":"2026-09-29T14:37:37.101538+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A controlled local-runtime regression for collection APIs, language semantics, or ownership wrappers. Fixtures include boundary and interaction cases.","root_cause":"Global frequency replaces the occurrence number at the current position.","sha256":"782d0a8601bc6bbd8c1baf35ed86905f58e4768281c07ebf53c9123d05941bfe","title":"Occurrence ordinal per position · case 01","variant":1,"variant_policy":"Five execution reruns of a fixed adversarial fixture suite; variant number does not alter semantic inputs.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":36.987,"exit_code":1,"observations":[{"actual":[],"check":"empty collection","expected":[],"passed":true},{"actual":[0],"check":"singleton collection","expected":[1],"passed":false},{"actual":[0,0],"check":"two distinct elements","expected":[1,1],"passed":false},{"actual":[0,0,1,0],"check":"nonadjacent duplicate and unsorted order","expected":[1,1,2,1],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"empty collection\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"singleton collection\", \"actual\": [0], \"expected\": [1], \"passed\": false}, {\"check\": \"two distinct elements\", \"actual\": [0, 0], \"expected\": [1, 1], \"passed\": false}, {\"check\": \"nonadjacent duplicate and unsorted order\", \"actual\": [0, 0, 1, 0], \"expected\": [1, 1, 2, 1], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":37.036,"exit_code":1,"observations":[{"actual":[],"check":"empty collection","expected":[],"passed":true},{"actual":[1],"check":"singleton collection","expected":[1],"passed":true},{"actual":[1,1],"check":"two distinct elements","expected":[1,1],"passed":true},{"actual":[2,1,2,1],"check":"nonadjacent duplicate and unsorted order","expected":[1,1,2,1],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"empty collection\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"singleton collection\", \"actual\": [1], \"expected\": [1], \"passed\": true}, {\"check\": \"two distinct elements\", \"actual\": [1, 1], \"expected\": [1, 1], \"passed\": true}, {\"check\": \"nonadjacent duplicate and unsorted order\", \"actual\": [2, 1, 2, 1], \"expected\": [1, 1, 2, 1], \"passed\": false}], \"passed\": false}\n"}},"member_only":{"stages":["fixed"],"fields":["implementations.fixed","verification.fixed","harness","repair"],"note":"The verified repair, its recorded checks, the repair description, and the scoring harness are available to members."}}