[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 48 from proof refine-link (previous step)

fs[ri[dentrykey(ino1, str)]].ino = fs[ri[dentrykey(ino0, str)]].ino, fs[ri[dentrykey(ino, str)]].ino = fs[ri[dentrykey(ino0, str)]].ino, 0 = fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nsubdirs, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), m0 = fs[ri[inodekey(m)]].nlink, m1 = fs[ri[inodekey(m)]].nsubdirs, m2 = fs[ri[inodekey(m)]].size, m3 = fs[ri[dentrykey(ino0, str)]].ino, m4 = fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink, ro = orphans(fs, ri), fs[ri[inodekey(ino0)]].directory, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(ino1)]].directory, fs[ri[inodekey(ino)]].directory, orphans(fs, ri).inodes?, fo.inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(ri), ri-inj(fi), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(ino0, str) ∈ ri, inodekey(ino0) ∈ ri, inodekey(m) ∈ ri, dentrykey(ino1, str) ∈ ri, inodekey(fs[ri[dentrykey(ino0, str)]].ino) ∈ ri, inodekey(ino1) ∈ ri, inodekey(ino) ∈ ri, dentrykey(ino, str) ∈ ri, asynced → boolvar, links(fs[ri[dentrykey(ino0, str)]].ino, abs-dirs(fs, ri)) ≠ ∅ ∨ fs[ri[dentrykey(ino0, str)]].ino = ROOT_INO, links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO, links(ino0, abs-dirs(fs, ri)) ≠ ∅ ∨ ino0 = ROOT_INO, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, fs[ri[inodekey(ino1)]].nlink ≠ 0 ∨ ino1 = ROOT_INO, fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink ≠ 0 ∨ fs[ri[dentrykey(ino0, str)]].ino = ROOT_INO ⊦ [aubifs_core_journal_add3# (inodenode(inodekey(m), md, true, m0, m1, m2 + 1), dentrynode(dentrykey(m, str0), m3), inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6), ri, fi, ro, fo ; adr1, adr0, adr, fs, log ; boolvar, err); p_inode := mkinode(m, md, true, m0, m1, m2); new_dent := negdentry(str0); ino := m3; c_inode := mkinode(m3, md0, false, m4, 0, m6); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(p_inode.ino), adr1, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m3), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(new_dent.name, ino); p_inode := mkinode (p_inode.ino, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).meta, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).directory, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).nlink, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).nsubdirs, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).size); c_inode := mkinode (ino, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).meta, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).directory, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).nlink, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).nsubdirs, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).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) ∧ ri-inj(ri) ∧ log-cons(log, fs) → ⟨old_dent0 := negdentry(str0); p_inode0 := mkinode(m, md, true, m0, m1, m2); p_inode1 := mkinode(m3, md0, false, m4, 0, m6); afs_link#(mkdentry(str, m3); p_inode0, p_inode1, old_dent0, err0, dirs, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (asynced → boolvar) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ new_dent = old_dent0 ∧ err = err0)), fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].directory, dentrykey(m, str0) ∈ ri, fs[ri[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO, fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO, fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink = 0 ∧ fs[ri[dentrykey(ino0, str)]].ino ≠ ROOT_INO

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 49:
fs[ri[dentrykey(ino, str)]].ino = fs[ri[dentrykey(ino0, str)]].ino, fs[ri[dentrykey(ino1, str)]].ino = fs[ri[dentrykey(ino0, str)]].ino, 0 = fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nsubdirs, adr4 = adr1, dirs = abs-dirs(fs, ri), files = abs-files(fs, ri), m0 = fs[ri[inodekey(m)]].nlink, m1 = fs[ri[inodekey(m)]].nsubdirs, m2 = fs[ri[inodekey(m)]].size, m3 = fs[ri[dentrykey(ino0, str)]].ino, m4 = fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink, nd = inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6), nd0 = dentrynode(dentrykey(m, str0), m3), nd1 = inodenode(inodekey(m), md, true, m0, m1, m2 + 1), ro = orphans(fs, ri), fs[ri[inodekey(ino)]].directory, fs[ri[inodekey(ino1)]].directory, fs[ri[inodekey(m)]].directory, fs[ri[inodekey(ino0)]].directory, fo.inodes?, orphans(fs, ri).inodes?, afs-cons(abs-dirs(fs, ri), abs-files(fs, ri)), file-node-cons(fs, ri), log-cons(log, fs), orphans-cons(fs, ri, orphans(fs, ri)), replay-cons-strong(fs, ri, orphans(fs, ri), fi, fo, log), ri-inj(fi), ri-inj(ri), ubifs-cons(fs, ri, orphans(fs, ri), fi, fo, log), dentrykey(ino, str) ∈ ri, inodekey(ino) ∈ ri, inodekey(ino1) ∈ ri, inodekey(fs[ri[dentrykey(ino0, str)]].ino) ∈ ri, dentrykey(ino1, str) ∈ ri, inodekey(m) ∈ ri, inodekey(ino0) ∈ ri, dentrykey(ino0, str) ∈ ri, asynced → boolvar, fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink ≠ 0 ∨ fs[ri[dentrykey(ino0, str)]].ino = ROOT_INO, fs[ri[inodekey(ino)]].nlink ≠ 0 ∨ ino = ROOT_INO, fs[ri[inodekey(ino1)]].nlink ≠ 0 ∨ ino1 = ROOT_INO, fs[ri[inodekey(m)]].nlink ≠ 0 ∨ m = ROOT_INO, links(ino0, abs-dirs(fs, ri)) ≠ ∅ ∨ ino0 = ROOT_INO, links(m, abs-dirs(fs, ri)) ≠ ∅ ∨ m = ROOT_INO, links(fs[ri[dentrykey(ino0, str)]].ino, abs-dirs(fs, ri)) ≠ ∅ ∨ fs[ri[dentrykey(ino0, str)]].ino = ROOT_INO ⊦ [if ri-cons(ri, fs) ∧ node-cons(nd1.key, nd1) ∧ node-cons(nd0.key, nd0) ∧ node-cons(nd.key, nd) then { choose adr1, adr2, adr3 with new(adr1 ' + (adr2 ' + adr3), fs) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ') in {adr4 := adr1, adr0 := adr2, adr := adr3; fs := fs[adr4, nd1][adr0, nd0][adr, nd], log := ((log + adr4) + adr0) + adr, err := ESUCCESS} ifnone err := ENOSPC or {fail#(; ; err); adr4 := ?, adr0 := ?, adr := ?}; boolvar := ?} else abort; p_inode := mkinode(m, md, true, m0, m1, m2); new_dent := negdentry(str0); ino := m3; c_inode := mkinode(m3, md0, false, m4, 0, m6); if err = ESUCCESS then {aubifs_core_index_store#(inodekey(p_inode.ino), adr4, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(dentrykey(m, str0), adr0, fi, ro, fo, fs, log, boolvar; ri); aubifs_core_index_store#(inodekey(m3), adr, fi, ro, fo, fs, log, boolvar; ri); new_dent := mkdentry(new_dent.name, ino); p_inode := mkinode (p_inode.ino, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).meta, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).directory, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).nlink, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).nsubdirs, inodenode(inodekey(m), md, true, m0, m1, m2 + 1).size); c_inode := mkinode (ino, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).meta, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).directory, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).nlink, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).nsubdirs, inodenode(inodekey(m3), md0, false, m4 + 1, 0, m6).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) ∧ ri-inj(ri) ∧ log-cons(log, fs) → ⟨old_dent0 := negdentry(str0); p_inode0 := mkinode(m, md, true, m0, m1, m2); p_inode1 := mkinode(m3, md0, false, m4, 0, m6); afs_link#(mkdentry(str, m3); p_inode0, p_inode1, old_dent0, err0, dirs, files; asynced)⟩ ( dirs = abs-dirs(fs, ri) ∧ files = abs-files(fs, ri) ∧ orphans(abs-dirs(fs, ri), abs-files(fs, ri)) = abs-keys(ro) ∧ (asynced → boolvar) ∧ p_inode = p_inode0 ∧ c_inode = p_inode1 ∧ new_dent = old_dent0 ∧ err = err0)), fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].directory, dentrykey(m, str0) ∈ ri, fs[ri[inodekey(fs[ri[dentrykey(ino0, str)]].ino)]].nlink = 0 ∧ fs[ri[dentrykey(ino0, str)]].ino ≠ ROOT_INO, fs[ri[inodekey(m)]].nlink = 0 ∧ m ≠ ROOT_INO, fs[ri[inodekey(ino1)]].nlink = 0 ∧ ino1 ≠ ROOT_INO

Rule argument

pos: right 1

Additional information

Used simplifier rules: aubifs_core_journal_add3# (ND1, ND2, ND3, RI, FI, RO, FO ; ADR1, ADR2, ADR3, FS, LOG ; CSYNCED, ERR ) {if ri-cons(RI, FS) ∧ node-cons(ND1.key, ND1) ∧ node-cons(ND2.key, ND2) ∧ node-cons(ND3.key, ND3) then { choose adr1, adr2, adr3 with new(adr1 ' + (adr2 ' + adr3), FS) ∧ ¬ dups(adr1 ' + adr2 ' + adr3 ') in {ADR1 := adr1, ADR2 := adr2, ADR3 := adr3; FS := FS[ADR1, ND1][ADR2, ND2][ADR3, ND3], LOG := ((LOG + ADR1) + ADR2) + ADR3, ERR := ESUCCESS} ifnone ERR := ENOSPC or {fail#(; ; ERR); ADR1 := ?, ADR2 := ?, ADR3 := ?}; CSYNCED := ?} else abort };