[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 688 from proof refine-truncate-buff-none-uncached (previous step)

m2 + n1 = m2 / VFS_PAGE_SIZE * VFS_PAGE_SIZE + VFS_PAGE_SIZE, cache_files[m0] = mkfile(m3, md1, # links(m0, cache_dirs), content1), cache_icache[m0] = mkientry(boolvar0, mkinode(m4, md2, false, # links(m0, cache_dirs), m11, m12)), fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1) = fill((content1 ⊕ mkcontent(m0, cache_pcache0))[m2 / VFS_PAGE_SIZE], zero, n0, n1), m2 = n0 + m2 / VFS_PAGE_SIZE * VFS_PAGE_SIZE, afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache0) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache0, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache0), m2 / VFS_PAGE_SIZE ∈ content1, m0 ∈ cache_files, m0 ∈ cache_icache, m2 ≤ m7, VFS_PAGE_SIZE ≤ # (content1 ⊕ mkcontent(m0, cache_pcache0))[m2 / VFS_PAGE_SIZE], cache_sync → synced(cache_files, cache_icache, cache_pcache0), ∀ key. key ∈ cache_pcache0 → key.data? ⊦ n * VFS_PAGE_SIZE < m2 ∧ n ∈ content1 ⊕ mkcontent(m0, cache_pcache0) ↔ n ∈ (content1[m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)] upto m2) ⊕ mkcontent (m0, truncate(m0, m2, cache_pcache0)[datakey(m0, m2 / VFS_PAGE_SIZE), mkpentry(false, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1))]), m2 = m2 / VFS_PAGE_SIZE * VFS_PAGE_SIZE, n = m2 / VFS_PAGE_SIZE, datakey(m0, m2 / VFS_PAGE_SIZE) ∈ cache_pcache0

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Rule argument

fma: n ∈ ( content1 [m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1) ] upto m2) ⊕ mkcontent (m0, truncate(m0, m2, cache_pcache0) [datakey(m0, m2 / VFS_PAGE_SIZE), mkpentry (false, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)) ])

Additional information

Used simplifier rules: ⊦ n ∈ content0 ⊕ content1 ↔ n ∈ content0 ∨ n ∈ content1; (ws)% ⊦ m ∈ content upto n ↔ m * VFS_PAGE_SIZE < n ∧ m ∈ content; (s)% ⊦ n ≠ n0 → (n ∈ content[n0, buf] ↔ n ∈ content); (s)% ⊦ n ∈ mkcontent(ino, pcache) ↔ datakey(ino, n) ∈ pcache; (s)% ⊦ key ∈ pcache[key0, pe] ↔ key = key0 ∨ key ∈ pcache; (ws)%⊦ key ∈ truncate(ino, size, pcache) ↔ key.data? ∧ key ∈ pcache ∧ (key.part * VFS_PAGE_SIZE < size ∨ ino ≠ key.ino); (s)% ⊦ datakey(m, m0).data?; (s)% ⊦ datakey(m, m0).part = m0; (s) Used formulas: n ∈ ( content1 [m2 / VFS_PAGE_SIZE, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1) ] upto m2) ⊕ mkcontent (m0, truncate(m0, m2, cache_pcache0) [datakey(m0, m2 / VFS_PAGE_SIZE), mkpentry (false, fill(content1[m2 / VFS_PAGE_SIZE], zero, n0, n1)) ])