Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < X₀
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ X₁
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₃, X₄, X₅, X₃, X₄, X₅)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₁-X₀, X₂, X₂+1, X₃, X₄, X₅)
t₅: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
Found invariant X₅ ≤ X₂ ∧ X₀ ≤ X₁ for location l5
Found invariant X₅ ≤ X₂ for location l1
Found invariant X₅ ≤ X₂ ∧ X₀ ≤ X₁ for location l4
Found invariant X₅ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < X₀ ∧ X₅ ≤ X₂
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ X₁ ∧ X₅ ≤ X₂
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₃, X₄, X₅, X₃, X₄, X₅)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₁-X₀, X₂, X₂+1, X₃, X₄, X₅) :|: X₅ ≤ X₂ ∧ 1+X₁ ≤ X₀
t₅: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₅ ≤ X₂ ∧ X₀ ≤ X₁
Found invariant X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ 1+X₄ ≤ X₃ ∧ X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ 1+X₁ ≤ X₃ ∧ X₀ ≤ X₃ ∧ 1+X₁ ≤ X₀ for location n_l3___3
Found invariant 1+X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 1+X₄ ≤ X₃ ∧ X₂ ≤ 1+X₁ ∧ 1+X₁ ≤ X₂ for location n_l1___2
Found invariant X₅ ≤ X₂ ∧ X₀ ≤ X₁ for location l5
Found invariant X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃ for location l1
Found invariant X₅ ≤ X₂ ∧ X₀ ≤ X₁ for location l4
Found invariant 2+X₅ ≤ 0 ∧ 1+X₅ ≤ X₂ ∧ 3+X₂+X₅ ≤ 0 ∧ X₅ ≤ X₁ ∧ 4+X₁+X₅ ≤ 0 ∧ 1+X₅ ≤ X₀ ∧ 3+X₀+X₅ ≤ 0 ∧ 1+X₄ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ X₂ ≤ 1+X₁ ∧ 3+X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ 1+X₁ ≤ X₂ ∧ 2+X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 3+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0 for location n_l3___1
new bound:
X₅+1 {O(n)}
MPRF:
n_l3___1 [-X₂-1 ]
n_l1___2 [-X₂ ]
new bound:
X₅+1 {O(n)}
MPRF:
n_l3___1 [-X₁-1 ]
n_l1___2 [-X₁-1 ]
new bound:
2⋅X₅+2 {O(n)}
cfr-program:
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l4, l5, n_l1___2, n_l3___1, n_l3___3
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ X₁ ∧ X₅ ≤ X₂ ∧ X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃
t₃₉: l1(X₀, X₁, X₂, X₃, X₄, X₅) → n_l3___3(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₅ ≤ X₂ ∧ X₀ ≤ X₃ ∧ X₃ ≤ X₀ ∧ X₁ ≤ X₄ ∧ X₄ ≤ X₁ ∧ X₁ < X₀ ∧ X₅ ≤ X₂ ∧ X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ X₄ ≤ X₁ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ X₀ ≤ X₃
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₃, X₄, X₅, X₃, X₄, X₅)
t₅: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₅ ≤ X₂ ∧ X₀ ≤ X₁ ∧ X₅ ≤ X₂ ∧ X₀ ≤ X₁
t₄₅: n_l1___2(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ ≤ X₁ ∧ X₅ ≤ X₂ ∧ 1+X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 1+X₄ ≤ X₃ ∧ X₂ ≤ 1+X₁ ∧ 1+X₁ ≤ X₂
t₃₈: n_l1___2(X₀, X₁, X₂, X₃, X₄, X₅) → n_l3___1(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₅ ≤ X₂ ∧ 1+X₁ ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ X₅ ≤ X₁ ∧ 1+X₀ ≤ 0 ∧ X₁ < X₀ ∧ X₅ ≤ X₂ ∧ 1+X₅ ≤ X₂ ∧ X₅ ≤ X₁ ∧ 1+X₄ ≤ X₃ ∧ X₂ ≤ 1+X₁ ∧ 1+X₁ ≤ X₂
t₄₀: n_l3___1(X₀, X₁, X₂, X₃, X₄, X₅) → n_l1___2(X₁-X₀, X₂, X₂+1, X₃, X₄, X₅) :|: 1+X₀ ≤ 0 ∧ X₂ < 1+X₀ ∧ 1+X₅ ≤ X₂ ∧ X₁+1 ≤ X₂ ∧ X₂ ≤ 1+X₁ ∧ 1+X₁ ≤ X₀ ∧ X₅ ≤ X₂ ∧ 2+X₅ ≤ 0 ∧ 1+X₅ ≤ X₂ ∧ 3+X₂+X₅ ≤ 0 ∧ X₅ ≤ X₁ ∧ 4+X₁+X₅ ≤ 0 ∧ 1+X₅ ≤ X₀ ∧ 3+X₀+X₅ ≤ 0 ∧ 1+X₄ ≤ X₃ ∧ 1+X₂ ≤ 0 ∧ X₂ ≤ 1+X₁ ∧ 3+X₁+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ 1+X₁ ≤ X₂ ∧ 2+X₁ ≤ 0 ∧ 1+X₁ ≤ X₀ ∧ 3+X₀+X₁ ≤ 0 ∧ 1+X₀ ≤ 0
t₄₁: n_l3___3(X₀, X₁, X₂, X₃, X₄, X₅) → n_l1___2(X₁-X₀, X₂, X₂+1, X₃, X₄, X₅) :|: X₄ < X₀ ∧ X₁ ≤ X₄ ∧ X₄ ≤ X₁ ∧ X₂ ≤ X₅ ∧ X₅ ≤ X₂ ∧ X₀ ≤ X₃ ∧ X₃ ≤ X₀ ∧ 1+X₁ ≤ X₀ ∧ X₅ ≤ X₂ ∧ X₅ ≤ X₂ ∧ X₂ ≤ X₅ ∧ 1+X₄ ≤ X₃ ∧ X₄ ≤ X₁ ∧ 1+X₄ ≤ X₀ ∧ X₁ ≤ X₄ ∧ X₃ ≤ X₀ ∧ 1+X₁ ≤ X₃ ∧ X₀ ≤ X₃ ∧ 1+X₁ ≤ X₀
Overall timebound:2⋅X₅+9 {O(n)}
t₀: 1 {O(1)}
t₃: 1 {O(1)}
t₃₉: 1 {O(1)}
t₁: 1 {O(1)}
t₅: 1 {O(1)}
t₃₈: X₅+1 {O(n)}
t₄₅: 1 {O(1)}
t₄₀: X₅+1 {O(n)}
t₄₁: 1 {O(1)}
Overall costbound: 2⋅X₅+9 {O(n)}
t₀: 1 {O(1)}
t₃: 1 {O(1)}
t₃₉: 1 {O(1)}
t₁: 1 {O(1)}
t₅: 1 {O(1)}
t₃₈: X₅+1 {O(n)}
t₄₅: 1 {O(1)}
t₄₀: X₅+1 {O(n)}
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₃: 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₀: 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₃+X₄+X₅ {O(n)}
t₅, X₁: 2⋅X₅+X₄ {O(n)}
t₅, X₂: 3⋅X₅+2 {O(n)}
t₅, X₃: 3⋅X₃ {O(n)}
t₅, X₄: 3⋅X₄ {O(n)}
t₅, X₅: 3⋅X₅ {O(n)}
t₃₈, X₀: X₃+X₄+X₅ {O(n)}
t₃₈, X₁: X₅ {O(n)}
t₃₈, X₂: X₅+1 {O(n)}
t₃₈, X₃: X₃ {O(n)}
t₃₈, X₄: X₄ {O(n)}
t₃₈, X₅: X₅ {O(n)}
t₄₅, X₀: X₃+X₄+X₅ {O(n)}
t₄₅, X₁: 2⋅X₅ {O(n)}
t₄₅, X₂: 2⋅X₅+2 {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₅+1 {O(n)}
t₄₀, X₃: X₃ {O(n)}
t₄₀, X₄: X₄ {O(n)}
t₄₀, X₅: X₅ {O(n)}
t₄₁, X₀: X₃+X₄ {O(n)}
t₄₁, X₁: X₅ {O(n)}
t₄₁, X₂: X₅+1 {O(n)}
t₄₁, X₃: X₃ {O(n)}
t₄₁, X₄: X₄ {O(n)}
t₄₁, X₅: X₅ {O(n)}