[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 34 from proof fsync-pages-err (previous step)

pcache[datakey(m, n)] = mkpentry(true, buf), err = ESUCCESS, n * VFS_PAGE_SIZE < m2, datakey(m, n) ∈ pcache, err0 = ESUCCESS ∨ ⌊err0⌋ ⊦ [afs_writepage#(mkinode(m, md, boolvar, m0, m1, m2), n, buf, dirs; err, files; asynced1); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced1); if err = ESUCCESS then {asynced := false; pcache_set_status#(m, n, asynced; err, pcache)}; n := n + 1] (err = ESUCCESS ∨ ⌊err⌋ )

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 35:
pcache[datakey(m, n)] = mkpentry(true, buf), err = ESUCCESS, inode = mkinode(m, md, boolvar, m0, m1, m2), pageno = n, n * VFS_PAGE_SIZE < m2, datakey(m, n) ∈ pcache, err0 = ESUCCESS ∨ ⌊err0⌋ ⊦ [if pre-writepage(inode, pageno, buf, dirs, files) then {{files[inode.ino].content[pageno] := buf; err := ESUCCESS} or fail#(; ; err); asynced := ?} else abort; if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced1); if err = ESUCCESS then {asynced := false; pcache_set_status#(m, n, asynced; err, pcache)}; n := n + 1] (err = ESUCCESS ∨ ⌊err⌋ )

Rule argument

pos: right 1

Additional information

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