[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 389 from proof refine-rename-dir-negdentry (previous step)

cache_dirs[entries1[str]] = mkdir(m4, md2, # links(entries1[str], cache_dirs), m7, entries), cache_dirs[m] = mkdir(m0, md3, # links(m, cache_dirs), m2, entries0), cache_dirs[m3] = mkdir(m1, md4, # links(m3, cache_dirs), m5, entries1), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = err0, new_dent = negdentry(str0), new_parent_inode = mkinode(m, md, true, # links(m, cache_dirs), m2, m0), old_dent = mkdentry(str, entries1[str]), old_parent_inode = mkinode(m3, md0, true, # links(m3, cache_dirs), m5, m1), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), 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), str ∈ entries1, entries1[str] ∈ cache_dirs, m3 ∈ cache_dirs, m ∈ cache_dirs, ⌊err0⌋ , cache_sync → synced(cache_files, cache_icache, cache_pcache), m = m3 → md = md0, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO, links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ [if err = ESUCCESS then let asynced = false in {icache_set#(old_parent_inode, asynced; err, cache_icache); icache_set#(new_parent_inode, asynced; err, cache_icache); skip; dcache_delete#(old_parent_inode.ino, old_dent.name; err, cache_dcache); dcache_set#(new_parent_inode.ino, new_dent.name, new_dent; err, cache_dcache)}] ( icache-cons(cache_icache, cache_dirs, cache_files) ∧ dcache-cons(cache_dcache, cache_dirs, cache_files) ∧ synced(cache_dirs, cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files, cache_icache, cache_pcache)) → ⟨old_dent0 := mkdentry(str, entries1[str]); new_dent0 := negdentry(str0); new_parent_inode0 := mkinode(m, md, true, # links(m, cache_dirs), m2, m0); old_parent_inode0 := mkinode(m3, md0, true, # links(m3, cache_dirs), m5, m1); old_child_inode0 := mkinode(entries1[str], md1, true, # links(entries1[str], cache_dirs), m7, m4); new_child_inode1 := new_child_inode0; cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err1, cache_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ mkinode (entries1[str], md1, true, # links(entries1[str], cache_dirs0), cache_dirs1[entries1[str]].nsubdirs, cache_dirs2[entries1[str]].size) = old_child_inode0 ∧ new_child_inode1 = new_child_inode0 ∧ old_dent = old_dent0 ∧ new_dent = new_dent0 ∧ err = err1 ∧ cache_dirs = cache_dirs0 ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced))), str0 ∈ entries0

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 390:
cache_dirs[m3] = mkdir(m1, md4, # links(m3, cache_dirs), m5, entries1), cache_dirs[m] = mkdir(m0, md3, # links(m, cache_dirs), m2, entries0), cache_dirs[entries1[str]] = mkdir(m4, md2, # links(entries1[str], cache_dirs), m7, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = err0, new_dent = negdentry(str0), new_parent_inode = mkinode(m, md, true, # links(m, cache_dirs), m2, m0), old_dent = mkdentry(str, entries1[str]), old_parent_inode = mkinode(m3, md0, true, # links(m3, cache_dirs), m5, 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), m ∈ cache_dirs, m3 ∈ cache_dirs, entries1[str] ∈ cache_dirs, str ∈ entries1, ⌊err0⌋ , m = m3 → md = md0, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO, links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ [skip] ( icache-cons(cache_icache, cache_dirs, cache_files) ∧ dcache-cons(cache_dcache, cache_dirs, cache_files) ∧ synced(cache_dirs, cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files, cache_icache, cache_pcache)) → ⟨old_dent0 := mkdentry(str, entries1[str]); new_dent0 := negdentry(str0); new_parent_inode0 := mkinode(m, md, true, # links(m, cache_dirs), m2, m0); old_parent_inode0 := mkinode(m3, md0, true, # links(m3, cache_dirs), m5, m1); old_child_inode0 := mkinode(entries1[str], md1, true, # links(entries1[str], cache_dirs), m7, m4); new_child_inode1 := new_child_inode0; cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; afs_rename# (; old_parent_inode0, new_parent_inode0, old_child_inode0, new_child_inode0, old_dent0, new_dent0, err1, cache_dirs, afs_files; afs_asynced)⟩ ( old_parent_inode = old_parent_inode0 ∧ new_parent_inode = new_parent_inode0 ∧ mkinode (entries1[str], md1, true, # links(entries1[str], cache_dirs0), cache_dirs1[entries1[str]].nsubdirs, cache_dirs2[entries1[str]].size) = old_child_inode0 ∧ new_child_inode1 = new_child_inode0 ∧ old_dent = old_dent0 ∧ new_dent = new_dent0 ∧ err = err1 ∧ cache_dirs = cache_dirs0 ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced))), str0 ∈ entries0

Rule argument

pos: right 1

Additional information

Used simplifier rules: ⊦ ⌊err⌋ → err ≠ ESUCCESS; (s)