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

n0 + (boolvar3 ⊃ 1;0) = fs[ri[inodekey(m)]].nsubdirs, m0 + 1 = fs[ri[inodekey(m)]].size, m8 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ↔ ¬ boolvar, fs[ri[inodekey(m2)]] = inodenode(key1, md0, boolvar, m5, m9, m10), fs[ri[dentrykey(m, str)]] = dentrynode(key0, m2), adr5 = adr1, adr6 = adr2, key = inodekey(fs[ri[dentrykey(m, str0)]].ino), m1 = fs[ri[inodekey(m)]].nlink, m4 = fs[ri[dentrykey(m, str0)]].ino, m7 = fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nsubdirs, nd = inodenode(key, md1, boolvar2, m8, m7, m6), nd0 = inodenode(inodekey(m), md, true, m1, n0, m0), nd1 = dentrynode(dentrykey(m, new_dent.name), mkdentry(str, m2).ino), nd2 = dentrynode(dentrykey(m, str), 0), new_dent = mkdentry(str0, fs[ri[dentrykey(m, str0)]].ino), mkdentry(str, m2).dentry?, fs[ri[inodekey(m)]].directory, 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), node-cons(nd2.key, nd2), 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), ri[inodekey(m2)] ∈ fs, ri[dentrykey(m, str)] ∈ fs, inodekey(m) ∈ ri, inodekey(fs[ri[dentrykey(m, str0)]].ino) ∈ ri, dentrykey(m, str0) ∈ ri, inodekey(m2) ∈ ri, dentrykey(m, str) ∈ ri, fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m, str0)]].ino), ri) = ∅, m8 = 0 → links(fs[ri[dentrykey(m, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m, str0), ¬ boolvar ∧ ¬ boolvar2 ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ∧ boolvar2 ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].size, ¬ boolvar ∧ ¬ boolvar3 ∨ boolvar ∧ boolvar3 ∧ m3 = m10, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪fail#(; ; err); adr6 := ?, adr5 := ?, adr0 := ?, adr := ?; boolvar := ?; if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, new_dent.name), adr5, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(key, adr, fi, ro, fo, fs, log, boolvar; ri); nd := inodenode(key, md1, boolvar2, m8, m7, m6); if nd.nlink = 0 then aubifs_core_orphans_insert#(key, ri, fi, fo, fs, log, boolvar; ro); new_dent := mkdentry(new_dent.name, mkdentry(str, m2).ino); old_dent := negdentry(str); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m1, n0, m0).meta, inodenode(inodekey(m), md, true, m1, n0, m0).directory, inodenode(inodekey(m), md, true, m1, n0, m0).nlink, inodenode(inodekey(m), md, true, m1, n0, m0).nsubdirs, inodenode(inodekey(m), md, true, m1, n0, m0).size); new_child_inode := mkinode(m4, 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, mkdentry(str, m2) = mkdentry(str0, fs[ri[dentrykey(m, str0)]].ino), inodekey(m) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 493:
m8 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].nlink, m0 + 1 = fs[ri[inodekey(m)]].size, n0 + (boolvar3 ⊃ 1;0) = fs[ri[inodekey(m)]].nsubdirs, ¬ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ↔ ¬ boolvar, fs[ri[dentrykey(m, str)]] = dentrynode(key0, m2), fs[ri[inodekey(m2)]] = inodenode(key1, md0, boolvar, m5, m9, m10), fs[ri[dentrykey(m, str0)]].ino ≠ ROOT_INO, fs[ri[dentrykey(m, str0)]].ino ≠ 0, m ≠ 0, mkdentry(str, m2) ≠ mkdentry(str0, fs[ri[dentrykey(m, str0)]].ino), fs[ri[inodekey(m)]].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-cons(ri, fs), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), dentrykey(m, str) ∈ ri, inodekey(m2) ∈ ri, dentrykey(m, str0) ∈ ri, inodekey(fs[ri[dentrykey(m, str0)]].ino) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str)] ∈ fs, ri[inodekey(m2)] ∈ fs, ¬ inodekey(m) ∈ ro, m8 = 0 → links(fs[ri[dentrykey(m, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m, str0), fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m, str0)]].ino), ri) = ∅, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, ¬ boolvar ∧ ¬ boolvar3 ∨ boolvar ∧ boolvar3 ∧ m3 = m10, ¬ boolvar ∧ ¬ boolvar2 ∨ fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].directory ∧ boolvar2 ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m, str0)]].ino)]].size ⊦ ⟪fail#(; ; err); adr6 := ?, adr5 := ?, adr0 := ?, adr := ?; boolvar := ?; if err = ESUCCESS then {ri0 := ri; ri1 := ri; ri2 := ri; ri3 := ri; ri4 := ri; aubifs_core_index_remove#(dentrykey(m, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, mkdentry(str0, fs[ri0[dentrykey(m, str0)]].ino).name), adr5, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(fs[ri4[dentrykey(m, str0)]].ino), adr, fi, ro, fo, fs, log, boolvar; ri); nd := inodenode(inodekey(fs[ri4[dentrykey(m, str0)]].ino), md1, boolvar2, m8, fs[ri1[inodekey(fs[ri1[dentrykey(m, str0)]].ino)]].nsubdirs, m6); if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(fs[ri4[dentrykey(m, str0)]].ino), ri, fi, fo, fs, log, boolvar; ro); new_dent := mkdentry(mkdentry(str0, fs[ri0[dentrykey(m, str0)]].ino).name, mkdentry(str, m2).ino); old_dent := negdentry(str); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, fs[ri3[inodekey(m)]].nlink, n0, m0).meta, inodenode(inodekey(m), md, true, fs[ri3[inodekey(m)]].nlink, n0, m0).directory, inodenode(inodekey(m), md, true, fs[ri3[inodekey(m)]].nlink, n0, m0).nlink, inodenode(inodekey(m), md, true, fs[ri3[inodekey(m)]].nlink, n0, m0).nsubdirs, inodenode(inodekey(m), md, true, fs[ri3[inodekey(m)]].nlink, n0, m0).size); new_child_inode := mkinode(fs[ri2[dentrykey(m, str0)]].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))

Rule argument

Additional information

Used simplifier rules: ⊦ mkdentry(str, m).dentry?; (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)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)% ⊦ dentrynode(key, m).key = key; (s)