22.74/22.77	NO
22.74/22.77	
22.74/22.77	Solver Timeout: 4
22.74/22.77	Global Timeout: 300
22.74/22.77	No parsing errors!
22.74/22.77	Init Location: 0
22.74/22.77	Transitions:
22.74/22.77	<l0, l5, true>
22.74/22.77	<l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ ((undef2 - 1) <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 1), par{arg1 -> undef1, arg2 -> undef2, arg3 -> 1, arg4 -> arg2}>
22.74/22.77	<l2, l3, (arg1 > 0) /\ (arg4 <= arg3) /\ (arg2 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
22.74/22.77	<l3, l4, (arg1 > ~(1)) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
22.74/22.77	<l3, l3, (arg1 > 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}>
22.74/22.77	<l4, l4, (arg1 > 0) /\ (undef17 > ~(1)), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}>
22.74/22.77	<l2, l2, (arg4 > (arg3 + 2)) /\ (arg4 > (arg3 + 1)) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (undef21 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef21 > 0) /\ (undef22 > 6), par{arg1 -> undef21, arg2 -> undef22, arg3 -> (arg3 + 4)}>
22.74/22.77	<l5, l1, true, par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}>
22.74/22.77	
22.74/22.77	Fresh variables:
22.74/22.77	undef1, undef2, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef25, undef26, undef27, undef28, 
22.74/22.77	
22.74/22.77	Undef variables:
22.74/22.77	undef1, undef2, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef25, undef26, undef27, undef28, 
22.74/22.77	
22.74/22.77	Abstraction variables:
22.74/22.77	
22.74/22.77	Exit nodes:
22.74/22.77	
22.74/22.77	Accepting locations:
22.74/22.77	
22.74/22.77	Asserts:
22.74/22.77	
22.74/22.77	Preprocessed LLVMGraph
22.74/22.77	Init Location: 0
22.74/22.77	Transitions:
22.74/22.77	<l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (arg3 = 1) /\ (arg4 = undef26) /\ (undef1 <= undef25) /\ (undef26 > ~(1)) /\ ((undef2 - 1) <= undef25) /\ (undef25 > 0) /\ (undef1 > 0) /\ (undef2 > 1)>
22.74/22.77	<l2, l3, (arg1 > 0) /\ (arg4 <= arg3) /\ (arg2 > 0) /\ (undef5 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
22.74/22.77	<l2, l2, (arg4 > (arg3 + 2)) /\ (arg4 > (arg3 + 1)) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (undef21 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef21 > 0) /\ (undef22 > 6), par{arg1 -> undef21, arg2 -> undef22, arg3 -> (arg3 + 4)}>
22.74/22.77	<l3, l4, (arg1 > ~(1)) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
22.74/22.77	<l3, l3, (arg1 > 0) /\ (undef13 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}>
22.74/22.77	<l4, l4, (arg1 > 0) /\ (undef17 > ~(1)), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}>
22.74/22.77	
22.74/22.77	Fresh variables:
22.74/22.77	undef1, undef2, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef25, undef26, undef27, undef28, 
22.74/22.77	
22.74/22.77	Undef variables:
22.74/22.77	undef1, undef2, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef25, undef26, undef27, undef28, 
22.74/22.77	
22.74/22.77	Abstraction variables:
22.74/22.77	
22.74/22.77	Exit nodes:
22.74/22.77	
22.74/22.77	Accepting locations:
22.74/22.77	
22.74/22.77	Asserts:
22.74/22.77	
22.74/22.77	*************************************************************
22.74/22.77	*******************************************************************************************
22.74/22.77	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
22.74/22.77	*******************************************************************************************
22.74/22.77	
22.74/22.77	Init Location: 0
22.74/22.77	Graph 0:
22.74/22.77	Transitions:
22.74/22.77	Variables:
22.74/22.77	
22.74/22.77	Graph 1:
22.74/22.77	Transitions:
22.74/22.77	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef21 /\ undef21 <= arg1 /\ undef21 <= arg2 /\ 0 <= arg4 /\ 3 + arg3 <= arg4 /\ 7 <= undef22, {arg1 -> undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}>
22.74/22.77	Variables:
22.74/22.77	arg1, arg2, arg3, arg4
22.74/22.77	
22.74/22.77	Graph 2:
22.74/22.77	Transitions:
22.74/22.77	<l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	Variables:
22.74/22.77	arg1, arg2, arg3, arg4
22.74/22.77	
22.74/22.77	Graph 3:
22.74/22.77	Transitions:
22.74/22.77	<l4, l4, 1 <= arg1 /\ 0 <= undef17, {arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}>
22.74/22.77	Variables:
22.74/22.77	arg1, arg2, arg3, arg4
22.74/22.77	
22.74/22.77	Precedence: 
22.74/22.77	Graph 0
22.74/22.77	
22.74/22.77	Graph 1
22.74/22.77	<l0, l2, 1 <= undef1 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	
22.74/22.77	Graph 2
22.74/22.77	<l2, l3, 1 <= arg1 /\ 1 <= arg2 /\ arg4 <= arg3 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
22.74/22.77	
22.74/22.77	Graph 3
22.74/22.77	<l3, l4, 0 <= arg1 /\ 0 <= undef9, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
22.74/22.77	
22.74/22.77	Map Locations to Subgraph:
22.74/22.77	( 0 , 0 )
22.74/22.77	( 2 , 1 )
22.74/22.77	( 3 , 2 )
22.74/22.77	( 4 , 3 )
22.74/22.77	
22.74/22.77	*******************************************************************************************
22.74/22.77	********************************    CHECKING ASSERTIONS    ********************************
22.74/22.77	*******************************************************************************************
22.74/22.77	
22.74/22.77	Proving termination of subgraph 0
22.74/22.77	Proving termination of subgraph 1
22.74/22.77	Checking unfeasibility...
22.74/22.77	Time used: 0.00599
22.74/22.77	
22.74/22.77	Checking conditional termination of SCC {l2}...
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.001509s
22.74/22.77	Ranking function: (~(3) / 4) + (~(1) / 4)*arg3 + (1 / 4)*arg4
22.74/22.77	New Graphs: 
22.74/22.77	Proving termination of subgraph 2
22.74/22.77	Checking unfeasibility...
22.74/22.77	Time used: 0.002632
22.74/22.77	
22.74/22.77	Checking conditional termination of SCC {l3}...
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.000856s
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.002373s
22.74/22.77	Trying to remove transition: <l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	Solving with 1 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007825s
22.74/22.77	Time used: 0.007678
22.74/22.77	Solving with 1 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011483s
22.74/22.77	Time used: 0.01093
22.74/22.77	Improving Solution with cost 1 ...
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetNextSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014600s
22.74/22.77	Time used: 0.014595
22.74/22.77	
22.74/22.77	LOG: SAT solveNonLinear - Elapsed time: 0.026083s
22.74/22.77	Cost: 1; Total time: 0.025525
22.74/22.77	Failed at location 3: arg1 <= 0
22.74/22.77	Before Improving: 
22.74/22.77	Quasi-invariant at l3: arg1 <= 0
22.74/22.77	Optimizing invariants...
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.002718s
22.74/22.77	Remaining time after improvement: 0.998861
22.74/22.77	Termination implied by a set of quasi-invariant(s):
22.74/22.77	Quasi-invariant at l3: arg1 <= 0
22.74/22.77	[ Invariant Graph ]
22.74/22.77	Strengthening and disabling transitions...
22.74/22.77	
22.74/22.77	LOG: CALL solverLinear in Graph for feasibility
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear in Graph for feasibility
22.74/22.77	It's unfeasible. Removing transition: 
22.74/22.77	<l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	[ Termination Graph ]
22.74/22.77	Strengthening and disabling transitions...
22.74/22.77	> It's unfeasible. Removing transition: 
22.74/22.77	<l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	New Graphs: 
22.74/22.77	Calling Safety with literal arg1 <= 0 and entry <l2, l3, 1 <= arg1 /\ 1 <= arg2 /\ arg4 <= arg3 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
22.74/22.77	
22.74/22.77	LOG: CALL check - Post:arg1 <= 0 - Process 1
22.74/22.77	* Exit transition: <l2, l3, 1 <= arg1 /\ 1 <= arg2 /\ arg4 <= arg3 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
22.74/22.77	* Postcondition  : arg1 <= 0
22.74/22.77	Postcodition moved up: undef5 <= 0
22.74/22.77	
22.74/22.77	LOG: Try proving POST
22.74/22.77	Postcondition: undef5 <= 0
22.74/22.77	
22.74/22.77	LOG: CALL check - Post:undef5 <= 0 - Process 2
22.74/22.77	* Exit transition: <l0, l2, 1 <= undef1 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef5 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	* Postcondition  : undef5 <= 0
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.000912s
22.74/22.77	> Postcondition is not implied!
22.74/22.77	
22.74/22.77	LOG: RETURN check - Elapsed time: 0.001092s
22.74/22.77	
22.74/22.77	LOG: NarrowEntry size 1
22.74/22.77	Narrowing transition: 
22.74/22.77	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef21 /\ undef21 <= arg1 /\ undef21 <= arg2 /\ 0 <= arg4 /\ 3 + arg3 <= arg4 /\ 7 <= undef22, {arg1 -> undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}>
22.74/22.77	
22.74/22.77	LOG: Narrow transition size 1
22.74/22.77	ENTRIES:
22.74/22.77	<l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	END ENTRIES:
22.74/22.77	GRAPH:
22.74/22.77	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef5 /\ 1 <= undef21 /\ undef21 <= arg1 /\ undef21 <= arg2 /\ 0 <= arg4 /\ 3 + arg3 <= arg4 /\ 7 <= undef22, {arg1 -> undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}>
22.74/22.77	END GRAPH:
22.74/22.77	EXIT: <l2, l3, 1 <= arg1 /\ 1 <= arg2 /\ arg4 <= arg3 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
22.74/22.77	POST: arg1 <= 0
22.74/22.77	
22.74/22.77	
22.74/22.77	LOG: Try proving POST
22.74/22.77	Solving with 1 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021704s
22.74/22.77	Time used: 0.021502
22.74/22.77	Improving Solution with cost 51 ...
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetNextSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000687s
22.74/22.77	Time used: 1.00038
22.74/22.77	
22.74/22.77	LOG: SAT solveNonLinear - Elapsed time: 1.022391s
22.74/22.77	Cost: 51; Total time: 1.02188
22.74/22.77	Failed at location 2: 1 + arg4 <= arg3
22.74/22.77	Before Improving: 
22.74/22.77	Quasi-invariant at l2: 1 + arg4 <= arg3
22.74/22.77	Optimizing invariants...
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.004760s
22.74/22.77	Quasi-invariant improved
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.001822s
22.74/22.77	Remaining time after improvement: 0.996071
22.74/22.77	Some transition disabled by a set of quasi-invariant(s):
22.74/22.77	Quasi-invariant at l2: arg4 <= arg3
22.74/22.77	
22.74/22.77	LOG: NEXT CALL check - disable
22.74/22.77	
22.74/22.77	LOG: CALL check - Post:arg4 <= arg3 - Process 3
22.74/22.77	* Exit transition: <l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	* Postcondition  : arg4 <= arg3
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.001060s
22.74/22.77	> Postcondition is not implied!
22.74/22.77	
22.74/22.77	LOG: RETURN check - Elapsed time: 0.001235s
22.74/22.77	Solving with 2 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.125271s
22.74/22.77	Time used: 0.124967
22.74/22.77	Improving Solution with cost 2 ...
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetNextSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001019s
22.74/22.77	Time used: 1.00102
22.74/22.77	
22.74/22.77	LOG: SAT solveNonLinear - Elapsed time: 1.126290s
22.74/22.77	Cost: 2; Total time: 1.12599
22.74/22.77	Failed at location 2: arg4 <= 1 + arg3
22.74/22.77	Failed at location 2: 1 + arg3 <= arg4
22.74/22.77	Before Improving: 
22.74/22.77	Quasi-invariant at l2: arg4 <= 1 + arg3
22.74/22.77	Quasi-invariant at l2: 1 + arg3 <= arg4
22.74/22.77	Optimizing invariants...
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.018819s
22.74/22.77	Remaining time after improvement: 0.997905
22.74/22.77	Postcondition implied by a set of quasi-invariant(s):
22.74/22.77	Quasi-invariant at l2: arg4 <= 1 + arg3
22.74/22.77	Quasi-invariant at l2: 1 + arg3 <= arg4
22.74/22.77	Postcondition: arg4 <= 1 + arg3
22.74/22.77	
22.74/22.77	LOG: CALL check - Post:arg4 <= 1 + arg3 - Process 4
22.74/22.77	* Exit transition: <l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	* Postcondition  : arg4 <= 1 + arg3
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.001380s
22.74/22.77	> Postcondition is not implied!
22.74/22.77	
22.74/22.77	LOG: RETURN check - Elapsed time: 0.001565s
22.74/22.77	Postcondition: 1 + arg3 <= arg4
22.74/22.77	
22.74/22.77	LOG: CALL check - Post:1 + arg3 <= arg4 - Process 5
22.74/22.77	* Exit transition: <l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	* Postcondition  : 1 + arg3 <= arg4
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.001071s
22.74/22.77	> Postcondition is not implied!
22.74/22.77	
22.74/22.77	LOG: RETURN check - Elapsed time: 0.001261s
22.74/22.77	
22.74/22.77	LOG: NarrowEntry size 2
22.74/22.77	INVARIANTS: 
22.74/22.77	2: 
22.74/22.77	Quasi-INVARIANTS to narrow Graph: 
22.74/22.77	2: 1 + arg3 <= arg4 , arg4 <= 1 + arg3 , 
22.74/22.77	Narrowing transition: 
22.74/22.77	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef5 /\ 1 <= undef21 /\ undef21 <= arg1 /\ undef21 <= arg2 /\ 0 <= arg4 /\ 3 + arg3 <= arg4 /\ 7 <= undef22, {arg1 -> undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}>
22.74/22.77	
22.74/22.77	LOG: Narrow transition size 2
22.74/22.77	ENTRIES:
22.74/22.77	<l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ arg4 <= arg3 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	<l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 + arg3 <= arg4 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	END ENTRIES:
22.74/22.77	GRAPH:
22.74/22.77	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef5 /\ 1 <= undef21 /\ undef21 <= arg1 /\ undef21 <= arg2 /\ 0 <= arg4 /\ 3 + arg3 <= arg4 /\ 7 <= undef22, {arg1 -> undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}>
22.74/22.77	END GRAPH:
22.74/22.77	EXIT: <l2, l3, 1 <= arg1 /\ 1 <= arg2 /\ arg4 <= arg3 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
22.74/22.77	POST: arg1 <= 0
22.74/22.77	
22.74/22.77	
22.74/22.77	LOG: Try proving POST
22.74/22.77	Solving with 1 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000634s
22.74/22.77	Time used: 4.00054
22.74/22.77	Solving with 2 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.242588s
22.74/22.77	Time used: 1.23442
22.74/22.77	Improving Solution with cost 2 ...
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetNextSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001214s
22.74/22.77	Time used: 1.00121
22.74/22.77	
22.74/22.77	LOG: SAT solveNonLinear - Elapsed time: 2.243802s
22.74/22.77	Cost: 2; Total time: 2.23562
22.74/22.77	Failed at location 2: arg4 <= 2 + arg3
22.74/22.77	Failed at location 2: 1 + arg3 <= arg4
22.74/22.77	Before Improving: 
22.74/22.77	Quasi-invariant at l2: arg4 <= 2 + arg3
22.74/22.77	Quasi-invariant at l2: 1 + arg3 <= arg4
22.74/22.77	Optimizing invariants...
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.013959s
22.74/22.77	Remaining time after improvement: 0.996241
22.74/22.77	Postcondition implied by a set of quasi-invariant(s):
22.74/22.77	Quasi-invariant at l2: arg4 <= 2 + arg3
22.74/22.77	Quasi-invariant at l2: 1 + arg3 <= arg4
22.74/22.77	Postcondition: 1 + arg3 <= arg4
22.74/22.77	
22.74/22.77	LOG: CALL check - Post:1 + arg3 <= arg4 - Process 6
22.74/22.77	* Exit transition: <l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ arg4 <= arg3 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	* Postcondition  : 1 + arg3 <= arg4
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.001594s
22.74/22.77	> Postcondition is not implied!
22.74/22.77	
22.74/22.77	LOG: RETURN check - Elapsed time: 0.001777s
22.74/22.77	Postcondition: arg4 <= 2 + arg3
22.74/22.77	
22.74/22.77	LOG: CALL check - Post:arg4 <= 2 + arg3 - Process 7
22.74/22.77	* Exit transition: <l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 + arg3 <= arg4 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	* Postcondition  : arg4 <= 2 + arg3
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.001232s
22.74/22.77	> Postcondition is not implied!
22.74/22.77	
22.74/22.77	LOG: RETURN check - Elapsed time: 0.001414s
22.74/22.77	
22.74/22.77	LOG: NarrowEntry size 1
22.74/22.77	
22.74/22.77	LOG: NarrowEntry size 1
22.74/22.77	INVARIANTS: 
22.74/22.77	2: 
22.74/22.77	Quasi-INVARIANTS to narrow Graph: 
22.74/22.77	2: 1 + arg3 <= arg4 , arg4 <= 2 + arg3 , 
22.74/22.77	Narrowing transition: 
22.74/22.77	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef5 /\ 1 <= undef21 /\ undef21 <= arg1 /\ undef21 <= arg2 /\ 0 <= arg4 /\ 3 + arg3 <= arg4 /\ 7 <= undef22, {arg1 -> undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}>
22.74/22.77	
22.74/22.77	LOG: Narrow transition size 2
22.74/22.77	ENTRIES:
22.74/22.77	<l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ arg4 <= arg3 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	<l0, l2, 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ 3 + arg3 <= arg4 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	END ENTRIES:
22.74/22.77	GRAPH:
22.74/22.77	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef5 /\ 1 <= undef21 /\ undef21 <= arg1 /\ undef21 <= arg2 /\ 0 <= arg4 /\ 3 + arg3 <= arg4 /\ 7 <= undef22, {arg1 -> undef21, arg2 -> undef22, arg3 -> 4 + arg3, rest remain the same}>
22.74/22.77	END GRAPH:
22.74/22.77	EXIT: <l2, l3, 1 <= arg1 /\ 1 <= arg2 /\ arg4 <= arg3 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
22.74/22.77	POST: arg1 <= 0
22.74/22.77	
22.74/22.77	
22.74/22.77	LOG: Try proving POST
22.74/22.77	Solving with 1 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001071s
22.74/22.77	Time used: 4.00101
22.74/22.77	Solving with 2 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003566s
22.74/22.77	Time used: 4.00072
22.74/22.77	Solving with 3 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005209s
22.74/22.77	Time used: 1.00029
22.74/22.77	
22.74/22.77	LOG: Postcondition is not implied - no solution
22.74/22.77	> Postcondition is not implied!
22.74/22.77	
22.74/22.77	LOG: RETURN check - Elapsed time: 17.496392s
22.74/22.77	INVARIANTS: 
22.74/22.77	3: 
22.74/22.77	Quasi-INVARIANTS to narrow Graph: 
22.74/22.77	3: arg1 <= 0 , 
22.74/22.77	Narrowing transition: 
22.74/22.77	<l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	
22.74/22.77	LOG: Narrow transition size 1
22.74/22.77	invGraph after Narrowing: 
22.74/22.77	Transitions:
22.74/22.77	<l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	Variables:
22.74/22.77	arg1, arg2, arg3, arg4
22.74/22.77	Checking conditional termination of SCC {l3}...
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.000885s
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.002708s
22.74/22.77	Trying to remove transition: <l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	Solving with 1 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007727s
22.74/22.77	Time used: 0.007572
22.74/22.77	Solving with 1 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011815s
22.74/22.77	Time used: 0.01112
22.74/22.77	Solving with 2 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001573s
22.74/22.77	Time used: 4.00055
22.74/22.77	Solving with 3 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004147s
22.74/22.77	Time used: 1.00004
22.74/22.77	Solving with 1 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014831s
22.74/22.77	Time used: 0.008882
22.74/22.77	
22.74/22.77	Proving non-termination of subgraph 2
22.74/22.77	Transitions:
22.74/22.77	<l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	Variables:
22.74/22.77	arg1, arg2, arg3, arg4
22.74/22.77	
22.74/22.77	Checking conditional non-termination of SCC {l3}...
22.74/22.77	EXIT TRANSITIONS:
22.74/22.77	<l3, end, arg1 <= 0, {all remain the same}>
22.74/22.77	
22.74/22.77	Solving with 1 template(s).
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetFirstSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024903s
22.74/22.77	Time used: 0.024649
22.74/22.77	Improving Solution with cost 1 ...
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinearGetNextSolution
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.044480s
22.74/22.77	Time used: 0.044475
22.74/22.77	
22.74/22.77	LOG: SAT solveNonLinear - Elapsed time: 0.069383s
22.74/22.77	Cost: 1; Total time: 0.069124
22.74/22.77	Failed at location 3: 1 <= arg1
22.74/22.77	Before Improving: 
22.74/22.77	Quasi-invariant at l3: 1 <= arg1
22.74/22.77	Optimizing invariants...
22.74/22.77	
22.74/22.77	LOG: CALL solveLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear - Elapsed time: 0.011410s
22.74/22.77	Remaining time after improvement: 0.998611
22.74/22.77	Minimizing number of undef constraints...
22.74/22.77	
22.74/22.77	LOG: CALL solveNonLinear
22.74/22.77	
22.74/22.77	LOG: RETURN solveNonLinear - Elapsed time: 0.002607s
22.74/22.77	Non-termination implied by a set of quasi-invariant(s):
22.74/22.77	Quasi-invariant at l3: 1 <= arg1
22.74/22.77	Constraint over undef '1 <= undef13' in transition:
22.74/22.77	<l3, l3, 1 <= arg1 /\ 0 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	
22.74/22.77	Strengthening and disabling EXIT transitions...
22.74/22.77	Closed exits from l3: 1
22.74/22.77	
22.74/22.77	Strengthening and disabling transitions...
22.74/22.77	
22.74/22.77	LOG: CALL solverLinear in Graph for feasibility
22.74/22.77	
22.74/22.77	LOG: RETURN solveLinear in Graph for feasibility
22.74/22.77	Strengthening transition (result): 
22.74/22.77	<l3, l3, 1 <= arg1 /\ 1 <= undef13, {arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}>
22.74/22.77	
22.74/22.77	Calling reachability with...
22.74/22.77	Transition: <l3, end, true, {all remain the same}>
22.74/22.77	Conditions: 1 <= arg1, 
22.74/22.77	OPEN EXITS: 
22.74/22.77	<l3, end, 1 <= arg1, {all remain the same}>
22.74/22.77	
22.74/22.77	--- Reachability graph ---
22.74/22.77	> Graph without transitions.
22.74/22.77	
22.74/22.77	Calling reachability with...
22.74/22.77	Transition: <l2, l3, 1 <= arg1 /\ 1 <= arg2 /\ arg4 <= arg3 /\ 0 <= undef5, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}>
22.74/22.77	Conditions: 1 <= arg1, 
22.74/22.77	OPEN EXITS: 
22.74/22.77	<l2, l3, 1 <= arg1 /\ 1 <= arg2 /\ arg4 <= arg3, {arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}> (condsUp: 0 <= undef5, 1 <= undef5)
22.74/22.77	
22.74/22.77	--- Reachability graph ---
22.74/22.77	> Graph without transitions.
22.74/22.77	
22.74/22.77	Calling reachability with...
22.74/22.77	Transition: <l0, l2, 1 <= undef1 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	Conditions: 1 <= arg1, 1 <= arg2, arg4 <= arg3, 0 <= undef5, 1 <= undef5, 
22.74/22.77	OPEN EXITS: 
22.74/22.77	<l0, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef1 /\ 1 <= undef5 /\ 1 <= undef25 /\ undef2 <= 1 + undef25 /\ arg4 <= arg3 /\ undef1 <= undef25 /\ 0 <= undef26 /\ 2 <= undef2 /\ arg3 = 1 /\ arg1 = undef1 /\ arg2 = undef2 /\ arg4 = undef26, {all remain the same}>
22.74/22.77	
22.74/22.77	> Conditions are reachable!
22.74/22.77	
22.74/22.77	Program does NOT terminate
22.74/22.77	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
22.74/22.77	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
22.74/22.77	EOF