[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 1365 from proof refine-rename-overwrite-reparent-dir (previous step)

m16 + 1 = fs[ri[inodekey(m11)]].nsubdirs, m13 + 1 = fs[ri[inodekey(m11)]].size, m14 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink, boolvar1 ↔ boolvar, abs-children(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅, adr1 = adr6, adr2 = adr7, adr6 = adr4, adr7 = adr5, adr8 = adr3, dentrykeys(inodekey(fs[ri[dentrykey(m7, str0)]].ino), ri) = ∅, dirs = abs-dirs(fs, ri), err = ENOSPC, files = abs-files(fs, ri), m = fs[ri[dentrykey(m11, str)]].ino, m0 = fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].nlink, m1 = fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].nsubdirs, m10 = fs[ri[inodekey(m7)]].size, m12 = fs[ri[inodekey(m11)]].nlink, m15 = m7, m2 = fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].size, m3 = fs[ri[dentrykey(m7, str0)]].ino, m5 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs, m6 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size, m8 = fs[ri[inodekey(m7)]].nlink, m9 = fs[ri[inodekey(m7)]].nsubdirs, nd = inodenode(inodekey(new_dent.ino), md0, true, m14, m5, m6), nd0 = inodenode(inodekey(m7), md1, true, m8, m9, m10), nd1 = inodenode(inodekey(m11), md2, true, m12, m16, m13), nd2 = dentrynode(dentrykey(m7, new_dent.name), old_dent.ino), nd3 = dentrynode(dentrykey(m11, old_dent.name), 0), new_child_inode = mkinode(m3, md0, true, m14 + 1, m5, m6), new_dent = mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino), old_dent = mkdentry(str, fs[ri[dentrykey(m11, str)]].ino), old_parent_inode = mkinode(m11, md2, true, m12, m16 + 1, m13 + 1), ro = orphans(fs, ri), ro0 = orphans(fs, ri), new_dent.dentry?, old_dent.dentry?, fs[ri[inodekey(m11)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory, fs[ri[inodekey(m7)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].directory, fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), node-cons(nd3.key, nd3), node-cons(nd2.key, nd2), node-cons(nd1.key, nd1), node-cons(nd0.key, nd0), node-cons(nd.key, nd), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(fs[ri[dentrykey(m11, str)]].ino) ∈ ri, dentrykey(m11, str) ∈ ri, inodekey(fs[ri[dentrykey(m7, str0)]].ino) ∈ ri, dentrykey(m7, str0) ∈ ri, inodekey(m7) ∈ ri, inodekey(m11) ∈ ri, boolvar2 → boolvar0, m14 = 0 → links(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m7, str0), ∀ adr1, adr2, adr3, adr4, adr5. ¬(new(adr1 ' + adr2 ' + adr3 ' + (adr4 ' + adr5), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ' + adr4 ' + adr5 ')), fs[ri[inodekey(m11)]].nlink ≠ 0 ∨ m11 = ROOT_INO, fs[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, links(m11, abs-dirs(fs, ri)) ≠ ∅ ∨ m11 = ROOT_INO, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO ⊦ [skip] ( ubifs-cons(fs, ri, ro0, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro0, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log, fs) ∧ ro0.inodes? → ⟨old_dent_inode0 := mkinode(m, md, true, m0, m1, m2); old_dent0 := mkdentry(str, m); old_dent1 := mkdentry(str0, m3); old_dent_inode := mkinode(m, md, true, m0, m1, m2); new_dent_inode := mkinode(m3, md0, true, m14 + 1, m5, m6); new_inode := mkinode(m7, md1, true, m8, m9, m10); old_inode := mkinode(m11, md2, true, m12, m16 + 1, m13 + 1); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar2)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (boolvar2 → boolvar1) ∧ old_parent_inode = old_inode ∧ mkinode(m15, md1, true, m8, m9, m10) = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ err = err0)), fs[ri[dentrykey(m7, str0)]].ino = ROOT_INO, m11 = m7, fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO, fs[ri[inodekey(m11)]].nlink = 0 ∧ m11 ≠ ROOT_INO

Heuristic symbolic execution applied rule skip right

And obtained the following new goals

Rule argument

Additional information