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

files0[m] = mkfile(m1, md, # links(m, dirs), content0), of[fd] = mkfile(m, mode, m0), dirs1 = dirs, err = ESUCCESS, err0 = ESUCCESS, files1 = files0[m, mkfile(m1, md, # links(m, dirs), content0 upto m1)], ino = m1, ino0 = m0 + n, ino1 = m0 + ino4, ino2 = 0, ino4 = ino5, ino6 = m0, inode = mkinode(m, md, false, # links(m, dirs), 0, m1), ¬ isdir0, n0 = ino4, dom of < ino3, afs-cons(dirs, files0), afs-cons(dirs, files), of-cons(of, dirs, files0), of-cons(of, dirs, files), fd ∈ of, m ∈ files0, n ≤ # buf0 ⊦ [if ino4 ≠ 0 ∧ ino < ino1 then {inode0 := mkinode(m, md, false, # links(m, dirs), 0, ino1); afs_check_commit#(dirs, files; err; asynced); if err = ESUCCESS then afs_write_inode#(inode0; err, dirs, files; asynced)}; if err ≠ ESUCCESS then n0 := (m0 ≤ ino ⊃ ino - m0;0), err := ESUCCESS; of[fd].pos := m0 + n0] (dirs1 = dirs → of-cons(of, dirs, files) ∧ dom of < ino3 ∧ afs-cons(dirs, files)), ino4 = 0, n = 0, mode ≠ MODE_W ∧ mode ≠ MODE_RW, m1 % VFS_PAGE_SIZE ≠ 0 ∧ m1 / VFS_PAGE_SIZE ∈ content0, err1 = ESUCCESS ∧ ¬ isdir

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information