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

cache_dirs[m1] = mkdir(m0, md1, # links(m1, cache_dirs), m2, entries), (cache_dirs[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs), m2 + 1, entries[str, ino0])] ++ ino0)[m1] = mkdir(m, md0, m3, m4, entries0), dcache = cache_dcache, dent = mkdentry(str, ino0), dent0 = negdentry(str), err = ESUCCESS, key = dentrykey(p_ino, name), name = str, p_ino = m1, afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), m1 ∈ cache_dirs, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m1, cache_dirs) ≠ ∅ ∨ m1 = ROOT_INO ⊦ ⟨p_inode0 := mkinode(m1, md2, true, # links(m1, cache_dirs), m2, m0); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_files := (cache_files ⊕ cache_pcache) ⊕ cache_icache; cache_dirs0 := cache_dirs; afs_mkdir#(md; p_inode0, p_inode1, dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( cache_dirs = (cache_dirs2[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs2), m2 + 1, entries[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m1, (m1 = ino0 ∧ ino0 ∈ cache_dirs2[ino0, mkdir(m0 + 1, md1, # links(ino0, cache_dirs2), m2 + 1, entries[str, ino0])] ++ ino0 ⊃ mkdir(0, md, 1, 0, ∅) ;(cache_dirs2[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs2), m2 + 1, entries[str, ino0])] ++ ino0)[m1] ) .meta:= md2 ] ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache[m1, mkientry(false, mkinode(m1, md2, true, m3, m4, m))] [(ino0 ∈ cache_dirs0[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs0), m2 + 1, entries[str, ino0])] ++ ino0 ⊃ mkinode (ino0, (ino0 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md, 1, 0, ∅)).meta, true, (ino0 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md, 1, 0, ∅)).nlink, (ino0 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md, 1, 0, ∅)).nsubdirs, (ino0 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md, 1, 0, ∅)).size) ;mkinode(ino0, cache_files[ino0].meta, false, cache_files[ino0].nlink, 0, cache_files[ino0].size) ) .ino, mkientry (false, (ino0 ∈ cache_dirs0[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs0), m2 + 1, entries[str, ino0])] ++ ino0 ⊃ mkinode (ino0, (ino0 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md, 1, 0, ∅)).meta, true, (ino0 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md, 1, 0, ∅)).nlink, (ino0 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md, 1, 0, ∅)).nsubdirs, (ino0 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md, 1, 0, ∅)).size) ;mkinode(ino0, cache_files[ino0].meta, false, cache_files[ino0].nlink, 0, cache_files[ino0].size) )) ] ∧ (afs_asynced ↔ asynced0) ∧ (m1 ∈ cache_dirs2[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs2), m2 + 1, entries[str, ino0])] ++ ino0 ⊃ mkinode (m1, md2, true, (m1 = ino0 ⊃ mkdir(0, md, 1, 0, ∅) ;(cache_dirs2[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs2), m2 + 1, entries[str, ino0])] ++ ino0)[m1] ) .nlink, (m1 = ino0 ⊃ mkdir(0, md, 1, 0, ∅) ;(cache_dirs2[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs2), m2 + 1, entries[str, ino0])] ++ ino0)[m1] ) .nsubdirs, (m1 = ino0 ⊃ mkdir(0, md, 1, 0, ∅) ;(cache_dirs2[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs2), m2 + 1, entries[str, ino0])] ++ ino0)[m1] ) .size) ;mkinode(m1, cache_files[m1].meta, false, cache_files[m1].nlink, 0, cache_files[m1].size) ) = p_inode0 ∧ (ino0 ∈ cache_dirs3[m1, mkdir(m0 + 1, md1, # links(m1, cache_dirs3), m2 + 1, entries[str, ino0])] ++ ino0 ⊃ mkinode (ino0, (ino0 = m1 ⊃ mkdir(0, md2, 1, 0, ∅);mkdir(0, md, 1, 0, ∅)).meta, true, (ino0 = m1 ⊃ mkdir(0, md2, 1, 0, ∅);mkdir(0, md, 1, 0, ∅)).nlink, (ino0 = m1 ⊃ mkdir(0, md2, 1, 0, ∅);mkdir(0, md, 1, 0, ∅)).nsubdirs, (ino0 = m1 ⊃ mkdir(0, md2, 1, 0, ∅);mkdir(0, md, 1, 0, ∅)).size) ;mkinode(ino0, cache_files[ino0].meta, false, cache_files[ino0].nlink, 0, cache_files[ino0].size) ) = p_inode1 ∧ mkdentry(str, ino0) = dent0 ∧ err = err0), ino0 = 0, ino0 ∈ cache_dirs, ino0 ∈ cache_files, str ∈ entries

Heuristic symbolic execution applied rule assign right

And obtained the following new goals

Rule argument

Additional information