[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 49 from proof refine-rename-overwrite-keep-parent-identity (previous step)

boolvar0 ↔ boolvar, adr5 = adr, adr6 = adr8, adr7 = adr2, dirs = abs-dirs(fs0, ri), err = ESUCCESS, files = abs-files(fs0, ri), fs = fs0[adr1, nd2][adr2, nd1][adr3, nd0][adr4, nd], key = inodekey(fs0[ri[dentrykey(m6, str)]].ino), log = (((log0 + adr1) + adr2) + adr3) + adr4, m = fs0[ri[dentrykey(m6, str)]].ino, m7 = fs0[ri[inodekey(m6)]].nlink, m8 = fs0[ri[inodekey(m6)]].nsubdirs, m9 = fs0[ri[inodekey(m6)]].size, nd = inodenode(key, md, boolvar3, m0, m1, m2), nd0 = inodenode(inodekey(m6), md1, true, m7, m8, m9), nd1 = dentrynode(dentrykey(m6, new_dent.name), new_dent.ino), nd2 = dentrynode(dentrykey(m6, new_dent.name), 0), new_child_inode = mkinode(m, md, boolvar3, m0, m1, m2), new_dent = mkdentry(str, fs0[ri[dentrykey(m6, str)]].ino), old_dent = new_dent, old_parent_inode = mkinode(m6, md1, true, m7, m8, m9), ro = orphans(fs0, ri), ro0 = orphans(fs0, ri), new_dent.dentry?, fs0[ri[inodekey(m6)]].directory, orphans(fs0, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri), abs-files(fs0, ri)), file-node-cons(fs0, ri), log-cons(log0, fs0), new(adr1 ' + adr2 ' + (adr3 ' + adr4), fs0), node-cons(nd2.key, nd2), node-cons(nd1.key, nd1), node-cons(nd0.key, nd0), node-cons(nd.key, nd), orphans-cons(fs0, ri, orphans(fs0, ri)), replay-cons-strong(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri-cons(ri, fs0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs0, ri, orphans(fs0, ri), fi, fo, log0), inodekey(m6) ∈ ri, inodekey(fs0[ri[dentrykey(m6, str)]].ino) ∈ ri, dentrykey(m6, str) ∈ ri, 1 ≤ fs0[ri[inodekey(m6)]].size, boolvar2 → 1 ≤ fs0[ri[inodekey(m6)]].nsubdirs, m0 = 1 → links(fs0[ri[dentrykey(m6, str)]].ino, fs0, ri) = ∅ ++ dentrykey(m6, str), boolvar4 → boolvar1, fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory → abs-children(fs0[ri[dentrykey(m6, str)]].ino, fs0, ri) = ∅, fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory → dentrykeys(inodekey(fs0[ri[dentrykey(m6, str)]].ino), ri) = ∅, fs0[ri[inodekey(m6)]].nlink ≠ 0 ∨ m6 = ROOT_INO, links(m6, abs-dirs(fs0, ri)) ≠ ∅ ∨ m6 = ROOT_INO, ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory ∧ ¬ boolvar2 ∧ m3 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m4 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∨ fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory ∧ boolvar2 ∧ m3 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m4 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ m5 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].size, ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory ∧ ¬ boolvar3 ∧ m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m1 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∨ fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory ∧ boolvar3 ∧ m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m1 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ m2 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].size, fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory ∧ m3 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m5 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].size ∧ m4 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ boolvar2 ∨ ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory ∧ m3 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m4 = 0 ∧ ¬ boolvar2, fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory ∧ m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m2 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].size ∧ m1 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ boolvar3 ∨ ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].directory ∧ m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar3 ⊦ [if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m6, old_dent.name), fi, ro0, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(dentrykey(m6, new_dent.name), adr7, fi, ro0, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(inodekey(m6), adr3, fi, ro0, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(key, adr4, fi, ro0, fo, fs, log, boolvar0; ri); nd := inodenode(key, md, boolvar3, m0, m1, m2); if nd.nlink = 0 then aubifs_core_orphans_insert#(key, ri, fi, fo, fs, log, boolvar0; ro0); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode (old_parent_inode.ino, inodenode(inodekey(m6), md1, true, m7, m8, m9).meta, inodenode(inodekey(m6), md1, true, m7, m8, m9).directory, inodenode(inodekey(m6), md1, true, m7, m8, m9).nlink, inodenode(inodekey(m6), md1, true, m7, m8, m9).nsubdirs, inodenode(inodekey(m6), md1, true, m7, m8, m9).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) ∧ log-cons(log, fs) ∧ ro0.inodes? → ⟪new_parent_inode := old_parent_inode⟫ ⟨old_dent2 := mkdentry(str, m); old_dent_inode0 := mkinode(m, md0, boolvar2, m3, m4, m5); old_dent1 := mkdentry(str, m); new_dent_inode := mkinode(m, md, boolvar3, m0, m1, m2); old_inode := mkinode(m6, md1, true, m7, m8, m9); old_dent_inode := mkinode(m, md0, boolvar2, m3, m4, m5); new_inode := mkinode(m6, md1, true, m7, m8, m9); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent1, old_dent2, err0, dirs, files; boolvar4)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (boolvar4 → boolvar0) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent1 ∧ new_dent = old_dent2 ∧ err = err0)), fs0[ri[dentrykey(m6, str)]].ino = ROOT_INO, fs0[ri[inodekey(m6)]].size = 0, m0 = 0, dups(adr1 ' + adr2 ' + adr3 ' + adr4 '), fs0[ri[inodekey(m6)]].nlink = 0 ∧ m6 ≠ ROOT_INO

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information