{"abstract":"A closing parenthesis appears before its matching opener.","category":"Parsing","checks":4,"contract":"Validate strings of parentheses with balanced counts and no negative prefix depth.","evaluation_group":"model-1f7ba8dd0b43e94c","failed_approach":"The attempted repair handles the primary example but still violates a separate boundary of the same contract.","family":"xp-paren-prefix-balance","id":"FA-3751","implementations":{"attempt":{"sha256":"1e2adf23955d76a34219d51eb840b87adef735c6e4fc9ebe192462a2bf011690","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport re, unicodedata, json, csv, io, html, base64, binascii, codecs, struct\nfrom urllib.parse import quote, unquote, unquote_to_bytes, urlencode, parse_qsl, urlsplit, urlunsplit\nfrom email.header import decode_header, make_header\nfrom email.utils import getaddresses\nfrom xml.etree import ElementTree as ET\nimport shlex, string, textwrap\n\nN = 1\nobservations = []\ndef solve(x):\n    try:\n        return x.count('(')==x.count(')') and (not x or x[0]=='(')\n    except Exception as exc:\n        return {\"error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('boundary 1', solve(')('), False)\ncheck('boundary 2', solve('())(()'), False)\ncheck('boundary 3', solve('(())'), True)\ncheck('boundary 4', solve(''), True)\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":"ba606a73055b7fb063beea2c90e00fe3b2010cdbfaa844c70a36859c25649ec4","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport re, unicodedata, json, csv, io, html, base64, binascii, codecs, struct\nfrom urllib.parse import quote, unquote, unquote_to_bytes, urlencode, parse_qsl, urlsplit, urlunsplit\nfrom email.header import decode_header, make_header\nfrom email.utils import getaddresses\nfrom xml.etree import ElementTree as ET\nimport shlex, string, textwrap\n\nN = 1\nobservations = []\ndef solve(x):\n    try:\n        return x.count('(')==x.count(')')\n    except Exception as exc:\n        return {\"error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('boundary 1', solve(')('), False)\ncheck('boundary 2', solve('())(()'), False)\ncheck('boundary 3', solve('(())'), True)\ncheck('boundary 4', solve(''), True)\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":"87e7895c156b1f325bb6bfcf46089c5f865d5bf8fbc0d1a7ad3c586dde557176","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\nimport re, unicodedata, json, csv, io, html, base64, binascii, codecs, struct\nfrom urllib.parse import quote, unquote, unquote_to_bytes, urlencode, parse_qsl, urlsplit, urlunsplit\nfrom email.header import decode_header, make_header\nfrom email.utils import getaddresses\nfrom xml.etree import ElementTree as ET\nimport shlex, string, textwrap\n\nN = 1\nobservations = []\ndef solve(x):\n    try:\n        depth=0\n        for c in x:\n            depth+=1 if c=='(' else -1\n            if depth<0: return False\n        return depth==0\n    except Exception as exc:\n        return {\"error\": type(exc).__name__}\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\ncheck('boundary 1', solve(')('), False)\ncheck('boundary 2', solve('())(()'), False)\ncheck('boundary 3', solve('(())'), True)\ncheck('boundary 4', solve(''), True)\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":"xp-paren-prefix-balance","generated_at":"2026-09-29T14:37:30.330607+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A local executable model for consumers of structured text; oracle values are authored literals, not outputs copied from the repaired implementation.","repair":"Implement the complete stated contract, including the boundary fixtures: Validate strings of parentheses with balanced counts and no negative prefix depth.","root_cause":"The implementation applies an operation whose text or grammar semantics violate this contract: Validate strings of parentheses with balanced counts and no negative prefix depth.","sha256":"e8153711c5305a8a6c2ae5d52c747fbd9a768a8f2eac57ec46bb40f88d1a133d","title":"A closing parenthesis appears before its matching opener · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":58.614,"exit_code":1,"observations":[{"actual":false,"check":"boundary 1","expected":false,"passed":true},{"actual":true,"check":"boundary 2","expected":false,"passed":false},{"actual":true,"check":"boundary 3","expected":true,"passed":true},{"actual":true,"check":"boundary 4","expected":true,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"boundary 1\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"boundary 2\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"boundary 3\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"boundary 4\", \"actual\": true, \"expected\": true, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":54.068,"exit_code":1,"observations":[{"actual":true,"check":"boundary 1","expected":false,"passed":false},{"actual":true,"check":"boundary 2","expected":false,"passed":false},{"actual":true,"check":"boundary 3","expected":true,"passed":true},{"actual":true,"check":"boundary 4","expected":true,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"boundary 1\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"boundary 2\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"boundary 3\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"boundary 4\", \"actual\": true, \"expected\": true, \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":46.047,"exit_code":0,"observations":[{"actual":false,"check":"boundary 1","expected":false,"passed":true},{"actual":false,"check":"boundary 2","expected":false,"passed":true},{"actual":true,"check":"boundary 3","expected":true,"passed":true},{"actual":true,"check":"boundary 4","expected":true,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"boundary 1\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"boundary 2\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"boundary 3\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"boundary 4\", \"actual\": true, \"expected\": true, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}