[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 89 from proof write-loop-0 (previous step)

VFS_PAGE_SIZE = n0 + (ino2 + ino5) % VFS_PAGE_SIZE, files[m] = mkfile(m3, md0, m4, content), min(ino1 - ino2 + ino5, n0) ≠ 0, m ∈ files, ino5 + min(ino1 - ino2 + ino5, n0) ≤ # buf0, ino2 + ino5 ≤ ino1, (ino2 + ino5) % VFS_PAGE_SIZE + min(ino1 - ino2 + ino5, n0) ≤ VFS_PAGE_SIZE, ¬ (ino2 + ino5) / VFS_PAGE_SIZE ∈ content, ino5 = 0 → files = files1 ⊦ [fail#(; ; err); asynced := ?; n := min(ino1 - ino2 + ino5, n0); if err = ESUCCESS then ino5 := ino5 + n] (ino5 = 0 → files = files1)

Heuristic unfold applied rule call right

And obtained the following new goals

Proof step 90:
VFS_PAGE_SIZE = n0 + (ino2 + ino5) % VFS_PAGE_SIZE, files[m] = mkfile(m3, md0, m4, content), m ∈ files, (ino2 + ino5) % VFS_PAGE_SIZE + min(ino1 - ino2 + ino5, n0) ≤ VFS_PAGE_SIZE, ino2 + ino5 ≤ ino1, ino5 + min(ino1 - ino2 + ino5, n0) ≤ # buf0, ino5 = 0 → files = files1 ⊦ [choose err0 with ⌊err0⌋ in err := err0; asynced := ?; n := min(ino1 - ino2 + ino5, n0); if err = ESUCCESS then ino5 := ino5 + n] (ino5 = 0 → files = files1), min(ino1 - ino2 + ino5, n0) = 0, (ino2 + ino5) / VFS_PAGE_SIZE ∈ content

Rule argument

pos: right 1

Additional information

Used simplifier rules: fail#(; ; ERR){choose ERR0 with ⌊ERR0⌋ in ERR := ERR0};