[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 124 from proof write-loop-term (previous step)

VFS_PAGE_SIZE = n7 + (n0 + n6) % VFS_PAGE_SIZE, files[m] = mkfile(m1, md0, # links(m, dirs), content), buf = copy(buf1, n6, zeropage, (n0 + n6) % VFS_PAGE_SIZE, min(n5 + n0 + n6 - n0 + n6, n7)), err = ESUCCESS, inode = mkinode(m, md, false, # links(m, dirs), 0, m2), pageno = (n0 + n6) / VFS_PAGE_SIZE, afs-cons(dirs, files), m ∈ files, n6 ≤ # buf1, n5 + n6 ≤ # buf1, (n0 + n6) % VFS_PAGE_SIZE + min(n5, n7) ≤ VFS_PAGE_SIZE, n6 + min(n5, n7) ≤ # buf1, (n0 + n6) % VFS_PAGE_SIZE + min(n5 + n0 + n6 - n0 + n6, n7) ≤ # zeropage, n6 + min(n5 + n0 + n6 - n0 + n6, n7) ≤ # buf1, n5 + n0 + n6 ≥ n0 + n6, ∀ n2, n3, n4, files, m, m1, md0, dirs, content, inode, md, m2, isdir, buf, err, asynced. n2 - n3 + n4 < n5 → files[m] = mkfile(m1, md0, # links(m, dirs), content) ∧ inode = mkinode(m, md, false, # links(m, dirs), 0, m2) ∧ ¬ isdir ∧ afs-cons(dirs, files) ∧ m ∈ files ∧ n4 ≤ # buf ∧ n3 + n4 ≤ n2 ∧ n2 ≤ # buf + n3 → ⟪while err = ESUCCESS ∧ ¬ isdir do vfs_write_block#(n3, inode, buf, n2, dirs; n4, isdir, err, files, asynced)⟫ (m ∈ files ∧ # links(m, dirs) = files[m].nlink) ⊦ ⟪{files[inode.ino].content[pageno] := buf; err := ESUCCESS} or fail#(; ; err); asynced := ?; n := min(n5 + n0 + n6 - n0 + n6, n7); ino0 := n6; if err = ESUCCESS then ino0 := ino0 + n; inode := mkinode(m, md, false, # links(m, dirs), 0, m2); n := ino0; n1 := n5 + n0 + n6; isdir := false; while err = ESUCCESS ∧ ¬ isdir do vfs_write_block#(n0, inode, buf1, n1, dirs; n, isdir, err, files, asynced)⟫ (m ∈ files ∧ # links(m, dirs) = files[m].nlink), VFS_PAGE_SIZE = 0, min(n5, n7) = 0, (n0 + n6) / VFS_PAGE_SIZE ∈ content

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information