[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 9 from proof crash-neutral-write-buf (previous step)

# lpt = # avol, avol[n0] = mapped(buf0), n0 < # avol, awbuf-inv(avol, buffered(n0)), synced(avol0), avol0 ↓ avol, # buf0 + n ≤ LEB_SIZE, n ≤ # buf ⊦ ⟨fail_or_success#(; ; err); let m = buffered(n0).leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) else { choose n1 with n1 ≠ 0 ∧ n1 < n ∧ is-aligned(# avol[m].data + n1, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n1)) ifnone skip or skip; isbuf := true}⟩ (avol0 ↓ avol)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 10:
# lpt = # avol, avol[n0] = mapped(buf0), n0 < # avol, awbuf-inv(avol, buffered(n0)), synced(avol0), avol0 ↓ avol, n ≤ # buf, # buf0 + n ≤ LEB_SIZE ⊦ ⟨choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; let m = buffered(n0).leb in if err = ESUCCESS then avol[m] := mapped(avol[m].data + subarray(buf, 0, n)) else { choose n1 with n1 ≠ 0 ∧ n1 < n ∧ is-aligned(# avol[m].data + n1, EB_PAGE_SIZE) in avol[m] := mapped(avol[m].data + subarray(buf, 0, n1)) ifnone skip or skip; isbuf := true}⟩ (avol0 ↓ avol)

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail_or_success#(; ; ERR) {choose ERR0 with ⌊ERR0⌋ ∨ ERR0 = ESUCCESS in ERR := ERR0};