4.09/4.10	YES
4.09/4.10	
4.09/4.10	Solver Timeout: 4
4.09/4.10	Global Timeout: 300
4.09/4.10	No parsing errors!
4.09/4.10	Init Location: 0
4.09/4.10	Transitions:
4.09/4.10	<l0, l19, true>
4.09/4.10	<l1, l2, true, par{m^0 -> 1}>
4.09/4.10	<l3, l2, ((1 + m2^0) <= (0 + j^0)), par{m^0 -> (1 + m^0)}>
4.09/4.10	<l3, l4, ((0 + j^0) <= (0 + m2^0)) /\ (undef44 = undef44) /\ (undef45 = undef45) /\ (undef47 = undef47) /\ (undef48 = undef48), par{j^0 -> (1 + j^0), k^0 -> (~(1) + k^0), pt1^0 -> undef44, pt2^0 -> undef45, qt1^0 -> undef47, qt2^0 -> undef48, tmp^0 -> (0 + k^0)}>
4.09/4.10	<l4, l3, true>
4.09/4.10	<l5, l1, (2 <= (0 + n^0))>
4.09/4.10	<l5, l1, ((1 + n^0) <= 1)>
4.09/4.10	<l5, l6, ((0 + n^0) <= 1) /\ (1 <= (0 + n^0))>
4.09/4.10	<l7, l4, ((1 + m^0) <= (0 + j^0)) /\ (undef130 = undef130) /\ (undef133 = undef133) /\ (undef136 = undef136), par{j^0 -> 1, k^0 -> (0 + m^0), m2^0 -> undef130, pp^0 -> undef133, qq^0 -> undef136}>
4.09/4.10	<l7, l8, ((0 + j^0) <= (0 + m^0)) /\ (undef159 = undef159) /\ (undef160 = undef160) /\ (undef158 = undef158), par{j^0 -> (1 + j^0), sgd^0 -> undef158, sgn^0 -> undef159, shn^0 -> undef160}>
4.09/4.10	<l8, l7, true>
4.09/4.10	<l9, l8, (undef195 = undef195) /\ (undef196 = undef196) /\ (undef194 = undef194), par{j^0 -> 1, sgd^0 -> undef194, sgn^0 -> undef195, shn^0 -> undef196}>
4.09/4.10	<l10, l9, ((1 + n^0) <= (0 + m1^0))>
4.09/4.10	<l10, l9, ((1 + m1^0) <= (0 + n^0))>
4.09/4.10	<l10, l6, ((0 + m1^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + m1^0))>
4.09/4.10	<l11, l10, ((1 + m^0) <= (0 + j^0))>
4.09/4.10	<l11, l12, ((0 + j^0) <= (0 + m^0)), par{j^0 -> (1 + j^0)}>
4.09/4.10	<l12, l11, true>
4.09/4.10	<l13, l12, true, par{j^0 -> 1}>
4.09/4.10	<l14, l13, (1 <= (0 + sd^0))>
4.09/4.10	<l14, l13, ((1 + sd^0) <= 0)>
4.09/4.10	<l14, l13, ((0 + sd^0) <= 0) /\ (0 <= (0 + sd^0))>
4.09/4.10	<l15, l14, ((1 + m^0) <= (0 + j^0))>
4.09/4.10	<l15, l16, ((0 + j^0) <= (0 + m^0)) /\ (undef413 = undef413) /\ (undef409 = undef409), par{j^0 -> (1 + j^0), sd^0 -> undef409, sxn^0 -> undef413}>
4.09/4.10	<l17, l5, true>
4.09/4.10	<l16, l15, true>
4.09/4.10	<l18, l6, ((1 + n^0) <= (0 + m^0))>
4.09/4.10	<l18, l16, ((0 + m^0) <= (0 + n^0)) /\ (undef485 = undef485) /\ (undef481 = undef481), par{j^0 -> 1, m1^0 -> (1 + m^0), sd^0 -> undef481, sxn^0 -> undef485}>
4.09/4.10	<l2, l18, true>
4.09/4.10	<l19, l17, true>
4.09/4.10	
4.09/4.10	Fresh variables:
4.09/4.10	undef44, undef45, undef47, undef48, undef130, undef133, undef136, undef158, undef159, undef160, undef194, undef195, undef196, undef409, undef413, undef481, undef485, 
4.09/4.10	
4.09/4.10	Undef variables:
4.09/4.10	undef44, undef45, undef47, undef48, undef130, undef133, undef136, undef158, undef159, undef160, undef194, undef195, undef196, undef409, undef413, undef481, undef485, 
4.09/4.10	
4.09/4.10	Abstraction variables:
4.09/4.10	
4.09/4.10	Exit nodes:
4.09/4.10	
4.09/4.10	Accepting locations:
4.09/4.10	
4.09/4.10	Asserts:
4.09/4.10	
4.09/4.10	Preprocessed LLVMGraph
4.09/4.10	Init Location: 0
4.09/4.10	Transitions:
4.09/4.10	<l0, l16, (2 <= (0 + n^0)) /\ ((0 + 1) <= (0 + n^0)) /\ (undef485 = undef485) /\ (undef481 = undef481), par{j^0 -> 1, m1^0 -> (1 + 1), m^0 -> 1, sd^0 -> undef481}>
4.09/4.10	<l0, l6, ((1 + n^0) <= 1) /\ ((1 + n^0) <= (0 + 1)), par{m^0 -> 1}>
4.09/4.10	<l0, l6, ((0 + n^0) <= 1) /\ (1 <= (0 + n^0))>
4.09/4.10	<l4, l6, ((1 + m2^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + (1 + m^0))), par{m^0 -> (1 + m^0)}>
4.09/4.10	<l4, l16, ((1 + m2^0) <= (0 + j^0)) /\ ((0 + (1 + m^0)) <= (0 + n^0)) /\ (undef485 = undef485) /\ (undef481 = undef481), par{j^0 -> 1, m1^0 -> (1 + (1 + m^0)), m^0 -> (1 + m^0), sd^0 -> undef481}>
4.09/4.10	<l4, l4, ((0 + j^0) <= (0 + m2^0)) /\ (undef44 = undef44) /\ (undef45 = undef45) /\ (undef47 = undef47) /\ (undef48 = undef48), par{j^0 -> (1 + j^0), k^0 -> (~(1) + k^0)}>
4.09/4.10	<l8, l4, ((1 + m^0) <= (0 + j^0)) /\ (undef130 = undef130) /\ (undef133 = undef133) /\ (undef136 = undef136), par{j^0 -> 1, k^0 -> (0 + m^0), m2^0 -> undef130}>
4.09/4.10	<l8, l8, ((0 + j^0) <= (0 + m^0)) /\ (undef159 = undef159) /\ (undef160 = undef160) /\ (undef158 = undef158), par{j^0 -> (1 + j^0)}>
4.09/4.10	<l12, l8, ((1 + m^0) <= (0 + j^0)) /\ ((1 + n^0) <= (0 + m1^0)) /\ (undef195 = undef195) /\ (undef196 = undef196) /\ (undef194 = undef194), par{j^0 -> 1}>
4.09/4.10	<l12, l8, ((1 + m^0) <= (0 + j^0)) /\ ((1 + m1^0) <= (0 + n^0)) /\ (undef195 = undef195) /\ (undef196 = undef196) /\ (undef194 = undef194), par{j^0 -> 1}>
4.09/4.10	<l12, l6, ((1 + m^0) <= (0 + j^0)) /\ ((0 + m1^0) <= (0 + n^0)) /\ ((0 + n^0) <= (0 + m1^0))>
4.09/4.10	<l12, l12, ((0 + j^0) <= (0 + m^0)), par{j^0 -> (1 + j^0)}>
4.09/4.10	<l16, l12, ((1 + m^0) <= (0 + j^0)) /\ (1 <= (0 + sd^0)), par{j^0 -> 1}>
4.09/4.10	<l16, l12, ((1 + m^0) <= (0 + j^0)) /\ ((1 + sd^0) <= 0), par{j^0 -> 1}>
4.09/4.10	<l16, l12, ((1 + m^0) <= (0 + j^0)) /\ ((0 + sd^0) <= 0) /\ (0 <= (0 + sd^0)), par{j^0 -> 1}>
4.09/4.10	<l16, l16, ((0 + j^0) <= (0 + m^0)) /\ (undef413 = undef413) /\ (undef409 = undef409), par{j^0 -> (1 + j^0), sd^0 -> undef409}>
4.09/4.10	
4.09/4.10	Fresh variables:
4.09/4.10	undef44, undef45, undef47, undef48, undef130, undef133, undef136, undef158, undef159, undef160, undef194, undef195, undef196, undef409, undef413, undef481, undef485, 
4.09/4.10	
4.09/4.10	Undef variables:
4.09/4.10	undef44, undef45, undef47, undef48, undef130, undef133, undef136, undef158, undef159, undef160, undef194, undef195, undef196, undef409, undef413, undef481, undef485, 
4.09/4.10	
4.09/4.10	Abstraction variables:
4.09/4.10	
4.09/4.10	Exit nodes:
4.09/4.10	
4.09/4.10	Accepting locations:
4.09/4.10	
4.09/4.10	Asserts:
4.09/4.10	
4.09/4.10	*************************************************************
4.09/4.10	*******************************************************************************************
4.09/4.10	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
4.09/4.10	*******************************************************************************************
4.09/4.10	
4.09/4.10	Init Location: 0
4.09/4.10	Graph 0:
4.09/4.10	Transitions:
4.09/4.10	Variables:
4.09/4.10	
4.09/4.10	Graph 1:
4.09/4.10	Transitions:
4.09/4.10	<l4, l16, 1 + m2^0 <= j^0 /\ 1 + m^0 <= n^0, {j^0 -> 1, m1^0 -> 2 + m^0, m^0 -> 1 + m^0, sd^0 -> undef481, rest remain the same}>
4.09/4.10	<l4, l4, j^0 <= m2^0, {j^0 -> 1 + j^0, k^0 -> -1 + k^0, rest remain the same}>
4.09/4.10	<l8, l4, 1 + m^0 <= j^0, {j^0 -> 1, k^0 -> m^0, m2^0 -> undef130, rest remain the same}>
4.09/4.10	<l8, l8, j^0 <= m^0, {j^0 -> 1 + j^0, rest remain the same}>
4.09/4.10	<l12, l8, 1 + m^0 <= j^0 /\ 1 + n^0 <= m1^0, {j^0 -> 1, rest remain the same}>
4.09/4.10	<l12, l8, 1 + m^0 <= j^0 /\ 1 + m1^0 <= n^0, {j^0 -> 1, rest remain the same}>
4.09/4.10	<l12, l12, j^0 <= m^0, {j^0 -> 1 + j^0, rest remain the same}>
4.09/4.10	<l16, l12, 1 + m^0 <= j^0 /\ 1 <= sd^0, {j^0 -> 1, rest remain the same}>
4.09/4.10	<l16, l12, 1 + m^0 <= j^0 /\ 1 + sd^0 <= 0, {j^0 -> 1, rest remain the same}>
4.09/4.10	<l16, l12, 1 + m^0 <= j^0 /\ sd^0 = 0, {j^0 -> 1, rest remain the same}>
4.09/4.10	<l16, l16, j^0 <= m^0, {j^0 -> 1 + j^0, sd^0 -> undef409, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, m1^0, m2^0, m^0, n^0, sd^0, k^0
4.09/4.10	
4.09/4.10	Graph 2:
4.09/4.10	Transitions:
4.09/4.10	Variables:
4.09/4.10	
4.09/4.10	Precedence: 
4.09/4.10	Graph 0
4.09/4.10	
4.09/4.10	Graph 1
4.09/4.10	<l0, l16, 2 <= n^0, {j^0 -> 1, m1^0 -> 2, m^0 -> 1, sd^0 -> undef481, rest remain the same}>
4.09/4.10	
4.09/4.10	Graph 2
4.09/4.10	<l0, l6, n^0 <= 0, {m^0 -> 1, rest remain the same}>
4.09/4.10	<l0, l6, n^0 = 1, {all remain the same}>
4.09/4.10	<l4, l6, 1 + m2^0 <= j^0 /\ n^0 <= m^0, {m^0 -> 1 + m^0, rest remain the same}>
4.09/4.10	<l12, l6, 1 + m^0 <= j^0 /\ m1^0 = n^0, {all remain the same}>
4.09/4.10	
4.09/4.10	Map Locations to Subgraph:
4.09/4.10	( 0 , 0 )
4.09/4.10	( 4 , 1 )
4.09/4.10	( 6 , 2 )
4.09/4.10	( 8 , 1 )
4.09/4.10	( 12 , 1 )
4.09/4.10	( 16 , 1 )
4.09/4.10	
4.09/4.10	*******************************************************************************************
4.09/4.10	********************************    CHECKING ASSERTIONS    ********************************
4.09/4.10	*******************************************************************************************
4.09/4.10	
4.09/4.10	Proving termination of subgraph 0
4.09/4.10	Proving termination of subgraph 1
4.09/4.10	Checking unfeasibility...
4.09/4.10	Time used: 4.00096
4.09/4.10	
4.09/4.10	Checking conditional termination of SCC {l4, l8, l12, l16}...
4.09/4.10	
4.09/4.10	LOG: CALL solveLinear
4.09/4.10	
4.09/4.10	LOG: RETURN solveLinear - Elapsed time: 0.020155s
4.09/4.10	Ranking function: -3 - 3*m^0 + 3*n^0
4.09/4.10	New Graphs: 
4.09/4.10	Transitions:
4.09/4.10	<l16, l16, j^0 <= m^0, {j^0 -> 1 + j^0, sd^0 -> undef409, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, m^0, sd^0
4.09/4.10	Transitions:
4.09/4.10	<l12, l12, j^0 <= m^0, {j^0 -> 1 + j^0, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, m^0
4.09/4.10	Transitions:
4.09/4.10	<l8, l8, j^0 <= m^0, {j^0 -> 1 + j^0, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, m^0
4.09/4.10	Transitions:
4.09/4.10	<l4, l4, j^0 <= m2^0, {j^0 -> 1 + j^0, k^0 -> -1 + k^0, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, k^0, m2^0
4.09/4.10	Checking conditional termination of SCC {l16}...
4.09/4.10	
4.09/4.10	LOG: CALL solveLinear
4.09/4.10	
4.09/4.10	LOG: RETURN solveLinear - Elapsed time: 0.001197s
4.09/4.10	Ranking function: -j^0 + m^0
4.09/4.10	New Graphs: 
4.09/4.10	Transitions:
4.09/4.10	<l12, l12, j^0 <= m^0, {j^0 -> 1 + j^0, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, m^0
4.09/4.10	Transitions:
4.09/4.10	<l8, l8, j^0 <= m^0, {j^0 -> 1 + j^0, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, m^0
4.09/4.10	Transitions:
4.09/4.10	<l4, l4, j^0 <= m2^0, {j^0 -> 1 + j^0, k^0 -> -1 + k^0, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, k^0, m2^0
4.09/4.10	Checking conditional termination of SCC {l12}...
4.09/4.10	
4.09/4.10	LOG: CALL solveLinear
4.09/4.10	
4.09/4.10	LOG: RETURN solveLinear - Elapsed time: 0.001070s
4.09/4.10	Ranking function: -j^0 + m^0
4.09/4.10	New Graphs: 
4.09/4.10	Transitions:
4.09/4.10	<l8, l8, j^0 <= m^0, {j^0 -> 1 + j^0, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, m^0
4.09/4.10	Transitions:
4.09/4.10	<l4, l4, j^0 <= m2^0, {j^0 -> 1 + j^0, k^0 -> -1 + k^0, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, k^0, m2^0
4.09/4.10	Checking conditional termination of SCC {l8}...
4.09/4.10	
4.09/4.10	LOG: CALL solveLinear
4.09/4.10	
4.09/4.10	LOG: RETURN solveLinear - Elapsed time: 0.001077s
4.09/4.10	Ranking function: -j^0 + m^0
4.09/4.10	New Graphs: 
4.09/4.10	Transitions:
4.09/4.10	<l4, l4, j^0 <= m2^0, {j^0 -> 1 + j^0, k^0 -> -1 + k^0, rest remain the same}>
4.09/4.10	Variables:
4.09/4.10	j^0, k^0, m2^0
4.09/4.10	Checking conditional termination of SCC {l4}...
4.09/4.10	
4.09/4.10	LOG: CALL solveLinear
4.09/4.10	
4.09/4.10	LOG: RETURN solveLinear - Elapsed time: 0.001188s
4.09/4.10	Ranking function: -j^0 + m2^0
4.09/4.10	New Graphs: 
4.09/4.10	Proving termination of subgraph 2
4.09/4.10	Analyzing SCC {l6}...
4.09/4.10	No cycles found.
4.09/4.10	
4.09/4.10	Program Terminates
4.09/4.10	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
4.09/4.10	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
4.09/4.10	EOF