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

m3 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m1, str)]].ino)]].nlink, adr4 = adr1, m = fs[ri[dentrykey(m1, str)]].ino, nd = inodenode(inodekey(m), md, false, m3, fs[ri[inodekey(m)]].nsubdirs, m2), nd0 = dentrynode(dentrykey(m1, str), 0), nd1 = inodenode(inodekey(m1), md0, true, fs[ri[inodekey(m1)]].nlink, fs[ri[inodekey(m1)]].nsubdirs, fs[ri[inodekey(m1)]].size - 1), fs[ri[inodekey(m1)]].directory, fs[ri[inodekey(m)]].inode?, fs[ri[inodekey(m1)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs, ri), log-cons(log, fs), node-cons(nd.key, nd), node-cons(nd0.key, nd0), node-cons(nd1.key, nd1), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-cons(ri, fs), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs, dentrykey(m1, str) ∈ ri, inodekey(fs[ri[dentrykey(m1, str)]].ino) ∈ ri, ri[inodekey(m1)] ∈ fs, inodekey(m1) ∈ ri, 1 ≤ fs[ri[inodekey(m1)]].size, m3 = 0 → links(fs[ri[dentrykey(m1, str)]].ino, fs, ri) = ∅ ++ dentrykey(m1, str), fs[ri[inodekey(m1)]].nlink ≠ 0 ∨ m1 = ROOT_INO ⊦ ⟪fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?; boolvar := ?; if err = ESUCCESS then {aubifs_core_index_store#(inodekey(m1), adr4, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_remove#(dentrykey(m1, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr, fi, ro, fo, fs, log, boolvar; ri); if m3 = 0 then aubifs_core_orphans_insert#(inodekey(m), ri, fi, fo, fs, log, boolvar; ro); dent := negdentry(str); p_inode := mkinode(m1, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); c_inode0 := mkinode(m, 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(m1, str)]].ino = ROOT_INO, fs[ri[inodekey(m1)]].size = 0, fs[ri[inodekey(fs[ri[dentrykey(m1, str)]].ino)]].directory, inodekey(fs[ri[dentrykey(m1, str)]].ino) ∈ ro, inodekey(m1) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 362:
m3 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m1, str)]].ino)]].nlink, fs[ri[dentrykey(m1, str)]].ino ≠ ROOT_INO, fs[ri[dentrykey(m1, str)]].ino ≠ 0, fs[ri[inodekey(m1)]].size ≠ 0, m1 ≠ 0, fs[ri[inodekey(m1)]].directory, fs[ri[inodekey(m1)]].inode?, fs[ri[inodekey(fs[ri[dentrykey(m1, str)]].ino)]].inode?, 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-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), inodekey(m1) ∈ ri, ri[inodekey(m1)] ∈ fs, dentrykey(m1, str) ∈ ri, ri[inodekey(fs[ri[dentrykey(m1, str)]].ino)] ∈ fs, inodekey(fs[ri[dentrykey(m1, str)]].ino) ∈ ri, 1 ≤ fs[ri[inodekey(m1)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m1, str)]].ino)]].directory, ¬ inodekey(m1) ∈ ro, ¬ inodekey(fs[ri[dentrykey(m1, str)]].ino) ∈ ro, m3 = 0 → links(fs[ri[dentrykey(m1, str)]].ino, fs, ri) = ∅ ++ dentrykey(m1, str), fs[ri[inodekey(m1)]].nlink ≠ 0 ∨ m1 = ROOT_INO ⊦ ⟪fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?; boolvar := ?; if err = ESUCCESS then {ri0 := ri; ri1 := ri; ri2 := ri; aubifs_core_index_store#(inodekey(m1), adr4, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_remove#(dentrykey(m1, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(fs[ri2[dentrykey(m1, str)]].ino), adr, fi, ro, fo, fs, log, boolvar; ri); m := fs[ri2[dentrykey(m1, str)]].ino; if m3 = 0 then aubifs_core_orphans_insert#(inodekey(m), ri, fi, fo, fs, log, boolvar; ro); dent := negdentry(str); p_inode := mkinode (m1, inodenode(inodekey(m1), md0, true, fs[ri0[inodekey(m1)]].nlink, fs[ri0[inodekey(m1)]].nsubdirs, fs[ri0[inodekey(m1)]].size - 1).meta, inodenode(inodekey(m1), md0, true, fs[ri0[inodekey(m1)]].nlink, fs[ri0[inodekey(m1)]].nsubdirs, fs[ri0[inodekey(m1)]].size - 1).directory, inodenode(inodekey(m1), md0, true, fs[ri0[inodekey(m1)]].nlink, fs[ri0[inodekey(m1)]].nsubdirs, fs[ri0[inodekey(m1)]].size - 1).nlink, inodenode(inodekey(m1), md0, true, fs[ri0[inodekey(m1)]].nlink, fs[ri0[inodekey(m1)]].nsubdirs, fs[ri0[inodekey(m1)]].size - 1).nsubdirs, inodenode(inodekey(m1), md0, true, fs[ri0[inodekey(m1)]].nlink, fs[ri0[inodekey(m1)]].nsubdirs, fs[ri0[inodekey(m1)]].size - 1).size); c_inode0 := mkinode (m, inodenode(inodekey(m), md, false, m3, fs[ri1[inodekey(m)]].nsubdirs, m2).meta, inodenode(inodekey(m), md, false, m3, fs[ri1[inodekey(m)]].nsubdirs, m2).directory, inodenode(inodekey(m), md, false, m3, fs[ri1[inodekey(m)]].nsubdirs, m2).nlink, inodenode(inodekey(m), md, false, m3, fs[ri1[inodekey(m)]].nsubdirs, m2).nsubdirs, inodenode(inodekey(m), md, false, m3, fs[ri1[inodekey(m)]].nsubdirs, m2).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))

Rule argument

Additional information

Used simplifier rules: ⊦ dentrykey(m, str).dentry?; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)% ⊦ dentrynode(key, m).key = key; (s)% ⊦ inodekey(m).ino = m; (s)% ⊦ inodekey(m).inode?; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)