Start: eval_twn10_start
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars:
Locations: eval_twn10_bb0_in, eval_twn10_bb1_in, eval_twn10_bb2_in, eval_twn10_bb3_in, eval_twn10_start, eval_twn10_stop
Transitions:
t₁: eval_twn10_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_twn10_bb1_in(X₄, X₅, X₆, X₃, X₄, X₅, X₆)
t₂: eval_twn10_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_twn10_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: 1 ≤ X₁+X₂
t₃: eval_twn10_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_twn10_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) :|: X₁+X₂ ≤ 0
t₄: eval_twn10_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_twn10_bb1_in(1+X₀, -2-2⋅X₁, 1+X₀, X₃, X₄, X₅, X₆)
t₅: eval_twn10_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_twn10_stop(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
t₀: eval_twn10_start(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → eval_twn10_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅, X₆)
Eliminate variables [X₃] that do not contribute to the problem
Found invariant X₃ ≤ X₀ ∧ X₁+X₂ ≤ 0 for location eval_twn10_bb3_in
Found invariant X₃ ≤ X₀ ∧ X₁+X₂ ≤ 0 for location eval_twn10_stop
Found invariant X₃ ≤ X₀ for location eval_twn10_bb1_in
Found invariant X₃ ≤ X₀ ∧ 1 ≤ X₁+X₂ for location eval_twn10_bb2_in
Start: eval_twn10_start
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: eval_twn10_bb0_in, eval_twn10_bb1_in, eval_twn10_bb2_in, eval_twn10_bb3_in, eval_twn10_start, eval_twn10_stop
Transitions:
t₁₁: eval_twn10_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn10_bb1_in(X₃, X₄, X₅, X₃, X₄, X₅)
t₁₂: eval_twn10_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn10_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: 1 ≤ X₁+X₂ ∧ X₃ ≤ X₀
t₁₃: eval_twn10_bb1_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn10_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁+X₂ ≤ 0 ∧ X₃ ≤ X₀
t₁₄: eval_twn10_bb2_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn10_bb1_in(1+X₀, -2-2⋅X₁, 1+X₀, X₃, X₄, X₅) :|: 1 ≤ X₁+X₂ ∧ X₃ ≤ X₀
t₁₅: eval_twn10_bb3_in(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn10_stop(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₃ ≤ X₀ ∧ X₁+X₂ ≤ 0
t₁₆: eval_twn10_start(X₀, X₁, X₂, X₃, X₄, X₅) → eval_twn10_bb0_in(X₀, X₁, X₂, X₃, X₄, X₅)
Found invariant X₃ ≤ X₀ ∧ X₁+X₂ ≤ 0 for location eval_twn10_bb3_in
Found invariant X₃ ≤ X₀ ∧ X₁+X₂ ≤ 0 for location eval_twn10_stop
Found invariant X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃ for location eval_twn10_bb1_in
Found invariant X₅ ≤ X₂ ∧ 1 ≤ X₄+X₅ ∧ X₂ ≤ X₅ ∧ 1 ≤ X₁+X₅ ∧ X₄ ≤ X₁ ∧ 1 ≤ X₂+X₄ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃ ∧ 1 ≤ X₁+X₂ for location eval_twn10_bb2_in_v1
Found invariant 1 ≤ X₄+X₅ ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₀ ∧ X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location eval_twn10_bb1_in_v1
Found invariant 1 ≤ X₄+X₅ ∧ 1+X₃ ≤ X₂ ∧ 1+X₃ ≤ X₀ ∧ X₂ ≤ X₀ ∧ 1 ≤ X₁+X₂ ∧ X₀ ≤ X₂ ∧ 1 ≤ X₀+X₁ for location eval_twn10_bb2_in_v2
Overall timebound:inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: 1 {O(1)}
t₁₄: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₆: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: 1 {O(1)}
t₁₄: inf {Infinity}
t₁₅: 1 {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₄: X₄ {O(n)}
t₁₁, X₅: X₅ {O(n)}
t₁₂, X₃: X₃ {O(n)}
t₁₂, X₄: X₄ {O(n)}
t₁₂, X₅: X₅ {O(n)}
t₁₃, X₃: 2⋅X₃ {O(n)}
t₁₃, X₄: 2⋅X₄ {O(n)}
t₁₃, X₅: 2⋅X₅ {O(n)}
t₁₄, X₃: X₃ {O(n)}
t₁₄, X₄: X₄ {O(n)}
t₁₄, X₅: X₅ {O(n)}
t₁₅, X₃: 2⋅X₃ {O(n)}
t₁₅, X₄: 2⋅X₄ {O(n)}
t₁₅, X₅: 2⋅X₅ {O(n)}
t₁₆, X₀: X₀ {O(n)}
t₁₆, X₁: X₁ {O(n)}
t₁₆, X₂: X₂ {O(n)}
t₁₆, X₃: X₃ {O(n)}
t₁₆, X₄: X₄ {O(n)}
t₁₆, X₅: X₅ {O(n)}