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

boolvar ↔ boolvar0, ¬ fs0[ri0[inodekey(m3)]].directory ↔ ¬ fs0[ri0[inodekey(m)]].directory, fs0[ri0[inodekey(m7)]] = inodenode(key1, md2, true, m4, n0 + (boolvar1 ⊃ 1;0), m11 + 1), fs0[ri0[dentrykey(m7, str)]] = dentrynode(key2, m), fs0[ri0[dentrykey(m7, str0)]] = dentrynode(key0, m3), adr = adr4, fs = fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m3), md0, boolvar2, m10, m5, m6) ], fs1 = fs0[adr1, dentrynode(dentrykey(m7, str), 0)][adr2, dentrynode(dentrykey(m7, str0), m)][adr3, inodenode(inodekey(m7), md1, true, m4, n0, m11)] [adr4, inodenode(inodekey(m3), md0, boolvar2, m10, m5, m6) ], key = inodekey(m3), log = (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', log1 = (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', nd = inodenode(inodekey(m3), md0, boolvar2, m10, m5, m6), ri = ri1[key, adr], ri1 = (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2][inodekey(m7), adr3], ro = orphans(fs0, ri0), ro0 = orphans(fs0, ri0), mkdentry(str, m).dentry?, nd.inode?, inodenode(inodekey(m7), md1, true, m4, n0, m11).inode?, ro0.inodes?, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs, ri), file-node-cons(fs0, ri0), key-cons(key, fs1[adr]), log-cons(log, fs), log-cons(log0, fs0), orphans-cons(fs, ri, ro0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs, ri, ro0, fi, fo, log), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj(ri), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs, ri, ro0, fi, fo, log), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), inodekey(m) ∈ ri0, inodekey(m3) ∈ ri0, dentrykey(m7, str) ∈ ri0, dentrykey(m7, str0) ∈ ri0, inodekey(m7) ∈ ri0, ri0[dentrykey(m7, str0)] ∈ fs0, ri0[inodekey(m7)] ∈ fs0, ri0[dentrykey(m7, str)] ∈ fs0, adr ∈ fs1, m10 = 0 → links(m3, fs0, ri0) = ∅ ++ dentrykey(m7, str0), boolvar3 → boolvar4, fs0[ri0[inodekey(m3)]].directory → abs-children(m3, fs0, ri0) = ∅, fs0[ri0[inodekey(m3)]].directory → dentrykeys(inodekey(m3), ri0) = ∅, ¬ adr ∈ ri1 → adr ∈ fs1 → adr ∈ fs1, nd.trunc? ∨ nd.inode?, m4 ≠ 0 ∨ m7 = ROOT_INO, links(m7, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m7 = ROOT_INO, ¬ fs0[ri0[inodekey(m)]].directory ∧ ¬ boolvar1 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∨ fs0[ri0[inodekey(m)]].directory ∧ boolvar1 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ m2 = fs0[ri0[inodekey(m)]].size, ¬ fs0[ri0[inodekey(m)]].directory ∧ ¬ boolvar2 ∧ m10 + 1 = fs0[ri0[inodekey(m3)]].nlink ∧ m5 = fs0[ri0[inodekey(m3)]].nsubdirs ∨ fs0[ri0[inodekey(m3)]].directory ∧ boolvar2 ∧ m10 + 1 = fs0[ri0[inodekey(m3)]].nlink ∧ m5 = fs0[ri0[inodekey(m3)]].nsubdirs ∧ m6 = fs0[ri0[inodekey(m3)]].size, fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m2 = fs0[ri0[inodekey(m)]].size ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ boolvar1 ∨ ¬ fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1, fs0[ri0[inodekey(m3)]].directory ∧ m10 + 1 = fs0[ri0[inodekey(m3)]].nlink ∧ m6 = fs0[ri0[inodekey(m3)]].size ∧ m5 = fs0[ri0[inodekey(m3)]].nsubdirs ∧ boolvar2 ∨ ¬ fs0[ri0[inodekey(m)]].directory ∧ m10 + 1 = fs0[ri0[inodekey(m3)]].nlink ∧ m5 = 0 ∧ ¬ boolvar2, inodenode(inodekey(m7), md1, true, m4, n0, m11).trunc? ∨ inodenode(inodekey(m7), md1, true, m4, n0, m11).inode? ⊦ ⟪new_parent_inode := mkinode (m7, inodenode(inodekey(m7), md1, true, m4, n0, m11).meta, inodenode(inodekey(m7), md1, true, m4, n0, m11).directory, inodenode(inodekey(m7), md1, true, m4, n0, m11).nlink, inodenode(inodekey(m7), md1, true, m4, n0, m11).nsubdirs, inodenode(inodekey(m7), md1, true, m4, n0, m11).size)⟫ ⟨old_dent_inode0 := mkinode(m, md, boolvar1, m0, m1, m2); old_dent0 := mkdentry(str, m); old_dent1 := mkdentry(str0, m3); old_inode := mkinode(m7, md1, true, m4, n0 + (boolvar1 ⊃ 1;0), m11 + 1); old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); new_dent_inode := mkinode(m3, md0, boolvar2, m10 + 1, m5, m6); new_inode := mkinode(m7, md1, true, m4, n0 + (boolvar1 ⊃ 1;0), m11 + 1); files := abs-files(fs0, ri0); dirs := abs-dirs(fs0, ri0); 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 → boolvar0) ∧ mkinode (m7, inodenode(inodekey(m7), md1, true, m4, n0, m11).meta, inodenode(inodekey(m7), md1, true, m4, n0, m11).directory, inodenode(inodekey(m7), md1, true, m4, n0, m11).nlink, inodenode(inodekey(m7), md1, true, m4, n0, m11).nsubdirs, inodenode(inodekey(m7), md1, true, m4, n0, m11).size) = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ mkinode(m3, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size) = new_dent_inode ∧ negdentry(str) = old_dent0 ∧ mkdentry(str0, mkdentry(str, m).ino) = old_dent1 ∧ ESUCCESS = err0), nd.nlink = 0, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m3 = ROOT_INO, m3 = 0, m7 = 0, mkdentry(str, m) = mkdentry(str0, m3), adr ∈ ri1, adr2 ∈ ri0 -- dentrykey(m7, str), adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, adr3 ∈ (ri0 -- dentrykey(m7, str))[dentrykey(m7, str0), adr2], m4 = 0 ∧ m7 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).nlink = m; (s)% ⊦ adr ∈ fs[adr1, nd] ↔ adr = adr1 ∨ adr ∈ fs; (s)% ⊦ log-cons(log0 + log1, fs) ↔ log-cons(log0, fs) ∧ log-cons(log1, fs); (s)% ⊦ log-cons(adr ', fs) ↔ adr ∈ fs ∧ node-cons(fs[adr].key, fs[adr]); (s)% ⊦ adr ≠ adr0 → (adr ∈ fs[adr0, nd] ↔ adr ∈ fs); (s)% ⊦ adr ∈ fs[adr0, nd] ↔ adr = adr0 ∨ adr ∈ fs; (ws)% ⊦ adr ≠ adr0 → fs[adr0, nd][adr] = fs[adr]; (s)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)% ⊦ dentrynode(key, m).key = key; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ inodekey(m).ino = m; (s)%a: ⊦ (ax + ax0) + ax1 = ax + ax0 + ax1; from specification list[address-list-set]%⊦ key-cons(inodekey(ino), nd) ↔ nd.inode? ∧ nd.key = inodekey(ino) ∧ ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ ¬ inodenode(key, md, boolvar, m, m0, m1).trunc?; (s)