[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 66 from proof refine-rename-overwrite-keep-parent-identity (previous step)

fs0[ri0[dentrykey(m6, str)]] = dentrynode(key1, m), fs0[ri0[inodekey(m6)]] = inodenode(key0, md2, true, m7, m8, m9), ri = ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3], adr1 ≠ adr2, adr1 ≠ adr3, adr1 ≠ adr4, adr2 ≠ adr3, adr2 ≠ adr4, adr3 ≠ adr4, m ≠ ROOT_INO, m ≠ 0, m0 ≠ 0, m6 ≠ 0, m9 ≠ 0, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj(fi), ri-inj(ri0), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), dentrykey(m6, str) ∈ ri0, inodekey(m) ∈ ri0, inodekey(m6) ∈ ri0, ri0[dentrykey(m6, str)] ∈ fs0, ri0[inodekey(m6)] ∈ fs0, 1 ≤ m9, ¬ adr2 ∈ ri0 -- dentrykey(m6, str), ¬ adr4 ∈ fs0, ¬ adr3 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr1 ∈ fs0, fs0[ri0[inodekey(m)]].directory → dentrykeys(inodekey(m), ri0) = ∅, fs0[ri0[inodekey(m)]].directory → abs-children(m, fs0, ri0) = ∅, boolvar4 → boolvar1, m0 = 1 → links(m, fs0, ri0) = ∅ ++ dentrykey(m6, str), boolvar2 → 1 ≤ m8, fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m2 = fs0[ri0[inodekey(m)]].size ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ boolvar3 ∨ ¬ fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar3, fs0[ri0[inodekey(m)]].directory ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m5 = fs0[ri0[inodekey(m)]].size ∧ m4 = fs0[ri0[inodekey(m)]].nsubdirs ∧ boolvar2 ∨ ¬ fs0[ri0[inodekey(m)]].directory ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m4 = 0 ∧ ¬ boolvar2, ¬ fs0[ri0[inodekey(m)]].directory ∧ ¬ boolvar3 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∨ fs0[ri0[inodekey(m)]].directory ∧ boolvar3 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ m2 = fs0[ri0[inodekey(m)]].size, ¬ fs0[ri0[inodekey(m)]].directory ∧ ¬ boolvar2 ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m4 = fs0[ri0[inodekey(m)]].nsubdirs ∨ fs0[ri0[inodekey(m)]].directory ∧ boolvar2 ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m4 = fs0[ri0[inodekey(m)]].nsubdirs ∧ m5 = fs0[ri0[inodekey(m)]].size, links(m6, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m6 = ROOT_INO, m7 ≠ 0 ∨ m6 = ROOT_INO ⊦ [aubifs_core_index_store# (inodekey(m), adr4, fi, orphans(fs0, ri0), fo, fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', boolvar0 ; ri); nd := inodenode(inodekey(m), md, boolvar3, m0, m1, m2); log := (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '; ro0 := orphans(fs0, ri0); fs := fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ]; if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(m), ri, fi, fo, fs, log, boolvar0; ro0); new_dent0 := mkdentry(str, mkdentry(str, m).ino); old_dent := negdentry(str); old_parent_inode := mkinode (m6, inodenode(inodekey(m6), md1, true, m7, m8, m9).meta, inodenode(inodekey(m6), md1, true, m7, m8, m9).directory, inodenode(inodekey(m6), md1, true, m7, m8, m9).nlink, inodenode(inodekey(m6), md1, true, m7, m8, m9).nsubdirs, inodenode(inodekey(m6), md1, true, m7, m8, m9).size); new_child_inode := mkinode(m, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)] ( ubifs-cons(fs, ri, ro0, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro0, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log, fs) ∧ ro0.inodes? → ⟪new_parent_inode := old_parent_inode⟫ ⟨old_dent2 := mkdentry(str, m); old_dent_inode0 := mkinode(m, md0, boolvar2, m3, m4, m5); old_dent1 := mkdentry(str, m); new_dent_inode := mkinode(m, md, boolvar3, m0, m1, m2); old_inode := mkinode(m6, md1, true, m7, m8, m9); old_dent_inode := mkinode(m, md0, boolvar2, m3, m4, m5); new_inode := mkinode(m6, md1, true, m7, m8, m9); files := abs-files(fs0, ri0); dirs := abs-dirs(fs0, ri0); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent1, old_dent2, err0, dirs, files; boolvar4)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (boolvar4 → boolvar0) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent1 ∧ new_dent0 = old_dent2 ∧ ESUCCESS = err0)), m7 = 0 ∧ m6 ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 67:
boolvar ↔ boolvar0, fs0[ri0[inodekey(m6)]] = inodenode(key0, md2, true, m7, m8, m9), fs0[ri0[dentrykey(m6, str)]] = dentrynode(key1, m), adr = adr4, fs = fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ], key = inodekey(m), log = (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 ', ri = ri0[dentrykey(m6, str), adr2][inodekey(m6), adr3], ro = orphans(fs0, ri0), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), log-cons(log0, fs0), orphans-cons(fs0, ri0, orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri0[inodekey(m6)] ∈ fs0, ri0[dentrykey(m6, str)] ∈ fs0, inodekey(m6) ∈ ri0, inodekey(m) ∈ ri0, dentrykey(m6, str) ∈ ri0, 1 ≤ m9, boolvar2 → 1 ≤ m8, m0 = 1 → links(m, fs0, ri0) = ∅ ++ dentrykey(m6, str), boolvar4 → boolvar1, fs0[ri0[inodekey(m)]].directory → abs-children(m, fs0, ri0) = ∅, fs0[ri0[inodekey(m)]].directory → dentrykeys(inodekey(m), ri0) = ∅, m7 ≠ 0 ∨ m6 = ROOT_INO, links(m6, abs-dirs(fs0, ri0)) ≠ ∅ ∨ m6 = ROOT_INO, ¬ fs0[ri0[inodekey(m)]].directory ∧ ¬ boolvar2 ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m4 = fs0[ri0[inodekey(m)]].nsubdirs ∨ fs0[ri0[inodekey(m)]].directory ∧ boolvar2 ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m4 = fs0[ri0[inodekey(m)]].nsubdirs ∧ m5 = fs0[ri0[inodekey(m)]].size, ¬ fs0[ri0[inodekey(m)]].directory ∧ ¬ boolvar3 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∨ fs0[ri0[inodekey(m)]].directory ∧ boolvar3 ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ m2 = fs0[ri0[inodekey(m)]].size, fs0[ri0[inodekey(m)]].directory ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m5 = fs0[ri0[inodekey(m)]].size ∧ m4 = fs0[ri0[inodekey(m)]].nsubdirs ∧ boolvar2 ∨ ¬ fs0[ri0[inodekey(m)]].directory ∧ m3 = fs0[ri0[inodekey(m)]].nlink ∧ m4 = 0 ∧ ¬ boolvar2, fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m2 = fs0[ri0[inodekey(m)]].size ∧ m1 = fs0[ri0[inodekey(m)]].nsubdirs ∧ boolvar3 ∨ ¬ fs0[ri0[inodekey(m)]].directory ∧ m0 = fs0[ri0[inodekey(m)]].nlink ∧ m1 = 0 ∧ ¬ boolvar3 ⊦ [if ¬ adr ∈ ri ∧ adr ∈ fs ∧ key-cons(key, fs[adr]) then ri[key] := adr else abort; nd := inodenode(inodekey(m), md, boolvar3, m0, m1, m2); log := (((log0 + adr1 ') + adr2 ') + adr3 ') + adr4 '; ro0 := orphans(fs0, ri0); fs := fs0[adr1, dentrynode(dentrykey(m6, str), 0)][adr2, dentrynode(dentrykey(m6, str), m)][adr3, inodenode(inodekey(m6), md1, true, m7, m8, m9)] [adr4, inodenode(inodekey(m), md, boolvar3, m0, m1, m2) ]; if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(m), ri, fi, fo, fs, log, boolvar0; ro0); new_dent0 := mkdentry(str, mkdentry(str, m).ino); old_dent := negdentry(str); old_parent_inode := mkinode (m6, inodenode(inodekey(m6), md1, true, m7, m8, m9).meta, inodenode(inodekey(m6), md1, true, m7, m8, m9).directory, inodenode(inodekey(m6), md1, true, m7, m8, m9).nlink, inodenode(inodekey(m6), md1, true, m7, m8, m9).nsubdirs, inodenode(inodekey(m6), md1, true, m7, m8, m9).size); new_child_inode := mkinode(m, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.size)] ( ubifs-cons(fs, ri, ro0, fi, fo, log) ∧ replay-cons-strong(fs, ri, ro0, fi, fo, log) ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro0) ∧ ri-inj(ri) ∧ log-cons(log, fs) ∧ ro0.inodes? → ⟪new_parent_inode := old_parent_inode⟫ ⟨old_dent2 := mkdentry(str, m); old_dent_inode0 := mkinode(m, md0, boolvar2, m3, m4, m5); old_dent1 := mkdentry(str, m); new_dent_inode := mkinode(m, md, boolvar3, m0, m1, m2); old_inode := mkinode(m6, md1, true, m7, m8, m9); old_dent_inode := mkinode(m, md0, boolvar2, m3, m4, m5); new_inode := mkinode(m6, md1, true, m7, m8, m9); files := abs-files(fs0, ri0); dirs := abs-dirs(fs0, ri0); afs_rename#(; old_inode, new_inode, old_dent_inode, new_dent_inode, old_dent1, old_dent2, err0, dirs, files; boolvar4)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro0) ∧ (boolvar4 → boolvar0) ∧ old_parent_inode = old_inode ∧ new_parent_inode = new_inode ∧ old_dent_inode0 = old_dent_inode ∧ new_child_inode = new_dent_inode ∧ old_dent = old_dent1 ∧ new_dent0 = old_dent2 ∧ ESUCCESS = err0)), adr1 = adr2, adr1 = adr3, adr1 = adr4, adr2 = adr3, adr2 = adr4, adr3 = adr4, m = ROOT_INO, m = 0, m0 = 0, m6 = 0, m9 = 0, adr2 ∈ ri0 -- dentrykey(m6, str), adr4 ∈ fs0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, m7 = 0 ∧ m6 ≠ ROOT_INO

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_index_store#(KEY, ADR, FI, RO, FO, FS, LOG, CSYNCED; RI) {if ¬ ADR ∈ RI ∧ ADR ∈ FS ∧ key-cons(KEY, FS[ADR]) then RI[KEY] := ADR else abort };