23.26/23.30	NO
23.26/23.30	
23.26/23.30	Solver Timeout: 4
23.26/23.30	Global Timeout: 300
23.26/23.30	No parsing errors!
23.26/23.30	Init Location: 0
23.26/23.30	Transitions:
23.26/23.30	<l0, l3, true>
23.26/23.30	<l1, l2, (undef1 > ~(1)) /\ (arg2 > 1) /\ (undef2 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}>
23.26/23.30	<l2, l2, (arg1 > 0) /\ (arg1 = arg2), par{arg2 -> (arg1 - 1)}>
23.26/23.30	<l2, l2, (arg2 > 0) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> arg2}>
23.26/23.30	<l2, l2, (arg2 < arg1) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}>
23.26/23.30	<l3, l1, true, par{arg1 -> undef9, arg2 -> undef10}>
23.26/23.30	
23.26/23.30	Fresh variables:
23.26/23.30	undef1, undef2, undef9, undef10, 
23.26/23.30	
23.26/23.30	Undef variables:
23.26/23.30	undef1, undef2, undef9, undef10, 
23.26/23.30	
23.26/23.30	Abstraction variables:
23.26/23.30	
23.26/23.30	Exit nodes:
23.26/23.30	
23.26/23.30	Accepting locations:
23.26/23.30	
23.26/23.30	Asserts:
23.26/23.30	
23.26/23.30	Preprocessed LLVMGraph
23.26/23.30	Init Location: 0
23.26/23.30	Transitions:
23.26/23.30	<l0, l2, (arg1 = undef1) /\ (arg2 = undef2) /\ (undef1 > ~(1)) /\ (undef10 > 1) /\ (undef2 > ~(1)) /\ (undef9 > 0)>
23.26/23.30	<l2, l2, (arg1 > 0) /\ (arg1 = arg2), par{arg2 -> (arg1 - 1)}>
23.26/23.30	<l2, l2, (arg2 > 0) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> arg2}>
23.26/23.30	<l2, l2, (arg2 < arg1) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> arg2, arg2 -> arg1}>
23.26/23.30	
23.26/23.30	Fresh variables:
23.26/23.30	undef1, undef2, undef9, undef10, 
23.26/23.30	
23.26/23.30	Undef variables:
23.26/23.30	undef1, undef2, undef9, undef10, 
23.26/23.30	
23.26/23.30	Abstraction variables:
23.26/23.30	
23.26/23.30	Exit nodes:
23.26/23.30	
23.26/23.30	Accepting locations:
23.26/23.30	
23.26/23.30	Asserts:
23.26/23.30	
23.26/23.30	*************************************************************
23.26/23.30	*******************************************************************************************
23.26/23.30	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
23.26/23.30	*******************************************************************************************
23.26/23.30	
23.26/23.30	Init Location: 0
23.26/23.30	Graph 0:
23.26/23.30	Transitions:
23.26/23.30	Variables:
23.26/23.30	
23.26/23.30	Graph 1:
23.26/23.30	Transitions:
23.26/23.30	<l2, l2, 1 <= arg1 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	Variables:
23.26/23.30	arg1, arg2
23.26/23.30	
23.26/23.30	Precedence: 
23.26/23.30	Graph 0
23.26/23.30	
23.26/23.30	Graph 1
23.26/23.30	<l0, l2, 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	
23.26/23.30	Map Locations to Subgraph:
23.26/23.30	( 0 , 0 )
23.26/23.30	( 2 , 1 )
23.26/23.30	
23.26/23.30	*******************************************************************************************
23.26/23.30	********************************    CHECKING ASSERTIONS    ********************************
23.26/23.30	*******************************************************************************************
23.26/23.30	
23.26/23.30	Proving termination of subgraph 0
23.26/23.30	Proving termination of subgraph 1
23.26/23.30	Checking unfeasibility...
23.26/23.30	Time used: 0.006505
23.26/23.30	
23.26/23.30	Checking conditional termination of SCC {l2}...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.001433s
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.034882s
23.26/23.30	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015942s
23.26/23.30	Time used: 0.015541
23.26/23.30	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016706s
23.26/23.30	Time used: 0.016004
23.26/23.30	Trying to remove transition: <l2, l2, 1 <= arg1 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018775s
23.26/23.30	Time used: 0.018095
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028100s
23.26/23.30	Time used: 0.027219
23.26/23.30	Improving Solution with cost 1 ...
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetNextSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.076183s
23.26/23.30	Time used: 0.076176
23.26/23.30	
23.26/23.30	LOG: SAT solveNonLinear - Elapsed time: 0.104284s
23.26/23.30	Cost: 1; Total time: 0.103395
23.26/23.30	Failed at location 2: arg2 <= 0
23.26/23.30	Before Improving: 
23.26/23.30	Quasi-invariant at l2: arg2 <= 0
23.26/23.30	Optimizing invariants...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.008875s
23.26/23.30	Remaining time after improvement: 0.997496
23.26/23.30	Termination implied by a set of quasi-invariant(s):
23.26/23.30	Quasi-invariant at l2: arg2 <= 0
23.26/23.30	[ Invariant Graph ]
23.26/23.30	Strengthening and disabling transitions...
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	[ Termination Graph ]
23.26/23.30	Strengthening and disabling transitions...
23.26/23.30	> It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	> It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	New Graphs: 
23.26/23.30	Calling Safety with literal arg2 <= 0 and entry <l0, l2, 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL check - Post:arg2 <= 0 - Process 1
23.26/23.30	* Exit transition: <l0, l2, 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	* Postcondition  : arg2 <= 0
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.000818s
23.26/23.30	> Postcondition is not implied!
23.26/23.30	
23.26/23.30	LOG: RETURN check - Elapsed time: 0.000931s
23.26/23.30	INVARIANTS: 
23.26/23.30	2: 
23.26/23.30	Quasi-INVARIANTS to narrow Graph: 
23.26/23.30	2: arg2 <= 0 , 
23.26/23.30	Narrowing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: Narrow transition size 1
23.26/23.30	Narrowing transition: 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: Narrow transition size 1
23.26/23.30	Narrowing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: Narrow transition size 1
23.26/23.30	invGraph after Narrowing: 
23.26/23.30	Transitions:
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	Variables:
23.26/23.30	arg1, arg2
23.26/23.30	Checking conditional termination of SCC {l2}...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.001392s
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.038958s
23.26/23.30	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014762s
23.26/23.30	Time used: 0.014258
23.26/23.30	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017941s
23.26/23.30	Time used: 0.017181
23.26/23.30	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017812s
23.26/23.30	Time used: 0.017052
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028958s
23.26/23.30	Time used: 0.028006
23.26/23.30	Improving Solution with cost 1 ...
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetNextSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091068s
23.26/23.30	Time used: 0.09106
23.26/23.30	
23.26/23.30	LOG: SAT solveNonLinear - Elapsed time: 0.120026s
23.26/23.30	Cost: 1; Total time: 0.119066
23.26/23.30	Failed at location 2: arg1 <= 0
23.26/23.30	Before Improving: 
23.26/23.30	Quasi-invariant at l2: arg1 <= 0
23.26/23.30	Optimizing invariants...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.009228s
23.26/23.30	Remaining time after improvement: 0.997185
23.26/23.30	Termination implied by a set of quasi-invariant(s):
23.26/23.30	Quasi-invariant at l2: arg1 <= 0
23.26/23.30	[ Invariant Graph ]
23.26/23.30	Strengthening and disabling transitions...
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	[ Termination Graph ]
23.26/23.30	Strengthening and disabling transitions...
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	New Graphs: 
23.26/23.30	Calling Safety with literal arg1 <= 0 and entry <l0, l2, 1 <= arg2 /\ 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL check - Post:arg1 <= 0 - Process 2
23.26/23.30	* Exit transition: <l0, l2, 1 <= arg2 /\ 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	* Postcondition  : arg1 <= 0
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.000881s
23.26/23.30	> Postcondition is not implied!
23.26/23.30	
23.26/23.30	LOG: RETURN check - Elapsed time: 0.000998s
23.26/23.30	INVARIANTS: 
23.26/23.30	2: 
23.26/23.30	Quasi-INVARIANTS to narrow Graph: 
23.26/23.30	2: arg1 <= 0 , 
23.26/23.30	Narrowing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: Narrow transition size 1
23.26/23.30	Narrowing transition: 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: Narrow transition size 1
23.26/23.30	Narrowing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: Narrow transition size 1
23.26/23.30	invGraph after Narrowing: 
23.26/23.30	Transitions:
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	Variables:
23.26/23.30	arg1, arg2
23.26/23.30	Checking conditional termination of SCC {l2}...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.001434s
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.038848s
23.26/23.30	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014915s
23.26/23.30	Time used: 0.014396
23.26/23.30	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018020s
23.26/23.30	Time used: 0.017231
23.26/23.30	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017874s
23.26/23.30	Time used: 0.017092
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078171s
23.26/23.30	Time used: 0.077249
23.26/23.30	Improving Solution with cost 1 ...
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetNextSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.092911s
23.26/23.30	Time used: 0.092903
23.26/23.30	
23.26/23.30	LOG: SAT solveNonLinear - Elapsed time: 0.171082s
23.26/23.30	Cost: 1; Total time: 0.170152
23.26/23.30	Failed at location 2: arg1 + arg2 <= 2
23.26/23.30	Before Improving: 
23.26/23.30	Quasi-invariant at l2: arg1 + arg2 <= 2
23.26/23.30	Optimizing invariants...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.009588s
23.26/23.30	Remaining time after improvement: 0.997219
23.26/23.30	Termination implied by a set of quasi-invariant(s):
23.26/23.30	Quasi-invariant at l2: arg1 + arg2 <= 2
23.26/23.30	[ Invariant Graph ]
23.26/23.30	Strengthening and disabling transitions...
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	Strengthening transition (result): 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 + arg2 <= 2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	[ Termination Graph ]
23.26/23.30	Strengthening and disabling transitions...
23.26/23.30	> It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	Strengthening transition (result): 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 + arg2 <= 2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	It's unfeasible. Removing transition: 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	New Graphs: 
23.26/23.30	Transitions:
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 + arg2 <= 2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	Variables:
23.26/23.30	arg1, arg2
23.26/23.30	Checking conditional termination of SCC {l2}...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.000997s
23.26/23.30	Ranking function: -arg1 + arg2
23.26/23.30	New Graphs: 
23.26/23.30	Calling Safety with literal arg1 + arg2 <= 2 and entry <l0, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL check - Post:arg1 + arg2 <= 2 - Process 3
23.26/23.30	* Exit transition: <l0, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	* Postcondition  : arg1 + arg2 <= 2
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.000819s
23.26/23.30	> Postcondition is not implied!
23.26/23.30	
23.26/23.30	LOG: RETURN check - Elapsed time: 0.000955s
23.26/23.30	INVARIANTS: 
23.26/23.30	2: 
23.26/23.30	Quasi-INVARIANTS to narrow Graph: 
23.26/23.30	2: arg1 + arg2 <= 2 , 
23.26/23.30	Narrowing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: Narrow transition size 1
23.26/23.30	Narrowing transition: 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: Narrow transition size 1
23.26/23.30	Narrowing transition: 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: Narrow transition size 1
23.26/23.30	invGraph after Narrowing: 
23.26/23.30	Transitions:
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	Variables:
23.26/23.30	arg1, arg2
23.26/23.30	Checking conditional termination of SCC {l2}...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.001721s
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.052724s
23.26/23.30	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016702s
23.26/23.30	Time used: 0.01611
23.26/23.30	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022891s
23.26/23.30	Time used: 0.022062
23.26/23.30	Trying to remove transition: <l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021538s
23.26/23.30	Time used: 0.020718
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.123247s
23.26/23.30	Time used: 0.122428
23.26/23.30	Solving with 2 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003428s
23.26/23.30	Time used: 4.00079
23.26/23.30	Solving with 3 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008473s
23.26/23.30	Time used: 1.0001
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050348s
23.26/23.30	Time used: 0.037441
23.26/23.30	
23.26/23.30	Proving non-termination of subgraph 1
23.26/23.30	Transitions:
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	Variables:
23.26/23.30	arg1, arg2
23.26/23.30	
23.26/23.30	Checking conditional non-termination of SCC {l2}...
23.26/23.30	EXIT TRANSITIONS:
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ arg1 + arg2 <= 2 /\ arg1 = arg2, {all remain the same}>
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ arg2 <= 0, {all remain the same}>
23.26/23.30	<l2, end, 1 + arg1 <= arg2 /\ 1 <= arg2 /\ arg1 <= 0, {all remain the same}>
23.26/23.30	<l2, end, 1 + arg2 <= arg1 /\ arg1 <= 0 /\ arg2 <= 0 /\ arg1 + arg2 <= 2, {all remain the same}>
23.26/23.30	<l2, end, arg1 <= 0 /\ arg1 <= arg2 /\ arg2 <= 0 /\ arg1 + arg2 <= 2, {all remain the same}>
23.26/23.30	
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017961s
23.26/23.30	Time used: 0.01766
23.26/23.30	Improving Solution with cost 4 ...
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetNextSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.022307s
23.26/23.30	Time used: 1.01561
23.26/23.30	
23.26/23.30	LOG: SAT solveNonLinear - Elapsed time: 1.040267s
23.26/23.30	Cost: 4; Total time: 1.03327
23.26/23.30	Failed at location 2: 1 <= arg1
23.26/23.30	Before Improving: 
23.26/23.30	Quasi-invariant at l2: 1 <= arg1
23.26/23.30	Optimizing invariants...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.007652s
23.26/23.30	Remaining time after improvement: 0.997741
23.26/23.30	Non-termination implied by a set of quasi-invariant(s):
23.26/23.30	Quasi-invariant at l2: 1 <= arg1
23.26/23.30	
23.26/23.30	Strengthening and disabling EXIT transitions...
23.26/23.30	Closed exits from l2: 3
23.26/23.30	Strengthening exit transition (result): 
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ arg1 + arg2 <= 2 /\ arg1 = arg2, {all remain the same}>
23.26/23.30	Strengthening exit transition (result): 
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ arg2 <= 0, {all remain the same}>
23.26/23.30	
23.26/23.30	Strengthening and disabling transitions...
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	Strengthening transition (result): 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	Strengthening transition (result): 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	Strengthening transition (result): 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	Checking conditional non-termination of SCC {l2}...
23.26/23.30	EXIT TRANSITIONS:
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ arg1 + arg2 <= 2 /\ arg1 = arg2, {all remain the same}>
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ arg2 <= 0, {all remain the same}>
23.26/23.30	
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015419s
23.26/23.30	Time used: 0.015166
23.26/23.30	Improving Solution with cost 2 ...
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetNextSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000789s
23.26/23.30	Time used: 1.00075
23.26/23.30	
23.26/23.30	LOG: SAT solveNonLinear - Elapsed time: 1.016207s
23.26/23.30	Cost: 2; Total time: 1.01591
23.26/23.30	Failed at location 2: 1 <= arg2
23.26/23.30	Before Improving: 
23.26/23.30	Quasi-invariant at l2: 1 <= arg2
23.26/23.30	Optimizing invariants...
23.26/23.30	
23.26/23.30	LOG: CALL solveLinear
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear - Elapsed time: 0.006051s
23.26/23.30	Remaining time after improvement: 0.997573
23.26/23.30	Non-termination implied by a set of quasi-invariant(s):
23.26/23.30	Quasi-invariant at l2: 1 <= arg2
23.26/23.30	
23.26/23.30	Strengthening and disabling EXIT transitions...
23.26/23.30	Closed exits from l2: 1
23.26/23.30	Strengthening exit transition (result): 
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ arg1 + arg2 <= 2 /\ arg1 = arg2, {all remain the same}>
23.26/23.30	
23.26/23.30	Strengthening and disabling transitions...
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	Strengthening transition (result): 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2 /\ arg1 = arg2, {arg2 -> -1 + arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	Strengthening transition (result): 
23.26/23.30	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, rest remain the same}>
23.26/23.30	
23.26/23.30	LOG: CALL solverLinear in Graph for feasibility
23.26/23.30	
23.26/23.30	LOG: RETURN solveLinear in Graph for feasibility
23.26/23.30	Strengthening transition (result): 
23.26/23.30	<l2, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {arg1 -> arg2, arg2 -> arg1, rest remain the same}>
23.26/23.30	
23.26/23.30	Checking conditional non-termination of SCC {l2}...
23.26/23.30	EXIT TRANSITIONS:
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ arg1 + arg2 <= 2 /\ arg1 = arg2, {all remain the same}>
23.26/23.30	
23.26/23.30	Solving with 1 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002933s
23.26/23.30	Time used: 5.00211
23.26/23.30	Solving with 2 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.041724s
23.26/23.30	Time used: 5.00105
23.26/23.30	Solving with 3 template(s).
23.26/23.30	
23.26/23.30	LOG: CALL solveNonLinearGetFirstSolution
23.26/23.30	
23.26/23.30	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005982s
23.26/23.30	Time used: 5.00079
23.26/23.30	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
23.26/23.30	Calling reachability with...
23.26/23.30	Transition: <l2, end, true, {all remain the same}>
23.26/23.30	Conditions: 1 <= arg1, 1 <= arg2, 3 <= arg1 + arg2, 1 + arg2 <= arg1, arg2 <= arg1, 
23.26/23.30	Transition: <l2, end, true, {all remain the same}>
23.26/23.30	Conditions: 1 <= arg1, 1 <= arg2, 3 <= arg1 + arg2, arg1 <= arg2, 
23.26/23.30	OPEN EXITS: 
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 3 <= arg1 + arg2, {all remain the same}>
23.26/23.30	<l2, end, 1 <= arg1 /\ 1 <= arg2 /\ arg1 <= arg2 /\ 3 <= arg1 + arg2, {all remain the same}>
23.26/23.30	
23.26/23.30	--- Reachability graph ---
23.26/23.30	> Graph without transitions.
23.26/23.30	
23.26/23.30	Calling reachability with...
23.26/23.30	Transition: <l0, l2, 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	Conditions: 1 <= arg1, 1 + arg2 <= arg1, 1 <= arg2, 3 <= arg1 + arg2, 
23.26/23.30	Transition: <l0, l2, 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	Conditions: 1 <= arg1, 1 <= arg2, arg1 <= arg2, 3 <= arg1 + arg2, 
23.26/23.30	OPEN EXITS: 
23.26/23.30	<l0, l2, 1 <= arg1 /\ 1 + arg2 <= arg1 /\ 1 <= arg2 /\ 1 <= undef9 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ 3 <= arg1 + arg2 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	<l0, l2, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= undef9 /\ arg1 <= arg2 /\ 0 <= undef1 /\ 0 <= undef2 /\ 2 <= undef10 /\ 3 <= arg1 + arg2 /\ arg1 = undef1 /\ arg2 = undef2, {all remain the same}>
23.26/23.30	
23.26/23.30	> Conditions are reachable!
23.26/23.30	
23.26/23.30	Program does NOT terminate
23.26/23.30	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
23.26/23.30	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
23.26/23.30	EOF