[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 391 from proof inv-write (previous step)

VFS_PAGE_SIZE = n1 + (m0 + ino0) % VFS_PAGE_SIZE, files0[m] = mkfile(m1, md, # links(m, dirs), content0), of[fd] = mkfile(m, mode, m0), buf = mkbuf(VFS_PAGE_SIZE), err = ESUCCESS, inode = mkinode(m, md, false, # links(m, dirs), 0, m1), pageno = (m0 + ino0) / VFS_PAGE_SIZE, dom of < ino3, afs-cons(dirs, files0), afs-cons(dirs, files), of-cons(of, dirs, files0), of-cons(of, dirs, files), fd ∈ of, m ∈ files0, ino0 ≤ n0, n0 ≤ # buf0, ino0 ≤ # buf0 ⊦ [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 afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {buf := copy(buf0, ino0, buf, (m0 + ino0) % VFS_PAGE_SIZE, min(m0 + n0 - m0 + ino0, n1)); afs_writepage#(mkinode(m, md, false, # links(m, dirs), 0, m1), (m0 + ino0) / VFS_PAGE_SIZE, buf, dirs; err, files; asynced)}; if err = ESUCCESS then ino3 := ino0 + min(m0 + n0 - m0 + ino0, n1)] (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), VFS_PAGE_SIZE = 0, min(n0 - ino0, n1) = 0, n0 = 0, mode ≠ MODE_W ∧ mode ≠ MODE_RW, m1 % VFS_PAGE_SIZE ≠ 0 ∧ m1 / VFS_PAGE_SIZE ∈ content0

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 392:
VFS_PAGE_SIZE = n1 + (m0 + ino0) % VFS_PAGE_SIZE, of[fd] = mkfile(m, mode, m0), files0[m] = mkfile(m1, md, # links(m, dirs), content0), buf = mkbuf(VFS_PAGE_SIZE), err = ESUCCESS, inode = mkinode(m, md, false, # links(m, dirs), 0, m1), pageno = (m0 + ino0) / VFS_PAGE_SIZE, dom of < ino3, afs-cons(dirs, files), afs-cons(dirs, files0), of-cons(of, dirs, files), of-cons(of, dirs, files0), m ∈ files0, fd ∈ of, ino0 ≤ # buf0, n0 ≤ # buf0, ino0 ≤ n0 ⊦ [{if pageno ∈ files[inode.ino].content then buf := files[inode.ino].content[pageno] else buf := zeropage; err := ESUCCESS} or fail#(; ; err); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {buf := copy(buf0, ino0, buf, (m0 + ino0) % VFS_PAGE_SIZE, min(m0 + n0 - m0 + ino0, n1)); afs_writepage#(mkinode(m, md, false, # links(m, dirs), 0, m1), (m0 + ino0) / VFS_PAGE_SIZE, buf, dirs; err, files; asynced)}; if err = ESUCCESS then ino3 := ino0 + min(m0 + n0 - m0 + ino0, n1)] (of-cons(of, dirs, files) ∧ afs-cons(dirs, files)), VFS_PAGE_SIZE = 0, min(n0 - ino0, n1) = 0, n0 = 0, m1 % VFS_PAGE_SIZE ≠ 0 ∧ m1 / VFS_PAGE_SIZE ∈ content0, mode ≠ MODE_W ∧ mode ≠ MODE_RW

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ pre-readpage(inode, n, buf, dirs, files) ↔ valid-file-ino(inode.ino, dirs, files) ∧ # buf = VFS_PAGE_SIZE; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ valid-file-ino(ino, dirs, files) ↔ ino ∈ files; (s)%⊦ of-cons(of, dirs, files) ∧ fd ∈ of ∧ of[fd] = mkfile(ino, mode, n) → ino ∈ files; (ss)% ⊦ # mkbuf(n) = n; (s)