[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 13 from proof read-loop-err (previous step)

VFS_PAGE_SIZE = n0 + (ino2 + ino0) % VFS_PAGE_SIZE, buf = mkbuf(VFS_PAGE_SIZE), err = ESUCCESS, ino1 ≠ ino2 + ino0, m2 ≠ ino2 + ino0, n0 ≠ 0, ino2 + ino0 < ino1, ino2 + ino0 < m2 ⊦ [afs_readpage#(mkinode(m, md, boolvar, m0, m1, m2), (ino2 + ino0) / VFS_PAGE_SIZE, dirs, files, asynced; buf, err); if err = ESUCCESS then {buf0 := copy(buf, (ino2 + ino0) % VFS_PAGE_SIZE, buf0, ino0, min(ino1 - ino2 + ino0, n0, m2 - ino2 + ino0)); ino3 := ino0 + min(ino1 - ino2 + ino0, n0, m2 - ino2 + ino0)}] (⌊err⌋ ∨ err = ESUCCESS)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 14:
VFS_PAGE_SIZE = n0 + (ino2 + ino0) % VFS_PAGE_SIZE, buf = mkbuf(VFS_PAGE_SIZE), err = ESUCCESS, inode = mkinode(m, md, boolvar, m0, m1, m2), pageno = (ino2 + ino0) / VFS_PAGE_SIZE, ino2 + ino0 < m2, ino2 + ino0 < ino1 ⊦ [if pre-readpage(inode, pageno, buf, dirs, files) then { {if pageno ∈ files[inode.ino].content then buf := files[inode.ino].content[pageno] else buf := zeropage; err := ESUCCESS} or fail#(; ; err)} else abort; if err = ESUCCESS then {buf0 := copy(buf, (ino2 + ino0) % VFS_PAGE_SIZE, buf0, ino0, min(ino1 - ino2 + ino0, n0, m2 - ino2 + ino0)); ino3 := ino0 + min(ino1 - ino2 + ino0, n0, m2 - ino2 + ino0)}] (⌊err⌋ ∨ err = ESUCCESS), VFS_PAGE_SIZE = 0, ino1 = ino2 + ino0, m2 = ino2 + ino0, n0 = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_readpage#(INODE, PAGENO, DIRS, FILES, ASYNCED; PBUF, ERR) {if pre-readpage(INODE, PAGENO, PBUF, DIRS, FILES) then { {if PAGENO ∈ FILES[INODE.ino].content then PBUF := FILES[INODE.ino].content[PAGENO] else PBUF := zeropage; ERR := ESUCCESS} or fail#(; ; ERR)} else abort };