[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 107 from proof refine-seek (previous step)

err0 = ESUCCESS, f = abs-files(files)[fh.fid], fh = ofh[fd], n = n0, ofh = abs-of(of), root.dir?, dom of < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), fd ∈ ofh, fd ∈ of, fh.fid ∈ abs-files(files), psynced → asynced ⊦ ⟨ofh[fd] := mkfh(ofh[fd].fid, ofh[fd].mode, n)⟩ (ofh = abs-of(of[fd, of[fd].pos:= n]) ∧ (psynced → asynced) ∧ n0 = n ∧ ESUCCESS = err0), whence = SEEK_CUR, whence = SEEK_END

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 108:
err0 = ESUCCESS, f = abs-files(files)[fh.fid], fh = ofh[fd], n = n0, ofh = abs-of(of), root.dir?, dom of < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), fh.fid ∈ abs-files(files), fd ∈ of, fd ∈ ofh, psynced → asynced ⊦ whence = SEEK_END, whence = SEEK_CUR, ofh[fd, mkfh(ofh[fd].fid, ofh[fd].mode, n)] = abs-of(of[fd, of[fd].pos:= n]) ∧ (psynced → asynced) ∧ n0 = n ∧ ESUCCESS = err0

Rule argument

Additional information

Used simplifier rules: ⊦ fd ∈ abs-of(of) ↔ fd ∈ of; (s)%fd ∈ of ⊦ abs-of(of)[fd] = mkfh(⌜of[fd].ino⌝ , of[fd].mode, of[fd].pos); (s)% ⊦ mkfh(fid, mode, m).fid = fid; (s)% ⊦ ⌜ino⌝ ∈ abs-files(files) ↔ ino ∈ files; (s)