{"abstract":"An interval join drops a left interval entirely enclosed by a right interval, then an endpoint-based repair creates false matches.","category":"Storage and queries","checks":8,"contract":"Each input row is [string_id,integer_start,integer_end] with start <= end. Treat intervals as half-open. Return [left_id,right_id] for every pair with a nonempty intersection, in left input order then right input order.","evaluation_group":"model-986af8b4b57b983b","failed_approach":"Checking inclusive end-to-start comparisons handles containment but joins touching boundaries and empty intervals.","family":"store-interval-overlap-join","id":"FA-161","implementations":{"attempt":{"sha256":"5790b3306d8200d97a67a8dc9aeea44c06f1c0b9bad6d3292ee2294b4a5defda","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(left, right):\n    return [[a[0], b[0]] for a in left for b in right if a[1] <= b[2] and b[1] <= a[2]]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('left interval is fully contained', solve([['a', N, 2*N]], [['b', 0, 3*N]]), [['a', 'b']])\ncheck('right interval is fully contained', solve([['a', 0, 3*N]], [['b', N, 2*N]]), [['a', 'b']])\ncheck('touching boundary is not an overlap', solve([['a', 0, N]], [['b', N, 2*N]]), [])\ncheck('empty interval does not join an enclosing interval', solve([['a', N, N]], [['b', 0, 2*N]]), [])\ncheck('right empty interval is not a point event', solve([['a', 0, 2*N]], [['b', N, N]]), [])\ncheck('partial intersection crosses starting order', solve([['a', N, 3*N]], [['b', 0, 2*N]]), [['a', 'b']])\ncheck('ordered many-to-many pairs', solve([['a', 0, 2*N], ['c', 2*N, 4*N]], [['b', N, 3*N], ['d', 4*N, 5*N]]), [['a', 'b'], ['c', 'b']])\ncheck('empty relation', solve([], [['b', 0, 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":"565b1e539242c4889cca505dec10afa14a883053004608cdae0536ad17131f7f","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(left, right):\n    return [[a[0], b[0]] for a in left for b in right if a[1] <= b[1] < a[2]]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('left interval is fully contained', solve([['a', N, 2*N]], [['b', 0, 3*N]]), [['a', 'b']])\ncheck('right interval is fully contained', solve([['a', 0, 3*N]], [['b', N, 2*N]]), [['a', 'b']])\ncheck('touching boundary is not an overlap', solve([['a', 0, N]], [['b', N, 2*N]]), [])\ncheck('empty interval does not join an enclosing interval', solve([['a', N, N]], [['b', 0, 2*N]]), [])\ncheck('right empty interval is not a point event', solve([['a', 0, 2*N]], [['b', N, N]]), [])\ncheck('partial intersection crosses starting order', solve([['a', N, 3*N]], [['b', 0, 2*N]]), [['a', 'b']])\ncheck('ordered many-to-many pairs', solve([['a', 0, 2*N], ['c', 2*N, 4*N]], [['b', N, 3*N], ['d', 4*N, 5*N]]), [['a', 'b'], ['c', 'b']])\ncheck('empty relation', solve([], [['b', 0, 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":"3e5b36b9a983cb4f3e95aef6a98f91176f690bd61f95576264f138fa5994a0a6","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(left, right):\n    return [[a[0], b[0]] for a in left for b in right if a[1] < a[2] and b[1] < b[2] and max(a[1], b[1]) < min(a[2], b[2])]\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('left interval is fully contained', solve([['a', N, 2*N]], [['b', 0, 3*N]]), [['a', 'b']])\ncheck('right interval is fully contained', solve([['a', 0, 3*N]], [['b', N, 2*N]]), [['a', 'b']])\ncheck('touching boundary is not an overlap', solve([['a', 0, N]], [['b', N, 2*N]]), [])\ncheck('empty interval does not join an enclosing interval', solve([['a', N, N]], [['b', 0, 2*N]]), [])\ncheck('right empty interval is not a point event', solve([['a', 0, 2*N]], [['b', N, N]]), [])\ncheck('partial intersection crosses starting order', solve([['a', N, 3*N]], [['b', 0, 2*N]]), [['a', 'b']])\ncheck('ordered many-to-many pairs', solve([['a', 0, 2*N], ['c', 2*N, 4*N]], [['b', N, 3*N], ['d', 4*N, 5*N]]), [['a', 'b'], ['c', 'b']])\ncheck('empty relation', solve([], [['b', 0, 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":" 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":"store-interval-overlap-join","generated_at":"2026-09-29T14:36:50.996627+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Isolates a temporal join predicate, including containment, symmetry and degenerate intervals. It is distinct from assigning point samples to windows and does not implement a temporal-index query planner.","repair":"Require both intervals to be nonempty and compare max(start) < min(end), preserving relation multiplicity and order.","root_cause":"Testing only one interval's start is insufficient for containment; inclusive comparisons also misinterpret half-open intervals.","sha256":"b0267043968b8157e3259a862caf57e916d50f6d6c3f228d40f7dc7be26ef45d","title":"An overlap join misses containment or admits adjacent nonoverlapping intervals · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":30.865,"exit_code":1,"observations":[{"actual":[["a","b"]],"check":"left interval is fully contained","expected":[["a","b"]],"passed":true},{"actual":[["a","b"]],"check":"right interval is fully contained","expected":[["a","b"]],"passed":true},{"actual":[["a","b"]],"check":"touching boundary is not an overlap","expected":[],"passed":false},{"actual":[["a","b"]],"check":"empty interval does not join an enclosing interval","expected":[],"passed":false},{"actual":[["a","b"]],"check":"right empty interval is not a point event","expected":[],"passed":false},{"actual":[["a","b"]],"check":"partial intersection crosses starting order","expected":[["a","b"]],"passed":true},{"actual":[["a","b"],["c","b"],["c","d"]],"check":"ordered many-to-many pairs","expected":[["a","b"],["c","b"]],"passed":false},{"actual":[],"check":"empty relation","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"left interval is fully contained\", \"actual\": [[\"a\", \"b\"]], \"expected\": [[\"a\", \"b\"]], \"passed\": true}, {\"check\": \"right interval is fully contained\", \"actual\": [[\"a\", \"b\"]], \"expected\": [[\"a\", \"b\"]], \"passed\": true}, {\"check\": \"touching boundary is not an overlap\", \"actual\": [[\"a\", \"b\"]], \"expected\": [], \"passed\": false}, {\"check\": \"empty interval does not join an enclosing interval\", \"actual\": [[\"a\", \"b\"]], \"expected\": [], \"passed\": false}, {\"check\": \"right empty interval is not a point event\", \"actual\": [[\"a\", \"b\"]], \"expected\": [], \"passed\": false}, {\"check\": \"partial intersection crosses starting order\", \"actual\": [[\"a\", \"b\"]], \"expected\": [[\"a\", \"b\"]], \"passed\": true}, {\"check\": \"ordered many-to-many pairs\", \"actual\": [[\"a\", \"b\"], [\"c\", \"b\"], [\"c\", \"d\"]], \"expected\": [[\"a\", \"b\"], [\"c\", \"b\"]], \"passed\": false}, {\"check\": \"empty relation\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":33.289,"exit_code":1,"observations":[{"actual":[],"check":"left interval is fully contained","expected":[["a","b"]],"passed":false},{"actual":[["a","b"]],"check":"right interval is fully contained","expected":[["a","b"]],"passed":true},{"actual":[],"check":"touching boundary is not an overlap","expected":[],"passed":true},{"actual":[],"check":"empty interval does not join an enclosing interval","expected":[],"passed":true},{"actual":[["a","b"]],"check":"right empty interval is not a point event","expected":[],"passed":false},{"actual":[],"check":"partial intersection crosses starting order","expected":[["a","b"]],"passed":false},{"actual":[["a","b"]],"check":"ordered many-to-many pairs","expected":[["a","b"],["c","b"]],"passed":false},{"actual":[],"check":"empty relation","expected":[],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"left interval is fully contained\", \"actual\": [], \"expected\": [[\"a\", \"b\"]], \"passed\": false}, {\"check\": \"right interval is fully contained\", \"actual\": [[\"a\", \"b\"]], \"expected\": [[\"a\", \"b\"]], \"passed\": true}, {\"check\": \"touching boundary is not an overlap\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty interval does not join an enclosing interval\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"right empty interval is not a point event\", \"actual\": [[\"a\", \"b\"]], \"expected\": [], \"passed\": false}, {\"check\": \"partial intersection crosses starting order\", \"actual\": [], \"expected\": [[\"a\", \"b\"]], \"passed\": false}, {\"check\": \"ordered many-to-many pairs\", \"actual\": [[\"a\", \"b\"]], \"expected\": [[\"a\", \"b\"], [\"c\", \"b\"]], \"passed\": false}, {\"check\": \"empty relation\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":30.946,"exit_code":0,"observations":[{"actual":[["a","b"]],"check":"left interval is fully contained","expected":[["a","b"]],"passed":true},{"actual":[["a","b"]],"check":"right interval is fully contained","expected":[["a","b"]],"passed":true},{"actual":[],"check":"touching boundary is not an overlap","expected":[],"passed":true},{"actual":[],"check":"empty interval does not join an enclosing interval","expected":[],"passed":true},{"actual":[],"check":"right empty interval is not a point event","expected":[],"passed":true},{"actual":[["a","b"]],"check":"partial intersection crosses starting order","expected":[["a","b"]],"passed":true},{"actual":[["a","b"],["c","b"]],"check":"ordered many-to-many pairs","expected":[["a","b"],["c","b"]],"passed":true},{"actual":[],"check":"empty relation","expected":[],"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"left interval is fully contained\", \"actual\": [[\"a\", \"b\"]], \"expected\": [[\"a\", \"b\"]], \"passed\": true}, {\"check\": \"right interval is fully contained\", \"actual\": [[\"a\", \"b\"]], \"expected\": [[\"a\", \"b\"]], \"passed\": true}, {\"check\": \"touching boundary is not an overlap\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"empty interval does not join an enclosing interval\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"right empty interval is not a point event\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"partial intersection crosses starting order\", \"actual\": [[\"a\", \"b\"]], \"expected\": [[\"a\", \"b\"]], \"passed\": true}, {\"check\": \"ordered many-to-many pairs\", \"actual\": [[\"a\", \"b\"], [\"c\", \"b\"]], \"expected\": [[\"a\", \"b\"], [\"c\", \"b\"]], \"passed\": true}, {\"check\": \"empty relation\", \"actual\": [], \"expected\": [], \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}