0.00/0.02	YES
0.00/0.02	
0.00/0.03	Solver Timeout: 4
0.00/0.03	Global Timeout: 300
0.00/0.03	No parsing errors!
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l7, true>
0.00/0.03	<l1, l2, true, par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + tmp7^0)}>
0.00/0.03	<l3, l1, true, par{tmp7^0 -> 0}>
0.00/0.03	<l3, l1, true, par{tmp7^0 -> 1}>
0.00/0.03	<l4, l5, ((0 + (2 * __const_8^0)) <= (0 + nI6^0)) /\ (undef44 = (0 + res5^0)) /\ (undef40 = (0 + nX^0)) /\ (undef49 = (0 + undef40)) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef52 = undef52) /\ (undef42 = undef42) /\ (undef45 = (0 + undef42)), par{nX9^0 -> undef40, res10^0 -> undef42, ret_nBC18^0 -> undef44, ret_nBC211^0 -> undef45, tmp^0 -> (0 + undef44), tmp___0^0 -> (0 + undef45)}>
0.00/0.03	<l4, l3, ((1 + nI6^0) <= (0 + (2 * __const_8^0)))>
0.00/0.03	<l2, l4, true>
0.00/0.03	<l6, l2, true, par{nI6^0 -> 0, nX4^0 -> (0 + nX^0), res5^0 -> 0}>
0.00/0.03	<l7, l6, true>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef40, undef42, undef44, undef45, undef49, undef50, undef51, undef52, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef40, undef42, undef44, undef45, undef49, undef50, undef51, undef52, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	Preprocessed LLVMGraph
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l2, (nI6^0 = 0) /\ (res5^0 = 0)>
0.00/0.03	<l2, l5, ((0 + (2 * __const_8^0)) <= (0 + nI6^0)) /\ (undef44 = (0 + res5^0)) /\ (undef40 = (0 + nX^0)) /\ (undef49 = (0 + undef40)) /\ (undef50 = undef50) /\ (undef51 = undef51) /\ (undef52 = undef52) /\ (undef42 = undef42) /\ (undef45 = (0 + undef42))>
0.00/0.03	<l2, l2, ((1 + nI6^0) <= (0 + (2 * __const_8^0))), par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + 0)}>
0.00/0.03	<l2, l2, ((1 + nI6^0) <= (0 + (2 * __const_8^0))), par{nI6^0 -> (1 + nI6^0), res5^0 -> ((0 + res5^0) + 1)}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	undef40, undef42, undef44, undef45, undef49, undef50, undef51, undef52, 
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	undef40, undef42, undef44, undef45, undef49, undef50, undef51, undef52, 
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	*************************************************************
0.00/0.03	*******************************************************************************************
0.00/0.03	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Graph 0:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Graph 1:
0.00/0.03	Transitions:
0.00/0.03	<l2, l2, 1 + nI6^0 <= 2*__const_8^0, {nI6^0 -> 1 + nI6^0, rest remain the same}>
0.00/0.03	<l2, l2, 1 + nI6^0 <= 2*__const_8^0, {nI6^0 -> 1 + nI6^0, res5^0 -> 1 + res5^0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	__const_8^0, nI6^0, res5^0
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Precedence: 
0.00/0.03	Graph 0
0.00/0.03	
0.00/0.03	Graph 1
0.00/0.03	<l0, l2, nI6^0 = 0 /\ res5^0 = 0, {all remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l2, l5, 2*__const_8^0 <= nI6^0 /\ nX^0 = undef40 /\ res5^0 = undef44 /\ undef40 = undef49 /\ undef42 = undef45, {all remain the same}>
0.00/0.03	
0.00/0.03	Map Locations to Subgraph:
0.00/0.03	( 0 , 0 )
0.00/0.03	( 2 , 1 )
0.00/0.03	( 5 , 2 )
0.00/0.03	
0.00/0.03	*******************************************************************************************
0.00/0.03	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Proving termination of subgraph 0
0.00/0.03	Proving termination of subgraph 1
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.004207
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l2}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.001409s
0.00/0.03	Ranking function: -1 + 2*__const_8^0 - nI6^0
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Analyzing SCC {l5}...
0.00/0.03	No cycles found.
0.00/0.03	
0.00/0.03	Program Terminates
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.03	EOF