unknown

Initial ITS

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

Chained Linear Paths

Start location: [1]
Program variables: x y
   6: [1] -> [3] : x'=nondet, y'=nondet1, T, cost: 1
   5: [3] -> [6] : (-y+x <= 0 \/ x <= 0), cost: 1
   8: [3] -> [3] : y'=y+x, (-y+x > 0 /\ 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 [4] by chaining:

	Applied chaining

	First rule:
	[3] -> [4] : (-y+x > 0 /\ x > 0), cost: 1
	Second rule:
	[4] -> [5] : y'=y+x, T, cost: 1
	New rule:
	[3] -> [5] : y'=y+x, (-y+x > 0 /\ x > 0), cost: 1
	
	Applied deletion

	Removed the following rules: 2 3
	
	Eliminating location [5] by chaining:

	Applied chaining

	First rule:
	[3] -> [5] : y'=y+x, (-y+x > 0 /\ x > 0), cost: 1
	Second rule:
	[5] -> [3] : T, cost: 1
	New rule:
	[3] -> [3] : y'=y+x, (-y+x > 0 /\ x > 0), cost: 1
	
	Applied deletion

	Removed the following rules: 4 7

Step with 6

	Trace

	6[T]
	
	Blocked

	[{}, {}]

Step with 5

	Trace

	6[T], 5[(-y+x <= 0)]
	
	Blocked

	[{}, {}, {}]

Backtrack

	Trace

	6[T]
	
	Blocked

	[{}, {5[-y+x <= 0]}]

Step with 5

	Trace

	6[T], 5[(x <= 0)]
	
	Blocked

	[{}, {5[-y+x <= 0]}, {}]

Backtrack

	Trace

	6[T]
	
	Blocked

	[{}, {5[(-y+x <= 0 /\ x <= 0)]}]

Step with 8

	Trace

	6[T], 8[(-y+x > 0 /\ x > 0)]
	
	Blocked

	[{}, {5[T]}, {}]

Accelerate

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

	Loop Acceleration

	Original rule:
	[3] -> [3] : y'=y+x, (-y+x > 0 /\ x > 0), cost: 1
	New rule:
	[3] -> [3] : y'=n*x+y, (-1+n >= 0 /\ -(-1+n)*x-y+x > 0 /\ x > 0), cost: 1

		-y+x > 0 [0]: montonic decrease yields -(-1+n)*x-y+x > 0, dependencies: x > 0
		
		-y+x > 0 [1]: eventual decrease yields (-y+x > 0 /\ -(-1+n)*x-y+x > 0), dependencies: x > 0
		
		-y+x > 0 [2]: eventual increase yields (-y+x > 0 /\ x <= 0), dependencies: x > 0
		
		x > 0 [0]: monotonic increase yields x > 0
		
		Replacement map: {-y+x > 0 -> -(-1+n)*x-y+x > 0, x > 0 -> x > 0}

	Trace

	6[T], 9[(-1+n >= 0 /\ -(-1+n)*x-y+x > 0 /\ x > 0)]
	
	Blocked

	[{}, {5[T]}, {8[T], 9[T]}]

Step with 5

	Trace

	6[T], 9[(-1+n >= 0 /\ -(-1+n)*x-y+x > 0 /\ x > 0)], 5[(-y+x <= 0)]
	
	Blocked

	[{}, {5[T]}, {8[T], 9[T]}, {}]

Backtrack

	Trace

	6[T], 9[(-1+n >= 0 /\ -(-1+n)*x-y+x > 0 /\ x > 0)]
	
	Blocked

	[{}, {5[T]}, {5[-y+x <= 0], 8[T], 9[T]}]

Backtrack

	Trace

	6[T]
	
	Blocked

	[{}, {5[T], 9[T]}]

Step with 8

	Trace

	6[T], 8[(-y+x > 0 /\ x > 0)]
	
	Blocked

	[{}, {5[T], 9[T]}, {}]

Covered

	Trace

	6[T]
	
	Blocked

	[{}, {5[T], 8[T], 9[T]}]

Backtrack

	Trace

	Blocked

	[{6[T]}]

Accept

unknown

Build SHA: a05f16bf13df659c382799650051f91bf6828c7b