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

fs1[ri1[inodekey(m0)]] = inodenode(key0, md1, true, m1, m2, m6), dirs = (abs-dirs(fs1, ri1)[m0, mkdir(m6 + 1, md1, m1, m2 + 1, abs-children(m0, fs1, ri1)[str, n])] ++ n)[n, mkdir(0, md, 1, 0, ∅)], files = abs-files(fs1, ri1), ino = inode.ino, inode = mkinode(m0, md2, true, m1, m2, m6), mkdentry(str, n).dentry?, fo.inodes?, orphans(fs1, ri1).inodes?, afs-cons(abs-dirs(fs1, ri1), abs-files(fs1, ri1)), file-node-cons(fs1, ri1), file-node-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]), log-cons(log0, fs1), log-cons (log0, fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ]), orphans-cons(fs1, ri1, orphans(fs1, ri1)), orphans-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1)), replay-cons-strong(fs1, ri1, orphans(fs1, ri1), fi, fo, log0), replay-cons-strong (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ri-inj(fi), ri-inj(ri1), ri-inj(ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]), ubifs-cons(fs1, ri1, orphans(fs1, ri1), fi, fo, log0), ubifs-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ino ∈ dirs, ri1[inodekey(m0)] ∈ fs1, inodekey(m0) ∈ ri1, asynced0 → boolvar0, m1 ≠ 0 ∨ m0 = ROOT_INO, links(m0, abs-dirs(fs1, ri1)) ≠ ∅ ∨ m0 = ROOT_INO ⊦ adr1 = adr3, adr1 = adr2, adr2 = adr3, m0 = 0, n = 0, ino ∈ files, dentrykey(m0, str) ∈ ri1, inodekey(n) ∈ fo, inodekey(n) ∈ ri1, adr1 ∈ fs1, adr2 ∈ fs1, adr3 ∈ fs1, ∃ asynced. afs-cons(dirs[ino, dirs[ino].meta:= inode.meta], files) → dirs[ino, dirs[ino].meta:= inode.meta] = abs-dirs (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]) ∧ files = abs-files (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]) ∧ orphans (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2 + 1, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, true, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]) = orphans(fs1, ri1) ∧ (asynced → boolvar) ∧ mkinode(m0, md2, true, m1, m2 + 1, m6 + 1) = (m0 ∈ dirs[ino, dirs[ino].meta:= inode.meta] ⊃ mkinode (m0, dirs[ino, dirs[ino].meta:= inode.meta][m0].meta, true, dirs[ino, dirs[ino].meta:= inode.meta][m0].nlink, dirs[ino, dirs[ino].meta:= inode.meta][m0].nsubdirs, dirs[ino, dirs[ino].meta:= inode.meta][m0].size) ;mkinode(m0, files[m0].meta, false, files[m0].nlink, 0, files[m0].size) ) ∧ mkinode(n, md, true, 1, 0, 0) = getinode(mkdentry(str, n).ino, dirs[ino, dirs[ino].meta:= inode.meta], files), m1 = 0 ∧ m0 ≠ ROOT_INO

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ inodenode(key, md, boolvar, m, m0, m1).directory ↔ boolvar; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkdir(m, md, m0, m1, entries).meta = md; (s)%⊦ getinode(ino, dirs, files) = (ino ∈ dirs ⊃ mkinode (ino, dirs[ino].meta, true, dirs[ino].nlink, dirs[ino].nsubdirs, dirs[ino].size) ;mkinode (ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ); (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ (ad.meta:= md).size = ad.size; (s)% ⊦ (ad.meta:= md).nsubdirs = ad.nsubdirs; (s)% ⊦ (ad.meta:= md).nlink = ad.nlink; (s)% ⊦ (ad.meta:= md).meta = md; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)%⊦ ino ∈ abs-files(fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)% ⊦ mkdentry(str, m).dentry?; (s)%ino ≠ 0, ¬ ino ∈ dirs ⊦ ino0 ∈ dirs ++ ino ↔ ino0 = ino ∨ ino0 ∈ dirs; (s)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)