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

files[m0] = mkfile(m, md0, # links(m0, dirs), content0), buf-opt = none, content = files[inode.ino].content, files0 = files, files1 = files[ino, files[ino].content:= (content[pageno, fill(files[ino].content[pageno], zero, old_ino0, VFS_PAGE_SIZE - old_ino0)] upto old_ino)], ino = inode.ino, inode = mkinode(m0, md, false, # links(m0, dirs), 0, m3), new_inode = inode, old_ino = min(n, inode.size), old_ino0 = inode.size % VFS_PAGE_SIZE, old_ino1 = 0, old_ino2 = 0, pageno = m3 / VFS_PAGE_SIZE, m3 < n, afs-cons(dirs, files), m0 ∈ files, pageno ∈ files[ino].content, inode.size ≤ n, old_ino0 + (VFS_PAGE_SIZE - old_ino0) ≤ # files[ino].content[pageno], VFS_PAGE_SIZE ≥ old_ino0, pageno ∈ content ∨ buf-opt.some? ⊦ [afs_inode_sync#(new_inode.size:= n; dirs, files1); inode := getinode(inode.ino, dirs, files1); err := ESUCCESS; asynced := ?] (err = ESUCCESS ⊃ files1[inode.ino].content.stream to files1[inode.ino].size = (files0[inode.ino].content.stream to m3) + (σ⊥ to (files1[inode.ino].size - m3)) ∧ inode.ino ∈ files1 ∧ n = files1[inode.ino].size ∧ files0[inode.ino].nlink = files1[inode.ino].nlink ∧ files0 -- inode.ino = files1 -- inode.ino ;⌊err⌋ ∧ files0 = files1 ), VFS_PAGE_SIZE = 0, old_ino0 = 0

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 29:
files[m0] = mkfile(m, md0, # links(m0, dirs), content0), files1 = files [m0, mkfile (m, md0, # links(m0, dirs), content0[m3 / VFS_PAGE_SIZE, fill(content0[m3 / VFS_PAGE_SIZE], zero, m3 % VFS_PAGE_SIZE, VFS_PAGE_SIZE - m3 % VFS_PAGE_SIZE)] upto m3) ], inode = mkinode(m0, md, false, # links(m0, dirs), 0, m3), m3 % VFS_PAGE_SIZE ≠ 0, m3 < n, afs-cons(dirs, files), m0 ∈ files, m3 / VFS_PAGE_SIZE ∈ content0 ⊦ [afs_inode_sync#(mkinode(m0, md, false, # links(m0, dirs), 0, n); dirs, files1); inode := (inode.ino ∈ dirs ⊃ mkinode(inode.ino, dirs[inode.ino].meta, true, dirs[inode.ino].nlink, dirs[inode.ino].nsubdirs, dirs[inode.ino].size) ;mkinode(inode.ino, files1[inode.ino].meta, false, files1[inode.ino].nlink, 0, files1[inode.ino].size) ); err := ESUCCESS; asynced := ?] (err = ESUCCESS ⊃ files1[inode.ino].content.stream to files1[inode.ino].size = (files[inode.ino].content.stream to m3) + (σ⊥ to (files1[inode.ino].size - m3)) ∧ inode.ino ∈ files1 ∧ n = files1[inode.ino].size ∧ files[inode.ino].nlink = files1[inode.ino].nlink ∧ files -- inode.ino = files1 -- inode.ino ;⌊err⌋ ∧ files = files1 )

Rule argument

Additional information

Used simplifier rules: ⊦ m ≤ m; (s)%⊦ afs-cons(dirs, files) ∧ ino ∈ files ∧ files[ino] = mkfile(m, md, n0, content) ∧ n ∈ content → # content[n] = VFS_PAGE_SIZE; (s)%⊦ mkfile(m, md, m0, content).content:= content0 = mkfile(m, md, m0, content0); (s)% ⊦ mkfile(m, md, m0, content).content = content; (s)%⊦ getinode(ino, dirs, files) = (ino ∈ dirs ⊃ mkinode (ino, dirs[ino].meta, true, dirs[ino].nlink, dirs[ino].nsubdirs, dirs[ino].size) ;mkinode (ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ); (s)%⊦ mkinode(m, md, boolvar, m0, m1, m2).size:= m6 = mkinode(m, md, boolvar, m0, m1, m6); (s)% ⊦ m < n → m ≤ n; (s)%c: ⊦ m + n = n + m; from specification nat-basic%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic% ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s)%n ≤ m ⊦ (m - n) + m0 ≤ n0 ↔ m + m0 ≤ n0 + n; (s)%n ≠ 0 ⊦ m % n ≤ n; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ VFS_PAGE_SIZE ≠ 0; (s)% ⊦ n1 < n0 → min(n0, n1) = n1; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)