[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 379 from proof refine-rename-file-dentry (previous step)

# links(entries2[str], cache_dirs) = m19 + 1, cache_files[entries4[str0]] = mkfile(m4, md5, # links(entries4[str0], cache_dirs), content2), cache_dirs[m3] = mkdir(m10, md6, # links(m3, cache_dirs), m20, entries2), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries4[str0]] = mkfile(m8, md4, # links(entries4[str0], cache_dirs), content0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries2[str]] = mkfile(m12, md3, m19 + 1, content), cache_dirs[m15] = mkdir(m6 + 1, md2, # links(m15, cache_dirs), m22, entries4), cache_files[entries2[str]] = mkfile(m2, md7, m19 + 1, content1), cache_files[ino] = mkfile(m7, md0, # links(ino, cache_dirs), content3), cache_icache[ino] = mkientry(boolvar, mkinode(m, md, false, m0, m1, m5)), afs-cons (cache_dirs[m15, mkdir(m6, md9, # links(m15, cache_dirs), m22, entries4 -- str0)] [m3, mkdir(m10, md10, # links(m3, cache_dirs), m20, entries2[str, entries4[str0]]) ], cache_files[entries2[str], mkfile(m18, md11, m19, content1)]), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons ((cache_dcache -- dentrykey(m15, str0))[dentrykey(m3, str), mkdentry(str, entries4[str0])], cache_dirs[m15, mkdir(m6, md9, # links(m15, cache_dirs), m22, entries4 -- str0)] [m3, mkdir(m10, md10, # links(m3, cache_dirs), m20, entries2[str, entries4[str0]]) ], cache_files[entries2[str], mkfile(m18, md11, m19, content1)]), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons (cache_icache[m15, mkientry(false, mkinode(m15, md9, true, # links(m15, cache_dirs), m22, m6))] [m3, mkientry(false, mkinode(m3, md10, true, # links(m3, cache_dirs), m20, m10)) ] [entries2[str], mkientry(false, mkinode(entries2[str], md11, false, m19, 0, m18)) ], cache_dirs[m15, mkdir(m6, md9, # links(m15, cache_dirs), m22, entries4 -- str0)] [m3, mkdir(m10, md10, # links(m3, cache_dirs), m20, entries2[str, entries4[str0]]) ], cache_files[entries2[str], mkfile(m18, md11, m19, content1)]), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m15, mkdir(m6, md9, # links(m15, cache_dirs), m22, entries4 -- str0)] [m3, mkdir(m10, md10, # links(m3, cache_dirs), m20, entries2[str, entries4[str0]]) ], cache_files[entries2[str], mkfile(m18, md11, m19, content1)]), pcache-cons(cache_pcache, cache_dirs, cache_files), synced (cache_dirs[m15, mkdir(m6, md9, # links(m15, cache_dirs), m22, entries4 -- str0)] [m3, mkdir(m10, md10, # links(m3, cache_dirs), m20, entries2[str, entries4[str0]]) ], cache_icache[m15, mkientry(false, mkinode(m15, md9, true, # links(m15, cache_dirs), m22, m6))] [m3, mkientry(false, mkinode(m3, md10, true, # links(m3, cache_dirs), m20, m10)) ] [entries2[str], mkientry(false, mkinode(entries2[str], md11, false, m19, 0, m18)) ], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), str0 ∈ entries4, m3 ∈ cache_dirs, entries4[str0] ∈ cache_files, entries2[str] ∈ cache_files, m15 ∈ cache_dirs, str ∈ entries2, ino ∈ cache_files, ino ∈ cache_icache, cache_sync → synced (cache_files[entries2[str], mkfile(m18, md11, m19, content1)], cache_icache[m15, mkientry(false, mkinode(m15, md9, true, # links(m15, cache_dirs), m22, m6))] [m3, mkientry(false, mkinode(m3, md10, true, # links(m3, cache_dirs), m20, m10)) ] [entries2[str], mkientry(false, mkinode(entries2[str], md11, false, m19, 0, m18)) ], cache_pcache), cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO, links(m15, cache_dirs) ≠ ∅ ∨ m15 = ROOT_INO ⊦ ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[ino] = mkfile(m5, md, m0, content3 ⊕ mkcontent(ino, cache_pcache)), ino = m15, ino = m3, ino = entries2[str], m15 = m3, entries2[str] ∈ cache_dirs, entries4[str0] ∈ cache_dirs

Heuristic use patterns applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: cache-base name: at-icache-overwrite seq: ⊦ ino ∈ icache ∧ ¬ icache[ino].inode.directory → (files ⊕ icache)[ino] = mkfile (icache[ino].inode.size, icache[ino].inode.meta, icache[ino].inode.nlink, files[ino].content) subst: [ino, icache, files] → [ino, cache_icache, cache_files ⊕ cache_pcache] flags: <all paths>

Additional information

Used simplifier rules: ⊦ (files ⊕ pcache)[ino] = mkfile (files[ino].size, files[ino].meta, files[ino].nlink, files[ino].content ⊕ mkcontent(ino, pcache)); (s)% ⊦ mkfile(m, md, m0, content).content = content; (s)% ⊦ mkientry(boolvar, inode).inode = inode; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)%⊦ ino ∈ icache ∧ icache[ino].inode.directory → (files ⊕ icache)[ino] = files[ino]; (s)% ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s) Used terms: ino, cache_icache, cache_files ⊕ cache_pcache