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

VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, fs0[ri0[datakey(m, m2 / VFS_PAGE_SIZE)]] = datanode(datakey(m, m2 / VFS_PAGE_SIZE), buf0), fs0[ri0[inodekey(m)]] = inodenode(key1, md0, false, m3, 0, m5), dirs = abs-dirs(fs0, ri0), files0 = abs-files(fs0, ri0) [m, abs-files(fs0, ri0)[m] .content:= ( abs-content(m, fs0, ri0) [m2 / VFS_PAGE_SIZE, fill(abs-files(fs0, ri0)[m].content[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, VFS_PAGE_SIZE - m2 % VFS_PAGE_SIZE) ] upto m2) ], m2 % VFS_PAGE_SIZE ≠ 0, adr1 ≠ adr2, adr1 ≠ adr3, adr2 ≠ adr3, m ≠ 0, fo.inodes?, orphans(fs0, ri0).inodes?, afs-cons(abs-dirs(fs0, ri0), abs-files(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, n0)) ], 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])), file-node-cons(fs0, ri0), 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, n0)) ]), log-cons(log0, fs0), 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, n0)) ], 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)), orphans-cons(fs0, ri0, orphans(fs0, ri0)), 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, n0)) ], 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 '), replay-cons-strong(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), ri-cons(ri0, fs0), 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])), ri-inj(fi), ri-inj(ri0), 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, n0)) ], 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 '), ubifs-cons(fs0, ri0, orphans(fs0, ri0), fi, fo, log0), m2 / VFS_PAGE_SIZE ∈ abs-files(fs0, ri0)[m].content, datakey(m, m2 / VFS_PAGE_SIZE) ∈ ri0, ri0[datakey(m, m2 / VFS_PAGE_SIZE)] ∈ fs0, ri0[inodekey(m)] ∈ fs0, inodekey(m) ∈ ri0, m2 ≤ n1, VFS_PAGE_SIZE ≤ # buf0, VFS_PAGE_SIZE ≤ # abs-files(fs0, ri0)[m].content[m2 / VFS_PAGE_SIZE], ¬ buf-opt0.some?, ¬ adr3 ∈ ri0, ¬ adr3 ∈ fs0, ¬ adr2 ∈ fs0, ¬ adr1 ∈ fs0, asynced → boolvar0 ⊦ ⟨afs_inode_sync#(mkinode(m, md, false, m3, 0, n1); dirs, files0); inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files0[m].meta, false, files0[m].nlink, 0, files0[m].size) ); err := ESUCCESS; asynced := ?⟩ ( afs-cons(dirs, files0) → 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, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]) ∧ files0 = 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, n0)) ], 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, n0)) ], 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, n0)) ], 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, n0) = fill(abs-files(fs0, ri0)[m].content[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, VFS_PAGE_SIZE - m2 % VFS_PAGE_SIZE) ∧ mkinode(m, md, false, m3, 0, n1) = inode ∧ ESUCCESS = err)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 540:
VFS_PAGE_SIZE = n0 + m2 % VFS_PAGE_SIZE, VFS_PAGE_SIZE = n2 + m2 % VFS_PAGE_SIZE, 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), files0 = abs-files(fs0, ri0) [m, abs-files(fs0, ri0)[m] .content:= ( abs-content(m, fs0, ri0) [m2 / VFS_PAGE_SIZE, fill(abs-files(fs0, ri0)[m].content[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n2) ] upto m2) ], 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, n0)) ], 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, n0)) ]), 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, n0)) ], 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, n0)) ], 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, n0)) ], 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 ∈ abs-files(fs0, ri0)[m].content, VFS_PAGE_SIZE ≤ # abs-files(fs0, ri0)[m].content[m2 / VFS_PAGE_SIZE], VFS_PAGE_SIZE ≤ # buf0, m2 ≤ n1, m2 % VFS_PAGE_SIZE ≤ VFS_PAGE_SIZE, asynced → boolvar0 ⊦ ⟨afs_inode_sync#(mkinode(m, md, false, m3, 0, n1); dirs, files0); inode := (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode(m, files0[m].meta, false, files0[m].nlink, 0, files0[m].size) ); err := ESUCCESS; asynced := ?⟩ ( afs-cons(dirs, files0) → 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, n0)) ], ri0[datakey(m, m2 / VFS_PAGE_SIZE), adr3][inodekey(m), adr2]) ∧ files0 = 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, n0)) ], 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, n0)) ], 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, n0)) ], 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, n0) = fill(abs-files(fs0, ri0)[m].content[m2 / VFS_PAGE_SIZE], zero, m2 % VFS_PAGE_SIZE, n2) ∧ mkinode(m, md, false, m3, 0, n1) = inode ∧ ESUCCESS = err), m2 % VFS_PAGE_SIZE = 0, adr1 = adr2, adr1 = adr3, adr2 = adr3, m = 0, buf-opt0.some?, adr3 ∈ ri0, adr3 ∈ fs0, adr2 ∈ fs0, adr1 ∈ fs0

Rule argument

spec: nat name: elim-sub seq: n ≤ m ⊦ n0 = m - n ↔ m = n0 + n subst: [n, m, n0] → [m2 % VFS_PAGE_SIZE, VFS_PAGE_SIZE, n]

Additional information

Used simplifier rules: ⊦ VFS_PAGE_SIZE ≠ 0; (s)%n ≠ 0 ⊦ m % n ≤ n; (s)%n ≤ m ⊦ n0 = m - n ↔ m = n0 + n; (elim) Used terms: m2 % VFS_PAGE_SIZE, VFS_PAGE_SIZE, n