[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 27 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), err = ESUCCESS, min(n5, n7) ≠ 0, afs-cons(dirs, files), m ∈ files, n5 + n6 ≤ # buf, n6 ≤ # buf, ∀ 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) ⊦ ⟪vfs_writepage# (mkinode(m, md, false, # links(m, dirs), 0, m2), (n0 + n6) / VFS_PAGE_SIZE, buf, n6, (n0 + n6) % VFS_PAGE_SIZE, min(n5 + n0 + n6 - n0 + n6, n7), dirs ; err, files, 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, buf, n1, dirs; n, isdir, err, files, asynced)⟫ (m ∈ files ∧ # links(m, dirs) = files[m].nlink)

User applied rule call right

And obtained the following new goals

Proof step 28:
⊦
Proof step 29:
VFS_PAGE_SIZE = n7 + (n0 + n6) % VFS_PAGE_SIZE, files[m] = mkfile(m1, md0, # links(m, dirs), content), buf0 = buf, err = ESUCCESS, ino = (n0 + n6) % VFS_PAGE_SIZE, ino0 = n6, inode = mkinode(m, md, false, # links(m, dirs), 0, m2), n = min(n5 + n0 + n6 - n0 + n6, n7), pageno = (n0 + n6) / VFS_PAGE_SIZE, afs-cons(dirs, files), m ∈ files, n6 ≤ # buf, n5 + n6 ≤ # buf, 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) ⊦ ⟪let buf = mkbuf(VFS_PAGE_SIZE) in {afs_readpage#(inode, pageno, dirs, files, asynced; buf, err); if err = ESUCCESS then afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {buf := copy(buf0, ino0, buf, ino, n); afs_writepage#(inode, pageno, buf, dirs; err, files; 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, buf, n1, dirs; n, isdir, err, files, asynced)⟫ (m ∈ files ∧ # links(m, dirs) = files[m].nlink), VFS_PAGE_SIZE = 0, min(n5, n7) = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: write-page: ⊦ ;% ⊦ VFS_PAGE_SIZE ≠ 0; (s)% ⊦ n ≥ m ↔ m ≤ n; (s)% ⊦ m + n ≤ m + n0 ↔ n ≤ n0; (s)% ⊦ m ≤ m + n; (s)%a: ⊦ (m + n0) + n1 = m + n0 + n1; from specification nat-basic%c: ⊦ m + n = n + m; from specification nat-basic