11.17/11.21	YES
11.17/11.21	
11.17/11.21	Solver Timeout: 4
11.17/11.21	Global Timeout: 300
11.17/11.21	No parsing errors!
11.17/11.21	Init Location: 0
11.17/11.21	Transitions:
11.17/11.21	<l0, l3, true>
11.17/11.21	<l1, l2, (arg1 > 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
11.17/11.21	<l1, l2, (arg1 > 0) /\ (undef7 > ~(1)) /\ (1 = arg2), par{arg1 -> 0, arg2 -> (0 - undef7), arg3 -> 0}>
11.17/11.21	<l1, l2, (undef11 > ~(1)) /\ (arg2 > 1) /\ (undef12 > ~(1)) /\ (arg1 > 0), par{arg1 -> (0 - undef12), arg2 -> (0 - undef11), arg3 -> (0 - undef12)}>
11.17/11.21	<l2, l2, (arg1 < arg2) /\ ((arg2 + 1) > arg2) /\ (arg1 < (arg2 + 1)) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg1 + arg2)}>
11.17/11.21	<l3, l1, true, par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18}>
11.17/11.21	
11.17/11.21	Fresh variables:
11.17/11.21	undef7, undef11, undef12, undef16, undef17, undef18, 
11.17/11.21	
11.17/11.21	Undef variables:
11.17/11.21	undef7, undef11, undef12, undef16, undef17, undef18, 
11.17/11.21	
11.17/11.21	Abstraction variables:
11.17/11.21	
11.17/11.21	Exit nodes:
11.17/11.21	
11.17/11.21	Accepting locations:
11.17/11.21	
11.17/11.21	Asserts:
11.17/11.21	
11.17/11.21	Preprocessed LLVMGraph
11.17/11.21	Init Location: 0
11.17/11.21	Transitions:
11.17/11.21	<l0, l2, (undef16 > 0) /\ (0 = undef17), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}>
11.17/11.21	<l0, l2, (undef16 > 0) /\ (undef7 > ~(1)) /\ (1 = undef17), par{arg1 -> 0, arg2 -> (0 - undef7), arg3 -> 0}>
11.17/11.21	<l0, l2, (undef11 > ~(1)) /\ (undef17 > 1) /\ (undef12 > ~(1)) /\ (undef16 > 0), par{arg1 -> (0 - undef12), arg2 -> (0 - undef11), arg3 -> (0 - undef12)}>
11.17/11.21	<l2, l2, (arg1 < arg2) /\ ((arg2 + 1) > arg2) /\ (arg1 < (arg2 + 1)) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg1 + arg2)}>
11.17/11.21	
11.17/11.21	Fresh variables:
11.17/11.21	undef7, undef11, undef12, undef16, undef17, undef18, 
11.17/11.21	
11.17/11.21	Undef variables:
11.17/11.21	undef7, undef11, undef12, undef16, undef17, undef18, 
11.17/11.21	
11.17/11.21	Abstraction variables:
11.17/11.21	
11.17/11.21	Exit nodes:
11.17/11.21	
11.17/11.21	Accepting locations:
11.17/11.21	
11.17/11.21	Asserts:
11.17/11.21	
11.17/11.21	*************************************************************
11.17/11.21	*******************************************************************************************
11.17/11.21	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
11.17/11.21	*******************************************************************************************
11.17/11.21	
11.17/11.21	Init Location: 0
11.17/11.21	Graph 0:
11.17/11.21	Transitions:
11.17/11.21	Variables:
11.17/11.21	
11.17/11.21	Graph 1:
11.17/11.21	Transitions:
11.17/11.21	<l2, l2, 1 + arg1 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	Variables:
11.17/11.21	arg1, arg2, arg3
11.17/11.21	
11.17/11.21	Precedence: 
11.17/11.21	Graph 0
11.17/11.21	
11.17/11.21	Graph 1
11.17/11.21	<l0, l2, 1 <= undef16 /\ undef17 = 0, {arg1 -> 0, arg2 -> 0, arg3 -> 0, rest remain the same}>
11.17/11.21	<l0, l2, 0 <= undef7 /\ 1 <= undef16 /\ undef17 = 1, {arg1 -> 0, arg2 -> -undef7, arg3 -> 0, rest remain the same}>
11.17/11.21	<l0, l2, 0 <= undef11 /\ 0 <= undef12 /\ 1 <= undef16 /\ 2 <= undef17, {arg1 -> -undef12, arg2 -> -undef11, arg3 -> -undef12, rest remain the same}>
11.17/11.21	
11.17/11.21	Map Locations to Subgraph:
11.17/11.21	( 0 , 0 )
11.17/11.21	( 2 , 1 )
11.17/11.21	
11.17/11.21	*******************************************************************************************
11.17/11.21	********************************    CHECKING ASSERTIONS    ********************************
11.17/11.21	*******************************************************************************************
11.17/11.21	
11.17/11.21	Proving termination of subgraph 0
11.17/11.21	Proving termination of subgraph 1
11.17/11.21	Checking unfeasibility...
11.17/11.21	Time used: 0.003391
11.17/11.21	
11.17/11.21	Checking conditional termination of SCC {l2}...
11.17/11.21	
11.17/11.21	LOG: CALL solveLinear
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear - Elapsed time: 0.000726s
11.17/11.21	
11.17/11.21	LOG: CALL solveLinear
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear - Elapsed time: 0.002298s
11.17/11.21	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	Solving with 1 template(s).
11.17/11.21	
11.17/11.21	LOG: CALL solveNonLinearGetFirstSolution
11.17/11.21	
11.17/11.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009414s
11.17/11.21	Time used: 0.009227
11.17/11.21	Solving with 1 template(s).
11.17/11.21	
11.17/11.21	LOG: CALL solveNonLinearGetFirstSolution
11.17/11.21	
11.17/11.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011545s
11.17/11.21	Time used: 0.011081
11.17/11.21	Improving Solution with cost 1 ...
11.17/11.21	
11.17/11.21	LOG: CALL solveNonLinearGetNextSolution
11.17/11.21	
11.17/11.21	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000757s
11.17/11.21	Time used: 1.00053
11.17/11.21	
11.17/11.21	LOG: SAT solveNonLinear - Elapsed time: 1.012302s
11.17/11.21	Cost: 1; Total time: 1.01161
11.17/11.21	Failed at location 2: arg2 <= arg1
11.17/11.21	Before Improving: 
11.17/11.21	Quasi-invariant at l2: arg2 <= arg1
11.17/11.21	Optimizing invariants...
11.17/11.21	
11.17/11.21	LOG: CALL solveLinear
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear - Elapsed time: 0.005244s
11.17/11.21	Remaining time after improvement: 0.998373
11.17/11.21	Termination implied by a set of quasi-invariant(s):
11.17/11.21	Quasi-invariant at l2: arg2 <= arg1
11.17/11.21	[ Invariant Graph ]
11.17/11.21	Strengthening and disabling transitions...
11.17/11.21	
11.17/11.21	LOG: CALL solverLinear in Graph for feasibility
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear in Graph for feasibility
11.17/11.21	It's unfeasible. Removing transition: 
11.17/11.21	<l2, l2, 1 + arg1 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	[ Termination Graph ]
11.17/11.21	Strengthening and disabling transitions...
11.17/11.21	> It's unfeasible. Removing transition: 
11.17/11.21	<l2, l2, 1 + arg1 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	New Graphs: 
11.17/11.21	Calling Safety with literal arg2 <= arg1 and entry <l0, l2, 0 <= undef11 /\ 0 <= undef12 /\ 1 <= undef16 /\ 2 <= undef17, {arg1 -> -undef12, arg2 -> -undef11, arg3 -> -undef12, rest remain the same}>
11.17/11.21	
11.17/11.21	LOG: CALL check - Post:arg2 <= arg1 - Process 1
11.17/11.21	* Exit transition: <l0, l2, 0 <= undef11 /\ 0 <= undef12 /\ 1 <= undef16 /\ 2 <= undef17, {arg1 -> -undef12, arg2 -> -undef11, arg3 -> -undef12, rest remain the same}>
11.17/11.21	* Postcondition  : arg2 <= arg1
11.17/11.21	
11.17/11.21	LOG: CALL solveLinear
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear - Elapsed time: 0.000562s
11.17/11.21	> Postcondition is not implied!
11.17/11.21	
11.17/11.21	LOG: RETURN check - Elapsed time: 0.000691s
11.17/11.21	INVARIANTS: 
11.17/11.21	2: 
11.17/11.21	Quasi-INVARIANTS to narrow Graph: 
11.17/11.21	2: arg2 <= arg1 , 
11.17/11.21	Narrowing transition: 
11.17/11.21	<l2, l2, 1 + arg1 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	
11.17/11.21	LOG: Narrow transition size 1
11.17/11.21	invGraph after Narrowing: 
11.17/11.21	Transitions:
11.17/11.21	<l2, l2, 1 + arg1 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	Variables:
11.17/11.21	arg1, arg2, arg3
11.17/11.21	Checking conditional termination of SCC {l2}...
11.17/11.21	
11.17/11.21	LOG: CALL solveLinear
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear - Elapsed time: 0.000663s
11.17/11.21	
11.17/11.21	LOG: CALL solveLinear
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear - Elapsed time: 0.002270s
11.17/11.21	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	Solving with 1 template(s).
11.17/11.21	
11.17/11.21	LOG: CALL solveNonLinearGetFirstSolution
11.17/11.21	
11.17/11.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008596s
11.17/11.21	Time used: 0.008437
11.17/11.21	Solving with 1 template(s).
11.17/11.21	
11.17/11.21	LOG: CALL solveNonLinearGetFirstSolution
11.17/11.21	
11.17/11.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002791s
11.17/11.21	Time used: 4.0017
11.17/11.21	Solving with 2 template(s).
11.17/11.21	
11.17/11.21	LOG: CALL solveNonLinearGetFirstSolution
11.17/11.21	
11.17/11.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.069411s
11.17/11.21	Time used: 4.00051
11.17/11.21	Solving with 3 template(s).
11.17/11.21	
11.17/11.21	LOG: CALL solveNonLinearGetFirstSolution
11.17/11.21	
11.17/11.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003321s
11.17/11.21	Time used: 1.00017
11.17/11.21	Solving with 1 template(s).
11.17/11.21	
11.17/11.21	LOG: CALL solveNonLinearGetFirstSolution
11.17/11.21	
11.17/11.21	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018843s
11.17/11.21	Time used: 0.014444
11.17/11.21	Improving Solution with cost 1 ...
11.17/11.21	
11.17/11.21	LOG: CALL solveNonLinearGetNextSolution
11.17/11.21	
11.17/11.21	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000592s
11.17/11.21	Time used: 1.0005
11.17/11.21	
11.17/11.21	LOG: SAT solveNonLinear - Elapsed time: 1.019435s
11.17/11.21	Cost: 1; Total time: 1.01495
11.17/11.21	Termination implied by a set of invariant(s):
11.17/11.21	Invariant at l2: arg1 <= 1 + arg3
11.17/11.21	[ Invariant Graph ]
11.17/11.21	Strengthening and disabling transitions...
11.17/11.21	
11.17/11.21	LOG: CALL solverLinear in Graph for feasibility
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear in Graph for feasibility
11.17/11.21	Strengthening transition (result): 
11.17/11.21	<l2, l2, 1 + arg1 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	[ Termination Graph ]
11.17/11.21	Strengthening and disabling transitions...
11.17/11.21	
11.17/11.21	LOG: CALL solverLinear in Graph for feasibility
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear in Graph for feasibility
11.17/11.21	Strengthening transition (result): 
11.17/11.21	<l2, l2, 1 + arg1 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	Quasi-ranking function: 50000 - arg2
11.17/11.21	New Graphs: 
11.17/11.21	Transitions:
11.17/11.21	<l2, l2, 1 + arg1 <= arg2 /\ 50001 <= arg2 /\ arg1 = arg3, {arg1 -> arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}>
11.17/11.21	Variables:
11.17/11.21	arg1, arg2, arg3
11.17/11.21	Checking conditional termination of SCC {l2}...
11.17/11.21	
11.17/11.21	LOG: CALL solveLinear
11.17/11.21	
11.17/11.21	LOG: RETURN solveLinear - Elapsed time: 0.001038s
11.17/11.21	Ranking function: (~(1) / 50000) + (~(1) / 50000)*arg1 + (1 / 50000)*arg2
11.17/11.21	New Graphs: 
11.17/11.21	INVARIANTS: 
11.17/11.21	2: arg1 <= 1 + arg3 , 
11.17/11.21	Quasi-INVARIANTS to narrow Graph: 
11.17/11.21	2: 
11.17/11.21	Program Terminates
11.17/11.21	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
11.17/11.21	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
11.17/11.21	EOF