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

⟨afs_inode_sync#(new_inode.size:= m0; dirs, files1); inode := getinode(inode.ino, dirs, files1); err := ESUCCESS⟩ ( ino = ino1 ∧ ino0 = ino3 ∧ (isdir ↔ isdir0) ∧ pageno1 = pageno0 ∧ buf-opt0 = buf-opt1 ∧ files1 = files0 ∧ dirs = dirs0 ∧ inode = inode0 ∧ err = err0), ⟨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?), files[ino4] = mkfile(m0, md, # links(ino4, dirs), content0), buf-opt = none, content = files[inode.ino].content, files1 = files[ino2, files[ino2].content:= (content1 upto ino0)], ino = inode.size % VFS_PAGE_SIZE, ino0 = min(m0, inode.size), ino2 = inode.ino, ino5 = 0, ino6 = 0, inode = mkinode(ino4, md, false, # links(ino4, dirs), 0, m0), new_inode = inode, afs-cons(dirs, files), afs-cons(dirs0, files0), 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 split applied rule split left

And obtained the following new goals

Rule argument

pos: left 1

Additional information