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, l9, true>
0.00/0.04	<l1, l2, true>
0.00/0.04	<l3, l4, ((0 + np19^0) <= (0 + ni21^0)) /\ (undef41 = (0 + nPow___020^0)), par{ret_nPow22^0 -> undef41, tmp___1^0 -> (0 + undef41)}>
0.00/0.04	<l3, l5, ((1 + ni21^0) <= (0 + np19^0)) /\ (undef48 = undef48), par{nPow___020^0 -> undef48, ni21^0 -> (1 + ni21^0)}>
0.00/0.04	<l6, l7, true>
0.00/0.04	<l7, l5, ((0 + np14^0) <= (0 + ni16^0)) /\ (undef106 = (0 + nPow___015^0)), par{nPow___020^0 -> 1, ni21^0 -> 0, np19^0 -> (0 + nN^0), nx18^0 -> (0 + nc^0), ret_nPow17^0 -> undef106, tmp___0^0 -> (0 + undef106)}>
0.00/0.04	<l7, l6, ((1 + ni16^0) <= (0 + np14^0)) /\ (undef113 = undef113), par{nPow___015^0 -> undef113, ni16^0 -> (1 + ni16^0)}>
0.00/0.04	<l5, l3, true>
0.00/0.04	<l2, l6, ((0 + np9^0) <= (0 + ni11^0)) /\ (undef171 = (0 + nPow___010^0)), par{nPow___015^0 -> 1, ni16^0 -> 0, np14^0 -> (0 + nN^0), nx13^0 -> (0 + nb^0), ret_nPow12^0 -> undef171, tmp^0 -> (0 + undef171)}>
0.00/0.04	<l2, l1, ((1 + ni11^0) <= (0 + np9^0)) /\ (undef178 = undef178), par{nPow___010^0 -> undef178, ni11^0 -> (1 + ni11^0)}>
0.00/0.04	<l8, l1, (undef199 = 3), par{nN^0 -> undef199, nPow___010^0 -> 1, ni11^0 -> 0, np9^0 -> (0 + undef199), nx8^0 -> (0 + na^0)}>
0.00/0.04	<l9, l8, true>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef41, undef48, undef106, undef113, undef171, undef178, undef199, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef41, undef48, undef106, undef113, undef171, undef178, undef199, 
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, (nN^0 = undef199) /\ (nPow___010^0 = 1) /\ (ni11^0 = 0) /\ (np9^0 = (0 + undef199)) /\ (undef199 = 3)>
0.00/0.04	<l1, l6, ((0 + np9^0) <= (0 + ni11^0)) /\ (undef171 = (0 + nPow___010^0)), par{nPow___015^0 -> 1, ni16^0 -> 0, np14^0 -> (0 + nN^0)}>
0.00/0.04	<l1, l1, ((1 + ni11^0) <= (0 + np9^0)) /\ (undef178 = undef178), par{nPow___010^0 -> undef178, ni11^0 -> (1 + ni11^0)}>
0.00/0.04	<l5, l4, ((0 + np19^0) <= (0 + ni21^0)) /\ (undef41 = (0 + nPow___020^0))>
0.00/0.04	<l5, l5, ((1 + ni21^0) <= (0 + np19^0)) /\ (undef48 = undef48), par{nPow___020^0 -> undef48, ni21^0 -> (1 + ni21^0)}>
0.00/0.04	<l6, l5, ((0 + np14^0) <= (0 + ni16^0)) /\ (undef106 = (0 + nPow___015^0)), par{nPow___020^0 -> 1, ni21^0 -> 0, np19^0 -> (0 + nN^0)}>
0.00/0.04	<l6, l6, ((1 + ni16^0) <= (0 + np14^0)) /\ (undef113 = undef113), par{nPow___015^0 -> undef113, ni16^0 -> (1 + ni16^0)}>
0.00/0.04	
0.00/0.04	Fresh variables:
0.00/0.04	undef41, undef48, undef106, undef113, undef171, undef178, undef199, 
0.00/0.04	
0.00/0.04	Undef variables:
0.00/0.04	undef41, undef48, undef106, undef113, undef171, undef178, undef199, 
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, 1 + ni11^0 <= np9^0, {nPow___010^0 -> undef178, ni11^0 -> 1 + ni11^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	nPow___010^0, ni11^0, np9^0
0.00/0.04	
0.00/0.04	Graph 2:
0.00/0.04	Transitions:
0.00/0.04	<l6, l6, 1 + ni16^0 <= np14^0, {nPow___015^0 -> undef113, ni16^0 -> 1 + ni16^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	nPow___015^0, ni16^0, np14^0
0.00/0.04	
0.00/0.04	Graph 3:
0.00/0.04	Transitions:
0.00/0.04	<l5, l5, 1 + ni21^0 <= np19^0, {nPow___020^0 -> undef48, ni21^0 -> 1 + ni21^0, rest remain the same}>
0.00/0.04	Variables:
0.00/0.04	nPow___020^0, ni21^0, np19^0
0.00/0.04	
0.00/0.04	Graph 4:
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, nN^0 = undef199 /\ ni11^0 = 0 /\ np9^0 = undef199 /\ nPow___010^0 = 1 /\ undef199 = 3, {all remain the same}>
0.00/0.04	
0.00/0.04	Graph 2
0.00/0.04	<l1, l6, np9^0 <= ni11^0 /\ nPow___010^0 = undef171, {nPow___015^0 -> 1, ni16^0 -> 0, np14^0 -> nN^0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 3
0.00/0.04	<l6, l5, np14^0 <= ni16^0 /\ nPow___015^0 = undef106, {nPow___020^0 -> 1, ni21^0 -> 0, np19^0 -> nN^0, rest remain the same}>
0.00/0.04	
0.00/0.04	Graph 4
0.00/0.04	<l5, l4, np19^0 <= ni21^0 /\ nPow___020^0 = undef41, {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 , 4 )
0.00/0.04	( 5 , 3 )
0.00/0.04	( 6 , 2 )
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.003318
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.001078s
0.00/0.04	Ranking function: -1 - ni11^0 + np9^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.001917
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.001091s
0.00/0.04	Ranking function: -1 - ni16^0 + np14^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.001994
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.001118s
0.00/0.04	Ranking function: -1 - ni21^0 + np19^0
0.00/0.04	New Graphs: 
0.00/0.04	Proving termination of subgraph 4
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/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.04	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.04	EOF