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

# avol0 = # avol, # lpt0 = # avol, # buf1 = EB_PAGE_SIZE, rofs0 ↔ rofs, avol0[m] = mapped(buf0), wbuf = mkwbuf(buf1, m1, m2), m2 < EB_PAGE_SIZE, m < # avol, abs(avol, buffered(m), mkwbuf(buf1, m1, m2), avol0, rofs), awbuf-inv(avol, buffered(m)), ebm-vol-inv(avol0), is-aligned(m1, EB_PAGE_SIZE), # avol[m].data + n ≤ LEB_SIZE, n ≤ # buf, ¬ rofs → # buf0 = m1, rofs → m1 ≤ # buf0 ⊦ ⟪wbuf_write_buf#(n, buf, buffered(m), EB_PAGE_SIZE, adr0, m0, plog0, lpt0, ns0; wbuf, rofs, avol0; err)⟫ ⟨awbuf_write_buf#(n, buf, adr0, m0, plog0, lpt0, ns0, buffered(m); avol, rofs0; err0)⟩ (abs(avol, buffered(m), wbuf, avol0, rofs) ∧ (rofs0 ↔ rofs) ∧ err = err0)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 11:
# buf1 = EB_PAGE_SIZE, # lpt0 = # avol1, # avol0 = # avol1, rofs0 ↔ rofs, avol0[m4] = mapped(buf2), adr = adr0, avol = avol0, bleb = buffered(m4), buf0 = buf, lpt = lpt0, m = m3, m0 = EB_PAGE_SIZE, n2 = n, ns = ns0, plog = plog0, wbuf = mkwbuf(buf1, m1, m2), m4 < # avol1, m2 < EB_PAGE_SIZE, abs(avol1, buffered(m4), mkwbuf(buf1, m1, m2), avol0, rofs), awbuf-inv(avol1, buffered(m4)), ebm-vol-inv(avol0), is-aligned(m1, EB_PAGE_SIZE), n ≤ # buf, # avol1[m4].data + n ≤ LEB_SIZE, rofs → m1 ≤ # buf2, ¬ rofs → # buf2 = m1 ⊦ ⟪if bleb ≠ nobuffer ∧ (¬ rofs → wbuf.offset + wbuf.nbytes + n2 ≤ LEB_SIZE ∧ n2 ≤ # buf0) then if rofs then err := EROFS else if wbuf.nbytes + n2 ≥ m0 then let n1 = align↓(wbuf.nbytes + n2, m0) in let n0 = n1 - wbuf.nbytes in let n = (wbuf.nbytes + n2) % m0 in let buf = mkbuf(n1) in {buf := copy(wbuf.content, 0, buf, 0, wbuf.nbytes); buf := copy(buf0, 0, buf, wbuf.nbytes, n0); apersistence_io_write#(bleb.leb, wbuf.offset, 0, n1, buf, adr, m, plog, lpt, ns; avol; err); if err = ESUCCESS then {wbuf.content := copy(buf0, n0, wbuf.content, 0, n); wbuf.offset := wbuf.offset + n1; wbuf.nbytes := n} else rofs := true} else {wbuf.content := copy(buf0, 0, wbuf.content, wbuf.nbytes, n2); wbuf.nbytes := wbuf.nbytes + n2; err := ESUCCESS} else abort⟫ ⟨awbuf_write_buf#(n, buf, adr0, m3, plog0, lpt0, ns0, buffered(m4); avol1, rofs0; err0)⟩ (abs(avol1, buffered(m4), wbuf, avol, rofs) ∧ (rofs0 ↔ rofs) ∧ err = err0)

Rule argument

pos: right 1

Additional information

Used simplifier rules: wbuf_write_buf# (N, BUF, BUFLEB, PAGESIZE, PROOTADR, PMAXINO, PLOG, PLPT, PORPHANS ; WBUF, ROFS, PVOL ; ERR ) {if BUFLEB ≠ nobuffer ∧ (¬ ROFS → WBUF.offset + WBUF.nbytes + N ≤ LEB_SIZE ∧ N ≤ # BUF) then if ROFS then ERR := EROFS else if WBUF.nbytes + N ≥ PAGESIZE then let N0 = align↓(WBUF.nbytes + N, PAGESIZE) in let N1 = N0 - WBUF.nbytes in let N2 = (WBUF.nbytes + N) % PAGESIZE in let BUF0 = mkbuf(N0) in {BUF0 := copy (WBUF.content, 0, BUF0, 0, WBUF.nbytes); BUF0 := copy(BUF, 0, BUF0, WBUF.nbytes, N1); apersistence_io_write# (BUFLEB.leb, WBUF.offset, 0, N0, BUF0, PROOTADR, PMAXINO, PLOG, PLPT, PORPHANS ; PVOL ; ERR); if ERR = ESUCCESS then {WBUF.content := copy (BUF, N1, WBUF.content, 0, N2); WBUF.offset := WBUF.offset + N0; WBUF.nbytes := N2} else ROFS := true} else {WBUF.content := copy(BUF, 0, WBUF.content, WBUF.nbytes, N); WBUF.nbytes := WBUF.nbytes + N; ERR := ESUCCESS} else abort };