0.76/0.81	YES
0.76/0.81	
0.76/0.81	Solver Timeout: 4
0.76/0.81	Global Timeout: 300
0.76/0.81	No parsing errors!
0.76/0.81	Init Location: 0
0.76/0.81	Transitions:
0.76/0.81	<l0, l14, true>
0.76/0.81	<l1, l2, (5 <= (0 + i2^0))>
0.76/0.81	<l1, l3, ((1 + i2^0) <= 5), par{j3^0 -> 0}>
0.76/0.81	<l4, l1, true>
0.76/0.81	<l3, l5, true>
0.76/0.81	<l2, l6, true>
0.76/0.81	<l7, l8, true>
0.76/0.81	<l9, l10, true, par{l5^0 -> (1 + l5^0)}>
0.76/0.81	<l10, l11, true>
0.76/0.81	<l12, l9, true>
0.76/0.81	<l12, l2, true>
0.76/0.81	<l12, l9, true>
0.76/0.81	<l11, l7, (5 <= (0 + l5^0)), par{k4^0 -> (1 + k4^0)}>
0.76/0.81	<l11, l12, ((1 + l5^0) <= 5)>
0.76/0.81	<l8, l3, (5 <= (0 + k4^0)), par{j3^0 -> (1 + j3^0)}>
0.76/0.81	<l8, l10, ((1 + k4^0) <= 5), par{l5^0 -> 0}>
0.76/0.81	<l5, l4, (5 <= (0 + j3^0)), par{i2^0 -> (1 + i2^0)}>
0.76/0.81	<l5, l7, ((1 + j3^0) <= 5), par{k4^0 -> 0}>
0.76/0.81	<l13, l4, true, par{i2^0 -> 0, x1^0 -> 400}>
0.76/0.81	<l14, l13, true>
0.76/0.81	
0.76/0.81	Fresh variables:
0.76/0.81	
0.76/0.81	Undef variables:
0.76/0.81	
0.76/0.81	Abstraction variables:
0.76/0.81	
0.76/0.81	Exit nodes:
0.76/0.81	
0.76/0.81	Accepting locations:
0.76/0.81	
0.76/0.81	Asserts:
0.76/0.81	
0.76/0.81	Preprocessed LLVMGraph
0.76/0.81	Init Location: 0
0.76/0.81	Transitions:
0.76/0.81	<l0, l7, (i2^0 = 0) /\ ((1 + i2^0) <= 5) /\ ((1 + 0) <= 5), par{j3^0 -> 0, k4^0 -> 0}>
0.76/0.81	<l7, l6, (5 <= (0 + k4^0)) /\ (5 <= (0 + (1 + j3^0))) /\ (5 <= (0 + (1 + i2^0))), par{i2^0 -> (1 + i2^0), j3^0 -> (1 + j3^0)}>
0.76/0.81	<l7, l7, (5 <= (0 + k4^0)) /\ (5 <= (0 + (1 + j3^0))) /\ ((1 + (1 + i2^0)) <= 5) /\ ((1 + 0) <= 5), par{i2^0 -> (1 + i2^0), j3^0 -> 0, k4^0 -> 0}>
0.76/0.81	<l7, l7, (5 <= (0 + k4^0)) /\ ((1 + (1 + j3^0)) <= 5), par{j3^0 -> (1 + j3^0), k4^0 -> 0}>
0.76/0.81	<l7, l10, ((1 + k4^0) <= 5), par{l5^0 -> 0}>
0.76/0.81	<l10, l7, (5 <= (0 + l5^0)), par{k4^0 -> (1 + k4^0)}>
0.76/0.81	<l10, l10, ((1 + l5^0) <= 5), par{l5^0 -> (1 + l5^0)}>
0.76/0.81	<l10, l6, ((1 + l5^0) <= 5)>
0.76/0.81	<l10, l10, ((1 + l5^0) <= 5), par{l5^0 -> (1 + l5^0)}>
0.76/0.81	
0.76/0.81	Fresh variables:
0.76/0.81	
0.76/0.81	Undef variables:
0.76/0.81	
0.76/0.81	Abstraction variables:
0.76/0.81	
0.76/0.81	Exit nodes:
0.76/0.81	
0.76/0.81	Accepting locations:
0.76/0.81	
0.76/0.81	Asserts:
0.76/0.81	
0.76/0.81	*************************************************************
0.76/0.81	*******************************************************************************************
0.76/0.81	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.76/0.81	*******************************************************************************************
0.76/0.81	
0.76/0.81	Init Location: 0
0.76/0.81	Graph 0:
0.76/0.81	Transitions:
0.76/0.81	Variables:
0.76/0.81	
0.76/0.81	Graph 1:
0.76/0.81	Transitions:
0.76/0.81	<l7, l7, 5 <= k4^0 /\ 4 <= j3^0 /\ i2^0 <= 3, {i2^0 -> 1 + i2^0, j3^0 -> 0, k4^0 -> 0, rest remain the same}>
0.76/0.81	<l7, l7, 5 <= k4^0 /\ j3^0 <= 3, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
0.76/0.81	<l7, l10, k4^0 <= 4, {l5^0 -> 0, rest remain the same}>
0.76/0.81	<l10, l7, 5 <= l5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
0.76/0.81	<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	Variables:
0.76/0.81	i2^0, j3^0, k4^0, l5^0
0.76/0.81	
0.76/0.81	Graph 2:
0.76/0.81	Transitions:
0.76/0.81	Variables:
0.76/0.81	
0.76/0.81	Precedence: 
0.76/0.81	Graph 0
0.76/0.81	
0.76/0.81	Graph 1
0.76/0.81	<l0, l7, i2^0 = 0, {j3^0 -> 0, k4^0 -> 0, rest remain the same}>
0.76/0.81	
0.76/0.81	Graph 2
0.76/0.81	<l7, l6, 5 <= k4^0 /\ 4 <= i2^0 /\ 4 <= j3^0, {i2^0 -> 1 + i2^0, j3^0 -> 1 + j3^0, rest remain the same}>
0.76/0.81	<l10, l6, l5^0 <= 4, {all remain the same}>
0.76/0.81	
0.76/0.81	Map Locations to Subgraph:
0.76/0.81	( 0 , 0 )
0.76/0.81	( 6 , 2 )
0.76/0.81	( 7 , 1 )
0.76/0.81	( 10 , 1 )
0.76/0.81	
0.76/0.81	*******************************************************************************************
0.76/0.81	********************************    CHECKING ASSERTIONS    ********************************
0.76/0.81	*******************************************************************************************
0.76/0.81	
0.76/0.81	Proving termination of subgraph 0
0.76/0.81	Proving termination of subgraph 1
0.76/0.81	Checking unfeasibility...
0.76/0.81	Time used: 0.460142
0.76/0.81	
0.76/0.81	Checking conditional termination of SCC {l7, l10}...
0.76/0.81	
0.76/0.81	LOG: CALL solveLinear
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear - Elapsed time: 0.005467s
0.76/0.81	Ranking function: 3 - i2^0
0.76/0.81	New Graphs: 
0.76/0.81	Transitions:
0.76/0.81	<l7, l7, 5 <= k4^0 /\ j3^0 <= 3, {j3^0 -> 1 + j3^0, k4^0 -> 0, rest remain the same}>
0.76/0.81	<l7, l10, k4^0 <= 4, {l5^0 -> 0, rest remain the same}>
0.76/0.81	<l10, l7, 5 <= l5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
0.76/0.81	<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	Variables:
0.76/0.81	j3^0, k4^0, l5^0
0.76/0.81	Checking conditional termination of SCC {l7, l10}...
0.76/0.81	
0.76/0.81	LOG: CALL solveLinear
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear - Elapsed time: 0.001848s
0.76/0.81	Ranking function: 3 - j3^0
0.76/0.81	New Graphs: 
0.76/0.81	Transitions:
0.76/0.81	<l7, l10, k4^0 <= 4, {l5^0 -> 0, rest remain the same}>
0.76/0.81	<l10, l7, 5 <= l5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
0.76/0.81	<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	<l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	Variables:
0.76/0.81	k4^0, l5^0
0.76/0.81	Checking conditional termination of SCC {l7, l10}...
0.76/0.81	
0.76/0.81	LOG: CALL solveLinear
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear - Elapsed time: 0.001188s
0.76/0.81	
0.76/0.81	LOG: CALL solveLinear
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear - Elapsed time: 0.006261s
0.76/0.81	Trying to remove transition: <l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	Solving with 1 template(s).
0.76/0.81	
0.76/0.81	LOG: CALL solveNonLinearGetFirstSolution
0.76/0.81	
0.76/0.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030051s
0.76/0.81	Time used: 0.029851
0.76/0.81	Trying to remove transition: <l10, l10, l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	Solving with 1 template(s).
0.76/0.81	
0.76/0.81	LOG: CALL solveNonLinearGetFirstSolution
0.76/0.81	
0.76/0.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028238s
0.76/0.81	Time used: 0.027423
0.76/0.81	Trying to remove transition: <l10, l7, 5 <= l5^0, {k4^0 -> 1 + k4^0, rest remain the same}>
0.76/0.81	Solving with 1 template(s).
0.76/0.81	
0.76/0.81	LOG: CALL solveNonLinearGetFirstSolution
0.76/0.81	
0.76/0.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013649s
0.76/0.81	Time used: 0.01285
0.76/0.81	Trying to remove transition: <l7, l10, k4^0 <= 4, {l5^0 -> 0, rest remain the same}>
0.76/0.81	Solving with 1 template(s).
0.76/0.81	
0.76/0.81	LOG: CALL solveNonLinearGetFirstSolution
0.76/0.81	
0.76/0.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009909s
0.76/0.81	Time used: 0.008931
0.76/0.81	Solving with 1 template(s).
0.76/0.81	
0.76/0.81	LOG: CALL solveNonLinearGetFirstSolution
0.76/0.81	
0.76/0.81	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.191972s
0.76/0.81	Time used: 0.191092
0.76/0.81	
0.76/0.81	LOG: SAT solveNonLinear - Elapsed time: 0.191972s
0.76/0.81	Cost: 0; Total time: 0.191092
0.76/0.81	Termination implied by a set of invariant(s):
0.76/0.81	Invariant at l10: k4^0 <= 4
0.76/0.81	[ Invariant Graph ]
0.76/0.81	Strengthening and disabling transitions...
0.76/0.81	
0.76/0.81	LOG: CALL solverLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: CALL solverLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear in Graph for feasibility
0.76/0.81	Strengthening transition (result): 
0.76/0.81	<l10, l7, 5 <= l5^0 /\ k4^0 <= 4, {k4^0 -> 1 + k4^0, rest remain the same}>
0.76/0.81	
0.76/0.81	LOG: CALL solverLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear in Graph for feasibility
0.76/0.81	Strengthening transition (result): 
0.76/0.81	<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	
0.76/0.81	LOG: CALL solverLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear in Graph for feasibility
0.76/0.81	Strengthening transition (result): 
0.76/0.81	<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	[ Termination Graph ]
0.76/0.81	Strengthening and disabling transitions...
0.76/0.81	
0.76/0.81	LOG: CALL solverLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: CALL solverLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear in Graph for feasibility
0.76/0.81	Strengthening transition (result): 
0.76/0.81	<l10, l7, 5 <= l5^0 /\ k4^0 <= 4, {k4^0 -> 1 + k4^0, rest remain the same}>
0.76/0.81	
0.76/0.81	LOG: CALL solverLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear in Graph for feasibility
0.76/0.81	Strengthening transition (result): 
0.76/0.81	<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	
0.76/0.81	LOG: CALL solverLinear in Graph for feasibility
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear in Graph for feasibility
0.76/0.81	Strengthening transition (result): 
0.76/0.81	<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	Ranking function: 4 - k4^0
0.76/0.81	New Graphs: 
0.76/0.81	Transitions:
0.76/0.81	<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	<l10, l10, k4^0 <= 4 /\ l5^0 <= 4, {l5^0 -> 1 + l5^0, rest remain the same}>
0.76/0.81	Variables:
0.76/0.81	k4^0, l5^0
0.76/0.81	Checking conditional termination of SCC {l10}...
0.76/0.81	
0.76/0.81	LOG: CALL solveLinear
0.76/0.81	
0.76/0.81	LOG: RETURN solveLinear - Elapsed time: 0.001325s
0.76/0.81	Ranking function: 4 - l5^0
0.76/0.81	New Graphs: 
0.76/0.81	INVARIANTS: 
0.76/0.81	10: k4^0 <= 4 , 
0.76/0.81	Quasi-INVARIANTS to narrow Graph: 
0.76/0.81	10: 
0.76/0.81	Proving termination of subgraph 2
0.76/0.81	Analyzing SCC {l6}...
0.76/0.81	No cycles found.
0.76/0.81	
0.76/0.81	Program Terminates
0.76/0.81	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.76/0.81	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.76/0.81	EOF