[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 209 from proof refine-create (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, abs-children(m0, fs1, ri1)[str, n])], files = (abs-files(fs1, ri1) ++ n)[n, mkfile(0, md, 1, ∅)], ino = inode.ino, inode = mkinode(m0, md2, true, m1, m2, m6), 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, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, false, 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, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ]), orphans-cons(fs1, ri1, orphans(fs1, ri1)), orphans-cons (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, false, 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, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, false, 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, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3], orphans(fs1, ri1), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ri1[inodekey(m0)] ∈ fs1, inodekey(m0) ∈ ri1, asynced → boolvar0, m1 ≠ 0 ∨ m0 = ROOT_INO, links(m0, abs-dirs(fs1, ri1)) ≠ ∅ ∨ m0 = ROOT_INO ⊦ ⟨c_inode := getinode(mkdentry(str, n).ino, dirs, files); asynced := ?⟩ ( afs-cons(dirs, files) → dirs = abs-dirs (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, false, 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, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, false, 1, 0, 0) ], ri1[inodekey(m0), adr1][dentrykey(m0, str), adr2][inodekey(n), adr3]) ∧ orphans (fs1[adr1, inodenode(inodekey(m0), md2, true, m1, m2, m6 + 1)][adr2, dentrynode(dentrykey(m0, str), n)] [adr3, inodenode(inodekey(n), md, false, 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, m6 + 1) = (m0 ∈ dirs ⊃ mkinode(m0, dirs[m0].meta, true, dirs[m0].nlink, dirs[m0].nsubdirs, dirs[m0].size) ;mkinode(m0, files[m0].meta, false, files[m0].nlink, 0, files[m0].size) ) ∧ mkinode(n, md, false, 1, 0, 0) = c_inode), 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, ino ∈ dirs, m1 = 0 ∧ m0 ≠ ROOT_INO

Heuristic symbolic execution applied rule assign right

And closed the goal!

Rule argument

Additional information

Used simplifier rules: ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)%⊦ ino ∈ abs-files(fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)%ino ≠ 0, ¬ ino ∈ files ⊦ ino0 ∈ files ++ ino ↔ ino0 = ino ∨ ino0 ∈ files; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)%⊦ ino ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)% ⊦ mkdentry(str, m).dentry?; (s)