unknown

Initial ITS

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

Chained Linear Paths

Start location: [1]
Program variables: i x y
  12: [1] -> [4] : i'=nondet, x'=0, y'=0, T, cost: 1
  15: [4] -> [5] : x'=1, -10+i > 0, cost: 1
  16: [4] -> [5] : y'=1, -10+i <= 0, cost: 1
   9: [5] -> [5] : x-y == 0, cost: 1
  10: [5] -> [10] : (x-y < 0 \/ x-y > 0), cost: 1

	Eliminating location [2] by chaining:

	Applied chaining

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

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

	Applied chaining

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

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

	Applied chaining

	First rule:
	[4] -> [6] : -10+i > 0, cost: 1
	Second rule:
	[6] -> [7] : x'=1, T, cost: 1
	New rule:
	[4] -> [7] : x'=1, -10+i > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 3 4
	
	Eliminating location [8] by chaining:

	Applied chaining

	First rule:
	[4] -> [8] : -10+i <= 0, cost: 1
	Second rule:
	[8] -> [9] : y'=1, T, cost: 1
	New rule:
	[4] -> [9] : y'=1, -10+i <= 0, cost: 1
	
	Applied deletion

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

	Applied chaining

	First rule:
	[4] -> [7] : x'=1, -10+i > 0, cost: 1
	Second rule:
	[7] -> [5] : T, cost: 1
	New rule:
	[4] -> [5] : x'=1, -10+i > 0, cost: 1
	
	Applied deletion

	Removed the following rules: 5 13
	
	Eliminating location [9] by chaining:

	Applied chaining

	First rule:
	[4] -> [9] : y'=1, -10+i <= 0, cost: 1
	Second rule:
	[9] -> [5] : T, cost: 1
	New rule:
	[4] -> [5] : y'=1, -10+i <= 0, cost: 1
	
	Applied deletion

	Removed the following rules: 8 14

Step with 12

	Trace

	12[T]
	
	Blocked

	[{}, {}]

Step with 15

	Trace

	12[T], 15[(-10+i > 0)]
	
	Blocked

	[{}, {}, {}]

Step with 10

	Trace

	12[T], 15[(-10+i > 0)], 10[(x-y > 0)]
	
	Blocked

	[{}, {}, {}, {}]

Backtrack

	Trace

	12[T], 15[(-10+i > 0)]
	
	Blocked

	[{}, {}, {10[x-y > 0]}]

Backtrack

	Trace

	12[T]
	
	Blocked

	[{}, {15[T]}]

Step with 16

	Trace

	12[T], 16[(-10+i <= 0)]
	
	Blocked

	[{}, {15[T]}, {}]

Step with 10

	Trace

	12[T], 16[(-10+i <= 0)], 10[(x-y < 0)]
	
	Blocked

	[{}, {15[T]}, {}, {}]

Backtrack

	Trace

	12[T], 16[(-10+i <= 0)]
	
	Blocked

	[{}, {15[T]}, {10[x-y < 0]}]

Backtrack

	Trace

	12[T]
	
	Blocked

	[{}, {15[T], 16[T]}]

Backtrack

	Trace

	Blocked

	[{12[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b