MS0V7 mlir-stage-08-v1 97 violation(s)

Selected stage: loom-lower-graph-memory. Test exactly output obligation mlir-obligation:b2259d118a5c5dd477532292 with its governing context; report any stage at

Test report

Coverage and triage executions

These jobs compile and check saved inputs, including reduction candidates and repeat confirmations.

1000generated samples
100.0%input coverage
100.0%output coverage
+23lines added
+18branches added
Not estimatedconfidence
903/1000checker passes
Code coverage details

Baseline tests: Every tracked test file with a RUN line invoking loom-raise-opt (77 files); other executables and native unit tests excluded

Source fileBaseline coverageBaseline + inputContributing input
…/lib/Dataflow/IR/DataflowMemoryContracts.cppMS0V
198/371lines53.4%
98/218branches45.0%
221/371lines59.6%+23
116/218branches53.2%+18
+23 lines · +18 branchesseed 38 · 12 → 11 linesOpen PBT Review PR
23 newly covered lines · 18 newly covered branches
105  auto rmw = llvm::dyn_cast<AtomicRmwOp>(op);106  if (!rmw)107    return llvm::isa<CmpXchgOp>(op)false branch108               ? AtomicElementCategory::Integer109               : AtomicElementCategory::IntegerOrFloatingPoint;⋮133  const char *required = "";134  switch (category) {135  case AtomicElementCategory::Integer:false branch136    if (isInteger)137      return llvm::Error::success();⋮143    required = "floating-point";144    break;145  case AtomicElementCategory::IntegerOrFloatingPoint:true branch146    if (isInteger || isFloat)true branch147      return llvm::Error::success();148    required = "integer or floating-point";149    break;⋮255llvm::Error validateSingleContractOwner(Operation *op) {256  for (NamedAttribute attribute : op->getAttrs()) {257    if (attribute.getName() == "contract")false branch258      continue;259    llvm::StringRef name = attribute.getName().strref();260    if (llvm::isa<PlainAccessContractAttr, AtomicAccessContractAttr,false branch261                  AtomicRmwContractAttr, CompareExchangeContractAttr,262                  FenceContractAttr>(attribute.getValue()))263      return contractError("'" + name +264                           "' must not carry a second aggregate memory "265                           "contract");266    if (llvm::isa<SyncScopeRefAttr>(attribute.getValue()))false branch267      return contractError("'" + name +268                           "' must not carry a second synchronization scope");269  }270  return llvm::Error::success();271}⋮289290/// The orderings an atomic store rejects.291bool isAcquireOrAcqRel(AtomicOrdering ordering) {292  return ordering == AtomicOrdering::Acquire ||false branch293         ordering == AtomicOrdering::AcqRel;false branch294}295296/// `source_alignment_bytes` is identity-critical typed state and must be a⋮390          aggregate = PlainAccessContractAttr::get(typedOp.getContext(),391                                                   /*is_volatile=*/false);392        if (auto plain = llvm::dyn_cast<PlainAccessContractAttr>(aggregate))false branch393          return MemoryActorContract{394              aggregate,    /*atomic=*/false, plain.getIsVolatile(),395              std::nullopt, std::nullopt,     SyncScopeRefAttr()};396        auto access = llvm::cast<AtomicAccessContractAttr>(aggregate);397        return MemoryActorContract{aggregate,398                                   /*atomic=*/true,399                                   access.getIsVolatile(),400                                   access.getSourceAlignmentBytes(),401                                   access.getVectorGranularity(),402                                   access.getSyncScope()};403      })404      .Case<AtomicRmwOp>([](AtomicRmwOp typedOp) {⋮480  // these. Duplicate effect kinds across the bound and unbound forms are481  // intentional.482  if (contract->atomic || contract->isVolatile) {true branch483    effects.emplace_back(MemoryEffects::Read::get());484    effects.emplace_back(MemoryEffects::Write::get());⋮498  // Only dataflow.load and dataflow.store nest a bare atomic access contract,499  // and each rejects the orderings its direction cannot express.500  if (auto atomic =true branch501          llvm::dyn_cast<AtomicAccessContractAttr>(contract->aggregate)) {502    if (llvm::isa<LoadOp>(op) && isReleaseOrAcqRel(atomic.getOrdering()))false branchfalse branchtrue branch503      return contractError("atomic load ordering must not be 'release' or "504                           "'acq_rel'");505    if (llvm::isa<StoreOp>(op) && isAcquireOrAcqRel(atomic.getOrdering()))false branchfalse branchtrue branch506      return contractError("atomic store ordering must not be 'acquire' or "507                           "'acq_rel'");508  }509  if (auto rmw = llvm::dyn_cast<AtomicRmwOp>(op))510    if (rmw.getContract().getAccess().getOrdering() ==
Files without added coverage
…/loom/include/Common/Artifact.hMS0V
13/37lines35.1%
3/18branches16.7%
13/37lines35.1%+0
3/18branches16.7%+0
Open PBT
…/include/Dataflow/IR/DataflowActorSemantics.hMS0V
9/160lines5.6%
1/60branches1.7%
9/160lines5.6%+0
1/60branches1.7%+0
Open PBT
…/loom/lib/Common/IndexWidth.cppMS0V
63/84lines75.0%
28/42branches66.7%
63/84lines75.0%+0
28/42branches66.7%+0
Open PBT
…/lib/Dataflow/IR/DataflowActorSemantics.cppMS0V
1089/1621lines67.2%
747/1330branches56.2%
1089/1621lines67.2%+0
747/1330branches56.2%+0
Open PBT
…/lib/Dataflow/IR/DataflowChannelOps.cppMS0V
59/88lines67.0%
13/38branches34.2%
59/88lines67.0%+0
13/38branches34.2%+0
Open PBT
…/lib/Dataflow/IR/DataflowDialect.cppMS0V
22/32lines68.8%
4/10branches40.0%
22/32lines68.8%+0
4/10branches40.0%+0
Open PBT
…/lib/Dataflow/IR/DataflowFunctionLikeOps.cppMS0V
693/1097lines63.2%
264/592branches44.6%
693/1097lines63.2%+0
264/592branches44.6%+0
Open PBT
…/lib/Dataflow/IR/DataflowOps.cppMS0V
270/410lines65.9%
103/228branches45.2%
270/410lines65.9%+0
103/228branches45.2%+0
Open PBT
…/lib/Dataflow/IR/OperationSchema.cppMS0V
274/716lines38.3%
127/350branches36.3%
274/716lines38.3%+0
127/350branches36.3%+0
Open PBT
…/lib/Dataflow/IR/OperationSchemaCodecInternal.hMS0V
28/120lines23.3%
4/44branches9.1%
28/120lines23.3%+0
4/44branches9.1%+0
Open PBT
…/lib/Dataflow/IR/OperationSchemaTypeCodec.cppMS0V
85/516lines16.5%
55/374branches14.7%
85/516lines16.5%+0
55/374branches14.7%+0
Open PBT
…/lib/Dataflow/Transforms/DataflowRewritePass.cppMS0V
338/559lines60.5%
172/340branches50.6%
338/559lines60.5%+0
172/340branches50.6%+0
Open PBT
…/lib/Frontend/Lowering/ExpandGraphMemrefCopyPass.cppMS0V
79/90lines87.8%
20/22branches90.9%
79/90lines87.8%+0
20/22branches90.9%+0
Open PBT
…/lib/Frontend/Lowering/GraphIndexLowering.cppMS0V
260/288lines90.3%
129/168branches76.8%
260/288lines90.3%+0
129/168branches76.8%+0
Open PBT
…/lib/Frontend/Lowering/GraphParallelLowering.cppMS0V
651/1243lines52.4%
284/786branches36.1%
651/1243lines52.4%+0
284/786branches36.1%+0
Open PBT
…/lib/Frontend/Lowering/GraphRegionAdmission.cppMS0V
58/110lines52.7%
29/92branches31.5%
58/110lines52.7%+0
29/92branches31.5%+0
Open PBT
…/lib/Frontend/Lowering/GraphRegionLowering.cppMS0V
1416/1626lines87.1%
532/680branches78.2%
1416/1626lines87.1%+0
532/680branches78.2%+0
Open PBT
…/lib/Frontend/Lowering/GraphStreamBoundaryLowering.cppMS0V
934/1072lines87.1%
299/432branches69.2%
934/1072lines87.1%+0
299/432branches69.2%+0
Open PBT
…/lib/Frontend/Lowering/GraphStreamBoundaryLowering.hMS0V
4/4lines100.0%
4/4branches100.0%
4/4lines100.0%+0
4/4branches100.0%+0
Open PBT
…/lib/Frontend/Lowering/LowerForToGraphPass.cppMS0V
1033/1240lines83.3%
374/540branches69.3%
1033/1240lines83.3%+0
374/540branches69.3%+0
Open PBT
…/lib/Frontend/Lowering/LowerForallToThreadPass.cppMS0V
30/34lines88.2%
2/4branches50.0%
30/34lines88.2%+0
2/4branches50.0%+0
Open PBT
…/lib/Frontend/Lowering/LowerGraphConstantsPass.cppMS0V
80/83lines96.4%
18/24branches75.0%
80/83lines96.4%+0
18/24branches75.0%+0
Open PBT
…/lib/Frontend/Lowering/LowerGraphMemoryPass.cppMS0V
525/841lines62.4%
208/400branches52.0%
525/841lines62.4%+0
208/400branches52.0%+0
Open PBT
…/lib/Frontend/Lowering/Pipeline.cppMS0V
18/21lines85.7%
branchesnot measured
18/21lines85.7%+0
branchesnot measured
Open PBT
…/lib/Frontend/Raising/DeduplicateSCFWhileStatePass.cppMS0V
13/135lines9.6%
0/60branches0.0%
13/135lines9.6%+0
0/60branches0.0%+0
Open PBT
…/lib/Frontend/Raising/LLVMArithToArithPass.cppMS0V
300/319lines94.0%
94/116branches81.0%
300/319lines94.0%+0
94/116branches81.0%+0
Open PBT
…/lib/Frontend/Raising/LLVMCfToCfPass.cppMS0V
77/80lines96.2%
8/8branches100.0%
77/80lines96.2%+0
8/8branches100.0%+0
Open PBT
…/lib/Frontend/Raising/LiftCFToSCFPass.cppMS0V
616/694lines88.8%
293/386branches75.9%
616/694lines88.8%+0
293/386branches75.9%+0
Open PBT
…/lib/Frontend/Raising/MaterializeFMulAddPass.cppMS0V
70/106lines66.0%
11/26branches42.3%
70/106lines66.0%+0
11/26branches42.3%+0
Open PBT
…/lib/Frontend/Raising/NormalizeLiftedSCFExitPass.cppMS0V
232/250lines92.8%
120/182branches65.9%
232/250lines92.8%+0
120/182branches65.9%+0
Open PBT
…/lib/Frontend/Raising/Pipeline.cppMS0V
10/19lines52.6%
branchesnot measured
10/19lines52.6%+0
branchesnot measured
Open PBT
…/lib/Frontend/Raising/SCFForToForallPass.cppMS0V
494/738lines66.9%
241/458branches52.6%
494/738lines66.9%+0
241/458branches52.6%+0
Open PBT
…/lib/Frontend/Raising/SCFWhileToForPass.cppMS0V
164/176lines93.2%
70/94branches74.5%
164/176lines93.2%+0
70/94branches74.5%+0
Open PBT
…/loom/tools/loom-raise-opt/loom-raise-opt.cppMS0V
12/12lines100.0%
branchesnot measured
12/12lines100.0%+0
branchesnot measured
Open PBT

Review PR: Regression test from seed 38

Source passages for this PBT

In addition to alias hazards, lowering materializes the sequenced-before rules from the actor contracts:

  • atomic actors and fences in one logical source strand preserve their selected order;
  • volatile actors in one logical source strand preserve their relative order;
  • release actors and fences wait for prior memory-effect tails whose visibility they publish;
  • acquire actors and fences precede later constrained memory effects;
  • acq_rel and seq_cst apply both directions; and
  • atomic-volatile actors participate in both strand relations.

docs/spec-compiler-part-3-mem.md lines 228–238

Minimized conforming example

11lines−1lines removed

Review regression test PR

Minimized passing input
dataflow.graph private @sb_strand(
    %start: none, %idx: index, %val: i32, %exp: i32, %des: i32,
    %a: memref<16xi32>, %b: memref<16xi32>) -> ()
    attributes {input_segments = array<i32: 4, 0, 2>,
                result_segments = array<i32: 0, 0, 0>} {
  %r0, %d0 = dataflow.load %b[%idx] %start {sb_index = 0 : i64} : memref<16xi32>
  %r2, %d2 = dataflow.load %b[%idx] %start {contract = #dataflow.plain_access<is_volatile = true>, sb_index = 2 : i64} : memref<16xi32>
  %r3, %d3 = dataflow.load %a[%idx] %start {contract = #dataflow.atomic_access<ordering = acquire, sync_scope = <system>, source_alignment_bytes = 4>, sb_index = 3 : i64} : memref<16xi32>
  %d4 = dataflow.store %a[%idx] %val %start {contract = #dataflow.atomic_access<ordering = release, sync_scope = <system>, source_alignment_bytes = 4>, sb_index = 4 : i64} : memref<16xi32>
  dataflow.graph.return %start : none
}

Conditions

input conditions — what generated inputs satisfy

Conforming input

dataflow.graph private @sb_strand(
    %start: none, %idx: index, %val: i32, %exp: i32, %des: i32,
    %a: memref<16xi32>, %b: memref<16xi32>) -> ()
    attributes {input_segments = array<i32: 4, 0, 2>,
                result_segments = array<i32: 0, 0, 0>} {
  %r0, %d0 = dataflow.atomic_rmw %b[%idx] %val %start {contract = #dataflow.rmw_contract<kind = add, access = <ordering = monotonic, sync_scope = <system>, source_alignment_bytes = 4>>, sb_index = 0 : i64} : memref<16xi32>
  %d1 = dataflow.store %a[%idx] %val %start {contract = #dataflow.plain_access<is_volatile = true>, sb_index = 1 : i64} : memref<16xi32>
  %d2 = dataflow.store %a[%idx] %val %start {contract = #dataflow.plain_access<is_volatile = true>, sb_index = 2 : i64} : memref<16xi32>
  %d3 = dataflow.fence %start {contract = #dataflow.fence_contract<ordering = seq_cst, sync_scope = <system>>, sb_index = 3 : i64}
  %r4, %d4 = dataflow.atomic_rmw %a[%idx] %val %start {contract = #dataflow.rmw_contract<kind = add, access = <ordering = monotonic, sync_scope = <system>, source_alignment_bytes = 4>>, sb_index = 4 : i64} : memref<16xi32>
  dataflow.graph.return %start : none
}

2 linked-input-29 · linked input 29

LLVM memcpy, memmove, and memset intrinsics are expanded into their exact structured loop semantics before ownership selection. Supported LLVM load/store (including volatile and atomic contracts), atomicrmw, cmpxchg, and fence forms are then normalized before recursive region lowering, after which the same frontier rules apply.

docs/spec-compiler-part-3-mem.md lines 482–486

3 linked-input-32 · linked input 32

When graph publication can trace every captured memory capability to a known root, an exact service rooted at a unique thread argument mechanically inherits that argument's llvm.noalias fact. If a root is unknown, appears through more than one captured capability, or does not resolve to that argument, publication must omit the fact.

docs/spec-compiler-part-3-mem.md lines 92–97

4 linked-input-50 · linked input 50

memref.get_global, memref.alloca, globals, static pointer bases, and unrecognized capability producers are not canonical roots. A pre-final analysis may conservatively group an unresolved access while building an event network, but finalization rejects any such residual producer rather than granting it an external-memory authority.

docs/spec-compiler-part-3-mem.md lines 148–152

5 linked-input-59 · linked input 59

A memory input binds an established external memref capability through an exact graph-launch type match. An LLVM pointer never satisfies a graph memory port.

docs/spec-compiler-part-3-mem.md lines 136–140

6 linked-input-66 · linked input 66

The finalized-graph gate also rejects residual memref.load/memref.store, memref.get_global, raw pointer arithmetic, pointer-bearing operations, builtin.unrealized_conversion_cast, and unknown memory-capability producers. An unsupported effectful operation inside a structured region must likewise fail closed instead of being hoisted.

docs/spec-compiler-part-3-mem.md lines 489–493

7 linked-input-67 · linked input 67

This document is the memory-order source of truth for graph-local SCF to Dataflow lowering. The concrete owner is loom-lower-graph-memory; it normalizes supported memory leaves and recursively lowers structured graph regions in one traversal.

docs/spec-compiler-part-3-mem.md lines 3–6

8 linked-input-68 · linked input 68

A canonical root is found by peeling an accepted side-effect-free memref view until reaching an explicit storage or boundary root. The finalized surface recognizes:

  • a graph memory input, whose root identity comes from its launch binding;
  • a dataflow.memory.service result at that binding, which preserves the root of its exact pointer operand while changing only the value-plane pointer into a memory-plane capability;
  • a fresh memref.alloc result, whose root is unique for each invocation;
  • a verified side-effect-free view that preserves the source root.

docs/spec-compiler-part-3-mem.md lines 79–90

9 linked-input-80 · linked input 80

Graph launch memory bindings require exact memref capability types. An LLVM pointer cannot bind a graph memref through a conversion, inferred base, or special address-space-zero rule.

docs/spec-compiler-part-3-mem.md lines 99–106

10 linked-input-102 · linked input 102

Until the typed producer and verifier establish this provenance, the boundary fails closed. Forged, malformed, foreign-owner, or domain-mismatched provenance is invalid even when the residual SCF shape is otherwise supported.

docs/spec-compiler-part-3-mem.md lines 389–393

11 linked-input-104 · linked input 104

The owner rejects before mutation when:

  • raw or unverifiably owned parallel SCF reaches a graph;
  • an effectful or unmodeled nested operation reaches a graph;
  • a residual LLVM load, store, atomicrmw, cmpxchg, fence, memcpy, memmove, or memset remains after normalization and therefore has no explicit completion event;
  • a source memory access has not been normalized to the canonical linear memory-space form required by its scalar or vector Dataflow actor;
  • structured control carries a memref result or memref loop state;
  • the graph entry lacks the leading none execution value.

docs/spec-compiler-part-3-mem.md lines 470–480

12 linked-input-115 · linked input 115

LLVM target-specific sync scopes without a compiler-target owner and atomic accesses without an explicit power-of-two source alignment fail closed. Every residual raw LLVM memory operation fails closed.

docs/spec-compiler-part-3-mem.md lines 486–489

13 linked-input-126 · linked input 126

Distinct graph memory inputs are conservatively may-alias unless explicit no-alias evidence distinguishes them. Distinct fresh allocations are independent roots.

docs/spec-compiler-part-3-mem.md lines 142–146

14 linked-input-149 · linked input 149

The lowering does not select parallel width, ownership, serialization, unrolling, reduction order, or any other schedule policy. Those decisions must be made before graph-region lowering and normalized into supported structured input.

docs/spec-compiler-part-3-mem.md lines 43–46

15 linked-input-170 · linked input 170

A source-origin llvm.alloca accepted by the Structured PromoteOrderedBufferToChannel decision is not an exception to this rule. That decision must remove the complete proved allocation closure before D0; a residual allocation or pointer use remains non-canonical and is rejected.

docs/spec-compiler-part-3-mem.md lines 154–157

16 linked-input-182 · linked input 182

Residual scf.parallel or scf.forall is checked across every graph before the pass mutates any graph. Raw or unowned parallel input fails.

docs/spec-compiler-part-3-mem.md lines 382–387

17 linked-input-184 · linked input 184

arbitrary nesting of scf.if, source-sequential scf.for, and scf.while;

docs/spec-compiler-part-3-mem.md lines 34–35

18 linked-input-195 · linked input 195

Access-to-partition membership is kept in a transient operation map before SCF operands are projected. Selector demuxing must not change alias identity.

docs/spec-compiler-part-3-mem.md lines 159–161

19 linked-input-200 · linked input 200

pre-mutation rejection of residual scf.parallel and scf.forall that reach a graph without an already materialized schedule boundary.

docs/spec-compiler-part-3-mem.md lines 40–41

20 linked-input-202 · linked input 202

normalized scalar memref.load and memref.store leaves over a canonical linear memory space;

docs/spec-compiler-part-3-mem.md lines 31–32

21 linked-input-211 · linked input 211

One vector addressed memory actor is one canonical firing. Its active lanes do not create independent frontier records or an implicit lane order.

docs/spec-compiler-part-3-mem.md lines 245–251

Generator grammar · candidate.pg
// Graph-local SCF-to-Dataflow memory input for loom-lower-graph-memory.
// One dataflow.graph whose entry block holds one straight-line logical source
// strand of canonical memory actors and fences over graph memory inputs.

start: {new COUNT = random.randint(2, 6); new I = 0; new MEM = '%a'}
       prologue items epilogue;

prologue: 'dataflow.graph private @sb_strand(\n'
          '    %start: none, %idx: index, %val: i32, %exp: i32, %des: i32,\n'
          '    %a: memref<16xi32>, %b: memref<16xi32>) -> ()\n'
          '    attributes {input_segments = array<i32: 4, 0, 2>,\n'
          '                result_segments = array<i32: 0, 0, 0>} {\n';

epilogue: '  dataflow.graph.return %start : none\n'
          '}\n';

items: (I < COUNT) pick actor {I += 1} items
     | (I == COUNT) '';

pick: {MEM = random.choice(['%a', '%b'])} '';

actor: atomic_load
     | atomic_store
     | volatile_load
     | volatile_store
     | plain_load
     | plain_store
     | fence_op
     | fence_acq
     | fence_rel
     | atomic_volatile_store
     | rmw_op;

atomic_load: '  %r' [str(I)] ', %d' [str(I)] ' = dataflow.load ' [MEM]
             '[%idx] %start {contract = #dataflow.atomic_access<ordering = acquire, sync_scope = <system>, source_alignment_bytes = 4>, sb_index = '
             [str(I)] ' : i64} : memref<16xi32>\n';

atomic_store: '  %d' [str(I)] ' = dataflow.store ' [MEM]
              '[%idx] %val %start {contract = #dataflow.atomic_access<ordering = release, sync_scope = <system>, source_alignment_bytes = 4>, sb_index = '
              [str(I)] ' : i64} : memref<16xi32>\n';

volatile_load: '  %r' [str(I)] ', %d' [str(I)] ' = dataflow.load ' [MEM]
               '[%idx] %start {contract = #dataflow.plain_access<is_volatile = true>, sb_index = '
               [str(I)] ' : i64} : memref<16xi32>\n';

volatile_store: '  %d' [str(I)] ' = dataflow.store ' [MEM]
                '[%idx] %val %start {contract = #dataflow.plain_access<is_volatile = true>, sb_index = '
                [str(I)] ' : i64} : memref<16xi32>\n';

plain_load: '  %r' [str(I)] ', %d' [str(I)] ' = dataflow.load ' [MEM]
            '[%idx] %start {sb_index = ' [str(I)]
            ' : i64} : memref<16xi32>\n';

plain_store: '  %d' [str(I)] ' = dataflow.store ' [MEM]
             '[%idx] %val %start {sb_index = ' [str(I)]
             ' : i64} : memref<16xi32>\n';

fence_op: '  %d' [str(I)]
          ' = dataflow.fence %start {contract = #dataflow.fence_contract<ordering = seq_cst, sync_scope = <system>>, sb_index = '
          [str(I)] ' : i64}\n';

fence_acq: '  %d' [str(I)]
           ' = dataflow.fence %start {contract = #dataflow.fence_contract<ordering = acquire, sync_scope = <system>>, sb_index = '
           [str(I)] ' : i64}\n';

fence_rel: '  %d' [str(I)]
           ' = dataflow.fence %start {contract = #dataflow.fence_contract<ordering = release, sync_scope = <system>>, sb_index = '
           [str(I)] ' : i64}\n';

atomic_volatile_store: '  %d' [str(I)] ' = dataflow.store ' [MEM]
                       '[%idx] %val %start {contract = #dataflow.atomic_access<ordering = seq_cst, sync_scope = <system>, source_alignment_bytes = 4, is_volatile = true>, sb_index = '
                       [str(I)] ' : i64} : memref<16xi32>\n';

rmw_op: '  %r' [str(I)] ', %d' [str(I)] ' = dataflow.atomic_rmw ' [MEM]
        '[%idx] %val %start {contract = #dataflow.rmw_contract<kind = add, access = <ordering = monotonic, sync_scope = <system>, source_alignment_bytes = 4>>, sb_index = '
        [str(I)] ' : i64} : memref<16xi32>\n';

output condition — what every compiled pair must satisfy

graph_memory_sequenced_before · 4 assertion sites

derived from 1 passage: 1selected-output

In addition to alias hazards, lowering materializes the sequenced-before rules from the actor contracts:

  • atomic actors and fences in one logical source strand preserve their selected order;
  • volatile actors in one logical source strand preserve their relative order;
  • release actors and fences wait for prior memory-effect tails whose visibility they publish;
  • acquire actors and fences precede later constrained memory effects;
  • acq_rel and seq_cst apply both directions; and
  • atomic-volatile actors participate in both strand relations.
Executable output condition · candidate.spct
postcondition graph_memory_sequenced_before {
  language v0;
  vocabulary mlir = mlir.generic@1;

  metadata {
    project = "PolyArch/loom";
    revision = "48615bc5925ef4b9db8b4550b5d4322933cf4b7b";
    source = "docs/spec-compiler-part-3-mem.md:L228-L238";
  }

  // One explicit event edge: a producer's event-plane (`none`) result feeding
  // a consumer operand. Ordinary `dataflow.sync`, `dataflow.mux`, and
  // `dataflow.demux` relay these edges, so the transitive closure of this
  // relation is exactly the ordering materialized by the published event
  // network.
  definition event_edges(program: mlir::Program): Relation<mlir::Operation, mlir::Operation> =
    set { (op, use.owner) |
          op in program.operations,
          value in op.results,
          use in value.uses
          where value.type == mlir::none };

  constraints {
    // The generated strand tags each source memory actor and fence of the one
    // straight-line logical source strand with its selected order.
    let tagged = seq { op | op in output.operations
                       where "sb_index" in op.attributes };

    let sb = closure(event_edges(output));

    // A memory effect is an addressed memory actor; a fence has no
    // alias-partition read or write effect.
    let effects = seq { op | op in tagged
                        where op.name == "dataflow.load"
                           or op.name == "dataflow.store"
                           or op.name == "dataflow.atomic_rmw"
                           or op.name == "dataflow.cmpxchg" };

    let atomic_ops = seq { op | op in tagged
                           where "contract" in op.attributes
                             and (op.attributes["contract"].kind == "#dataflow.atomic_access"
                                  or op.attributes["contract"].kind == "#dataflow.fence_contract"
                                  or op.attributes["contract"].kind == "#dataflow.rmw_contract"
                                  or op.attributes["contract"].kind == "#dataflow.cmpxchg_contract") };

    // Volatile actors, including atomic-volatile actors, which participate in
    // both strand relations.
    let volatile_ops = seq { op | op in tagged
                             where "contract" in op.attributes
                               and (op.attributes["contract"].canonical_text
                                      == "#dataflow.plain_access<is_volatile = true>"
                                    or op.attributes["contract"].canonical_text
                                      == "#dataflow.atomic_access<ordering = seq_cst, sync_scope = <system>, source_alignment_bytes = 4, is_volatile = true>") };

    // Release side: `release`, plus `acq_rel` and `seq_cst`, which apply both
    // directions.
    let release_ops = seq { op | op in tagged
                            where "contract" in op.attributes
                              and (op.attributes["contract"].canonical_text
                                     == "#dataflow.atomic_access<ordering = release, sync_scope = <system>, source_alignment_bytes = 4>"
                                   or op.attributes["contract"].canonical_text
                                     == "#dataflow.atomic_access<ordering = seq_cst, sync_scope = <system>, source_alignment_bytes = 4, is_volatile = true>"
                                   or op.attributes["contract"].canonical_text
                                     == "#dataflow.fence_contract<ordering = release, sync_scope = <system>>"
                                   or op.attributes["contract"].canonical_text
                                     == "#dataflow.fence_contract<ordering = seq_cst, sync_scope = <system>>") };

    // Acquire side: `acquire`, plus `acq_rel` and `seq_cst`.
    let acquire_ops = seq { op | op in tagged
                            where "contract" in op.attributes
                              and (op.attributes["contract"].canonical_text
                                     == "#dataflow.atomic_access<ordering = acquire, sync_scope = <system>, source_alignment_bytes = 4>"
                                   or op.attributes["contract"].canonical_text
                                     == "#dataflow.atomic_access<ordering = seq_cst, sync_scope = <system>, source_alignment_bytes = 4, is_volatile = true>"
                                   or op.attributes["contract"].canonical_text
                                     == "#dataflow.fence_contract<ordering = acquire, sync_scope = <system>>"
                                   or op.attributes["contract"].canonical_text
                                     == "#dataflow.fence_contract<ordering = seq_cst, sync_scope = <system>>") };

    // atomic actors and fences in one logical source strand preserve their
    // selected order
    forall earlier in atomic_ops {
      forall later in atomic_ops
        where earlier.attributes["sb_index"].int < later.attributes["sb_index"].int {
        assert atomic_strand_order: (earlier, later) in sb;
      }
    }

    // volatile actors in one logical source strand preserve their relative
    // order
    forall earlier in volatile_ops {
      forall later in volatile_ops
        where earlier.attributes["sb_index"].int < later.attributes["sb_index"].int {
        assert volatile_strand_order: (earlier, later) in sb;
      }
    }

    // release actors and fences wait for prior memory-effect tails whose
    // visibility they publish
    forall publisher in release_ops {
      forall effect in effects
        where effect.attributes["sb_index"].int < publisher.attributes["sb_index"].int {
        assert release_waits_for_prior_effects: (effect, publisher) in sb;
      }
    }

    // acquire actors and fences precede later constrained memory effects
    forall importer in acquire_ops {
      forall effect in effects
        where effect.attributes["sb_index"].int > importer.attributes["sb_index"].int {
        assert acquire_precedes_later_effects: (importer, effect) in sb;
      }
    }
  }
}
Minimized passing input
dataflow.graph private @sb_strand(
    %start: none, %idx: index, %val: i32, %exp: i32, %des: i32,
    %a: memref<16xi32>, %b: memref<16xi32>) -> ()
    attributes {input_segments = array<i32: 4, 0, 2>,
                result_segments = array<i32: 0, 0, 0>} {
  %r0, %d0 = dataflow.load %b[%idx] %start {sb_index = 0 : i64} : memref<16xi32>
  %r2, %d2 = dataflow.load %b[%idx] %start {contract = #dataflow.plain_access<is_volatile = true>, sb_index = 2 : i64} : memref<16xi32>
  %r3, %d3 = dataflow.load %a[%idx] %start {contract = #dataflow.atomic_access<ordering = acquire, sync_scope = <system>, source_alignment_bytes = 4>, sb_index = 3 : i64} : memref<16xi32>
  %d4 = dataflow.store %a[%idx] %val %start {contract = #dataflow.atomic_access<ordering = release, sync_scope = <system>, source_alignment_bytes = 4>, sb_index = 4 : i64} : memref<16xi32>
  dataflow.graph.return %start : none
}

Evidence

run20260911-082329started2026-09-11T08:23:29Zsubjectloom-raise-optsubject revision48615bc5925e

run results

1000saved inputs
1000accepted

output condition verdicts

903pass
97fail
Additional trace diagnostics

raw trace evidence

1000accepted trace samples
664distinct trace classes
539classes seen once
sample pair · seed 0

generated input

dataflow.graph private @sb_strand(
    %start: none, %idx: index, %val: i32, %exp: i32, %des: i32,
    %a: memref<16xi32>, %b: memref<16xi32>) -> ()
    attributes {input_segments = array<i32: 4, 0, 2>,
                result_segments = array<i32: 0, 0, 0>} {
  %r0, %d0 = dataflow.atomic_rmw %b[%idx] %val %start {contract = #dataflow.rmw_contract<kind = add, access = <ordering = monotonic, sync_scope = <system>, source_alignment_bytes = 4>>, sb_index = 0 : i64} : memref<16xi32>
  %d1 = dataflow.store %a[%idx] %val %start {contract = #dataflow.plain_access<is_volatile = true>, sb_index = 1 : i64} : memref<16xi32>
  %d2 = dataflow.store %a[%idx] %val %start {contract = #dataflow.plain_access<is_volatile = true>, sb_index = 2 : i64} : memref<16xi32>
  %d3 = dataflow.fence %start {contract = #dataflow.fence_contract<ordering = seq_cst, sync_scope = <system>>, sb_index = 3 : i64}
  %r4, %d4 = dataflow.atomic_rmw %a[%idx] %val %start {contract = #dataflow.rmw_contract<kind = add, access = <ordering = monotonic, sync_scope = <system>, source_alignment_bytes = 4>>, sb_index = 4 : i64} : memref<16xi32>
  dataflow.graph.return %start : none
}

observed generic output

"builtin.module"() ({
  "dataflow.graph"() <{function_type = (index, i32, i32, i32, memref<16xi32>, memref<16xi32>) -> (), input_segments = array<i32: 4, 0, 2>, result_segments = array<i32: 0, 0, 0>, sym_name = "sb_strand", sym_visibility = "private"}> ({
  ^bb0(%arg0: none, %arg1: index, %arg2: i32, %arg3: i32, %arg4: i32, %arg5: memref<16xi32>, %arg6: memref<16xi32>):
    %0:2 = "dataflow.atomic_rmw"(%arg6, %arg1, %arg2, %arg0) <{contract = #dataflow.rmw_contract<kind = add, access = <ordering = monotonic, sync_scope = <system>, source_alignment_bytes = 4>>}> {sb_index = 0 : i64} : (memref<16xi32>, index, i32, none) -> (i32, none)
    %1 = "dataflow.store"(%arg5, %arg1, %arg2, %0#1) <{contract = #dataflow.plain_access<is_volatile = true>}> {sb_index = 1 : i64} : (memref<16xi32>, index, i32, none) -> none
    %2 = "dataflow.store"(%arg5, %arg1, %arg2, %1) <{contract = #dataflow.plain_access<is_volatile = true>}> {sb_index = 2 : i64} : (memref<16xi32>, index, i32, none) -> none
    %3 = "dataflow.fence"(%2) <{contract = #dataflow.fence_contract<ordering = seq_cst, sync_scope = <system>>}> {sb_index = 3 : i64} : (none) -> none
    %4:2 = "dataflow.atomic_rmw"(%arg5, %arg1, %arg2, %3) <{contract = #dataflow.rmw_contract<kind = add, access = <ordering = monotonic, sync_scope = <system>, source_alignment_bytes = 4>>}> {sb_index = 4 : i64} : (memref<16xi32>, index, i32, none) -> (i32, none)
    "dataflow.graph.return"(%4#1) <{operandSegmentSizes = array<i32: 0, 0, 0, 1>}> : (none) -> ()
  }) : () -> ()
}) : () -> ()

per-seed evidence (1000 seeds)
seedsubjectverdictartifacts
0accepted exit 0 · 0.6708719399975962sPASSinput · generic input · output · check report
1accepted exit 0 · 0.6853532989989617sPASSinput · generic input · output · check report
2accepted exit 0 · 0.6847084930013807sPASSinput · generic input · output · check report
3accepted exit 0 · 0.6321887539997988sPASSinput · generic input · output · check report
4accepted exit 0 · 0.6994607619999442sPASSinput · generic input · output · check report
5accepted exit 0 · 0.6636835530007374sPASSinput · generic input · output · check report
6accepted exit 0 · 0.6664372580016789sPASSinput · generic input · output · check report
7accepted exit 0 · 0.6771536759988521sPASSinput · generic input · output · check report
8accepted exit 0 · 0.6591459510018467sPASSinput · generic input · output · check report
9accepted exit 0 · 0.6704823459986073sPASSinput · generic input · output · check report
10accepted exit 0 · 0.6310738659994968sPASSinput · generic input · output · check report
11accepted exit 0 · 0.683806763998291sPASSinput · generic input · output · check report
12accepted exit 0 · 0.6183733970028698sPASSinput · generic input · output · check report
13accepted exit 0 · 0.6895037739996042sPASSinput · generic input · output · check report
14accepted exit 0 · 0.6572374589995889sPASSinput · generic input · output · check report
15accepted exit 0 · 0.679057091998402sFAILinput · generic input · output · check report
16accepted exit 0 · 0.68647610699918sPASSinput · generic input · output · check report
17accepted exit 0 · 0.6665797749992635sPASSinput · generic input · output · check report
18accepted exit 0 · 0.6687152070007869sPASSinput · generic input · output · check report
19accepted exit 0 · 0.6304592289998254sPASSinput · generic input · output · check report
20accepted exit 0 · 0.8387012570019579sPASSinput · generic input · output · check report
21accepted exit 0 · 0.6984906649995537sPASSinput · generic input · output · check report
22accepted exit 0 · 0.6717554800015932sPASSinput · generic input · output · check report
23accepted exit 0 · 0.6732317100031651sFAILinput · generic input · output · check report
24accepted exit 0 · 0.6368968099995982sPASSinput · generic input · output · check report
25accepted exit 0 · 0.6926317539982847sPASSinput · generic input · output · check report
26accepted exit 0 · 0.7038629189992207sPASSinput · generic input · output · check report
27accepted exit 0 · 0.6559013079968281sPASSinput · generic input · output · check report
28accepted exit 0 · 0.665682172999368sPASSinput · generic input · output · check report
29accepted exit 0 · 0.6659165830023994sPASSinput · generic input · output · check report
30accepted exit 0 · 0.68466194299981sPASSinput · generic input · output · check report
31accepted exit 0 · 0.6182311150041642sPASSinput · generic input · output · check report
32accepted exit 0 · 0.6237068589980481sPASSinput · generic input · output · check report
33accepted exit 0 · 0.6190123630003654sPASSinput · generic input · output · check report
34accepted exit 0 · 0.6425102320063161sPASSinput · generic input · output · check report
35accepted exit 0 · 0.6093659469988779sPASSinput · generic input · output · check report
36accepted exit 0 · 0.5968787089950638sFAILinput · generic input · output · check report
37accepted exit 0 · 0.6400806040037423sPASSinput · generic input · output · check report
38accepted exit 0 · 0.5918858020013431sPASSinput · generic input · output · check report
39accepted exit 0 · 0.6255897500013816sPASSinput · generic input · output · check report
40accepted exit 0 · 0.6143191200026195sPASSinput · generic input · output · check report
41accepted exit 0 · 0.6137267260055523sPASSinput · generic input · output · check report
42accepted exit 0 · 0.6025441820020205sPASSinput · generic input · output · check report
43accepted exit 0 · 0.6044893879952724sPASSinput · generic input · output · check report
44accepted exit 0 · 0.5629173180059297sPASSinput · generic input · output · check report
45accepted exit 0 · 0.5964504039948224sPASSinput · generic input · output · check report
46accepted exit 0 · 0.6296453850009129sPASSinput · generic input · output · check report
47accepted exit 0 · 0.6369054850001703sPASSinput · generic input · output · check report
48accepted exit 0 · 0.589355575000809sPASSinput · generic input · output · check report
49accepted exit 0 · 0.6282764009956736sPASSinput · generic input · output · check report
50accepted exit 0 · 0.6397103589988546sPASSinput · generic input · output · check report
51accepted exit 0 · 0.5457824919940322sPASSinput · generic input · output · check report
52accepted exit 0 · 0.6320385450017056sPASSinput · generic input · output · check report
53accepted exit 0 · 0.6079555460019037sPASSinput · generic input · output · check report
54accepted exit 0 · 0.6266086059986264sPASSinput · generic input · output · check report
55accepted exit 0 · 0.6223542169973371sPASSinput · generic input · output · check report
56accepted exit 0 · 0.5685959449983784sPASSinput · generic input · output · check report
57accepted exit 0 · 0.5532645190032781sPASSinput · generic input · output · check report
58accepted exit 0 · 0.6052294600012829sPASSinput · generic input · output · check report
59accepted exit 0 · 0.5947073370043654sPASSinput · generic input · output · check report
60accepted exit 0 · 0.5406429590002517sPASSinput · generic input · output · check report
61accepted exit 0 · 0.6210243259993149sPASSinput · generic input · output · check report
62accepted exit 0 · 0.6582762749967515sPASSinput · generic input · output · check report
63accepted exit 0 · 0.640172186998825sPASSinput · generic input · output · check report
64accepted exit 0 · 0.5622926829964854sPASSinput · generic input · output · check report
65accepted exit 0 · 0.623031880997587sPASSinput · generic input · output · check report
66accepted exit 0 · 0.5785754480020842sPASSinput · generic input · output · check report
67accepted exit 0 · 0.5989696809992893sPASSinput · generic input · output · check report
68accepted exit 0 · 0.6132164669979829sPASSinput · generic input · output · check report
69accepted exit 0 · 0.6015095359980478sPASSinput · generic input · output · check report
70accepted exit 0 · 0.6233301319953171sPASSinput · generic input · output · check report
71accepted exit 0 · 0.5736468100003549sPASSinput · generic input · output · check report
72accepted exit 0 · 0.6573086370044621sPASSinput · generic input · output · check report
73accepted exit 0 · 0.5754675749994931sPASSinput · generic input · output · check report
74accepted exit 0 · 0.5627112110014423sPASSinput · generic input · output · check report
75accepted exit 0 · 0.6109349879989168sPASSinput · generic input · output · check report
76accepted exit 0 · 0.6055175119981868sPASSinput · generic input · output · check report
77accepted exit 0 · 0.5820389399959822sPASSinput · generic input · output · check report
78accepted exit 0 · 0.6258965870001703sPASSinput · generic input · output · check report
79accepted exit 0 · 0.60470028599957sPASSinput · generic input · output · check report
80accepted exit 0 · 0.5679758890037192sPASSinput · generic input · output · check report
81accepted exit 0 · 0.6432743990008021sPASSinput · generic input · output · check report
82accepted exit 0 · 0.6206494119978743sFAILinput · generic input · output · check report
83accepted exit 0 · 0.6055098880024161sPASSinput · generic input · output · check report
84accepted exit 0 · 0.6116700890052016sPASSinput · generic input · output · check report
85accepted exit 0 · 0.6464409129985142sPASSinput · generic input · output · check report
86accepted exit 0 · 0.6134855120035354sPASSinput · generic input · output · check report
87accepted exit 0 · 0.6275615479971748sPASSinput · generic input · output · check report
88accepted exit 0 · 0.644710369000677sPASSinput · generic input · output · check report
89accepted exit 0 · 0.562218484999903sPASSinput · generic input · output · check report
90accepted exit 0 · 0.6107090630030143sPASSinput · generic input · output · check report
91accepted exit 0 · 0.6333471149991965sPASSinput · generic input · output · check report
92accepted exit 0 · 0.5846547769979225sPASSinput · generic input · output · check report
93accepted exit 0 · 0.6130822249979246sPASSinput · generic input · output · check report
94accepted exit 0 · 0.6558470480013057sPASSinput · generic input · output · check report
95accepted exit 0 · 0.6310247689980315sPASSinput · generic input · output · check report
96accepted exit 0 · 0.5666289259970654sPASSinput · generic input · output · check report
97accepted exit 0 · 0.5983869960036827sFAILinput · generic input · output · check report
98accepted exit 0 · 0.5883023950009374sPASSinput · generic input · output · check report
99accepted exit 0 · 0.5893339539979934sFAILinput · generic input · output · check report
100accepted exit 0 · 0.5316163970001071sPASSinput · generic input · output · check report
101accepted exit 0 · 0.614379826000004sPASSinput · generic input · output · check report
102accepted exit 0 · 0.4737637660000473sPASSinput · generic input · output · check report
103accepted exit 0 · 0.6115507849999631sFAILinput · generic input · output · check report
104accepted exit 0 · 0.5285735490001571sPASSinput · generic input · output · check report
105accepted exit 0 · 0.5464795190000586sPASSinput · generic input · output · check report
106accepted exit 0 · 0.4790746799999397sPASSinput · generic input · output · check report
107accepted exit 0 · 0.07638818800023728sFAILinput · generic input · output · check report
108accepted exit 0 · 0.09716151299971898sPASSinput · generic input · output · check report
109accepted exit 0 · 0.05718337500002235sPASSinput · generic input · output · check report
110accepted exit 0 · 0.09227897799974016sPASSinput · generic input · output · check report
111accepted exit 0 · 0.11155435099999522sFAILinput · generic input · output · check report
112accepted exit 0 · 0.07490973099993425sPASSinput · generic input · output · check report
113accepted exit 0 · 0.11078272899976582sPASSinput · generic input · output · check report
114accepted exit 0 · 0.10003959699997722sPASSinput · generic input · output · check report
115accepted exit 0 · 0.0984664839998004sPASSinput · generic input · output · check report
116accepted exit 0 · 0.09416654799997559sPASSinput · generic input · output · check report
117accepted exit 0 · 0.08936019899965686sPASSinput · generic input · output · check report
118accepted exit 0 · 0.10372013100004551sPASSinput · generic input · output · check report
119accepted exit 0 · 0.11244046699994215sPASSinput · generic input · output · check report
120accepted exit 0 · 0.0826088889998573sPASSinput · generic input · output · check report
121accepted exit 0 · 0.09144036299994696sPASSinput · generic input · output · check report
122accepted exit 0 · 0.061228301000028296sPASSinput · generic input · output · check report
123accepted exit 0 · 0.06113625799980582sPASSinput · generic input · output · check report
124accepted exit 0 · 0.10723266900004091sFAILinput · generic input · output · check report
125accepted exit 0 · 0.04822897800022474sPASSinput · generic input · output · check report
126accepted exit 0 · 0.09472008200009441sPASSinput · generic input · output · check report
127accepted exit 0 · 0.054756343999997625sPASSinput · generic input · output · check report
128accepted exit 0 · 0.09245131099987702sPASSinput · generic input · output · check report
129accepted exit 0 · 0.060097630999734974sFAILinput · generic input · output · check report
130accepted exit 0 · 0.08582220800008145sPASSinput · generic input · output · check report
131accepted exit 0 · 0.04811611000013727sPASSinput · generic input · output · check report
132accepted exit 0 · 0.05938600599984056sFAILinput · generic input · output · check report
133accepted exit 0 · 0.04736586000035459sPASSinput · generic input · output · check report
134accepted exit 0 · 0.09495823800034486sPASSinput · generic input · output · check report
135accepted exit 0 · 0.07079645800013168sPASSinput · generic input · output · check report
136accepted exit 0 · 0.11155409499997404sPASSinput · generic input · output · check report
137accepted exit 0 · 0.055479990000094404sPASSinput · generic input · output · check report
138accepted exit 0 · 0.06043499099996552sPASSinput · generic input · output · check report
139accepted exit 0 · 0.08314768999980515sPASSinput · generic input · output · check report
140accepted exit 0 · 0.08740996000005907sPASSinput · generic input · output · check report
141accepted exit 0 · 0.08269836799991026sFAILinput · generic input · output · check report
142accepted exit 0 · 0.0769417610003984sPASSinput · generic input · output · check report
143accepted exit 0 · 0.1098226799999793sPASSinput · generic input · output · check report
144accepted exit 0 · 0.08383654899989779sFAILinput · generic input · output · check report
145accepted exit 0 · 0.066510302000097sPASSinput · generic input · output · check report
146accepted exit 0 · 0.0485778349998327sPASSinput · generic input · output · check report
147accepted exit 0 · 0.085913815999902sPASSinput · generic input · output · check report
148accepted exit 0 · 0.1033851710003546sPASSinput · generic input · output · check report
149accepted exit 0 · 0.079862759000207sPASSinput · generic input · output · check report
150accepted exit 0 · 0.12035892300036721sPASSinput · generic input · output · check report
151accepted exit 0 · 0.10480559600000561sPASSinput · generic input · output · check report
152accepted exit 0 · 0.09781156500002908sPASSinput · generic input · output · check report
153accepted exit 0 · 0.09231710999983989sPASSinput · generic input · output · check report
154accepted exit 0 · 0.12086997000005795sPASSinput · generic input · output · check report
155accepted exit 0 · 0.05782787699990877sPASSinput · generic input · output · check report
156accepted exit 0 · 0.0920322980000492sPASSinput · generic input · output · check report
157accepted exit 0 · 0.09745586200006073sPASSinput · generic input · output · check report
158accepted exit 0 · 0.093036998000116sPASSinput · generic input · output · check report
159accepted exit 0 · 0.09373796599993511sFAILinput · generic input · output · check report
160accepted exit 0 · 0.1041627590002463sPASSinput · generic input · output · check report
161accepted exit 0 · 0.05622971599996163sPASSinput · generic input · output · check report
162accepted exit 0 · 0.06627388300012171sPASSinput · generic input · output · check report
163accepted exit 0 · 0.09184783599994262sPASSinput · generic input · output · check report
164accepted exit 0 · 0.09418237499994575sPASSinput · generic input · output · check report
165accepted exit 0 · 0.08717603800005236sPASSinput · generic input · output · check report
166accepted exit 0 · 0.0537006949998613sFAILinput · generic input · output · check report
167accepted exit 0 · 0.1000384430003578sPASSinput · generic input · output · check report
168accepted exit 0 · 0.06003401899988603sPASSinput · generic input · output · check report
169accepted exit 0 · 0.11082508700019389sPASSinput · generic input · output · check report
170accepted exit 0 · 0.09686293699996895sPASSinput · generic input · output · check report
171accepted exit 0 · 0.053477046999887534sPASSinput · generic input · output · check report
172accepted exit 0 · 0.11953494099998352sPASSinput · generic input · output · check report
173accepted exit 0 · 0.11564462100022865sPASSinput · generic input · output · check report
174accepted exit 0 · 0.05173763099992357sPASSinput · generic input · output · check report
175accepted exit 0 · 0.0942491109999537sPASSinput · generic input · output · check report
176accepted exit 0 · 0.10889162300009048sPASSinput · generic input · output · check report
177accepted exit 0 · 0.06014089700011027sPASSinput · generic input · output · check report
178accepted exit 0 · 0.05310463300020274sPASSinput · generic input · output · check report
179accepted exit 0 · 0.150916135999978sPASSinput · generic input · output · check report
180accepted exit 0 · 0.09290979099978358sPASSinput · generic input · output · check report
181accepted exit 0 · 0.1029740590001893sPASSinput · generic input · output · check report
182accepted exit 0 · 0.08819112399987716sPASSinput · generic input · output · check report
183accepted exit 0 · 0.09602169399977356sPASSinput · generic input · output · check report
184accepted exit 0 · 0.11458243299966853sPASSinput · generic input · output · check report
185accepted exit 0 · 0.08920142699980715sPASSinput · generic input · output · check report
186accepted exit 0 · 0.11674224500029595sPASSinput · generic input · output · check report
187accepted exit 0 · 0.08971371200004796sPASSinput · generic input · output · check report
188accepted exit 0 · 0.08863274099985574sFAILinput · generic input · output · check report
189accepted exit 0 · 0.10056930000018838sFAILinput · generic input · output · check report
190accepted exit 0 · 0.09579044800011616sPASSinput · generic input · output · check report
191accepted exit 0 · 0.04764724300002854sPASSinput · generic input · output · check report
192accepted exit 0 · 0.09923057700007121sPASSinput · generic input · output · check report
193accepted exit 0 · 0.09148415600020599sPASSinput · generic input · output · check report
194accepted exit 0 · 0.1002152909995857sPASSinput · generic input · output · check report
195accepted exit 0 · 0.1069430980001016sPASSinput · generic input · output · check report
196accepted exit 0 · 0.10438961899990318sPASSinput · generic input · output · check report
197accepted exit 0 · 0.102020125999843sPASSinput · generic input · output · check report
198accepted exit 0 · 0.08900433999997404sPASSinput · generic input · output · check report
199accepted exit 0 · 0.1102842119998968sPASSinput · generic input · output · check report
200accepted exit 0 · 0.09411073000001124sPASSinput · generic input · output · check report
201accepted exit 0 · 0.08559605399977954sPASSinput · generic input · output · check report
202accepted exit 0 · 0.09109300799991615sPASSinput · generic input · output · check report
203accepted exit 0 · 0.08846504799976174sPASSinput · generic input · output · check report
204accepted exit 0 · 0.09220468900002743sPASSinput · generic input · output · check report
205accepted exit 0 · 0.09561601199993675sPASSinput · generic input · output · check report
206accepted exit 0 · 0.10397739099971659sPASSinput · generic input · output · check report
207accepted exit 0 · 0.08808297099994888sPASSinput · generic input · output · check report
208accepted exit 0 · 0.0989563520001866sPASSinput · generic input · output · check report
209accepted exit 0 · 0.1171301190001941sFAILinput · generic input · output · check report
210accepted exit 0 · 0.10113331499997003sPASSinput · generic input · output · check report
211accepted exit 0 · 0.09841878300039753sPASSinput · generic input · output · check report
212accepted exit 0 · 0.09391783199998827sPASSinput · generic input · output · check report
213accepted exit 0 · 0.11316780099969037sPASSinput · generic input · output · check report
214accepted exit 0 · 0.0916374450002877sPASSinput · generic input · output · check report
215accepted exit 0 · 0.05457754400003978sPASSinput · generic input · output · check report
216accepted exit 0 · 0.15294649499992374sPASSinput · generic input · output · check report
217accepted exit 0 · 0.1263831169999321sPASSinput · generic input · output · check report
218accepted exit 0 · 0.09648804600010408sPASSinput · generic input · output · check report
219accepted exit 0 · 0.11607518899973002sPASSinput · generic input · output · check report
220accepted exit 0 · 0.09646017400018536sPASSinput · generic input · output · check report
221accepted exit 0 · 0.09749510900019231sPASSinput · generic input · output · check report
222accepted exit 0 · 0.09492833500007691sPASSinput · generic input · output · check report
223accepted exit 0 · 0.0657019489999584sPASSinput · generic input · output · check report
224accepted exit 0 · 0.11038260799978161sFAILinput · generic input · output · check report
225accepted exit 0 · 0.11113829999976588sPASSinput · generic input · output · check report
226accepted exit 0 · 0.10022649499978797sPASSinput · generic input · output · check report
227accepted exit 0 · 0.0909308800000872sPASSinput · generic input · output · check report
228accepted exit 0 · 0.08240861900003438sPASSinput · generic input · output · check report
229accepted exit 0 · 0.09674922900012461sPASSinput · generic input · output · check report
230accepted exit 0 · 0.05909970800030351sPASSinput · generic input · output · check report
231accepted exit 0 · 0.12582422099967516sPASSinput · generic input · output · check report
232accepted exit 0 · 0.09927878500002407sPASSinput · generic input · output · check report
233accepted exit 0 · 0.10024191600041377sFAILinput · generic input · output · check report
234accepted exit 0 · 0.09274912999990192sPASSinput · generic input · output · check report
235accepted exit 0 · 0.05053352400000222sPASSinput · generic input · output · check report
236accepted exit 0 · 0.08911911599989253sPASSinput · generic input · output · check report
237accepted exit 0 · 0.05491427000015392sPASSinput · generic input · output · check report
238accepted exit 0 · 0.12665799099977448sPASSinput · generic input · output · check report
239accepted exit 0 · 0.09157549500014284sPASSinput · generic input · output · check report
240accepted exit 0 · 0.08746490600015022sPASSinput · generic input · output · check report
241accepted exit 0 · 0.14549322199991366sPASSinput · generic input · output · check report
242accepted exit 0 · 0.05219668100016861sPASSinput · generic input · output · check report
243accepted exit 0 · 0.09241794900026434sPASSinput · generic input · output · check report
244accepted exit 0 · 0.09629391599992232sPASSinput · generic input · output · check report
245accepted exit 0 · 0.09491435300014928sPASSinput · generic input · output · check report
246accepted exit 0 · 0.05925195600002553sPASSinput · generic input · output · check report
247accepted exit 0 · 0.057879947000401444sPASSinput · generic input · output · check report
248accepted exit 0 · 0.09723376300007658sPASSinput · generic input · output · check report
249accepted exit 0 · 0.04669654100007392sPASSinput · generic input · output · check report
250accepted exit 0 · 0.12202226699992025sPASSinput · generic input · output · check report
251accepted exit 0 · 0.07766302000027281sPASSinput · generic input · output · check report
252accepted exit 0 · 0.13820519299997613sPASSinput · generic input · output · check report
253accepted exit 0 · 0.11437240600025689sPASSinput · generic input · output · check report
254accepted exit 0 · 0.09909451299972716sPASSinput · generic input · output · check report
255accepted exit 0 · 0.04863414500005092sPASSinput · generic input · output · check report
256accepted exit 0 · 0.0575860650001232sPASSinput · generic input · output · check report
257accepted exit 0 · 0.05535565299987866sPASSinput · generic input · output · check report
258accepted exit 0 · 0.0923476899997695sPASSinput · generic input · output · check report
259accepted exit 0 · 0.08825125899966224sPASSinput · generic input · output · check report
260accepted exit 0 · 0.10197331800009124sPASSinput · generic input · output · check report
261accepted exit 0 · 0.10381587300025785sPASSinput · generic input · output · check report
262accepted exit 0 · 0.060229116000300564sFAILinput · generic input · output · check report
263accepted exit 0 · 0.09798037100017609sPASSinput · generic input · output · check report
264accepted exit 0 · 0.09312621600020066sPASSinput · generic input · output · check report
265accepted exit 0 · 0.08748960899993108sPASSinput · generic input · output · check report
266accepted exit 0 · 0.0561176159999377sPASSinput · generic input · output · check report
267accepted exit 0 · 0.07589546099961808sPASSinput · generic input · output · check report
268accepted exit 0 · 0.06088809599987144sPASSinput · generic input · output · check report
269accepted exit 0 · 0.09303354299981947sPASSinput · generic input · output · check report
270accepted exit 0 · 0.0729736389998834sPASSinput · generic input · output · check report
271accepted exit 0 · 0.06991974699985803sPASSinput · generic input · output · check report
272accepted exit 0 · 0.10880317299961462sPASSinput · generic input · output · check report
273accepted exit 0 · 0.06419150800002171sPASSinput · generic input · output · check report
274accepted exit 0 · 0.0672336779998659sPASSinput · generic input · output · check report
275accepted exit 0 · 0.05119173699995372sPASSinput · generic input · output · check report
276accepted exit 0 · 0.08965857900011542sPASSinput · generic input · output · check report
277accepted exit 0 · 0.08725705400001971sPASSinput · generic input · output · check report
278accepted exit 0 · 0.049250948000008066sFAILinput · generic input · output · check report
279accepted exit 0 · 0.05502868099983971sPASSinput · generic input · output · check report
280accepted exit 0 · 0.045748262999950384sPASSinput · generic input · output · check report
281accepted exit 0 · 0.0625540699998055sPASSinput · generic input · output · check report
282accepted exit 0 · 0.09636791399998401sPASSinput · generic input · output · check report
283accepted exit 0 · 0.09367936899980123sPASSinput · generic input · output · check report
284accepted exit 0 · 0.05313069200019527sPASSinput · generic input · output · check report
285accepted exit 0 · 0.08171222999999372sPASSinput · generic input · output · check report
286accepted exit 0 · 0.0486632929996631sPASSinput · generic input · output · check report
287accepted exit 0 · 0.06033749299967894sPASSinput · generic input · output · check report
288accepted exit 0 · 0.0773016779999125sPASSinput · generic input · output · check report
289accepted exit 0 · 0.053499165999710385sPASSinput · generic input · output · check report
290accepted exit 0 · 0.08791110499987553sPASSinput · generic input · output · check report
291accepted exit 0 · 0.06266990899985103sPASSinput · generic input · output · check report
292accepted exit 0 · 0.06011889199999132sPASSinput · generic input · output · check report
293accepted exit 0 · 0.05424250399983066sPASSinput · generic input · output · check report
294accepted exit 0 · 0.051385711999955674sPASSinput · generic input · output · check report
295accepted exit 0 · 0.07089497300012226sFAILinput · generic input · output · check report
296accepted exit 0 · 0.09253111199996056sPASSinput · generic input · output · check report
297accepted exit 0 · 0.06099318699989453sPASSinput · generic input · output · check report
298accepted exit 0 · 0.05293486499977007sPASSinput · generic input · output · check report
299accepted exit 0 · 0.10055418700039809sPASSinput · generic input · output · check report
300accepted exit 0 · 0.08911361300033604sPASSinput · generic input · output · check report
301accepted exit 0 · 0.049927363000279sPASSinput · generic input · output · check report
302accepted exit 0 · 0.04910205699979997sPASSinput · generic input · output · check report
303accepted exit 0 · 0.0950066790001074sPASSinput · generic input · output · check report
304accepted exit 0 · 0.13697445900015737sPASSinput · generic input · output · check report
305accepted exit 0 · 0.0530079640002441sPASSinput · generic input · output · check report
306accepted exit 0 · 0.06723835100001452sPASSinput · generic input · output · check report
307accepted exit 0 · 0.09863105200020073sPASSinput · generic input · output · check report
308accepted exit 0 · 0.051666190000105416sPASSinput · generic input · output · check report
309accepted exit 0 · 0.12116647800030478sPASSinput · generic input · output · check report
310accepted exit 0 · 0.12048114400022314sPASSinput · generic input · output · check report
311accepted exit 0 · 0.09585967200018786sPASSinput · generic input · output · check report
312accepted exit 0 · 0.10198978999960673sPASSinput · generic input · output · check report
313accepted exit 0 · 0.08975936499973614sPASSinput · generic input · output · check report
314accepted exit 0 · 0.09034279099978448sPASSinput · generic input · output · check report
315accepted exit 0 · 0.05598527700021805sPASSinput · generic input · output · check report
316accepted exit 0 · 0.08652668700051436sFAILinput · generic input · output · check report
317accepted exit 0 · 0.04866316599964193sFAILinput · generic input · output · check report
318accepted exit 0 · 0.10008129200014082sPASSinput · generic input · output · check report
319accepted exit 0 · 0.10572946699994645sPASSinput · generic input · output · check report
320accepted exit 0 · 0.10146711499965022sPASSinput · generic input · output · check report
321accepted exit 0 · 0.08544647899998381sPASSinput · generic input · output · check report
322accepted exit 0 · 0.09143775699976686sPASSinput · generic input · output · check report
323accepted exit 0 · 0.11275483100052952sPASSinput · generic input · output · check report
324accepted exit 0 · 0.10647848000007798sPASSinput · generic input · output · check report
325accepted exit 0 · 0.11771100999976625sPASSinput · generic input · output · check report
326accepted exit 0 · 0.09759771700009878sPASSinput · generic input · output · check report
327accepted exit 0 · 0.05532456899982208sFAILinput · generic input · output · check report
328accepted exit 0 · 0.05320906199995079sFAILinput · generic input · output · check report
329accepted exit 0 · 0.08865512800002762sPASSinput · generic input · output · check report
330accepted exit 0 · 0.04597649700008333sPASSinput · generic input · output · check report
331accepted exit 0 · 0.09113251700000546sPASSinput · generic input · output · check report
332accepted exit 0 · 0.05043957100042462sFAILinput · generic input · output · check report
333accepted exit 0 · 0.09350410800016107sPASSinput · generic input · output · check report
334accepted exit 0 · 0.05389835900041362sPASSinput · generic input · output · check report
335accepted exit 0 · 0.09274294300030306sPASSinput · generic input · output · check report
336accepted exit 0 · 0.058461340000576456sPASSinput · generic input · output · check report
337accepted exit 0 · 0.09618518200022663sPASSinput · generic input · output · check report
338accepted exit 0 · 0.12171225800011598sPASSinput · generic input · output · check report
339accepted exit 0 · 0.08585457699973631sPASSinput · generic input · output · check report
340accepted exit 0 · 0.11182980400008091sPASSinput · generic input · output · check report
341accepted exit 0 · 0.08397040599993488sPASSinput · generic input · output · check report
342accepted exit 0 · 0.050561556000502605sPASSinput · generic input · output · check report
343accepted exit 0 · 0.08756609300053242sFAILinput · generic input · output · check report
344accepted exit 0 · 0.08740123499956098sPASSinput · generic input · output · check report
345accepted exit 0 · 0.11803012400014268sPASSinput · generic input · output · check report
346accepted exit 0 · 0.07009085499976209sPASSinput · generic input · output · check report
347accepted exit 0 · 0.09116162300051656sPASSinput · generic input · output · check report
348accepted exit 0 · 0.09145403300044563sPASSinput · generic input · output · check report
349accepted exit 0 · 0.09046178300013707sPASSinput · generic input · output · check report
350accepted exit 0 · 0.09494421300041722sPASSinput · generic input · output · check report
351accepted exit 0 · 0.09582860299997265sPASSinput · generic input · output · check report
352accepted exit 0 · 0.10042327399969508sPASSinput · generic input · output · check report
353accepted exit 0 · 0.08947732100023131sPASSinput · generic input · output · check report
354accepted exit 0 · 0.10801081200042972sPASSinput · generic input · output · check report
355accepted exit 0 · 0.04289376100041409sPASSinput · generic input · output · check report
356accepted exit 0 · 0.04239009599950805sPASSinput · generic input · output · check report
357accepted exit 0 · 0.10936723099985102sPASSinput · generic input · output · check report
358accepted exit 0 · 0.08672276900051656sPASSinput · generic input · output · check report
359accepted exit 0 · 0.05986261799989734sPASSinput · generic input · output · check report
360accepted exit 0 · 0.08889475700016192sPASSinput · generic input · output · check report
361accepted exit 0 · 0.08838278999974136sPASSinput · generic input · output · check report
362accepted exit 0 · 0.08907006200024625sPASSinput · generic input · output · check report
363accepted exit 0 · 0.09272681600032229sFAILinput · generic input · output · check report
364accepted exit 0 · 0.09345852100068441sPASSinput · generic input · output · check report
365accepted exit 0 · 0.09338586800004123sPASSinput · generic input · output · check report
366accepted exit 0 · 0.07832565199987584sPASSinput · generic input · output · check report
367accepted exit 0 · 0.057639118999759376sPASSinput · generic input · output · check report
368accepted exit 0 · 0.06585438500042073sPASSinput · generic input · output · check report
369accepted exit 0 · 0.10197115499977372sPASSinput · generic input · output · check report
370accepted exit 0 · 0.10504604800007655sPASSinput · generic input · output · check report
371accepted exit 0 · 0.09916208000049664sPASSinput · generic input · output · check report
372accepted exit 0 · 0.09285529800035874sPASSinput · generic input · output · check report
373accepted exit 0 · 0.07242105700061074sPASSinput · generic input · output · check report
374accepted exit 0 · 0.0529011589997026sFAILinput · generic input · output · check report
375accepted exit 0 · 0.13591529799941782sPASSinput · generic input · output · check report
376accepted exit 0 · 0.09426686599999812sPASSinput · generic input · output · check report
377accepted exit 0 · 0.11631561500053067sPASSinput · generic input · output · check report
378accepted exit 0 · 0.10629232799965393sPASSinput · generic input · output · check report
379accepted exit 0 · 0.08586086699961015sPASSinput · generic input · output · check report
380accepted exit 0 · 0.09252622700023494sPASSinput · generic input · output · check report
381accepted exit 0 · 0.08992417599984037sPASSinput · generic input · output · check report
382accepted exit 0 · 0.14145584600009897sPASSinput · generic input · output · check report
383accepted exit 0 · 0.1147661490003884sPASSinput · generic input · output · check report
384accepted exit 0 · 0.09899502400003257sPASSinput · generic input · output · check report
385accepted exit 0 · 0.08971994900002755sPASSinput · generic input · output · check report
386accepted exit 0 · 0.0890789869999935sPASSinput · generic input · output · check report
387accepted exit 0 · 0.08946217700031411sPASSinput · generic input · output · check report
388accepted exit 0 · 0.05549331699967297sFAILinput · generic input · output · check report
389accepted exit 0 · 0.10529823000069882sPASSinput · generic input · output · check report
390accepted exit 0 · 0.09375685099985276sPASSinput · generic input · output · check report
391accepted exit 0 · 0.08764815700033068sPASSinput · generic input · output · check report
392accepted exit 0 · 0.10096115499982261sPASSinput · generic input · output · check report
393accepted exit 0 · 0.09940295100022922sPASSinput · generic input · output · check report
394accepted exit 0 · 0.09605646100044396sFAILinput · generic input · output · check report
395accepted exit 0 · 0.08564458199998626sPASSinput · generic input · output · check report
396accepted exit 0 · 0.08882640499996342sPASSinput · generic input · output · check report
397accepted exit 0 · 0.09316135300014139sPASSinput · generic input · output · check report
398accepted exit 0 · 0.08873569699971995sPASSinput · generic input · output · check report
399accepted exit 0 · 0.09267826799987233sPASSinput · generic input · output · check report
400accepted exit 0 · 0.08966806300031749sPASSinput · generic input · output · check report
401accepted exit 0 · 0.09848809300001449sPASSinput · generic input · output · check report
402accepted exit 0 · 0.11748188699948514sPASSinput · generic input · output · check report
403accepted exit 0 · 0.08077287400010391sPASSinput · generic input · output · check report
404accepted exit 0 · 0.057770351000726805sFAILinput · generic input · output · check report
405accepted exit 0 · 0.10459373499998037sPASSinput · generic input · output · check report
406accepted exit 0 · 0.06539340200015431sFAILinput · generic input · output · check report
407accepted exit 0 · 0.11012238300008903sPASSinput · generic input · output · check report
408accepted exit 0 · 0.11623356500058435sPASSinput · generic input · output · check report
409accepted exit 0 · 0.06747930199981056sPASSinput · generic input · output · check report
410accepted exit 0 · 0.12996485300027416sPASSinput · generic input · output · check report
411accepted exit 0 · 0.10223596900050325sPASSinput · generic input · output · check report
412accepted exit 0 · 0.05928457800018805sPASSinput · generic input · output · check report
413accepted exit 0 · 0.09746857399932196sPASSinput · generic input · output · check report
414accepted exit 0 · 0.057423741999627964sPASSinput · generic input · output · check report
415accepted exit 0 · 0.10283691000040562sPASSinput · generic input · output · check report
416accepted exit 0 · 0.0641496879998158sPASSinput · generic input · output · check report
417accepted exit 0 · 0.09267522999925859sPASSinput · generic input · output · check report
418accepted exit 0 · 0.09426179099955334sPASSinput · generic input · output · check report
419accepted exit 0 · 0.09326721300021745sPASSinput · generic input · output · check report
420accepted exit 0 · 0.09529916099927505sPASSinput · generic input · output · check report
421accepted exit 0 · 0.09375095199993666sPASSinput · generic input · output · check report
422accepted exit 0 · 0.09142033399984939sPASSinput · generic input · output · check report
423accepted exit 0 · 0.056726484000137134sPASSinput · generic input · output · check report
424accepted exit 0 · 0.09207157800028654sPASSinput · generic input · output · check report
425accepted exit 0 · 0.11949612199987314sPASSinput · generic input · output · check report
426accepted exit 0 · 0.10060696500022459sPASSinput · generic input · output · check report
427accepted exit 0 · 0.09541970899954322sPASSinput · generic input · output · check report
428accepted exit 0 · 0.10828574199967989sPASSinput · generic input · output · check report
429accepted exit 0 · 0.10650221100058843sPASSinput · generic input · output · check report
430accepted exit 0 · 0.10198229000070569sPASSinput · generic input · output · check report
431accepted exit 0 · 0.09452197399969009sPASSinput · generic input · output · check report
432accepted exit 0 · 0.06552793199989537sFAILinput · generic input · output · check report
433accepted exit 0 · 0.056205347000286565sPASSinput · generic input · output · check report
434accepted exit 0 · 0.06298357299965573sPASSinput · generic input · output · check report
435accepted exit 0 · 0.12120978600069066sPASSinput · generic input · output · check report
436accepted exit 0 · 0.09916540999984136sPASSinput · generic input · output · check report
437accepted exit 0 · 0.09736759300085396sPASSinput · generic input · output · check report
438accepted exit 0 · 0.08751031399970088sFAILinput · generic input · output · check report
439accepted exit 0 · 0.10021323999990273sPASSinput · generic input · output · check report
440accepted exit 0 · 0.11404652000055648sFAILinput · generic input · output · check report
441accepted exit 0 · 0.1202071950001482sPASSinput · generic input · output · check report
442accepted exit 0 · 0.10021212900028331sPASSinput · generic input · output · check report
443accepted exit 0 · 0.09990605400071217sPASSinput · generic input · output · check report
444accepted exit 0 · 0.11429256399969745sPASSinput · generic input · output · check report
445accepted exit 0 · 0.11629650000031688sPASSinput · generic input · output · check report
446accepted exit 0 · 0.11203802900035953sPASSinput · generic input · output · check report
447accepted exit 0 · 0.060076011999626644sPASSinput · generic input · output · check report
448accepted exit 0 · 0.09347338000043237sPASSinput · generic input · output · check report
449accepted exit 0 · 0.11369641599958413sPASSinput · generic input · output · check report
450accepted exit 0 · 0.10717908100014029sPASSinput · generic input · output · check report
451accepted exit 0 · 0.09137862599982327sPASSinput · generic input · output · check report
452accepted exit 0 · 0.10300680300042586sPASSinput · generic input · output · check report
453accepted exit 0 · 0.0730706280000959sPASSinput · generic input · output · check report
454accepted exit 0 · 0.05606868399991072sPASSinput · generic input · output · check report
455accepted exit 0 · 0.10129552800026431sPASSinput · generic input · output · check report
456accepted exit 0 · 0.10827967200020794sPASSinput · generic input · output · check report
457accepted exit 0 · 0.09390210800029308sFAILinput · generic input · output · check report
458accepted exit 0 · 0.10007575800045743sPASSinput · generic input · output · check report
459accepted exit 0 · 0.09392147600010503sPASSinput · generic input · output · check report
460accepted exit 0 · 0.05991911000000982sPASSinput · generic input · output · check report
461accepted exit 0 · 0.09736525600055757sPASSinput · generic input · output · check report
462accepted exit 0 · 0.09354086099938286sFAILinput · generic input · output · check report
463accepted exit 0 · 0.08997290799925395sPASSinput · generic input · output · check report
464accepted exit 0 · 0.05896424599995953sPASSinput · generic input · output · check report
465accepted exit 0 · 0.10139547000017046sPASSinput · generic input · output · check report
466accepted exit 0 · 0.09944087700023374sPASSinput · generic input · output · check report
467accepted exit 0 · 0.05715815300027316sFAILinput · generic input · output · check report
468accepted exit 0 · 0.1000737679996746sPASSinput · generic input · output · check report
469accepted exit 0 · 0.09983559000011155sPASSinput · generic input · output · check report
470accepted exit 0 · 0.05863256399970851sPASSinput · generic input · output · check report
471accepted exit 0 · 0.09152646899929096sPASSinput · generic input · output · check report
472accepted exit 0 · 0.09510174700062635sPASSinput · generic input · output · check report
473accepted exit 0 · 0.0992211259999749sPASSinput · generic input · output · check report
474accepted exit 0 · 0.06117735600037122sPASSinput · generic input · output · check report
475accepted exit 0 · 0.09525440400011576sPASSinput · generic input · output · check report
476accepted exit 0 · 0.06868043499980558sPASSinput · generic input · output · check report
477accepted exit 0 · 0.09721710299982078sFAILinput · generic input · output · check report
478accepted exit 0 · 0.07890649900036806sPASSinput · generic input · output · check report
479accepted exit 0 · 0.10213771800044924sPASSinput · generic input · output · check report
480accepted exit 0 · 0.09708118699927581sPASSinput · generic input · output · check report
481accepted exit 0 · 0.12800645500010432sPASSinput · generic input · output · check report
482accepted exit 0 · 0.11502993300018716sPASSinput · generic input · output · check report
483accepted exit 0 · 0.054027262999625236sPASSinput · generic input · output · check report
484accepted exit 0 · 0.09966807000000699sPASSinput · generic input · output · check report
485accepted exit 0 · 0.06341358000008768sPASSinput · generic input · output · check report
486accepted exit 0 · 0.12157620400012092sPASSinput · generic input · output · check report
487accepted exit 0 · 0.0640499560004173sPASSinput · generic input · output · check report
488accepted exit 0 · 0.1030933570000343sPASSinput · generic input · output · check report
489accepted exit 0 · 0.09713040299993736sPASSinput · generic input · output · check report
490accepted exit 0 · 0.09127051299947198sPASSinput · generic input · output · check report
491accepted exit 0 · 0.10157248999985313sPASSinput · generic input · output · check report
492accepted exit 0 · 0.12044639299983828sPASSinput · generic input · output · check report
493accepted exit 0 · 0.07180716199945891sPASSinput · generic input · output · check report
494accepted exit 0 · 0.09661544600021443sPASSinput · generic input · output · check report
495accepted exit 0 · 0.10632519099999627sPASSinput · generic input · output · check report
496accepted exit 0 · 0.09680453300006775sPASSinput · generic input · output · check report
497accepted exit 0 · 0.09404927499963378sPASSinput · generic input · output · check report
498accepted exit 0 · 0.054195722000258684sPASSinput · generic input · output · check report
499accepted exit 0 · 0.08517970100001548sFAILinput · generic input · output · check report
500accepted exit 0 · 0.0948123600001054sPASSinput · generic input · output · check report
501accepted exit 0 · 0.10384933499972249sPASSinput · generic input · output · check report
502accepted exit 0 · 0.105188272000305sPASSinput · generic input · output · check report
503accepted exit 0 · 0.10054929299985815sFAILinput · generic input · output · check report
504accepted exit 0 · 0.0600950379994174sPASSinput · generic input · output · check report
505accepted exit 0 · 0.09884087199952774sPASSinput · generic input · output · check report
506accepted exit 0 · 0.06265629300014552sPASSinput · generic input · output · check report
507accepted exit 0 · 0.060345620000589406sPASSinput · generic input · output · check report
508accepted exit 0 · 0.09766911000042455sPASSinput · generic input · output · check report
509accepted exit 0 · 0.11705002700000477sPASSinput · generic input · output · check report
510accepted exit 0 · 0.05501271699995414sPASSinput · generic input · output · check report
511accepted exit 0 · 0.13127100500059896sPASSinput · generic input · output · check report
512accepted exit 0 · 0.08567406499969366sPASSinput · generic input · output · check report
513accepted exit 0 · 0.09896279200074787sPASSinput · generic input · output · check report
514accepted exit 0 · 0.10476018699955603sPASSinput · generic input · output · check report
515accepted exit 0 · 0.10478643700025714sPASSinput · generic input · output · check report
516accepted exit 0 · 0.10825899400060734sPASSinput · generic input · output · check report
517accepted exit 0 · 0.06586616599997797sPASSinput · generic input · output · check report
518accepted exit 0 · 0.09482530399964162sPASSinput · generic input · output · check report
519accepted exit 0 · 0.09657874799995625sPASSinput · generic input · output · check report
520accepted exit 0 · 0.09861939599977632sPASSinput · generic input · output · check report
521accepted exit 0 · 0.1016448729997137sPASSinput · generic input · output · check report
522accepted exit 0 · 0.09612557800028299sPASSinput · generic input · output · check report
523accepted exit 0 · 0.1037097670005096sPASSinput · generic input · output · check report
524accepted exit 0 · 0.10569096200015338sPASSinput · generic input · output · check report
525accepted exit 0 · 0.111520389999896sPASSinput · generic input · output · check report
526accepted exit 0 · 0.09655243999986851sPASSinput · generic input · output · check report
527accepted exit 0 · 0.09266407300037827sPASSinput · generic input · output · check report
528accepted exit 0 · 0.10534020799968857sPASSinput · generic input · output · check report
529accepted exit 0 · 0.10090247800053476sPASSinput · generic input · output · check report
530accepted exit 0 · 0.09859781800059864sPASSinput · generic input · output · check report
531accepted exit 0 · 0.09504865599956247sPASSinput · generic input · output · check report
532accepted exit 0 · 0.05195841000022483sPASSinput · generic input · output · check report
533accepted exit 0 · 0.11429678900003637sPASSinput · generic input · output · check report
534accepted exit 0 · 0.05196528499982378sPASSinput · generic input · output · check report
535accepted exit 0 · 0.12943586300025345sPASSinput · generic input · output · check report
536accepted exit 0 · 0.10148701099933533sFAILinput · generic input · output · check report
537accepted exit 0 · 0.08747801099980279sPASSinput · generic input · output · check report
538accepted exit 0 · 0.10660506899967004sPASSinput · generic input · output · check report
539accepted exit 0 · 0.05824442300036026sPASSinput · generic input · output · check report
540accepted exit 0 · 0.09551628600002005sPASSinput · generic input · output · check report
541accepted exit 0 · 0.05353527099941857sFAILinput · generic input · output · check report
542accepted exit 0 · 0.09552208599961887sFAILinput · generic input · output · check report
543accepted exit 0 · 0.1258411310000156sPASSinput · generic input · output · check report
544accepted exit 0 · 0.13048783799968078sPASSinput · generic input · output · check report
545accepted exit 0 · 0.10662899900034972sPASSinput · generic input · output · check report
546accepted exit 0 · 0.09857818100044824sPASSinput · generic input · output · check report
547accepted exit 0 · 0.10504577299980156sPASSinput · generic input · output · check report
548accepted exit 0 · 0.09567775699997583sPASSinput · generic input · output · check report
549accepted exit 0 · 0.09922220400039805sPASSinput · generic input · output · check report
550accepted exit 0 · 0.09795616700012033sPASSinput · generic input · output · check report
551accepted exit 0 · 0.1016467620002004sPASSinput · generic input · output · check report
552accepted exit 0 · 0.09947385500072414sPASSinput · generic input · output · check report
553accepted exit 0 · 0.06432109900015348sFAILinput · generic input · output · check report
554accepted exit 0 · 0.09626553799989779sFAILinput · generic input · output · check report
555accepted exit 0 · 0.09644108600059553sPASSinput · generic input · output · check report
556accepted exit 0 · 0.10846454199963773sPASSinput · generic input · output · check report
557accepted exit 0 · 0.09811122200062528sPASSinput · generic input · output · check report
558accepted exit 0 · 0.107077659999959sPASSinput · generic input · output · check report
559accepted exit 0 · 0.05321452499993029sPASSinput · generic input · output · check report
560accepted exit 0 · 0.09756909499992616sPASSinput · generic input · output · check report
561accepted exit 0 · 0.09574347700072394sPASSinput · generic input · output · check report
562accepted exit 0 · 0.09454909800024325sPASSinput · generic input · output · check report
563accepted exit 0 · 0.1029050550005195sPASSinput · generic input · output · check report
564accepted exit 0 · 0.10241280599984748sPASSinput · generic input · output · check report
565accepted exit 0 · 0.10155243900044297sPASSinput · generic input · output · check report
566accepted exit 0 · 0.07241534599961597sPASSinput · generic input · output · check report
567accepted exit 0 · 0.09845661999952426sPASSinput · generic input · output · check report
568accepted exit 0 · 0.09817841699987184sPASSinput · generic input · output · check report
569accepted exit 0 · 0.05560582899943256sPASSinput · generic input · output · check report
570accepted exit 0 · 0.09226884300005622sPASSinput · generic input · output · check report
571accepted exit 0 · 0.09458094100045855sPASSinput · generic input · output · check report
572accepted exit 0 · 0.10473840899976494sPASSinput · generic input · output · check report
573accepted exit 0 · 0.0981039360003706sPASSinput · generic input · output · check report
574accepted exit 0 · 0.09665894199952163sPASSinput · generic input · output · check report
575accepted exit 0 · 0.09395149600004515sPASSinput · generic input · output · check report
576accepted exit 0 · 0.10751284199977817sPASSinput · generic input · output · check report
577accepted exit 0 · 0.09085899500041705sPASSinput · generic input · output · check report
578accepted exit 0 · 0.09499928699915472sPASSinput · generic input · output · check report
579accepted exit 0 · 0.10591989699969417sPASSinput · generic input · output · check report
580accepted exit 0 · 0.09724304800056416sPASSinput · generic input · output · check report
581accepted exit 0 · 0.11855672300043807sPASSinput · generic input · output · check report
582accepted exit 0 · 0.09935256599965214sPASSinput · generic input · output · check report
583accepted exit 0 · 0.0980857209997339sPASSinput · generic input · output · check report
584accepted exit 0 · 0.10609665499941912sPASSinput · generic input · output · check report
585accepted exit 0 · 0.10152061899952969sPASSinput · generic input · output · check report
586accepted exit 0 · 0.09935568900073122sPASSinput · generic input · output · check report
587accepted exit 0 · 0.09667373299998872sPASSinput · generic input · output · check report
588accepted exit 0 · 0.10334131000035995sPASSinput · generic input · output · check report
589accepted exit 0 · 0.10189382299995486sPASSinput · generic input · output · check report
590accepted exit 0 · 0.10940595899955952sPASSinput · generic input · output · check report
591accepted exit 0 · 0.06453130099998816sPASSinput · generic input · output · check report
592accepted exit 0 · 0.09305482299987489sPASSinput · generic input · output · check report
593accepted exit 0 · 0.1017592379994312sPASSinput · generic input · output · check report
594accepted exit 0 · 0.07814738500019303sPASSinput · generic input · output · check report
595accepted exit 0 · 0.09927833900019323sPASSinput · generic input · output · check report
596accepted exit 0 · 0.11149920200023189sPASSinput · generic input · output · check report
597accepted exit 0 · 0.11196997699971689sPASSinput · generic input · output · check report
598accepted exit 0 · 0.10616367299917329sPASSinput · generic input · output · check report
599accepted exit 0 · 0.09114313800000673sFAILinput · generic input · output · check report
600accepted exit 0 · 0.13650638699982665sPASSinput · generic input · output · check report
601accepted exit 0 · 0.15126795299966034sPASSinput · generic input · output · check report
602accepted exit 0 · 0.09595961500053818sPASSinput · generic input · output · check report
603accepted exit 0 · 0.05823889800012694sPASSinput · generic input · output · check report
604accepted exit 0 · 0.0978880870006833sPASSinput · generic input · output · check report
605accepted exit 0 · 0.056028051999419404sPASSinput · generic input · output · check report
606accepted exit 0 · 0.09946162800042657sPASSinput · generic input · output · check report
607accepted exit 0 · 0.09686792200045602sPASSinput · generic input · output · check report
608accepted exit 0 · 0.0958023540006252sPASSinput · generic input · output · check report
609accepted exit 0 · 0.10303552899949864sPASSinput · generic input · output · check report
610accepted exit 0 · 0.09724527100024716sPASSinput · generic input · output · check report
611accepted exit 0 · 0.09402564499941946sFAILinput · generic input · output · check report
612accepted exit 0 · 0.10000192200004676sPASSinput · generic input · output · check report
613accepted exit 0 · 0.09744657700048265sPASSinput · generic input · output · check report
614accepted exit 0 · 0.05499157499980356sFAILinput · generic input · output · check report
615accepted exit 0 · 0.09920519900060754sPASSinput · generic input · output · check report
616accepted exit 0 · 0.05830932400021993sPASSinput · generic input · output · check report
617accepted exit 0 · 0.0594486500003768sFAILinput · generic input · output · check report
618accepted exit 0 · 0.1301719260000027sPASSinput · generic input · output · check report
619accepted exit 0 · 0.11132105700016837sPASSinput · generic input · output · check report
620accepted exit 0 · 0.060419928000555956sFAILinput · generic input · output · check report
621accepted exit 0 · 0.06119715200020437sPASSinput · generic input · output · check report
622accepted exit 0 · 0.10927426000034757sPASSinput · generic input · output · check report
623accepted exit 0 · 0.09925216200008435sPASSinput · generic input · output · check report
624accepted exit 0 · 0.10326147199975821sPASSinput · generic input · output · check report
625accepted exit 0 · 0.09668737800075178sPASSinput · generic input · output · check report
626accepted exit 0 · 0.09294923700053914sPASSinput · generic input · output · check report
627accepted exit 0 · 0.05581624399928842sPASSinput · generic input · output · check report
628accepted exit 0 · 0.10217628600003081sPASSinput · generic input · output · check report
629accepted exit 0 · 0.1015067940006702sPASSinput · generic input · output · check report
630accepted exit 0 · 0.05856540100012353sFAILinput · generic input · output · check report
631accepted exit 0 · 0.10261525999976584sPASSinput · generic input · output · check report
632accepted exit 0 · 0.060433970000303816sPASSinput · generic input · output · check report
633accepted exit 0 · 0.0961057679996884sPASSinput · generic input · output · check report
634accepted exit 0 · 0.09842784100055724sPASSinput · generic input · output · check report
635accepted exit 0 · 0.061582611000631005sPASSinput · generic input · output · check report
636accepted exit 0 · 0.10134080599982553sPASSinput · generic input · output · check report
637accepted exit 0 · 0.09960425400004169sPASSinput · generic input · output · check report
638accepted exit 0 · 0.09952225899996847sPASSinput · generic input · output · check report
639accepted exit 0 · 0.09578699299981963sPASSinput · generic input · output · check report
640accepted exit 0 · 0.058070884999324335sPASSinput · generic input · output · check report
641accepted exit 0 · 0.09295063900026435sPASSinput · generic input · output · check report
642accepted exit 0 · 0.09595798299960734sFAILinput · generic input · output · check report
643accepted exit 0 · 0.08728056900054071sPASSinput · generic input · output · check report
644accepted exit 0 · 0.054940928000178246sPASSinput · generic input · output · check report
645accepted exit 0 · 0.1086954219999825sPASSinput · generic input · output · check report
646accepted exit 0 · 0.05721091299983527sPASSinput · generic input · output · check report
647accepted exit 0 · 0.06128524700034177sPASSinput · generic input · output · check report
648accepted exit 0 · 0.06803486799981329sPASSinput · generic input · output · check report
649accepted exit 0 · 0.14097269000012602sPASSinput · generic input · output · check report
650accepted exit 0 · 0.1202437669999199sPASSinput · generic input · output · check report
651accepted exit 0 · 0.08554476500012242sPASSinput · generic input · output · check report
652accepted exit 0 · 0.056699015999583935sPASSinput · generic input · output · check report
653accepted exit 0 · 0.10113319299944123sPASSinput · generic input · output · check report
654accepted exit 0 · 0.09789824899962696sPASSinput · generic input · output · check report
655accepted exit 0 · 0.09359909199974936sPASSinput · generic input · output · check report
656accepted exit 0 · 0.10625628999969194sPASSinput · generic input · output · check report
657accepted exit 0 · 0.09765890699964075sPASSinput · generic input · output · check report
658accepted exit 0 · 0.09576448799998616sPASSinput · generic input · output · check report
659accepted exit 0 · 0.10579304500060971sPASSinput · generic input · output · check report
660accepted exit 0 · 0.05523240200000146sPASSinput · generic input · output · check report
661accepted exit 0 · 0.09428201399987302sPASSinput · generic input · output · check report
662accepted exit 0 · 0.09548479899967788sPASSinput · generic input · output · check report
663accepted exit 0 · 0.047451416000512836sPASSinput · generic input · output · check report
664accepted exit 0 · 0.09476886899938108sPASSinput · generic input · output · check report
665accepted exit 0 · 0.08947414700014633sPASSinput · generic input · output · check report
666accepted exit 0 · 0.0533323499994367sFAILinput · generic input · output · check report
667accepted exit 0 · 0.07805914800064784sPASSinput · generic input · output · check report
668accepted exit 0 · 0.09751836500072386sPASSinput · generic input · output · check report
669accepted exit 0 · 0.05553303499982576sPASSinput · generic input · output · check report
670accepted exit 0 · 0.13261739500012482sPASSinput · generic input · output · check report
671accepted exit 0 · 0.10049746400000004sPASSinput · generic input · output · check report
672accepted exit 0 · 0.10729928300042957sPASSinput · generic input · output · check report
673accepted exit 0 · 0.09610587199949805sPASSinput · generic input · output · check report
674accepted exit 0 · 0.0943783180000537sPASSinput · generic input · output · check report
675accepted exit 0 · 0.09866964899993036sPASSinput · generic input · output · check report
676accepted exit 0 · 0.058415630999661516sPASSinput · generic input · output · check report
677accepted exit 0 · 0.09858837499996298sPASSinput · generic input · output · check report
678accepted exit 0 · 0.10165330600011657sPASSinput · generic input · output · check report
679accepted exit 0 · 0.05301141200015991sFAILinput · generic input · output · check report
680accepted exit 0 · 0.054489596000166785sPASSinput · generic input · output · check report
681accepted exit 0 · 0.09894745899964619sPASSinput · generic input · output · check report
682accepted exit 0 · 0.09399813799973344sPASSinput · generic input · output · check report
683accepted exit 0 · 0.10368079199997737sPASSinput · generic input · output · check report
684accepted exit 0 · 0.10353592899991781sPASSinput · generic input · output · check report
685accepted exit 0 · 0.10913138500018249sPASSinput · generic input · output · check report
686accepted exit 0 · 0.058957656999155006sFAILinput · generic input · output · check report
687accepted exit 0 · 0.10968944400065084sPASSinput · generic input · output · check report
688accepted exit 0 · 0.09415789500053506sPASSinput · generic input · output · check report
689accepted exit 0 · 0.0960025680005856sPASSinput · generic input · output · check report
690accepted exit 0 · 0.05363888000010775sPASSinput · generic input · output · check report
691accepted exit 0 · 0.09652821700001368sPASSinput · generic input · output · check report
692accepted exit 0 · 0.09760206900045887sPASSinput · generic input · output · check report
693accepted exit 0 · 0.0526822980000361sPASSinput · generic input · output · check report
694accepted exit 0 · 0.09497515099974407sPASSinput · generic input · output · check report
695accepted exit 0 · 0.09764737299974513sPASSinput · generic input · output · check report
696accepted exit 0 · 0.0737768099997993sPASSinput · generic input · output · check report
697accepted exit 0 · 0.0781256600002962sPASSinput · generic input · output · check report
698accepted exit 0 · 0.06277465099992696sPASSinput · generic input · output · check report
699accepted exit 0 · 0.09433042499949806sPASSinput · generic input · output · check report
700accepted exit 0 · 0.10872503999962646sPASSinput · generic input · output · check report
701accepted exit 0 · 0.0539759570001479sPASSinput · generic input · output · check report
702accepted exit 0 · 0.09077150399934908sPASSinput · generic input · output · check report
703accepted exit 0 · 0.09100643599958858sPASSinput · generic input · output · check report
704accepted exit 0 · 0.09641531300076167sPASSinput · generic input · output · check report
705accepted exit 0 · 0.08989009900142264sPASSinput · generic input · output · check report
706accepted exit 0 · 0.09538779499962402sPASSinput · generic input · output · check report
707accepted exit 0 · 0.7091196879991912sPASSinput · generic input · output · check report
708accepted exit 0 · 0.103817703000459sPASSinput · generic input · output · check report
709accepted exit 0 · 0.09872401699976763sFAILinput · generic input · output · check report
710accepted exit 0 · 0.05411300600098912sPASSinput · generic input · output · check report
711accepted exit 0 · 0.056552568001279724sFAILinput · generic input · output · check report
712accepted exit 0 · 0.09824712900081067sPASSinput · generic input · output · check report
713accepted exit 0 · 0.11037117100022442sPASSinput · generic input · output · check report
714accepted exit 0 · 0.09639801699995587sPASSinput · generic input · output · check report
715accepted exit 0 · 0.10315267599980871sPASSinput · generic input · output · check report
716accepted exit 0 · 0.09121913900162326sPASSinput · generic input · output · check report
717accepted exit 0 · 0.0988576390009257sPASSinput · generic input · output · check report
718accepted exit 0 · 0.08980198400058725sPASSinput · generic input · output · check report
719accepted exit 0 · 0.09745128500071587sPASSinput · generic input · output · check report
720accepted exit 0 · 0.09476434200041695sPASSinput · generic input · output · check report
721accepted exit 0 · 0.05460725500051922sFAILinput · generic input · output · check report
722accepted exit 0 · 0.09664603599958355sPASSinput · generic input · output · check report
723accepted exit 0 · 0.10736598000039521sPASSinput · generic input · output · check report
724accepted exit 0 · 0.10002131100009137sPASSinput · generic input · output · check report
725accepted exit 0 · 0.05131499500021164sPASSinput · generic input · output · check report
726accepted exit 0 · 0.09122257200033346sFAILinput · generic input · output · check report
727accepted exit 0 · 0.08864322299996275sPASSinput · generic input · output · check report
728accepted exit 0 · 0.0900164760005282sPASSinput · generic input · output · check report
729accepted exit 0 · 0.09308243099985702sPASSinput · generic input · output · check report
730accepted exit 0 · 0.04939133199877688sPASSinput · generic input · output · check report
731accepted exit 0 · 0.10316890399917611sFAILinput · generic input · output · check report
732accepted exit 0 · 0.08368837499983783sPASSinput · generic input · output · check report
733accepted exit 0 · 0.09713797699987481sPASSinput · generic input · output · check report
734accepted exit 0 · 0.1008909299998777sPASSinput · generic input · output · check report
735accepted exit 0 · 0.09611928799859015sPASSinput · generic input · output · check report
736accepted exit 0 · 0.0991786590002448sPASSinput · generic input · output · check report
737accepted exit 0 · 0.09964650000074471sPASSinput · generic input · output · check report
738accepted exit 0 · 0.09570637100114254sPASSinput · generic input · output · check report
739accepted exit 0 · 0.10518122699977539sPASSinput · generic input · output · check report
740accepted exit 0 · 0.09839172099964344sPASSinput · generic input · output · check report
741accepted exit 0 · 0.051721503001317615sPASSinput · generic input · output · check report
742accepted exit 0 · 0.09511954099980358sPASSinput · generic input · output · check report
743accepted exit 0 · 0.10215466599947831sPASSinput · generic input · output · check report
744accepted exit 0 · 0.10870234899994102sPASSinput · generic input · output · check report
745accepted exit 0 · 0.07297935700080416sPASSinput · generic input · output · check report
746accepted exit 0 · 0.10190994599906844sPASSinput · generic input · output · check report
747accepted exit 0 · 0.09173881899914704sPASSinput · generic input · output · check report
748accepted exit 0 · 0.09844143600093958sPASSinput · generic input · output · check report
749accepted exit 0 · 0.06289988100070332sPASSinput · generic input · output · check report
750accepted exit 0 · 0.093529296998895sPASSinput · generic input · output · check report
751accepted exit 0 · 0.049355509001543396sPASSinput · generic input · output · check report
752accepted exit 0 · 0.09607320000031905sPASSinput · generic input · output · check report
753accepted exit 0 · 0.09413357199991879sPASSinput · generic input · output · check report
754accepted exit 0 · 0.05272018400137313sPASSinput · generic input · output · check report
755accepted exit 0 · 0.08786992199929955sPASSinput · generic input · output · check report
756accepted exit 0 · 0.09135646899994754sFAILinput · generic input · output · check report
757accepted exit 0 · 0.10051053500137641sPASSinput · generic input · output · check report
758accepted exit 0 · 0.09593306199894869sPASSinput · generic input · output · check report
759accepted exit 0 · 0.06190469499961182sPASSinput · generic input · output · check report
760accepted exit 0 · 0.09359720399879734sPASSinput · generic input · output · check report
761accepted exit 0 · 0.09483479099981196sPASSinput · generic input · output · check report
762accepted exit 0 · 0.09926398800052993sPASSinput · generic input · output · check report
763accepted exit 0 · 0.05712050799957069sPASSinput · generic input · output · check report
764accepted exit 0 · 0.09212656800082186sPASSinput · generic input · output · check report
765accepted exit 0 · 0.10130312500041327sFAILinput · generic input · output · check report
766accepted exit 0 · 0.0981879070004652sPASSinput · generic input · output · check report
767accepted exit 0 · 0.09373347700056911sPASSinput · generic input · output · check report
768accepted exit 0 · 0.09754919500119286sPASSinput · generic input · output · check report
769accepted exit 0 · 0.06049416600035329sFAILinput · generic input · output · check report
770accepted exit 0 · 0.10070042400002421sFAILinput · generic input · output · check report
771accepted exit 0 · 0.09813572599887266sPASSinput · generic input · output · check report
772accepted exit 0 · 0.05638971600092191sPASSinput · generic input · output · check report
773accepted exit 0 · 0.09519856200131471sPASSinput · generic input · output · check report
774accepted exit 0 · 0.0909916719992907sPASSinput · generic input · output · check report
775accepted exit 0 · 0.09392706499966152sPASSinput · generic input · output · check report
776accepted exit 0 · 0.05169960999955947sPASSinput · generic input · output · check report
777accepted exit 0 · 0.05109779200029152sPASSinput · generic input · output · check report
778accepted exit 0 · 0.0991666299996723sPASSinput · generic input · output · check report
779accepted exit 0 · 0.09399151999969035sPASSinput · generic input · output · check report
780accepted exit 0 · 0.09618489199965552sPASSinput · generic input · output · check report
781accepted exit 0 · 0.08037064199925226sFAILinput · generic input · output · check report
782accepted exit 0 · 0.11978025499956857sFAILinput · generic input · output · check report
783accepted exit 0 · 0.07997765599975537sPASSinput · generic input · output · check report
784accepted exit 0 · 0.05856191600105376sPASSinput · generic input · output · check report
785accepted exit 0 · 0.09218794999833335sPASSinput · generic input · output · check report
786accepted exit 0 · 0.10418187599861994sPASSinput · generic input · output · check report
787accepted exit 0 · 0.09958489000018744sPASSinput · generic input · output · check report
788accepted exit 0 · 0.10631776799891668sPASSinput · generic input · output · check report
789accepted exit 0 · 0.0918941879990598sPASSinput · generic input · output · check report
790accepted exit 0 · 0.10282663799989677sPASSinput · generic input · output · check report
791accepted exit 0 · 0.052827564999461174sPASSinput · generic input · output · check report
792accepted exit 0 · 0.05701504399985424sPASSinput · generic input · output · check report
793accepted exit 0 · 0.09580154099967331sPASSinput · generic input · output · check report
794accepted exit 0 · 0.05787529700137384sPASSinput · generic input · output · check report
795accepted exit 0 · 0.0667095930002688sFAILinput · generic input · output · check report
796accepted exit 0 · 0.10527933800040046sPASSinput · generic input · output · check report
797accepted exit 0 · 0.06290823999916029sPASSinput · generic input · output · check report
798accepted exit 0 · 0.10008265800024674sPASSinput · generic input · output · check report
799accepted exit 0 · 0.10635047499999928sPASSinput · generic input · output · check report
800accepted exit 0 · 0.096904549998726sPASSinput · generic input · output · check report
801accepted exit 0 · 0.09744654099995387sPASSinput · generic input · output · check report
802accepted exit 0 · 0.10733924000123807sFAILinput · generic input · output · check report
803accepted exit 0 · 0.09588827500010666sPASSinput · generic input · output · check report
804accepted exit 0 · 0.09178111699839064sPASSinput · generic input · output · check report
805accepted exit 0 · 0.11754873400059296sPASSinput · generic input · output · check report
806accepted exit 0 · 0.10050124500048696sPASSinput · generic input · output · check report
807accepted exit 0 · 0.0958608130003995sPASSinput · generic input · output · check report
808accepted exit 0 · 0.09270048899998073sPASSinput · generic input · output · check report
809accepted exit 0 · 0.05934112899922184sPASSinput · generic input · output · check report
810accepted exit 0 · 0.05389799399927142sPASSinput · generic input · output · check report
811accepted exit 0 · 0.05469130900019081sPASSinput · generic input · output · check report
812accepted exit 0 · 0.0768399060016236sPASSinput · generic input · output · check report
813accepted exit 0 · 0.10687099499955366sPASSinput · generic input · output · check report
814accepted exit 0 · 0.10076658400066663sPASSinput · generic input · output · check report
815accepted exit 0 · 0.10916434600039793sPASSinput · generic input · output · check report
816accepted exit 0 · 0.11097560700000031sPASSinput · generic input · output · check report
817accepted exit 0 · 0.10866626700044435sFAILinput · generic input · output · check report
818accepted exit 0 · 0.1222115959990333sPASSinput · generic input · output · check report
819accepted exit 0 · 0.09744198999942455sPASSinput · generic input · output · check report
820accepted exit 0 · 0.06469502500112867sFAILinput · generic input · output · check report
821accepted exit 0 · 0.09624926200012851sPASSinput · generic input · output · check report
822accepted exit 0 · 0.100537139998778sPASSinput · generic input · output · check report
823accepted exit 0 · 0.09414335399924312sPASSinput · generic input · output · check report
824accepted exit 0 · 0.09503076700093516sPASSinput · generic input · output · check report
825accepted exit 0 · 0.0894252760008385sFAILinput · generic input · output · check report
826accepted exit 0 · 0.09677008300059242sPASSinput · generic input · output · check report
827accepted exit 0 · 0.09581172800062632sPASSinput · generic input · output · check report
828accepted exit 0 · 0.09365695800079266sPASSinput · generic input · output · check report
829accepted exit 0 · 0.09601673299948743sPASSinput · generic input · output · check report
830accepted exit 0 · 0.09745690599993395sPASSinput · generic input · output · check report
831accepted exit 0 · 0.0919171589994221sPASSinput · generic input · output · check report
832accepted exit 0 · 0.05384203699941281sPASSinput · generic input · output · check report
833accepted exit 0 · 0.09078453599977365sPASSinput · generic input · output · check report
834accepted exit 0 · 0.09373719799987157sPASSinput · generic input · output · check report
835accepted exit 0 · 0.0930792780000047sPASSinput · generic input · output · check report
836accepted exit 0 · 0.09219050399951811sPASSinput · generic input · output · check report
837accepted exit 0 · 0.05189351599983638sPASSinput · generic input · output · check report
838accepted exit 0 · 0.09451565400013351sPASSinput · generic input · output · check report
839accepted exit 0 · 0.0951442980003776sPASSinput · generic input · output · check report
840accepted exit 0 · 0.09589232800135505sPASSinput · generic input · output · check report
841accepted exit 0 · 0.05317499900047551sPASSinput · generic input · output · check report
842accepted exit 0 · 0.10293392400126322sPASSinput · generic input · output · check report
843accepted exit 0 · 0.05150100600076257sPASSinput · generic input · output · check report
844accepted exit 0 · 0.05280817799939541sPASSinput · generic input · output · check report
845accepted exit 0 · 0.09086190000016359sPASSinput · generic input · output · check report
846accepted exit 0 · 0.0870508490006614sFAILinput · generic input · output · check report
847accepted exit 0 · 0.10041992699916591sPASSinput · generic input · output · check report
848accepted exit 0 · 0.09093049799957953sPASSinput · generic input · output · check report
849accepted exit 0 · 0.10090722400127561sPASSinput · generic input · output · check report
850accepted exit 0 · 0.12902141899940034sPASSinput · generic input · output · check report
851accepted exit 0 · 0.09374558200033789sPASSinput · generic input · output · check report
852accepted exit 0 · 0.07425995100129512sFAILinput · generic input · output · check report
853accepted exit 0 · 0.09801526500086766sPASSinput · generic input · output · check report
854accepted exit 0 · 0.09150259600028221sFAILinput · generic input · output · check report
855accepted exit 0 · 0.09322978900127055sPASSinput · generic input · output · check report
856accepted exit 0 · 0.09447615799945197sPASSinput · generic input · output · check report
857accepted exit 0 · 0.096856211001068sPASSinput · generic input · output · check report
858accepted exit 0 · 0.09599907700066979sPASSinput · generic input · output · check report
859accepted exit 0 · 0.10045613300098921sPASSinput · generic input · output · check report
860accepted exit 0 · 0.09951916799946048sPASSinput · generic input · output · check report
861accepted exit 0 · 0.09356945800027461sPASSinput · generic input · output · check report
862accepted exit 0 · 0.09552162600084557sPASSinput · generic input · output · check report
863accepted exit 0 · 0.09596587200030626sPASSinput · generic input · output · check report
864accepted exit 0 · 0.09688720899976033sPASSinput · generic input · output · check report
865accepted exit 0 · 0.06488983700000972sFAILinput · generic input · output · check report
866accepted exit 0 · 0.09691379799915012sPASSinput · generic input · output · check report
867accepted exit 0 · 0.09117834300013783sPASSinput · generic input · output · check report
868accepted exit 0 · 0.08991850999882445sPASSinput · generic input · output · check report
869accepted exit 0 · 0.09346899899901473sPASSinput · generic input · output · check report
870accepted exit 0 · 0.059502788999452605sPASSinput · generic input · output · check report
871accepted exit 0 · 0.09541764999994484sPASSinput · generic input · output · check report
872accepted exit 0 · 0.05574951800008421sPASSinput · generic input · output · check report
873accepted exit 0 · 0.05544670699964627sPASSinput · generic input · output · check report
874accepted exit 0 · 0.09109285100021225sPASSinput · generic input · output · check report
875accepted exit 0 · 0.09802076300002227sPASSinput · generic input · output · check report
876accepted exit 0 · 0.11562994600171805sPASSinput · generic input · output · check report
877accepted exit 0 · 0.11329809299968474sPASSinput · generic input · output · check report
878accepted exit 0 · 0.09473645500111161sPASSinput · generic input · output · check report
879accepted exit 0 · 0.0840395230006834sPASSinput · generic input · output · check report
880accepted exit 0 · 0.09294303600108833sPASSinput · generic input · output · check report
881accepted exit 0 · 0.09561491000022215sPASSinput · generic input · output · check report
882accepted exit 0 · 0.10577260599893634sPASSinput · generic input · output · check report
883accepted exit 0 · 0.09656255499976396sPASSinput · generic input · output · check report
884accepted exit 0 · 0.11600903900034609sPASSinput · generic input · output · check report
885accepted exit 0 · 0.138061474001006sPASSinput · generic input · output · check report
886accepted exit 0 · 0.05936354499863228sPASSinput · generic input · output · check report
887accepted exit 0 · 0.11085211400131811sPASSinput · generic input · output · check report
888accepted exit 0 · 0.0820188749985391sPASSinput · generic input · output · check report
889accepted exit 0 · 0.09493581899914716sPASSinput · generic input · output · check report
890accepted exit 0 · 0.10162571199907688sPASSinput · generic input · output · check report
891accepted exit 0 · 0.08976677200007543sPASSinput · generic input · output · check report
892accepted exit 0 · 0.0897281080015091sPASSinput · generic input · output · check report
893accepted exit 0 · 0.10774261499864224sPASSinput · generic input · output · check report
894accepted exit 0 · 0.0963800089994038sPASSinput · generic input · output · check report
895accepted exit 0 · 0.10677429099996516sPASSinput · generic input · output · check report
896accepted exit 0 · 0.10757116199965822sPASSinput · generic input · output · check report
897accepted exit 0 · 0.10071017699920048sFAILinput · generic input · output · check report
898accepted exit 0 · 0.1105447230002028sPASSinput · generic input · output · check report
899accepted exit 0 · 0.0922127490011917sPASSinput · generic input · output · check report
900accepted exit 0 · 0.09378067900070164sPASSinput · generic input · output · check report
901accepted exit 0 · 0.09618250299899955sPASSinput · generic input · output · check report
902accepted exit 0 · 0.0924154570002429sFAILinput · generic input · output · check report
903accepted exit 0 · 0.09598853799980134sPASSinput · generic input · output · check report
904accepted exit 0 · 0.059426591000374174sPASSinput · generic input · output · check report
905accepted exit 0 · 0.09576213099899178sPASSinput · generic input · output · check report
906accepted exit 0 · 0.09850343499965675sPASSinput · generic input · output · check report
907accepted exit 0 · 0.09946732099888322sPASSinput · generic input · output · check report
908accepted exit 0 · 0.11661933300092642sPASSinput · generic input · output · check report
909accepted exit 0 · 0.06166977700013376sPASSinput · generic input · output · check report
910accepted exit 0 · 0.09906907100048556sPASSinput · generic input · output · check report
911accepted exit 0 · 0.05716574100006255sFAILinput · generic input · output · check report
912accepted exit 0 · 0.09695613999974739sPASSinput · generic input · output · check report
913accepted exit 0 · 0.06259206299910147sPASSinput · generic input · output · check report
914accepted exit 0 · 0.10015417400063598sPASSinput · generic input · output · check report
915accepted exit 0 · 0.09589333799885935sPASSinput · generic input · output · check report
916accepted exit 0 · 0.09403007800028718sFAILinput · generic input · output · check report
917accepted exit 0 · 0.050895549000415485sPASSinput · generic input · output · check report
918accepted exit 0 · 0.049854838000101154sFAILinput · generic input · output · check report
919accepted exit 0 · 0.09494249700037471sPASSinput · generic input · output · check report
920accepted exit 0 · 0.10278974999891943sPASSinput · generic input · output · check report
921accepted exit 0 · 0.09825435600032506sPASSinput · generic input · output · check report
922accepted exit 0 · 0.09647776800011343sPASSinput · generic input · output · check report
923accepted exit 0 · 0.10103044499919633sPASSinput · generic input · output · check report
924accepted exit 0 · 0.09674291800001811sFAILinput · generic input · output · check report
925accepted exit 0 · 0.09406779799974174sFAILinput · generic input · output · check report
926accepted exit 0 · 0.09536593400116544sPASSinput · generic input · output · check report
927accepted exit 0 · 0.09765301300103602sPASSinput · generic input · output · check report
928accepted exit 0 · 0.06104930699984834sPASSinput · generic input · output · check report
929accepted exit 0 · 0.09925178400044388sPASSinput · generic input · output · check report
930accepted exit 0 · 0.1190962180007773sPASSinput · generic input · output · check report
931accepted exit 0 · 0.09601484599988908sPASSinput · generic input · output · check report
932accepted exit 0 · 0.09961081999972521sPASSinput · generic input · output · check report
933accepted exit 0 · 0.09605159499915317sPASSinput · generic input · output · check report
934accepted exit 0 · 0.0969663390005735sPASSinput · generic input · output · check report
935accepted exit 0 · 0.11829078099981416sPASSinput · generic input · output · check report
936accepted exit 0 · 0.06308778699894901sPASSinput · generic input · output · check report
937accepted exit 0 · 0.09666627300066466sPASSinput · generic input · output · check report
938accepted exit 0 · 0.0947590499999933sPASSinput · generic input · output · check report
939accepted exit 0 · 0.11028443799841625sPASSinput · generic input · output · check report
940accepted exit 0 · 0.09849351599950751sFAILinput · generic input · output · check report
941accepted exit 0 · 0.0505278359996737sPASSinput · generic input · output · check report
942accepted exit 0 · 0.10743780600023456sPASSinput · generic input · output · check report
943accepted exit 0 · 0.06266331799997715sFAILinput · generic input · output · check report
944accepted exit 0 · 0.05238072599968291sFAILinput · generic input · output · check report
945accepted exit 0 · 0.09765693000008469sPASSinput · generic input · output · check report
946accepted exit 0 · 0.09273709099943517sPASSinput · generic input · output · check report
947accepted exit 0 · 0.10178563699992083sPASSinput · generic input · output · check report
948accepted exit 0 · 0.09012222500132339sPASSinput · generic input · output · check report
949accepted exit 0 · 0.09481425400008447sFAILinput · generic input · output · check report
950accepted exit 0 · 0.0719988540004124sPASSinput · generic input · output · check report
951accepted exit 0 · 0.09912632799932908sPASSinput · generic input · output · check report
952accepted exit 0 · 0.10042077600155608sPASSinput · generic input · output · check report
953accepted exit 0 · 0.0897962010003539sPASSinput · generic input · output · check report
954accepted exit 0 · 0.09637744899919198sPASSinput · generic input · output · check report
955accepted exit 0 · 0.06360890799987828sPASSinput · generic input · output · check report
956accepted exit 0 · 0.0981884609991539sPASSinput · generic input · output · check report
957accepted exit 0 · 0.09463972499906959sPASSinput · generic input · output · check report
958accepted exit 0 · 0.051504075001503224sPASSinput · generic input · output · check report
959accepted exit 0 · 0.09163649800029816sPASSinput · generic input · output · check report
960accepted exit 0 · 0.10445220099973085sPASSinput · generic input · output · check report
961accepted exit 0 · 0.05763041600039287sPASSinput · generic input · output · check report
962accepted exit 0 · 0.06352527099988947sFAILinput · generic input · output · check report
963accepted exit 0 · 0.10515900200152828sPASSinput · generic input · output · check report
964accepted exit 0 · 0.06858525300049223sFAILinput · generic input · output · check report
965accepted exit 0 · 0.09978654099904816sPASSinput · generic input · output · check report
966accepted exit 0 · 0.061548497000330826sFAILinput · generic input · output · check report
967accepted exit 0 · 0.11679781800012279sPASSinput · generic input · output · check report
968accepted exit 0 · 0.06151504400077101sFAILinput · generic input · output · check report
969accepted exit 0 · 0.06199475799985521sFAILinput · generic input · output · check report
970accepted exit 0 · 0.09963287099890294sPASSinput · generic input · output · check report
971accepted exit 0 · 0.09760404999906314sPASSinput · generic input · output · check report
972accepted exit 0 · 0.06526848499925109sPASSinput · generic input · output · check report
973accepted exit 0 · 0.09849848500016378sPASSinput · generic input · output · check report
974accepted exit 0 · 0.11338079999950423sPASSinput · generic input · output · check report
975accepted exit 0 · 0.10338697400038654sPASSinput · generic input · output · check report
976accepted exit 0 · 0.08991498400064302sPASSinput · generic input · output · check report
977accepted exit 0 · 0.1021329010000045sPASSinput · generic input · output · check report
978accepted exit 0 · 0.09917588099960994sPASSinput · generic input · output · check report
979accepted exit 0 · 0.10229454500040447sPASSinput · generic input · output · check report
980accepted exit 0 · 0.10384934400099155sPASSinput · generic input · output · check report
981accepted exit 0 · 0.09759577399927366sPASSinput · generic input · output · check report
982accepted exit 0 · 0.09377395400042587sPASSinput · generic input · output · check report
983accepted exit 0 · 0.05743339500077127sPASSinput · generic input · output · check report
984accepted exit 0 · 0.0976800930002355sFAILinput · generic input · output · check report
985accepted exit 0 · 0.10632773299948894sPASSinput · generic input · output · check report
986accepted exit 0 · 0.10029644099995494sPASSinput · generic input · output · check report
987accepted exit 0 · 0.058320987000115565sPASSinput · generic input · output · check report
988accepted exit 0 · 0.10382744299931801sPASSinput · generic input · output · check report
989accepted exit 0 · 0.0983003910005209sPASSinput · generic input · output · check report
990accepted exit 0 · 0.10231045500040636sPASSinput · generic input · output · check report
991accepted exit 0 · 0.09931061399947794sPASSinput · generic input · output · check report
992accepted exit 0 · 0.09424309799942421sPASSinput · generic input · output · check report
993accepted exit 0 · 0.09227376700073364sPASSinput · generic input · output · check report
994accepted exit 0 · 0.05389065000053961sPASSinput · generic input · output · check report
995accepted exit 0 · 0.10761101999923994sPASSinput · generic input · output · check report
996accepted exit 0 · 0.09991132499999367sPASSinput · generic input · output · check report
997accepted exit 0 · 0.12183427400123037sPASSinput · generic input · output · check report
998accepted exit 0 · 0.06298509199950786sPASSinput · generic input · output · check report
999accepted exit 0 · 0.10064945600061037sPASSinput · generic input · output · check report
How this PBT was generated and reviewed

paired production revision · manifest.json · review.json

partial source coverage: Approved for execution and public reporting; translation accuracy and completeness remain separately unvalidated.

Independent replay: 20 generated, 20 compiler-accepted; checker verdicts {"FAIL": 1, "PASS": 19}. Compiler binary and revision identities matched.

Covered requirements

  • Event-token reachability ordering for tagged atomic, volatile, release and acquire operations in generated source strands. Replay already reports one FAIL; this is an observed checker violation, not a confirmed compiler defect.

Uncovered requirements

  • Full correspondence to the source passage and coverage beyond the authored generator/checker have not been established; empty selections may pass without exercising assertions.
Agent-selected pinned authoring context · authoring-context.json
{"entries":[{"file_sha256":"6410a79f49a8948c0858239ee95ae88854c74469afe91ec0e22773de50fba131","kind":"documentation_input","lines":"228-238","path":"docs/spec-compiler-part-3-mem.md","roles":["applicability","context"],"text":"In addition to alias hazards, lowering materializes the sequenced-before rules\nfrom the actor contracts:\n\n* atomic actors and fences in one logical source strand preserve their\n  selected order;\n* volatile actors in one logical source strand preserve their relative order;\n* release actors and fences wait for prior memory-effect tails whose\n  visibility they publish;\n* acquire actors and fences precede later constrained memory effects;\n* `acq_rel` and `seq_cst` apply both directions; and\n* atomic-volatile actors participate in both strand relations.","why":"The sampled output obligation itself: the sequenced-before rules lowering must materialize for atomic, volatile, release, acquire, acq_rel/seq_cst, and atomic-volatile actors in one logical source strand. Fixes which output actors the postcondition selects and what ordering it asserts."},{"file_sha256":"6410a79f49a8948c0858239ee95ae88854c74469afe91ec0e22773de50fba131","kind":"documentation_input","lines":"3-6","path":"docs/spec-compiler-part-3-mem.md","roles":["applicability"],"text":"This document is the memory-order source of truth for graph-local SCF to\nDataflow lowering. The concrete owner is `loom-lower-graph-memory`; it\nnormalizes supported memory leaves and recursively lowers structured graph\nregions in one traversal.","why":"Names loom-lower-graph-memory as the concrete owner of graph-local SCF-to-Dataflow memory lowering, confirming the pass selection in subject-command.json for this claim."},{"file_sha256":"6410a79f49a8948c0858239ee95ae88854c74469afe91ec0e22773de50fba131","kind":"documentation_input","lines":"21-46","path":"docs/spec-compiler-part-3-mem.md","roles":["input_construction","input_well_formedness"],"text":"## 1. Scope\n\nThe lowering contract covers:\n\n* scalar and fixed-ranked vector forms of canonical `dataflow.load` and\n  `dataflow.store`, including the masked contiguous and gather/scatter forms\n  defined by `docs/spec-dataflow-vectorization.md`;\n* canonical atomic load/store, `dataflow.atomic_rmw`,\n  `dataflow.cmpxchg`, `dataflow.fence`, and volatile access contracts defined\n  by `docs/spec-dataflow-memory-consistency.md`;\n* normalized scalar `memref.load` and `memref.store` leaves over a canonical\n  linear memory space;\n* sequential composition;\n* arbitrary nesting of `scf.if`, source-sequential `scf.for`, and\n  `scf.while`;\n* basic graph-local alias-root partitions;\n* conservative unknown accesses;\n* value, execution, write-frontier, and read-frontier projection through the\n  same structured selectors;\n* pre-mutation rejection of residual `scf.parallel` and `scf.forall` that\n  reach a graph without an already materialized schedule boundary.\n\nThe lowering does not select parallel width, ownership, serialization,\nunrolling, reduction order, or any other schedule policy. Those decisions\nmust be made before graph-region lowering and normalized into supported\nstructured input.","why":"Scope of accepted input: canonical atomic load/store, atomic_rmw, cmpxchg, fence and volatile access contracts, normalized memref leaves, sequential composition, and the exclusion of schedule policy. Bounds what the grammar may emit inside a graph body."},{"file_sha256":"6410a79f49a8948c0858239ee95ae88854c74469afe91ec0e22773de50fba131","kind":"documentation_input","lines":"49-72","path":"docs/spec-compiler-part-3-mem.md","roles":["context"],"text":"The compiler-local contract is:\n\n```text\nlower_region(E_in, values_in, {W_in[p], R_in[p]}, SB_in)\n  -> (E_out, values_out, {W_out[p], R_out[p]}, SB_out)\n```\n\n`E` is execution permission and structural completion. `W` and `R` are\nmemory-order frontiers for alias partition `p`. They share the ordinary\n`none` SSA type but remain semantically distinct throughout lowering.\n`SB` is the path-sensitive analysis relation containing only\nsequenced-before obligations that remain observable after the selected\nStructured Program Candidate's legal transformations. It covers atomic/fence,\nvolatile, release, and acquire requirements across alias partitions. It is not\none serialized token or an IR object.\n\nThe contract is an implementation function, not an IR object. Canonical IR\ndoes not contain partition ids, dependence snapshots, compound-region\nobjects, chain-scope attributes, memory tokens, sequenced-before records, or\nmemory-specific join operations.\n\nThe recursive owner replaces the former split among reduction, invariant,\ncontrol, and sync passes. No later pass reconstructs structured memory order","why":"Defines E/W/R and SB as implementation state that is not an IR object, so the only observable form of a sequenced-before obligation is the ordinary SSA event network; this justifies reading the obligation as event-edge reachability over none-typed values."},{"file_sha256":"6410a79f49a8948c0858239ee95ae88854c74469afe91ec0e22773de50fba131","kind":"documentation_input","lines":"79-106","path":"docs/spec-compiler-part-3-mem.md","roles":["input_construction","input_well_formedness"],"text":"A canonical root is found by peeling an accepted side-effect-free memref view\nuntil reaching an explicit storage or boundary root. The finalized surface\nrecognizes:\n\n* a graph memory input, whose root identity comes from its launch binding;\n* a `dataflow.memory.service` result at that binding, which preserves the root\n  of its exact pointer operand while changing only the value-plane pointer into\n  a memory-plane capability;\n* a fresh `memref.alloc` result, whose root is unique for each invocation;\n* a verified side-effect-free view that preserves the source root. The initial\n  accepted set contains `memref.cast`; adding another view form requires one\n  matching root, region, and simulator contract before admission.\n\nWhen graph publication can trace every captured memory capability to a known\nroot, an exact service rooted at a unique thread argument mechanically inherits\nthat argument's `llvm.noalias` fact. If a root is unknown, appears through more\nthan one captured capability, or does not resolve to that argument, publication\nmust omit the fact. The service result does not independently assert aliasing,\nand graph publication does not perform another alias analysis.\n\nGraph launch memory bindings require exact memref capability types. An LLVM\npointer cannot bind a graph memref through a conversion, inferred base, or\nspecial address-space-zero rule. SCF optimization may first prove and\nmaterialize a rooted memref capability plus integer offset, or it may retain\nthe pointer as a value consumed by a `PointerAddressed` memory actor together\nwith an independently bound service capability. Neither path materializes a\ngraph-body bridge. `builtin.unrealized_conversion_cast` is never a canonical\nroot, view, actor, or boundary bridge.","why":"Canonical roots and graph launch memory bindings: graph memory inputs with exact memref capability types are admissible roots, so the generator binds memref<16xi32> graph arguments rather than pointers or get_global."},{"file_sha256":"6410a79f49a8948c0858239ee95ae88854c74469afe91ec0e22773de50fba131","kind":"documentation_input","lines":"136-161","path":"docs/spec-compiler-part-3-mem.md","roles":["input_construction","input_well_formedness"],"text":"A memory input binds an established external memref capability through an\nexact graph-launch type match. An LLVM pointer never satisfies a graph memory\nport. A first-class pointer value used by a `PointerAddressed` actor resolves\nthrough the runtime object registry to one object and byte offset independently\nof the service-capability binding.\n\nDistinct graph memory inputs are conservatively may-alias unless explicit\nno-alias evidence distinguishes them. Distinct fresh allocations are\nindependent roots. The analysis does not use address ranges, affine\ndisjointness, bank identity, physical ports, or element-type compatibility to\nsplit a root.\n\n`memref.get_global`, `memref.alloca`, globals, static pointer bases, and\nunrecognized capability producers are not canonical roots. A pre-final\nanalysis may conservatively group an unresolved access while building an event\nnetwork, but finalization rejects any such residual producer rather than\ngranting it an external-memory authority.\n\nA source-origin `llvm.alloca` accepted by the Structured\n`PromoteOrderedBufferToChannel` decision is not an exception to this rule. That\ndecision must remove the complete proved allocation closure before D0; a\nresidual allocation or pointer use remains non-canonical and is rejected.\n\nAccess-to-partition membership is kept in a transient operation map before\nSCF operands are projected. Selector demuxing must not change alias identity.\nThe map is discarded after explicit event edges are emitted.","why":"Distinct graph memory inputs are conservatively may-alias, alloca/get_global/globals are not canonical roots, and partition membership is transient. Justifies sampling two may-aliasing memref inputs and avoiding non-canonical producers."},{"file_sha256":"6410a79f49a8948c0858239ee95ae88854c74469afe91ec0e22773de50fba131","kind":"documentation_input","lines":"183-226","path":"docs/spec-compiler-part-3-mem.md","roles":["context"],"text":"Compiler `join` means an all-of causal frontier. It is materialized with\nordinary `dataflow.sync` after deduplication and conservative transitive\nreduction. Mutually exclusive alternatives use `dataflow.mux`, never\n`dataflow.sync`.\n\nCross-partition sequenced-before requirements do not add another component to\neach alias partition. The implementation may use disposable all-effect,\natomic/fence, volatile, and acquire frontier caches to compress `SB`, but the\nrequired relation is the authority. Cache shape, traversal order, and\nintermediate joins are not observable and are discarded after event edges are\npublished.\n\n## 5. Leaf Transfers\n\nFor a read covering partitions `P(access)`:\n\n```text\nctrl = join(E, W[p] for p in P(access))\ndone = read.done\nW[p] remains unchanged\nR[p] = join(R[p], done)\n```\n\nFor a write covering partitions `P(access)`:\n\n```text\nctrl = join(E, R[p] for p in P(access))\ndone = write.done\nW[p] = done\nR[p] = done\n```\n\nThese equations are the complete hazard authority:\n\n* RAW: a read waits for the current write frontier;\n* WAR: a write waits for all outstanding reads;\n* WAW: a write waits for the read frontier, which covers the prior write;\n* RAR: a read does not wait for prior reads.\n\nAtomic load uses the read equation and atomic store uses the write equation.\nAtomic RMW and compare-exchange conservatively use the write equation because\neach firing may both read and write; a failed compare-exchange may retain the\nresulting causal edge without inventing a write. Fence has no alias-partition\nread or write effect.","why":"Compiler join is materialized by ordinary dataflow.sync, and the leaf read/write transfers define ctrl/done. Establishes the terminology for the event edges whose transitive closure the postcondition computes, and that alias hazards alone are not the obligation under test."},{"file_sha256":"6410a79f49a8948c0858239ee95ae88854c74469afe91ec0e22773de50fba131","kind":"documentation_input","lines":"470-493","path":"docs/spec-compiler-part-3-mem.md","roles":["input_well_formedness"],"text":"The owner rejects before mutation when:\n\n* raw or unverifiably owned parallel SCF reaches a graph;\n* an effectful or unmodeled nested operation reaches a graph;\n* a residual LLVM load, store, atomicrmw, cmpxchg, fence, memcpy, memmove, or\n  memset remains after\n  normalization and therefore has no explicit completion event;\n* a source memory access has not been normalized to the canonical linear\n  memory-space form required by its scalar or vector Dataflow actor;\n* structured control carries a memref result or memref loop state;\n* the graph entry lacks the leading `none` execution value.\n\nLLVM memcpy, memmove, and memset intrinsics are expanded into their exact\nstructured loop semantics before ownership selection. Supported LLVM\nload/store (including volatile and atomic contracts), `atomicrmw`, `cmpxchg`,\nand `fence` forms are then normalized before recursive region lowering, after\nwhich the same frontier rules apply. LLVM target-specific sync scopes without\na compiler-target owner and atomic accesses without an explicit power-of-two\nsource alignment fail closed. Every residual raw LLVM memory operation fails\nclosed. The finalized-graph gate also rejects residual\n`memref.load`/`memref.store`, `memref.get_global`, raw pointer arithmetic,\npointer-bearing operations, `builtin.unrealized_conversion_cast`, and unknown\nmemory-capability producers. An unsupported effectful operation inside a\nstructured region must likewise fail closed instead of being hoisted.","why":"Pre-mutation rejection list (residual raw LLVM memory ops, unnormalized accesses, missing leading none execution value, residual parallel SCF). The generator avoids every rejected construct so that samples are accepted and the obligation is actually exercised."},{"file_sha256":"f4e60b2e62b496c3714437bd100ab5236540abebd3685dfbd25eeddb37cb7160","kind":"language_definition","lines":"439-530,590-620,839-940","path":"include/Dataflow/IR/DataflowOps.td","roles":["input_construction","input_well_formedness"],"text":"def Dataflow_LoadOp : Dataflow_MemoryActorOp<\"load\"> {\n  let summary = \"streaming element, contiguous vector, or gather load\";\n  let description = [{\n    On the simultaneous arrival of an address token and a `%ctrl : none`\n    token, consumes both and fires one memory actor.\n    A result type exactly equal to the memref element type loads one\n    memory element, including when that element type is itself a vector.\n    Otherwise, a fixed-size vector result of any positive rank loads that many\n    elements in canonical row-major lane order, contiguously from a scalar\n    `%addr : index` or, with a same-shape `%addr : vector<...xindex>`, one\n    element per lane from the corresponding element-index address. A vector\n    access requires the memref element type as its vector element type.\n\n    An optional same-shape `i1` mask restricts a vector load to active lanes.\n    Inactive lanes do not access memory and are deterministically zero-filled.\n    After all active lanes retire, the op emits one data token and one `none`\n    token on `%done`.\n\n    The optional `contract` attribute is this actor's single\n    `MemoryAccessContract`; its absence is the canonical plain non-volatile\n    contract.\n  }];\n\n  let arguments = (ins AnyMemRef:$mem, AnyType:$addr, NoneType:$ctrl,\n                       Optional<AnyVectorOfAnyRank>:$mask,\n                       OptionalAttr<Dataflow_MemoryAccessContract>:$contract);\n  let results = (outs AnyType:$data, NoneType:$done);\n\n  let hasCustomAssemblyFormat = 1;\n  let hasVerifier = 1;\n  let builders = [\n    OpBuilder<(ins\n        \"::mlir::Type\":$data,\n        \"::mlir::Type\":$done,\n        \"::mlir::Value\":$mem,\n        \"::mlir::Value\":$addr,\n        \"::mlir::Value\":$ctrl)>,\n    OpBuilder<(ins\n        \"::mlir::Value\":$mem,\n        \"::mlir::Value\":$addr,\n        \"::mlir::Value\":$ctrl)>\n  ];\n}\n\ndef Dataflow_StoreOp : Dataflow_MemoryActorOp<\"store\"> {\n  let summary = \"streaming element, contiguous vector, or scatter store\";\n  let description = [{\n    On the simultaneous arrival of an address token, a `%data` value\n    and a `%ctrl : none`, consumes all three and fires one memory actor.\n    Data whose type exactly equals the memref element type writes one\n    memory element, including when that element type is itself a vector.\n    Otherwise, fixed-size vector data of any positive rank writes that many\n    elements in canonical row-major lane order, contiguously from a scalar\n    `%addr : index` or, with a same-shape `%addr : vector<...xindex>`, one\n    element per lane. A vector access requires the memref element type as its\n    vector element type.\n\n    An optional same-shape `i1` mask restricts a vector store to active lanes.\n    Inactive lanes do not access memory. After all active lanes retire, the op\n    emits one `none` token on `%done`.\n\n    The optional `contract` attribute is this actor's single\n    `MemoryAccessContract`; its absence is the canonical plain non-volatile\n    contract.\n  }];\n\n  let arguments = (ins AnyMemRef:$mem, AnyType:$addr, AnyType:$data,\n                       NoneType:$ctrl,\n                       Optional<AnyVectorOfAnyRank>:$mask,\n                       OptionalAttr<Dataflow_MemoryAccessContract>:$contract);\n  let results = (outs NoneType:$done);\n\n  let hasCustomAssemblyFormat = 1;\n  let hasVerifier = 1;\n  let builders = [\n    OpBuilder<(ins\n        \"::mlir::Type\":$done,\n        \"::mlir::Value\":$mem,\n        \"::mlir::Value\":$addr,\n        \"::mlir::Value\":$data,\n        \"::mlir::Value\":$ctrl)>,\n    OpBuilder<(ins\n        \"::mlir::Value\":$mem,\n        \"::mlir::Value\":$addr,\n        \"::mlir::Value\":$data,\n        \"::mlir::Value\":$ctrl)>\n  ];\n}\n\ndef Dataflow_AtomicRmwOp : Dataflow_MemoryActorOp<\"atomic_rmw\", [\n    AllTypesMatch<[\"value\", \"old\"]>\n]> {\ndef Dataflow_FenceOp : Dataflow_MemoryActorOp<\"fence\"> {\n  let summary = \"streaming memory fence\";\n  let description = [{\n    On the arrival of a `%ctrl : none` token, consumes it and fires one fence\n    actor under its ordering and scope contract. A fence addresses no memory\n    and publishes one `none` token on `%done` at retirement. `%done` denotes\n    completion under this actor's contract; it is not a global barrier. Its\n    memory effect is conservative and names no addressed value, so a fence has\n    no `CanonicalMemoryAccessView`.\n  }];\n\n  let arguments = (ins NoneType:$ctrl, Dataflow_FenceContractAttr:$contract);\n  let results = (outs NoneType:$done);\n\n  let hasCustomAssemblyFormat = 1;\n  let hasVerifier = 1;\n}\n\n//===----------------------------------------------------------------------===//\n// Symbol-bearing function-like ops\n//\n// The canonical module-scope definition and launch surfaces.\n//===----------------------------------------------------------------------===//\n\ndef Dataflow_ThreadOp : Dataflow_Op<\"thread\", [\n    AutomaticAllocationScope,\n    IsolatedFromAbove,\n    HasParent<\"::mlir::ModuleOp\">,\n    SingleBlockImplicitTerminator<\"ThreadYieldOp\">,\n    FunctionOpInterface,\n    RecursiveMemoryEffects\ndef Dataflow_GraphOp : Dataflow_Op<\"graph\", [\n    IsolatedFromAbove,\n    HasParent<\"::mlir::ModuleOp\">,\n    SingleBlockImplicitTerminator<\"GraphReturnOp\">,\n    FunctionOpInterface,\n    RecursiveMemoryEffects,\n    DeclareOpInterfaceMethods<RegionKindInterface>\n]> {\n  let summary = \"Symbol-bearing function-like SpatialCore graph definition\";\n  let description = [{\n    Module-scope, function-like callable holding the SpatialCore body\n    of a leaf dataflow graph. It does not itself execute; one or more\n    `dataflow.graph.launch` ops materialise launches of it inside the\n    body of a `dataflow.thread` definition.\n\n    `function_type` contains only application payload ports. Normalized\n    `input_segments` and `result_segments` classify those payloads as value,\n    stream, and memory ports. The body's distinguished leading `none` block\n    argument is the invocation start protocol endpoint, while launch `done`\n    is derived exclusively from `dataflow.graph.return.complete`; neither is\n    stored in the function type.\n\n    This is the only canonical graph definition surface.\n  }];\n\n  let arguments = (ins\n      SymbolNameAttr:$sym_name,\n      TypeAttrOf<FunctionType>:$function_type,\n      DenseI32ArrayAttr:$input_segments,\n      DenseI32ArrayAttr:$result_segments,\n      OptionalAttr<StrAttr>:$sym_visibility,\n      OptionalAttr<DictArrayAttr>:$arg_attrs,\n      OptionalAttr<DictArrayAttr>:$res_attrs);\n\n  let regions = (region SizedRegion<1>:$body);\n\n  let hasCustomAssemblyFormat = 1;\n  let hasVerifier = 1;\n\n  let builders = [\n    OpBuilder<(ins\n        \"::llvm::StringRef\":$name,\n        \"::mlir::FunctionType\":$type,\n        CArg<\"::llvm::ArrayRef<::mlir::NamedAttribute>\", \"{}\">:$attrs)>\n  ];\n\n  let extraClassDeclaration = [{\n    /// FunctionOpInterface methods.\n    ::llvm::ArrayRef<::mlir::Type> getArgumentTypes() {\n      return getFunctionType().getInputs();\n    }\n    ::llvm::ArrayRef<::mlir::Type> getResultTypes() {\n      return getFunctionType().getResults();\n    }\n    ::mlir::Region *getCallableRegion() {\n      return isExternal() ? nullptr : &getBody();\n    }\n    bool isExternal() { return getBody().empty(); }\n    ::mlir::BlockArgument getStart();\n    ::llvm::ArrayRef<int32_t> getInputSegmentSizes();\n    ::llvm::ArrayRef<int32_t> getResultSegmentSizes();\n    GraphPortKind getInputPortKind(unsigned index);\n    GraphPortKind getResultPortKind(unsigned index);\n    ::llvm::LogicalResult verifyBody() {\n      if (isExternal())\n        return ::mlir::success();\n      ::mlir::Block &entry = getBody().front();\n      ::llvm::ArrayRef<::mlir::Type> inputs = getFunctionType().getInputs();\n      if (entry.getNumArguments() != inputs.size() + 1)\n        return emitOpError(\"entry block must have one start argument plus \")\n               << inputs.size() << \" application inputs\";\n      if (!::llvm::isa<::mlir::NoneType>(entry.getArgument(0).getType()))\n        return emitOpError(\"entry block argument #0 must be start type none\");\n      for (size_t i = 0, e = inputs.size(); i < e; ++i) {\n        if (entry.getArgument(i + 1).getType() != inputs[i])\n          return emitOpError(\"entry block argument #\")\n                 << (i + 1) << \" type \"\n                 << entry.getArgument(i + 1).getType()\n                 << \" must match function input type \" << inputs[i];\n      }\n      return ::mlir::success();\n    }\n  }];\n}\n\ndef Dataflow_GraphReturnOp : Dataflow_Op<\"graph.return\", [\n    AttrSizedOperandSegments,\n    Terminator,\n    ParentOneOf<[\"::dataflow::GraphOp\"]>,\n    Pure\n]> {\n  let summary = \"Terminator for a dataflow.graph body\";\n  let description = [{\n    Structurally declares the enclosing graph's value, stream, and memory\n    outputs together with its mandatory retirement frontier. `complete` is\n    an unordered all-of set of one or more `none` values; the launch `done`\n    event is derived from that set and is not itself a return operand.\n\n    The compact assembly form `%complete, %values... : none, types...` is\n    retained for the common case with one completion witness and no stream\n    or memory outputs. Other shapes print all four named segments.\n  }];","why":"Operation definitions for dataflow.load, dataflow.store, dataflow.atomic_rmw, dataflow.fence, dataflow.graph, and dataflow.graph.return: operand order, ctrl/done results, and graph signature/segment attributes used verbatim by the grammar."},{"file_sha256":"25040237b68051cba0a6297fa6f3b870b4827765450a6524cfe263aaac31b6da","kind":"language_definition","lines":"116-210","path":"include/Dataflow/IR/DataflowAttrs.td","roles":["input_construction"],"text":"def Dataflow_AtomicAccessContractAttr\n    : Dataflow_Attr<\"AtomicAccessContract\", \"atomic_access\"> {\n  let summary = \"the common atomic-access fields as one closed typed value\";\n  let description = [{\n    The single owner of an atomic access's ordering, synchronization scope,\n    source alignment, optional vector atomic granularity, and volatility.\n    Every actor that performs an atomic access nests exactly one of these;\n    none of its fields is repeated by an enclosing aggregate.\n\n    A scalar atomic access omits the granularity because both vector cases\n    degenerate to one atomic object. The source alignment is the minimum\n    alignment the software access guarantees; it is nonzero and a power of\n    two and is not inferred from the access type, endpoint width, or a\n    selected service.\n  }];\n\n  let parameters = (ins Dataflow_Ordering:$ordering,\n                        \"::dataflow::SyncScopeRefAttr\":$sync_scope,\n                        Dataflow_SourceAlignmentBytes:$source_alignment_bytes,\n                        Dataflow_OptionalGranularity:$vector_granularity,\n                        Dataflow_Flag:$is_volatile);\n  let assemblyFormat = \"`<` struct(params) `>`\";\n  let genVerifyDecl = 1;\n}\n\ndef Dataflow_PlainAccessContractAttr\n    : Dataflow_Attr<\"PlainAccessContract\", \"plain_access\"> {\n  let summary = \"the plain arm of a memory access contract\";\n  let description = [{\n    A plain access carries no ordering, scope, or atomic granularity. Volatile\n    is an observability contract, not synchronization: it neither creates a\n    synchronizes-with relation nor makes the access atomic.\n  }];\n\n  let parameters = (ins \"bool\":$is_volatile);\n  let assemblyFormat = \"`<` struct(params) `>`\";\n}\n\n// MemoryAccessContract = Plain { volatile } | Atomic(AtomicAccessContract).\n// The two arms are distinct attributes so that no instance can carry two\n// owners of the same field.\ndef Dataflow_MemoryAccessContract : AnyAttrOf<[\n    Dataflow_PlainAccessContractAttr, Dataflow_AtomicAccessContractAttr],\n    \"plain or atomic memory access contract\">;\n\ndef Dataflow_AtomicRmwContractAttr\n    : Dataflow_Attr<\"AtomicRmwContract\", \"rmw_contract\"> {\n  let summary = \"contract of one atomic read-modify-write actor\";\n  let description = [{\n    One enumerated read-modify-write action together with the one\n    `AtomicAccessContract` it performs. Canonical Dataflow carries no generic\n    atomic-region body: a region normalizes to this actor only when it is\n    proven equivalent to one enumerated action.\n  }];\n\n  let parameters = (ins EnumParameter<Dataflow_AtomicRmwKind>:$kind,\n                        \"::dataflow::AtomicAccessContractAttr\":$access);\n  let assemblyFormat = \"`<` struct(params) `>`\";\n}\n\ndef Dataflow_CompareExchangeContractAttr\n    : Dataflow_Attr<\"CompareExchangeContract\", \"cmpxchg_contract\"> {\n  let summary = \"contract of one compare-exchange actor\";\n  let description = [{\n    Preserves distinct success and failure orderings and strong versus weak\n    behavior. A failed compare-exchange performs no write; a weak\n    compare-exchange may fail spuriously.\n  }];\n\n  let parameters = (ins Dataflow_Ordering:$success_ordering,\n                        Dataflow_Ordering:$failure_ordering,\n                        \"::dataflow::SyncScopeRefAttr\":$sync_scope,\n                        Dataflow_SourceAlignmentBytes:$source_alignment_bytes,\n                        Dataflow_OptionalGranularity:$vector_granularity,\n                        Dataflow_Flag:$weak,\n                        Dataflow_Flag:$is_volatile);\n  let assemblyFormat = \"`<` struct(params) `>`\";\n  let genVerifyDecl = 1;\n}\n\ndef Dataflow_FenceContractAttr\n    : Dataflow_Attr<\"FenceContract\", \"fence_contract\"> {\n  let summary = \"contract of one fence actor\";\n  let description = [{\n    A fence publishes or consumes visibility under one ordering and scope. It\n    addresses no memory and therefore has no access shape or granularity.\n  }];\n\n  let parameters = (ins Dataflow_Ordering:$ordering,\n                        \"::dataflow::SyncScopeRefAttr\":$sync_scope);\n  let assemblyFormat = \"`<` struct(params) `>`\";\n  let genVerifyDecl = 1;\n}\n\n#endif // DATAFLOW_ATTRS_TD","why":"Definitions of the atomic_access, plain_access, rmw_contract, and fence_contract attributes, including their mnemonics and field order. Fixes both the contract spellings the grammar emits and the canonical attribute text the postcondition classifies on."},{"file_sha256":"6591d86c7c41916232ce698d6631ccfcff0607452927d5d0f6b3ed1eefb1189c","kind":"test","lines":"32-52,126-180","path":"test/dataflow/unit/memory_contract/valid.mlir","roles":["input_construction"],"text":"// CHECK-LABEL: func.func @volatile_and_atomic\n// CHECK: contract = #dataflow.plain_access<is_volatile = true>\n// CHECK: contract = #dataflow.atomic_access<ordering = acquire, sync_scope = <system>, source_alignment_bytes = 4>\n// CHECK: contract = #dataflow.atomic_access<ordering = release, sync_scope = <single_thread>, source_alignment_bytes = 4>\nfunc.func @volatile_and_atomic(%mem: memref<10xi32>, %addr: index, %ctrl: none)\n    -> (i32, i32, none) {\n  %plain, %plain_done = dataflow.load %mem[%addr] %ctrl\n      {contract = #dataflow.plain_access<is_volatile = true>}\n      : memref<10xi32>\n  %acquired, %acquired_done = dataflow.load %mem[%addr] %ctrl\n      {contract = #dataflow.atomic_access<ordering = acquire,\n                                          sync_scope = <system>,\n                                          source_alignment_bytes = 4>}\n      : memref<10xi32>\n  %stored = dataflow.store %mem[%addr] %acquired %ctrl\n      {contract = #dataflow.atomic_access<ordering = release,\n                                          sync_scope = <single_thread>,\n                                          source_alignment_bytes = 4>}\n      : memref<10xi32>\n  return %plain, %acquired, %stored : i32, i32, none\n}\n// CHECK: dataflow.atomic_rmw %{{.*}}[%{{.*}}] %{{.*}} %{{.*}} {contract = #dataflow.rmw_contract<kind = fadd, access = <ordering = monotonic, sync_scope = <system>, source_alignment_bytes = 4, is_volatile = true>>} : memref<10xf32>\nfunc.func @read_modify_write(\n    %mem: memref<10xf32>, %addr: index, %value: f32, %ctrl: none)\n    -> (f32, none) {\n  %old, %done = dataflow.atomic_rmw %mem[%addr] %value %ctrl\n      {contract = #dataflow.rmw_contract<\n          kind = fadd,\n          access = <ordering = monotonic, sync_scope = <system>,\n                    source_alignment_bytes = 4, is_volatile = true>>}\n      : memref<10xf32>\n  return %old, %done : f32, none\n}\n\n// Canonical vector memory admits any positive fixed rank in row-major lane\n// order; a per-lane compare-exchange publishes the exact access shape.\n// CHECK-LABEL: func.func @multi_rank_per_lane\n// CHECK: dataflow.cmpxchg %{{.*}}[%{{.*}}] %{{.*}} %{{.*}} %{{.*}} mask %{{.*}} {{.*}}vector_granularity = per_lane{{.*}} : memref<10xi32>, vector<2x3xi32> -> vector<2x3xi1>\nfunc.func @multi_rank_per_lane(\n    %mem: memref<10xi32>, %addr: index, %expected: vector<2x3xi32>,\n    %desired: vector<2x3xi32>, %mask: vector<2x3xi1>, %ctrl: none)\n    -> (vector<2x3xi32>, vector<2x3xi1>, none) {\n  %old, %ok, %done = dataflow.cmpxchg %mem[%addr] %expected %desired %ctrl\n      mask %mask\n      {contract = #dataflow.cmpxchg_contract<success_ordering = seq_cst,\n                                             failure_ordering = acquire,\n                                             sync_scope = <system>,\n                                             source_alignment_bytes = 4,\n                                             vector_granularity = per_lane,\n                                             weak = true>}\n      : memref<10xi32>, vector<2x3xi32> -> vector<2x3xi1>\n  return %old, %ok, %done : vector<2x3xi32>, vector<2x3xi1>, none\n}\n\n// CHECK-LABEL: func.func @scalar_compare_exchange\n// CHECK: dataflow.cmpxchg %{{.*}}[%{{.*}}] %{{.*}} %{{.*}} %{{.*}} {contract = #dataflow.cmpxchg_contract<success_ordering = acq_rel, failure_ordering = monotonic, sync_scope = <system>, source_alignment_bytes = 4>} : memref<10xi32> -> i1\nfunc.func @scalar_compare_exchange(\n    %mem: memref<10xi32>, %addr: index, %expected: i32, %desired: i32,\n    %ctrl: none) -> (i32, i1, none) {\n  %old, %ok, %done = dataflow.cmpxchg %mem[%addr] %expected %desired %ctrl\n      {contract = #dataflow.cmpxchg_contract<success_ordering = acq_rel,\n                                             failure_ordering = monotonic,\n                                             sync_scope = <system>,\n                                             source_alignment_bytes = 4>}\n      : memref<10xi32> -> i1\n  return %old, %ok, %done : i32, i1, none\n}\n\n// CHECK-LABEL: func.func @fence\n// CHECK: dataflow.fence %{{.*}} {contract = #dataflow.fence_contract<ordering = seq_cst, sync_scope = <system>>}\nfunc.func @fence(%ctrl: none) -> none {\n  %done = dataflow.fence %ctrl\n      {contract = #dataflow.fence_contract<ordering = seq_cst,\n                                           sync_scope = <system>>}\n  return %done : none\n}","why":"Accepted concrete spellings of volatile plain contracts, atomic access contracts with ordering/sync_scope/source_alignment_bytes, rmw contracts, and dataflow.fence; also shows that unrelated discardable metadata on a memory actor stays legal, which the strand-order tag relies on."},{"file_sha256":"11d4b44ce36afb532b1ba720012841c38babad2962aadee232609a04fc28dbc4","kind":"test","lines":"1-24","path":"test/raise/scf-to-dfg-memory-frontier.mlir","roles":["input_construction","input_well_formedness"],"text":"// RUN: loom-raise-opt --split-input-file --loom-lower-graph-memory %s | FileCheck %s\n\n// CHECK-LABEL: dataflow.graph private @frontier_straight\n// CHECK: %[[R0:.*]], %[[D0:.*]] = dataflow.load %arg4[%arg1] %arg0 : memref<16xi32>\n// CHECK: %[[R1:.*]], %[[D1:.*]] = dataflow.load %arg4[%arg2] %arg0 : memref<16xi32>\n// CHECK: %[[WRITE:.*]] = dataflow.store %arg4[%arg1] %arg3 [[READS:%[^# ]+]]#0 : memref<16xi32>\n// CHECK: %[[R2:.*]], %[[D2:.*]] = dataflow.load %arg4[%arg2] %[[WRITE]] : memref<16xi32>\n// CHECK: [[READS]]:2 = dataflow.sync %[[D0]], %[[D1]] : (none, none) -> (none, none)\n// CHECK: %[[RB:.*]], %[[DB:.*]] = dataflow.load %arg5[%arg1] %[[WRITE]] : memref<16xi32>\n// CHECK: %[[RETIRE:.*]]:2 = dataflow.sync %[[D2]], %[[DB]] : (none, none) -> (none, none)\n// CHECK: dataflow.graph.return %[[RETIRE]]#0 : none\ndataflow.graph private @frontier_straight(\n    %start: none, %i: index, %j: index, %value: i32,\n    %a: memref<16xi32>, %b: memref<16xi32>) -> ()\n    attributes {input_segments = array<i32: 3, 0, 2>,\n                result_segments = array<i32: 0, 0, 0>} {\n  %r0, %read0_done = dataflow.load %a[%i] %start : memref<16xi32>\n  %r1, %read1_done = dataflow.load %a[%j] %start : memref<16xi32>\n  %write_done = dataflow.store %a[%i] %value %start : memref<16xi32>\n  %r2, %read2_done = dataflow.load %a[%j] %start : memref<16xi32>\n  %rb = memref.load %b[%i] : memref<16xi32>\n  dataflow.graph.return %start : none\n}","why":"An accepted loom-lower-graph-memory input: a top-level dataflow.graph private with a leading none start argument, input_segments/result_segments, memref graph inputs, in-place dataflow memory actors, and dataflow.graph.return. The grammar's module shape follows it."},{"file_sha256":"4295a7f0089a5b35f7f7f538032b31f51ca3966d4279faa030a2d493a8f76385","kind":"implementation","lines":"1326-1470","path":"lib/Frontend/Lowering/GraphRegionLowering.cpp","roles":["context"],"text":"void updateReadFrontiers(::mlir::Operation *op, ::mlir::Value done,\n                           MemoryState &memory) {\n    for (unsigned partition : partitionsFor(op)) {\n      MemoryFrontier &frontier = memory[partition];\n      frontier.read =\n          joinEvents(::mlir::ValueRange{frontier.read, done}, op->getLoc());\n    }\n  }\n\n  ::mlir::Value readControl(::mlir::Operation *op, ::mlir::Value execution,\n                            MemoryState &memory) {\n    ::llvm::SmallVector<::mlir::Value, 8> inputs{execution};\n    for (unsigned partition : partitionsFor(op))\n      inputs.push_back(memory[partition].write);\n    return joinEvents(inputs, op->getLoc());\n  }\n\n  ::mlir::Value writeControl(::mlir::Operation *op, ::mlir::Value execution,\n                             MemoryState &memory) {\n    ::llvm::SmallVector<::mlir::Value, 8> inputs{execution};\n    for (unsigned partition : partitionsFor(op))\n      inputs.push_back(memory[partition].read);\n    return joinEvents(inputs, op->getLoc());\n  }\n\n  void updateWriteFrontiers(::mlir::Operation *op, ::mlir::Value done,\n                            MemoryState &memory) {\n    for (unsigned partition : partitionsFor(op))\n      memory[partition] = {done, done};\n  }\n\n  void lowerMemrefLoad(::mlir::memref::LoadOp load, ::mlir::Value execution,\n                       MemoryState &memory) {\n    ::llvm::SmallVector<unsigned, 4> membership = partitionsFor(load);\n    ::mlir::Value ctrl = readControl(load, execution, memory);\n    setInsertionPoint(load.getLoc());\n    ::mlir::Value address = ::loom::lowering::detail::buildExactLinearIndex(\n        builder, load.getLoc(), load.getMemRefType(), load.getIndices(),\n        execution);\n    auto lowered = ::dataflow::LoadOp::create(\n        builder, load.getLoc(), load.getType(), builder.getNoneType(),\n        load.getMemref(), address, ctrl);\n    partitionsByAccess.try_emplace(lowered, std::move(membership));\n    load.getResult().replaceAllUsesWith(lowered.getData());\n    updateReadFrontiers(lowered, lowered.getDone(), memory);\n    load.erase();\n  }\n\n  void lowerMemrefStore(::mlir::memref::StoreOp store, ::mlir::Value execution,\n                        MemoryState &memory) {\n    ::llvm::SmallVector<unsigned, 4> membership = partitionsFor(store);\n    ::mlir::Value ctrl = writeControl(store, execution, memory);\n    setInsertionPoint(store.getLoc());\n    ::mlir::Value address = ::loom::lowering::detail::buildExactLinearIndex(\n        builder, store.getLoc(), store.getMemRefType(), store.getIndices(),\n        execution);\n    auto lowered = ::dataflow::StoreOp::create(\n        builder, store.getLoc(), builder.getNoneType(), store.getMemref(),\n        address, store.getValue(), ctrl);\n    partitionsByAccess.try_emplace(lowered, std::move(membership));\n    updateWriteFrontiers(lowered, lowered.getDone(), memory);\n    store.erase();\n  }\n\n  void lowerVectorRead(::mlir::vector::TransferReadOp read,\n                       ::mlir::Value execution, MemoryState &memory) {\n    ::llvm::SmallVector<unsigned, 4> membership = partitionsFor(read);\n    ::mlir::Value ctrl = readControl(read, execution, memory);\n    setInsertionPoint(read.getLoc());\n    auto memoryType =\n        ::llvm::cast<::mlir::MemRefType>(read.getBase().getType());\n    ::mlir::Value address = ::loom::lowering::detail::buildExactLinearIndex(\n        builder, read.getLoc(), memoryType, read.getIndices(), execution);\n    auto lowered = ::dataflow::LoadOp::create(\n        builder, read.getLoc(), read.getVectorType(), builder.getNoneType(),\n        read.getBase(), address, ctrl, read.getMask(), ::mlir::Attribute{});\n    partitionsByAccess.try_emplace(lowered, std::move(membership));\n    read.getResult().replaceAllUsesWith(lowered.getData());\n    updateReadFrontiers(lowered, lowered.getDone(), memory);\n    read.erase();\n  }\n\n  void lowerVectorWrite(::mlir::vector::TransferWriteOp write,\n                        ::mlir::Value execution, MemoryState &memory) {\n    ::llvm::SmallVector<unsigned, 4> membership = partitionsFor(write);\n    ::mlir::Value ctrl = writeControl(write, execution, memory);\n    setInsertionPoint(write.getLoc());\n    auto memoryType =\n        ::llvm::cast<::mlir::MemRefType>(write.getBase().getType());\n    ::mlir::Value address = ::loom::lowering::detail::buildExactLinearIndex(\n        builder, write.getLoc(), memoryType, write.getIndices(), execution);\n    auto lowered = ::dataflow::StoreOp::create(\n        builder, write.getLoc(), builder.getNoneType(), write.getBase(),\n        address, write.getValueToStore(), ctrl, write.getMask(),\n        ::mlir::Attribute{});\n    partitionsByAccess.try_emplace(lowered, std::move(membership));\n    updateWriteFrontiers(lowered, lowered.getDone(), memory);\n    write.erase();\n  }\n\n  void lowerDataflowLoad(::dataflow::LoadOp load, ::mlir::Value execution,\n                         MemoryState &memory) {\n    load.getCtrlMutable().assign(readControl(load, execution, memory));\n    updateReadFrontiers(load, load.getDone(), memory);\n    if (load->getBlock() != &entry)\n      load->moveBefore(anchor);\n  }\n\n  void lowerDataflowStore(::dataflow::StoreOp store, ::mlir::Value execution,\n                          MemoryState &memory) {\n    store.getCtrlMutable().assign(writeControl(store, execution, memory));\n    updateWriteFrontiers(store, store.getDone(), memory);\n    if (store->getBlock() != &entry)\n      store->moveBefore(anchor);\n  }\n\n  ::mlir::Value atomicControl(::mlir::Operation *op, ::mlir::Value execution,\n                              const MemoryState &memory) {\n    ::llvm::SmallVector<::mlir::Value, 8> inputs{execution};\n    for (const MemoryFrontier &frontier : memory) {\n      inputs.push_back(frontier.write);\n      inputs.push_back(frontier.read);\n    }\n    return joinEvents(inputs, op->getLoc());\n  }\n\n  void lowerDataflowAtomicRmw(::dataflow::AtomicRmwOp rmw,\n                              ::mlir::Value execution, MemoryState &memory) {\n    rmw.getCtrlMutable().assign(atomicControl(rmw, execution, memory));\n    updateWriteFrontiers(rmw, rmw.getDone(), memory);\n    if (rmw->getBlock() != &entry)\n      rmw->moveBefore(anchor);\n  }\n\n  void lowerDataflowCmpXchg(::dataflow::CmpXchgOp cmp, ::mlir::Value execution,\n                            MemoryState &memory) {\n    cmp.getCtrlMutable().assign(atomicControl(cmp, execution, memory));\n    updateWriteFrontiers(cmp, cmp.getDone(), memory);\n    if (cmp->getBlock() != &entry)\n      cmp->moveBefore(anchor);\n  }\n\n  void lowerDataflowFence(::dataflow::FenceOp fence, ::mlir::Value execution,\n                          const MemoryState &memory) {\n    fence.getCtrlMutable().assign(atomicControl(fence, execution, memory));","why":"The leaf transfer implementation that assigns each actor's ctrl operand (readControl/writeControl/atomicControl) and updates the frontiers. Confirms that the published ordering is expressed only through none-typed ctrl/done operands, which is what the postcondition traverses."}],"primary_bundle_sha256":"850f09fca4c1f333c2cf69b1f7468d08d16d85f3ff13db5953436fab23ff5b37","project":"PolyArch/loom","revision":"48615bc5925ef4b9db8b4550b5d4322933cf4b7b","schema":"spectriad.authoring-context/v1","selection_sha256":"282135881b7439135952e6aa3855384397c1df06a66ad5c411b3b5024070f820"}
generator source-blind backtranslation · sessions/reverse-generator/session-evidence/result-events.json
[
  {
    "api_error_status": null,
    "duration_api_ms": 36934,
    "duration_ms": 36987,
    "fast_mode_disabled_reason": "sdk_opt_in_required",
    "fast_mode_state": "off",
    "first_content_frame_ms": 1834,
    "is_error": false,
    "modelUsage": {
      "claude-opus-5": {
        "cacheCreationInputTokens": 4669,
        "cacheReadInputTokens": 0,
        "canonicalModel": "claude-opus-5",
        "contextWindow": 1000000,
        "costBasis": "list",
        "costUSD": 0.11755000000000002,
        "inputTokens": 2,
        "maxOutputTokens": 64000,
        "outputTokens": 2834,
        "provider": "firstParty",
        "thinkingTokens": 354,
        "webSearchRequests": 0
      }
    },
    "num_turns": 1,
    "permission_denials": [],
    "queued_turn_count": 0,
    "result": "## Preconditions\n\n1. Every emitted program is a single top-level `dataflow.graph` operation named `@sb_strand` with `private` visibility and no enclosing module wrapper.\n2. The graph's signature declares exactly seven block arguments in this order and with these types: `%start: none`, `%idx: index`, `%val: i32`, `%exp: i32`, `%des: i32`, `%a: memref<16xi32>`, `%b: memref<16xi32>`.\n3. The graph's result type list is empty (`-> ()`).\n4. The graph carries exactly two attributes, `input_segments = array<i32: 4, 0, 2>` and `result_segments = array<i32: 0, 0, 0>`, written in that order.\n5. The graph body consists of a single entry block with no explicit block label, no successors, no nested regions, and no control flow.\n6. The block body is a straight-line sequence of memory-actor and fence operations followed by exactly one terminator.\n7. The terminator is always `dataflow.graph.return %start : none`, i.e. the block returns the incoming `none` token and no other value.\n8. Every actor operation consumes the block argument `%start` as its incoming ordering/dependency token; no operation consumes a token produced by a preceding operation, so the strand is token-fan-out from `%start` rather than a token chain.\n9. Every actor operation produces an outgoing token result named `%d<i>` where `<i>` is that operation's zero-based position in the sequence.\n10. Every value-producing actor (loads and the read-modify-write) additionally produces a data result named `%r<i>` placed before the token result, so those operations have the two-result form `%r<i>, %d<i> = ...`.\n11. Store operations, plain fences, and all fence variants produce only the token result `%d<i>` and no data result.\n12. Every actor operation carries an `sb_index = <i> : i64` attribute whose integer equals the operation's zero-based sequence position, so `sb_index` values are consecutive from `0` and are unique within the graph.\n13. Every memory-touching operation addresses exactly one of the two graph memref arguments, `%a` or `%b`, and always uses the single-index subscript `[%idx]` with the block argument `%idx`.\n14. Every memory-touching operation is annotated with the trailing type `: memref<16xi32>`, matching the declared memref argument type; fences carry no trailing type.\n15. Loads take the form `dataflow.load <mem>[%idx] %start`; stores take the form `dataflow.store <mem>[%idx] %val %start` and always store the block argument `%val`; the read-modify-write takes the form `dataflow.atomic_rmw <mem>[%idx] %val %start`.\n16. Fences take the form `dataflow.fence %start` and carry a `contract = #dataflow.fence_contract<ordering = ..., sync_scope = <system>>`.\n17. Ordering semantics on memory accesses are expressed through a `contract` attribute of one of three attribute kinds \u2014 `#dataflow.atomic_access<...>`, `#dataflow.plain_access<...>`, or `#dataflow.rmw_contract<...>` \u2014 or are absent entirely for non-annotated plain accesses.\n18. Every `atomic_access` contract specifies `sync_scope = <system>` and `source_alignment_bytes = 4`; every `rmw_contract` wraps a nested `access = <...>` with the same `sync_scope = <system>` and `source_alignment_bytes = 4`.\n19. No SSA name is defined twice: `%r` and `%d` names are index-qualified, and the block arguments are never redefined.\n20. Results `%r<i>` and `%d<i>` are never used by any later operation or by the terminator, so every emitted program is well-formed with entirely dead actor results.\n21. The graph body is never empty: at least two actor operations always precede the terminator.\n\n## Sampling conventions\n\n1. The number of actor operations in the strand is drawn uniformly from the closed range 2 to 6.\n2. The actor list is built by right recursion with a counter starting at `0` and terminating exactly when the counter equals the drawn count, so indices run `0 \u2026 COUNT-1` with no gaps.\n3. The memref operand is re-chosen independently before each actor from the two-element set `{'%a', '%b'}`, so consecutive actors may or may not alias the same buffer; the initial default `'%a'` is always overwritten before use and never observable.\n4. Fence operations are still emitted with a freshly chosen memref selection in effect, but that selection is discarded because fences print no memref operand.\n5. Each actor is chosen independently and uniformly from exactly eleven fixed shapes: acquire atomic load, release atomic store, volatile plain load, volatile plain store, unannotated plain load, unannotated plain store, `seq_cst` fence, `acquire` fence, `release` fence, `seq_cst` volatile atomic store, and `add` atomic RMW.\n6. Atomic loads are always emitted with `ordering = acquire` and never with `monotonic`, `seq_cst`, or `relaxed`.\n7. Atomic stores are always emitted with `ordering = release`, except for the separate combined shape which is always `ordering = seq_cst` together with `is_volatile = true`.\n8. There is no acquire/release/`seq_cst` atomic *load* variant carrying `is_volatile = true`, and no volatile atomic load shape at all.\n9. The only atomic RMW kind emitted is `kind = add`, and its access ordering is always `monotonic`; no `sub`, `and`, `or`, `xor`, `max`, `min`, or exchange kinds appear.\n10. Fence orderings are restricted to `seq_cst`, `acquire`, and `release`; no `acq_rel` or `monotonic` fence is emitted.\n11. `sync_scope` is fixed to `<system>` everywhere; no agent, workgroup, or thread-level scopes are sampled.\n12. `source_alignment_bytes` is fixed to `4` everywhere it appears; no under- or over-aligned accesses are generated.\n13. Plain (`#dataflow.plain_access`) contracts are only ever emitted with `is_volatile = true`; a plain access with `is_volatile = false` is instead spelled as the fully attribute-free plain load/store shape.\n14. The graph name is the fixed literal `@sb_strand` and its visibility is fixed to `private`; no alternative names or public graphs are produced.\n15. Value names follow a fixed scheme: data results are `%r` plus the decimal sequence index, token results are `%d` plus the same index, with no other naming variation.\n16. The prologue and epilogue are constant literal text, including fixed indentation of four spaces for the signature continuation lines and two spaces for every body operation and the terminator.\n17. The memref type is fixed at `memref<16xi32>` for both buffers; no other element types, ranks, shapes, or memory spaces are sampled.\n18. The block arguments `%exp` and `%des` are declared in every program but never referenced by any emitted actor, since no compare-exchange shape is part of the actor alternatives.\n19. The `input_segments`/`result_segments` attribute values are hard-coded constants and are not derived from or varied with the sampled body.\n20. Only one memory strand is generated per program; the grammar never emits multiple graphs, multiple blocks, or parallel strands.",
    "result_index": 0,
    "session_id": "49ffa0d2-106e-4485-922d-314b6954c19a",
    "stop_reason": "end_turn",
    "subagent_stats": {
      "by_type": {},
      "completed": 0,
      "failed": 0,
      "killed": {
        "parent": 0,
        "system": 0,
        "user": 0
      },
      "max_depth": 0,
      "refused": {
        "budget": 0,
        "concurrency_limit": 0,
        "depth_limit": 0
      },
      "requested": {
        "background": 0,
        "foreground": 0,
        "unset": 0
      },
      "spawned": 0,
      "spawned_by_subagents": 0,
      "started_in_background": 0
    },
    "subtype": "success",
    "terminal_reason": "completed",
    "time_to_request_ms": 53,
    "total_cost_usd": 0.11755000000000002,
    "ttft_ms": 6212,
    "ttft_stream_ms": 1141,
    "type": "result",
    "usage": {
      "cache_creation": {
        "ephemeral_1h_input_tokens": 4669,
        "ephemeral_5m_input_tokens": 0
      },
      "cache_creation_input_tokens": 4669,
      "cache_read_input_tokens": 0,
      "inference_geo": "not_available",
      "input_tokens": 2,
      "iterations": [],
      "output_tokens": 2834,
      "output_tokens_details": {
        "thinking_tokens": 354
      },
      "server_tool_use": {
        "web_fetch_requests": 0,
        "web_search_requests": 0
      },
      "service_tier": "standard",
      "speed": "standard"
    },
    "uuid": "e998ce5e-26d0-45e9-a630-873fb8b4246e"
  }
]
postcondition source-blind backtranslation · sessions/reverse-postcondition/session-evidence/result-events.json
[
  {
    "api_error_status": null,
    "duration_api_ms": 18315,
    "duration_ms": 18341,
    "fast_mode_disabled_reason": "sdk_opt_in_required",
    "fast_mode_state": "off",
    "first_content_frame_ms": 1505,
    "is_error": false,
    "modelUsage": {
      "claude-opus-5": {
        "cacheCreationInputTokens": 7093,
        "cacheReadInputTokens": 0,
        "canonicalModel": "claude-opus-5",
        "contextWindow": 1000000,
        "costBasis": "list",
        "costUSD": 0.102915,
        "inputTokens": 2,
        "maxOutputTokens": 64000,
        "outputTokens": 1279,
        "provider": "firstParty",
        "thinkingTokens": 248,
        "webSearchRequests": 0
      }
    },
    "num_turns": 1,
    "permission_denials": [],
    "queued_turn_count": 0,
    "result": "This postcondition looks only at the subject's output program and first collects every operation carrying an `sb_index` attribute, then builds `sb` as the transitive closure of a single edge relation: an operation's result whose type is exactly `none` flowing into any operation that uses it, with the closure taken over the whole output program rather than only the tagged operations. From the tagged set it derives four selections: `effects`, tagged ops whose name is exactly `dataflow.load`, `dataflow.store`, `dataflow.atomic_rmw`, or `dataflow.cmpxchg`; `atomic_ops`, tagged ops with a `contract` attribute whose `kind` is one of `#dataflow.atomic_access`, `#dataflow.fence_contract`, `#dataflow.rmw_contract`, or `#dataflow.cmpxchg_contract`; and `volatile_ops`, `release_ops`, and `acquire_ops`, each selected by exact string equality of `contract.canonical_text` against a closed list of literal spellings (for example plain access with `is_volatile = true`, or atomic access at `release`/`acquire`/`seq_cst` with `sync_scope = <system>` and `source_alignment_bytes = 4`, and fence contracts at `release`/`acquire`/`seq_cst` with `sync_scope = <system>`), so any contract text differing in ordering, scope, alignment, or formatting is simply not selected. The quantification is universal and pairwise over these selections, with ordering always decided by the integer value of `sb_index`: for every ordered pair of `atomic_ops` and separately of `volatile_ops` with strictly increasing `sb_index`, the earlier operation must reach the later one in `sb`; for every `release_ops` member, every `effects` member with a strictly smaller `sb_index` must reach it; and for every `acquire_ops` member, it must reach every `effects` member with a strictly larger `sb_index`. The only admitted value sources are the operation's own `name`, the presence and content of its `sb_index` and `contract` attributes, and result/use/type structure of the output program; nothing is compared against the input program and no operation lacking `sb_index` is ever a pair endpoint. It accepts a program exactly when all four required reachability pairs hold under the `none`-typed-edge closure, and rejects it as soon as one required pair is missing from that closure, regardless of any other ordering mechanism present. Note that the assertions never forbid extra edges, so additional ordering beyond what is demanded is accepted. Behavior is vacuous whenever the relevant selections are empty or singleton \u2014 no `sb_index`-tagged ops at all, fewer than two matching atomics or volatiles, no exact-text release/acquire matches, or no tagged ops with the four effect names \u2014 and also when `sb_index` comparisons never yield a strictly ordered pair; non-vacuous behavior requires at least one qualifying pair with strictly ordered indices, and reading `sb_index.int` or `contract` on a selected operation whose attribute is not of the expected kind would be an evaluation error rather than a clean rejection.",
    "result_index": 0,
    "session_id": "a5565534-5792-4d8e-a9e2-862162706fc1",
    "stop_reason": "end_turn",
    "subagent_stats": {
      "by_type": {},
      "completed": 0,
      "failed": 0,
      "killed": {
        "parent": 0,
        "system": 0,
        "user": 0
      },
      "max_depth": 0,
      "refused": {
        "budget": 0,
        "concurrency_limit": 0,
        "depth_limit": 0
      },
      "requested": {
        "background": 0,
        "foreground": 0,
        "unset": 0
      },
      "spawned": 0,
      "spawned_by_subagents": 0,
      "started_in_background": 0
    },
    "subtype": "success",
    "terminal_reason": "completed",
    "time_to_request_ms": 26,
    "total_cost_usd": 0.102915,
    "ttft_ms": 5033,
    "ttft_stream_ms": 1075,
    "type": "result",
    "usage": {
      "cache_creation": {
        "ephemeral_1h_input_tokens": 7093,
        "ephemeral_5m_input_tokens": 0
      },
      "cache_creation_input_tokens": 7093,
      "cache_read_input_tokens": 0,
      "inference_geo": "not_available",
      "input_tokens": 2,
      "iterations": [],
      "output_tokens": 1279,
      "output_tokens_details": {
        "thinking_tokens": 248
      },
      "server_tool_use": {
        "web_fetch_requests": 0,
        "web_search_requests": 0
      },
      "service_tier": "standard",
      "speed": "standard"
    },
    "uuid": "3792734b-c2f6-455b-81ef-404878d32266"
  }
]

Activation review

This paired revision was activated by an explicit partial-scope team review bound to both executable artifact hashes.

Approved for execution and public reporting; translation accuracy and completeness remain separately unvalidated.

Run and triage

Work progress