[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 43 from proof inv-rename-overwrite-reparent (previous step)

n0 + (boolvar3 ⊃ 1;0) = fs[ri[inodekey(m)]].nsubdirs, m1 + 1 = fs[ri[inodekey(m)]].size, ¬ fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(m5)]].directory, fs[ri[dentrykey(m, str)]] = dentrynode(key, m5), m10 = fs[ri[dentrykey(m0, str0)]].ino, m8 = fs[ri[inodekey(m)]].nlink, new_dent = mkdentry(str0, fs[ri[dentrykey(m0, str0)]].ino), fs[ri[dentrykey(m0, str0)]].ino ≠ ROOT_INO, m0 ≠ m, fs[ri[inodekey(m0)]].directory, fs[ri[inodekey(m)]].directory, ro.inodes?, fo.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(ri), ri-inj(fi), ubifs-cons(fs, ri, ro, fi, fo, log), ri[dentrykey(m, str)] ∈ fs, inodekey(m0) ∈ ri, inodekey(m) ∈ ri, inodekey(fs[ri[dentrykey(m0, str0)]].ino) ∈ ri, dentrykey(m0, str0) ∈ ri, inodekey(m5) ∈ ri, dentrykey(m, str) ∈ ri, ¬ inodekey(m) ∈ ro, ¬ inodekey(m0) ∈ ro, fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m0, str0)]].ino), ri) = ∅, m11 = 0 → links(fs[ri[dentrykey(m0, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m0, str0), ¬ fs[ri[inodekey(m5)]].directory ∧ ¬ boolvar1 ∧ m11 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].directory ∧ boolvar1 ∧ m11 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].nsubdirs ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].size, ¬ fs[ri[inodekey(m5)]].directory ∧ ¬ boolvar3 ∧ m2 = fs[ri[inodekey(m5)]].nlink ∧ m3 = fs[ri[inodekey(m5)]].nsubdirs ∨ fs[ri[inodekey(m5)]].directory ∧ boolvar3 ∧ m2 = fs[ri[inodekey(m5)]].nlink ∧ m3 = fs[ri[inodekey(m5)]].nsubdirs ∧ m4 = fs[ri[inodekey(m5)]].size, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO ⊦ ⟪aubifs_core_journal_add5# (dentrynode(dentrykey(m, str), 0), dentrynode(dentrykey(m0, new_dent.name), mkdentry(str, m5).ino), inodenode(inodekey(m), md, true, m8, n0, m1), inodenode(inodekey(m0), md0, true, fs[ri[inodekey(m0)]].nlink, fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m0)]].size), inodenode(inodekey(new_dent.ino), md2, boolvar1, m11, m6, m7), ri, fi, ro, fo ; adr3, adr2, adr1, adr0, adr, fs, log ; boolvar, err); if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m0, new_dent.name), adr2, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(new_dent.ino), adr, fi, ro, fo, fs, log, boolvar; ri); nd := inodenode(inodekey(new_dent.ino), md2, boolvar1, m11, m6, m7); if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(new_dent.ino), ri, fi, fo, fs, log, boolvar; ro); new_dent := mkdentry(new_dent.name, mkdentry(str, m5).ino); old_dent := negdentry(str); old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m8, n0, m1).meta, inodenode(inodekey(m), md, true, m8, n0, m1).directory, inodenode(inodekey(m), md, true, m8, n0, m1).nlink, inodenode(inodekey(m), md, true, m8, n0, m1).nsubdirs, inodenode(inodekey(m), md, true, m8, n0, m1).size); new_child_inode := mkinode(m10, 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))

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 44:
m1 + 1 = fs[ri[inodekey(m)]].size, n0 + (boolvar3 ⊃ 1;0) = fs[ri[inodekey(m)]].nsubdirs, ¬ fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].directory ↔ ¬ fs[ri[inodekey(m5)]].directory, fs[ri[dentrykey(m, str)]] = dentrynode(key, m5), adr6 = adr1, adr7 = adr2, adr8 = adr3, m10 = fs[ri[dentrykey(m0, str0)]].ino, m8 = fs[ri[inodekey(m)]].nlink, nd = inodenode(inodekey(new_dent.ino), md2, boolvar1, m11, m6, m7), nd0 = inodenode(inodekey(m0), md0, true, fs[ri[inodekey(m0)]].nlink, fs[ri[inodekey(m0)]].nsubdirs, fs[ri[inodekey(m0)]].size), nd1 = inodenode(inodekey(m), md, true, m8, n0, m1), nd2 = dentrynode(dentrykey(m0, new_dent.name), mkdentry(str, m5).ino), nd3 = dentrynode(dentrykey(m, str), 0), new_dent = mkdentry(str0, fs[ri[dentrykey(m0, str0)]].ino), mkdentry(str, m5).dentry?, new_dent.dentry?, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(m0)]].directory, fs[ri[inodekey(m0)]].inode?, 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), ri[inodekey(m0)] ∈ fs, dentrykey(m, str) ∈ ri, inodekey(m5) ∈ ri, dentrykey(m0, str0) ∈ ri, inodekey(fs[ri[dentrykey(m0, str0)]].ino) ∈ ri, inodekey(m) ∈ ri, inodekey(m0) ∈ ri, ri[dentrykey(m, str)] ∈ fs, m11 = 0 → links(fs[ri[dentrykey(m0, str0)]].ino, fs, ri) = ∅ ++ dentrykey(m0, str0), fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].directory → dentrykeys(inodekey(fs[ri[dentrykey(m0, str0)]].ino), ri) = ∅, fs[ri[inodekey(m0)]].trunc? ∨ fs[ri[inodekey(m0)]].inode?, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs[ri[inodekey(m0)]].nlink ≠ 0 ∨ m0 = ROOT_INO, ¬ fs[ri[inodekey(m5)]].directory ∧ ¬ boolvar3 ∧ m2 = fs[ri[inodekey(m5)]].nlink ∧ m3 = fs[ri[inodekey(m5)]].nsubdirs ∨ fs[ri[inodekey(m5)]].directory ∧ boolvar3 ∧ m2 = fs[ri[inodekey(m5)]].nlink ∧ m3 = fs[ri[inodekey(m5)]].nsubdirs ∧ m4 = fs[ri[inodekey(m5)]].size, ¬ fs[ri[inodekey(m5)]].directory ∧ ¬ boolvar1 ∧ m11 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].nsubdirs ∨ fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].directory ∧ boolvar1 ∧ m11 + 1 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].nlink ∧ m6 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].nsubdirs ∧ m7 = fs[ri[inodekey(fs[ri[dentrykey(m0, str0)]].ino)]].size ⊦ ⟪if ri-cons(ri, fs) ∧ node-cons(nd3.key, nd3) ∧ 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, adr5 with new(adr1 ' + adr2 ' + adr3 ' + (adr4 ' + adr5), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ' + adr4 ' + adr5 ') in {adr8 := adr1, adr7 := adr2, adr6 := adr3, adr0 := adr4, adr := adr5; fs := fs[adr8, nd3][adr7, nd2][adr6, nd1][adr0, nd0][adr, nd], log := ((((log + adr8) + adr7) + adr6) + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr8 := ?, adr7 := ?, adr6 := ?, adr0 := ?, adr := ?}; boolvar := ?} else abort; if err = ESUCCESS then {aubifs_core_index_remove#(dentrykey(m, str), fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m0, new_dent.name), adr7, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m), adr6, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(new_dent.ino), adr, fi, ro, fo, fs, log, boolvar; ri); nd := inodenode(inodekey(new_dent.ino), md2, boolvar1, m11, m6, m7); if nd.nlink = 0 then aubifs_core_orphans_insert#(inodekey(new_dent.ino), ri, fi, fo, fs, log, boolvar; ro); new_dent := mkdentry(new_dent.name, mkdentry(str, m5).ino); old_dent := negdentry(str); old_parent_inode0 := mkinode (m, inodenode(inodekey(m), md, true, m8, n0, m1).meta, inodenode(inodekey(m), md, true, m8, n0, m1).directory, inodenode(inodekey(m), md, true, m8, n0, m1).nlink, inodenode(inodekey(m), md, true, m8, n0, m1).nsubdirs, inodenode(inodekey(m), md, true, m8, n0, m1).size); new_child_inode := mkinode(m10, 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[dentrykey(m0, str0)]].ino = ROOT_INO, m0 = m, inodekey(m) ∈ ro, inodekey(m0) ∈ ro

Rule argument

pos: right 1

Additional information

Used simplifier rules: inode-ubifs-cons: ⊦ inodekey(ino) ∈ ri ∧ ri[inodekey(ino)] ∈ fs ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → fs[ri[inodekey(ino)]].inode?;%aubifs_core_journal_add5# (ND1, ND2, ND3, ND4, ND5, RI, FI, RO, FO ; ADR1, ADR2, ADR3, ADR4, ADR5, FS, LOG ; CSYNCED, ERR ) {if ri-cons(RI, FS) ∧ node-cons(ND1.key, ND1) ∧ node-cons(ND2.key, ND2) ∧ node-cons(ND3.key, ND3) ∧ node-cons(ND4.key, ND4) ∧ node-cons(ND5.key, ND5) then { choose adr1, adr2, adr3, adr4, adr5 with new(adr1 ' + adr2 ' + adr3 ' + (adr4 ' + adr5), FS) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ' + adr4 ' + adr5 ') in {ADR1 := adr1, ADR2 := adr2, ADR3 := adr3, ADR4 := adr4, ADR5 := adr5; FS := FS[ADR1, ND1][ADR2, ND2][ADR3, ND3][ADR4, ND4] [ADR5, ND5 ], LOG := ((((LOG + ADR1) + ADR2) + ADR3) + ADR4) + ADR5, ERR := ESUCCESS} ifnone ERR := ENOSPC or {fail#(; ; ERR); ADR1 := ?, ADR2 := ?, ADR3 := ?, ADR4 := ?, ADR5 := ?}; CSYNCED := ?} else abort };% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ key ∈ ri ∧ ubifs-cons(fs, ri, ro, fi, fo, log) → ri[key] ∈ fs; (ss)