0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	No parsing errors!
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l19, true>
0.00/0.06	<l1, l2, true>
0.00/0.06	<l3, l4, ((1 + i^0) <= 0)>
0.00/0.06	<l3, l5, (0 <= (0 + i^0)), par{i^0 -> (~(1) + i^0)}>
0.00/0.06	<l6, l7, true>
0.00/0.06	<l8, l5, ((0 + arraySize^0) <= (0 + i17^0)), par{i^0 -> (~(1) + arraySize^0)}>
0.00/0.06	<l8, l9, ((1 + i17^0) <= (0 + arraySize^0)), par{i17^0 -> (1 + i17^0)}>
0.00/0.06	<l10, l11, true>
0.00/0.06	<l12, l9, ((1 + i15^0) <= 0) /\ (undef81 = 0), par{i17^0 -> 0}>
0.00/0.06	<l12, l13, (0 <= (0 + i15^0)), par{i15^0 -> (~(1) + i15^0)}>
0.00/0.06	<l14, l15, true>
0.00/0.06	<l16, l13, ((0 + arraySize^0) <= (0 + i13^0)) /\ (undef112 = 0), par{i15^0 -> (~(1) + arraySize^0)}>
0.00/0.06	<l16, l17, ((1 + i13^0) <= (0 + arraySize^0)), par{i13^0 -> (1 + i13^0)}>
0.00/0.06	<l17, l16, true>
0.00/0.06	<l15, l17, ((0 + arraySize^0) <= (0 + i^0)) /\ (undef143 = 0), par{i13^0 -> 0}>
0.00/0.06	<l15, l14, ((1 + i^0) <= (0 + arraySize^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l13, l12, true>
0.00/0.06	<l11, l14, ((0 + arraySize^0) <= (0 + i11^0)), par{i^0 -> 0}>
0.00/0.06	<l11, l10, ((1 + i11^0) <= (0 + arraySize^0)), par{i11^0 -> (1 + i11^0)}>
0.00/0.06	<l9, l8, true>
0.00/0.06	<l7, l10, ((1 + i9^0) <= 0) /\ (undef204 = 0), par{i11^0 -> 0}>
0.00/0.06	<l7, l6, (0 <= (0 + i9^0)), par{i9^0 -> (~(1) + i9^0)}>
0.00/0.06	<l5, l3, true>
0.00/0.06	<l2, l6, ((0 + arraySize^0) <= (0 + i7^0)) /\ (undef235 = 0), par{i9^0 -> (~(1) + arraySize^0)}>
0.00/0.06	<l2, l1, ((1 + i7^0) <= (0 + arraySize^0)), par{i7^0 -> (1 + i7^0)}>
0.00/0.06	<l18, l1, (undef254 = undef254) /\ (undef255 = undef255) /\ (undef256 = 0), par{i7^0 -> 0, i^0 -> 0, tmp^0 -> undef254, tmp___0^0 -> undef255}>
0.00/0.06	<l19, l18, true>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef81, undef112, undef143, undef204, undef235, undef254, undef255, undef256, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef81, undef112, undef143, undef204, undef235, undef254, undef255, undef256, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l1, (i7^0 = 0) /\ (i^0 = 0) /\ (undef254 = undef254) /\ (undef255 = undef255) /\ (undef256 = 0)>
0.00/0.06	<l1, l6, ((0 + arraySize^0) <= (0 + i7^0)) /\ (undef235 = 0), par{i9^0 -> (~(1) + arraySize^0)}>
0.00/0.06	<l1, l1, ((1 + i7^0) <= (0 + arraySize^0)), par{i7^0 -> (1 + i7^0)}>
0.00/0.06	<l5, l4, ((1 + i^0) <= 0)>
0.00/0.06	<l5, l5, (0 <= (0 + i^0)), par{i^0 -> (~(1) + i^0)}>
0.00/0.06	<l6, l10, ((1 + i9^0) <= 0) /\ (undef204 = 0), par{i11^0 -> 0}>
0.00/0.06	<l6, l6, (0 <= (0 + i9^0)), par{i9^0 -> (~(1) + i9^0)}>
0.00/0.06	<l9, l5, ((0 + arraySize^0) <= (0 + i17^0)), par{i^0 -> (~(1) + arraySize^0)}>
0.00/0.06	<l9, l9, ((1 + i17^0) <= (0 + arraySize^0)), par{i17^0 -> (1 + i17^0)}>
0.00/0.06	<l10, l14, ((0 + arraySize^0) <= (0 + i11^0)), par{i^0 -> 0}>
0.00/0.06	<l10, l10, ((1 + i11^0) <= (0 + arraySize^0)), par{i11^0 -> (1 + i11^0)}>
0.00/0.06	<l13, l9, ((1 + i15^0) <= 0) /\ (undef81 = 0), par{i17^0 -> 0}>
0.00/0.06	<l13, l13, (0 <= (0 + i15^0)), par{i15^0 -> (~(1) + i15^0)}>
0.00/0.06	<l14, l17, ((0 + arraySize^0) <= (0 + i^0)) /\ (undef143 = 0), par{i13^0 -> 0}>
0.00/0.06	<l14, l14, ((1 + i^0) <= (0 + arraySize^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l17, l13, ((0 + arraySize^0) <= (0 + i13^0)) /\ (undef112 = 0), par{i15^0 -> (~(1) + arraySize^0)}>
0.00/0.06	<l17, l17, ((1 + i13^0) <= (0 + arraySize^0)), par{i13^0 -> (1 + i13^0)}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef81, undef112, undef143, undef204, undef235, undef254, undef255, undef256, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef81, undef112, undef143, undef204, undef235, undef254, undef255, undef256, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l1, l1, 1 + i7^0 <= arraySize^0, {i7^0 -> 1 + i7^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arraySize^0, i7^0
0.00/0.06	
0.00/0.06	Graph 2:
0.00/0.06	Transitions:
0.00/0.06	<l6, l6, 0 <= i9^0, {i9^0 -> -1 + i9^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i9^0
0.00/0.06	
0.00/0.06	Graph 3:
0.00/0.06	Transitions:
0.00/0.06	<l10, l10, 1 + i11^0 <= arraySize^0, {i11^0 -> 1 + i11^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arraySize^0, i11^0
0.00/0.06	
0.00/0.06	Graph 4:
0.00/0.06	Transitions:
0.00/0.06	<l14, l14, 1 + i^0 <= arraySize^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arraySize^0, i^0
0.00/0.06	
0.00/0.06	Graph 5:
0.00/0.06	Transitions:
0.00/0.06	<l17, l17, 1 + i13^0 <= arraySize^0, {i13^0 -> 1 + i13^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arraySize^0, i13^0
0.00/0.06	
0.00/0.06	Graph 6:
0.00/0.06	Transitions:
0.00/0.06	<l13, l13, 0 <= i15^0, {i15^0 -> -1 + i15^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i15^0
0.00/0.06	
0.00/0.06	Graph 7:
0.00/0.06	Transitions:
0.00/0.06	<l9, l9, 1 + i17^0 <= arraySize^0, {i17^0 -> 1 + i17^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	arraySize^0, i17^0
0.00/0.06	
0.00/0.06	Graph 8:
0.00/0.06	Transitions:
0.00/0.06	<l5, l5, 0 <= i^0, {i^0 -> -1 + i^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i^0
0.00/0.06	
0.00/0.06	Graph 9:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l1, i7^0 = 0 /\ i^0 = 0 /\ undef256 = 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l1, l6, arraySize^0 <= i7^0 /\ undef235 = 0, {i9^0 -> -1 + arraySize^0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 3
0.00/0.06	<l6, l10, 1 + i9^0 <= 0 /\ undef204 = 0, {i11^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 4
0.00/0.06	<l10, l14, arraySize^0 <= i11^0, {i^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 5
0.00/0.06	<l14, l17, arraySize^0 <= i^0 /\ undef143 = 0, {i13^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 6
0.00/0.06	<l17, l13, arraySize^0 <= i13^0 /\ undef112 = 0, {i15^0 -> -1 + arraySize^0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 7
0.00/0.06	<l13, l9, 1 + i15^0 <= 0 /\ undef81 = 0, {i17^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 8
0.00/0.06	<l9, l5, arraySize^0 <= i17^0, {i^0 -> -1 + arraySize^0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 9
0.00/0.06	<l5, l4, 1 + i^0 <= 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 1 , 1 )
0.00/0.06	( 4 , 9 )
0.00/0.06	( 5 , 8 )
0.00/0.06	( 6 , 2 )
0.00/0.06	( 9 , 7 )
0.00/0.06	( 10 , 3 )
0.00/0.06	( 13 , 6 )
0.00/0.06	( 14 , 4 )
0.00/0.06	( 17 , 5 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.002006
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l1}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000909s
0.00/0.06	Ranking function: -1 + arraySize^0 - i7^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001436
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l6}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000983s
0.00/0.06	Ranking function: i9^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 3
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001743
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l10}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000936s
0.00/0.06	Ranking function: -1 + arraySize^0 - i11^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 4
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001683
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l14}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000964s
0.00/0.06	Ranking function: -1 + arraySize^0 - i^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 5
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001778
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l17}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000984s
0.00/0.06	Ranking function: -1 + arraySize^0 - i13^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 6
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001464
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l13}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001070s
0.00/0.06	Ranking function: i15^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 7
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001727
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l9}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001054s
0.00/0.06	Ranking function: -1 + arraySize^0 - i17^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 8
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001455
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l5}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001045s
0.00/0.06	Ranking function: i^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 9
0.00/0.06	Analyzing SCC {l4}...
0.00/0.06	No cycles found.
0.00/0.06	
0.00/0.06	Program Terminates
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.06	EOF