[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 562 from proof refine-rename-new-reparent (previous step)

n0 + (boolvar1 ⊃ 1;0) = m9, m11 + 1 = m10, fs[ri[inodekey(m7)]] = inodenode(key0, md2, true, m4, m5, m6), fs[ri[dentrykey(m3, str)]] = dentrynode(key, m), fs[ri[inodekey(m3)]] = inodenode(key1, md3, boolvar, m8, m9, m10), boolvar, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), new_dent_inode0 = new_dent_inode, new_inode = mkinode(m7, md1, true, m4, m5, m6), old_dent0 = mkdentry(str, m), old_dent1 = negdentry(str0), old_dent_inode = mkinode(m, md, boolvar1, m0, m1, m2), old_inode = mkinode(m3, md0, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1), fs[ri[inodekey(m3)]].inode?, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(m3, str) ∈ ri, ri[dentrykey(m3, str)] ∈ fs, inodekey(m3) ∈ ri, ri[inodekey(m3)] ∈ fs, inodekey(m) ∈ ri, ri[inodekey(m7)] ∈ fs, inodekey(m7) ∈ ri, ⌊err0⌋ , boolvar3 → boolvar0, m8 ≠ 0 ∨ m3 = ROOT_INO, m4 ≠ 0 ∨ m7 = ROOT_INO, links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∨ fs[ri[inodekey(m)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ m2 = fs[ri[inodekey(m)]].size, fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m2 = fs[ri[inodekey(m)]].size ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1 ⊦ ⟨afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err1, dirs, files; boolvar3)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (boolvar3 → boolvar2) ∧ mkinode(m3, md0, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1) = old_inode ∧ mkinode(m7, md1, true, m4, m5, m6) = new_inode ∧ mkinode(m, md, boolvar1, m0, m1, m2) = old_dent_inode ∧ new_dent_inode0 = new_dent_inode ∧ mkdentry(str, m) = old_dent0 ∧ negdentry(str0) = old_dent1 ∧ err0 = err1), m3 = m7, dentrykey(m7, str0) ∈ ri, m4 = 0 ∧ m7 ≠ ROOT_INO, m8 = 0 ∧ m3 ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 563:
fs[ri[inodekey(m7)]] = inodenode(key0, md2, true, m4, m5, m6), fs[ri[dentrykey(m3, str)]] = dentrynode(key, m), fs[ri[inodekey(m3)]] = inodenode(key1, md3, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1), dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), new_dent_inode0 = new_dent_inode, new_inode = mkinode(m7, md1, true, m4, m5, m6), old_dent0 = mkdentry(str, m), old_dent1 = negdentry(str0), old_dent_inode = mkinode(m, md, boolvar1, m0, m1, m2), old_inode = mkinode(m3, md0, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1), m3 ≠ m7, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(m3, str) ∈ ri, ri[dentrykey(m3, str)] ∈ fs, inodekey(m3) ∈ ri, ri[inodekey(m3)] ∈ fs, inodekey(m) ∈ ri, ri[inodekey(m7)] ∈ fs, inodekey(m7) ∈ ri, ⌊err0⌋ , ¬ dentrykey(m7, str0) ∈ ri, boolvar3 → boolvar0, m8 ≠ 0 ∨ m3 = ROOT_INO, m4 ≠ 0 ∨ m7 = ROOT_INO, links(m3, abs-dirs(fs, ri)) ≠ ∅ ∨ m3 = ROOT_INO, links(m7, abs-dirs(fs, ri)) ≠ ∅ ∨ m7 = ROOT_INO, ¬ fs[ri[inodekey(m)]].directory ∧ ¬ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∨ fs[ri[inodekey(m)]].directory ∧ boolvar1 ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ m2 = fs[ri[inodekey(m)]].size, fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m2 = fs[ri[inodekey(m)]].size ∧ m1 = fs[ri[inodekey(m)]].nsubdirs ∧ boolvar1 ∨ ¬ fs[ri[inodekey(m)]].directory ∧ m0 = fs[ri[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar1 ⊦ ⟨afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent0, old_dent1, err1, dirs, files; boolvar3)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ (boolvar3 → boolvar2) ∧ mkinode(m3, md0, true, m8, n0 + (boolvar1 ⊃ 1;0), m11 + 1) = old_inode ∧ mkinode(m7, md1, true, m4, m5, m6) = new_inode ∧ mkinode(m, md, boolvar1, m0, m1, m2) = old_dent_inode ∧ new_dent_inode0 = new_dent_inode ∧ mkdentry(str, m) = old_dent0 ∧ negdentry(str0) = old_dent1 ∧ err0 = err1), m4 = 0 ∧ m7 ≠ ROOT_INO, m8 = 0 ∧ m3 ≠ ROOT_INO

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)