FA-1271 / Workflow orchestration / Open access

Continue a workflow as a new run: Both predecessor and successor remain runnable · case 01

The workflow continue operation is admitted even though both predecessor and successor remain runnable.

Verified by executionVariant 1 · 9 checks per implementationDownload source bundle ↓JSON ↗

ROOT CAUSE

The admission path omits the predecessor closed invariant while validating the other operation preconditions.

THE FAILURE

The admission path omits the predecessor closed invariant while validating the other operation preconditions.

Unsuccessful approach: Adding the predecessor closed check repairs the reported defect, but replacing the adjacent pending activities check loses that independent invariant.

Case contract

Return a Boolean admission decision for continue a workflow as a new run. The record r must satisfy all of: r['pending_activities'] == 0; len(r['signal_drain']) == 0; r['state_serializable'] in ['json','bytes']; r['new_run_unique'][0] != r['new_run_unique'][1]; r['predecessor_closed'] == 'continued'. Extra tracing fields are ignored; validation does not mutate the record.

Why this case matters

A deterministic local contract for workflow orchestration. Each negative fixture violates exactly one invariant. No transport timing, persistence, cryptographic verification, or full protocol implementation is claimed.

1 / The failure

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(r):
    return (r['pending_activities'] == 0) and (len(r['signal_drain']) == 0) and (r['state_serializable'] in ['json','bytes']) and (r['new_run_unique'][0] != r['new_run_unique'][1])
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
r = {'pending_activities': 0, 'signal_drain': [], 'state_serializable': 'json', 'new_run_unique': ['r2', 'r1'], 'predecessor_closed': 'continued'}
check('valid operation', solve(r), True)
check('Continuation loses unresolved activity results', solve(dict(r, **{'pending_activities': 1})), False)
check('Continuation discards accepted but unconsumed signals', solve(dict(r, **{'signal_drain': ['approve']})), False)
check('Continuation stores a runtime handle instead of durable state', solve(dict(r, **{'state_serializable': 'socket'})), False)
check('Continuation reuses the predecessor run identifier', solve(dict(r, **{'new_run_unique': ['r1', 'r1']})), False)
check('Both predecessor and successor remain runnable', solve(dict(r, **{'predecessor_closed': 'running'})), False)
check('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)
check('repeat validation is pure', solve(r), True)
invalid = {'pending_activities': 1, 'signal_drain': ['approve'], 'state_serializable': 'socket', 'new_run_unique': ['r1', 'r1'], 'predecessor_closed': 'running'}
keys = list(invalid)
pair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}
check('two independent violations in variant', solve(dict(r, **pair)), False)
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
valid operation	`True`	`True`	Passed
Continuation loses unresolved activity results	`False`	`False`	Passed
Continuation discards accepted but unconsumed signals	`False`	`False`	Passed
Continuation stores a runtime handle instead of durable state	`False`	`False`	Passed
Continuation reuses the predecessor run identifier	`False`	`False`	Passed
Both predecessor and successor remain runnable	`True`	`False`	Failed
unrelated tracing metadata	`True`	`True`	Passed
repeat validation is pure	`True`	`True`	Passed
two independent violations in variant	`False`	`False`	Passed

SHA-256 / 5c1e59192de170483d08605ac77744ef28a86b7d20baa0c9f28985ae54d59762

2 / The unsuccessful fix

Exit 1

"""Failure Map reference implementation. Python standard library only."""
import json

N = 1
observations = []
def solve(r):
    return (len(r['signal_drain']) == 0) and (r['state_serializable'] in ['json','bytes']) and (r['new_run_unique'][0] != r['new_run_unique'][1]) and (r['predecessor_closed'] == 'continued')
def check(label, actual, expected):
    observations.append({"check": label, "actual": actual, "expected": expected, "passed": actual == expected})
r = {'pending_activities': 0, 'signal_drain': [], 'state_serializable': 'json', 'new_run_unique': ['r2', 'r1'], 'predecessor_closed': 'continued'}
check('valid operation', solve(r), True)
check('Continuation loses unresolved activity results', solve(dict(r, **{'pending_activities': 1})), False)
check('Continuation discards accepted but unconsumed signals', solve(dict(r, **{'signal_drain': ['approve']})), False)
check('Continuation stores a runtime handle instead of durable state', solve(dict(r, **{'state_serializable': 'socket'})), False)
check('Continuation reuses the predecessor run identifier', solve(dict(r, **{'new_run_unique': ['r1', 'r1']})), False)
check('Both predecessor and successor remain runnable', solve(dict(r, **{'predecessor_closed': 'running'})), False)
check('unrelated tracing metadata', solve(dict(r, trace='run-'+str(N))), True)
check('repeat validation is pure', solve(r), True)
invalid = {'pending_activities': 1, 'signal_drain': ['approve'], 'state_serializable': 'socket', 'new_run_unique': ['r1', 'r1'], 'predecessor_closed': 'running'}
keys = list(invalid)
pair = {keys[N % len(keys)]: invalid[keys[N % len(keys)]], keys[(N+1) % len(keys)]: invalid[keys[(N+1) % len(keys)]]}
check('two independent violations in variant', solve(dict(r, **pair)), False)
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
valid operation	`True`	`True`	Passed
Continuation loses unresolved activity results	`True`	`False`	Failed
Continuation discards accepted but unconsumed signals	`False`	`False`	Passed
Continuation stores a runtime handle instead of durable state	`False`	`False`	Passed
Continuation reuses the predecessor run identifier	`False`	`False`	Passed
Both predecessor and successor remain runnable	`False`	`False`	Passed
unrelated tracing metadata	`True`	`True`	Passed
repeat validation is pure	`True`	`True`	Passed
two independent violations in variant	`False`	`False`	Passed

SHA-256 / a3448195bbf3aa813c9796f258cfa81c4475740297b1b1537ee12ce9577af00a

HELD IN THE MEMBER ARCHIVE

The verified repair and its recorded checks are member-only.

This mechanism has 9 recorded checks per implementation. The open-access tier publishes the failure and the unsuccessful fix; the repaired source that passes every check, and the observations that prove it, are available to members.

Every case sharing this mechanism uses the same contract and the same repair, so this one record is held back for all of them.

Member access is invitation-based. Sign in with your invited account to inspect the repair.

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:37:00.713993+00:00.

Case digest / 58c9bd6c72750c45117fd865c777dede20d27268637df08b2846c40dad052044