[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 44 from proof refine-rename-new-keep-parent (previous step)

boolvar ↔ boolvar2, dirs = abs-dirs(fs0, ri), files = abs-files(fs0, ri), fs = fs0[adr1, dentrynode(dentrykey(m3, str), 0)][adr2, dentrynode(dentrykey(m3, str0), fs0[ri[dentrykey(m3, str)]].ino)] [adr3, inodenode(inodekey(m3), md0, true, fs0[ri[inodekey(m3)]].nlink, fs0[ri[inodekey(m3)]].nsubdirs, fs0[ri[inodekey(m3)]].size) ], key = dentrykey(m3, old_dent.name), log = ((log0 + adr1 ') + adr2 ') + adr3 ', m = fs0[ri[dentrykey(m3, str)]].ino, m4 = fs0[ri[inodekey(m3)]].nlink, m5 = fs0[ri[inodekey(m3)]].nsubdirs, m6 = fs0[ri[inodekey(m3)]].size, old_dent = mkdentry(str, fs0[ri[dentrykey(m3, str)]].ino), ro = orphans(fs0, ri), ro0 = orphans(fs0, ri), fs0[ri[inodekey(m3)]].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), orphans-cons(fs0, ri, orphans(fs0, ri)), replay-cons-strong(fs0, ri, orphans(fs0, ri), fi, fo, log0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs0, ri, orphans(fs0, ri), fi, fo, log0), inodekey(m3) ∈ ri, inodekey(fs0[ri[dentrykey(m3, str)]].ino) ∈ ri, dentrykey(m3, str) ∈ ri, 1 ≤ fs0[ri[inodekey(m3)]].size, boolvar1 → 1 ≤ fs0[ri[inodekey(m3)]].nsubdirs, boolvar3 → boolvar0, fs0[ri[inodekey(m3)]].nlink ≠ 0 ∨ m3 = ROOT_INO, links(m3, abs-dirs(fs0, ri)) ≠ ∅ ∨ m3 = ROOT_INO, ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].directory ∧ ¬ boolvar1 ∧ m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].nsubdirs ∨ fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].directory ∧ boolvar1 ∧ m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].nsubdirs ∧ m2 = fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].size, fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].directory ∧ m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m2 = fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].size ∧ m1 = fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].nsubdirs ∧ boolvar1 ∨ ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].directory ∧ m0 = fs0[ri[inodekey(fs0[ri[dentrykey(m3, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1 ⊦ [ri := ri -- key; aubifs_core_index_store#(dentrykey(m3, str0), adr2, fi, ro0, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar2; ri); aubifs_core_index_store#(inodekey(m3), adr3, fi, ro0, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', 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, m5, m6).meta, inodenode(inodekey(m3), md0, true, m4, m5, m6).directory, inodenode(inodekey(m3), md0, true, m4, m5, m6).nlink, inodenode(inodekey(m3), md0, true, m4, m5, m6).nsubdirs, inodenode(inodekey(m3), md0, true, m4, m5, m6).size)] ( ubifs-cons(fs, ri, ro0, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong(fs, ri, ro0, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ 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]) → ⟪new_parent_inode := old_parent_inode⟫ ⟨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_inode := mkinode(m3, md0, true, m4, m5, m6); old_dent_inode := mkinode(m, md, boolvar1, m0, m1, m2); new_inode := mkinode(m3, md0, true, m4, m5, m6); 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)), fs0[ri[inodekey(m3)]].size = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, dentrykey(m3, str0) ∈ ri, fs0[ri[inodekey(m3)]].nlink = 0 ∧ m3 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information