[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 17 from proof write-loop-0 (previous step)

VFS_PAGE_SIZE = n0 + (ino2 + ino5) % VFS_PAGE_SIZE, buf0 = buf, err = ESUCCESS, ino = (ino2 + ino5) % VFS_PAGE_SIZE, ino0 = ino5, n = min(ino1 - ino2 + ino5, n0), pageno = (ino2 + ino5) / VFS_PAGE_SIZE, ino2 + ino5 ≤ ino1, ino1 ≥ ino2 + ino5, ino5 = 0 → files = files1 ⊦ [let buf = mkbuf(VFS_PAGE_SIZE) in {afs_readpage#(inode, pageno, dirs, files, asynced; buf, err); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {buf := copy(buf0, ino0, buf, ino, n); afs_writepage#(inode, pageno, buf, dirs; err, files; asynced)}}; n := min(ino1 - ino2 + ino5, n0); if err = ESUCCESS then ino5 := ino5 + n] (ino5 = 0 → files = files1), VFS_PAGE_SIZE = 0, min(ino1 - ino2 + ino5, n0) = 0

Heuristic symbolic execution applied rule let right

And obtained the following new goals

Rule argument

Additional information