Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1
Transitions:
t₂: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀-1, C) :|: 0 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 0 ≤ X₁
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1
Transitions:
t₂: l0(X₀, X₁) → l1(X₀, X₁)
t₀: l1(X₀, X₁) → l1(X₀-1, C) :|: 0 ≤ X₀
t₁: l1(X₀, X₁) → l1(X₀, X₁-1) :|: 0 ≤ X₁
Found invariant 0 ≤ 1+X₁ for location n_l1___2
Found invariant 0 ≤ 1+X₀ for location n_l1___3
Found invariant 0 ≤ 1+X₁ ∧ 0 ≤ 2+X₀+X₁ ∧ 0 ≤ 1+X₀ for location n_l1___1
Found invariant 0 ≤ 1+X₁ for location n_l1___2
Found invariant 0 ≤ 1+X₀ for location n_l1___3
Found invariant 0 ≤ 1+X₁ ∧ 0 ≤ 2+X₀+X₁ ∧ 0 ≤ 1+X₀ for location n_l1___1
Termination: true
Formula:
relevant size-bounds w.r.t. t₅₆:
X₁: X₁+1 {O(n)}
Runtime-bound of t₅₆: 1 {O(1)}
Results in: 4⋅X₁+12 {O(n)}
Overall timebound:inf {Infinity}
t₂: 1 {O(1)}
t₀: inf {Infinity}
t₁: inf {Infinity}
Overall costbound: inf {Infinity}
t₂: 1 {O(1)}
t₀: inf {Infinity}
t₁: inf {Infinity}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}
t₀, X₀: 2⋅X₀+1 {O(n)}
t₁, X₀: 2⋅X₀+1 {O(n)}