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

VFS_PAGE_SIZE = n0 + (ino2 + ino0) % VFS_PAGE_SIZE, err = ESUCCESS, min(ino1 - ino2 + ino0, n0) ≠ 0, ino2 + ino0 ≤ ino1 ⊦ [vfs_writepage# (inode, (ino2 + ino0) / VFS_PAGE_SIZE, buf, ino0, (ino2 + ino0) % VFS_PAGE_SIZE, min(ino1 - ino2 + ino0, n0), dirs; err, files, asynced); if err = ESUCCESS then ino3 := ino0 + min(ino1 - ino2 + ino0, n0)] (err = ESUCCESS ∨ ⌊err⌋ )

User applied rule call right

And obtained the following new goals

Proof step 16:
⊦
Proof step 17:
VFS_PAGE_SIZE = n0 + (ino2 + ino0) % VFS_PAGE_SIZE, buf0 = buf, err = ESUCCESS, ino = (ino2 + ino0) % VFS_PAGE_SIZE, n = min(ino1 - ino2 + ino0, n0), pageno = (ino2 + ino0) / VFS_PAGE_SIZE, ino2 + ino0 ≤ ino1, ino1 ≥ ino2 + ino0 ⊦ [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)}}; if err = ESUCCESS then ino3 := ino0 + min(ino1 - ino2 + ino0, n0)] (err = ESUCCESS ∨ ⌊err⌋ ), VFS_PAGE_SIZE = 0, min(ino1 - ino2 + ino0, n0) = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: write-page: ⊦ ;