0.00/0.08	YES
0.00/0.08	
0.00/0.08	Solver Timeout: 4
0.00/0.08	Global Timeout: 300
0.00/0.08	No parsing errors!
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l13, true>
0.00/0.08	<l1, l2, true>
0.00/0.08	<l3, l4, true, par{Inner10^0 -> (1 + Inner10^0)}>
0.00/0.08	<l5, l6, true>
0.00/0.08	<l7, l3, (undef63 = undef63), par{Pcnt13^0 -> (1 + Pcnt13^0), Ptotal11^0 -> undef63}>
0.00/0.08	<l7, l3, (undef74 = undef74), par{Ncnt14^0 -> (1 + Ncnt14^0), Ntotal12^0 -> undef74}>
0.00/0.08	<l8, l9, (10 <= (0 + Inner10^0)), par{Outer9^0 -> (1 + Outer9^0)}>
0.00/0.08	<l8, l7, ((1 + Inner10^0) <= 10)>
0.00/0.08	<l10, l11, (10 <= (0 + Outer9^0)) /\ (undef135 = undef135), par{Negcnt^0 -> (0 + Ncnt14^0), Negtotal^0 -> (0 + Ntotal12^0), Poscnt^0 -> (0 + Pcnt13^0), Postotal^0 -> (0 + Ptotal11^0), StopTime3^0 -> 1500, TotalTime4^0 -> undef135}>
0.00/0.08	<l10, l4, ((1 + Outer9^0) <= 10), par{Inner10^0 -> 0}>
0.00/0.08	<l9, l10, true>
0.00/0.08	<l4, l8, true>
0.00/0.08	<l6, l1, (10 <= (0 + InnerIndex7^0)), par{OuterIndex6^0 -> (1 + OuterIndex6^0)}>
0.00/0.08	<l6, l5, ((1 + InnerIndex7^0) <= 10) /\ (undef217 = undef217), par{InnerIndex7^0 -> (1 + InnerIndex7^0), Seed^0 -> undef217, ret_RandomInteger15^0 -> (0 + undef217)}>
0.00/0.08	<l2, l9, (10 <= (0 + OuterIndex6^0)), par{Ncnt14^0 -> 0, Ntotal12^0 -> 0, Outer9^0 -> 0, Pcnt13^0 -> 0, Ptotal11^0 -> 0, StartTime2^0 -> 1000}>
0.00/0.08	<l2, l5, ((1 + OuterIndex6^0) <= 10), par{InnerIndex7^0 -> 0}>
0.00/0.08	<l12, l1, true, par{OuterIndex6^0 -> 0, Seed^0 -> 0}>
0.00/0.08	<l13, l12, true>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	undef63, undef74, undef135, undef217, 
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	undef63, undef74, undef135, undef217, 
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	Preprocessed LLVMGraph
0.00/0.08	Init Location: 0
0.00/0.08	Transitions:
0.00/0.08	<l0, l5, (OuterIndex6^0 = 0) /\ ((1 + 0) <= 10), par{InnerIndex7^0 -> 0}>
0.00/0.08	<l4, l11, (10 <= (0 + Inner10^0)) /\ (10 <= (0 + (1 + Outer9^0))) /\ (undef135 = undef135), par{Outer9^0 -> (1 + Outer9^0)}>
0.00/0.08	<l4, l4, (10 <= (0 + Inner10^0)) /\ ((1 + (1 + Outer9^0)) <= 10), par{Inner10^0 -> 0, Outer9^0 -> (1 + Outer9^0)}>
0.00/0.08	<l4, l4, ((1 + Inner10^0) <= 10) /\ (undef63 = undef63), par{Inner10^0 -> (1 + Inner10^0), Pcnt13^0 -> (1 + Pcnt13^0), Ptotal11^0 -> undef63}>
0.00/0.08	<l4, l4, ((1 + Inner10^0) <= 10) /\ (undef74 = undef74), par{Inner10^0 -> (1 + Inner10^0), Ncnt14^0 -> (1 + Ncnt14^0), Ntotal12^0 -> undef74}>
0.00/0.08	<l5, l4, (10 <= (0 + InnerIndex7^0)) /\ (10 <= (0 + (1 + OuterIndex6^0))) /\ ((1 + 0) <= 10), par{Inner10^0 -> 0, Ncnt14^0 -> 0, Ntotal12^0 -> 0, Outer9^0 -> 0, OuterIndex6^0 -> (1 + OuterIndex6^0), Pcnt13^0 -> 0, Ptotal11^0 -> 0}>
0.00/0.08	<l5, l5, (10 <= (0 + InnerIndex7^0)) /\ ((1 + (1 + OuterIndex6^0)) <= 10), par{InnerIndex7^0 -> 0, OuterIndex6^0 -> (1 + OuterIndex6^0)}>
0.00/0.08	<l5, l5, ((1 + InnerIndex7^0) <= 10) /\ (undef217 = undef217), par{InnerIndex7^0 -> (1 + InnerIndex7^0)}>
0.00/0.08	
0.00/0.08	Fresh variables:
0.00/0.08	undef63, undef74, undef135, undef217, 
0.00/0.08	
0.00/0.08	Undef variables:
0.00/0.08	undef63, undef74, undef135, undef217, 
0.00/0.08	
0.00/0.08	Abstraction variables:
0.00/0.08	
0.00/0.08	Exit nodes:
0.00/0.08	
0.00/0.08	Accepting locations:
0.00/0.08	
0.00/0.08	Asserts:
0.00/0.08	
0.00/0.08	*************************************************************
0.00/0.08	*******************************************************************************************
0.00/0.08	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Init Location: 0
0.00/0.08	Graph 0:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Graph 1:
0.00/0.08	Transitions:
0.00/0.08	<l5, l5, 10 <= InnerIndex7^0 /\ OuterIndex6^0 <= 8, {InnerIndex7^0 -> 0, OuterIndex6^0 -> 1 + OuterIndex6^0, rest remain the same}>
0.00/0.08	<l5, l5, InnerIndex7^0 <= 9, {InnerIndex7^0 -> 1 + InnerIndex7^0, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	InnerIndex7^0, OuterIndex6^0
0.00/0.08	
0.00/0.08	Graph 2:
0.00/0.08	Transitions:
0.00/0.08	<l4, l4, 10 <= Inner10^0 /\ Outer9^0 <= 8, {Inner10^0 -> 0, Outer9^0 -> 1 + Outer9^0, rest remain the same}>
0.00/0.08	<l4, l4, Inner10^0 <= 9, {Inner10^0 -> 1 + Inner10^0, Pcnt13^0 -> 1 + Pcnt13^0, Ptotal11^0 -> undef63, rest remain the same}>
0.00/0.08	<l4, l4, Inner10^0 <= 9, {Inner10^0 -> 1 + Inner10^0, Ncnt14^0 -> 1 + Ncnt14^0, Ntotal12^0 -> undef74, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	Inner10^0, Outer9^0, Pcnt13^0, Ptotal11^0, Ncnt14^0, Ntotal12^0
0.00/0.08	
0.00/0.08	Graph 3:
0.00/0.08	Transitions:
0.00/0.08	Variables:
0.00/0.08	
0.00/0.08	Precedence: 
0.00/0.08	Graph 0
0.00/0.08	
0.00/0.08	Graph 1
0.00/0.08	<l0, l5, OuterIndex6^0 = 0, {InnerIndex7^0 -> 0, rest remain the same}>
0.00/0.08	
0.00/0.08	Graph 2
0.00/0.08	<l5, l4, 10 <= InnerIndex7^0 /\ 9 <= OuterIndex6^0, {Inner10^0 -> 0, Ncnt14^0 -> 0, Ntotal12^0 -> 0, Outer9^0 -> 0, OuterIndex6^0 -> 1 + OuterIndex6^0, Pcnt13^0 -> 0, Ptotal11^0 -> 0, rest remain the same}>
0.00/0.08	
0.00/0.08	Graph 3
0.00/0.08	<l4, l11, 10 <= Inner10^0 /\ 9 <= Outer9^0, {Outer9^0 -> 1 + Outer9^0, rest remain the same}>
0.00/0.08	
0.00/0.08	Map Locations to Subgraph:
0.00/0.08	( 0 , 0 )
0.00/0.08	( 4 , 2 )
0.00/0.08	( 5 , 1 )
0.00/0.08	( 11 , 3 )
0.00/0.08	
0.00/0.08	*******************************************************************************************
0.00/0.08	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.08	*******************************************************************************************
0.00/0.08	
0.00/0.08	Proving termination of subgraph 0
0.00/0.08	Proving termination of subgraph 1
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.010104
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l5}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001326s
0.00/0.08	Ranking function: 8 - OuterIndex6^0
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l5, l5, InnerIndex7^0 <= 9, {InnerIndex7^0 -> 1 + InnerIndex7^0, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	InnerIndex7^0
0.00/0.08	Checking conditional termination of SCC {l5}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.000583s
0.00/0.08	Ranking function: 9 - InnerIndex7^0
0.00/0.08	New Graphs: 
0.00/0.08	Proving termination of subgraph 2
0.00/0.08	Checking unfeasibility...
0.00/0.08	Time used: 0.031116
0.00/0.08	
0.00/0.08	Checking conditional termination of SCC {l4}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.002778s
0.00/0.08	Ranking function: 8 - Outer9^0
0.00/0.08	New Graphs: 
0.00/0.08	Transitions:
0.00/0.08	<l4, l4, Inner10^0 <= 9, {Inner10^0 -> 1 + Inner10^0, Pcnt13^0 -> 1 + Pcnt13^0, Ptotal11^0 -> undef63, rest remain the same}>
0.00/0.08	<l4, l4, Inner10^0 <= 9, {Inner10^0 -> 1 + Inner10^0, Ncnt14^0 -> 1 + Ncnt14^0, Ntotal12^0 -> undef74, rest remain the same}>
0.00/0.08	Variables:
0.00/0.08	Inner10^0, Ncnt14^0, Ntotal12^0, Pcnt13^0, Ptotal11^0
0.00/0.08	Checking conditional termination of SCC {l4}...
0.00/0.08	
0.00/0.08	LOG: CALL solveLinear
0.00/0.08	
0.00/0.08	LOG: RETURN solveLinear - Elapsed time: 0.001233s
0.00/0.08	Ranking function: 9 - Inner10^0
0.00/0.08	New Graphs: 
0.00/0.08	Proving termination of subgraph 3
0.00/0.08	Analyzing SCC {l11}...
0.00/0.08	No cycles found.
0.00/0.08	
0.00/0.08	Program Terminates
0.00/0.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.08	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.08	EOF