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

fs0[ri0[key]].key = key, fs0[ri0[inodekey(m8)]] = inodenode(key1, md0, boolvar0, m0, m9, m10), fs0[ri0[dentrykey(m, str0)]] = dentrynode(key0, m8), fs0[ri0[inodekey(m)]] = inodenode(key2, md2, true, m1, m2, m4), key.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-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, dentrykey(m, str0) ∈ ri0, inodekey(m8) ∈ ri0, ri0[dentrykey(m, str0)] ∈ fs0, ri0[inodekey(m8)] ∈ fs0, ri0[key] ∈ fs0, key ∈ ri0, 1 ≤ m4, boolvar3 → 1 ≤ m2, m0 = 1 → links(m8, fs0, ri0) = ∅ ++ dentrykey(m, str0), boolvar0 → dentrykeys(inodekey(m8), ri0) = ∅, key.data? → fs0[ri0[key]].data? ∧ inodekey(key.ino) ∈ ri0 ∧ ¬ fs0[ri0[inodekey(key.ino)]].directory ∧ # fs0[ri0[key]].data = VFS_PAGE_SIZE, key.dentry? → fs0[ri0[key]].dentry? ∧ inodekey(key.ino) ∈ ri0 ∧ inodekey(fs0[ri0[key]].ino) ∈ ri0 ∧ ¬ inodekey(key.ino) ∈ ro ∧ ¬ inodekey(fs0[ri0[key]].ino) ∈ ro ∧ fs0[ri0[inodekey(key.ino)]].directory, key.inode? → fs0[ri0[key]].inode? ∧ key.ino ≠ 0, m1 ≠ 0 ∨ m = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m6 = m10 ⊦ 0 = m, 0 = m8, adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, inodekey(m8) = key, inodekey(m) = key, m0 = 0, m4 = 0, m8 = ROOT_INO, inodekey(m) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m, str0), (adr4 = (dentrykey(m, str0) = key ⊃ adr2;ri0[key]) ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = (dentrykey(m, str0) = key ⊃ adr2;ri0[key]) ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = (dentrykey(m, str0) = key ⊃ adr2;ri0[key]) ⊃ dentrynode(dentrykey(m, str0), m8) ;(adr1 = (dentrykey(m, str0) = key ⊃ adr2;ri0[key]) ⊃ dentrynode(dentrykey(m, str0), 0);fs0[(dentrykey(m, str0) = key ⊃ adr2;ri0[key])]) ) ) ) .data? ∧ inodekey(key.ino) ∈ ri0 ∧ ¬ (adr4 = (m8 = key.ino ⊃ adr4;(m = key.ino ⊃ adr3;ri0[inodekey(key.ino)])) ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = (m8 = key.ino ⊃ adr4;(m = key.ino ⊃ adr3;ri0[inodekey(key.ino)])) ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = (m8 = key.ino ⊃ adr4;(m = key.ino ⊃ adr3;ri0[inodekey(key.ino)])) ⊃ dentrynode(dentrykey(m, str0), m8) ;(adr1 = (m8 = key.ino ⊃ adr4;(m = key.ino ⊃ adr3;ri0[inodekey(key.ino)])) ⊃ dentrynode(dentrykey(m, str0), 0) ;fs0[(m8 = key.ino ⊃ adr4;(m = key.ino ⊃ adr3;ri0[inodekey(key.ino)]))] ) ) ) ) .directory ∧ # (adr4 = (dentrykey(m, str0) = key ⊃ adr2;ri0[key]) ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = (dentrykey(m, str0) = key ⊃ adr2;ri0[key]) ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = (dentrykey(m, str0) = key ⊃ adr2;ri0[key]) ⊃ dentrynode(dentrykey(m, str0), m8) ;(adr1 = (dentrykey(m, str0) = key ⊃ adr2;ri0[key]) ⊃ dentrynode(dentrykey(m, str0), 0);fs0[(dentrykey(m, str0) = key ⊃ adr2;ri0[key])]) ) ) ) .data = VFS_PAGE_SIZE

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 595:
fs0[ri0[datakey(ino, n)]].key = datakey(ino, n), fs0[ri0[inodekey(m8)]] = inodenode(key1, md0, boolvar0, m0, m9, m10), fs0[ri0[dentrykey(m, str0)]] = dentrynode(key0, m8), fs0[ri0[inodekey(m)]] = inodenode(key2, md2, true, m1, m2, m4), fs0[ri0[datakey(ino, n)]].data?, (adr4 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6) ;(adr3 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ inodenode(inodekey(m), md, true, m1, m2, m4) ;(adr2 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m, str0), m8) ;(adr1 = (m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)])) ⊃ dentrynode(dentrykey(m, str0), 0) ;fs0[(m8 = ino ⊃ adr4;(m = ino ⊃ adr3;ri0[inodekey(ino)]))] ) ) ) ) .directory, 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-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, ro, fi, fo, log0), ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, dentrykey(m, str0) ∈ ri0, inodekey(m8) ∈ ri0, ri0[dentrykey(m, str0)] ∈ fs0, ri0[inodekey(m8)] ∈ fs0, ri0[datakey(ino, n)] ∈ fs0, datakey(ino, n) ∈ ri0, inodekey(ino) ∈ ri0, 1 ≤ m4, boolvar3 → 1 ≤ m2, m0 = 1 → links(m8, fs0, ri0) = ∅ ++ dentrykey(m, str0), boolvar0 → dentrykeys(inodekey(m8), ri0) = ∅, m1 ≠ 0 ∨ m = ROOT_INO, ¬ boolvar0 ∧ ¬ boolvar3 ∨ boolvar0 ∧ boolvar3 ∧ m3 = m10, ¬ boolvar0 ∧ ¬ boolvar2 ∨ boolvar0 ∧ boolvar2 ∧ m6 = m10 ⊦ 0 = m, 0 = m8, adr1 = adr4, adr1 = adr3, adr1 = adr2, adr2 = adr4, adr2 = adr3, adr3 = adr4, m0 = 0, m4 = 0, m8 = ROOT_INO, fs0[ri0[inodekey(ino)]].directory, inodekey(m) ∈ ro, adr1 ∈ fs0, adr2 ∈ fs0, adr3 ∈ fs0, adr4 ∈ fs0, adr2 ∈ ri0 -- dentrykey(m, str0)

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, m0) ≠ dentrykey(m1, str); (s)% ⊦ ¬ datakey(m, m0).inode?; (s)% ⊦ ¬ datakey(m, m0).dentry?; (s)%⊦ 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)% ⊦ inodekey(m) ≠ datakey(m0, m1); (s)