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

err = ESUCCESS, ¬ isdir, n1 = n5 + n0 + n, afs-cons(dirs, files), m ∈ files, n0 + n ≤ m2, n ≤ # buf, n5 + n ≤ # buf, ∀ n2, n3, n4, err, inode, m, md, boolvar, m0, m1, m2, isdir, dirs, files, buf, asynced. n2 - n3 + n4 < n5 → err = ESUCCESS ∧ inode = mkinode(m, md, boolvar, m0, m1, m2) ∧ ¬ isdir ∧ afs-cons(dirs, files) ∧ m ∈ files ∧ n4 ≤ # buf ∧ n3 + n4 ≤ m2 ∧ n3 + n4 ≤ n2 ∧ n2 ≤ # buf + n3 → ⟪vfs_read_block#(n3, n2, inode, dirs, files, asynced; buf, n4, isdir, err); while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n3, n2, inode, dirs, files, asynced; buf, n4, isdir, err)⟫ true ⊦ ⟪vfs_read_block#(n0, n5 + n0 + n, mkinode(m, md, boolvar, m0, m1, m2), dirs, files, asynced; buf, n, isdir, err); inode := mkinode(m, md, boolvar, m0, m1, m2); while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n0, n1, inode, dirs, files, asynced; buf, n, isdir, err)⟫ true

User applied rule call right

And obtained the following new goals

Proof step 17:
⊦
Proof step 18:
buf0 = buf, err = ESUCCESS, ino0 = n, ino1 = n5 + n0 + n, ino2 = n0, inode = mkinode(m, md, boolvar, m0, m1, m2), ¬ isdir, n1 = n5 + n0 + n, afs-cons(dirs, files), m ∈ files, n5 + n ≤ # buf, n ≤ # buf, n0 + n ≤ m2, ∀ n2, n3, n4, err, inode, m, md, boolvar, m0, m1, m2, isdir, dirs, files, buf, asynced. n2 - n3 + n4 < n5 → err = ESUCCESS ∧ inode = mkinode(m, md, boolvar, m0, m1, m2) ∧ ¬ isdir ∧ afs-cons(dirs, files) ∧ m ∈ files ∧ n4 ≤ # buf ∧ n3 + n4 ≤ m2 ∧ n3 + n4 ≤ n2 ∧ n2 ≤ # buf + n3 → ⟪vfs_read_block#(n3, n2, inode, dirs, files, asynced; buf, n4, isdir, err); while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n3, n2, inode, dirs, files, asynced; buf, n4, isdir, err)⟫ true ⊦ ⟪let pageno = (ino2 + ino0) / VFS_PAGE_SIZE, ino = (ino2 + ino0) % VFS_PAGE_SIZE, buf = mkbuf(VFS_PAGE_SIZE) in let n = min(ino1 - ino2 + ino0, VFS_PAGE_SIZE - ino, inode.size - ino2 + ino0) in if n ≠ 0 then {afs_readpage#(inode, pageno, dirs, files, asynced; buf, err); if err = ESUCCESS then {buf0 := copy(buf, ino, buf0, ino0, n); ino0 := ino0 + n}} else isdir := true; inode := mkinode(m, md, boolvar, m0, m1, m2); n := ino0, buf := buf0; while err = ESUCCESS ∧ ¬ isdir do vfs_read_block#(n0, n1, inode, dirs, files, asynced; buf, n, isdir, err)⟫ true

Rule argument

pos: right 1

Additional information

Used simplifier rules: read-block: ⊦ ;