20.69/20.78	NO
20.69/20.78	
20.69/20.78	Solver Timeout: 4
20.69/20.78	Global Timeout: 300
20.69/20.78	No parsing errors!
20.69/20.78	Init Location: 0
20.69/20.78	Transitions:
20.69/20.78	<l0, l7, true>
20.69/20.78	<l1, l2, (undef1 <= arg1) /\ ((undef1 - 1) <= arg2) /\ (undef2 <= arg2) /\ (arg1 > 0) /\ (arg2 > ~(1)) /\ (undef1 > 0) /\ (undef2 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}>
20.69/20.78	<l3, l2, (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0) /\ (undef6 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
20.69/20.78	<l2, l4, (undef13 > 0) /\ (undef14 > 0) /\ (undef9 <= arg2) /\ (arg1 > 0) /\ (arg2 > ~(1)) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
20.69/20.78	<l3, l5, (arg2 > ~(1)) /\ (undef16 > ~(1)) /\ (arg1 > 0), par{arg1 -> 0, arg2 -> undef16, arg3 -> 1, arg4 -> undef18}>
20.69/20.78	<l5, l6, (undef21 > ~(1)) /\ (arg2 > arg1) /\ (arg3 > 0), par{arg1 -> arg2, arg2 -> arg1, arg3 -> undef21, arg4 -> (arg3 + 1)}>
20.69/20.78	<l6, l5, (0 = arg3), par{arg1 -> (arg2 + 1), arg2 -> arg1, arg3 -> arg4, arg4 -> undef26}>
20.69/20.78	<l6, l6, (arg3 > 0), par{arg3 -> (arg3 - 1)}>
20.69/20.78	<l4, l4, ((undef31 + 2) <= arg1) /\ (undef35 > 0) /\ (arg1 > 1) /\ (undef31 > ~(1)), par{arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34}>
20.69/20.78	<l4, l4, ((undef36 + 2) <= arg1) /\ (undef40 > 0) /\ (arg1 > 2) /\ (undef36 > ~(1)), par{arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39}>
20.69/20.78	<l4, l4, (undef41 <= arg1) /\ (undef45 > 0) /\ (arg1 > 2) /\ (undef41 > 0), par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}>
20.69/20.78	<l7, l3, true, par{arg1 -> undef46, arg2 -> undef47, arg3 -> undef48, arg4 -> undef49}>
20.69/20.78	
20.69/20.78	Fresh variables:
20.69/20.78	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef16, undef18, undef21, undef26, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, 
20.69/20.78	
20.69/20.78	Undef variables:
20.69/20.78	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef16, undef18, undef21, undef26, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, 
20.69/20.78	
20.69/20.78	Abstraction variables:
20.69/20.78	
20.69/20.78	Exit nodes:
20.69/20.78	
20.69/20.78	Accepting locations:
20.69/20.78	
20.69/20.78	Asserts:
20.69/20.78	
20.69/20.78	Preprocessed LLVMGraph
20.69/20.78	Init Location: 0
20.69/20.78	Transitions:
20.69/20.78	<l0, l4, (undef5 <= undef46) /\ (undef46 > 0) /\ (undef5 > 0) /\ (undef6 > ~(1)) /\ (undef13 > 0) /\ (undef14 > 0) /\ (undef9 <= undef6) /\ (undef5 > 0) /\ (undef6 > ~(1)) /\ (undef9 > ~(1)), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
20.69/20.78	<l0, l6, (undef47 > ~(1)) /\ (undef16 > ~(1)) /\ (undef46 > 0) /\ (undef21 > ~(1)) /\ (undef16 > 0) /\ (1 > 0), par{arg1 -> undef16, arg2 -> 0, arg3 -> undef21, arg4 -> (1 + 1)}>
20.69/20.78	<l4, l4, ((undef31 + 2) <= arg1) /\ (undef35 > 0) /\ (arg1 > 1) /\ (undef31 > ~(1)), par{arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34}>
20.69/20.78	<l4, l4, ((undef36 + 2) <= arg1) /\ (undef40 > 0) /\ (arg1 > 2) /\ (undef36 > ~(1)), par{arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39}>
20.69/20.78	<l4, l4, (undef41 <= arg1) /\ (undef45 > 0) /\ (arg1 > 2) /\ (undef41 > 0), par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}>
20.69/20.78	<l6, l6, (0 = arg3) /\ (undef21 > ~(1)) /\ (arg1 > (arg2 + 1)) /\ (arg4 > 0), par{arg1 -> arg1, arg2 -> (arg2 + 1), arg3 -> undef21, arg4 -> (arg4 + 1)}>
20.69/20.78	<l6, l6, (arg3 > 0), par{arg3 -> (arg3 - 1)}>
20.69/20.78	
20.69/20.78	Fresh variables:
20.69/20.78	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef16, undef18, undef21, undef26, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, 
20.69/20.78	
20.69/20.78	Undef variables:
20.69/20.78	undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef16, undef18, undef21, undef26, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, 
20.69/20.78	
20.69/20.78	Abstraction variables:
20.69/20.78	
20.69/20.78	Exit nodes:
20.69/20.78	
20.69/20.78	Accepting locations:
20.69/20.78	
20.69/20.78	Asserts:
20.69/20.78	
20.69/20.78	*************************************************************
20.69/20.78	*******************************************************************************************
20.69/20.78	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
20.69/20.78	*******************************************************************************************
20.69/20.78	
20.69/20.78	Init Location: 0
20.69/20.78	Graph 0:
20.69/20.78	Transitions:
20.69/20.78	Variables:
20.69/20.78	
20.69/20.78	Graph 1:
20.69/20.78	Transitions:
20.69/20.78	<l6, l6, 1 <= arg4 /\ 0 <= undef21 /\ 2 + arg2 <= arg1 /\ arg3 = 0, {arg2 -> 1 + arg2, arg3 -> undef21, arg4 -> 1 + arg4, rest remain the same}>
20.69/20.78	<l6, l6, 1 <= arg3, {arg3 -> -1 + arg3, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	
20.69/20.78	Graph 2:
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 <= arg1 /\ 2 + undef31 <= arg1, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef40 /\ 0 <= undef36 /\ 2 + undef36 <= arg1 /\ 3 <= arg1, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	
20.69/20.78	Precedence: 
20.69/20.78	Graph 0
20.69/20.78	
20.69/20.78	Graph 1
20.69/20.78	<l0, l6, 1 <= undef16 /\ 1 <= undef46 /\ 0 <= undef21 /\ 0 <= undef47, {arg1 -> undef16, arg2 -> 0, arg3 -> undef21, arg4 -> 2, rest remain the same}>
20.69/20.78	
20.69/20.78	Graph 2
20.69/20.78	<l0, l4, 1 <= undef5 /\ 1 <= undef13 /\ 1 <= undef14 /\ 1 <= undef46 /\ undef5 <= undef46 /\ 0 <= undef6 /\ undef9 <= undef6 /\ 0 <= undef9, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.69/20.78	
20.69/20.78	Map Locations to Subgraph:
20.69/20.78	( 0 , 0 )
20.69/20.78	( 4 , 2 )
20.69/20.78	( 6 , 1 )
20.69/20.78	
20.69/20.78	*******************************************************************************************
20.69/20.78	********************************    CHECKING ASSERTIONS    ********************************
20.69/20.78	*******************************************************************************************
20.69/20.78	
20.69/20.78	Proving termination of subgraph 0
20.69/20.78	Proving termination of subgraph 1
20.69/20.78	Checking unfeasibility...
20.69/20.78	Time used: 0.008167
20.69/20.78	
20.69/20.78	Checking conditional termination of SCC {l6}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.001550s
20.69/20.78	Ranking function: -2 + 2*arg1 - 2*arg2 + arg4
20.69/20.78	New Graphs: 
20.69/20.78	Transitions:
20.69/20.78	<l6, l6, 1 <= arg3, {arg3 -> -1 + arg3, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg3
20.69/20.78	Checking conditional termination of SCC {l6}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.000506s
20.69/20.78	Ranking function: -1 + arg3
20.69/20.78	New Graphs: 
20.69/20.78	Proving termination of subgraph 2
20.69/20.78	Checking unfeasibility...
20.69/20.78	Time used: 0.008952
20.69/20.78	
20.69/20.78	Checking conditional termination of SCC {l4}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.002700s
20.69/20.78	Ranking function: -12 + 4*arg1
20.69/20.78	New Graphs: 
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 <= arg1 /\ 2 + undef31 <= arg1, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	Checking conditional termination of SCC {l4}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.001748s
20.69/20.78	Ranking function: -1 + arg1
20.69/20.78	New Graphs: 
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	Checking conditional termination of SCC {l4}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.000810s
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.002904s
20.69/20.78	Trying to remove transition: <l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Solving with 1 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008320s
20.69/20.78	Time used: 0.007957
20.69/20.78	Solving with 1 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023414s
20.69/20.78	Time used: 0.022768
20.69/20.78	Improving Solution with cost 1 ...
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetNextSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.036954s
20.69/20.78	Time used: 0.036947
20.69/20.78	
20.69/20.78	LOG: SAT solveNonLinear - Elapsed time: 0.060368s
20.69/20.78	Cost: 1; Total time: 0.059715
20.69/20.78	Failed at location 4: arg1 <= 1
20.69/20.78	Before Improving: 
20.69/20.78	Quasi-invariant at l4: arg1 <= 1
20.69/20.78	Optimizing invariants...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.006001s
20.69/20.78	Remaining time after improvement: 0.997702
20.69/20.78	Termination implied by a set of quasi-invariant(s):
20.69/20.78	Quasi-invariant at l4: arg1 <= 1
20.69/20.78	[ Invariant Graph ]
20.69/20.78	Strengthening and disabling transitions...
20.69/20.78	
20.69/20.78	LOG: CALL solverLinear in Graph for feasibility
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear in Graph for feasibility
20.69/20.78	It's unfeasible. Removing transition: 
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 <= arg1 /\ 2 + undef31 <= arg1, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: CALL solverLinear in Graph for feasibility
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear in Graph for feasibility
20.69/20.78	It's unfeasible. Removing transition: 
20.69/20.78	<l4, l4, 1 <= undef40 /\ 0 <= undef36 /\ 2 + undef36 <= arg1 /\ 3 <= arg1, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: CALL solverLinear in Graph for feasibility
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear in Graph for feasibility
20.69/20.78	It's unfeasible. Removing transition: 
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	[ Termination Graph ]
20.69/20.78	Strengthening and disabling transitions...
20.69/20.78	> It's unfeasible. Removing transition: 
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	New Graphs: 
20.69/20.78	Calling Safety with literal arg1 <= 1 and entry <l0, l4, 1 <= undef5 /\ 1 <= undef13 /\ 1 <= undef14 /\ 1 <= undef46 /\ undef5 <= undef46 /\ 0 <= undef6 /\ undef9 <= undef6 /\ 0 <= undef9, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: CALL check - Post:arg1 <= 1 - Process 1
20.69/20.78	* Exit transition: <l0, l4, 1 <= undef5 /\ 1 <= undef13 /\ 1 <= undef14 /\ 1 <= undef46 /\ undef5 <= undef46 /\ 0 <= undef6 /\ undef9 <= undef6 /\ 0 <= undef9, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.69/20.78	* Postcondition  : arg1 <= 1
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.000864s
20.69/20.78	> Postcondition is not implied!
20.69/20.78	
20.69/20.78	LOG: RETURN check - Elapsed time: 0.001013s
20.69/20.78	INVARIANTS: 
20.69/20.78	4: 
20.69/20.78	Quasi-INVARIANTS to narrow Graph: 
20.69/20.78	4: arg1 <= 1 , 
20.69/20.78	Narrowing transition: 
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 <= arg1 /\ 2 + undef31 <= arg1, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: Narrow transition size 1
20.69/20.78	Narrowing transition: 
20.69/20.78	<l4, l4, 1 <= undef40 /\ 0 <= undef36 /\ 2 + undef36 <= arg1 /\ 3 <= arg1, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: Narrow transition size 1
20.69/20.78	Narrowing transition: 
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: Narrow transition size 1
20.69/20.78	invGraph after Narrowing: 
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 <= arg1 /\ 2 + undef31 <= arg1, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef40 /\ 0 <= undef36 /\ 2 + undef36 <= arg1 /\ 3 <= arg1, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	Checking conditional termination of SCC {l4}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.002478s
20.69/20.78	Ranking function: -12 + 4*arg1
20.69/20.78	New Graphs: 
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 <= arg1 /\ 2 + undef31 <= arg1, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	Checking conditional termination of SCC {l4}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.001856s
20.69/20.78	Ranking function: -1 + arg1
20.69/20.78	New Graphs: 
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	Checking conditional termination of SCC {l4}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.000806s
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.002955s
20.69/20.78	Trying to remove transition: <l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Solving with 1 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008244s
20.69/20.78	Time used: 0.008081
20.69/20.78	Solving with 1 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.041336s
20.69/20.78	Time used: 0.040651
20.69/20.78	Improving Solution with cost 1 ...
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetNextSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029623s
20.69/20.78	Time used: 0.029616
20.69/20.78	
20.69/20.78	LOG: SAT solveNonLinear - Elapsed time: 0.070960s
20.69/20.78	Cost: 1; Total time: 0.070267
20.69/20.78	Failed at location 4: arg1 <= 2
20.69/20.78	Before Improving: 
20.69/20.78	Quasi-invariant at l4: arg1 <= 2
20.69/20.78	Optimizing invariants...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.006146s
20.69/20.78	Remaining time after improvement: 0.997657
20.69/20.78	Termination implied by a set of quasi-invariant(s):
20.69/20.78	Quasi-invariant at l4: arg1 <= 2
20.69/20.78	[ Invariant Graph ]
20.69/20.78	Strengthening and disabling transitions...
20.69/20.78	
20.69/20.78	LOG: CALL solverLinear in Graph for feasibility
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear in Graph for feasibility
20.69/20.78	Strengthening transition (result): 
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 + undef31 <= arg1 /\ arg1 = 2, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: CALL solverLinear in Graph for feasibility
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear in Graph for feasibility
20.69/20.78	It's unfeasible. Removing transition: 
20.69/20.78	<l4, l4, 1 <= undef40 /\ 0 <= undef36 /\ 2 + undef36 <= arg1 /\ 3 <= arg1, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: CALL solverLinear in Graph for feasibility
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear in Graph for feasibility
20.69/20.78	It's unfeasible. Removing transition: 
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	[ Termination Graph ]
20.69/20.78	Strengthening and disabling transitions...
20.69/20.78	> It's unfeasible. Removing transition: 
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	New Graphs: 
20.69/20.78	Calling Safety with literal arg1 <= 2 and entry <l0, l4, 1 <= undef5 /\ 1 <= undef13 /\ 1 <= undef14 /\ 1 <= undef46 /\ undef5 <= undef46 /\ 0 <= undef6 /\ undef9 <= undef6 /\ 2 <= undef9, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: CALL check - Post:arg1 <= 2 - Process 2
20.69/20.78	* Exit transition: <l0, l4, 1 <= undef5 /\ 1 <= undef13 /\ 1 <= undef14 /\ 1 <= undef46 /\ undef5 <= undef46 /\ 0 <= undef6 /\ undef9 <= undef6 /\ 2 <= undef9, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.69/20.78	* Postcondition  : arg1 <= 2
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.000745s
20.69/20.78	> Postcondition is not implied!
20.69/20.78	
20.69/20.78	LOG: RETURN check - Elapsed time: 0.000922s
20.69/20.78	INVARIANTS: 
20.69/20.78	4: 
20.69/20.78	Quasi-INVARIANTS to narrow Graph: 
20.69/20.78	4: arg1 <= 2 , 
20.69/20.78	Narrowing transition: 
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 <= arg1 /\ 2 + undef31 <= arg1, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: Narrow transition size 1
20.69/20.78	Narrowing transition: 
20.69/20.78	<l4, l4, 1 <= undef40 /\ 0 <= undef36 /\ 2 + undef36 <= arg1 /\ 3 <= arg1, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: Narrow transition size 1
20.69/20.78	Narrowing transition: 
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	
20.69/20.78	LOG: Narrow transition size 1
20.69/20.78	invGraph after Narrowing: 
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 + undef31 <= arg1 /\ 3 <= arg1, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef40 /\ 0 <= undef36 /\ 2 + undef36 <= arg1 /\ 3 <= arg1, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	Checking conditional termination of SCC {l4}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.002515s
20.69/20.78	Ranking function: (~(3) / 2) + (1 / 2)*arg1
20.69/20.78	New Graphs: 
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	Checking conditional termination of SCC {l4}...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.000811s
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.002982s
20.69/20.78	Trying to remove transition: <l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Solving with 1 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008306s
20.69/20.78	Time used: 0.008142
20.69/20.78	Solving with 1 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040498s
20.69/20.78	Time used: 0.039924
20.69/20.78	Solving with 2 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005748s
20.69/20.78	Time used: 4.00396
20.69/20.78	Solving with 3 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008330s
20.69/20.78	Time used: 1.00034
20.69/20.78	Solving with 1 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049004s
20.69/20.78	Time used: 0.015373
20.69/20.78	
20.69/20.78	Proving non-termination of subgraph 2
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef35 /\ 0 <= undef31 /\ 2 + undef31 <= arg1 /\ 3 <= arg1, {arg1 -> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef40 /\ 0 <= undef36 /\ 2 + undef36 <= arg1 /\ 3 <= arg1, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef38, arg4 -> undef39, rest remain the same}>
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	
20.69/20.78	Checking that every undef value has an assignment...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.002367s
20.69/20.78	Checking conditional non-termination of SCC {l4}...
20.69/20.78	EXIT TRANSITIONS:
20.69/20.78	<l4, end, arg1 <= 2, {all remain the same}>
20.69/20.78	
20.69/20.78	Solving with 1 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001697s
20.69/20.78	Time used: 5.001
20.69/20.78	Solving with 2 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.025122s
20.69/20.78	Time used: 5.00252
20.69/20.78	Solving with 3 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005253s
20.69/20.78	Time used: 5.00014
20.69/20.78	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
20.69/20.78	
20.69/20.78	Proving non-termination of subgraph 2
20.69/20.78	Transitions:
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	Variables:
20.69/20.78	arg1, arg2, arg3, arg4
20.69/20.78	
20.69/20.78	Checking that every undef value has an assignment...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.002476s
20.69/20.78	Checking conditional non-termination of SCC {l4}...
20.69/20.78	EXIT TRANSITIONS:
20.69/20.78	<l4, end, arg1 <= 2, {all remain the same}>
20.69/20.78	
20.69/20.78	Solving with 1 template(s).
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetFirstSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.147162s
20.69/20.78	Time used: 0.146755
20.69/20.78	Improving Solution with cost 1 ...
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinearGetNextSolution
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.088395s
20.69/20.78	Time used: 0.088385
20.69/20.78	
20.69/20.78	LOG: SAT solveNonLinear - Elapsed time: 0.235557s
20.69/20.78	Cost: 1; Total time: 0.23514
20.69/20.78	Failed at location 4: 3 <= arg1
20.69/20.78	Before Improving: 
20.69/20.78	Quasi-invariant at l4: 3 <= arg1
20.69/20.78	Optimizing invariants...
20.69/20.78	
20.69/20.78	LOG: CALL solveLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear - Elapsed time: 0.022762s
20.69/20.78	Remaining time after improvement: 0.996647
20.69/20.78	Minimizing number of undef constraints...
20.69/20.78	
20.69/20.78	LOG: CALL solveNonLinear
20.69/20.78	
20.69/20.78	LOG: RETURN solveNonLinear - Elapsed time: 0.004943s
20.69/20.78	Non-termination implied by a set of quasi-invariant(s):
20.69/20.78	Quasi-invariant at l4: 3 <= arg1
20.69/20.78	Constraint over undef 'arg1 <= undef41' in transition:
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ undef41 <= arg1 /\ 3 <= arg1, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	
20.69/20.78	Strengthening and disabling EXIT transitions...
20.69/20.78	Closed exits from l4: 1
20.69/20.78	
20.69/20.78	Strengthening and disabling transitions...
20.69/20.78	
20.69/20.78	LOG: CALL solverLinear in Graph for feasibility
20.69/20.78	
20.69/20.78	LOG: RETURN solveLinear in Graph for feasibility
20.69/20.78	Strengthening transition (result): 
20.69/20.78	<l4, l4, 1 <= undef41 /\ 1 <= undef45 /\ 3 <= arg1 /\ arg1 = undef41, {arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}>
20.69/20.78	
20.69/20.78	Calling reachability with...
20.69/20.78	Transition: <l4, end, true, {all remain the same}>
20.69/20.78	Conditions: 3 <= arg1, 
20.69/20.78	OPEN EXITS: 
20.69/20.78	<l4, end, 3 <= arg1, {all remain the same}>
20.69/20.78	
20.69/20.78	--- Reachability graph ---
20.69/20.78	> Graph without transitions.
20.69/20.78	
20.69/20.78	Calling reachability with...
20.69/20.78	Transition: <l0, l4, 1 <= undef5 /\ 1 <= undef13 /\ 1 <= undef14 /\ 1 <= undef46 /\ undef5 <= undef46 /\ 0 <= undef6 /\ undef9 <= undef6 /\ 0 <= undef9, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.69/20.78	Conditions: 3 <= arg1, 
20.69/20.78	OPEN EXITS: 
20.69/20.78	<l0, l4, 1 <= undef5 /\ 1 <= undef13 /\ 1 <= undef14 /\ 1 <= undef46 /\ undef5 <= undef46 /\ 0 <= undef6 /\ undef9 <= undef6 /\ 3 <= undef9, {arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}>
20.69/20.78	
20.69/20.78	> Conditions are reachable!
20.69/20.78	
20.69/20.78	Program does NOT terminate
20.69/20.78	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
20.69/20.78	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
20.69/20.78	EOF