0.00/0.43	YES
0.00/0.43	
0.00/0.43	Solver Timeout: 4
0.00/0.43	Global Timeout: 300
0.00/0.43	No parsing errors!
0.00/0.43	Init Location: 0
0.00/0.43	Transitions:
0.00/0.43	<l0, l12, true>
0.00/0.43	<l1, l2, ((0 + a^0) <= 0)>
0.00/0.43	<l1, l3, (1 <= (0 + a^0)), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0)}>
0.00/0.43	<l4, l1, true>
0.00/0.43	<l3, l5, true>
0.00/0.43	<l6, l7, true, par{i^0 -> (~(1) + i^0)}>
0.00/0.43	<l7, l8, true>
0.00/0.43	<l9, l6, true, par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0)}>
0.00/0.43	<l10, l6, ((0 + tmp^0) <= 0) /\ (0 <= (0 + tmp^0))>
0.00/0.43	<l10, l9, (1 <= (0 + tmp^0))>
0.00/0.43	<l10, l9, ((1 + tmp^0) <= 0)>
0.00/0.43	<l8, l3, ((0 + i^0) <= 0)>
0.00/0.43	<l8, l10, (1 <= (0 + i^0)) /\ (undef60 = undef60), par{tmp^0 -> undef60}>
0.00/0.43	<l5, l4, ((0 + b^0) <= 0)>
0.00/0.43	<l5, l7, (1 <= (0 + b^0)), par{b^0 -> (~(1) + b^0), i^0 -> (~(1) + a^0)}>
0.00/0.43	<l11, l4, true, par{a^0 -> (0 + n^0), b^0 -> 0}>
0.00/0.43	<l12, l11, true>
0.00/0.43	
0.00/0.43	Fresh variables:
0.00/0.43	undef60, 
0.00/0.43	
0.00/0.43	Undef variables:
0.00/0.43	undef60, 
0.00/0.43	
0.00/0.43	Abstraction variables:
0.00/0.43	
0.00/0.43	Exit nodes:
0.00/0.43	
0.00/0.43	Accepting locations:
0.00/0.43	
0.00/0.43	Asserts:
0.00/0.43	
0.00/0.43	Preprocessed LLVMGraph
0.00/0.43	Init Location: 0
0.00/0.43	Transitions:
0.00/0.43	<l0, l4, (a^0 = (0 + n^0)) /\ (b^0 = 0)>
0.00/0.43	<l4, l2, ((0 + a^0) <= 0)>
0.00/0.43	<l4, l4, (1 <= (0 + a^0)) /\ ((0 + (1 + b^0)) <= 0), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0)}>
0.00/0.43	<l4, l7, (1 <= (0 + a^0)) /\ (1 <= (0 + (1 + b^0))), par{a^0 -> (~(1) + a^0), b^0 -> (~(1) + (1 + b^0)), i^0 -> (~(1) + (~(1) + a^0))}>
0.00/0.43	<l7, l4, ((0 + i^0) <= 0) /\ ((0 + b^0) <= 0)>
0.00/0.43	<l7, l7, ((0 + i^0) <= 0) /\ (1 <= (0 + b^0)), par{b^0 -> (~(1) + b^0), i^0 -> (~(1) + a^0)}>
0.00/0.43	<l7, l7, (1 <= (0 + i^0)) /\ (undef60 = undef60) /\ ((0 + undef60) <= 0) /\ (0 <= (0 + undef60)), par{i^0 -> (~(1) + i^0)}>
0.00/0.43	<l7, l7, (1 <= (0 + i^0)) /\ (undef60 = undef60) /\ (1 <= (0 + undef60)), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0), i^0 -> (~(1) + i^0)}>
0.00/0.43	<l7, l7, (1 <= (0 + i^0)) /\ (undef60 = undef60) /\ ((1 + undef60) <= 0), par{a^0 -> (~(1) + a^0), b^0 -> (1 + b^0), i^0 -> (~(1) + i^0)}>
0.00/0.43	
0.00/0.43	Fresh variables:
0.00/0.43	undef60, 
0.00/0.43	
0.00/0.43	Undef variables:
0.00/0.43	undef60, 
0.00/0.43	
0.00/0.43	Abstraction variables:
0.00/0.43	
0.00/0.43	Exit nodes:
0.00/0.43	
0.00/0.43	Accepting locations:
0.00/0.43	
0.00/0.43	Asserts:
0.00/0.43	
0.00/0.43	*************************************************************
0.00/0.43	*******************************************************************************************
0.00/0.43	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.43	*******************************************************************************************
0.00/0.43	
0.00/0.43	Init Location: 0
0.00/0.43	Graph 0:
0.00/0.43	Transitions:
0.00/0.43	Variables:
0.00/0.43	
0.00/0.43	Graph 1:
0.00/0.43	Transitions:
0.00/0.43	<l4, l4, 1 <= a^0 /\ 1 + b^0 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, rest remain the same}>
0.00/0.43	<l4, l7, 0 <= b^0 /\ 1 <= a^0, {a^0 -> -1 + a^0, i^0 -> -2 + a^0, rest remain the same}>
0.00/0.43	<l7, l4, b^0 <= 0 /\ i^0 <= 0, {all remain the same}>
0.00/0.43	<l7, l7, i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
0.00/0.43	<l7, l7, 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	<l7, l7, 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	<l7, l7, 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	Variables:
0.00/0.43	a^0, b^0, i^0
0.00/0.43	
0.00/0.43	Graph 2:
0.00/0.43	Transitions:
0.00/0.43	Variables:
0.00/0.43	
0.00/0.43	Precedence: 
0.00/0.43	Graph 0
0.00/0.43	
0.00/0.43	Graph 1
0.00/0.43	<l0, l4, a^0 = n^0 /\ b^0 = 0, {all remain the same}>
0.00/0.43	
0.00/0.43	Graph 2
0.00/0.43	<l4, l2, a^0 <= 0, {all remain the same}>
0.00/0.43	
0.00/0.43	Map Locations to Subgraph:
0.00/0.43	( 0 , 0 )
0.00/0.43	( 2 , 2 )
0.00/0.43	( 4 , 1 )
0.00/0.43	( 7 , 1 )
0.00/0.43	
0.00/0.43	*******************************************************************************************
0.00/0.43	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.43	*******************************************************************************************
0.00/0.43	
0.00/0.43	Proving termination of subgraph 0
0.00/0.43	Proving termination of subgraph 1
0.00/0.43	Checking unfeasibility...
0.00/0.43	Time used: 0.042456
0.00/0.43	Some transition disabled by a set of invariant(s):
0.00/0.43	Invariant at l4: 0 <= b^0
0.00/0.43	Invariant at l7: 0 <= b^0
0.00/0.43	
0.00/0.43	Strengthening and disabling transitions...
0.00/0.43	> It's unfeasible. Removing transition: 
0.00/0.43	<l4, l4, 1 <= a^0 /\ 1 + b^0 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l4, l7, 0 <= b^0 /\ 1 <= a^0, {a^0 -> -1 + a^0, i^0 -> -2 + a^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l4, i^0 <= 0 /\ b^0 = 0, {all remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	Checking unfeasibility...
0.00/0.43	Time used: 0.083039
0.00/0.43	
0.00/0.43	Checking conditional termination of SCC {l4, l7}...
0.00/0.43	
0.00/0.43	LOG: CALL solveLinear
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear - Elapsed time: 0.004532s
0.00/0.43	Ranking function: -3 + 3*a^0
0.00/0.43	New Graphs: 
0.00/0.43	Transitions:
0.00/0.43	<l7, l7, i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
0.00/0.43	<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	<l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	Variables:
0.00/0.43	a^0, b^0, i^0
0.00/0.43	Checking conditional termination of SCC {l7}...
0.00/0.43	
0.00/0.43	LOG: CALL solveLinear
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear - Elapsed time: 0.001651s
0.00/0.43	
0.00/0.43	LOG: CALL solveLinear
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear - Elapsed time: 0.016467s
0.00/0.43	Trying to remove transition: <l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	Solving with 1 template(s).
0.00/0.43	
0.00/0.43	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.43	
0.00/0.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020968s
0.00/0.43	Time used: 0.020422
0.00/0.43	Trying to remove transition: <l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	Solving with 1 template(s).
0.00/0.43	
0.00/0.43	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.43	
0.00/0.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022041s
0.00/0.43	Time used: 0.020661
0.00/0.43	Trying to remove transition: <l7, l7, 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	Solving with 1 template(s).
0.00/0.43	
0.00/0.43	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.43	
0.00/0.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013738s
0.00/0.43	Time used: 0.012307
0.00/0.43	Trying to remove transition: <l7, l7, i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
0.00/0.43	Solving with 1 template(s).
0.00/0.43	
0.00/0.43	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.43	
0.00/0.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023853s
0.00/0.43	Time used: 0.022889
0.00/0.43	Solving with 1 template(s).
0.00/0.43	
0.00/0.43	LOG: CALL solveNonLinearGetFirstSolution
0.00/0.43	
0.00/0.43	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.119507s
0.00/0.43	Time used: 0.118038
0.00/0.43	
0.00/0.43	LOG: SAT solveNonLinear - Elapsed time: 0.119507s
0.00/0.43	Cost: 0; Total time: 0.118038
0.00/0.43	Termination implied by a set of invariant(s):
0.00/0.43	Invariant at l4: 0 <= 1 + b^0
0.00/0.43	Invariant at l7: i^0 <= a^0
0.00/0.43	[ Invariant Graph ]
0.00/0.43	Strengthening and disabling transitions...
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l4, l7, 0 <= b^0 /\ 1 <= a^0, {a^0 -> -1 + a^0, i^0 -> -2 + a^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l4, i^0 <= a^0 /\ i^0 <= 0 /\ b^0 = 0, {all remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, i^0 <= a^0 /\ i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	[ Termination Graph ]
0.00/0.43	Strengthening and disabling transitions...
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, i^0 <= a^0 /\ i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ 1 <= undef60, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	
0.00/0.43	LOG: CALL solverLinear in Graph for feasibility
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.43	Strengthening transition (result): 
0.00/0.43	<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ 1 + undef60 <= 0, {a^0 -> -1 + a^0, b^0 -> 1 + b^0, i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	Ranking function: a^0
0.00/0.43	New Graphs: 
0.00/0.43	Transitions:
0.00/0.43	<l7, l7, i^0 <= a^0 /\ i^0 <= 0 /\ 1 <= b^0, {b^0 -> -1 + b^0, i^0 -> -1 + a^0, rest remain the same}>
0.00/0.43	<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	Variables:
0.00/0.43	a^0, b^0, i^0
0.00/0.43	Checking conditional termination of SCC {l7}...
0.00/0.43	
0.00/0.43	LOG: CALL solveLinear
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear - Elapsed time: 0.001759s
0.00/0.43	Ranking function: -3 + 3*b^0
0.00/0.43	New Graphs: 
0.00/0.43	Transitions:
0.00/0.43	<l7, l7, i^0 <= a^0 /\ 0 <= b^0 /\ 1 <= i^0 /\ undef60 = 0, {i^0 -> -1 + i^0, rest remain the same}>
0.00/0.43	Variables:
0.00/0.43	a^0, b^0, i^0
0.00/0.43	Checking conditional termination of SCC {l7}...
0.00/0.43	
0.00/0.43	LOG: CALL solveLinear
0.00/0.43	
0.00/0.43	LOG: RETURN solveLinear - Elapsed time: 0.001075s
0.00/0.43	Ranking function: -1 + i^0
0.00/0.43	New Graphs: 
0.00/0.43	INVARIANTS: 
0.00/0.43	4: 0 <= 1 + b^0 , 
0.00/0.43	7: i^0 <= a^0 , 
0.00/0.43	Quasi-INVARIANTS to narrow Graph: 
0.00/0.43	4: 
0.00/0.43	7: 
0.00/0.43	Proving termination of subgraph 2
0.00/0.43	Analyzing SCC {l2}...
0.00/0.43	No cycles found.
0.00/0.43	
0.00/0.43	Program Terminates
0.00/0.43	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.43	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.43	EOF