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

boolvar0 ↔ boolvar, adr1 = adr5, err = err0, m = fs[ri[dentrykey(m6, str)]].ino, m7 = fs[ri[inodekey(m6)]].nlink, m8 = fs[ri[inodekey(m6)]].nsubdirs, m9 = fs[ri[inodekey(m6)]].size, nd0 = inodenode(inodekey(m6), md1, true, fs[ri[inodekey(m6)]].nlink, fs[ri[inodekey(m6)]].nsubdirs, fs[ri[inodekey(m6)]].size), new_child_inode = mkinode(fs[ri[dentrykey(m6, str)]].ino, md, boolvar3, m0, m1, m2), new_dent = mkdentry(str, fs[ri[dentrykey(m6, str)]].ino), old_dent = mkdentry(str, fs[ri[dentrykey(m6, str)]].ino), old_parent_inode = mkinode(m6, md1, true, fs[ri[inodekey(m6)]].nlink, fs[ri[inodekey(m6)]].nsubdirs, fs[ri[inodekey(m6)]].size), ro0 = orphans(fs, ri), fs[ri[dentrykey(m6, str)]].dentry?, fs[ri[inodekey(m6)]].directory, fs[ri[inodekey(m6)]].inode?, orphans(fs, ri).inodes?, fo.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-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), inodekey(m6) ∈ ri, ri[inodekey(m6)] ∈ fs, inodekey(fs[ri[dentrykey(m6, str)]].ino) ∈ ri, ri[dentrykey(m6, str)] ∈ fs, dentrykey(m6, str) ∈ ri, 1 ≤ fs[ri[inodekey(m6)]].size, ⌊err0⌋ , boolvar2 → 1 ≤ fs[ri[inodekey(m6)]].nsubdirs, m0 = 1 → links(fs[ri[dentrykey(m6, str)]].ino, fs, ri) = ∅ ++ dentrykey(m6, str), boolvar4 → boolvar1, fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory → abs-children(fs[ri[dentrykey(m6, str)]].ino, fs, ri) = ∅, fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m6, str)]].ino), ri) = ∅, fs[ri[inodekey(m6)]].trunc? ∨ fs[ri[inodekey(m6)]].inode?, fs[ri[inodekey(m6)]].nlink ≠ 0 ∨ m6 = ROOT_INO, links(m6, abs-dirs(fs, ri)) ≠ ∅ ∨ m6 = ROOT_INO, ¬ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ ¬ boolvar2 ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m4 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ boolvar2 ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m4 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ ¬ boolvar3 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ boolvar3 ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].size, fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m5 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].size ∧ m4 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ boolvar2 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m4 = 0 ∧ ¬ boolvar2, fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m2 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].size ∧ m1 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nsubdirs ∧ boolvar3 ∨ ¬ fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].directory ∧ m0 = fs[ri[inodekey(fs[ri[dentrykey(m6, str)]].ino)]].nlink ∧ m1 = 0 ∧ ¬ boolvar3 ⊦ [files := abs-files(fs, ri); dirs := abs-dirs(fs, ri); if err = ESUCCESS then {ri0 := ri; 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), adr1, fi, ro0, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(inodekey(m6), adr0, fi, ro0, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(inodekey(fs[ri0[dentrykey(m6, str)]].ino), adr, fi, ro0, fo, fs, log, boolvar0; ri); nd := inodenode(inodekey(fs[ri0[dentrykey(m6, str)]].ino), md, boolvar3, m0, m1, m2); if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(fs[ri0[dentrykey(m6, str)]].ino), 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, nd0.meta, nd0.directory, nd0.nlink, nd0.nsubdirs, nd0.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) ∧ 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, err1, 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 = err1)), fs[ri[dentrykey(m6, str)]].ino = 0, fs[ri[dentrykey(m6, str)]].ino = ROOT_INO, fs[ri[inodekey(m6)]].size = 0, m0 = 0, m6 = 0, fs[ri[inodekey(m6)]].nlink = 0 ∧ m6 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information