[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 55 from proof refine-rename-new-reparent (previous step)

n0 + (boolvar1 ⊃ 1;0) = fs0[ri0[inodekey(m3)]].nsubdirs, m11 + 1 = fs0[ri0[inodekey(m3)]].size, boolvar ↔ boolvar2, dirs = abs-dirs(fs0, ri0), files = abs-files(fs0, ri0), fs = fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m7, str0), fs0[ri0[dentrykey(m3, str)]].ino)] [adr3, inodenode(inodekey(m3), md0, true, fs0[ri0[inodekey(m3)]].nlink, n0, m11) ] [adr4, inodenode (inodekey(m7), md1, true, fs0[ri0[inodekey(m7)]].nlink, fs0[ri0[inodekey(m7)]].nsubdirs + (boolvar1 ⊃ 1;0), fs0[ri0[inodekey(m7)]].size + 1) ], key = dentrykey(m3, old_dent.name), log = (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', m = fs0[ri0[dentrykey(m3, str)]].ino, m10 = fs0[ri0[inodekey(m7)]].size, m4 = fs0[ri0[inodekey(m3)]].nlink, m8 = fs0[ri0[inodekey(m7)]].nlink, m9 = fs0[ri0[inodekey(m7)]].nsubdirs, old_dent = mkdentry(str, fs0[ri0[dentrykey(m3, str)]].ino), ri = ri0 -- key, ro = orphans(fs0, ri0), ro0 = orphans(fs0, ri0), fs0[ri0[inodekey(m3)]].directory, fs0[ri0[inodekey(m7)]].directory, orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m3) ∈ ri0, inodekey(fs0[ri0[dentrykey(m3, str)]].ino) ∈ ri0, dentrykey(m3, str) ∈ ri0, inodekey(m7) ∈ ri0, boolvar3 → boolvar0, fs0[ri0[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO, fs0[ri0[inodekey(m7)]].nlink ≠ 0 ∨ m7 = ROOT_INO, links(m3, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m3 = ROOT_INO, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO, ¬ fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].directory ∧ ¬ boolvar1 ∧ m0 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].nsubdirs ∨ fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].directory ∧ boolvar1 ∧ m0 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].nsubdirs ∧ m2 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].size, fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].directory ∧ m0 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].nlink ∧ m2 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].size ∧ m1 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].nsubdirs ∧ boolvar1 ∨ ¬ fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].directory ∧ m0 = fs0[ri0[inodekey(fs0[ri0[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1 ⊦ [aubifs_core_index_store#(dentrykey(m7, str0), adr2, fi, ro0, fo, fs, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', boolvar2; ri); aubifs_core_index_store#(inodekey(m3), adr3, fi, ro0, fo, fs, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', boolvar2; ri); aubifs_core_index_store#(inodekey(m7), adr4, fi, ro0, fo, fs, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', boolvar2; ri); new_dent := mkdentry(str0, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode (m3, inodenode(inodekey(m3), md0, true, m4, n0, m11).meta, inodenode(inodekey(m3), md0, true, m4, n0, m11).directory, inodenode(inodekey(m3), md0, true, m4, n0, m11).nlink, inodenode(inodekey(m3), md0, true, m4, n0, m11).nsubdirs, inodenode(inodekey(m3), md0, true, m4, n0, m11).size); new_parent_inode := mkinode (m7, inodenode(inodekey(m7), md1, true, m8, m9 + (boolvar1 ⊃ 1;0), m10 + 1).meta, inodenode(inodekey(m7), md1, true, m8, m9 + (boolvar1 ⊃ 1;0), m10 + 1).directory, inodenode(inodekey(m7), md1, true, m8, m9 + (boolvar1 ⊃ 1;0), m10 + 1).nlink, inodenode(inodekey(m7), md1, true, m8, m9 + (boolvar1 ⊃ 1;0), m10 + 1).nsubdirs, inodenode(inodekey(m7), md1, true, m8, m9 + (boolvar1 ⊃ 1;0), m10 + 1).size)] ( ubifs-cons(fs, ri, ro0, fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') ∧ replay-cons-strong(fs, ri, ro0, fi, fo, (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log0, fs) ∧ adr1 ∈ fs ∧ node-cons(fs[adr1].key, fs[adr1]) ∧ adr2 ∈ fs ∧ node-cons(fs[adr2].key, fs[adr2]) ∧ adr3 ∈ fs ∧ node-cons(fs[adr3].key, fs[adr3]) ∧ adr4 ∈ fs ∧ node-cons(fs[adr4].key, fs[adr4]) → ⟨old_dent_inode0 := mkinode(m, md, boolvar1, m0, m1, m2); new_dent_inode0 := new_dent_inode; old_dent0 := mkdentry(str, m); old_dent1 := negdentry(str0); old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); old_inode := mkinode(m3, md0, true, m4, n0 + (boolvar1 ⊃ 1;0), m11 + 1); new_inode := mkinode(m7, md1, true, m8, m9, m10); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err0, dirs, files; boolvar3)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (boolvar3 → boolvar2) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_dent_inode0 = new_dent_inode ∧ old_dent = old_dent0 ∧ new_dent = old_dent1 ∧ ESUCCESS = err0)), adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m3 = m7, dentrykey(m7, str0) ∈ ri0, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, fs0[ri0[inodekey(m7)]].nlink = 0 ∧ m7 ≠ ROOT_INO, fs0[ri0[inodekey(m3)]].nlink = 0 ∧ m3 ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ubifs-parent-in: ⊦ dentrykey(ino, str) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → inodekey(ino) ∈ ri; (forward) from specification aubifs-inv% ⊦ inodekey(m).ino = m; (s)% ⊦ inodekey(m).inode?; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)% ⊦ adr ∈ fs[adr1, nd] ↔ adr = adr1 ∨ adr ∈ fs; (s)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)% ⊦ dentrynode(key, m).key = key; (s)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)% ⊦ adr ≠ adr0 → fs[adr0, nd][adr] = fs[adr]; (s)% ⊦ adr ∈ fs[adr0, nd] ↔ adr = adr0 ∨ adr ∈ fs; (ws)% ⊦ adr ≠ adr0 → (adr ∈ fs[adr0, nd] ↔ adr ∈ fs); (s)% ⊦ mkdentry(str, m).name = str; (s)