0.00/0.13	YES
0.00/0.13	
0.00/0.14	Solver Timeout: 4
0.00/0.14	Global Timeout: 300
0.00/0.14	No parsing errors!
0.00/0.14	Init Location: 0
0.00/0.14	Transitions:
0.00/0.14	<l0, l13, true>
0.00/0.14	<l1, l2, true>
0.00/0.14	<l3, l4, true>
0.00/0.14	<l5, l6, ((~(1) + N6^0) <= (0 + j7^0))>
0.00/0.14	<l5, l7, ((1 + j7^0) <= (~(1) + N6^0)), par{j7^0 -> (1 + j7^0)}>
0.00/0.14	<l8, l9, true>
0.00/0.14	<l10, l8, true, par{i8^0 -> (1 + i8^0)}>
0.00/0.14	<l11, l10, true, par{min9^0 -> (0 + i8^0)}>
0.00/0.14	<l11, l10, true>
0.00/0.14	<l9, l3, ((0 + N6^0) <= (0 + i8^0)) /\ (undef71 = undef71), par{j7^0 -> (1 + j7^0), t10^0 -> undef71}>
0.00/0.14	<l9, l11, ((1 + i8^0) <= (0 + N6^0))>
0.00/0.14	<l7, l5, true>
0.00/0.14	<l4, l7, ((~(1) + N6^0) <= (0 + j7^0)), par{j7^0 -> 0}>
0.00/0.14	<l4, l8, ((1 + j7^0) <= (~(1) + N6^0)), par{i8^0 -> (1 + j7^0), min9^0 -> (0 + j7^0)}>
0.00/0.14	<l2, l3, ((0 + N^0) <= (0 + i^0)), par{N6^0 -> (0 + N^0), j7^0 -> 0}>
0.00/0.14	<l2, l1, ((1 + i^0) <= (0 + N^0)), par{i^0 -> (1 + i^0)}>
0.00/0.14	<l12, l1, (undef128 = undef128), par{i^0 -> 0, tmp^0 -> undef128}>
0.00/0.14	<l13, l12, true>
0.00/0.14	
0.00/0.14	Fresh variables:
0.00/0.14	undef71, undef128, 
0.00/0.14	
0.00/0.14	Undef variables:
0.00/0.14	undef71, undef128, 
0.00/0.14	
0.00/0.14	Abstraction variables:
0.00/0.14	
0.00/0.14	Exit nodes:
0.00/0.14	
0.00/0.14	Accepting locations:
0.00/0.14	
0.00/0.14	Asserts:
0.00/0.14	
0.00/0.14	Preprocessed LLVMGraph
0.00/0.14	Init Location: 0
0.00/0.14	Transitions:
0.00/0.14	<l0, l1, (i^0 = 0) /\ (undef128 = undef128)>
0.00/0.14	<l1, l7, ((0 + N^0) <= (0 + i^0)) /\ ((~(1) + (0 + N^0)) <= (0 + 0)), par{N6^0 -> (0 + N^0), j7^0 -> 0}>
0.00/0.14	<l1, l8, ((0 + N^0) <= (0 + i^0)) /\ ((1 + 0) <= (~(1) + (0 + N^0))), par{N6^0 -> (0 + N^0), i8^0 -> (1 + 0), j7^0 -> 0}>
0.00/0.14	<l1, l1, ((1 + i^0) <= (0 + N^0)), par{i^0 -> (1 + i^0)}>
0.00/0.14	<l7, l6, ((~(1) + N6^0) <= (0 + j7^0))>
0.00/0.14	<l7, l7, ((1 + j7^0) <= (~(1) + N6^0)), par{j7^0 -> (1 + j7^0)}>
0.00/0.14	<l8, l7, ((0 + N6^0) <= (0 + i8^0)) /\ (undef71 = undef71) /\ ((~(1) + N6^0) <= (0 + (1 + j7^0))), par{j7^0 -> 0}>
0.00/0.14	<l8, l8, ((0 + N6^0) <= (0 + i8^0)) /\ (undef71 = undef71) /\ ((1 + (1 + j7^0)) <= (~(1) + N6^0)), par{i8^0 -> (1 + (1 + j7^0)), j7^0 -> (1 + j7^0)}>
0.00/0.14	<l8, l8, ((1 + i8^0) <= (0 + N6^0)), par{i8^0 -> (1 + i8^0)}>
0.00/0.14	<l8, l8, ((1 + i8^0) <= (0 + N6^0)), par{i8^0 -> (1 + i8^0)}>
0.00/0.14	
0.00/0.14	Fresh variables:
0.00/0.14	undef71, undef128, 
0.00/0.14	
0.00/0.14	Undef variables:
0.00/0.14	undef71, undef128, 
0.00/0.14	
0.00/0.14	Abstraction variables:
0.00/0.14	
0.00/0.14	Exit nodes:
0.00/0.14	
0.00/0.14	Accepting locations:
0.00/0.14	
0.00/0.14	Asserts:
0.00/0.14	
0.00/0.14	*************************************************************
0.00/0.14	*******************************************************************************************
0.00/0.14	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.14	*******************************************************************************************
0.00/0.14	
0.00/0.14	Init Location: 0
0.00/0.14	Graph 0:
0.00/0.14	Transitions:
0.00/0.14	Variables:
0.00/0.14	
0.00/0.14	Graph 1:
0.00/0.14	Transitions:
0.00/0.14	<l1, l1, 1 + i^0 <= N^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.14	Variables:
0.00/0.14	N^0, i^0
0.00/0.14	
0.00/0.14	Graph 2:
0.00/0.14	Transitions:
0.00/0.14	<l8, l8, N6^0 <= i8^0 /\ 3 + j7^0 <= N6^0, {i8^0 -> 2 + j7^0, j7^0 -> 1 + j7^0, rest remain the same}>
0.00/0.14	<l8, l8, 1 + i8^0 <= N6^0, {i8^0 -> 1 + i8^0, rest remain the same}>
0.00/0.14	<l8, l8, 1 + i8^0 <= N6^0, {i8^0 -> 1 + i8^0, rest remain the same}>
0.00/0.14	Variables:
0.00/0.14	N6^0, i8^0, j7^0
0.00/0.14	
0.00/0.14	Graph 3:
0.00/0.14	Transitions:
0.00/0.14	<l7, l7, 2 + j7^0 <= N6^0, {j7^0 -> 1 + j7^0, rest remain the same}>
0.00/0.14	Variables:
0.00/0.14	N6^0, j7^0
0.00/0.14	
0.00/0.14	Graph 4:
0.00/0.14	Transitions:
0.00/0.14	Variables:
0.00/0.14	
0.00/0.14	Precedence: 
0.00/0.14	Graph 0
0.00/0.14	
0.00/0.14	Graph 1
0.00/0.14	<l0, l1, i^0 = 0, {all remain the same}>
0.00/0.14	
0.00/0.14	Graph 2
0.00/0.14	<l1, l8, N^0 <= i^0 /\ 2 <= N^0, {N6^0 -> N^0, i8^0 -> 1, j7^0 -> 0, rest remain the same}>
0.00/0.14	
0.00/0.14	Graph 3
0.00/0.14	<l1, l7, N^0 <= 1 /\ N^0 <= i^0, {N6^0 -> N^0, j7^0 -> 0, rest remain the same}>
0.00/0.14	<l8, l7, N6^0 <= i8^0 /\ N6^0 <= 2 + j7^0, {j7^0 -> 0, rest remain the same}>
0.00/0.14	
0.00/0.14	Graph 4
0.00/0.14	<l7, l6, N6^0 <= 1 + j7^0, {all remain the same}>
0.00/0.14	
0.00/0.14	Map Locations to Subgraph:
0.00/0.14	( 0 , 0 )
0.00/0.14	( 1 , 1 )
0.00/0.14	( 6 , 4 )
0.00/0.14	( 7 , 3 )
0.00/0.14	( 8 , 2 )
0.00/0.14	
0.00/0.14	*******************************************************************************************
0.00/0.14	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.14	*******************************************************************************************
0.00/0.14	
0.00/0.14	Proving termination of subgraph 0
0.00/0.14	Proving termination of subgraph 1
0.00/0.14	Checking unfeasibility...
0.00/0.14	Time used: 0.001893
0.00/0.14	
0.00/0.14	Checking conditional termination of SCC {l1}...
0.00/0.14	
0.00/0.14	LOG: CALL solveLinear
0.00/0.14	
0.00/0.14	LOG: RETURN solveLinear - Elapsed time: 0.000839s
0.00/0.14	Ranking function: -1 + N^0 - i^0
0.00/0.14	New Graphs: 
0.00/0.14	Proving termination of subgraph 2
0.00/0.14	Checking unfeasibility...
0.00/0.14	Time used: 0.096194
0.00/0.14	
0.00/0.14	Checking conditional termination of SCC {l8}...
0.00/0.14	
0.00/0.14	LOG: CALL solveLinear
0.00/0.14	
0.00/0.14	LOG: RETURN solveLinear - Elapsed time: 0.002109s
0.00/0.14	Ranking function: 1 + N6^0 - j7^0
0.00/0.14	New Graphs: 
0.00/0.14	Transitions:
0.00/0.14	<l8, l8, 1 + i8^0 <= N6^0, {i8^0 -> 1 + i8^0, rest remain the same}>
0.00/0.14	<l8, l8, 1 + i8^0 <= N6^0, {i8^0 -> 1 + i8^0, rest remain the same}>
0.00/0.14	Variables:
0.00/0.14	N6^0, i8^0
0.00/0.14	Checking conditional termination of SCC {l8}...
0.00/0.14	
0.00/0.14	LOG: CALL solveLinear
0.00/0.14	
0.00/0.14	LOG: RETURN solveLinear - Elapsed time: 0.001288s
0.00/0.14	Ranking function: -1 + N6^0 - i8^0
0.00/0.14	New Graphs: 
0.00/0.14	Proving termination of subgraph 3
0.00/0.14	Checking unfeasibility...
0.00/0.14	Time used: 0.00183
0.00/0.14	
0.00/0.14	Checking conditional termination of SCC {l7}...
0.00/0.14	
0.00/0.14	LOG: CALL solveLinear
0.00/0.14	
0.00/0.14	LOG: RETURN solveLinear - Elapsed time: 0.000713s
0.00/0.14	Ranking function: -2 + N6^0 - j7^0
0.00/0.14	New Graphs: 
0.00/0.14	Proving termination of subgraph 4
0.00/0.14	Analyzing SCC {l6}...
0.00/0.14	No cycles found.
0.00/0.14	
0.00/0.14	Program Terminates
0.00/0.14	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.14	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.14	EOF