[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 68 from proof harness-2 (previous step)

x0 = 1 ' + 3 ' + 2 ' + 2 ', x1 = x0 ∧ d0 = 0, h0 = head(x1) ⊦ 〈if h0 = d0 then { x1 := pop(x1) ; to0 := some(Leaf) } else let to2 = fail, to1 = fail in { build_rec#(d0 + 1; x1, to2) ; if to2 = fail then to0 := fail else { build_rec#(d0 + 1; x1, to1) ; if to1 = fail then to0 := fail else to0 := some(Node(to2 .t, to1 .t)) } }〉〈to1 := to0 ; if ¬ is_empty(x1) then to1 := fail〉 to1 = fail

Heuristic symbolic execution applied rule if negative right

And obtained the following new goals

Proof step 67:
x0 = 1 ' + 3 ' + 2 ' + 2 ', x1 = x0 ∧ d0 = 0, h0 = head(x1) ⊦ 〈let to2 = fail, to1 = fail in { build_rec#(d0 + 1; x1, to2) ; if to2 = fail then to0 := fail else { build_rec#(d0 + 1; x1, to1) ; if to1 = fail then to0 := fail else to0 := some(Node(to2 .t, to1 .t)) } }〉〈to1 := to0 ; if ¬ is_empty(x1) then to1 := fail〉 to1 = fail

Rule argument

[fmapos-arg: pos: right 1]

Additional information

[[CONCRETESIMPRULES : ([CSIMPSEQ : ⊦ head(d ' + x) = d], [CSIMPSEQ : ⊦ (x + y) + z = x + y + z])]]