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

# avol0 = # lpt + m6, # buf1 = # buf5, # buf5 = n0 + n2 + n1, avol0[m2] = mapped(buf4), avol0[m3] = mapped(buf3), avol0[0] = mapped(buf2), avol0[m6 + m8] = mapped(buf0), m8 < # lpt, disk-layout(mksb(adr, m1, m2, m3, m4, m5, m6), # lpt), ebm-vol-inv(avol0), ebm-vol-inv(subarray(avol0, m6, # lpt)), is-encoded(log, buf4), is-encoded(lpt, lebs(avol0, m5, lptlebs(# lpt, LEB_SIZE))), is-encoded(mksb(adr, m1, m2, m3, m4, m5, m6), buf2), is-encoded-pad(orphans, m4, buf3), mapped-full?(avol0, m5, lptlebs(# lpt, LEB_SIZE)), range=(buf5, n2 + n1, buf1, n2 + n1, n0), range=(buf5, 0, buf1, 0, n2), m6 ≤ # avol0, m7 + n1 ≤ LEB_SIZE, n2 + n1 ≤ # buf5, ⌊err0⌋ , logoff ≠ LEB_SIZE → # buf4 = logoff ⊦ ⟨apersistence_io_read#(m8, m7, n2, n1, adr, m1, log, subarray(avol0, m6, # lpt), lpt, orphans; buf5; err1)⟩ (buf1 = buf5 ∧ err0 = err1)

Heuristic nonrecursive calls applied rule call right

And obtained the following new goals

Proof step 50:
# buf5 = n3 + n2 + n1, # buf1 = # buf5, # avol0 = # lpt + m6, avol0[m6 + m8] = mapped(buf), avol0[0] = mapped(buf2), avol0[m3] = mapped(buf3), avol0[m2] = mapped(buf4), avol = subarray(avol0, m6, # lpt), buf0 = buf5, m = m9, m0 = m7, m1 = m8, n = n1, n0 = n2, ns = orphans, plog = log, m8 < # lpt, disk-layout(mksb(adr, m9, m2, m3, m4, m5, m6), # lpt), ebm-vol-inv(subarray(avol0, m6, # lpt)), ebm-vol-inv(avol0), is-encoded(mksb(adr, m9, m2, m3, m4, m5, m6), buf2), is-encoded(lpt, lebs(avol0, m5, lptlebs(# lpt, LEB_SIZE))), is-encoded(log, buf4), is-encoded-pad(orphans, m4, buf3), mapped-full?(avol0, m5, lptlebs(# lpt, LEB_SIZE)), range=(buf5, 0, buf1, 0, n2), range=(buf5, n2 + n1, buf1, n2 + n1, n3), m6 + # lpt ≤ # avol0, n2 + n1 ≤ # buf5, m7 + n1 ≤ LEB_SIZE, m6 ≤ # avol0, ⌊err0⌋ , logoff ≠ LEB_SIZE → # buf4 = logoff ⊦ ⟨if m1 < # avol ∧ avol[m1].mapped? ∧ n0 + n ≤ # buf0 ∧ m0 + n ≤ LEB_SIZE then {fail_or_success#(; ; err); if err = ESUCCESS then buf0 := copy(avol[m1].data + mkempbuf(LEB_SIZE - # avol[m1].data), m0, buf0, n0, n) else choose buf with # buf = # buf0 ∧ range=(buf0, 0, buf, 0, n0) ∧ range=(buf0, n0 + n, buf, n0 + n, # buf0 - n0 + n) in buf0 := buf} else abort⟩ (buf1 = buf0 ∧ err0 = err)

Rule argument

pos: right 1

Additional information

Used simplifier rules: apersistence_io_read# (LNUM, OFFSET, N0, N, PROOTADR, PMAXINO, PLOG, PVOL, PLPT, PORPHANS ; BUF ; ERR ) {if LNUM < # PVOL ∧ PVOL[LNUM].mapped? ∧ N0 + N ≤ # BUF ∧ OFFSET + N ≤ LEB_SIZE then {fail_or_success#(; ; ERR); if ERR = ESUCCESS then BUF := copy ( PVOL[LNUM].data + mkempbuf(LEB_SIZE - # PVOL[LNUM].data), OFFSET, BUF, N0, N) else choose BUF0 with # BUF0 = # BUF ∧ range=(BUF, 0, BUF0, 0, N0) ∧ range=(BUF, N0 + N, BUF0, N0 + N, # BUF - N0 + N) in BUF := BUF0} else abort };% ⊦ m ≤ n ↔ ¬ n < m; (ss)%c: ⊦ m + n = n + m; from specification nat-basic%lf-02: ⊦ m < n ∧ m = n0 → n0 < n; (forward) from specification nat-basic%lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic%fle-01: ⊦ m ≤ n ∧ n < n0 → m < n0; (forward) from specification nat% ⊦ m < n → ¬ n < m; (s)