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

err = ESUCCESS, afs-cons(dirs, files), ispath(p, ROOT_INO, ino2, dirs, files), of-cons(of, dirs, files), px-parent(user, p, ROOT_INO, dirs, files) ⊦ ⟪afs_iget#(ino2, dirs, files, asynced; inode, err); if err = ESUCCESS then if pr(user, inode.meta) then {md := inode.meta, ino0 := inode.size; if inode.directory then ino1 := inode.nsubdirs + 2 else ino1 := inode.nlink} else err := EACCESS⟫ true

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 16:
err = ESUCCESS, ino = ino2, afs-cons(dirs, files), ispath(p, ROOT_INO, ino2, dirs, files), of-cons(of, dirs, files), px-parent(user, p, ROOT_INO, dirs, files) ⊦ ⟪if pre-iget(ino, dirs, files) then {{inode := getinode(ino, dirs, files); err := ESUCCESS} or fail#(; ; err)} else abort; if err = ESUCCESS then if pr(user, inode.meta) then {md := inode.meta, ino0 := inode.size; if inode.directory then ino1 := inode.nsubdirs + 2 else ino1 := inode.nlink} else err := EACCESS⟫ true

Rule argument

pos: right 1

Additional information

Used simplifier rules: afs_iget#(INO, DIRS, FILES, ASYNCED; INODE, ERR) {if pre-iget(INO, DIRS, FILES) then { {INODE := getinode(INO, DIRS, FILES); ERR := ESUCCESS} or fail#(; ; ERR)} else abort };