[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 26 from proof inv-rename-overwrite-keep-parent (previous step)

boolvar1 ↔ boolvar3, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory, boolvar1 ↔ old_child_inode.directory, boolvar ↔ old_dent = new_dent, new_child_inode = mkinode (fs[ri[dentrykey(m, str0)]].ino, md1, boolvar2, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nsubdirs, m6), new_dent = mkdentry(str0, fs[ri[dentrykey(m, str0)]].ino), old_child_inode = mkinode (fs[ri[dentrykey(m, str)]].ino, md0, boolvar3, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nlink, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].nsubdirs, m3), old_dent = mkdentry(str, fs[ri[dentrykey(m, str)]].ino), parent_inode = mkinode(m, md, true, fs[ri[inodekey(m)]].nlink, fs[ri[inodekey(m)]].nsubdirs, fs[ri[inodekey(m)]].size), fs[ri[dentrykey(m, str)]].dentry?, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), pre-rename-overwrite-keep-parent(parent_inode, old_dent, old_child_inode, new_dent, new_child_inode, fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), ri[inodekey(fs[ri[dentrykey(m, str)]].ino)] ∈ fs, ri[dentrykey(m, str)] ∈ fs, inodekey(m) ∈ ri, inodekey(fs[ri[dentrykey(m, str0)]].ino) ∈ ri, dentrykey(m, str0) ∈ ri, inodekey(fs[ri[dentrykey(m, str)]].ino) ∈ ri, dentrykey(m, str) ∈ ri, 1 ≤ fs[ri[inodekey(m)]].size, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m, str0)]].ino), ri) = ∅, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink = 1 → links(fs[ri[dentrykey(m, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m, str0), boolvar3 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar2 ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ∧ boolvar2 ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ ¬ boolvar3 ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].directory ∧ boolvar3 ∧ m3 = fs[ri[inodekey(fs[ri[dentrykey(m, str)]].ino)]].size, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪nd2 := dentrynode(dentrykey(parent_inode.ino, old_dent.name), 0); key1 := dentrykey(parent_inode.ino, new_dent.name); nd1 := dentrynode(key1, old_dent.ino); key0 := inodekey(parent_inode.ino); key := inodekey(new_dent.ino); if ¬ boolvar then {nd0 := inodenode (key0, parent_inode.meta, parent_inode.directory, parent_inode.nlink, parent_inode.nsubdirs - (boolvar1 ⊃ 1;0), parent_inode.size - 1); nd := inodenode(key, new_child_inode.meta, new_child_inode.directory, new_child_inode.nlink - 1, new_child_inode.nsubdirs, new_child_inode.size)} else {nd0 := inodenode(key0, parent_inode.meta, parent_inode.directory, parent_inode.nlink, parent_inode.nsubdirs, parent_inode.size); nd := inodenode(key, new_child_inode.meta, new_child_inode.directory, new_child_inode.nlink, new_child_inode.nsubdirs, new_child_inode.size)}; aubifs_core_journal_add4#(nd2, nd1, nd0, nd, ri, fi, ro, fo; adr2, adr1, adr0, adr, fs, log; boolvar0, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(parent_inode.ino, old_dent.name), fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(key1, adr1, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(key0, adr0, fi, ro, fo, fs, log, boolvar0; ri); aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar0; ri); if nd.nlink = 0 then aubifs_core_orphans_insert#(key, ri, fi, fo, fs, log, boolvar0; ro); new_dent := mkdentry(new_dent.name, old_dent.ino); old_dent := negdentry(old_dent.name); parent_inode := mkinode(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, ro, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro)), fs[ri[dentrykey(m, str0)]].ino = ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink = 0, fs[ri[inodekey(m)]].size = 0, inodekey(m) ∈ ro

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information