[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 inv-rename-overwrite-reparent (previous step)

m1 + 1 = fs0[ri[inodekey(m)]].size, n0 + (boolvar3 ⊃ 1;0) = fs0[ri[inodekey(m)]].nsubdirs, ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m0, str0)]].ino)]].directory ↔ ¬ fs0[ri[inodekey(m5)]].directory, fs0[ri[inodekey(m0)]] = inodenode(key0, md1, true, m9, m12, m13), fs0[ri[dentrykey(m, str)]] = dentrynode(key1, m5), fs = fs0[adr1, dentrynode(dentrykey(m, str), 0)][adr2, dentrynode(dentrykey(m0, str0), m5)] [adr3, inodenode(inodekey(m), md, true, fs0[ri[inodekey(m)]].nlink, n0, m1) ] [adr4, inodenode(inodekey(m0), md0, true, m9, m12, m13) ] [adr5, inodenode(inodekey(fs0[ri[dentrykey(m0, str0)]].ino), md2, boolvar1, m11, m6, m7) ], key = dentrykey(m, str), log = ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', m10 = fs0[ri[dentrykey(m0, str0)]].ino, m8 = fs0[ri[inodekey(m)]].nlink, new_dent = mkdentry(str0, fs0[ri[dentrykey(m0, str0)]].ino), fs0[ri[inodekey(m)]].directory, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri), log-cons(log0, fs0), orphans-cons(fs0, ri, ro), replay-cons-strong(fs0, ri, ro, fi, fo, log0), ri-cons(ri, fs0), ri-inj(fi), ri-inj(ri), ubifs-cons(fs0, ri, ro, fi, fo, log0), ri[inodekey(m0)] ∈ fs0, dentrykey(m, str) ∈ ri, inodekey(m5) ∈ ri, dentrykey(m0, str0) ∈ ri, inodekey(fs0[ri[dentrykey(m0, str0)]].ino) ∈ ri, inodekey(m) ∈ ri, inodekey(m0) ∈ ri, ri[dentrykey(m, str)] ∈ fs0, m11 = 0 → links(fs0[ri[dentrykey(m0, str0)]].ino, fs0, ri) = ∅ ++ dentrykey(m0, str0), fs0[ri[inodekey(fs0[ri[dentrykey(m0, str0)]].ino)]].directory → dentrykeys(inodekey(fs0[ri[dentrykey(m0, str0)]].ino), ri) = ∅, fs0[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, m9 ≠ 0 ∨ m0 = ROOT_INO, ¬ fs0[ri[inodekey(m5)]].directory ∧ ¬ boolvar3 ∧ m2 = fs0[ri[inodekey(m5)]].nlink ∧ m3 = fs0[ri[inodekey(m5)]].nsubdirs ∨ fs0[ri[inodekey(m5)]].directory ∧ boolvar3 ∧ m2 = fs0[ri[inodekey(m5)]].nlink ∧ m3 = fs0[ri[inodekey(m5)]].nsubdirs ∧ m4 = fs0[ri[inodekey(m5)]].size, ¬ fs0[ri[inodekey(m5)]].directory ∧ ¬ boolvar1 ∧ m11 + 1 = fs0[ri[inodekey(fs0[ri[dentrykey(m0, str0)]].ino)]].nlink ∧ m6 = fs0[ri[inodekey(fs0[ri[dentrykey(m0, str0)]].ino)]].nsubdirs ∨ fs0[ri[inodekey(fs0[ri[dentrykey(m0, str0)]].ino)]].directory ∧ boolvar1 ∧ m11 + 1 = fs0[ri[inodekey(fs0[ri[dentrykey(m0, str0)]].ino)]].nlink ∧ m6 = fs0[ri[inodekey(fs0[ri[dentrykey(m0, str0)]].ino)]].nsubdirs ∧ m7 = fs0[ri[inodekey(fs0[ri[dentrykey(m0, str0)]].ino)]].size ⊦ ⟪ri := ri -- key; aubifs_core_index_store# (dentrykey(m0, new_dent.name), adr2, fi, ro, fo, fs, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', boolvar; ri); aubifs_core_index_store#(inodekey(m), adr3, fi, ro, fo, fs, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', boolvar; ri); aubifs_core_index_store#(inodekey(m0), adr4, fi, ro, fo, fs, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', boolvar; ri); aubifs_core_index_store#(inodekey(new_dent.ino), adr5, fi, ro, fo, fs, ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 ', boolvar; ri); nd := inodenode(inodekey(new_dent.ino), md2, boolvar1, m11, m6, m7); log := ((((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ') + adr5 '; if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(new_dent.ino), ri, fi, fo, fs, log, boolvar; ro); new_dent := mkdentry(new_dent.name, mkdentry(str, m5).ino); old_dent := negdentry(str); old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m8, n0, m1).meta, inodenode(inodekey(m), md, true, m8, n0, m1).directory, inodenode(inodekey(m), md, true, m8, n0, m1).nlink, inodenode(inodekey(m), md, true, m8, n0, m1).nsubdirs, inodenode(inodekey(m), md, true, m8, n0, m1).size); new_child_inode := mkinode(m10, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)⟫ (ubifs-cons(fs, ri, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), fs0[ri[dentrykey(m0, str0)]].ino = ROOT_INO, fs0[ri[dentrykey(m0, str0)]].ino = 0, adr1 = adr2, adr1 = adr3, adr1 = adr4, adr1 = adr5, adr2 = adr3, adr2 = adr4, adr2 = adr5, adr3 = adr4, adr3 = adr5, adr4 = adr5, m = 0, m0 = m, m0 = 0, adr5 ∈ fs0, adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m) ∈ ro, inodekey(m0) ∈ ro

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information