0.00/0.04	YES
0.00/0.04	
0.00/0.04	Solver Timeout: 4
0.00/0.04	Global Timeout: 300
0.00/0.04	No parsing errors!
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l15, true>
0.00/0.04	<l1, l2, true>
0.00/0.04	<l3, l4, (50 <= (0 + i^0))>
0.00/0.04	<l3, l5, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}>
0.00/0.04	<l6, l7, true>
0.00/0.04	<l8, l5, (50 <= (0 + i13^0)), par{i^0 -> 0}>
0.00/0.04	<l8, l9, ((1 + i13^0) <= 50), par{i13^0 -> (1 + i13^0)}>
0.00/0.04	<l10, l11, true>
0.00/0.04	<l12, l9, (50 <= (0 + i11^0)) /\ (undef57 = 0), par{i13^0 -> 0}>
0.00/0.04	<l12, l13, ((1 + i11^0) <= 50), par{i11^0 -> (1 + i11^0)}>
0.00/0.04	<l13, l12, true>
0.00/0.04	<l11, l13, (50 <= (0 + i^0)) /\ (undef79 = 0), par{i11^0 -> 0}>
0.00/0.04	<l11, l10, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}>
0.00/0.04	<l9, l8, true>
0.00/0.04	<l7, l10, (50 <= (0 + i9^0)), par{i^0 -> 0}>
0.00/0.04	<l7, l6, ((1 + i9^0) <= 50), par{i9^0 -> (1 + i9^0)}>
0.00/0.04	<l5, l3, true>
0.00/0.04	<l2, l6, (50 <= (0 + i7^0)) /\ (undef122 = 0), par{i9^0 -> 0}>
0.00/0.04	<l2, l1, ((1 + i7^0) <= 50), par{i7^0 -> (1 + i7^0)}>
0.00/0.04	<l14, l1, (undef135 = undef135) /\ (undef136 = undef136) /\ (undef137 = 0), par{i7^0 -> 0, i^0 -> 0, tmp^0 -> undef135, tmp___0^0 -> undef136}>
0.00/0.04	<l15, l14, true>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef57, undef79, undef122, undef135, undef136, undef137, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef57, undef79, undef122, undef135, undef136, undef137, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	Preprocessed LLVMGraph
0.00/0.04	Init Location: 0
0.00/0.04	Transitions:
0.00/0.04	<l0, l1, (i7^0 = 0) /\ (i^0 = 0) /\ (undef135 = undef135) /\ (undef136 = undef136) /\ (undef137 = 0)>
0.00/0.04	<l1, l6, (50 <= (0 + i7^0)) /\ (undef122 = 0), par{i9^0 -> 0}>
0.00/0.04	<l1, l1, ((1 + i7^0) <= 50), par{i7^0 -> (1 + i7^0)}>
0.00/0.04	<l5, l4, (50 <= (0 + i^0))>
0.00/0.04	<l5, l5, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}>
0.00/0.04	<l6, l10, (50 <= (0 + i9^0)), par{i^0 -> 0}>
0.00/0.04	<l6, l6, ((1 + i9^0) <= 50), par{i9^0 -> (1 + i9^0)}>
0.00/0.04	<l9, l5, (50 <= (0 + i13^0)), par{i^0 -> 0}>
0.00/0.04	<l9, l9, ((1 + i13^0) <= 50), par{i13^0 -> (1 + i13^0)}>
0.00/0.04	<l10, l13, (50 <= (0 + i^0)) /\ (undef79 = 0), par{i11^0 -> 0}>
0.00/0.04	<l10, l10, ((1 + i^0) <= 50), par{i^0 -> (1 + i^0)}>
0.00/0.04	<l13, l9, (50 <= (0 + i11^0)) /\ (undef57 = 0), par{i13^0 -> 0}>
0.00/0.04	<l13, l13, ((1 + i11^0) <= 50), par{i11^0 -> (1 + i11^0)}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef57, undef79, undef122, undef135, undef136, undef137, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef57, undef79, undef122, undef135, undef136, undef137, 
0.00/0.04	
0.00/0.04	Abstraction variables:
0.00/0.04	
0.00/0.04	Exit nodes:
0.00/0.04	
0.00/0.04	Accepting locations:
0.00/0.04	
0.00/0.04	Asserts:
0.00/0.04	
0.00/0.04	*************************************************************
0.00/0.04	*******************************************************************************************
0.00/0.04	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Init Location: 0
0.00/0.04	Graph 0:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Graph 1:
0.00/0.04	Transitions:
0.00/0.04	<l1, l1, i7^0 <= 49, {i7^0 -> 1 + i7^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	i7^0
0.00/0.04	
0.00/0.04	Graph 2:
0.00/0.04	Transitions:
0.00/0.04	<l6, l6, i9^0 <= 49, {i9^0 -> 1 + i9^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	i9^0
0.00/0.04	
0.00/0.04	Graph 3:
0.00/0.04	Transitions:
0.00/0.04	<l10, l10, i^0 <= 49, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	i^0
0.00/0.04	
0.00/0.04	Graph 4:
0.00/0.04	Transitions:
0.00/0.04	<l13, l13, i11^0 <= 49, {i11^0 -> 1 + i11^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	i11^0
0.00/0.04	
0.00/0.04	Graph 5:
0.00/0.04	Transitions:
0.00/0.04	<l9, l9, i13^0 <= 49, {i13^0 -> 1 + i13^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	i13^0
0.00/0.04	
0.00/0.04	Graph 6:
0.00/0.04	Transitions:
0.00/0.04	<l5, l5, i^0 <= 49, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	i^0
0.00/0.04	
0.00/0.04	Graph 7:
0.00/0.04	Transitions:
0.00/0.04	Variables:
0.00/0.04	
0.00/0.04	Precedence: 
0.00/0.04	Graph 0
0.00/0.04	
0.00/0.04	Graph 1
0.00/0.04	<l0, l1, i7^0 = 0 /\ i^0 = 0 /\ undef137 = 0, {all remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l1, l6, 50 <= i7^0 /\ undef122 = 0, {i9^0 -> 0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 3
0.00/0.04	<l6, l10, 50 <= i9^0, {i^0 -> 0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 4
0.00/0.04	<l10, l13, 50 <= i^0 /\ undef79 = 0, {i11^0 -> 0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 5
0.00/0.04	<l13, l9, 50 <= i11^0 /\ undef57 = 0, {i13^0 -> 0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 6
0.00/0.04	<l9, l5, 50 <= i13^0, {i^0 -> 0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 7
0.00/0.04	<l5, l4, 50 <= i^0, {all remain the same}>
0.00/0.04	
0.00/0.04	Map Locations to Subgraph:
0.00/0.04	( 0 , 0 )
0.00/0.04	( 1 , 1 )
0.00/0.04	( 4 , 7 )
0.00/0.04	( 5 , 6 )
0.00/0.04	( 6 , 2 )
0.00/0.04	( 9 , 5 )
0.00/0.04	( 10 , 3 )
0.00/0.04	( 13 , 4 )
0.00/0.04	
0.00/0.04	*******************************************************************************************
0.00/0.04	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.04	*******************************************************************************************
0.00/0.04	
0.00/0.04	Proving termination of subgraph 0
0.00/0.04	Proving termination of subgraph 1
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.001521
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l1}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000592s
0.00/0.04	Ranking function: 49 - i7^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 2
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.001224
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l6}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000595s
0.00/0.04	Ranking function: 49 - i9^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 3
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.001237
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l10}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000629s
0.00/0.04	Ranking function: 49 - i^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 4
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.001183
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l13}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000657s
0.00/0.04	Ranking function: 49 - i11^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 5
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.001189
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l9}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000658s
0.00/0.04	Ranking function: 49 - i13^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 6
0.00/0.04	Checking unfeasibility...
0.00/0.04	Time used: 0.001191
0.00/0.04	
0.00/0.04	Checking conditional termination of SCC {l5}...
0.00/0.04	
0.00/0.04	LOG: CALL solveLinear
0.00/0.04	
0.00/0.04	LOG: RETURN solveLinear - Elapsed time: 0.000690s
0.00/0.04	Ranking function: 49 - i^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 7
0.00/0.04	Analyzing SCC {l4}...
0.00/0.04	No cycles found.
0.00/0.04	
0.00/0.04	Program Terminates
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.04	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.04	EOF