0.00/0.07	YES
0.00/0.07	
0.00/0.07	Solver Timeout: 4
0.00/0.07	Global Timeout: 300
0.00/0.07	No parsing errors!
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l9, true>
0.00/0.07	<l1, l2, (undef3 = undef3) /\ (undef4 = undef4), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef3, oldX3^0 -> undef4, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.07	<l1, l3, (undef7 = (0 + x0^0)) /\ (undef9 = undef9), par{oldX0^0 -> undef7, oldX1^0 -> (0 + x1^0), oldX2^0 -> undef9, x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}>
0.00/0.07	<l1, l3, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)), par{oldX0^0 -> undef13, oldX1^0 -> undef14, x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}>
0.00/0.07	<l4, l2, (undef21 = undef21) /\ (undef22 = undef22), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef21, oldX3^0 -> undef22, x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
0.00/0.07	<l4, l3, (undef25 = (0 + x0^0)), par{oldX0^0 -> undef25, oldX1^0 -> (0 + x1^0), x0^0 -> (~(1) + undef25), x1^0 -> 1}>
0.00/0.07	<l5, l1, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef32)), par{oldX0^0 -> undef31, oldX1^0 -> undef32, x0^0 -> (0 + undef31), x1^0 -> (0 + undef32)}>
0.00/0.07	<l5, l4, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0), par{oldX0^0 -> undef37, oldX1^0 -> undef38, x0^0 -> (0 + undef37), x1^0 -> (0 + undef38)}>
0.00/0.07	<l6, l2, (undef45 = undef45) /\ (undef46 = undef46), par{oldX0^0 -> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> undef45, oldX3^0 -> undef46, x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}>
0.00/0.07	<l7, l5, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)), par{oldX0^0 -> undef49, oldX1^0 -> undef50, x0^0 -> (0 + undef49), x1^0 -> (0 + undef50)}>
0.00/0.07	<l7, l6, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((0 + undef55) <= 0), par{oldX0^0 -> undef55, oldX1^0 -> undef56, x0^0 -> (0 + undef55), x1^0 -> (0 + undef56)}>
0.00/0.07	<l3, l7, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)), par{oldX0^0 -> undef61, oldX1^0 -> undef62, x0^0 -> (0 + undef61), x1^0 -> (0 + undef62)}>
0.00/0.07	<l8, l1, true>
0.00/0.07	<l8, l4, true>
0.00/0.07	<l8, l2, true>
0.00/0.07	<l8, l5, true>
0.00/0.07	<l8, l6, true>
0.00/0.07	<l8, l7, true>
0.00/0.07	<l8, l3, true>
0.00/0.07	<l9, l8, true>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	undef3, undef4, undef7, undef9, undef13, undef14, undef21, undef22, undef25, undef31, undef32, undef37, undef38, undef45, undef46, undef49, undef50, undef55, undef56, undef61, undef62, 
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	undef3, undef4, undef7, undef9, undef13, undef14, undef21, undef22, undef25, undef31, undef32, undef37, undef38, undef45, undef46, undef49, undef50, undef55, undef56, undef61, undef62, 
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	Preprocessed LLVMGraph
0.00/0.07	Init Location: 0
0.00/0.07	Transitions:
0.00/0.07	<l0, l2, (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.07	<l0, l3, (undef7 = (0 + x0^0)) /\ (undef9 = undef9), par{x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}>
0.00/0.07	<l0, l3, (undef13 = (0 + x0^0)) /\ (undef14 = (0 + x1^0)), par{x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}>
0.00/0.07	<l0, l2, (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
0.00/0.07	<l0, l3, (undef25 = (0 + x0^0)), par{x0^0 -> (~(1) + undef25), x1^0 -> 1}>
0.00/0.07	<l0, l2, true>
0.00/0.07	<l0, l2, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef32)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.07	<l0, l3, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef32)) /\ (undef7 = (0 + (0 + undef31))) /\ (undef9 = undef9), par{x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}>
0.00/0.07	<l0, l3, (undef31 = (0 + x0^0)) /\ (undef32 = (0 + x1^0)) /\ (1 <= (0 + undef32)) /\ (undef13 = (0 + (0 + undef31))) /\ (undef14 = (0 + (0 + undef32))), par{x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}>
0.00/0.07	<l0, l2, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
0.00/0.07	<l0, l3, (undef37 = (0 + x0^0)) /\ (undef38 = (0 + x1^0)) /\ ((0 + undef38) <= 0) /\ (undef25 = (0 + (0 + undef37))), par{x0^0 -> (~(1) + undef25), x1^0 -> 1}>
0.00/0.07	<l0, l2, (undef45 = undef45) /\ (undef46 = undef46), par{x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}>
0.00/0.07	<l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.07	<l0, l3, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef7 = (0 + (0 + undef31))) /\ (undef9 = undef9), par{x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}>
0.00/0.07	<l0, l3, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef13 = (0 + (0 + undef31))) /\ (undef14 = (0 + (0 + undef32))), par{x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}>
0.00/0.07	<l0, l2, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
0.00/0.07	<l0, l3, (undef49 = (0 + x0^0)) /\ (undef50 = (0 + x1^0)) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef25 = (0 + (0 + undef37))), par{x0^0 -> (~(1) + undef25), x1^0 -> 1}>
0.00/0.07	<l0, l2, (undef55 = (0 + x0^0)) /\ (undef56 = (0 + x1^0)) /\ ((0 + undef55) <= 0) /\ (undef45 = undef45) /\ (undef46 = undef46), par{x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}>
0.00/0.07	<l0, l3, true>
0.00/0.07	<l3, l2, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef3 = undef3) /\ (undef4 = undef4), par{x0^0 -> (0 + undef3), x1^0 -> (0 + undef4)}>
0.00/0.07	<l3, l3, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef7 = (0 + (0 + undef31))) /\ (undef9 = undef9), par{x0^0 -> (~(1) + undef7), x1^0 -> (0 + undef9)}>
0.00/0.07	<l3, l3, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef31 = (0 + (0 + undef49))) /\ (undef32 = (0 + (0 + undef50))) /\ (1 <= (0 + undef32)) /\ (undef13 = (0 + (0 + undef31))) /\ (undef14 = (0 + (0 + undef32))), par{x0^0 -> (0 + undef13), x1^0 -> (~(1) + undef14)}>
0.00/0.07	<l3, l2, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef21 = undef21) /\ (undef22 = undef22), par{x0^0 -> (0 + undef21), x1^0 -> (0 + undef22)}>
0.00/0.07	<l3, l3, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef49 = (0 + (0 + undef61))) /\ (undef50 = (0 + (0 + undef62))) /\ (1 <= (0 + undef49)) /\ (undef37 = (0 + (0 + undef49))) /\ (undef38 = (0 + (0 + undef50))) /\ ((0 + undef38) <= 0) /\ (undef25 = (0 + (0 + undef37))), par{x0^0 -> (~(1) + undef25), x1^0 -> 1}>
0.00/0.07	<l3, l2, (undef61 = (0 + x0^0)) /\ (undef62 = (0 + x1^0)) /\ (undef55 = (0 + (0 + undef61))) /\ (undef56 = (0 + (0 + undef62))) /\ ((0 + undef55) <= 0) /\ (undef45 = undef45) /\ (undef46 = undef46), par{x0^0 -> (0 + undef45), x1^0 -> (0 + undef46)}>
0.00/0.07	
0.00/0.07	Fresh variables:
0.00/0.07	undef3, undef4, undef7, undef9, undef13, undef14, undef21, undef22, undef25, undef31, undef32, undef37, undef38, undef45, undef46, undef49, undef50, undef55, undef56, undef61, undef62, 
0.00/0.07	
0.00/0.07	Undef variables:
0.00/0.07	undef3, undef4, undef7, undef9, undef13, undef14, undef21, undef22, undef25, undef31, undef32, undef37, undef38, undef45, undef46, undef49, undef50, undef55, undef56, undef61, undef62, 
0.00/0.07	
0.00/0.07	Abstraction variables:
0.00/0.07	
0.00/0.07	Exit nodes:
0.00/0.07	
0.00/0.07	Accepting locations:
0.00/0.07	
0.00/0.07	Asserts:
0.00/0.07	
0.00/0.07	*************************************************************
0.00/0.07	*******************************************************************************************
0.00/0.07	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Init Location: 0
0.00/0.07	Graph 0:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Graph 1:
0.00/0.07	Transitions:
0.00/0.07	<l3, l3, 1 <= undef32 /\ 1 <= undef49 /\ x0^0 = undef61 /\ x1^0 = undef62 /\ undef7 = undef31 /\ undef31 = undef49 /\ undef32 = undef50 /\ undef49 = undef61 /\ undef50 = undef62, {x0^0 -> -1 + undef7, x1^0 -> undef9, rest remain the same}>
0.00/0.07	<l3, l3, 1 <= undef32 /\ 1 <= undef49 /\ x0^0 = undef61 /\ x1^0 = undef62 /\ undef13 = undef31 /\ undef14 = undef32 /\ undef31 = undef49 /\ undef32 = undef50 /\ undef49 = undef61 /\ undef50 = undef62, {x0^0 -> undef13, x1^0 -> -1 + undef14, rest remain the same}>
0.00/0.07	<l3, l3, undef38 <= 0 /\ 1 <= undef49 /\ x0^0 = undef61 /\ x1^0 = undef62 /\ undef25 = undef37 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef61 /\ undef50 = undef62, {x0^0 -> -1 + undef25, x1^0 -> 1, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	x0^0, x1^0
0.00/0.07	
0.00/0.07	Graph 2:
0.00/0.07	Transitions:
0.00/0.07	Variables:
0.00/0.07	
0.00/0.07	Precedence: 
0.00/0.07	Graph 0
0.00/0.07	
0.00/0.07	Graph 1
0.00/0.07	<l0, l3, x0^0 = undef7, {x0^0 -> -1 + undef7, x1^0 -> undef9, rest remain the same}>
0.00/0.07	<l0, l3, x0^0 = undef13 /\ x1^0 = undef14, {x0^0 -> undef13, x1^0 -> -1 + undef14, rest remain the same}>
0.00/0.07	<l0, l3, x0^0 = undef25, {x0^0 -> -1 + undef25, x1^0 -> 1, rest remain the same}>
0.00/0.07	<l0, l3, 1 <= undef32 /\ x0^0 = undef31 /\ x1^0 = undef32 /\ undef7 = undef31, {x0^0 -> -1 + undef7, x1^0 -> undef9, rest remain the same}>
0.00/0.07	<l0, l3, 1 <= undef32 /\ x0^0 = undef31 /\ x1^0 = undef32 /\ undef13 = undef31 /\ undef14 = undef32, {x0^0 -> undef13, x1^0 -> -1 + undef14, rest remain the same}>
0.00/0.07	<l0, l3, undef38 <= 0 /\ x0^0 = undef37 /\ x1^0 = undef38 /\ undef25 = undef37, {x0^0 -> -1 + undef25, x1^0 -> 1, rest remain the same}>
0.00/0.07	<l0, l3, 1 <= undef32 /\ 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef7 = undef31 /\ undef31 = undef49 /\ undef32 = undef50, {x0^0 -> -1 + undef7, x1^0 -> undef9, rest remain the same}>
0.00/0.07	<l0, l3, 1 <= undef32 /\ 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef13 = undef31 /\ undef14 = undef32 /\ undef31 = undef49 /\ undef32 = undef50, {x0^0 -> undef13, x1^0 -> -1 + undef14, rest remain the same}>
0.00/0.07	<l0, l3, undef38 <= 0 /\ 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef25 = undef37 /\ undef37 = undef49 /\ undef38 = undef50, {x0^0 -> -1 + undef25, x1^0 -> 1, rest remain the same}>
0.00/0.07	<l0, l3, true, {all remain the same}>
0.00/0.07	
0.00/0.07	Graph 2
0.00/0.07	<l0, l2, true, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.07	<l0, l2, true, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
0.00/0.07	<l0, l2, true, {all remain the same}>
0.00/0.07	<l0, l2, 1 <= undef32 /\ x0^0 = undef31 /\ x1^0 = undef32, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.07	<l0, l2, undef38 <= 0 /\ x0^0 = undef37 /\ x1^0 = undef38, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
0.00/0.07	<l0, l2, true, {x0^0 -> undef45, x1^0 -> undef46, rest remain the same}>
0.00/0.07	<l0, l2, 1 <= undef32 /\ 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef31 = undef49 /\ undef32 = undef50, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.07	<l0, l2, undef38 <= 0 /\ 1 <= undef49 /\ x0^0 = undef49 /\ x1^0 = undef50 /\ undef37 = undef49 /\ undef38 = undef50, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
0.00/0.07	<l0, l2, undef55 <= 0 /\ x0^0 = undef55 /\ x1^0 = undef56, {x0^0 -> undef45, x1^0 -> undef46, rest remain the same}>
0.00/0.07	<l3, l2, 1 <= undef32 /\ 1 <= undef49 /\ x0^0 = undef61 /\ x1^0 = undef62 /\ undef31 = undef49 /\ undef32 = undef50 /\ undef49 = undef61 /\ undef50 = undef62, {x0^0 -> undef3, x1^0 -> undef4, rest remain the same}>
0.00/0.07	<l3, l2, undef38 <= 0 /\ 1 <= undef49 /\ x0^0 = undef61 /\ x1^0 = undef62 /\ undef37 = undef49 /\ undef38 = undef50 /\ undef49 = undef61 /\ undef50 = undef62, {x0^0 -> undef21, x1^0 -> undef22, rest remain the same}>
0.00/0.07	<l3, l2, undef55 <= 0 /\ x0^0 = undef61 /\ x1^0 = undef62 /\ undef55 = undef61 /\ undef56 = undef62, {x0^0 -> undef45, x1^0 -> undef46, rest remain the same}>
0.00/0.07	
0.00/0.07	Map Locations to Subgraph:
0.00/0.07	( 0 , 0 )
0.00/0.07	( 2 , 2 )
0.00/0.07	( 3 , 1 )
0.00/0.07	
0.00/0.07	*******************************************************************************************
0.00/0.07	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.07	*******************************************************************************************
0.00/0.07	
0.00/0.07	Proving termination of subgraph 0
0.00/0.07	Proving termination of subgraph 1
0.00/0.07	Checking unfeasibility...
0.00/0.07	Time used: 0.011867
0.00/0.07	
0.00/0.07	Checking conditional termination of SCC {l3}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.004130s
0.00/0.07	Ranking function: -1 + x0^0
0.00/0.07	New Graphs: 
0.00/0.07	Transitions:
0.00/0.07	<l3, l3, 1 <= undef32 /\ 1 <= undef49 /\ x0^0 = undef61 /\ x1^0 = undef62 /\ undef13 = undef31 /\ undef14 = undef32 /\ undef31 = undef49 /\ undef32 = undef50 /\ undef49 = undef61 /\ undef50 = undef62, {x0^0 -> undef13, x1^0 -> -1 + undef14, rest remain the same}>
0.00/0.07	Variables:
0.00/0.07	x0^0, x1^0
0.00/0.07	Checking conditional termination of SCC {l3}...
0.00/0.07	
0.00/0.07	LOG: CALL solveLinear
0.00/0.07	
0.00/0.07	LOG: RETURN solveLinear - Elapsed time: 0.001425s
0.00/0.07	Ranking function: -1 + x1^0
0.00/0.07	New Graphs: 
0.00/0.07	Proving termination of subgraph 2
0.00/0.07	Analyzing SCC {l2}...
0.00/0.07	No cycles found.
0.00/0.07	
0.00/0.07	Program Terminates
0.00/0.07	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.07	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.08	EOF