Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₁: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₀: l1(X₀, X₁, X₂) → l1(X₀, X₁+X₂, X₂) :|: X₁ ≤ X₀ ∧ 1 ≤ X₂
Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1
Transitions:
t₁: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₀: l1(X₀, X₁, X₂) → l1(X₀, X₁+X₂, X₂) :|: X₁ ≤ X₀ ∧ 1 ≤ X₂
Termination: true
Formula:
relevant size-bounds w.r.t. t₁:
X₀: X₀ {O(n)}
X₁: X₁ {O(n)}
Runtime-bound of t₁: 1 {O(1)}
Results in: 2⋅X₀+2⋅X₁+5 {O(n)}
Overall timebound:2⋅X₀+2⋅X₁+6 {O(n)}
t₁: 1 {O(1)}
t₀: 2⋅X₀+2⋅X₁+5 {O(n)}
Overall costbound: 2⋅X₀+2⋅X₁+6 {O(n)}
t₁: 1 {O(1)}
t₀: 2⋅X₀+2⋅X₁+5 {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: X₁ {O(n)}
t₁, X₂: X₂ {O(n)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: 4⋅X₀⋅X₂+4⋅X₁⋅X₂+12⋅X₂+X₁ {O(n^2)}
t₀, X₂: X₂ {O(n)}