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

⟨afs_inode_sync#(new_inode.size:= m0; dirs, files1)⟩ (dirs = dirs1 ∧ files1 = files2), ⟨if isdir then {pageno := m0 / VFS_PAGE_SIZE; if buf-opt.some? then buf := buf-opt.buf else buf := files[ino2].content[pageno]; buf := fill(buf, zero, ino, VFS_PAGE_SIZE - ino); content[pageno] := buf; buf-opt := some(buf)}⟩ (pageno = pageno1 ∧ buf = buf0 ∧ content = content1 ∧ buf-opt = buf-opt0), isdir ↔ inode.size ≤ m0 ∧ ino ≠ 0 ∧ (m0 / VFS_PAGE_SIZE ∈ content ∨ buf-opt.some?), isdir ↔ isdir0, ESUCCESS = err0, files[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), buf-opt = none, buf-opt0 = buf-opt1, content = files[inode.ino].content, dirs1 = dirs0, files1 = files[ino2, files[ino2].content:= (content1 upto ino0)], files2 = files0, getinode(inode.ino, dirs1, files2) = inode0, ino = inode.size % VFS_PAGE_SIZE, ino = ino1, ino0 = min(m0, inode.size), ino0 = ino3, ino2 = inode.ino, ino5 = 0, ino6 = 0, inode = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0), new_inode = inode, pageno1 = pageno0, afs-cons(dirs0, files0), afs-cons(dirs, files), files ~ files0, ino4 ∈ files, inode.size ≤ m0 → ino ≠ 0 → VFS_PAGE_SIZE ≠ 0, ⌊err0⌋ ∨ err0 = ESUCCESS ⊦ VFS_PAGE_SIZE = 0, inode0 = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 242:
⟨afs_inode_sync#(mkinode(ino4, md, false, # links(ino4, dirs), 0, m0); dirs, files1)⟩ (dirs = dirs0 ∧ files1 = files0), ⟨if m0 % VFS_PAGE_SIZE ≠ 0 ∧ m0 / VFS_PAGE_SIZE ∈ content0 then {pageno := m0 / VFS_PAGE_SIZE; if buf-opt.some? then buf := buf-opt.buf else buf := files[ino4].content[pageno]; buf := fill(buf, zero, m0 % VFS_PAGE_SIZE, VFS_PAGE_SIZE - m0 % VFS_PAGE_SIZE); content[pageno] := buf; buf-opt := some(buf)}⟩ (pageno = pageno1 ∧ buf = buf0 ∧ content = content1 ∧ buf-opt = buf-opt0), files[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), buf-opt = none, content = content0, files1 = files[ino4, mkfile(m0, md, # links(ino4, dirs), content1 upto m0)], (ino4 ∈ dirs0 ⊃ mkinode(ino4, dirs0[ino4].meta, true, dirs0[ino4].nlink, dirs0[ino4].nsubdirs, dirs0[ino4].size) ;mkinode(ino4, files0[ino4].meta, false, files0[ino4].nlink, 0, files0[ino4].size) ) ≠ mkinode(ino4, md, false, # links(ino4, dirs), 0, m0), afs-cons(dirs0, files0), afs-cons(dirs, files), files ~ files0, ino4 ∈ files ⊦

Rule argument

Additional information

Used simplifier rules: ⊦ mkfile(m, md, m0, content).content = content; (s)%⊦ mkfile(m, md, m0, content).content:= content0 = mkfile(m, md, m0, content0); (s)% ⊦ ¬ none.some?; (s)%⊦ mkinode(m, md, boolvar, m0, m1, m2).size:= m6 = mkinode(m, md, boolvar, m0, m1, m6); (s)% ⊦ m ≤ m; (s)% ⊦ ¬ ⌊ESUCCESS⌋ ; (s)% ⊦ VFS_PAGE_SIZE ≠ 0; (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)% ⊦ min(n, n) = n; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)