Intact algorithm
- naive-equivalent schedules
- 93,884
- DPOR schedules explored
- 269
- prefix states
- 1,317
primary verdictnontermination
A model checker asks what can happen when threads take turns in every possible order.
All exported tree nodes and edges are drawn. Pale wisps are a sampled density encoding of measured omitted completions, not reconstructed paths.
Choose a witness. The comet follows its numeric endpoints through the matching run.
Diameter scales with naive-equivalent schedules.
Removing one wait opens dangerous interleavings.
primary verdictnontermination
primary verdictrace
Only assertion reachability changes.
The sky maps every timeline. Here, build one.
Press A or D. Each press executes one instruction; cells, registers, and the rail update from the program.
PROGRAM / SCdekker_counter_broken_drop_turn_wait
set r7 1atomic_store flag0 1atomic_load flag1 -> r0bnz r0 p0_check_turnbnz r7 p0_enterNo instruction has executed.
set r7 1atomic_store flag1 1atomic_load flag0 -> r0bnz r0 p1_check_turnbnz r7 p1_enterRACE · counter · unordered cross-thread access
DPOR keeps one representative of equivalent orders, then returns a minimal witness.
Primary verdict: race under SC and PSO; assertion reachability: holds under SC, violated under PSO.