0.00/0.02	YES
0.00/0.02	
0.00/0.02	Solver Timeout: 4
0.00/0.02	Global Timeout: 300
0.00/0.02	No parsing errors!
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<l0, l7, true>
0.00/0.02	<l1, l2, ((0 + __const_100^0) <= (0 + i^0)), par{j^0 -> (0 + __const_100^0)}>
0.00/0.02	<l1, l3, ((1 + i^0) <= (0 + __const_100^0)), par{i^0 -> (1 + i^0), y4^0 -> (0 + i^0), y6^0 -> (0 + i^0)}>
0.00/0.02	<l3, l1, true>
0.00/0.02	<l4, l5, ((0 + __const_200^0) <= (0 + j^0))>
0.00/0.02	<l4, l2, ((1 + j^0) <= (0 + __const_200^0)), par{j^0 -> (1 + j^0), y8^0 -> (0 + j^0)}>
0.00/0.02	<l2, l4, true>
0.00/0.02	<l6, l3, true, par{i^0 -> 0}>
0.00/0.02	<l7, l6, true>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	Preprocessed LLVMGraph
0.00/0.02	Init Location: 0
0.00/0.02	Transitions:
0.00/0.02	<l0, l3, (i^0 = 0)>
0.00/0.02	<l2, l5, ((0 + __const_200^0) <= (0 + j^0))>
0.00/0.02	<l2, l2, ((1 + j^0) <= (0 + __const_200^0)), par{j^0 -> (1 + j^0)}>
0.00/0.02	<l3, l2, ((0 + __const_100^0) <= (0 + i^0)), par{j^0 -> (0 + __const_100^0)}>
0.00/0.02	<l3, l3, ((1 + i^0) <= (0 + __const_100^0)), par{i^0 -> (1 + i^0)}>
0.00/0.02	
0.00/0.02	Fresh variables:
0.00/0.02	
0.00/0.02	Undef variables:
0.00/0.02	
0.00/0.02	Abstraction variables:
0.00/0.02	
0.00/0.02	Exit nodes:
0.00/0.02	
0.00/0.02	Accepting locations:
0.00/0.02	
0.00/0.02	Asserts:
0.00/0.02	
0.00/0.02	*************************************************************
0.00/0.02	*******************************************************************************************
0.00/0.02	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.02	*******************************************************************************************
0.00/0.02	
0.00/0.02	Init Location: 0
0.00/0.02	Graph 0:
0.00/0.02	Transitions:
0.00/0.02	Variables:
0.00/0.02	
0.00/0.02	Graph 1:
0.00/0.02	Transitions:
0.00/0.02	<l3, l3, 1 + i^0 <= __const_100^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.02	Variables:
0.00/0.02	__const_100^0, i^0
0.00/0.02	
0.00/0.02	Graph 2:
0.00/0.02	Transitions:
0.00/0.02	<l2, l2, 1 + j^0 <= __const_200^0, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.02	Variables:
0.00/0.02	__const_200^0, j^0
0.00/0.02	
0.00/0.02	Graph 3:
0.00/0.02	Transitions:
0.00/0.02	Variables:
0.00/0.02	
0.00/0.02	Precedence: 
0.00/0.02	Graph 0
0.00/0.02	
0.00/0.02	Graph 1
0.00/0.02	<l0, l3, i^0 = 0, {all remain the same}>
0.00/0.02	
0.00/0.02	Graph 2
0.00/0.02	<l3, l2, __const_100^0 <= i^0, {j^0 -> __const_100^0, rest remain the same}>
0.00/0.02	
0.00/0.02	Graph 3
0.00/0.02	<l2, l5, __const_200^0 <= j^0, {all remain the same}>
0.00/0.02	
0.00/0.02	Map Locations to Subgraph:
0.00/0.02	( 0 , 0 )
0.00/0.02	( 2 , 2 )
0.00/0.02	( 3 , 1 )
0.00/0.02	( 5 , 3 )
0.00/0.02	
0.00/0.02	*******************************************************************************************
0.00/0.02	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.02	*******************************************************************************************
0.00/0.02	
0.00/0.02	Proving termination of subgraph 0
0.00/0.02	Proving termination of subgraph 1
0.00/0.02	Checking unfeasibility...
0.00/0.02	Time used: 0.001882
0.00/0.02	
0.00/0.02	Checking conditional termination of SCC {l3}...
0.00/0.02	
0.00/0.02	LOG: CALL solveLinear
0.00/0.02	
0.00/0.02	LOG: RETURN solveLinear - Elapsed time: 0.000797s
0.00/0.02	Ranking function: -1 + __const_100^0 - i^0
0.00/0.02	New Graphs: 
0.00/0.02	Proving termination of subgraph 2
0.00/0.02	Checking unfeasibility...
0.00/0.02	Time used: 0.00171
0.00/0.02	
0.00/0.02	Checking conditional termination of SCC {l2}...
0.00/0.02	
0.00/0.02	LOG: CALL solveLinear
0.00/0.02	
0.00/0.02	LOG: RETURN solveLinear - Elapsed time: 0.000811s
0.00/0.02	Ranking function: -1 + __const_200^0 - j^0
0.00/0.02	New Graphs: 
0.00/0.02	Proving termination of subgraph 3
0.00/0.02	Analyzing SCC {l5}...
0.00/0.02	No cycles found.
0.00/0.02	
0.00/0.02	Program Terminates
0.00/0.02	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.02	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.02	EOF