Start: eval_foo_start
Program_Vars: 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₁) → eval_foo_bb1_in(X₁, X₁)
t₂: eval_foo_bb1_in(X₀, X₁) → eval_foo_bb2_in(X₀, X₁) :|: 1 ≤ X₀
t₃: eval_foo_bb1_in(X₀, X₁) → eval_foo_bb3_in(X₀, X₁) :|: X₀ ≤ 0
t₄: eval_foo_bb2_in(X₀, X₁) → eval_foo_bb1_in(10-2⋅X₀, X₁)
t₅: eval_foo_bb3_in(X₀, X₁) → eval_foo_stop(X₀, X₁)
t₀: eval_foo_start(X₀, X₁) → eval_foo_bb0_in(X₀, X₁)
Found invariant 1 ≤ X₀ for location eval_foo_bb2_in
Found invariant X₀ ≤ 0 for location eval_foo_stop
Found invariant X₀ ≤ 0 for location eval_foo_bb3_in
Start: eval_foo_start
Program_Vars: 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₁) → eval_foo_bb1_in(X₁, X₁)
t₂: eval_foo_bb1_in(X₀, X₁) → eval_foo_bb2_in(X₀, X₁) :|: 1 ≤ X₀
t₃: eval_foo_bb1_in(X₀, X₁) → eval_foo_bb3_in(X₀, X₁) :|: X₀ ≤ 0
t₄: eval_foo_bb2_in(X₀, X₁) → eval_foo_bb1_in(10-2⋅X₀, X₁) :|: 1 ≤ X₀
t₅: eval_foo_bb3_in(X₀, X₁) → eval_foo_stop(X₀, X₁) :|: X₀ ≤ 0
t₀: eval_foo_start(X₀, X₁) → eval_foo_bb0_in(X₀, X₁)
cycle: [t₂: eval_foo_bb1_in→eval_foo_bb2_in; t₄: eval_foo_bb2_in→eval_foo_bb1_in]
Termination: true
Formula:
Overall timebound:190 {O(1)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 93 {O(1)}
t₃: 1 {O(1)}
t₄: 93 {O(1)}
t₅: 1 {O(1)}
Overall costbound: 190 {O(1)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 93 {O(1)}
t₃: 1 {O(1)}
t₄: 93 {O(1)}
t₅: 1 {O(1)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₁, X₀: X₁ {O(n)}
t₁, X₁: X₁ {O(n)}
t₂, X₀: 9903520314283042199192993792⋅X₁+2763082167684968773574845267968 {O(n)}
t₂, X₁: X₁ {O(n)}
t₃, X₀: 9903520314283042199192993793⋅X₁+2763082167684968773574845267968 {O(n)}
t₃, X₁: 2⋅X₁ {O(n)}
t₄, X₀: 9903520314283042199192993792⋅X₁+2763082167684968773574845267968 {O(n)}
t₄, X₁: X₁ {O(n)}
t₅, X₀: 9903520314283042199192993793⋅X₁+2763082167684968773574845267968 {O(n)}
t₅, X₁: 2⋅X₁ {O(n)}