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

abs-of(of0)[fd] = mkfh(fid, mode0, m1), of0[fd] = mkfile(m, mode, m0), err0 = EBADFD, fs = abs-files(files), ofh = abs-of(of0), root.dir?, dom of0 < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of0)), of-cons(of0, dirs, files), files0 ~ files, n0 ≤ # buf, fd ∈ of0 → mode ≠ MODE_W ∧ mode ≠ MODE_RW, psynced → asynced ⊦ ⟨if err0 = ESUCCESS then let fh = ofh[fd] in let f = fs[fh.fid] in choose n with n ≤ n0 in {n0 := n; f.content := splice(buf, 0, f.content, fh.pos, n0); fs[fh.fid] := f; ofh[fd].pos := fh.pos + n0} else n0 := ?; psynced := ?⟩ (ofh = abs-of(of0) ∧ fs = abs-files(files0) ∧ (psynced → asynced0) ∧ n1 = n0 ∧ EBADFD = err0)

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 56:
of0[fd] = mkfile(m, mode, m0), abs-of(of0)[fd] = mkfh(fid, mode0, m1), err0 = EBADFD, fs = abs-files(files), ofh = abs-of(of0), root.dir?, dom of0 < ino, abs(root, ROOT_INO)(dirs), afs-cons(dirs, files), fids-cons(root, abs-files(files), abs-of(of0)), of-cons(of0, dirs, files), files0 ~ files, n0 ≤ # buf, psynced → asynced, fd ∈ of0 → mode ≠ MODE_W ∧ mode ≠ MODE_RW ⊦ ⟨n0 := ?; psynced := ?⟩ (ofh = abs-of(of0) ∧ fs = abs-files(files0) ∧ (psynced → asynced0) ∧ n1 = n0 ∧ EBADFD = err0)

Rule argument

Additional information

Used simplifier rules: ⊦ ESUCCESS ≠ EBADFD; (s)