{"abstract":"The queue redrive operation is admitted even though redrive revives a message past its absolute retention.","category":"Queues","checks":9,"contract":"Return a Boolean admission decision for redrive a previously dead-lettered message. The record r must satisfy all of: r['redrive_budget'][0] < r['redrive_budget'][1]; r['source_version'][0] == r['source_version'][1]; r['destination_schema'][0] in r['destination_schema'][1]; r['retention_remaining'][0] < r['retention_remaining'][1]; r['rate_tokens'][0] >= r['rate_tokens'][1]. Extra tracing fields are ignored; validation does not mutate the record.","evaluation_group":"xd-queue-redrive","failed_approach":"Adding the retention remaining check repairs the reported defect, but replacing the adjacent rate tokens check loses that independent invariant.","family":"xd-queue-redrive-retention_remaining","id":"FA-841","implementations":{"attempt":{"sha256":"21d5c051f6c494b406ceec1320cdc454db6159a2516519d423ba4101a37a9042","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(r):\n    return (r['redrive_budget'][0] < r['redrive_budget'][1]) and (r['source_version'][0] == r['source_version'][1]) and (r['destination_schema'][0] in r['destination_schema'][1]) and (r['retention_remaining'][0] < r['retention_remaining'][1])\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nr = {'redrive_budget': [2, 3], 'source_version': [7, 7], 'destination_schema': [2, [2, 3]], 'retention_remaining': [19, 20], 'rate_tokens': [3, 3]}\ncheck('valid operation', solve(r), True)\ncheck('Poison messages circulate past the redrive allowance', solve(dict(r, **{'redrive_budget': [3, 3]})), False)\ncheck('Redrive races an updated dead-letter record', solve(dict(r, **{'source_version': [6, 7]})), False)\ncheck('The target consumer cannot decode the original schema', solve(dict(r, **{'destination_schema': [1, [2, 3]]})), False)\ncheck('Redrive revives a message past its absolute retention', solve(dict(r, **{'retention_remaining': [20, 20]})), False)\ncheck('Redrive bypasses its recovery traffic budget', solve(dict(r, **{'rate_tokens': [2, 3]})), False)\ncheck('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)\ncheck('repeat validation is pure', solve(r), True)\ninvalid = {'redrive_budget': [3, 3], 'source_version': [6, 7], 'destination_schema': [1, [2, 3]], 'retention_remaining': [20, 20], 'rate_tokens': [2, 3]}\nkeys = list(invalid)\npair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}\ncheck('two independent violations in variant', solve(dict(r, **pair)), False)\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":"cc076d2bd61cee405ae28f5c6727906e99c12082e7bd587aa91872f6f8c4c61f","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(r):\n    return (r['redrive_budget'][0] < r['redrive_budget'][1]) and (r['source_version'][0] == r['source_version'][1]) and (r['destination_schema'][0] in r['destination_schema'][1]) and (r['rate_tokens'][0] >= r['rate_tokens'][1])\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nr = {'redrive_budget': [2, 3], 'source_version': [7, 7], 'destination_schema': [2, [2, 3]], 'retention_remaining': [19, 20], 'rate_tokens': [3, 3]}\ncheck('valid operation', solve(r), True)\ncheck('Poison messages circulate past the redrive allowance', solve(dict(r, **{'redrive_budget': [3, 3]})), False)\ncheck('Redrive races an updated dead-letter record', solve(dict(r, **{'source_version': [6, 7]})), False)\ncheck('The target consumer cannot decode the original schema', solve(dict(r, **{'destination_schema': [1, [2, 3]]})), False)\ncheck('Redrive revives a message past its absolute retention', solve(dict(r, **{'retention_remaining': [20, 20]})), False)\ncheck('Redrive bypasses its recovery traffic budget', solve(dict(r, **{'rate_tokens': [2, 3]})), False)\ncheck('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)\ncheck('repeat validation is pure', solve(r), True)\ninvalid = {'redrive_budget': [3, 3], 'source_version': [6, 7], 'destination_schema': [1, [2, 3]], 'retention_remaining': [20, 20], 'rate_tokens': [2, 3]}\nkeys = list(invalid)\npair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}\ncheck('two independent violations in variant', solve(dict(r, **pair)), False)\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":"09fa60df1708f7252fc6940f93fa9f61761b5dbc2bf134dc7399ccac9845b048","source":"\"\"\"Failure Map reference implementation. Python standard library only.\"\"\"\nimport json\n\nN = 1\nobservations = []\ndef solve(r):\n    return (r['redrive_budget'][0] < r['redrive_budget'][1]) and (r['source_version'][0] == r['source_version'][1]) and (r['destination_schema'][0] in r['destination_schema'][1]) and (r['retention_remaining'][0] < r['retention_remaining'][1]) and (r['rate_tokens'][0] >= r['rate_tokens'][1])\ndef check(label, actual, expected):\n    observations.append({\"check\": label, \"actual\": actual, \"expected\": expected, \"passed\": actual == expected})\nr = {'redrive_budget': [2, 3], 'source_version': [7, 7], 'destination_schema': [2, [2, 3]], 'retention_remaining': [19, 20], 'rate_tokens': [3, 3]}\ncheck('valid operation', solve(r), True)\ncheck('Poison messages circulate past the redrive allowance', solve(dict(r, **{'redrive_budget': [3, 3]})), False)\ncheck('Redrive races an updated dead-letter record', solve(dict(r, **{'source_version': [6, 7]})), False)\ncheck('The target consumer cannot decode the original schema', solve(dict(r, **{'destination_schema': [1, [2, 3]]})), False)\ncheck('Redrive revives a message past its absolute retention', solve(dict(r, **{'retention_remaining': [20, 20]})), False)\ncheck('Redrive bypasses its recovery traffic budget', solve(dict(r, **{'rate_tokens': [2, 3]})), False)\ncheck('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)\ncheck('repeat validation is pure', solve(r), True)\ninvalid = {'redrive_budget': [3, 3], 'source_version': [6, 7], 'destination_schema': [1, [2, 3]], 'retention_remaining': [20, 20], 'rate_tokens': [2, 3]}\nkeys = list(invalid)\npair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}\ncheck('two independent violations in variant', solve(dict(r, **pair)), False)\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":"xd-queue-redrive-retention_remaining","generated_at":"2026-09-29T14:36:56.495869+00:00","license":"CC0-1.0","python":"3.12.14","seed":1,"split":"open-access"},"relevance":"A deterministic local contract for queues. Each negative fixture violates exactly one invariant. No transport timing, persistence, cryptographic verification, or full protocol implementation is claimed.","repair":"Require r['retention_remaining'][0] < r['retention_remaining'][1] together with every other stated precondition before accepting the operation.","root_cause":"The admission path omits the retention remaining invariant while validating the other operation preconditions.","sha256":"fe081f86fce0847cb911837c99666df5940b7dd65bd3e7b3c6b92f2031073319","title":"Redrive a previously dead-lettered message: Redrive revives a message past its absolute retention · case 01","variant":1,"variant_policy":"Five numbered records share a model and may reuse boundary fixtures.","verification":{"attempt":{"elapsed_ms":30.978,"exit_code":1,"observations":[{"actual":true,"check":"valid operation","expected":true,"passed":true},{"actual":false,"check":"Poison messages circulate past the redrive allowance","expected":false,"passed":true},{"actual":false,"check":"Redrive races an updated dead-letter record","expected":false,"passed":true},{"actual":false,"check":"The target consumer cannot decode the original schema","expected":false,"passed":true},{"actual":false,"check":"Redrive revives a message past its absolute retention","expected":false,"passed":true},{"actual":true,"check":"Redrive bypasses its recovery traffic budget","expected":false,"passed":false},{"actual":true,"check":"unrelated tracing metadata","expected":true,"passed":true},{"actual":true,"check":"repeat validation is pure","expected":true,"passed":true},{"actual":false,"check":"two independent violations in variant","expected":false,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"valid operation\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"Poison messages circulate past the redrive allowance\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Redrive races an updated dead-letter record\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"The target consumer cannot decode the original schema\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Redrive revives a message past its absolute retention\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Redrive bypasses its recovery traffic budget\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"unrelated tracing metadata\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"repeat validation is pure\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"two independent violations in variant\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": false}\n"},"broken":{"elapsed_ms":32.83,"exit_code":1,"observations":[{"actual":true,"check":"valid operation","expected":true,"passed":true},{"actual":false,"check":"Poison messages circulate past the redrive allowance","expected":false,"passed":true},{"actual":false,"check":"Redrive races an updated dead-letter record","expected":false,"passed":true},{"actual":false,"check":"The target consumer cannot decode the original schema","expected":false,"passed":true},{"actual":true,"check":"Redrive revives a message past its absolute retention","expected":false,"passed":false},{"actual":false,"check":"Redrive bypasses its recovery traffic budget","expected":false,"passed":true},{"actual":true,"check":"unrelated tracing metadata","expected":true,"passed":true},{"actual":true,"check":"repeat validation is pure","expected":true,"passed":true},{"actual":false,"check":"two independent violations in variant","expected":false,"passed":true}],"passed":false,"stderr":"","stdout":"{\"observations\": [{\"check\": \"valid operation\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"Poison messages circulate past the redrive allowance\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Redrive races an updated dead-letter record\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"The target consumer cannot decode the original schema\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Redrive revives a message past its absolute retention\", \"actual\": true, \"expected\": false, \"passed\": false}, {\"check\": \"Redrive bypasses its recovery traffic budget\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"unrelated tracing metadata\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"repeat validation is pure\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"two independent violations in variant\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": false}\n"},"fixed":{"elapsed_ms":33.308,"exit_code":0,"observations":[{"actual":true,"check":"valid operation","expected":true,"passed":true},{"actual":false,"check":"Poison messages circulate past the redrive allowance","expected":false,"passed":true},{"actual":false,"check":"Redrive races an updated dead-letter record","expected":false,"passed":true},{"actual":false,"check":"The target consumer cannot decode the original schema","expected":false,"passed":true},{"actual":false,"check":"Redrive revives a message past its absolute retention","expected":false,"passed":true},{"actual":false,"check":"Redrive bypasses its recovery traffic budget","expected":false,"passed":true},{"actual":true,"check":"unrelated tracing metadata","expected":true,"passed":true},{"actual":true,"check":"repeat validation is pure","expected":true,"passed":true},{"actual":false,"check":"two independent violations in variant","expected":false,"passed":true}],"passed":true,"stderr":"","stdout":"{\"observations\": [{\"check\": \"valid operation\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"Poison messages circulate past the redrive allowance\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Redrive races an updated dead-letter record\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"The target consumer cannot decode the original schema\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Redrive revives a message past its absolute retention\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"Redrive bypasses its recovery traffic budget\", \"actual\": false, \"expected\": false, \"passed\": true}, {\"check\": \"unrelated tracing metadata\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"repeat validation is pure\", \"actual\": true, \"expected\": true, \"passed\": true}, {\"check\": \"two independent violations in variant\", \"actual\": false, \"expected\": false, \"passed\": true}], \"passed\": true}\n"}},"verified":true,"visibility":"public"}