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

fs[ri[inodekey(m8)]] = inodenode(key, md0, boolvar, m0, m9, m10), fs[ri[dentrykey(m, str0)]] = dentrynode(key0, m8), adr5 = adr1, adr6 = adr2, m1 = fs[ri[inodekey(m)]].nlink, m2 = fs[ri[inodekey(m)]].nsubdirs, m4 = fs[ri[inodekey(m)]].size, nd = inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6), nd0 = inodenode(inodekey(m), md, true, m1, m2, m4), nd1 = dentrynode(dentrykey(m, str0), mkdentry(str0, m8).ino), nd2 = dentrynode(dentrykey(m, str0), 0), mkdentry(str0, m8).dentry?, fs[ri[inodekey(m)]].directory, fo.inodes?, ro.inodes?, file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, ro), replay-cons-strong(fs, ri, ro, fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, ro, fi, fo, log), dentrykey(m, str0) ∈ ri, inodekey(m8) ∈ ri, inodekey(m) ∈ ri, ri[dentrykey(m, str0)] ∈ fs, ri[inodekey(m8)] ∈ fs, 1 ≤ fs[ri[inodekey(m)]].size, boolvar3 → 1 ≤ fs[ri[inodekey(m)]].nsubdirs, m0 = 1 → links(m8, fs, ri) = ∅ ++ dentrykey(m, str0), boolvar → dentrykeys(inodekey(m8), ri) = ∅, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, ¬ boolvar ∧ ¬ boolvar3 ∨ boolvar ∧ boolvar3 ∧ m3 = m10, ¬ boolvar ∧ ¬ boolvar2 ∨ boolvar ∧ boolvar2 ∧ m6 = m10 ⊦ ⟪if ri-cons(ri, fs) ∧ node-cons(nd2.key, nd2) ∧ node-cons(nd1.key, nd1) ∧ node-cons(nd0.key, nd0) ∧ node-cons(nd.key, nd) then { choose adr1, adr2, adr3, adr4 with new(adr1 ' + adr2 ' + (adr3 ' + adr4), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ' + adr4 ') in {adr6 := adr1, adr5 := adr2, adr0 := adr3, adr := adr4; fs := fs[adr6, nd2][adr5, nd1][adr0, nd0][adr, nd], log := (((log + adr6) + adr5) + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr6 := ?, adr5 := ?, adr0 := ?, adr := ?}; boolvar := ?} else abort; if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, str0), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, str0), adr5, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m8), adr, fi, ro, fo, fs, log, boolvar; ri); nd := inodenode(inodekey(m8), md1, boolvar2, m0, m9, m6); if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(m8), ri, fi, fo, fs, log, boolvar; ro); new_dent0 := mkdentry(str0, mkdentry(str0, m8).ino); old_dent := negdentry(str0); parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m1, m2, m4).meta, inodenode(inodekey(m), md, true, m1, m2, m4).directory, inodenode(inodekey(m), md, true, m1, m2, m4).nlink, inodenode(inodekey(m), md, true, m1, m2, m4).nsubdirs, inodenode(inodekey(m), md, true, m1, m2, m4).size); new_child_inode := mkinode(m8, 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)), fs[ri[inodekey(m)]].size = 0, m0 = 0, m8 = ROOT_INO, inodekey(m) ∈ ro

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ri-cons(ri, fs); (ss)% ⊦ dentrynode(key, m).key = key; (s)% ⊦ node-cons(key0, dentrynode(key1, ino)) ↔ key0.dentry?; (s)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)%⊦ node-cons(key0, inodenode(key1, md, boolvar, n, n0, m)) ↔ key0.inode? ∧ key0.ino ≠ 0; (s)% ⊦ inodekey(m).inode?; (s)% ⊦ inodekey(m).ino = m; (s)% ⊦ ubifs-cons(fs, ri, ro, fi, fo, log) → ¬ inodekey(0) ∈ ri; (s)% ⊦ ROOT_INO ≠ 0; (s)