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

# avol0 = # avol1, # lpt0 = # avol1, # buf2 = EB_PAGE_SIZE, LEB_SIZE = n1 + # buf1, LEB_SIZE = n0 + # buf4, avol1[m2] = mapped(buf1), avol0[m2] = mapped(buf4), m2 < # avol1, abs(avol1, bleb, mkwbuf(buf2, m6, m4), avol0, rofs), awbuf-inv(avol1, bleb), ebm-vol-inv(avol0), # buf1 ≤ LEB_SIZE, n ≤ # buf3, # buf4 ≤ LEB_SIZE, m0 + n ≤ LEB_SIZE, bleb ≠ nobuffer → bleb.leb < # avol1 ∧ avol0[bleb.leb].mapped? ∧ m4 < EB_PAGE_SIZE ∧ (¬ rofs → # avol0[bleb.leb].data = m6) ∧ (rofs → m6 ≤ # avol0[bleb.leb].data) ∧ is-aligned(m6, EB_PAGE_SIZE) ⊦ copy(buf4 + mkempbuf(n0), m0, buf3, 0, n) = copy(buf1 + mkempbuf(n1), m0, buf3, 0, n), buffered(m2) = bleb ∧ m0 ≤ m6 + m4 ∧ m6 ≤ m0 + n

User applied rule constructor cut

And obtained the following new goals

Proof step 314:
# buf2 = EB_PAGE_SIZE, # lpt0 = # avol1, # avol0 = # avol1, LEB_SIZE = n0 + # buf4, LEB_SIZE = n1 + # buf1, avol0[m2] = mapped(buf4), avol1[m2] = mapped(buf1), bleb = buffered(n2), m2 < # avol1, abs(avol1, bleb, mkwbuf(buf2, m6, m4), avol0, rofs), awbuf-inv(avol1, bleb), ebm-vol-inv(avol0), m0 + n ≤ LEB_SIZE, # buf4 ≤ LEB_SIZE, n ≤ # buf3, # buf1 ≤ LEB_SIZE, bleb ≠ nobuffer → bleb.leb < # avol1 ∧ avol0[bleb.leb].mapped? ∧ m4 < EB_PAGE_SIZE ∧ (¬ rofs → # avol0[bleb.leb].data = m6) ∧ (rofs → m6 ≤ # avol0[bleb.leb].data) ∧ is-aligned(m6, EB_PAGE_SIZE) ⊦ copy(buf4 + mkempbuf(n0), m0, buf3, 0, n) = copy(buf1 + mkempbuf(n1), m0, buf3, 0, n), buffered(m2) = bleb ∧ m0 ≤ m6 + m4 ∧ m6 ≤ m0 + n

Rule argument

var: bleb

Additional information

Used simplifier rules: bufleb freely generated by nobuffer, buffered;;% ⊦ abs(avol0, nobuffer, wbuf, avol1, rofs) ↔ avol0 = avol1; (s)% ⊦ nobuffer ≠ buffered(m); (s)%f: ⊦ m < n → n ≠ 0; (forward) from specification nat-basic% ⊦ mapped(buf) = mapped(buf0) ↔ buf = buf0; (s)% ⊦ m < n → n ≠ 0; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic%eqs: ⊦ m = n + n0 ∧ m = n + n1 → n0 = n1; (forward) from specification nat-basic