[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 24 from proof prepost-read-log (previous step)

# buf = EB_PAGE_SIZE, LEB_SIZE = n1 + logoff0, avol[m5] = mapped(buf0), buf1 = buf, err = err0, logoff0 < LEB_SIZE, m5 < # avol, ebm-vol-inv(avol), is-aligned(logoff0, EB_PAGE_SIZE), is-encoded(log, subarray(buf0, 0, logoff0)), is-encoded(log0, buf0), logoff0 ≤ # buf0, logoff0 + EB_PAGE_SIZE ≤ LEB_SIZE, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ ⟪if err = ESUCCESS then buf1 := copy(avol[m5].data + mkempbuf(LEB_SIZE - # avol[m5].data), logoff0, buf1, 0, EB_PAGE_SIZE) else {n0 := 0; n := EB_PAGE_SIZE; choose buf with # buf = # buf1 ∧ range=(buf1, 0, buf, 0, n0) ∧ range=(buf1, n0 + n, buf, n0 + n, # buf1 - n0 + n) in buf1 := buf}; m0 := EB_PAGE_SIZE; buf := buf1; if err = ESUCCESS then if buf = mkempbuf(# buf) then err := ENOENT else let rnd = ? in {decode_ref_node#(m0, buf; rnd; err); if err = ESUCCESS then log := log + rnd.leb '}; logoff := logoff0 + m0⟫ ( logoff ≤ LEB_SIZE ∧ # buf = m0 ∧ is-aligned(logoff, # buf) ∧ (err = ESUCCESS ∨ err = ENOENT ∨ ⌊err⌋ ) ∧ avol[m5].mapped? ∧ (err = ESUCCESS → logoff ≤ # avol[m5].data ∧ is-encoded(log, subarray(avol[m5].data, 0, logoff))) ∧ (err = ENOENT → is-encoded(log, avol[m5].data)) ∧ LEB_SIZE < n1 + logoff), n1 = 0

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information