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

of[fd] = mkfile(m, mode, m0), root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), fd ∈ of, psynced → asynced ⊦ ⟪choose err0 with ⌊err0⌋ in err := err0; n := n0; if err = ESUCCESS then n := inode.size + n; ofh := abs-of(of); if err = ESUCCESS then of[fd].pos := n⟫ ⟨posix_seek#(fd, SEEK_END, user, root, abs-files(files); n0, err0, ofh)⟩ (ofh = abs-of(of) ∧ (psynced → asynced) ∧ n = n0 ∧ err = err0)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Proof step 72:
of[fd] = mkfile(m, mode, m0), root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), fd ∈ of, ⌊err0⌋ , psynced → asynced ⊦ ⟪err := err0; n := n0; if err = ESUCCESS then n := inode.size + n; ofh := abs-of(of); if err = ESUCCESS then of[fd].pos := n⟫ ⟨posix_seek#(fd, SEEK_END, user, root, abs-files(files); n0, err1, ofh)⟩ (ofh = abs-of(of) ∧ (psynced → asynced) ∧ n = n0 ∧ err = err1)
Proof step 88:
of[fd] = mkfile(m, mode, m0), root.dir?, dom of < ino0, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of)), of-cons(of, dirs, files), fd ∈ of, psynced → asynced ⊦ ∃ err0. ⌊err0⌋

Proof step 71 from proof refine-seek (previous step)

Heuristic symbolic execution applied rule choose right

And obtained the following new goals

Rule argument

Additional information