Start: eval_foo_start
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_bb3_in, eval_foo_start, eval_foo_stop
Transitions:
t₁: eval_foo_bb0_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(0, X₁, X₂, X₃)
t₂: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb2_in(X₀, X₁, X₂, X₃) :|: X₀ ≤ 9
t₃: eval_foo_bb1_in(X₀, X₁, X₂, X₃) → eval_foo_bb3_in(X₀, X₁, X₂, X₃) :|: 10 ≤ X₀
t₄: eval_foo_bb2_in(X₀, X₁, X₂, X₃) → eval_foo_bb1_in(X₀, X₁, X₂, X₃)
t₅: eval_foo_bb3_in(X₀, X₁, X₂, X₃) → eval_foo_stop(X₀, X₁, X₂, X₃)
t₀: eval_foo_start(X₀, X₁, X₂, X₃) → eval_foo_bb0_in(X₀, X₁, X₂, X₃)
Eliminate variables [X₁; X₂; X₃] that do not contribute to the problem
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location eval_foo_bb2_in
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location eval_foo_bb1_in
Found invariant 1 ≤ 0 for location eval_foo_stop
Found invariant 1 ≤ 0 for location eval_foo_bb3_in
Cut unsatisfiable transition [t₁₃: eval_foo_bb1_in→eval_foo_bb3_in; t₁₅: eval_foo_bb3_in→eval_foo_stop]
Cut unreachable locations [eval_foo_bb3_in; eval_foo_stop] from the program graph
Start: eval_foo_start
Program_Vars: X₀
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_start
Transitions:
t₁₁: eval_foo_bb0_in(X₀) → eval_foo_bb1_in(0)
t₁₂: eval_foo_bb1_in(X₀) → eval_foo_bb2_in(X₀) :|: X₀ ≤ 9 ∧ 0 ≤ X₀ ∧ X₀ ≤ 0
t₁₄: eval_foo_bb2_in(X₀) → eval_foo_bb1_in(X₀) :|: 0 ≤ X₀ ∧ X₀ ≤ 0
t₁₆: eval_foo_start(X₀) → eval_foo_bb0_in(X₀)
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location eval_foo_bb1_in_v1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location eval_foo_bb1_in
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location eval_foo_bb2_in_v1
Overall timebound:inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₄: inf {Infinity}
t₁₆: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₄: inf {Infinity}
t₁₆: 1 {O(1)}
t₁₁, X₀: 0 {O(1)}
t₁₂, X₀: 0 {O(1)}
t₁₄, X₀: 0 {O(1)}
t₁₆, X₀: X₀ {O(n)}