[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 15 from proof inv-write-buf (previous step)

# lpt = # avol, avol[n0] = mapped(buf0), m = buffered(n0).leb, buffered(n0).isbuf?, n0 < # avol, awbuf-inv(avol, buffered(n0)), n ≤ # buf, # buf0 + n ≤ LEB_SIZE, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪ 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⟫ (awbuf-inv(avol, buffered(n0)) ∧ # lpt = # avol), err0 = ESUCCESS

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Proof step 16:
# lpt = # avol, avol[n0] = mapped(buf0), m = buffered(n0).leb, buffered(n0).isbuf?, n0 < # avol, awbuf-inv(avol, buffered(n0)), # buf0 + n ≤ LEB_SIZE, n ≤ # buf, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪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; isbuf := true⟫ (awbuf-inv(avol, buffered(n0)) ∧ # lpt = # avol), err0 = ESUCCESS
Proof step 22:
# lpt = # avol, avol[n0] = mapped(buf0), m = buffered(n0).leb, buffered(n0).isbuf?, n0 < # avol, awbuf-inv(avol, buffered(n0)), # buf0 + n ≤ LEB_SIZE, n ≤ # buf, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪skip; isbuf := true⟫ (awbuf-inv(avol, buffered(n0)) ∧ # lpt = # avol), err0 = ESUCCESS

Proof step 15 from proof inv-write-buf (previous step)

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information