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

fs[ri[inodekey(m3)]] = inodenode(key, md1, true, m, m4, m5), c_inode = p_inode1, c_inode0 = p_inode1, dent = old_dent, dirs = abs-dirs(fs, ri), err = err0, files = abs-files(fs, ri), old_dent = negdentry(str), p_inode = p_inode0, p_inode0 = mkinode(m3, md0, true, m, m4, m5), orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), pre-create(p_inode, dent, md, dirs, files), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), ri[inodekey(m3)] ∈ fs, inodekey(m3) ∈ ri, asynced → boolvar0, ∀ adr, adr0, adr1. adr ∈ fs ∨ adr0 ∈ fs ∨ adr1 ∈ fs ∨ adr = adr0 ∨ adr = adr1 ∨ adr0 = adr1, links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO, m ≠ 0 ∨ m3 = ROOT_INO ⊦ ⟨ {choose ino with ¬ ino ∈ dirs ∧ ¬ ino ∈ files ∧ ino ≠ 0 in afs_create_ino#(p_inode.ino, md, ino; dent, err, dirs, files); afs_inode_sync#(p_inode; dirs, files); p_inode := getinode(p_inode.ino, dirs, files); c_inode := getinode(dent.ino, dirs, files)} or fail#(; ; err); asynced := ?⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (asynced → boolvar) ∧ mkinode(m3, md0, true, fs[ri[inodekey(m3)]].nlink, fs[ri[inodekey(m3)]].nsubdirs, fs[ri[inodekey(m3)]].size) = p_inode ∧ c_inode0 = c_inode ∧ negdentry(str) = dent ∧ ENOSPC = err), n = 0, dentrykey(m3, str) ∈ ri, inodekey(n) ∈ fo, inodekey(n) ∈ ri, m = 0 ∧ m3 ≠ ROOT_INO

Heuristic symbolic execution applied rule or right

And obtained the following new goals

Rule argument

Additional information