[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 12 from proof inv-rmdir (previous step)

c_inode.ino = fs[ri[dentrykey(p_inode.ino, str)]].ino, c_inode.nlink = 1, p_inode.nlink = fs[ri[inodekey(p_inode.ino)]].nlink, p_inode.nsubdirs = fs[ri[inodekey(p_inode.ino)]].nsubdirs, c_inode.nsubdirs = fs[ri[inodekey(c_inode.ino)]].nsubdirs, p_inode.size = fs[ri[inodekey(p_inode.ino)]].size, c_inode.size = fs[ri[inodekey(c_inode.ino)]].size, 1 = fs[ri[inodekey(c_inode.ino)]].nlink, dentrykeys(inodekey(c_inode.ino), ri) = ∅, links(c_inode.ino, fs, ri) = ∅ ++ dentrykey(p_inode.ino, str), fs[ri[inodekey(p_inode.ino)]].directory, p_inode.directory, fs[ri[inodekey(c_inode.ino)]].directory, c_inode.directory, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(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), dentrykey(p_inode.ino, str) ∈ ri, inodekey(c_inode.ino) ∈ ri, inodekey(p_inode.ino) ∈ ri, 1 ≤ p_inode.nsubdirs, 1 ≤ p_inode.size, p_inode.nlink ≠ 0 ∨ p_inode.ino = ROOT_INO ⊦ ⟪nd1 := inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1); nd0 := dentrynode(dentrykey(p_inode.ino, str), 0); nd := inodenode(inodekey(c_inode.ino), c_inode.meta, c_inode.directory, 0, c_inode.nsubdirs, c_inode.size); aubifs_core_journal_add3#(nd1, nd0, nd, ri, fi, ro, fo; adr1, adr0, adr, fs, log; boolvar, err); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(p_inode.ino), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_remove#(dentrykey(p_inode.ino, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(c_inode.ino), adr, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_orphans_insert#(inodekey(c_inode.ino), ri, fi, fo, fs, log, boolvar; ro); dent := negdentry(str); p_inode := mkinode(p_inode.ino, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); c_inode0 := mkinode(c_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)), c_inode.ino = ROOT_INO, p_inode.nsubdirs = 0, p_inode.size = 0, inodekey(p_inode.ino) ∈ ro, inodekey(c_inode.ino) ∈ ro

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Proof step 13:
c_inode.ino = fs[ri[dentrykey(p_inode.ino, str)]].ino, p_inode.nlink = fs[ri[inodekey(p_inode.ino)]].nlink, c_inode.nlink = 1, c_inode.nsubdirs = fs[ri[inodekey(c_inode.ino)]].nsubdirs, p_inode.nsubdirs = fs[ri[inodekey(p_inode.ino)]].nsubdirs, c_inode.size = fs[ri[inodekey(c_inode.ino)]].size, p_inode.size = fs[ri[inodekey(p_inode.ino)]].size, 1 = fs[ri[inodekey(c_inode.ino)]].nlink, dentrykeys(inodekey(c_inode.ino), ri) = ∅, links(c_inode.ino, fs, ri) = ∅ ++ dentrykey(p_inode.ino, str), c_inode.directory, fs[ri[inodekey(c_inode.ino)]].directory, p_inode.directory, fs[ri[inodekey(p_inode.ino)]].directory, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(p_inode.ino) ∈ ri, inodekey(c_inode.ino) ∈ ri, dentrykey(p_inode.ino, str) ∈ ri, 1 ≤ p_inode.size, 1 ≤ p_inode.nsubdirs, p_inode.nsubdirs ≥ 1, p_inode.size ≥ 1, p_inode.nlink ≠ 0 ∨ p_inode.ino = ROOT_INO ⊦ ⟪nd0 := dentrynode(dentrykey(p_inode.ino, str), 0); nd := inodenode(inodekey(c_inode.ino), c_inode.meta, c_inode.directory, 0, c_inode.nsubdirs, c_inode.size); aubifs_core_journal_add3# (inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1), nd0, nd, ri, fi, ro, fo ; adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(p_inode.ino), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_remove#(dentrykey(p_inode.ino, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(c_inode.ino), adr, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_orphans_insert#(inodekey(c_inode.ino), ri, fi, fo, fs, log, boolvar; ro); dent := negdentry(str); p_inode0 := mkinode (p_inode.ino, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).meta, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).directory, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).nlink, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).nsubdirs, inodenode(inodekey(p_inode.ino), p_inode.meta, p_inode.directory, p_inode.nlink, p_inode.nsubdirs - 1, p_inode.size - 1).size); c_inode0 := mkinode(c_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)), c_inode.ino = ROOT_INO, p_inode.nsubdirs = 0, p_inode.size = 0, inodekey(c_inode.ino) ∈ ro, inodekey(p_inode.ino) ∈ ro

Rule argument

Additional information

Used simplifier rules: ⊦ n ≥ m ↔ m ≤ n; (s)