[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 32 from proof initialization (previous step)

adr = adr1, fi = ∅, fi0 = ∅, fo = ∅, fs = (∅)[adr1, inodenode(inodekey(ROOT_INO), md, true, 0, 0, 0)], key = inodekey(ROOT_INO), log = adr1 ', ri = fi0, ro = ∅ ⊦ ⟪if ¬ adr ∈ ri ∧ adr ∈ fs ∧ key-cons(key, fs[adr]) then ri[key] := adr else abort; ro := ∅; fs := (∅)[adr1, inodenode(inodekey(ROOT_INO), md, true, 0, 0, 0)]; err := ESUCCESS; fi0 := ri; if err = ESUCCESS then aubifs_core_journal_sync#(fi0, ∅, ro, ∅, fs, adr1 '; ; boolvar, err)⟫ ( ( err = ESUCCESS → ⟨afs_format#(n, boolvar0, LEB_SIZE, md; dirs0; files0, asynced, err1)⟩ ( dirs0 = abs-dirs(fs, fi0) ∧ files0 = abs-files(fs, fi0) ∧ orphans(abs-dirs(fs, fi0), abs-files(fs, fi0)) = abs-keys(ro) ∧ (asynced → boolvar) ∧ ESUCCESS = err1)) ∧ ( err ≠ ESUCCESS → (∀ dirs, files, boolvar. ⟨afs_format#(n, boolvar0, LEB_SIZE, md; dirs0; files0, asynced, err1)⟩ (dirs = dirs0 ∧ files = files0 ∧ (boolvar ↔ asynced) ∧ err = err1))))

Heuristic symbolic execution applied rule if positive right

And obtained the following new goals

Proof step 33:
adr = adr1, fi = ∅, fi0 = ∅, fo = ∅, fs = (∅)[adr1, inodenode(inodekey(ROOT_INO), md, true, 0, 0, 0)], key = inodekey(ROOT_INO), log = adr1 ', ri = fi0, ro = ∅ ⊦ ⟪ri[key] := adr; ro := ∅; fs := (∅)[adr1, inodenode(inodekey(ROOT_INO), md, true, 0, 0, 0)]; err := ESUCCESS; fi0 := ri; if err = ESUCCESS then aubifs_core_journal_sync#(fi0, ∅, ro, ∅, fs, adr1 '; ; boolvar, err)⟫ ( ( err = ESUCCESS → ⟨afs_format#(n, boolvar0, LEB_SIZE, md; dirs0; files0, asynced, err1)⟩ ( dirs0 = abs-dirs(fs, fi0) ∧ files0 = abs-files(fs, fi0) ∧ orphans(abs-dirs(fs, fi0), abs-files(fs, fi0)) = abs-keys(ro) ∧ (asynced → boolvar) ∧ ESUCCESS = err1)) ∧ ( err ≠ ESUCCESS → (∀ dirs, files, boolvar. ⟨afs_format#(n, boolvar0, LEB_SIZE, md; dirs0; files0, asynced, err1)⟩ (dirs = dirs0 ∧ files = files0 ∧ (boolvar ↔ asynced) ∧ err = err1))))

Rule argument

Additional information

Used simplifier rules: ⊦ ¬ adr ∈ ∅; (s)% ⊦ adr ∈ fs[adr1, nd] ↔ adr = adr1 ∨ adr ∈ fs; (s)% ⊦ fs[adr0, nd][adr1] = (adr0 = adr1 ⊃ nd;fs[adr1]); (s)%⊦ key-cons(inodekey(ino), nd) ↔ nd.inode? ∧ nd.key = inodekey(ino) ∧ ino ≠ 0; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).inode?; (s)% ⊦ inodenode(key, md, boolvar, m, m0, m1).key = key; (s)% ⊦ inodekey(m) = inodekey(m0) ↔ m = m0; (s)% ⊦ ROOT_INO ≠ 0; (s)