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

VFS_PAGE_SIZE = n0 + (ino2 + ino5) % VFS_PAGE_SIZE, files[m] = mkfile(m3, md0, m4, content), err = ESUCCESS, min(ino1 - ino2 + ino5, n0) ≠ 0, (ino2 + ino5) / VFS_PAGE_SIZE ∈ content, m ∈ files, ino2 + ino5 ≤ ino1, ino5 = 0 → files = files1 ⊦ [afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then {buf := copy(buf0, ino5, content[(ino2 + ino5) / VFS_PAGE_SIZE], (ino2 + ino5) % VFS_PAGE_SIZE, min(ino1 - ino2 + ino5, n0)); afs_writepage#(mkinode(m, md, boolvar, m0, m1, m2), (ino2 + ino5) / VFS_PAGE_SIZE, buf, dirs; err, files; asynced)}; n := min(ino1 - ino2 + ino5, n0); if err = ESUCCESS then ino5 := ino5 + n] (ino5 = 0 → files = files1)

User applied rule call right

And obtained the following new goals

Proof step 32:
VFS_PAGE_SIZE = n0 + (ino2 + ino5) % VFS_PAGE_SIZE, files[m] = mkfile(m3, md0, m4, content), err = ESUCCESS, m ∈ files, (ino2 + ino5) / VFS_PAGE_SIZE ∈ content, ino2 + ino5 ≤ ino1, ino5 = 0 → files = files1 ⊦ [fail_or_success#(; ; err); choose bv with true in asynced := bv; if err = ESUCCESS then {buf := copy(buf0, ino5, content[(ino2 + ino5) / VFS_PAGE_SIZE], (ino2 + ino5) % VFS_PAGE_SIZE, min(ino1 - ino2 + ino5, n0)); afs_writepage#(mkinode(m, md, boolvar, m0, m1, m2), (ino2 + ino5) / VFS_PAGE_SIZE, buf, dirs; err, files; asynced)}; n := min(ino1 - ino2 + ino5, n0); if err = ESUCCESS then ino5 := ino5 + n] (ino5 = 0 → files = files1), min(ino1 - ino2 + ino5, n0) = 0

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_check_commit#(DIRS, FILES; ERR; ASYNCED) {fail_or_success#(; ; ERR); choose bv with true in ASYNCED := bv};