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

m14 + 1 = fs[ri[inodekey(m9)]].size, m12 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nlink, 0 = fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nsubdirs, 0 = fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].nsubdirs, adr6 = adr1, adr7 = adr2, adr8 = adr3, dirs = abs-dirs(fs, ri), err = ENOSPC, files = abs-files(fs, ri), m = fs[ri[dentrykey(m9, str)]].ino, m0 = fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].nlink, m1 = fs[ri[dentrykey(m4, str0)]].ino, m10 = fs[ri[inodekey(m9)]].nlink, m13 = m4, m6 = fs[ri[inodekey(m4)]].nlink, m7 = fs[ri[inodekey(m4)]].nsubdirs, m8 = fs[ri[inodekey(m4)]].size, n0 = fs[ri[inodekey(m9)]].nsubdirs, nd = inodenode(inodekey(new_dent.ino), md0, false, m12, 0, m5), nd0 = inodenode(inodekey(m4), md1, true, m6, m7, m8), nd1 = inodenode(inodekey(m9), md2, true, m10, n0, m14), nd2 = dentrynode(dentrykey(m4, new_dent.name), old_dent.ino), nd3 = dentrynode(dentrykey(m9, old_dent.name), 0), new_child_inode = mkinode(m1, md0, false, m12 + 1, 0, m5), new_dent = mkdentry(str0, fs[ri[dentrykey(m4, str0)]].ino), old_dent = mkdentry(str, fs[ri[dentrykey(m9, str)]].ino), old_parent_inode = mkinode(m9, md2, true, m10, n0, m14 + 1), ro = orphans(fs, ri), ro0 = orphans(fs, ri), new_dent.dentry?, old_dent.dentry?, fs[ri[inodekey(m4)]].directory, fs[ri[inodekey(m9)]].directory, 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), node-cons(nd3.key, nd3), node-cons(nd2.key, nd2), node-cons(nd1.key, nd1), node-cons(nd0.key, nd0), node-cons(nd.key, nd), 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(m9) ∈ ri, inodekey(m4) ∈ ri, dentrykey(m4, str0) ∈ ri, inodekey(fs[ri[dentrykey(m4, str0)]].ino) ∈ ri, dentrykey(m9, str) ∈ ri, inodekey(fs[ri[dentrykey(m9, str)]].ino) ∈ ri, boolvar2 → boolvar1, m12 = 0 → links(fs[ri[dentrykey(m4, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m4, str0), ∀ adr1, adr2, adr3, adr4, adr5. ¬(new(adr1 ' + adr2 ' + adr3 ' + (adr4 ' + adr5), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ' + adr4 ' + adr5 ')), fs[ri[inodekey(m4)]].nlink ≠ 0 ∨ m4 = ROOT_INO, fs[ri[inodekey(m9)]].nlink ≠ 0 ∨ m9 = ROOT_INO, links(m4, abs-dirs(fs, ri)) ≠ ∅ ∨ m4 = ROOT_INO, links(m9, abs-dirs(fs, ri)) ≠ ∅ ∨ m9 = ROOT_INO ⊦ [boolvar1 := boolvar, adr1 := adr6, adr2 := adr7; if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m9, old_dent.name), fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(dentrykey(m13, new_dent.name), adr2, fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(m9), adr1, fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(m13), adr0, fi, ro0, fo, fs, log, boolvar1; ri); aubifs_core_index_store#(inodekey(new_dent.ino), adr, fi, ro0, fo, fs, log, boolvar1; ri); nd := inodenode(inodekey(new_dent.ino), md0, false, m12, 0, m5); if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(new_dent.ino), ri, fi, fo, fs, log, boolvar1; ro0); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); old_parent_inode := mkinode (old_parent_inode.ino, inodenode(inodekey(m9), md2, true, m10, n0, m14).meta, inodenode(inodekey(m9), md2, true, m10, n0, m14).directory, inodenode(inodekey(m9), md2, true, m10, n0, m14).nlink, inodenode(inodekey(m9), md2, true, m10, n0, m14).nsubdirs, inodenode(inodekey(m9), md2, true, m10, n0, m14).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) ∧ log-cons(log, fs) ∧ ro0.inodes? → ⟨old_dent_inode0 := mkinode(m, md, false, m0, 0, m2); old_dent0 := mkdentry(str, m); old_dent1 := mkdentry(str0, m1); old_dent_inode := mkinode(m, md, false, m0, 0, m2); new_dent_inode := mkinode(m1, md0, false, m12 + 1, 0, m5); new_inode := mkinode(m4, md1, true, m6, m7, m8); old_inode := mkinode(m9, md2, true, m10, n0, m14 + 1); 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(ro0) ∧ (boolvar2 → boolvar1) ∧ old_parent_inode = old_inode ∧ mkinode(m13, md1, true, m6, m7, m8) = 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[dentrykey(m4, str0)]].ino = ROOT_INO, m9 = m4, fs[ri[inodekey(fs[ri[dentrykey(m4, str0)]].ino)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m9, str)]].ino)]].directory, fs[ri[inodekey(m9)]].nlink = 0 ∧ m9 ≠ ROOT_INO, fs[ri[inodekey(m4)]].nlink = 0 ∧ m4 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information