[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 34 from proof inv-mkdir (previous step)

adr4 = adr5, err = ESUCCESS, fs = fs1[adr1, nd1][adr2, nd0][adr3, nd], fs0 = fs1, log = ((log0 + adr1) + adr2) + adr3, nd = inodenode(inodekey(n), md, true, 1, 0, 0), nd0 = dentrynode(dentrykey(m, str), n), nd1 = inodenode(inodekey(m), md0, true, fs1[ri[inodekey(m)]].nlink, fs1[ri[inodekey(m)]].nsubdirs + 1, fs1[ri[inodekey(m)]].size + 1), ri0 = ri, ri1 = ri, ri2 = ri, fs1[ri[inodekey(m)]].directory, fs1[ri[inodekey(m)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs1, ri), log-cons(log0, fs1), new(adr1 ' + (adr2 ' + adr3), fs1), orphans-cons(fs1, ri, ro), replay-cons-strong(fs1, ri, ro, fi, fo, log0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs1, ri, ro, fi, fo, log0), inodekey(m) ∈ ri, ri[inodekey(m)] ∈ fs1, fs1[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_core_index_store#(inodekey(m), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, str), adr2, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(n), adr3, fi, ro, fo, fs, log, boolvar; ri); dent := mkdentry(str, n); p_inode := mkinode (mkinode(m, md0, true, fs0[ri2[inodekey(m)]].nlink, fs0[ri1[inodekey(m)]].nsubdirs, fs0[ri0[inodekey(m)]].size).ino, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); c_inode := mkinode (n, inodenode(inodekey(n), md, true, 1, 0, 0).meta, inodenode(inodekey(n), md, true, 1, 0, 0).directory, inodenode(inodekey(n), md, true, 1, 0, 0).nlink, inodenode(inodekey(n), md, true, 1, 0, 0).nsubdirs, inodenode(inodekey(n), md, true, 1, 0, 0).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)), n = 0, dups(adr1 ' + adr2 ' + adr3 '), inodekey(m) ∈ ro, dentrykey(m, str) ∈ ri, inodekey(n) ∈ fo, inodekey(n) ∈ ri

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 35:
fs = fs1[adr1, inodenode(inodekey(m), md0, true, fs1[ri[inodekey(m)]].nlink, fs1[ri[inodekey(m)]].nsubdirs + 1, fs1[ri[inodekey(m)]].size + 1)] [adr2, dentrynode(dentrykey(m, str), n) ] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], nd1 = inodenode(inodekey(m), md0, true, fs1[ri[inodekey(m)]].nlink, fs1[ri[inodekey(m)]].nsubdirs + 1, fs1[ri[inodekey(m)]].size + 1), ri0 = ri, adr1 ≠ adr2, adr1 ≠ adr3, adr2 ≠ adr3, n ≠ 0, fs1[ri[inodekey(m)]].directory, fs1[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs1, ri), log-cons(log0, fs1), orphans-cons(fs1, ri, ro), replay-cons-strong(fs1, ri, ro, fi, fo, log0), ri-inj(fi), ri-inj(ri), ubifs-cons(fs1, ri, ro, fi, fo, log0), ri[inodekey(m)] ∈ fs1, inodekey(m) ∈ ri, ¬ adr3 ∈ fs1, ¬ adr2 ∈ fs1, ¬ adr1 ∈ fs1, ¬ inodekey(n) ∈ ri, ¬ inodekey(n) ∈ fo, ¬ dentrykey(m, str) ∈ ri, ¬ inodekey(m) ∈ ro, fs1[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_core_index_store#(inodekey(m), adr1, fi, ro, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar; ri); aubifs_core_index_store#(dentrykey(m, str), adr2, fi, ro, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar; ri); aubifs_core_index_store#(inodekey(n), adr3, fi, ro, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar; ri); dent := mkdentry(str, n); p_inode := mkinode (mkinode(m, md0, true, fs1[ri0[inodekey(m)]].nlink, fs1[ri0[inodekey(m)]].nsubdirs, fs1[ri0[inodekey(m)]].size).ino, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); c_inode := mkinode (n, inodenode(inodekey(n), md, true, 1, 0, 0).meta, inodenode(inodekey(n), md, true, 1, 0, 0).directory, inodenode(inodekey(n), md, true, 1, 0, 0).nlink, inodenode(inodekey(n), md, true, 1, 0, 0).nsubdirs, inodenode(inodekey(n), md, true, 1, 0, 0).size)⟫ ( ubifs-cons(fs, ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ replay-cons-strong(fs, ri, ro, fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 ') ∧ file-node-cons(fs, ri) ∧ orphans-cons(fs, ri, ro))

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ adr ∈ adr0 ' ↔ adr = adr0; (s)% ⊦ adr ∈ adr0 ' + ax ↔ adr = adr0 ∨ adr ∈ ax; (s)% ⊦ dups(adr ' + adr0 ') ↔ adr = adr0; (s)% ⊦ dups(adr ' + ax) ↔ dups(ax) ∨ adr ∈ ax; (ws)% ⊦ new(adr ', fs) ↔ ¬ adr ∈ fs; (s)% ⊦ new(adr ' + log, fs) ↔ ¬ adr ∈ fs ∧ new(log, fs); (s)%a: ⊦ (ax + ax0) + ax1 = ax + ax0 + ax1; from specification list[address-list-set]% ⊦ ax + adr = ax + adr '; (s)