{"abstract":"Terms with a 0 literal cover minterms where that variable is 1.","category":"Digital logic simulation","checks":8,"contract":"Input [nv, terms]: product terms are strings over '0','1','-' with character 0 the most significant variable. Minterm m is covered by a term when every non-'-' position matches bit (m >> (nv-1-k)) & 1. A static-1 hazard is a pair of adjacent minterms (differing in one bit), both in the on-set, that no single term covers together. Return sorted [low, high] pairs.","contract_signature":"*args","evaluation_group":"w2-digital-logic-simulation-static-hazards","failed_approach":"Comparing the character to an integer bit never matches, so no literal term covers anything.","family":"w2-digital-logic-simulation-static-hazards-literal-matching","id":"FA-89166","implementations":{"attempt":{"sha256":"aa67dd614dc60dc69face92d610cf109906ec19a8b7d99e954721fa630932c01","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(*args):\n    nv, terms = args\n    def covers(t, m):\n        for k, ch in enumerate(t):\n            bit = (m >> (nv - 1 - k)) & 1\n            if ch != '-' and ch != bit:\n                return False\n        return True\n    ones = [m for m in range(2 ** nv) if any(covers(t, m) for t in terms)]\n    out = []\n    for m in ones:\n        for k in range(nv):\n            p = m ^ (1 << k)\n            if p > m and p in ones and not any(covers(t, m) and covers(t, p) for t in terms):\n                out.append([m, p])\n    return sorted(out)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[('cover 0', [3, ['1-0', '-11', '11-']], []), ('cover 1', [2, ['1-', '-1']], []), ('cover 2', [4, ['1--0', '-1-1', '0-1-']], [[2, 10], [6, 14], [12, 13], [14, 15]]), ('cover 3', [3, ['0-0', '1-1']], []), ('cover 4', [4, ['11--', '--11']], []), ('cover 5', [3, ['00-', '-01', '1-1']], []), ('cover 6', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])], [('cover 0', [2, ['1-', '-1']], []), ('cover 1', [4, ['1--0', '-1-1', '0-1-']], [[2, 10], [6, 14], [12, 13], [14, 15]]), ('cover 2', [3, ['0-0', '1-1']], []), ('cover 3', [4, ['11--', '--11']], []), ('cover 4', [3, ['00-', '-01', '1-1']], []), ('cover 5', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('cover 6', [3, ['1--', '-1-']], []), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])], [('cover 0', [4, ['1--0', '-1-1', '0-1-']], [[2, 10], [6, 14], [12, 13], [14, 15]]), ('cover 1', [3, ['0-0', '1-1']], []), ('cover 2', [4, ['11--', '--11']], []), ('cover 3', [3, ['00-', '-01', '1-1']], []), ('cover 4', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('cover 5', [3, ['1--', '-1-']], []), ('cover 6', [4, ['1-00', '0-11', '-1-1', '10--']], [[3, 11], [9, 13], [11, 15], [12, 13]]), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])], [('cover 0', [3, ['0-0', '1-1']], []), ('cover 1', [4, ['11--', '--11']], []), ('cover 2', [3, ['00-', '-01', '1-1']], []), ('cover 3', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('cover 4', [3, ['1--', '-1-']], []), ('cover 5', [4, ['1-00', '0-11', '-1-1', '10--']], [[3, 11], [9, 13], [11, 15], [12, 13]]), ('cover 6', [3, ['10-', '-11']], [[5, 7]]), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])], [('cover 0', [4, ['11--', '--11']], []), ('cover 1', [3, ['00-', '-01', '1-1']], []), ('cover 2', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('cover 3', [3, ['1--', '-1-']], []), ('cover 4', [4, ['1-00', '0-11', '-1-1', '10--']], [[3, 11], [9, 13], [11, 15], [12, 13]]), ('cover 5', [3, ['10-', '-11']], [[5, 7]]), ('cover 6', [3, ['1-0', '-11', '11-']], []), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])]]\nfor label, args, expected in fixtures[N-1]:\n    check(label, solve(*args), expected)\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":"301c006d857c9f2eec256c2160c13327d86098e8b2de0b392f7c8f66225d752f","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(*args):\n    nv, terms = args\n    def covers(t, m):\n        for k, ch in enumerate(t):\n            bit = (m >> (nv - 1 - k)) & 1\n            if ch == '1' and bit != 1:\n                return False\n        return True\n    ones = [m for m in range(2 ** nv) if any(covers(t, m) for t in terms)]\n    out = []\n    for m in ones:\n        for k in range(nv):\n            p = m ^ (1 << k)\n            if p > m and p in ones and not any(covers(t, m) and covers(t, p) for t in terms):\n                out.append([m, p])\n    return sorted(out)\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nfixtures = [[('cover 0', [3, ['1-0', '-11', '11-']], []), ('cover 1', [2, ['1-', '-1']], []), ('cover 2', [4, ['1--0', '-1-1', '0-1-']], [[2, 10], [6, 14], [12, 13], [14, 15]]), ('cover 3', [3, ['0-0', '1-1']], []), ('cover 4', [4, ['11--', '--11']], []), ('cover 5', [3, ['00-', '-01', '1-1']], []), ('cover 6', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])], [('cover 0', [2, ['1-', '-1']], []), ('cover 1', [4, ['1--0', '-1-1', '0-1-']], [[2, 10], [6, 14], [12, 13], [14, 15]]), ('cover 2', [3, ['0-0', '1-1']], []), ('cover 3', [4, ['11--', '--11']], []), ('cover 4', [3, ['00-', '-01', '1-1']], []), ('cover 5', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('cover 6', [3, ['1--', '-1-']], []), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])], [('cover 0', [4, ['1--0', '-1-1', '0-1-']], [[2, 10], [6, 14], [12, 13], [14, 15]]), ('cover 1', [3, ['0-0', '1-1']], []), ('cover 2', [4, ['11--', '--11']], []), ('cover 3', [3, ['00-', '-01', '1-1']], []), ('cover 4', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('cover 5', [3, ['1--', '-1-']], []), ('cover 6', [4, ['1-00', '0-11', '-1-1', '10--']], [[3, 11], [9, 13], [11, 15], [12, 13]]), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])], [('cover 0', [3, ['0-0', '1-1']], []), ('cover 1', [4, ['11--', '--11']], []), ('cover 2', [3, ['00-', '-01', '1-1']], []), ('cover 3', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('cover 4', [3, ['1--', '-1-']], []), ('cover 5', [4, ['1-00', '0-11', '-1-1', '10--']], [[3, 11], [9, 13], [11, 15], [12, 13]]), ('cover 6', [3, ['10-', '-11']], [[5, 7]]), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])], [('cover 0', [4, ['11--', '--11']], []), ('cover 1', [3, ['00-', '-01', '1-1']], []), ('cover 2', [4, ['0--1', '-10-', '1-1-']], [[3, 11], [7, 15], [12, 14], [13, 15]]), ('cover 3', [3, ['1--', '-1-']], []), ('cover 4', [4, ['1-00', '0-11', '-1-1', '10--']], [[3, 11], [9, 13], [11, 15], [12, 13]]), ('cover 5', [3, ['10-', '-11']], [[5, 7]]), ('cover 6', [3, ['1-0', '-11', '11-']], []), ('msb only term', [3, ['1--', '0-1']], [[1, 5], [3, 7]])]]\nfor label, args, expected in fixtures[N-1]:\n    check(label, solve(*args), expected)\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":"A deterministic bounded teaching model of one simulator rule set; the contract is stipulated and is not a claim of conformance to any HDL standard or commercial simulator. 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":"w2-digital-logic-simulation-static-hazards-literal-matching","generated_at":"2026-09-29T14:51:14.901885+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"Glitch analysis in logic simulators flags transitions that may pulse when two product terms hand off.","root_cause":"Only positive literals are checked when testing coverage.","sha256":"781da12d3bcefa4dc54f5e770ce3cab46ae58302b3e574d3d9bf4199f295f712","title":"Complemented literals ignored in term coverage · 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":39.898,"exit_code":1,"observations":[{"actual":[],"check":"cover 0","expected":[],"passed":true},{"actual":[],"check":"cover 1","expected":[],"passed":true},{"actual":[],"check":"cover 2","expected":[[2,10],[6,14],[12,13],[14,15]],"passed":false},{"actual":[],"check":"cover 3","expected":[],"passed":true},{"actual":[],"check":"cover 4","expected":[],"passed":true},{"actual":[],"check":"cover 5","expected":[],"passed":true},{"actual":[],"check":"cover 6","expected":[[3,11],[7,15],[12,14],[13,15]],"passed":false},{"actual":[],"check":"msb only term","expected":[[1,5],[3,7]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"cover 0\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 1\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 2\", \"actual\": [], \"expected\": [[2, 10], [6, 14], [12, 13], [14, 15]], \"passed\": false}, {\"check\": \"cover 3\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 4\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 5\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 6\", \"actual\": [], \"expected\": [[3, 11], [7, 15], [12, 14], [13, 15]], \"passed\": false}, {\"check\": \"msb only term\", \"actual\": [], \"expected\": [[1, 5], [3, 7]], \"passed\": false}], \"passed\": false}\n"},"broken":{"elapsed_ms":38.894,"exit_code":1,"observations":[{"actual":[],"check":"cover 0","expected":[],"passed":true},{"actual":[],"check":"cover 1","expected":[],"passed":true},{"actual":[],"check":"cover 2","expected":[[2,10],[6,14],[12,13],[14,15]],"passed":false},{"actual":[],"check":"cover 3","expected":[],"passed":true},{"actual":[],"check":"cover 4","expected":[],"passed":true},{"actual":[],"check":"cover 5","expected":[],"passed":true},{"actual":[],"check":"cover 6","expected":[[3,11],[7,15],[12,14],[13,15]],"passed":false},{"actual":[],"check":"msb only term","expected":[[1,5],[3,7]],"passed":false}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"cover 0\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 1\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 2\", \"actual\": [], \"expected\": [[2, 10], [6, 14], [12, 13], [14, 15]], \"passed\": false}, {\"check\": \"cover 3\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 4\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 5\", \"actual\": [], \"expected\": [], \"passed\": true}, {\"check\": \"cover 6\", \"actual\": [], \"expected\": [[3, 11], [7, 15], [12, 14], [13, 15]], \"passed\": false}, {\"check\": \"msb only term\", \"actual\": [], \"expected\": [[1, 5], [3, 7]], \"passed\": false}], \"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."}}