FA-9511 / Dependency resolution / Open access
Feature activation closure: Only one implication pass runs · case 01
Only one implication pass runs.
ROOT CAUSE
The implementation substitutes range(1) for range(len(implications) + 1), so only one implication pass runs.
VERIFIED REPAIR
Iterate enough to reach transitive activation regardless of declaration order.
Unsuccessful approach: The attempted repair substitutes range(0). Fixture 4 still yields ['a'] instead of ['a', 'b'].
Case contract
Activate named features and their implications, preserve unknown requested leaves, ignore disabled implication edges, deduplicate cycles, and return sorted activated features.
Why this case matters
An offline model of feature activation closure, suitable for testing build and release tooling without external services.
1 / The failure
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(requested, implications):
active = set(requested)
for _ in range(1):
for feature, edges in implications.items():
if feature in active:
active.update(name for name, enabled in edges if enabled)
return sorted(active)
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve([], {}), [])
check('fixture 2', solve(['x'], {}), ['x'])
check('fixture 3', solve(['other'], {'a': [('b', True)]}), ['other'])
check('fixture 4', solve(['a'], {'a': [('b', True), ('c', False)]}), ['a', 'b'])
check('fixture 5', solve(['a'], {'b': [('c', True)], 'a': [('b', True)]}), ['a', 'b', 'c'])
check('fixture 6', solve(['a'], {'a': [('b', True)], 'b': [('a', True)]}), ['a', 'b'])
check('fixture 7', solve(['z', 'a', 'z'], {}), ['a', 'z'])
check('fixture 8', solve(['a'], {'c': [('d', True)], 'b': [('c', True)], 'a': [('b', True)]}), ['a', 'b', 'c', 'd'])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| fixture 1 | [] | [] | Passed |
| fixture 2 | ['x'] | ['x'] | Passed |
| fixture 3 | ['other'] | ['other'] | Passed |
| fixture 4 | ['a', 'b'] | ['a', 'b'] | Passed |
| fixture 5 | ['a', 'b'] | ['a', 'b', 'c'] | Failed |
| fixture 6 | ['a', 'b'] | ['a', 'b'] | Passed |
| fixture 7 | ['a', 'z'] | ['a', 'z'] | Passed |
| fixture 8 | ['a', 'b'] | ['a', 'b', 'c', 'd'] | Failed |
SHA-256 / 46a6d7a6d71a272d74ce7a3c6a161349f59723ecf1bc776105218568ede946d0
2 / The unsuccessful fix
Exit 1"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(requested, implications):
active = set(requested)
for _ in range(0):
for feature, edges in implications.items():
if feature in active:
active.update(name for name, enabled in edges if enabled)
return sorted(active)
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve([], {}), [])
check('fixture 2', solve(['x'], {}), ['x'])
check('fixture 3', solve(['other'], {'a': [('b', True)]}), ['other'])
check('fixture 4', solve(['a'], {'a': [('b', True), ('c', False)]}), ['a', 'b'])
check('fixture 5', solve(['a'], {'b': [('c', True)], 'a': [('b', True)]}), ['a', 'b', 'c'])
check('fixture 6', solve(['a'], {'a': [('b', True)], 'b': [('a', True)]}), ['a', 'b'])
check('fixture 7', solve(['z', 'a', 'z'], {}), ['a', 'z'])
check('fixture 8', solve(['a'], {'c': [('d', True)], 'b': [('c', True)], 'a': [('b', True)]}), ['a', 'b', 'c', 'd'])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| fixture 1 | [] | [] | Passed |
| fixture 2 | ['x'] | ['x'] | Passed |
| fixture 3 | ['other'] | ['other'] | Passed |
| fixture 4 | ['a'] | ['a', 'b'] | Failed |
| fixture 5 | ['a'] | ['a', 'b', 'c'] | Failed |
| fixture 6 | ['a'] | ['a', 'b'] | Failed |
| fixture 7 | ['a', 'z'] | ['a', 'z'] | Passed |
| fixture 8 | ['a'] | ['a', 'b', 'c', 'd'] | Failed |
SHA-256 / de42e215f7d583fc67872e71b724b7c07cde0d47e730dc96d128c8d0ab63c9c5
3 / The verified repair
Exit 0"""Failure Map reference implementation. Python standard library only."""
import json
N = 1
observations = []
def solve(requested, implications):
active = set(requested)
for _ in range(len(implications) + 1):
for feature, edges in implications.items():
if feature in active:
active.update(name for name, enabled in edges if enabled)
return sorted(active)
def check(label, actual, expected):
observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
check('fixture 1', solve([], {}), [])
check('fixture 2', solve(['x'], {}), ['x'])
check('fixture 3', solve(['other'], {'a': [('b', True)]}), ['other'])
check('fixture 4', solve(['a'], {'a': [('b', True), ('c', False)]}), ['a', 'b'])
check('fixture 5', solve(['a'], {'b': [('c', True)], 'a': [('b', True)]}), ['a', 'b', 'c'])
check('fixture 6', solve(['a'], {'a': [('b', True)], 'b': [('a', True)]}), ['a', 'b'])
check('fixture 7', solve(['z', 'a', 'z'], {}), ['a', 'z'])
check('fixture 8', solve(['a'], {'c': [('d', True)], 'b': [('c', True)], 'a': [('b', True)]}), ['a', 'b', 'c', 'd'])
print(json.dumps({"observations": observations, "passed": all(x["passed"] for x in observations)}, ensure_ascii=False))
raise SystemExit(0 if all(x["passed"] for x in observations) else 1)
| Boundary fixture | Actual | Expected | Outcome |
|---|---|---|---|
| fixture 1 | [] | [] | Passed |
| fixture 2 | ['x'] | ['x'] | Passed |
| fixture 3 | ['other'] | ['other'] | Passed |
| fixture 4 | ['a', 'b'] | ['a', 'b'] | Passed |
| fixture 5 | ['a', 'b', 'c'] | ['a', 'b', 'c'] | Passed |
| fixture 6 | ['a', 'b'] | ['a', 'b'] | Passed |
| fixture 7 | ['a', 'z'] | ['a', 'z'] | Passed |
| fixture 8 | ['a', 'b', 'c', 'd'] | ['a', 'b', 'c', 'd'] | Passed |
SHA-256 / 61507dca56ea28864086fcc573f8f548cbb9c5591c881c15acb705cc1fb27398
Verification & scope
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.
Observations recorded using Python 3.12.14 at 2026-09-29T14:38:30.534590+00:00.
Case digest / e84686675f78ae24e434246e6a22704a72096d22a3c9a02422743999b1ec6838