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

m3 + 1 = fs0[ri[inodekey(fs0[ri[dentrykey(m1, str)]].ino)]].nlink, adr4 = adr5, err = ESUCCESS, fs = fs0[adr1, nd1][adr2, nd0][adr3, nd], log = ((log0 + adr1) + adr2) + adr3, m = fs0[ri[dentrykey(m1, str)]].ino, nd = inodenode(inodekey(m), md, false, m3, fs0[ri[inodekey(m)]].nsubdirs, m2), nd0 = dentrynode(dentrykey(m1, str), 0), nd1 = inodenode(inodekey(m1), md0, true, fs0[ri[inodekey(m1)]].nlink, fs0[ri[inodekey(m1)]].nsubdirs, fs0[ri[inodekey(m1)]].size - 1), fs0[ri[inodekey(m1)]].directory, fs0[ri[inodekey(m1)]].inode?, fs0[ri[inodekey(m)]].inode?, fo.inodes?, ro.inodes?, file-node-cons(fs0, ri), log-cons(log0, fs0), new(adr1 ' + (adr2 ' + adr3), fs0), node-cons(nd1.key, nd1), node-cons(nd0.key, nd0), node-cons(nd.key, nd), orphans-cons(fs0, ri, ro), replay-cons-strong(fs0, ri, ro, fi, fo, log0), ri-cons(ri, fs0), ri-inj(fi), ri-inj(ri), ubifs-cons(fs0, ri, ro, fi, fo, log0), inodekey(m1) ∈ ri, ri[inodekey(m1)] ∈ fs0, inodekey(fs0[ri[dentrykey(m1, str)]].ino) ∈ ri, dentrykey(m1, str) ∈ ri, ri[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri, 1 ≤ fs0[ri[inodekey(m1)]].size, m3 = 0 → links(fs0[ri[dentrykey(m1, str)]].ino, fs0, ri) = ∅ ++ dentrykey(m1, str), fs0[ri[inodekey(m1)]].nlink ≠ 0 ∨ m1 = ROOT_INO ⊦ ⟪aubifs_core_index_store#(inodekey(m1), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_remove#(dentrykey(m1, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr3, fi, ro, fo, fs, log, boolvar; ri); if m3 = 0 then aubifs_core_orphans_insert#(inodekey(m), ri, fi, fo, fs, log, boolvar; ro); dent := negdentry(str); p_inode := mkinode(m1, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); c_inode0 := mkinode(m, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.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)), fs0[ri[dentrykey(m1, str)]].ino = ROOT_INO, fs0[ri[inodekey(m1)]].size = 0, fs0[ri[inodekey(fs0[ri[dentrykey(m1, str)]].ino)]].directory, dups(adr1 ' + adr2 ' + adr3 '), inodekey(m1) ∈ ro, inodekey(fs0[ri[dentrykey(m1, str)]].ino) ∈ ro

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 30:
m3 + 1 = fs0[ri[inodekey(fs0[ri[dentrykey(m1, str)]].ino)]].nlink, fs = fs0[adr1, inodenode(inodekey(m1), md0, true, fs0[ri[inodekey(m1)]].nlink, fs0[ri[inodekey(m1)]].nsubdirs, fs0[ri[inodekey(m1)]].size - 1)] [adr2, dentrynode(dentrykey(m1, str), 0) ] [adr3, inodenode(inodekey(fs0[ri[dentrykey(m1, str)]].ino), md, false, m3, fs0[ri[inodekey(fs0[ri[dentrykey(m1, str)]].ino)]].nsubdirs, m2) ], m = fs0[ri[dentrykey(m1, str)]].ino, nd = inodenode(inodekey(fs0[ri[dentrykey(m1, str)]].ino), md, false, m3, fs0[ri[inodekey(fs0[ri[dentrykey(m1, str)]].ino)]].nsubdirs, m2), nd1 = inodenode(inodekey(m1), md0, true, fs0[ri[inodekey(m1)]].nlink, fs0[ri[inodekey(m1)]].nsubdirs, fs0[ri[inodekey(m1)]].size - 1), fs0[ri[dentrykey(m1, str)]].ino ≠ ROOT_INO, fs0[ri[dentrykey(m1, str)]].ino ≠ 0, fs0[ri[inodekey(m1)]].size ≠ 0, adr1 ≠ adr2, adr1 ≠ adr3, adr2 ≠ adr3, m1 ≠ 0, fs0[ri[inodekey(m1)]].directory, fs0[ri[inodekey(fs0[ri[dentrykey(m1, str)]].ino)]].inode?, fs0[ri[inodekey(m1)]].inode?, ro.inodes?, fo.inodes?, file-node-cons(fs0, ri), log-cons(log0, fs0), orphans-cons(fs0, ri, ro), replay-cons-strong(fs0, ri, ro, fi, fo, log0), ri-cons(ri, fs0), ri-inj(ri), ri-inj(fi), ubifs-cons(fs0, ri, ro, fi, fo, log0), ri[inodekey(fs0[ri[dentrykey(m1, str)]].ino)] ∈ fs0, dentrykey(m1, str) ∈ ri, inodekey(fs0[ri[dentrykey(m1, str)]].ino) ∈ ri, ri[inodekey(m1)] ∈ fs0, inodekey(m1) ∈ ri, 1 ≤ fs0[ri[inodekey(m1)]].size, ¬ fs0[ri[inodekey(fs0[ri[dentrykey(m1, str)]].ino)]].directory, ¬ adr3 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr1 ∈ fs0, ¬ inodekey(fs0[ri[dentrykey(m1, str)]].ino) ∈ ro, ¬ inodekey(m1) ∈ ro, m3 = 0 → links(fs0[ri[dentrykey(m1, str)]].ino, fs0, ri) = ∅ ++ dentrykey(m1, str), fs0[ri[inodekey(m1)]].nlink ≠ 0 ∨ m1 = ROOT_INO ⊦ ⟪aubifs_core_index_store#(inodekey(m1), adr1, fi, ro, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar; ri); aubifs_core_index_remove#(dentrykey(m1, str), fi, ro, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar; ri); aubifs_core_index_store#(inodekey(m), adr3, fi, ro, fo, fs, ((log0 + adr1 ') + adr2 ') + adr3 ', boolvar; ri); log := ((log0 + adr1 ') + adr2 ') + adr3 '; if m3 = 0 then aubifs_core_orphans_insert#(inodekey(m), ri, fi, fo, fs, log, boolvar; ro); dent := negdentry(str); p_inode := mkinode(m1, nd1.meta, nd1.directory, nd1.nlink, nd1.nsubdirs, nd1.size); c_inode0 := mkinode(m, nd.meta, nd.directory, nd.nlink, nd.nsubdirs, nd.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))

Rule argument

Additional information

Used simplifier rules: not-zero: 0 < n ⊦ (* n) ≤ m → m ≠ 0; (forward) from specification nat% ⊦ 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)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)% ⊦ dentrynode(key, m).key = key; (s)% ⊦ inodekey(m).ino = m; (s)% ⊦ inodekey(m).inode?; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)