[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 368 from proof inv-rename-overwrite-reparent (previous step)

m11 + 1 = fs0[ri0[inodekey(m8)]].nlink, ¬ fs0[ri0[inodekey(m8)]].directory ↔ ¬ fs0[ri0[inodekey(m5)]].directory, fs0[ri0[dentrykey(m0, str0)]] = dentrynode(key3, m8), fs0[ri0[inodekey(m0)]] = inodenode(key0, md1, true, m9, m12, m13), fs0[ri0[dentrykey(m, str)]] = dentrynode(key1, m5), key2.data?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, ro), replay-cons-strong(fs0, ri0, ro, fi, fo, log0), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), key2 ∈ ri0, ri0[inodekey(m0)] ∈ fs0, dentrykey(m, str) ∈ ri0, inodekey(m5) ∈ ri0, dentrykey(m0, str0) ∈ ri0, inodekey(m8) ∈ ri0, ri0[dentrykey(m, str)] ∈ fs0, inodekey(m) ∈ ri0, inodekey(m0) ∈ ri0, ri0[dentrykey(m0, str0)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, ri0[key2] ∈ fs0, key2.inode? → fs0[ri0[key2]].inode? ∧ key2.ino ≠ 0, key2.dentry? → fs0[ri0[key2]].dentry? ∧ inodekey(key2.ino) ∈ ri0 ∧ inodekey(fs0[ri0[key2]].ino) ∈ ri0 ∧ ¬ inodekey(key2.ino) ∈ ro ∧ ¬ inodekey(fs0[ri0[key2]].ino) ∈ ro ∧ fs0[ri0[inodekey(key2.ino)]].directory, key2.data? → fs0[ri0[key2]].data? ∧ inodekey(key2.ino) ∈ ri0 ∧ ¬ fs0[ri0[inodekey(key2.ino)]].directory ∧ # fs0[ri0[key2]].data = VFS_PAGE_SIZE, fs0[ri0[inodekey(m8)]].directory → dentrykeys(inodekey(m8), ri0) = ∅, m10 ≠ 0 ∨ m = ROOT_INO, m9 ≠ 0 ∨ m0 = ROOT_INO, ¬ fs0[ri0[inodekey(m5)]].directory ∧ ¬ boolvar3 ∨ fs0[ri0[inodekey(m5)]].directory ∧ boolvar3 ∧ m4 = fs0[ri0[inodekey(m5)]].size, ¬ fs0[ri0[inodekey(m5)]].directory ∧ ¬ boolvar1 ∨ fs0[ri0[inodekey(m8)]].directory ∧ boolvar1 ∧ m7 = fs0[ri0[inodekey(m8)]].size ⊦ adr1 = adr2, adr1 = adr3, adr1 = adr4, adr1 = adr5, adr2 = adr3, adr2 = adr4, adr2 = adr5, adr3 = adr4, adr3 = adr5, adr4 = adr5, dentrykey(m, str) = dentrykey(m0, str0), inodekey(m8) = key2, inodekey(m0) = key2, inodekey(m) = key2, key2 = dentrykey(m, str), m = 0, m0 = m, m0 = 0, m11 = 0, m8 = ROOT_INO, m8 = 0, adr4 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3], adr2 ∈ ri0 -- dentrykey(m, str), adr5 ∈ fs0, adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, inodekey(m) ∈ ro, inodekey(m0) ∈ ro, adr3 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2], adr5 ∈ (ri0 -- dentrykey(m, str))[dentrykey(m0, str0), adr2][inodekey(m), adr3][inodekey(m0), adr4], (adr5 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ inodenode(inodekey(m8), md2, boolvar1, m11, fs0[ri0[inodekey(m8)]].nsubdirs, m7) ;(adr4 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ inodenode(inodekey(m0), md0, true, m9, m12, m13) ;(adr3 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ inodenode(inodekey(m), md, true, m10, n0, m1) ;(adr2 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ dentrynode(dentrykey(m0, str0), m5) ;(adr1 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ dentrynode(dentrykey(m, str), 0);fs0[(dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2])]) ) ) ) ) .data? ∧ inodekey(key2.ino) ∈ ri0 ∧ ¬ (adr5 = (m8 = key2.ino ⊃ adr5;(m0 = key2.ino ⊃ adr4;(m = key2.ino ⊃ adr3;ri0[inodekey(key2.ino)]))) ⊃ inodenode(inodekey(m8), md2, boolvar1, m11, fs0[ri0[inodekey(m8)]].nsubdirs, m7) ;(adr4 = (m8 = key2.ino ⊃ adr5;(m0 = key2.ino ⊃ adr4;(m = key2.ino ⊃ adr3;ri0[inodekey(key2.ino)]))) ⊃ inodenode(inodekey(m0), md0, true, m9, m12, m13) ;(adr3 = (m8 = key2.ino ⊃ adr5;(m0 = key2.ino ⊃ adr4;(m = key2.ino ⊃ adr3;ri0[inodekey(key2.ino)]))) ⊃ inodenode(inodekey(m), md, true, m10, n0, m1) ;(adr2 = (m8 = key2.ino ⊃ adr5;(m0 = key2.ino ⊃ adr4;(m = key2.ino ⊃ adr3;ri0[inodekey(key2.ino)]))) ⊃ dentrynode(dentrykey(m0, str0), m5) ;(adr1 = (m8 = key2.ino ⊃ adr5;(m0 = key2.ino ⊃ adr4;(m = key2.ino ⊃ adr3;ri0[inodekey(key2.ino)]))) ⊃ dentrynode(dentrykey(m, str), 0) ;fs0[(m8 = key2.ino ⊃ adr5;(m0 = key2.ino ⊃ adr4;(m = key2.ino ⊃ adr3;ri0[inodekey(key2.ino)])))] ) ) ) ) ) .directory ∧ # (adr5 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ inodenode(inodekey(m8), md2, boolvar1, m11, fs0[ri0[inodekey(m8)]].nsubdirs, m7) ;(adr4 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ inodenode(inodekey(m0), md0, true, m9, m12, m13) ;(adr3 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ inodenode(inodekey(m), md, true, m10, n0, m1) ;(adr2 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ dentrynode(dentrykey(m0, str0), m5) ;(adr1 = (dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2]) ⊃ dentrynode(dentrykey(m, str), 0);fs0[(dentrykey(m0, str0) = key2 ⊃ adr2;ri0[key2])]) ) ) ) ) .data = VFS_PAGE_SIZE

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: elim-data: ⊦ key.data? ↔ (∃ ino, n. key = datakey(ino, n));%data-ubifs-cons: ⊦ datakey(ino, n) ∈ ri ∧ ri[datakey(ino, n)] ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[datakey(ino, n)]].data?;%ubifs-file-in: ⊦ datakey(ino, n) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → inodekey(ino) ∈ ri; (forward) from specification aubifs-inv%ubifs-file-notdir: ⊦ datakey(ino, n) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → ¬ fs[ri[inodekey(ino)]].directory; (forward) from specification aubifs-inv%⊦ datakey(m, n) ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → # fs[ri[datakey(m, n)]].data = VFS_PAGE_SIZE; (s)% ⊦ datakey(m, m0).ino = m; (s)% ⊦ datakey(m, m0).data?; (s)% ⊦ ¬ datakey(m, m0).dentry?; (s)% ⊦ ¬ datakey(m, m0).inode?; (s)% ⊦ datakey(m, m0) ≠ dentrykey(m1, str); (s)% ⊦ inodekey(m) ≠ datakey(m0, m1); (s)