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

buf = buf0, 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), n0 ≤ # buf0, ¬ fd ∈ of, psynced → asynced ⊦ ∃ err. pre-read(fd, n0, err, user, root, abs-files(files), ofh) ∧ ⟨err0 := err; if err0 = ESUCCESS then let fh = ofh[fd] in let f = abs-files(files)[fh.fid] in choose n with n ≤ n0 ∧ fh.pos + n ≤ # f.content in {n0 := n; buf := copy(f.content, fh.pos, buf, 0, n0); ofh[fd].pos := fh.pos + n0} ifnone n0 := 0 else n0 := ?⟩ (ofh = abs-of(of) ∧ (psynced → asynced) ∧ buf0 = buf ∧ n = n0 ∧ EBADFD = err0)

User applied rule exists right

And obtained the following new goals

Proof step 18:
buf = buf0, 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), n0 ≤ # buf0, psynced → asynced ⊦ pre-read(fd, n0, EBADFD, user, root, abs-files(files), ofh) ∧ ⟨err0 := EBADFD; if err0 = ESUCCESS then let fh = ofh[fd] in let f = abs-files(files)[fh.fid] in choose n with n ≤ n0 ∧ fh.pos + n ≤ # f.content in {n0 := n; buf := copy(f.content, fh.pos, buf, 0, n0); ofh[fd].pos := fh.pos + n0} ifnone n0 := 0 else n0 := ?⟩ (ofh = abs-of(of) ∧ (psynced → asynced) ∧ buf0 = buf ∧ n = n0 ∧ EBADFD = err0), fd ∈ of

Rule argument

pos: right 1 terms: EBADFD abort: F discard: T computed: F

Additional information

Used terms: EBADFD