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

m14 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink, m13 + 1 = fs[ri[inodekey(m11)]].size, m16 + 1 = fs[ri[inodekey(m11)]].nsubdirs, abs-children(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅, dentrykeys(inodekey(fs[ri[dentrykey(m7, str0)]].ino), ri) = ∅, err = err0, fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].directory, fs[ri[inodekey(m7)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].directory, fs[ri[inodekey(m11)]].directory, 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)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m11) ∈ ri, inodekey(m7) ∈ ri, dentrykey(m7, str0) ∈ ri, inodekey(fs[ri[dentrykey(m7, str0)]].ino) ∈ ri, dentrykey(m11, str) ∈ ri, inodekey(fs[ri[dentrykey(m11, str)]].ino) ∈ ri, ⌊err0⌋ , m14 = 0 → links(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m7, str0), boolvar2 → boolvar1, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, links(m11, abs-dirs(fs, ri)) ≠ ∅ ∨ m11 = ROOT_INO, fs[ri[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, fs[ri[inodekey(m11)]].nlink ≠ 0 ∨ m11 = ROOT_INO ⊦ [adr8 := ?, adr7 := ?, adr6 := ?, adr0 := ?, adr := ?; boolvar := ?; nd1 := inodenode(inodekey(m11), md2, true, fs[ri[inodekey(m11)]].nlink, m16, m13); m15 := m7; old_parent_inode := mkinode(m11, md2, true, fs[ri[inodekey(m11)]].nlink, m16 + 1, m13 + 1); new_child_inode := mkinode (fs[ri[dentrykey(m7, str0)]].ino, md0, true, m14 + 1, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size); boolvar1 := boolvar, adr1 := adr6, adr2 := adr7; ro0 := orphans(fs, ri); old_dent := mkdentry(str, fs[ri[dentrykey(m11, str)]].ino); new_dent := mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino); m9 := fs[ri[inodekey(m7)]].nsubdirs; m8 := fs[ri[inodekey(m7)]].nlink; m6 := fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size; m5 := fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs; m3 := fs[ri[dentrykey(m7, str0)]].ino; m2 := fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].size; m12 := fs[ri[inodekey(m11)]].nlink; m10 := fs[ri[inodekey(m7)]].size; m1 := fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].nsubdirs; m0 := fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].nlink; m := fs[ri[dentrykey(m11, str)]].ino; files := abs-files(fs, ri); dirs := abs-dirs(fs, ri); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m11, old_dent.name), fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(dentrykey(m15, new_dent.name), adr2, fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(m11), adr1, fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(m15), adr0, fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(new_dent.ino), adr, fi, ro0, fo, fs, log, boolvar1; ri); nd := inodenode(inodekey(new_dent.ino), md0, true, m14, m5, m6); if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(new_dent.ino), ri, fi, fo, fs, log, boolvar1; ro0); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode(old_parent_inode.ino, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); new_child_inode := mkinode(new_child_inode.ino, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)}] ( 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) ∧ 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, err1, 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 = err1)), fs[ri[dentrykey(m7, str0)]].ino = ROOT_INO, fs[ri[dentrykey(m7, str0)]].ino = 0, m11 = m7, m11 = 0, m7 = 0, fs[ri[inodekey(m11)]].nlink = 0 ∧ m11 ≠ ROOT_INO, fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information