12.82/12.83	NO
12.82/12.83	
12.82/12.83	Solver Timeout: 4
12.82/12.83	Global Timeout: 300
12.82/12.83	No parsing errors!
12.82/12.83	Init Location: 0
12.82/12.83	Transitions:
12.82/12.83	<l0, l4, true>
12.82/12.83	<l1, l2, (undef1 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> (arg2 - 1), arg4 -> 0, arg5 -> arg2}>
12.82/12.83	<l2, l2, (arg5 > ~(1)) /\ (arg3 > arg2) /\ (undef6 <= arg1) /\ (arg1 > 0) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 + 1), arg3 -> (arg5 - 1), arg4 -> undef9}>
12.82/12.83	<l2, l3, (arg3 <= arg2) /\ (arg4 > 0) /\ (undef12 > arg4) /\ (arg1 > 0), par{arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}>
12.82/12.83	<l2, l3, (arg1 > 0) /\ (arg3 <= arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}>
12.82/12.83	<l3, l3, (arg2 > ~(1)) /\ (undef26 > 0) /\ (undef26 < arg2) /\ (undef26 < undef22) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25}>
12.82/12.83	<l3, l3, (undef32 < arg2) /\ (arg2 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31}>
12.82/12.83	<l3, l3, (arg2 > ~(1)) /\ (undef38 > 0) /\ (undef38 < arg2) /\ (undef39 > undef38) /\ (undef40 > undef38) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}>
12.82/12.83	<l3, l3, (undef46 < arg2) /\ (arg2 > ~(1)) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45}>
12.82/12.83	<l4, l1, true, par{arg1 -> undef47, arg2 -> undef48, arg3 -> undef49, arg4 -> undef50, arg5 -> undef51}>
12.82/12.83	
12.82/12.83	Fresh variables:
12.82/12.83	undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 
12.82/12.83	
12.82/12.83	Undef variables:
12.82/12.83	undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 
12.82/12.83	
12.82/12.83	Abstraction variables:
12.82/12.83	
12.82/12.83	Exit nodes:
12.82/12.83	
12.82/12.83	Accepting locations:
12.82/12.83	
12.82/12.83	Asserts:
12.82/12.83	
12.82/12.83	Preprocessed LLVMGraph
12.82/12.83	Init Location: 0
12.82/12.83	Transitions:
12.82/12.83	<l0, l2, (arg1 = undef1) /\ (arg2 = 0) /\ (arg3 = (undef48 - 1)) /\ (arg4 = 0) /\ (arg5 = undef48) /\ (undef1 <= undef47) /\ (undef48 > ~(1)) /\ (undef47 > 0) /\ (undef1 > 0)>
12.82/12.83	<l2, l2, (arg5 > ~(1)) /\ (arg3 > arg2) /\ (undef6 <= arg1) /\ (arg1 > 0) /\ (undef6 > 0), par{arg1 -> undef6, arg2 -> (arg2 + 1), arg3 -> (arg5 - 1), arg4 -> undef9}>
12.82/12.83	<l2, l3, (arg3 <= arg2) /\ (arg4 > 0) /\ (undef12 > arg4) /\ (arg1 > 0), par{arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}>
12.82/12.83	<l2, l3, (arg1 > 0) /\ (arg3 <= arg2), par{arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}>
12.82/12.83	<l3, l3, (arg2 > ~(1)) /\ (undef26 > 0) /\ (undef26 < arg2) /\ (undef26 < undef22) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25}>
12.82/12.83	<l3, l3, (undef32 < arg2) /\ (arg2 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31}>
12.82/12.83	<l3, l3, (arg2 > ~(1)) /\ (undef38 > 0) /\ (undef38 < arg2) /\ (undef39 > undef38) /\ (undef40 > undef38) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}>
12.82/12.83	<l3, l3, (undef46 < arg2) /\ (arg2 > ~(1)) /\ (1 = arg1), par{arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45}>
12.82/12.83	
12.82/12.83	Fresh variables:
12.82/12.83	undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 
12.82/12.83	
12.82/12.83	Undef variables:
12.82/12.83	undef1, undef6, undef9, undef12, undef13, undef14, undef15, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef26, undef29, undef30, undef31, undef32, undef35, undef36, undef37, undef38, undef39, undef40, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, 
12.82/12.83	
12.82/12.83	Abstraction variables:
12.82/12.83	
12.82/12.83	Exit nodes:
12.82/12.83	
12.82/12.83	Accepting locations:
12.82/12.83	
12.82/12.83	Asserts:
12.82/12.83	
12.82/12.83	*************************************************************
12.82/12.83	*******************************************************************************************
12.82/12.83	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
12.82/12.83	*******************************************************************************************
12.82/12.83	
12.82/12.83	Init Location: 0
12.82/12.83	Graph 0:
12.82/12.83	Transitions:
12.82/12.83	Variables:
12.82/12.83	
12.82/12.83	Graph 1:
12.82/12.83	Transitions:
12.82/12.83	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef6 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	Variables:
12.82/12.83	arg1, arg2, arg3, arg4, arg5
12.82/12.83	
12.82/12.83	Graph 2:
12.82/12.83	Transitions:
12.82/12.83	<l3, l3, 1 + undef26 <= arg2 /\ 1 + undef26 <= undef22 /\ 1 <= undef26 /\ 0 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25, rest remain the same}>
12.82/12.83	<l3, l3, 1 + undef32 <= arg2 /\ 0 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31, rest remain the same}>
12.82/12.83	<l3, l3, 1 + undef38 <= arg2 /\ 1 + undef38 <= undef39 /\ 1 + undef38 <= undef40 /\ 1 <= undef38 /\ 0 <= arg2 /\ arg1 = 1, {arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37, rest remain the same}>
12.82/12.83	<l3, l3, 1 + undef46 <= arg2 /\ 0 <= arg2 /\ arg1 = 1, {arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45, rest remain the same}>
12.82/12.83	Variables:
12.82/12.83	arg1, arg2, arg3, arg4, arg5
12.82/12.83	
12.82/12.83	Precedence: 
12.82/12.83	Graph 0
12.82/12.83	
12.82/12.83	Graph 1
12.82/12.83	<l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	
12.82/12.83	Graph 2
12.82/12.83	<l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}>
12.82/12.83	<l2, l3, 1 <= arg1 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20, rest remain the same}>
12.82/12.83	
12.82/12.83	Map Locations to Subgraph:
12.82/12.83	( 0 , 0 )
12.82/12.83	( 2 , 1 )
12.82/12.83	( 3 , 2 )
12.82/12.83	
12.82/12.83	*******************************************************************************************
12.82/12.83	********************************    CHECKING ASSERTIONS    ********************************
12.82/12.83	*******************************************************************************************
12.82/12.83	
12.82/12.83	Proving termination of subgraph 0
12.82/12.83	Proving termination of subgraph 1
12.82/12.83	Checking unfeasibility...
12.82/12.83	Time used: 0.004907
12.82/12.83	
12.82/12.83	Checking conditional termination of SCC {l2}...
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.001015s
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.004143s
12.82/12.83	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef6 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015504s
12.82/12.83	Time used: 0.015295
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019277s
12.82/12.83	Time used: 0.018616
12.82/12.83	
12.82/12.83	LOG: SAT solveNonLinear - Elapsed time: 0.019277s
12.82/12.83	Cost: 0; Total time: 0.018616
12.82/12.83	Termination implied by a set of invariant(s):
12.82/12.83	Invariant at l2: 1 + arg3 <= arg5
12.82/12.83	[ Invariant Graph ]
12.82/12.83	Strengthening and disabling transitions...
12.82/12.83	
12.82/12.83	LOG: CALL solverLinear in Graph for feasibility
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear in Graph for feasibility
12.82/12.83	Strengthening transition (result): 
12.82/12.83	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 + arg3 <= arg5 /\ 1 <= undef6 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	[ Termination Graph ]
12.82/12.83	Strengthening and disabling transitions...
12.82/12.83	
12.82/12.83	LOG: CALL solverLinear in Graph for feasibility
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear in Graph for feasibility
12.82/12.83	Strengthening transition (result): 
12.82/12.83	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 + arg3 <= arg5 /\ 1 <= undef6 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	Ranking function: -arg2 + arg5
12.82/12.83	New Graphs: 
12.82/12.83	INVARIANTS: 
12.82/12.83	2: 1 + arg3 <= arg5 , 
12.82/12.83	Quasi-INVARIANTS to narrow Graph: 
12.82/12.83	2: 
12.82/12.83	Proving termination of subgraph 2
12.82/12.83	Checking unfeasibility...
12.82/12.83	Time used: 0.07612
12.82/12.83	
12.82/12.83	Checking conditional termination of SCC {l3}...
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.004209s
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.069683s
12.82/12.83	Trying to remove transition: <l3, l3, 1 + undef46 <= arg2 /\ 0 <= arg2 /\ arg1 = 1, {arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45, rest remain the same}>
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.182689s
12.82/12.83	Time used: 0.181807
12.82/12.83	Trying to remove transition: <l3, l3, 1 + undef38 <= arg2 /\ 1 + undef38 <= undef39 /\ 1 + undef38 <= undef40 /\ 1 <= undef38 /\ 0 <= arg2 /\ arg1 = 1, {arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37, rest remain the same}>
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.187072s
12.82/12.83	Time used: 0.181997
12.82/12.83	Trying to remove transition: <l3, l3, 1 + undef32 <= arg2 /\ 0 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31, rest remain the same}>
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.102582s
12.82/12.83	Time used: 0.097279
12.82/12.83	Trying to remove transition: <l3, l3, 1 + undef26 <= arg2 /\ 1 + undef26 <= undef22 /\ 1 <= undef26 /\ 0 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25, rest remain the same}>
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.118223s
12.82/12.83	Time used: 0.113048
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.763802s
12.82/12.83	Time used: 0.758249
12.82/12.83	Solving with 2 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014872s
12.82/12.83	Time used: 4.00023
12.82/12.83	Solving with 3 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006482s
12.82/12.83	Time used: 1.00002
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.491568s
12.82/12.83	Time used: 0.484161
12.82/12.83	Termination failed. Trying to show unreachability...
12.82/12.83	Proving unreachability of entry: <l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}>
12.82/12.83	
12.82/12.83	LOG: CALL check - Post:1 <= 0 - Process 1
12.82/12.83	* Exit transition: <l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}>
12.82/12.83	* Postcondition  : 1 <= 0
12.82/12.83	Postcodition moved up: 1 <= 0
12.82/12.83	
12.82/12.83	LOG: Try proving POST
12.82/12.83	Postcondition: 1 <= 0
12.82/12.83	
12.82/12.83	LOG: CALL check - Post:1 <= 0 - Process 2
12.82/12.83	* Exit transition: <l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	* Postcondition  : 1 <= 0
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.001916s
12.82/12.83	> Postcondition is not implied!
12.82/12.83	
12.82/12.83	LOG: RETURN check - Elapsed time: 0.002124s
12.82/12.83	
12.82/12.83	LOG: NarrowEntry size 1
12.82/12.83	Narrowing transition: 
12.82/12.83	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef6 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	
12.82/12.83	LOG: Narrow transition size 1
12.82/12.83	ENTRIES:
12.82/12.83	<l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ 0 <= 0 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	END ENTRIES:
12.82/12.83	GRAPH:
12.82/12.83	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef6 /\ 0 <= 0 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	END GRAPH:
12.82/12.83	EXIT: <l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}>
12.82/12.83	POST: 1 <= 0
12.82/12.83	
12.82/12.83	
12.82/12.83	LOG: Try proving POST
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026617s
12.82/12.83	Time used: 0.026409
12.82/12.83	Improving Solution with cost 51 ...
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetNextSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.041529s
12.82/12.83	Time used: 0.041519
12.82/12.83	
12.82/12.83	LOG: SAT solveNonLinear - Elapsed time: 0.068146s
12.82/12.83	Cost: 51; Total time: 0.067928
12.82/12.83	Failed at location 2: 1 + arg3 <= arg2
12.82/12.83	Before Improving: 
12.82/12.83	Quasi-invariant at l2: 1 + arg3 <= arg2
12.82/12.83	Optimizing invariants...
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.002807s
12.82/12.83	Remaining time after improvement: 0.998462
12.82/12.83	Some transition disabled by a set of quasi-invariant(s):
12.82/12.83	Quasi-invariant at l2: 1 + arg3 <= arg2
12.82/12.83	
12.82/12.83	LOG: NEXT CALL check - disable
12.82/12.83	
12.82/12.83	LOG: CALL check - Post:1 + arg3 <= arg2 - Process 3
12.82/12.83	* Exit transition: <l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ 0 <= 0 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	* Postcondition  : 1 + arg3 <= arg2
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.002260s
12.82/12.83	> Postcondition is not implied!
12.82/12.83	
12.82/12.83	LOG: RETURN check - Elapsed time: 0.002422s
12.82/12.83	Solving with 2 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.092126s
12.82/12.83	Time used: 0.091812
12.82/12.83	Improving Solution with cost 1 ...
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetNextSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.127884s
12.82/12.83	Time used: 0.127702
12.82/12.83	
12.82/12.83	LOG: SAT solveNonLinear - Elapsed time: 0.220009s
12.82/12.83	Cost: 1; Total time: 0.219514
12.82/12.83	Failed at location 2: arg1 + arg3 <= arg2
12.82/12.83	Before Improving: 
12.82/12.83	Quasi-invariant at l2: arg1 + arg3 <= arg2
12.82/12.83	Quasi-invariant at l2: arg2 + arg4 <= arg1 + arg3
12.82/12.83	Optimizing invariants...
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.007475s
12.82/12.83	Remaining time after improvement: 0.997622
12.82/12.83	Postcondition implied by a set of quasi-invariant(s):
12.82/12.83	Quasi-invariant at l2: arg1 + arg3 <= arg2
12.82/12.83	Quasi-invariant at l2: arg2 + arg4 <= arg1 + arg3
12.82/12.83	Postcondition: arg1 + arg3 <= arg2
12.82/12.83	
12.82/12.83	LOG: CALL check - Post:arg1 + arg3 <= arg2 - Process 4
12.82/12.83	* Exit transition: <l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ 0 <= 0 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	* Postcondition  : arg1 + arg3 <= arg2
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.002408s
12.82/12.83	> Postcondition is not implied!
12.82/12.83	
12.82/12.83	LOG: RETURN check - Elapsed time: 0.002578s
12.82/12.83	
12.82/12.83	LOG: NarrowEntry size 1
12.82/12.83	INVARIANTS: 
12.82/12.83	2: 
12.82/12.83	Quasi-INVARIANTS to narrow Graph: 
12.82/12.83	2: arg1 + arg3 <= arg2 , arg2 + arg4 <= arg1 + arg3 , 
12.82/12.83	Narrowing transition: 
12.82/12.83	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg3 /\ 1 <= undef6 /\ 0 <= 0 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	
12.82/12.83	LOG: Narrow transition size 2
12.82/12.83	ENTRIES:
12.82/12.83	<l0, l2, 1 + arg2 <= arg1 + arg3 /\ 1 <= undef1 /\ 1 <= undef47 /\ 0 <= 0 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	END ENTRIES:
12.82/12.83	GRAPH:
12.82/12.83	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 + arg3 /\ 1 + arg2 <= arg3 /\ 1 <= undef6 /\ 0 <= 0 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	END GRAPH:
12.82/12.83	EXIT: <l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}>
12.82/12.83	POST: 1 <= 0
12.82/12.83	
12.82/12.83	
12.82/12.83	LOG: Try proving POST
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021069s
12.82/12.83	Time used: 0.020962
12.82/12.83	Solving with 2 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.063608s
12.82/12.83	Time used: 0.062713
12.82/12.83	Improving Solution with cost 1 ...
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetNextSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.127548s
12.82/12.83	Time used: 0.12753
12.82/12.83	
12.82/12.83	LOG: SAT solveNonLinear - Elapsed time: 0.191156s
12.82/12.83	Cost: 1; Total time: 0.190243
12.82/12.83	Failed at location 2: arg3 <= arg2
12.82/12.83	Before Improving: 
12.82/12.83	Quasi-invariant at l2: arg3 <= arg2
12.82/12.83	Quasi-invariant at l2: arg4 <= 0
12.82/12.83	Optimizing invariants...
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.008155s
12.82/12.83	Remaining time after improvement: 0.997076
12.82/12.83	Postcondition implied by a set of quasi-invariant(s):
12.82/12.83	Quasi-invariant at l2: arg3 <= arg2
12.82/12.83	Quasi-invariant at l2: arg4 <= 0
12.82/12.83	Postcondition: arg3 <= arg2
12.82/12.83	
12.82/12.83	LOG: CALL check - Post:arg3 <= arg2 - Process 5
12.82/12.83	* Exit transition: <l0, l2, 1 + arg2 <= arg1 + arg3 /\ 1 <= undef1 /\ 1 <= undef47 /\ 0 <= 0 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	* Postcondition  : arg3 <= arg2
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.002056s
12.82/12.83	> Postcondition is not implied!
12.82/12.83	
12.82/12.83	LOG: RETURN check - Elapsed time: 0.002227s
12.82/12.83	
12.82/12.83	LOG: NarrowEntry size 1
12.82/12.83	INVARIANTS: 
12.82/12.83	2: 
12.82/12.83	Quasi-INVARIANTS to narrow Graph: 
12.82/12.83	2: arg3 <= arg2 , arg4 <= 0 , 
12.82/12.83	Narrowing transition: 
12.82/12.83	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 + arg3 /\ 1 + arg2 <= arg3 /\ 1 <= undef6 /\ 0 <= 0 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	
12.82/12.83	LOG: Narrow transition size 2
12.82/12.83	ENTRIES:
12.82/12.83	<l0, l2, 1 + arg2 <= arg1 + arg3 /\ 1 + arg2 <= arg3 /\ 1 <= undef1 /\ 1 <= undef47 /\ 0 <= 0 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	END ENTRIES:
12.82/12.83	GRAPH:
12.82/12.83	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 + arg3 /\ 1 + arg2 <= arg3 /\ 1 <= undef6 /\ 0 <= 0 /\ undef6 <= arg1 /\ 0 <= arg5, {arg1 -> undef6, arg2 -> 1 + arg2, arg3 -> -1 + arg5, arg4 -> undef9, rest remain the same}>
12.82/12.83	END GRAPH:
12.82/12.83	EXIT: <l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}>
12.82/12.83	POST: 1 <= 0
12.82/12.83	
12.82/12.83	
12.82/12.83	LOG: Try proving POST
12.82/12.83	Solving with 1 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023940s
12.82/12.83	Time used: 0.023833
12.82/12.83	Solving with 2 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002832s
12.82/12.83	Time used: 4.00144
12.82/12.83	Solving with 3 template(s).
12.82/12.83	
12.82/12.83	LOG: CALL solveNonLinearGetFirstSolution
12.82/12.83	
12.82/12.83	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003652s
12.82/12.83	Time used: 1.00024
12.82/12.83	
12.82/12.83	LOG: Postcondition is not implied - no solution
12.82/12.83	> Postcondition is not implied!
12.82/12.83	
12.82/12.83	LOG: RETURN check - Elapsed time: 5.604202s
12.82/12.83	Cannot prove unreachability
12.82/12.83	
12.82/12.83	Proving non-termination of subgraph 2
12.82/12.83	Transitions:
12.82/12.83	<l3, l3, 1 + undef26 <= arg2 /\ 1 + undef26 <= undef22 /\ 1 <= undef26 /\ 0 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, arg5 -> undef25, rest remain the same}>
12.82/12.83	<l3, l3, 1 + undef32 <= arg2 /\ 0 <= arg2 /\ arg1 = 0, {arg1 -> 1, arg2 -> 1, arg3 -> undef29, arg4 -> undef30, arg5 -> undef31, rest remain the same}>
12.82/12.83	<l3, l3, 1 + undef38 <= arg2 /\ 1 + undef38 <= undef39 /\ 1 + undef38 <= undef40 /\ 1 <= undef38 /\ 0 <= arg2 /\ arg1 = 1, {arg1 -> 0, arg2 -> 0, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37, rest remain the same}>
12.82/12.83	<l3, l3, 1 + undef46 <= arg2 /\ 0 <= arg2 /\ arg1 = 1, {arg1 -> 0, arg2 -> 2, arg3 -> undef43, arg4 -> undef44, arg5 -> undef45, rest remain the same}>
12.82/12.83	Variables:
12.82/12.83	arg1, arg2, arg3, arg4, arg5
12.82/12.83	
12.82/12.83	Checking that every undef value has an assignment...
12.82/12.83	
12.82/12.83	LOG: CALL solveLinear
12.82/12.83	
12.82/12.83	LOG: RETURN solveLinear - Elapsed time: 0.002542s
12.82/12.83	Checking conditional non-termination of SCC {l3}...
12.82/12.83	> No assignment for some undef value.
12.82/12.83	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
12.82/12.83	Calling reachability with...
12.82/12.83	Transition: <l3, end, true, {all remain the same}>
12.82/12.83	Conditions: 0 <= arg2, arg1 <= 1, 0 <= arg1, 
12.82/12.83	Transition: <l3, end, true, {all remain the same}>
12.82/12.83	Conditions: 0 <= arg2, arg1 <= 1, 0 <= arg1, 
12.82/12.83	OPEN EXITS: 
12.82/12.83	<l3, end, arg1 <= 1 /\ 0 <= arg1 /\ 0 <= arg2, {all remain the same}>
12.82/12.83	<l3, end, arg1 <= 1 /\ 0 <= arg1 /\ 0 <= arg2, {all remain the same}>
12.82/12.83	
12.82/12.83	--- Reachability graph ---
12.82/12.83	> Graph without transitions.
12.82/12.83	
12.82/12.83	Calling reachability with...
12.82/12.83	Transition: <l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}>
12.82/12.83	Conditions: arg1 <= 1, 0 <= arg1, 0 <= arg2, 
12.82/12.83	Transition: <l2, l3, 1 <= arg1 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20, rest remain the same}>
12.82/12.83	Conditions: arg1 <= 1, 0 <= arg1, 0 <= arg2, 
12.82/12.83	Transition: <l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}>
12.82/12.83	Conditions: arg1 <= 1, 0 <= arg1, 0 <= arg2, 
12.82/12.83	Transition: <l2, l3, 1 <= arg1 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20, rest remain the same}>
12.82/12.83	Conditions: arg1 <= 1, 0 <= arg1, 0 <= arg2, 
12.82/12.83	OPEN EXITS: 
12.82/12.83	<l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> (condsUp: 0 <= 1, 0 <= 1, 0 <= undef12)
12.82/12.83	<l2, l3, 1 <= arg1 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20, rest remain the same}> (condsUp: 0 <= 1, 0 <= 1, 0 <= 1)
12.82/12.83	<l2, l3, 1 <= arg1 /\ 1 + arg4 <= undef12 /\ 1 <= arg4 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> (condsUp: 0 <= 1, 0 <= 1, 0 <= undef12)
12.82/12.83	<l2, l3, 1 <= arg1 /\ arg3 <= arg2, {arg1 -> 1, arg2 -> 1, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20, rest remain the same}> (condsUp: 0 <= 1, 0 <= 1, 0 <= 1)
12.82/12.83	
12.82/12.83	--- Reachability graph ---
12.82/12.83	> Graph without transitions.
12.82/12.83	
12.82/12.83	Calling reachability with...
12.82/12.83	Transition: <l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	Conditions: 1 <= arg1, 1 + arg4 <= undef12, 1 <= arg4, arg3 <= arg2, 0 <= 1, 0 <= 1, 0 <= undef12, 
12.82/12.83	Transition: <l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	Conditions: 1 <= arg1, arg3 <= arg2, 0 <= 1, 0 <= 1, 0 <= 1, 
12.82/12.83	Transition: <l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	Conditions: 1 <= arg1, 1 + arg4 <= undef12, 1 <= arg4, arg3 <= arg2, 0 <= 1, 0 <= 1, 0 <= undef12, 
12.82/12.83	Transition: <l0, l2, 1 <= undef1 /\ 1 <= undef47 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	Conditions: 1 <= arg1, arg3 <= arg2, 0 <= 1, 0 <= 1, 0 <= 1, 
12.82/12.83	OPEN EXITS: 
12.82/12.83	<l0, l2, 1 <= arg1 /\ 1 <= undef1 /\ 1 <= undef47 /\ arg3 <= arg2 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	<l0, l2, 1 <= arg1 /\ 1 <= undef1 /\ 1 <= undef47 /\ arg3 <= arg2 /\ undef1 <= undef47 /\ 0 <= undef48 /\ 1 + arg3 = undef48 /\ arg1 = undef1 /\ arg2 = 0 /\ arg4 = 0 /\ arg5 = undef48, {all remain the same}>
12.82/12.83	
12.82/12.83	> Conditions are reachable!
12.82/12.83	
12.82/12.83	Program does NOT terminate
12.82/12.83	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
12.82/12.83	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
12.82/12.83	EOF