{"abstract":"The first pane consumes space reserved for the second minimum.","category":"Viewport layout","checks":8,"contract":"Subtract divider from total; honor both minimums when feasible; otherwise share available width in proportion to minima; panes sum to available space.","contract_signature":"total, divider, requested, minimum_first, minimum_second","evaluation_group":"xi-split-pane","failed_approach":"Reserving the first minimum instead fails asymmetric pane constraints.","family":"xi-split-pane-second-minimum","id":"FA-8801","implementations":{"attempt":{"sha256":"ac265a5dc9cde5739547746d769d0e784f7cfcbfa964a0dbdda5657fcff64564","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(total, divider, requested, minimum_first, minimum_second):\n    available = max(0, total - divider)\n    if available < minimum_first + minimum_second:\n        first = available * minimum_first / (minimum_first + minimum_second) if minimum_first + minimum_second else 0\n    else: first = max(minimum_first, min(requested, available-minimum_first))\n    return (first, available-first)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('normal', solve(110, 10, 40, 20, 30), (40, 60))\ncheck('narrow', solve(40, 10, 25, 20, 40), (10, 20))\ncheck('first min', solve(110, 10, 5, 20, 30), (20, 80))\ncheck('second min', solve(110, 10, 95, 20, 30), (70, 30))\ncheck('large request', solve(210, 10, 100, 20, 40), (100, 100))\ncheck('zero', solve(0, 10, 5, 0, 0), (0, 0))\ncheck('parameterized panel extent', solve(11*N,N,4*N,2*N,3*N), (4*N,6*N))\nfor repetition in range(N):\n    check('repeat zero', solve(0, 10, 5, 0, 0), (0, 0))\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":"6fb822e61538054d66f402f95e63872b58b8be22ac46862a2b08dad851d62954","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(total, divider, requested, minimum_first, minimum_second):\n    available = max(0, total - divider)\n    if available < minimum_first + minimum_second:\n        first = available * minimum_first / (minimum_first + minimum_second) if minimum_first + minimum_second else 0\n    else: first = max(minimum_first, min(requested, available))\n    return (first, available-first)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('normal', solve(110, 10, 40, 20, 30), (40, 60))\ncheck('narrow', solve(40, 10, 25, 20, 40), (10, 20))\ncheck('first min', solve(110, 10, 5, 20, 30), (20, 80))\ncheck('second min', solve(110, 10, 95, 20, 30), (70, 30))\ncheck('large request', solve(210, 10, 100, 20, 40), (100, 100))\ncheck('zero', solve(0, 10, 5, 0, 0), (0, 0))\ncheck('parameterized panel extent', solve(11*N,N,4*N,2*N,3*N), (4*N,6*N))\nfor repetition in range(N):\n    check('repeat zero', solve(0, 10, 5, 0, 0), (0, 0))\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":"xi-split-pane-second-minimum","generated_at":"2026-09-29T14:38:24.418015+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A deterministic model of split-pane divider allocation; this isolates one interface invariant without requiring a browser.","root_cause":"The second minimum operation uses `available` where the contract requires `available-minimum_second`.","sha256":"ad1e2a0306e70ba6c57b1bb4e683b3d84c76e6bd3d6c95c99e3666fb83e3c254","title":"Split-pane divider allocation: The first pane consumes space reserved for the second minimum · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verified":true,"visibility":"public","verification":{"attempt":{"elapsed_ms":38.558,"exit_code":1,"observations":[{"actual":[40,60],"check":"normal","expected":[40,60],"passed":true},{"actual":[10.0,20.0],"check":"narrow","expected":[10,20],"passed":true},{"actual":[20,80],"check":"first min","expected":[20,80],"passed":true},{"actual":[80,20],"check":"second min","expected":[70,30],"passed":false},{"actual":[100,100],"check":"large request","expected":[100,100],"passed":true},{"actual":[0,0],"check":"zero","expected":[0,0],"passed":true},{"actual":[4,6],"check":"parameterized panel extent","expected":[4,6],"passed":true},{"actual":[0,0],"check":"repeat zero","expected":[0,0],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"normal\", \"actual\": [40, 60], \"expected\": [40, 60], \"passed\": true}, {\"check\": \"narrow\", \"actual\": [10.0, 20.0], \"expected\": [10, 20], \"passed\": true}, {\"check\": \"first min\", \"actual\": [20, 80], \"expected\": [20, 80], \"passed\": true}, {\"check\": \"second min\", \"actual\": [80, 20], \"expected\": [70, 30], \"passed\": false}, {\"check\": \"large request\", \"actual\": [100, 100], \"expected\": [100, 100], \"passed\": true}, {\"check\": \"zero\", \"actual\": [0, 0], \"expected\": [0, 0], \"passed\": true}, {\"check\": \"parameterized panel extent\", \"actual\": [4, 6], \"expected\": [4, 6], \"passed\": true}, {\"check\": \"repeat zero\", \"actual\": [0, 0], \"expected\": [0, 0], \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":34.415,"exit_code":1,"observations":[{"actual":[40,60],"check":"normal","expected":[40,60],"passed":true},{"actual":[10.0,20.0],"check":"narrow","expected":[10,20],"passed":true},{"actual":[20,80],"check":"first min","expected":[20,80],"passed":true},{"actual":[95,5],"check":"second min","expected":[70,30],"passed":false},{"actual":[100,100],"check":"large request","expected":[100,100],"passed":true},{"actual":[0,0],"check":"zero","expected":[0,0],"passed":true},{"actual":[4,6],"check":"parameterized panel extent","expected":[4,6],"passed":true},{"actual":[0,0],"check":"repeat zero","expected":[0,0],"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"normal\", \"actual\": [40, 60], \"expected\": [40, 60], \"passed\": true}, {\"check\": \"narrow\", \"actual\": [10.0, 20.0], \"expected\": [10, 20], \"passed\": true}, {\"check\": \"first min\", \"actual\": [20, 80], \"expected\": [20, 80], \"passed\": true}, {\"check\": \"second min\", \"actual\": [95, 5], \"expected\": [70, 30], \"passed\": false}, {\"check\": \"large request\", \"actual\": [100, 100], \"expected\": [100, 100], \"passed\": true}, {\"check\": \"zero\", \"actual\": [0, 0], \"expected\": [0, 0], \"passed\": true}, {\"check\": \"parameterized panel extent\", \"actual\": [4, 6], \"expected\": [4, 6], \"passed\": true}, {\"check\": \"repeat zero\", \"actual\": [0, 0], \"expected\": [0, 0], \"passed\": true}], \"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."}}