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

abs-children(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅, dentrykeys(inodekey(fs[ri[dentrykey(m7, str0)]].ino), ri) = ∅, dirs = abs-dirs(fs, ri), 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, m13 = fs[ri[inodekey(m11)]].nsubdirs, m14 = fs[ri[inodekey(m11)]].size, m2 = fs[ri[inodekey(fs[ri[dentrykey(m11, str)]].ino)]].size, m3 = fs[ri[dentrykey(m7, str0)]].ino, m4 = fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink, 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, new_child_inode = mkinode (fs[ri[dentrykey(m7, str0)]].ino, md0, true, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nsubdirs, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].size), new_dent = mkdentry(str0, fs[ri[dentrykey(m7, str0)]].ino), new_parent_inode = mkinode(m7, md1, true, fs[ri[inodekey(m7)]].nlink, fs[ri[inodekey(m7)]].nsubdirs, fs[ri[inodekey(m7)]].size), old_dent = mkdentry(str, fs[ri[dentrykey(m11, str)]].ino), old_parent_inode = mkinode(m11, md2, true, fs[ri[inodekey(m11)]].nlink, fs[ri[inodekey(m11)]].nsubdirs, fs[ri[inodekey(m11)]].size), ro = orphans(fs, ri), fs[ri[dentrykey(m7, str0)]].ino ≠ ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink ≠ 0, fs[ri[inodekey(m11)]].nsubdirs ≠ 0, fs[ri[inodekey(m11)]].size ≠ 0, m11 ≠ m7, 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), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), 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, 1 ≤ fs[ri[inodekey(m11)]].size, 1 ≤ fs[ri[inodekey(m11)]].nsubdirs, 1 ≤ fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m7, str0)]].ino)]].nlink = 1 → links(fs[ri[dentrykey(m7, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m7, str0), boolvar2 → boolvar1, 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 ⊦ [aubifs_core_journal_add5# (dentrynode(dentrykey(old_parent_inode.ino, old_dent.name), 0), dentrynode(dentrykey(new_parent_inode.ino, new_dent.name), old_dent.ino), inodenode (inodekey(old_parent_inode.ino), old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - 1, old_parent_inode.size - 1), inodenode (inodekey(new_parent_inode.ino), new_parent_inode.meta, new_parent_inode.directory, new_parent_inode.nlink, new_parent_inode.nsubdirs, new_parent_inode.size), inodenode (inodekey(new_dent.ino), new_child_inode.meta, new_child_inode.directory, new_child_inode.nlink - 1, new_child_inode.nsubdirs, new_child_inode.size), ri, fi, orphans(fs, ri), fo ; adr3, adr2, adr1, adr0, adr, fs, log ; boolvar1, err); nd1 := inodenode (inodekey(old_parent_inode.ino), old_parent_inode.meta, old_parent_inode.directory, old_parent_inode.nlink, old_parent_inode.nsubdirs - 1, old_parent_inode.size - 1); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(old_parent_inode.ino, old_dent.name), fi, ro, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(dentrykey(new_parent_inode.ino, new_dent.name), adr2, fi, ro, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(old_parent_inode.ino), adr1, fi, ro, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(new_parent_inode.ino), adr0, fi, ro, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(new_dent.ino), adr, fi, ro, fo, fs, log, boolvar1; ri); nd := inodenode (inodekey(new_dent.ino), new_child_inode.meta, new_child_inode.directory, new_child_inode.nlink - 1, new_child_inode.nsubdirs, new_child_inode.size); if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(new_dent.ino), ri, fi, fo, fs, log, boolvar1; ro); 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, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro) ∧ ri-inj(ri) ∧ log-cons(log, fs) ∧ ro.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, m4, m5, m6); new_inode := mkinode(m7, md1, true, m8, m9, m10); old_inode := mkinode(m11, md2, true, m12, m13, m14); 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(ro) ∧ (boolvar2 → boolvar1) ∧ 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_dent0 ∧ new_dent = old_dent1 ∧ err = err0)), fs[ri[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO, fs[ri[inodekey(m11)]].nlink = 0 ∧ m11 ≠ ROOT_INO

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Rule argument

spec: inode name: elim seq: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta) ∧ (boolvar ↔ inode.directory)) ∧ m0 = inode.nlink) ∧ m1 = inode.nsubdirs) ∧ m2 = inode.size ↔ inode = mkinode(m, md, boolvar, m0, m1, m2) subst: [inode, m, md, boolvar, m0, m1, m2] → [new_parent_inode, m15, md3, boolvar, m16, m17, m18]

Additional information

Used simplifier rules: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta) ∧ (boolvar ↔ inode.directory)) ∧ m0 = inode.nlink) ∧ m1 = inode.nsubdirs) ∧ m2 = inode.size ↔ inode = mkinode(m, md, boolvar, m0, m1, m2); (elim) Used terms: new_parent_inode, m15, md3, boolvar, m16, m17, m18