Start: eval_foo_start
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_start, eval_foo_stop
Transitions:
t₁: eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄) → eval_foo_bb1_in(1, 0, X₂, X₃, X₄) :|: 11 ≤ X₂
t₂: eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄) → eval_foo_bb1_in(1, 1, X₂, X₃, X₄) :|: X₂ ≤ 10 ∧ 11 ≤ X₂
t₃: eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄) → eval_foo_bb1_in(0, 0, X₂, X₃, X₄) :|: X₂ ≤ 10 ∧ 11 ≤ X₂
t₄: eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄) → eval_foo_bb1_in(0, 1, X₂, X₃, X₄) :|: X₂ ≤ 10
t₅: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₆: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄) :|: 1+X₀ ≤ X₁
t₇: eval_foo_bb1_in(X₀, X₁, X₂, X₃, X₄) → eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄) :|: 1+X₁ ≤ X₀
t₈: eval_foo_bb2_in(X₀, X₁, X₂, X₃, X₄) → eval_foo_stop(X₀, X₁, X₂, X₃, X₄)
t₀: eval_foo_start(X₀, X₁, X₂, X₃, X₄) → eval_foo_bb0_in(X₀, X₁, X₂, X₃, X₄)
Cut unsatisfiable transition [t₂: eval_foo_bb0_in→eval_foo_bb1_in; t₃: eval_foo_bb0_in→eval_foo_bb1_in; t₅: eval_foo_bb1_in→eval_foo_bb1_in]
Eliminate variables [X₃; X₄] that do not contribute to the problem
Found invariant X₁ ≤ 1 ∧ X₁ ≤ 1+X₀ ∧ X₀+X₁ ≤ 1 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 1 ∧ 0 ≤ X₀ for location eval_foo_bb2_in
Found invariant X₁ ≤ 1 ∧ X₁ ≤ 1+X₀ ∧ X₀+X₁ ≤ 1 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 1 ∧ 0 ≤ X₀ for location eval_foo_bb1_in
Found invariant X₁ ≤ 1 ∧ X₁ ≤ 1+X₀ ∧ X₀+X₁ ≤ 1 ∧ 0 ≤ X₁ ∧ 1 ≤ X₀+X₁ ∧ X₀ ≤ 1+X₁ ∧ X₀ ≤ 1 ∧ 0 ≤ X₀ for location eval_foo_stop
Start: eval_foo_start
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: eval_foo_bb0_in, eval_foo_bb1_in, eval_foo_bb2_in, eval_foo_start, eval_foo_stop
Transitions:
t₂₆: eval_foo_bb0_in(X₀, X₁, X₂) → eval_foo_bb1_in(1, 0, X₂) :|: 11 ≤ X₂
t₂₇: eval_foo_bb0_in(X₀, X₁, X₂) → eval_foo_bb1_in(0, 1, X₂) :|: X₂ ≤ 10
t₂₈: eval_foo_bb1_in(X₀, X₁, X₂) → eval_foo_bb2_in(X₀, X₁, X₂) :|: 1+X₀ ≤ X₁ ∧ X₁ ≤ 1+X₀ ∧ X₀ ≤ 1 ∧ X₀ ≤ 1+X₁ ∧ X₀+X₁ ≤ 1 ∧ X₁ ≤ 1 ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₁
t₂₉: eval_foo_bb1_in(X₀, X₁, X₂) → eval_foo_bb2_in(X₀, X₁, X₂) :|: 1+X₁ ≤ X₀ ∧ X₁ ≤ 1+X₀ ∧ X₀ ≤ 1 ∧ X₀ ≤ 1+X₁ ∧ X₀+X₁ ≤ 1 ∧ X₁ ≤ 1 ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₁
t₃₀: eval_foo_bb2_in(X₀, X₁, X₂) → eval_foo_stop(X₀, X₁, X₂) :|: X₁ ≤ 1+X₀ ∧ X₀ ≤ 1 ∧ X₀ ≤ 1+X₁ ∧ X₀+X₁ ≤ 1 ∧ X₁ ≤ 1 ∧ 1 ≤ X₀+X₁ ∧ 0 ≤ X₀ ∧ 0 ≤ X₁
t₃₁: eval_foo_start(X₀, X₁, X₂) → eval_foo_bb0_in(X₀, X₁, X₂)
Overall timebound:6 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: 1 {O(1)}
t₂₉: 1 {O(1)}
t₃₀: 1 {O(1)}
t₃₁: 1 {O(1)}
Overall costbound: 6 {O(1)}
t₂₆: 1 {O(1)}
t₂₇: 1 {O(1)}
t₂₈: 1 {O(1)}
t₂₉: 1 {O(1)}
t₃₀: 1 {O(1)}
t₃₁: 1 {O(1)}
t₂₆, X₀: 1 {O(1)}
t₂₆, X₁: 0 {O(1)}
t₂₆, X₂: X₂ {O(n)}
t₂₇, X₀: 0 {O(1)}
t₂₇, X₁: 1 {O(1)}
t₂₇, X₂: X₂ {O(n)}
t₂₈, X₀: 0 {O(1)}
t₂₈, X₁: 1 {O(1)}
t₂₈, X₂: X₂ {O(n)}
t₂₉, X₀: 1 {O(1)}
t₂₉, X₁: 0 {O(1)}
t₂₉, X₂: X₂ {O(n)}
t₃₀, X₀: 1 {O(1)}
t₃₀, X₁: 1 {O(1)}
t₃₀, X₂: 2⋅X₂ {O(n)}
t₃₁, X₀: X₀ {O(n)}
t₃₁, X₁: X₁ {O(n)}
t₃₁, X₂: X₂ {O(n)}