{"abstract":"Interval join emits only the first active matching interval.","category":"Data systems","checks":7,"contract":"Join probe points [id,key,time] to interval rows [id,key,start,end] under start<=time<end and ordinary non-null key equality. Emit probe-major [probe-id,interval-id] pairs, with matching intervals ordered by (start,id). Empty intervals never match; overlapping intervals all produce rows.","evaluation_group":"s3-data-systems-interval-join-sweep","failed_approach":"Clearing candidates after one output still loses overlapping matches.","family":"s3-data-systems-interval-join-sweep-overlap-bag","id":"FA-45826","implementations":{"attempt":{"sha256":"0f27a3893637a87fb593001af90c527dd980fd510908e7dfe159d329b8db6d6d","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(d):\n    try:\n        points,intervals=d\n        out=[]\n        for ident,key,time in points:\n            candidates=sorted(intervals,key=lambda r:(r[2],r[0]))\n            for other,k,start,end in candidates:\n                if key is None or key!=k: continue\n                if start<=time and time<end:\n                    out.append([ident,other]); candidates=[]; break\n        return out\n    except (IndexError, KeyError, ValueError, StopIteration) as exc:\n        return {\"representation_error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nif N == 1:\n    check('end expired', solve([[[10, 'a', 3]], [[20, 'a', 1, 3]]]), [])\n    check('start active', solve([[[10, 'a', 1]], [[20, 'a', 1, 3]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 1]], [[20, 'a', 2, 4]]]), [])\n    check('overlap order', solve([[[10, 'a', 3]], [[20, 'a', 2, 5], [21, 'a', 1, 4]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 2]], [[20, 'b', 1, 4], [21, None, 1, 4]]]), [])\n    check('empty interval', solve([[[10, 'a', 1]], [[20, 'a', 1, 1]]]), [])\n    check('null probe', solve([[[10, None, 2]], [[20, None, 1, 4]]]), [])\nelif N == 2:\n    check('end expired', solve([[[10, 'a', 4]], [[20, 'a', 2, 4]]]), [])\n    check('start active', solve([[[10, 'a', 2]], [[20, 'a', 2, 4]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 2]], [[20, 'a', 3, 5]]]), [])\n    check('overlap order', solve([[[10, 'a', 4]], [[20, 'a', 3, 6], [21, 'a', 2, 5]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 3]], [[20, 'b', 2, 5], [21, None, 2, 5]]]), [])\n    check('empty interval', solve([[[10, 'a', 2]], [[20, 'a', 2, 2]]]), [])\n    check('null probe', solve([[[10, None, 3]], [[20, None, 2, 5]]]), [])\nelif N == 3:\n    check('end expired', solve([[[10, 'a', 5]], [[20, 'a', 3, 5]]]), [])\n    check('start active', solve([[[10, 'a', 3]], [[20, 'a', 3, 5]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 3]], [[20, 'a', 4, 6]]]), [])\n    check('overlap order', solve([[[10, 'a', 5]], [[20, 'a', 4, 7], [21, 'a', 3, 6]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 4]], [[20, 'b', 3, 6], [21, None, 3, 6]]]), [])\n    check('empty interval', solve([[[10, 'a', 3]], [[20, 'a', 3, 3]]]), [])\n    check('null probe', solve([[[10, None, 4]], [[20, None, 3, 6]]]), [])\nelif N == 4:\n    check('end expired', solve([[[10, 'a', 6]], [[20, 'a', 4, 6]]]), [])\n    check('start active', solve([[[10, 'a', 4]], [[20, 'a', 4, 6]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 4]], [[20, 'a', 5, 7]]]), [])\n    check('overlap order', solve([[[10, 'a', 6]], [[20, 'a', 5, 8], [21, 'a', 4, 7]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 5]], [[20, 'b', 4, 7], [21, None, 4, 7]]]), [])\n    check('empty interval', solve([[[10, 'a', 4]], [[20, 'a', 4, 4]]]), [])\n    check('null probe', solve([[[10, None, 5]], [[20, None, 4, 7]]]), [])\nelif N == 5:\n    check('end expired', solve([[[10, 'a', 7]], [[20, 'a', 5, 7]]]), [])\n    check('start active', solve([[[10, 'a', 5]], [[20, 'a', 5, 7]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 5]], [[20, 'a', 6, 8]]]), [])\n    check('overlap order', solve([[[10, 'a', 7]], [[20, 'a', 6, 9], [21, 'a', 5, 8]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 6]], [[20, 'b', 5, 8], [21, None, 5, 8]]]), [])\n    check('empty interval', solve([[[10, 'a', 5]], [[20, 'a', 5, 5]]]), [])\n    check('null probe', solve([[[10, None, 6]], [[20, None, 5, 8]]]), [])\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":"d396f71ef6cf4940fe2d041ac38b1d6bdb397bd423fc3ef61e60c19cec9cd232","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(d):\n    try:\n        points,intervals=d\n        out=[]\n        for ident,key,time in points:\n            candidates=sorted(intervals,key=lambda r:(r[2],r[0]))\n            for other,k,start,end in candidates:\n                if key is None or key!=k: continue\n                if start<=time and time<end:\n                    out.append([ident,other]); break\n        return out\n    except (IndexError, KeyError, ValueError, StopIteration) as exc:\n        return {\"representation_error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nif N == 1:\n    check('end expired', solve([[[10, 'a', 3]], [[20, 'a', 1, 3]]]), [])\n    check('start active', solve([[[10, 'a', 1]], [[20, 'a', 1, 3]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 1]], [[20, 'a', 2, 4]]]), [])\n    check('overlap order', solve([[[10, 'a', 3]], [[20, 'a', 2, 5], [21, 'a', 1, 4]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 2]], [[20, 'b', 1, 4], [21, None, 1, 4]]]), [])\n    check('empty interval', solve([[[10, 'a', 1]], [[20, 'a', 1, 1]]]), [])\n    check('null probe', solve([[[10, None, 2]], [[20, None, 1, 4]]]), [])\nelif N == 2:\n    check('end expired', solve([[[10, 'a', 4]], [[20, 'a', 2, 4]]]), [])\n    check('start active', solve([[[10, 'a', 2]], [[20, 'a', 2, 4]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 2]], [[20, 'a', 3, 5]]]), [])\n    check('overlap order', solve([[[10, 'a', 4]], [[20, 'a', 3, 6], [21, 'a', 2, 5]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 3]], [[20, 'b', 2, 5], [21, None, 2, 5]]]), [])\n    check('empty interval', solve([[[10, 'a', 2]], [[20, 'a', 2, 2]]]), [])\n    check('null probe', solve([[[10, None, 3]], [[20, None, 2, 5]]]), [])\nelif N == 3:\n    check('end expired', solve([[[10, 'a', 5]], [[20, 'a', 3, 5]]]), [])\n    check('start active', solve([[[10, 'a', 3]], [[20, 'a', 3, 5]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 3]], [[20, 'a', 4, 6]]]), [])\n    check('overlap order', solve([[[10, 'a', 5]], [[20, 'a', 4, 7], [21, 'a', 3, 6]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 4]], [[20, 'b', 3, 6], [21, None, 3, 6]]]), [])\n    check('empty interval', solve([[[10, 'a', 3]], [[20, 'a', 3, 3]]]), [])\n    check('null probe', solve([[[10, None, 4]], [[20, None, 3, 6]]]), [])\nelif N == 4:\n    check('end expired', solve([[[10, 'a', 6]], [[20, 'a', 4, 6]]]), [])\n    check('start active', solve([[[10, 'a', 4]], [[20, 'a', 4, 6]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 4]], [[20, 'a', 5, 7]]]), [])\n    check('overlap order', solve([[[10, 'a', 6]], [[20, 'a', 5, 8], [21, 'a', 4, 7]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 5]], [[20, 'b', 4, 7], [21, None, 4, 7]]]), [])\n    check('empty interval', solve([[[10, 'a', 4]], [[20, 'a', 4, 4]]]), [])\n    check('null probe', solve([[[10, None, 5]], [[20, None, 4, 7]]]), [])\nelif N == 5:\n    check('end expired', solve([[[10, 'a', 7]], [[20, 'a', 5, 7]]]), [])\n    check('start active', solve([[[10, 'a', 5]], [[20, 'a', 5, 7]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 5]], [[20, 'a', 6, 8]]]), [])\n    check('overlap order', solve([[[10, 'a', 7]], [[20, 'a', 6, 9], [21, 'a', 5, 8]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 6]], [[20, 'b', 5, 8], [21, None, 5, 8]]]), [])\n    check('empty interval', solve([[[10, 'a', 5]], [[20, 'a', 5, 5]]]), [])\n    check('null probe', solve([[[10, None, 6]], [[20, None, 5, 8]]]), [])\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":"b230bbf54b4b8850023693996f3db71aa31536ec49ce830e2c86df1c1b6856cf","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(d):\n    try:\n        points,intervals=d\n        out=[]\n        for ident,key,time in points:\n            candidates=sorted(intervals,key=lambda r:(r[2],r[0]))\n            for other,k,start,end in candidates:\n                if key is None or key!=k: continue\n                if start<=time and time<end:\n                    out.append([ident,other])\n        return out\n    except (IndexError, KeyError, ValueError, StopIteration) as exc:\n        return {\"representation_error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nif N == 1:\n    check('end expired', solve([[[10, 'a', 3]], [[20, 'a', 1, 3]]]), [])\n    check('start active', solve([[[10, 'a', 1]], [[20, 'a', 1, 3]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 1]], [[20, 'a', 2, 4]]]), [])\n    check('overlap order', solve([[[10, 'a', 3]], [[20, 'a', 2, 5], [21, 'a', 1, 4]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 2]], [[20, 'b', 1, 4], [21, None, 1, 4]]]), [])\n    check('empty interval', solve([[[10, 'a', 1]], [[20, 'a', 1, 1]]]), [])\n    check('null probe', solve([[[10, None, 2]], [[20, None, 1, 4]]]), [])\nelif N == 2:\n    check('end expired', solve([[[10, 'a', 4]], [[20, 'a', 2, 4]]]), [])\n    check('start active', solve([[[10, 'a', 2]], [[20, 'a', 2, 4]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 2]], [[20, 'a', 3, 5]]]), [])\n    check('overlap order', solve([[[10, 'a', 4]], [[20, 'a', 3, 6], [21, 'a', 2, 5]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 3]], [[20, 'b', 2, 5], [21, None, 2, 5]]]), [])\n    check('empty interval', solve([[[10, 'a', 2]], [[20, 'a', 2, 2]]]), [])\n    check('null probe', solve([[[10, None, 3]], [[20, None, 2, 5]]]), [])\nelif N == 3:\n    check('end expired', solve([[[10, 'a', 5]], [[20, 'a', 3, 5]]]), [])\n    check('start active', solve([[[10, 'a', 3]], [[20, 'a', 3, 5]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 3]], [[20, 'a', 4, 6]]]), [])\n    check('overlap order', solve([[[10, 'a', 5]], [[20, 'a', 4, 7], [21, 'a', 3, 6]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 4]], [[20, 'b', 3, 6], [21, None, 3, 6]]]), [])\n    check('empty interval', solve([[[10, 'a', 3]], [[20, 'a', 3, 3]]]), [])\n    check('null probe', solve([[[10, None, 4]], [[20, None, 3, 6]]]), [])\nelif N == 4:\n    check('end expired', solve([[[10, 'a', 6]], [[20, 'a', 4, 6]]]), [])\n    check('start active', solve([[[10, 'a', 4]], [[20, 'a', 4, 6]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 4]], [[20, 'a', 5, 7]]]), [])\n    check('overlap order', solve([[[10, 'a', 6]], [[20, 'a', 5, 8], [21, 'a', 4, 7]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 5]], [[20, 'b', 4, 7], [21, None, 4, 7]]]), [])\n    check('empty interval', solve([[[10, 'a', 4]], [[20, 'a', 4, 4]]]), [])\n    check('null probe', solve([[[10, None, 5]], [[20, None, 4, 7]]]), [])\nelif N == 5:\n    check('end expired', solve([[[10, 'a', 7]], [[20, 'a', 5, 7]]]), [])\n    check('start active', solve([[[10, 'a', 5]], [[20, 'a', 5, 7]]]), [[10, 20]])\n    check('future inactive', solve([[[10, 'a', 5]], [[20, 'a', 6, 8]]]), [])\n    check('overlap order', solve([[[10, 'a', 7]], [[20, 'a', 6, 9], [21, 'a', 5, 8]]]), [[10, 21], [10, 20]])\n    check('other keys', solve([[[10, 'a', 6]], [[20, 'b', 5, 8], [21, None, 5, 8]]]), [])\n    check('empty interval', solve([[[10, 'a', 5]], [[20, 'a', 5, 5]]]), [])\n    check('null probe', solve([[[10, None, 6]], [[20, None, 5, 8]]]), [])\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 stipulated semantics over valid small inputs; no performance, concurrency, or production-engine conformance claim. 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-data-systems-interval-join-sweep-overlap-bag","generated_at":"2026-09-29T14:44:26.154090+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A bounded deterministic data engine model makes representation and changelog faults reproducible.","repair":"Preserve the stated physical representation and operation order: Join probe points [id,key,time] to interval rows [id,key,start,end] under start<=time<end and ordinary non-null key equality. Emit probe-major [probe-id,interval-id] pairs, with matching intervals ordered by (start,id). Empty intervals never match; overlapping intervals all produce rows.","root_cause":"interval-join-sweep: Interval join emits only the first active matching interval.","sha256":"b81872937b0e2ebe22dd66264902be594fee683bd4a1d52e91a57882eaa72b62","title":"Interval join emits only the first active matching interval · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":55.884,"exit_code":1,"observations":[{"actual":[],"check":"end expired","expected":[],"passed":true},{"actual":[[10,20]],"check":"start active","expected":[[10,20]],"passed":true},{"actual":[],"check":"future inactive","expected":[],"passed":true},{"actual":[[10,21]],"check":"overlap order","expected":[[10,21],[10,20]],"passed":false},{"actual":[],"check":"other keys","expected":[],"passed":true},{"actual":[],"check":"empty interval","expected":[],"passed":true},{"actual":[],"check":"null probe","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"end expired\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"start active\", \"actual\": [[10, 20]], \"expected\": [[10, 20]], \"passed\": true}, {\"check\": \"future inactive\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"overlap order\", \"actual\": [[10, 21]], \"expected\": [[10, 21], [10, 20]], \"passed\": false}, {\"check\": \"other keys\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty interval\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"null probe\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":42.855,"exit_code":1,"observations":[{"actual":[],"check":"end expired","expected":[],"passed":true},{"actual":[[10,20]],"check":"start active","expected":[[10,20]],"passed":true},{"actual":[],"check":"future inactive","expected":[],"passed":true},{"actual":[[10,21]],"check":"overlap order","expected":[[10,21],[10,20]],"passed":false},{"actual":[],"check":"other keys","expected":[],"passed":true},{"actual":[],"check":"empty interval","expected":[],"passed":true},{"actual":[],"check":"null probe","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"end expired\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"start active\", \"actual\": [[10, 20]], \"expected\": [[10, 20]], \"passed\": true}, {\"check\": \"future inactive\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"overlap order\", \"actual\": [[10, 21]], \"expected\": [[10, 21], [10, 20]], \"passed\": false}, {\"check\": \"other keys\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty interval\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"null probe\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":45.386,"exit_code":0,"observations":[{"actual":[],"check":"end expired","expected":[],"passed":true},{"actual":[[10,20]],"check":"start active","expected":[[10,20]],"passed":true},{"actual":[],"check":"future inactive","expected":[],"passed":true},{"actual":[[10,21],[10,20]],"check":"overlap order","expected":[[10,21],[10,20]],"passed":true},{"actual":[],"check":"other keys","expected":[],"passed":true},{"actual":[],"check":"empty interval","expected":[],"passed":true},{"actual":[],"check":"null probe","expected":[],"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"end expired\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"start active\", \"actual\": [[10, 20]], \"expected\": [[10, 20]], \"passed\": true}, {\"check\": \"future inactive\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"overlap order\", \"actual\": [[10, 21], [10, 20]], \"expected\": [[10, 21], [10, 20]], \"passed\": true}, {\"check\": \"other keys\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty interval\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"null probe\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}