unknown

Initial ITS

Start location: [1]
Program variables: n x y z
   0: [1] -> [2] : x'=nondet, T, cost: 1
   1: [2] -> [3] : y'=nondet1, T, cost: 1
   2: [3] -> [4] : z'=nondet2, T, cost: 1
   3: [4] -> [5] : n'=nondet3, T, cost: 1
   4: [5] -> [6] : (-n+x <= 0 /\ y+x >= 0), cost: 1
  10: [5] -> [11] : (-n+x > 0 \/ y+x < 0), cost: 1
   5: [6] -> [7] : x'=y+2*x, T, cost: 1
   6: [7] -> [8] : y'=z, T, cost: 1
   7: [8] -> [9] : z'=z, T, cost: 1
   8: [9] -> [10] : z'=1+z, T, cost: 1
   9: [10] -> [5] : T, cost: 1

Chained Linear Paths

Start location: [1]
Program variables: n x y z
  13: [1] -> [5] : n'=nondet3, x'=nondet, y'=nondet1, z'=nondet2, T, cost: 1
  10: [5] -> [11] : (-n+x > 0 \/ y+x < 0), cost: 1
  18: [5] -> [5] : x'=y+2*x, y'=z, z'=1+z, (-n+x <= 0 /\ y+x >= 0), cost: 1

	Eliminating location [2] by chaining:

	Applied chaining

	First rule:
	[1] -> [2] : x'=nondet, T, cost: 1
	Second rule:
	[2] -> [3] : y'=nondet1, T, cost: 1
	New rule:
	[1] -> [3] : x'=nondet, y'=nondet1, T, cost: 1
	
	Applied deletion

	Removed the following rules: 0 1
	
	Eliminating location [3] by chaining:

	Applied chaining

	First rule:
	[1] -> [3] : x'=nondet, y'=nondet1, T, cost: 1
	Second rule:
	[3] -> [4] : z'=nondet2, T, cost: 1
	New rule:
	[1] -> [4] : x'=nondet, y'=nondet1, z'=nondet2, T, cost: 1
	
	Applied deletion

	Removed the following rules: 2 11
	
	Eliminating location [4] by chaining:

	Applied chaining

	First rule:
	[1] -> [4] : x'=nondet, y'=nondet1, z'=nondet2, T, cost: 1
	Second rule:
	[4] -> [5] : n'=nondet3, T, cost: 1
	New rule:
	[1] -> [5] : n'=nondet3, x'=nondet, y'=nondet1, z'=nondet2, T, cost: 1
	
	Applied deletion

	Removed the following rules: 3 12
	
	Eliminating location [6] by chaining:

	Applied chaining

	First rule:
	[5] -> [6] : (-n+x <= 0 /\ y+x >= 0), cost: 1
	Second rule:
	[6] -> [7] : x'=y+2*x, T, cost: 1
	New rule:
	[5] -> [7] : x'=y+2*x, (-n+x <= 0 /\ y+x >= 0), cost: 1
	
	Applied deletion

	Removed the following rules: 4 5
	
	Eliminating location [7] by chaining:

	Applied chaining

	First rule:
	[5] -> [7] : x'=y+2*x, (-n+x <= 0 /\ y+x >= 0), cost: 1
	Second rule:
	[7] -> [8] : y'=z, T, cost: 1
	New rule:
	[5] -> [8] : x'=y+2*x, y'=z, (-n+x <= 0 /\ y+x >= 0), cost: 1
	
	Applied deletion

	Removed the following rules: 6 14
	
	Eliminating location [8] by chaining:

	Applied chaining

	First rule:
	[5] -> [8] : x'=y+2*x, y'=z, (-n+x <= 0 /\ y+x >= 0), cost: 1
	Second rule:
	[8] -> [9] : z'=z, T, cost: 1
	New rule:
	[5] -> [9] : x'=y+2*x, y'=z, z'=z, (-n+x <= 0 /\ y+x >= 0), cost: 1
	
	Applied deletion

	Removed the following rules: 7 15
	
	Eliminating location [9] by chaining:

	Applied chaining

	First rule:
	[5] -> [9] : x'=y+2*x, y'=z, z'=z, (-n+x <= 0 /\ y+x >= 0), cost: 1
	Second rule:
	[9] -> [10] : z'=1+z, T, cost: 1
	New rule:
	[5] -> [10] : x'=y+2*x, y'=z, z'=1+z, (-n+x <= 0 /\ y+x >= 0), cost: 1
	
	Applied deletion

	Removed the following rules: 8 16
	
	Eliminating location [10] by chaining:

	Applied chaining

	First rule:
	[5] -> [10] : x'=y+2*x, y'=z, z'=1+z, (-n+x <= 0 /\ y+x >= 0), cost: 1
	Second rule:
	[10] -> [5] : T, cost: 1
	New rule:
	[5] -> [5] : x'=y+2*x, y'=z, z'=1+z, (-n+x <= 0 /\ y+x >= 0), cost: 1
	
	Applied deletion

	Removed the following rules: 9 17

Step with 13

	Trace

	13[T]
	
	Blocked

	[{}, {}]

Step with 10

	Trace

	13[T], 10[(-n+x > 0)]
	
	Blocked

	[{}, {}, {}]

Backtrack

	Trace

	13[T]
	
	Blocked

	[{}, {10[-n+x > 0]}]

Step with 10

	Trace

	13[T], 10[(y+x < 0)]
	
	Blocked

	[{}, {10[-n+x > 0]}, {}]

Backtrack

	Trace

	13[T]
	
	Blocked

	[{}, {10[(-n+x > 0 /\ y+x < 0)]}]

Step with 18

	Trace

	13[T], 18[(-n+x <= 0 /\ y+x >= 0)]
	
	Blocked

	[{}, {10[T]}, {}]

Acceleration Failed

marked recursive suffix as redundant

Step with 18

	Trace

	13[T], 18[(-n+x <= 0 /\ y+x >= 0)], 18[(-n+x <= 0 /\ y+x >= 0)]
	
	Blocked

	[{}, {10[T]}, {}, {}]

Covered

	Trace

	13[T], 18[(-n+x <= 0 /\ y+x >= 0)]
	
	Blocked

	[{}, {10[T]}, {18[T]}]

Step with 10

	Trace

	13[T], 18[(-n+x <= 0 /\ y+x >= 0)], 10[(y+x < 0)]
	
	Blocked

	[{}, {10[T]}, {18[T]}, {}]

Backtrack

	Trace

	13[T], 18[(-n+x <= 0 /\ y+x >= 0)]
	
	Blocked

	[{}, {10[T]}, {10[y+x < 0], 18[T]}]

Step with 10

	Trace

	13[T], 18[(-n+x <= 0 /\ y+x >= 0)], 10[(-n+x > 0)]
	
	Blocked

	[{}, {10[T]}, {10[y+x < 0], 18[T]}, {}]

Backtrack

	Trace

	13[T], 18[(-n+x <= 0 /\ y+x >= 0)]
	
	Blocked

	[{}, {10[T]}, {10[(-n+x > 0 /\ y+x < 0)], 18[T]}]

Backtrack

	Trace

	13[T]
	
	Blocked

	[{}, {10[T], 18[T]}]

Backtrack

	Trace

	Blocked

	[{13[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b