[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 6 from proof truncate-greater (previous step)

asynced0 ↔ bv, buf-opt = none, files0 = files, inode = mkinode(m0, md, boolvar, m1, m2, m3), pageno = m3 / VFS_PAGE_SIZE, m3 < n, afs-cons(dirs, files) ⊦ [if pre-truncate(inode, n, pageno, buf-opt, dirs, files) then let old_ino0 = 0, old_ino = 0 in afs_truncate_internal#(n, pageno; inode, buf-opt, old_ino0, old_ino, asynced0, err, dirs, files; asynced) else abort] (err = ESUCCESS ⊃ files[inode.ino].content.stream to files[inode.ino].size = (files0[inode.ino].content.stream to m3) + (σ⊥ to (files[inode.ino].size - m3)) ∧ inode.ino ∈ files ∧ n = files[inode.ino].size ∧ files0[inode.ino].nlink = files[inode.ino].nlink ∧ files0 -- inode.ino = files -- inode.ino ;⌊err⌋ ∧ files0 = files ), VFS_PAGE_SIZE = 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 7:
files0 = files, inode = mkinode(m0, md, boolvar, m1, m2, m3), m3 < n, afs-cons(dirs, files) ⊦ [if pre-truncate(mkinode(m0, md, boolvar, m1, m2, m3), n, m3 / VFS_PAGE_SIZE, none, dirs, files) then let old_ino0 = 0, old_ino = 0 in {buf-opt := none; afs_truncate_internal#(n, m3 / VFS_PAGE_SIZE; inode, buf-opt, old_ino0, old_ino, asynced0, err, dirs, files; asynced)} else abort] (err = ESUCCESS ⊃ files[inode.ino].content.stream to files[inode.ino].size = (files0[inode.ino].content.stream to m3) + (σ⊥ to (files[inode.ino].size - m3)) ∧ inode.ino ∈ files ∧ n = files[inode.ino].size ∧ files0[inode.ino].nlink = files[inode.ino].nlink ∧ files0 -- inode.ino = files -- inode.ino ;⌊err⌋ ∧ files0 = files )

Rule argument

Additional information

Used simplifier rules: ⊦ VFS_PAGE_SIZE ≠ 0; (s)