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

err = err0, fs = abs-files(files), 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), psynced → asynced ⊦ [vfs_close#(fd, user, asynced; err, of, dirs, files)] ( of-cons(of, dirs, files) ∧ dom of < ino ∧ afs-cons(dirs, files) → ⟨posix_close#(fd, user, root; err0, fs, ofh)⟩ (ofh = abs-of(of) ∧ fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err = err0))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 7:
err = err0, fs = abs-files(files), 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), psynced → asynced ⊦ [err := ESUCCESS; if ¬ fd ∈ of then err := EBADFD else let ino = of[fd].ino in choose p_inode with true in {afs_iget#(ino, dirs, files, asynced; p_inode, err); if err = ESUCCESS then {of := of -- fd; vfs_put_inode#(p_inode, of, asynced; err, dirs, files)}}] ( of-cons(of, dirs, files) ∧ dom of < ino ∧ afs-cons(dirs, files) → ⟨posix_close#(fd, user, root; err0, fs, ofh)⟩ (ofh = abs-of(of) ∧ fs = abs-files(files) ∧ abs(root, ROOT_INO)(dirs) ∧ (psynced → asynced) ∧ err = err0))

Rule argument

pos: right 1

Additional information

Used simplifier rules: vfs_close#(FD, USER, ASYNCED; ERR, OF, DIRS, FILES) {ERR := ESUCCESS; if ¬ FD ∈ OF then ERR := EBADFD else let DEL_INO = OF[FD].ino in choose DEL_INODE with true in {afs_iget#(DEL_INO, DIRS, FILES, ASYNCED; DEL_INODE, ERR); if ERR = ESUCCESS then {OF := OF -- FD; vfs_put_inode# (DEL_INODE, OF, ASYNCED; ERR, DIRS, FILES)}} };