{"abstract":"Reverse bookmark mapping includes the exclusive stop.","category":"Bounded deques","checks":6,"contract":"Reverse a valid half-open range in a bounded deque and return an old-index to new-index mapping for stable bookmarks. Empty ranges leave all positions unchanged.","evaluation_group":"s3-bounded-deques-range-reverse","failed_approach":"The partial repair still applies the incorrect transition to an admitted boundary or multi-element case.","family":"s3-bounded-deques-range-reverse-bookmark-membership","id":"FA-46301","implementations":{"attempt":{"sha256":"f5c2d3223dc703f43c76c6c44fc4920211a909a6040be6b431cf0e443a596f32","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x):\n    a,start,stop=x\n    result=a[:start]+a[start:stop][::-1]+a[stop:]\n    mapping=[]\n    for i in range(len(a)):\n        target=start+stop-1-i if (start<=i<stop if start==stop else start<=i<=stop) else i\n        mapping.append(target)\n    return [result,mapping]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('0', solve([[N,N+1,N+2,N+3,N+4],1,4]), {1: [[1, 4, 3, 2, 5], [0, 3, 2, 1, 4]], 2: [[2, 5, 4, 3, 6], [0, 3, 2, 1, 4]], 3: [[3, 6, 5, 4, 7], [0, 3, 2, 1, 4]], 4: [[4, 7, 6, 5, 8], [0, 3, 2, 1, 4]], 5: [[5, 8, 7, 6, 9], [0, 3, 2, 1, 4]]}[N])\ncheck('1', solve([[N,N+1,N+2],0,3]), {1: [[3, 2, 1], [2, 1, 0]], 2: [[4, 3, 2], [2, 1, 0]], 3: [[5, 4, 3], [2, 1, 0]], 4: [[6, 5, 4], [2, 1, 0]], 5: [[7, 6, 5], [2, 1, 0]]}[N])\ncheck('2', solve([[N,N+1],1,1]), {1: [[1, 2], [0, 1]], 2: [[2, 3], [0, 1]], 3: [[3, 4], [0, 1]], 4: [[4, 5], [0, 1]], 5: [[5, 6], [0, 1]]}[N])\ncheck('3', solve([[N],0,1]), {1: [[1], [0]], 2: [[2], [0]], 3: [[3], [0]], 4: [[4], [0]], 5: [[5], [0]]}[N])\ncheck('4', solve([[],0,0]), {1: [[], []], 2: [[], []], 3: [[], []], 4: [[], []], 5: [[], []]}[N])\ncheck('5', solve([[N,N+1,N+2,N+3],2,4]), {1: [[1, 2, 4, 3], [0, 1, 3, 2]], 2: [[2, 3, 5, 4], [0, 1, 3, 2]], 3: [[3, 4, 6, 5], [0, 1, 3, 2]], 4: [[4, 5, 7, 6], [0, 1, 3, 2]], 5: [[5, 6, 8, 7], [0, 1, 3, 2]]}[N])\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":"81dffba291f38dbdc3a6018e78403c26ba5cf5695d37b20e7e0b1ac852c41f9b","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x):\n    a,start,stop=x\n    result=a[:start]+a[start:stop][::-1]+a[stop:]\n    mapping=[]\n    for i in range(len(a)):\n        target=start+stop-1-i if start<=i<=stop else i\n        mapping.append(target)\n    return [result,mapping]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('0', solve([[N,N+1,N+2,N+3,N+4],1,4]), {1: [[1, 4, 3, 2, 5], [0, 3, 2, 1, 4]], 2: [[2, 5, 4, 3, 6], [0, 3, 2, 1, 4]], 3: [[3, 6, 5, 4, 7], [0, 3, 2, 1, 4]], 4: [[4, 7, 6, 5, 8], [0, 3, 2, 1, 4]], 5: [[5, 8, 7, 6, 9], [0, 3, 2, 1, 4]]}[N])\ncheck('1', solve([[N,N+1,N+2],0,3]), {1: [[3, 2, 1], [2, 1, 0]], 2: [[4, 3, 2], [2, 1, 0]], 3: [[5, 4, 3], [2, 1, 0]], 4: [[6, 5, 4], [2, 1, 0]], 5: [[7, 6, 5], [2, 1, 0]]}[N])\ncheck('2', solve([[N,N+1],1,1]), {1: [[1, 2], [0, 1]], 2: [[2, 3], [0, 1]], 3: [[3, 4], [0, 1]], 4: [[4, 5], [0, 1]], 5: [[5, 6], [0, 1]]}[N])\ncheck('3', solve([[N],0,1]), {1: [[1], [0]], 2: [[2], [0]], 3: [[3], [0]], 4: [[4], [0]], 5: [[5], [0]]}[N])\ncheck('4', solve([[],0,0]), {1: [[], []], 2: [[], []], 3: [[], []], 4: [[], []], 5: [[], []]}[N])\ncheck('5', solve([[N,N+1,N+2,N+3],2,4]), {1: [[1, 2, 4, 3], [0, 1, 3, 2]], 2: [[2, 3, 5, 4], [0, 1, 3, 2]], 3: [[3, 4, 6, 5], [0, 1, 3, 2]], 4: [[4, 5, 7, 6], [0, 1, 3, 2]], 5: [[5, 6, 8, 7], [0, 1, 3, 2]]}[N])\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"},"fixed":{"sha256":"a402916bde8514081ee94dd3a1deb26b9bc994fc70b1a74f7c7c6cda2dafc95e","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(x):\n    a,start,stop=x\n    result=a[:start]+a[start:stop][::-1]+a[stop:]\n    mapping=[]\n    for i in range(len(a)):\n        target=start+stop-1-i if start<=i<stop else i\n        mapping.append(target)\n    return [result,mapping]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('0', solve([[N,N+1,N+2,N+3,N+4],1,4]), {1: [[1, 4, 3, 2, 5], [0, 3, 2, 1, 4]], 2: [[2, 5, 4, 3, 6], [0, 3, 2, 1, 4]], 3: [[3, 6, 5, 4, 7], [0, 3, 2, 1, 4]], 4: [[4, 7, 6, 5, 8], [0, 3, 2, 1, 4]], 5: [[5, 8, 7, 6, 9], [0, 3, 2, 1, 4]]}[N])\ncheck('1', solve([[N,N+1,N+2],0,3]), {1: [[3, 2, 1], [2, 1, 0]], 2: [[4, 3, 2], [2, 1, 0]], 3: [[5, 4, 3], [2, 1, 0]], 4: [[6, 5, 4], [2, 1, 0]], 5: [[7, 6, 5], [2, 1, 0]]}[N])\ncheck('2', solve([[N,N+1],1,1]), {1: [[1, 2], [0, 1]], 2: [[2, 3], [0, 1]], 3: [[3, 4], [0, 1]], 4: [[4, 5], [0, 1]], 5: [[5, 6], [0, 1]]}[N])\ncheck('3', solve([[N],0,1]), {1: [[1], [0]], 2: [[2], [0]], 3: [[3], [0]], 4: [[4], [0]], 5: [[5], [0]]}[N])\ncheck('4', solve([[],0,0]), {1: [[], []], 2: [[], []], 3: [[], []], 4: [[], []], 5: [[], []]}[N])\ncheck('5', solve([[N,N+1,N+2,N+3],2,4]), {1: [[1, 2, 4, 3], [0, 1, 3, 2]], 2: [[2, 3, 5, 4], [0, 1, 3, 2]], 3: [[3, 4, 6, 5], [0, 1, 3, 2]], 4: [[4, 5, 7, 6], [0, 1, 3, 2]], 5: [[5, 6, 8, 7], [0, 1, 3, 2]]}[N])\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":"Offline finite deterministic model; no claim of production implementation or concurrent memory-model conformance. 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":"s3-bounded-deques-range-reverse-bookmark-membership","generated_at":"2026-09-29T14:44:30.779947+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Controlled bounded deque implementation model with explicit storage and lifecycle observations.","repair":"Restore the documented bookmark membership invariant in range-reverse.","root_cause":"Reverse bookmark mapping includes the exclusive stop.","sha256":"74e10baa35fa3929ca627d36c155e000a2baf07e46ebf9242a4be64f8279d405","title":"Reverse bookmark mapping includes the exclusive stop · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":42.82,"exit_code":1,"observations":[{"actual":[[1,4,3,2,5],[0,3,2,1,0]],"check":"0","expected":[[1,4,3,2,5],[0,3,2,1,4]],"passed":false},{"actual":[[3,2,1],[2,1,0]],"check":"1","expected":[[3,2,1],[2,1,0]],"passed":true},{"actual":[[1,2],[0,1]],"check":"2","expected":[[1,2],[0,1]],"passed":true},{"actual":[[1],[0]],"check":"3","expected":[[1],[0]],"passed":true},{"actual":[[],[]],"check":"4","expected":[[],[]],"passed":true},{"actual":[[1,2,4,3],[0,1,3,2]],"check":"5","expected":[[1,2,4,3],[0,1,3,2]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"0\", \"actual\": [[1, 4, 3, 2, 5], [0, 3, 2, 1, 0]], \"expected\": [[1, 4, 3, 2, 5], [0, 3, 2, 1, 4]], \"passed\": false}, {\"check\": \"1\", \"actual\": [[3, 2, 1], [2, 1, 0]], \"expected\": [[3, 2, 1], [2, 1, 0]], \"passed\": true}, {\"check\": \"2\", \"actual\": [[1, 2], [0, 1]], \"expected\": [[1, 2], [0, 1]], \"passed\": true}, {\"check\": \"3\", \"actual\": [[1], [0]], \"expected\": [[1], [0]], \"passed\": true}, {\"check\": \"4\", \"actual\": [[], []], \"expected\": [[], []], \"passed\": true}, {\"check\": \"5\", \"actual\": [[1, 2, 4, 3], [0, 1, 3, 2]], \"expected\": [[1, 2, 4, 3], [0, 1, 3, 2]], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":39.504,"exit_code":1,"observations":[{"actual":[[1,4,3,2,5],[0,3,2,1,0]],"check":"0","expected":[[1,4,3,2,5],[0,3,2,1,4]],"passed":false},{"actual":[[3,2,1],[2,1,0]],"check":"1","expected":[[3,2,1],[2,1,0]],"passed":true},{"actual":[[1,2],[0,0]],"check":"2","expected":[[1,2],[0,1]],"passed":false},{"actual":[[1],[0]],"check":"3","expected":[[1],[0]],"passed":true},{"actual":[[],[]],"check":"4","expected":[[],[]],"passed":true},{"actual":[[1,2,4,3],[0,1,3,2]],"check":"5","expected":[[1,2,4,3],[0,1,3,2]],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"0\", \"actual\": [[1, 4, 3, 2, 5], [0, 3, 2, 1, 0]], \"expected\": [[1, 4, 3, 2, 5], [0, 3, 2, 1, 4]], \"passed\": false}, {\"check\": \"1\", \"actual\": [[3, 2, 1], [2, 1, 0]], \"expected\": [[3, 2, 1], [2, 1, 0]], \"passed\": true}, {\"check\": \"2\", \"actual\": [[1, 2], [0, 0]], \"expected\": [[1, 2], [0, 1]], \"passed\": false}, {\"check\": \"3\", \"actual\": [[1], [0]], \"expected\": [[1], [0]], \"passed\": true}, {\"check\": \"4\", \"actual\": [[], []], \"expected\": [[], []], \"passed\": true}, {\"check\": \"5\", \"actual\": [[1, 2, 4, 3], [0, 1, 3, 2]], \"expected\": [[1, 2, 4, 3], [0, 1, 3, 2]], \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":42.967,"exit_code":0,"observations":[{"actual":[[1,4,3,2,5],[0,3,2,1,4]],"check":"0","expected":[[1,4,3,2,5],[0,3,2,1,4]],"passed":true},{"actual":[[3,2,1],[2,1,0]],"check":"1","expected":[[3,2,1],[2,1,0]],"passed":true},{"actual":[[1,2],[0,1]],"check":"2","expected":[[1,2],[0,1]],"passed":true},{"actual":[[1],[0]],"check":"3","expected":[[1],[0]],"passed":true},{"actual":[[],[]],"check":"4","expected":[[],[]],"passed":true},{"actual":[[1,2,4,3],[0,1,3,2]],"check":"5","expected":[[1,2,4,3],[0,1,3,2]],"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"0\", \"actual\": [[1, 4, 3, 2, 5], [0, 3, 2, 1, 4]], \"expected\": [[1, 4, 3, 2, 5], [0, 3, 2, 1, 4]], \"passed\": true}, {\"check\": \"1\", \"actual\": [[3, 2, 1], [2, 1, 0]], \"expected\": [[3, 2, 1], [2, 1, 0]], \"passed\": true}, {\"check\": \"2\", \"actual\": [[1, 2], [0, 1]], \"expected\": [[1, 2], [0, 1]], \"passed\": true}, {\"check\": \"3\", \"actual\": [[1], [0]], \"expected\": [[1], [0]], \"passed\": true}, {\"check\": \"4\", \"actual\": [[], []], \"expected\": [[], []], \"passed\": true}, {\"check\": \"5\", \"actual\": [[1, 2, 4, 3], [0, 1, 3, 2]], \"expected\": [[1, 2, 4, 3], [0, 1, 3, 2]], \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}