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

# avol0 = # avol1, # lpt0 = # avol1, # buf1 = EB_PAGE_SIZE, avol0[m4] = mapped(buf2), align↓(m2 + n3, EB_PAGE_SIZE) = n + m2, n3 ≠ 0, m2 < EB_PAGE_SIZE, m4 < # avol1, abs(avol1, buffered(m4), mkwbuf(buf1, # buf2, m2), avol0, false), awbuf-inv(avol1, buffered(m4)), ebm-vol-inv(avol0), is-aligned(n + m2, EB_PAGE_SIZE), is-aligned(# buf2, EB_PAGE_SIZE), # avol1[m4].data + n3 ≤ LEB_SIZE, n3 ≤ # buf3, EB_PAGE_SIZE ≤ m2 + n3, # buf2 + m2 + n3 ≤ LEB_SIZE, n ≤ # buf3, # buf2 + n + m2 ≤ LEB_SIZE ⊦ ⟪fail_or_success#(; ; err); if err = ESUCCESS then if n + m2 ≠ 0 then avol0[buffered(m4).leb] := mapped ( avol0[buffered(m4).leb].data + mkempbuf(# buf2 - # avol0[buffered(m4).leb].data) + subarray(copy(buf3, 0, copy(buf1, 0, mkbuf(n + m2), 0, m2), m2, n), 0, n + m2)) else {n1 := 0; n0 := n + m2; m1 := buffered(m4).leb; m0 := # buf2; buf := copy(buf3, 0, copy(buf1, 0, mkbuf(n + m2), 0, m2), m2, n); choose n2 with n2 < n0 ∧ is-aligned(n2, EB_PAGE_SIZE) in if n2 ≠ 0 then avol0[m1] := mapped(avol0[m1].data + mkempbuf(m0 - # avol0[m1].data) + subarray(buf, n1, n2)) ifnone skip}; wbuf := mkwbuf(buf1, # buf2, m2); rofs := false; if err = ESUCCESS then {wbuf.content := copy(buf3, n, wbuf.content, 0, (m2 + n3) % EB_PAGE_SIZE); wbuf.offset := wbuf.offset + align↓(m2 + n3, EB_PAGE_SIZE); wbuf.nbytes := (m2 + n3) % EB_PAGE_SIZE} else rofs := true⟫ ⟨rofs0 := false; awbuf_write_buf#(n3, buf3, adr0, m3, plog0, lpt0, ns0, buffered(m4); avol1, rofs0; err0)⟩ (abs(avol1, buffered(m4), wbuf, avol0, rofs) ∧ (rofs0 ↔ rofs) ∧ err = err0)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 33:
# buf1 = EB_PAGE_SIZE, # lpt0 = # avol1, # avol0 = # avol1, avol0[m4] = mapped(buf2), align↓(m2 + n3, EB_PAGE_SIZE) = n + m2, m4 < # avol1, m2 < EB_PAGE_SIZE, abs(avol1, buffered(m4), mkwbuf(buf1, # buf2, m2), avol0, false), awbuf-inv(avol1, buffered(m4)), ebm-vol-inv(avol0), is-aligned(# buf2, EB_PAGE_SIZE), is-aligned(n + m2, EB_PAGE_SIZE), # buf2 + n + m2 ≤ LEB_SIZE, n ≤ # buf3, # buf2 + m2 + n3 ≤ LEB_SIZE, EB_PAGE_SIZE ≤ m2 + n3, n3 ≤ # buf3, # avol1[m4].data + n3 ≤ LEB_SIZE ⊦ ⟪choose err0 with ⌊err0⌋ ∨ err0 = ESUCCESS in err := err0; if err = ESUCCESS then if n + m2 ≠ 0 then avol0[buffered(m4).leb] := mapped ( avol0[buffered(m4).leb].data + mkempbuf(# buf2 - # avol0[buffered(m4).leb].data) + subarray(copy(buf3, 0, copy(buf1, 0, mkbuf(n + m2), 0, m2), m2, n), 0, n + m2)) else {n1 := 0; n0 := n + m2; m1 := buffered(m4).leb; m0 := # buf2; buf := copy(buf3, 0, copy(buf1, 0, mkbuf(n + m2), 0, m2), m2, n); choose n2 with n2 < n0 ∧ is-aligned(n2, EB_PAGE_SIZE) in if n2 ≠ 0 then avol0[m1] := mapped(avol0[m1].data + mkempbuf(m0 - # avol0[m1].data) + subarray(buf, n1, n2)) ifnone skip}; wbuf := mkwbuf(buf1, # buf2, m2); rofs := false; if err = ESUCCESS then {wbuf.content := copy(buf3, n, wbuf.content, 0, (m2 + n3) % EB_PAGE_SIZE); wbuf.offset := wbuf.offset + align↓(m2 + n3, EB_PAGE_SIZE); wbuf.nbytes := (m2 + n3) % EB_PAGE_SIZE} else rofs := true⟫ ⟨rofs0 := false; awbuf_write_buf#(n3, buf3, adr0, m3, plog0, lpt0, ns0, buffered(m4); avol1, rofs0; err0)⟩ (abs(avol1, buffered(m4), wbuf, avol0, rofs) ∧ (rofs0 ↔ rofs) ∧ err = err0), n3 = 0

Rule argument

pos: right 1

Additional information

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