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

VFS_PAGE_SIZE = n2 + m2 % VFS_PAGE_SIZE, abs-files(fs0, ri0)[m] = mkfile(m0, md1, m1, content), fs0[ri0[inodekey(m)]] = inodenode(key1, md0, false, m3, 0, m5), fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]] = datanode(datakey(m, m2 / VFS_PAGE_SIZE), buf0), dirs = abs-dirs(fs0, ri0), files = files0, files0 = abs-files(fs0, ri0) [m, mkfile(m0, md1, m1, abs-content(m, fs0, ri0)[m2 / VFS_PAGE_SIZE, fill(content[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n2)] upto m2) ], ino = inode.ino, inode = mkinode(m, md, false, m3, 0, n1), orphans(fs0, ri0).inodes?, fo.inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(fs0, ri0)), file-node-cons(fs0, ri0), file-node-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])), log-cons(log0, fs0), log-cons (log0, fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ]), orphans-cons(fs0, ri0, orphans(fs0, ri0)), orphans-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0)), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), replay-cons-strong (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), ri-cons(ri0, fs0), ri-inj(ri0), ri-inj(fi), ri-inj ( ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ubifs-cons (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(buf0, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), orphans(fs0, ri0), fi, fo, ((log0 + adr1 ') + adr2 ') + adr3 '), inodekey(m) ∈ ri0, ri0[inodekey(m)] ∈ fs0, ri0[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, m2 / VFS_PAGE_SIZE ∈ content, VFS_PAGE_SIZE ≤ # content[m2 / VFS_PAGE_SIZE], VFS_PAGE_SIZE ≤ # buf0, m2 ≤ n1, asynced → boolvar0 ⊦ ⟨asynced := ?⟩ ( afs-cons(dirs, files) → dirs = abs-dirs (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]) ∧ files = abs-files (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2] \ datakeys(inodekey(m), m2, ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])) ∧ orphans (abs-dirs (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]), abs-files (fs0[adr1, truncnode(inodekey(m), m2)][adr2, inodenode(inodekey(m), md, false, m3, 0, n1)] [adr3, datanode(datakey(m, m2 / VFS_PAGE_SIZE), fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n2)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2])) = abs-keys(orphans(fs0, ri0)) ∧ (asynced → boolvar4) ∧ fill(fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]].data, zero, m2 % VFS_PAGE_SIZE, n2) = fill(content[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n2) ∧ mkinode(m, md, false, m3, 0, n1) = (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files[m].meta, false, files[m].nlink, 0, files[m].size) ) ∧ ESUCCESS = ESUCCESS), m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, buf-opt0.some?, ino ∈ dirs, adr3 ∈ ri0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0, ino ∈ files

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 ∈ abs-dirs(fs, ri) ↔ inodekey(ino) ∈ ri ∧ fs[ri[inodekey(ino)]].directory; (s)%⊦ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory → abs-files(fs, ri)[ino] = abs-file(ino, fs, ri); (s)%⊦ abs-file(ino, fs, ri) = mkfile (fs[ri[inodekey(ino)]].size, fs[ri[inodekey(ino)]].meta, fs[ri[inodekey(ino)]].nlink, abs-content(ino, fs, ri)); (s)%⊦ mkfile(m, md, m0, content) = mkfile(m1, md0, m2, content0) ↔ m = m1 ∧ md = md0 ∧ m0 = m2 ∧ content = content0; (ws)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)%⊦ ino ∈ abs-files(fs, ri) ↔ inodekey(ino) ∈ ri ∧ ¬ fs[ri[inodekey(ino)]].directory; (s)