6.37/6.39	NO
6.37/6.39	
6.37/6.39	Solver Timeout: 4
6.37/6.39	Global Timeout: 300
6.37/6.39	No parsing errors!
6.37/6.39	Init Location: 0
6.37/6.39	Transitions:
6.37/6.39	<l0, l3, true>
6.37/6.39	<l1, l2, true, par{arg1 -> 13, arg2 -> 17}>
6.37/6.39	<l2, l2, (arg2 > 2) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> 2, arg2 -> (arg1 + 1)}>
6.37/6.39	<l3, l1, true, par{arg1 -> undef5, arg2 -> undef6}>
6.37/6.39	
6.37/6.39	Fresh variables:
6.37/6.39	undef5, undef6, 
6.37/6.39	
6.37/6.39	Undef variables:
6.37/6.39	undef5, undef6, 
6.37/6.39	
6.37/6.39	Abstraction variables:
6.37/6.39	
6.37/6.39	Exit nodes:
6.37/6.39	
6.37/6.39	Accepting locations:
6.37/6.39	
6.37/6.39	Asserts:
6.37/6.39	
6.37/6.39	Preprocessed LLVMGraph
6.37/6.39	Init Location: 0
6.37/6.39	Transitions:
6.37/6.39	<l0, l2, (arg1 = 13) /\ (arg2 = 17)>
6.37/6.39	<l2, l2, (arg2 > 2) /\ (arg1 > 0) /\ (arg2 > arg1), par{arg1 -> 2, arg2 -> (arg1 + 1)}>
6.37/6.39	
6.37/6.39	Fresh variables:
6.37/6.39	undef5, undef6, 
6.37/6.39	
6.37/6.39	Undef variables:
6.37/6.39	undef5, undef6, 
6.37/6.39	
6.37/6.39	Abstraction variables:
6.37/6.39	
6.37/6.39	Exit nodes:
6.37/6.39	
6.37/6.39	Accepting locations:
6.37/6.39	
6.37/6.39	Asserts:
6.37/6.39	
6.37/6.39	*************************************************************
6.37/6.39	*******************************************************************************************
6.37/6.39	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
6.37/6.39	*******************************************************************************************
6.37/6.39	
6.37/6.39	Init Location: 0
6.37/6.39	Graph 0:
6.37/6.39	Transitions:
6.37/6.39	Variables:
6.37/6.39	
6.37/6.39	Graph 1:
6.37/6.39	Transitions:
6.37/6.39	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 3 <= arg2, {arg1 -> 2, arg2 -> 1 + arg1, rest remain the same}>
6.37/6.39	Variables:
6.37/6.39	arg1, arg2
6.37/6.39	
6.37/6.39	Precedence: 
6.37/6.39	Graph 0
6.37/6.39	
6.37/6.39	Graph 1
6.37/6.39	<l0, l2, arg1 = 13 /\ arg2 = 17, {all remain the same}>
6.37/6.39	
6.37/6.39	Map Locations to Subgraph:
6.37/6.39	( 0 , 0 )
6.37/6.39	( 2 , 1 )
6.37/6.39	
6.37/6.39	*******************************************************************************************
6.37/6.39	********************************    CHECKING ASSERTIONS    ********************************
6.37/6.39	*******************************************************************************************
6.37/6.39	
6.37/6.39	Proving termination of subgraph 0
6.37/6.39	Proving termination of subgraph 1
6.37/6.39	Checking unfeasibility...
6.37/6.39	Time used: 0.036021
6.37/6.39	
6.37/6.39	Checking conditional termination of SCC {l2}...
6.37/6.39	
6.37/6.39	LOG: CALL solveLinear
6.37/6.39	
6.37/6.39	LOG: RETURN solveLinear - Elapsed time: 0.000954s
6.37/6.39	
6.37/6.39	LOG: CALL solveLinear
6.37/6.39	
6.37/6.39	LOG: RETURN solveLinear - Elapsed time: 0.002131s
6.37/6.39	Trying to remove transition: <l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 3 <= arg2, {arg1 -> 2, arg2 -> 1 + arg1, rest remain the same}>
6.37/6.39	Solving with 1 template(s).
6.37/6.39	
6.37/6.39	LOG: CALL solveNonLinearGetFirstSolution
6.37/6.39	
6.37/6.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.119368s
6.37/6.39	Time used: 0.119207
6.37/6.39	Solving with 1 template(s).
6.37/6.39	
6.37/6.39	LOG: CALL solveNonLinearGetFirstSolution
6.37/6.39	
6.37/6.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.519020s
6.37/6.39	Time used: 0.518411
6.37/6.39	Solving with 2 template(s).
6.37/6.39	
6.37/6.39	LOG: CALL solveNonLinearGetFirstSolution
6.37/6.39	
6.37/6.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002977s
6.37/6.39	Time used: 4.00072
6.37/6.39	Solving with 3 template(s).
6.37/6.39	
6.37/6.39	LOG: CALL solveNonLinearGetFirstSolution
6.37/6.39	
6.37/6.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.016587s
6.37/6.39	Time used: 1.01179
6.37/6.39	Solving with 1 template(s).
6.37/6.39	
6.37/6.39	LOG: CALL solveNonLinearGetFirstSolution
6.37/6.39	
6.37/6.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.563160s
6.37/6.39	Time used: 0.558193
6.37/6.39	Termination failed. Trying to show unreachability...
6.37/6.39	Proving unreachability of entry: <l0, l2, arg1 = 13 /\ arg2 = 17, {all remain the same}>
6.37/6.39	
6.37/6.39	LOG: CALL check - Post:1 <= 0 - Process 1
6.37/6.39	* Exit transition: <l0, l2, arg1 = 13 /\ arg2 = 17, {all remain the same}>
6.37/6.39	* Postcondition  : 1 <= 0
6.37/6.39	
6.37/6.39	LOG: CALL solveLinear
6.37/6.39	
6.37/6.39	LOG: RETURN solveLinear - Elapsed time: 0.004148s
6.37/6.39	> Postcondition is not implied!
6.37/6.39	
6.37/6.39	LOG: RETURN check - Elapsed time: 0.004285s
6.37/6.39	Cannot prove unreachability
6.37/6.39	
6.37/6.39	Proving non-termination of subgraph 1
6.37/6.39	Transitions:
6.37/6.39	<l2, l2, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ 3 <= arg2, {arg1 -> 2, arg2 -> 1 + arg1, rest remain the same}>
6.37/6.39	Variables:
6.37/6.39	arg1, arg2
6.37/6.39	
6.37/6.39	Checking conditional non-termination of SCC {l2}...
6.37/6.39	EXIT TRANSITIONS:
6.37/6.39	<l2, end, arg2 <= arg1 /\ 1 <= arg1, {all remain the same}>
6.37/6.39	<l2, end, arg1 <= 0 /\ arg2 <= arg1 /\ arg2 <= 2, {all remain the same}>
6.37/6.39	<l2, end, 1 + arg1 <= arg2 /\ 1 <= arg1 /\ arg2 <= 2, {all remain the same}>
6.37/6.39	<l2, end, arg1 <= 0 /\ 1 + arg1 <= arg2, {all remain the same}>
6.37/6.39	
6.37/6.39	Solving with 1 template(s).
6.37/6.39	
6.37/6.39	LOG: CALL solveNonLinearGetFirstSolution
6.37/6.39	
6.37/6.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018355s
6.37/6.39	Time used: 0.018142
6.37/6.39	Improving Solution with cost 3 ...
6.37/6.39	
6.37/6.39	LOG: CALL solveNonLinearGetNextSolution
6.37/6.39	
6.37/6.39	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021551s
6.37/6.39	Time used: 0.021543
6.37/6.39	Improving Solution with cost 2 ...
6.37/6.39	
6.37/6.39	LOG: CALL solveNonLinearGetNextSolution
6.37/6.39	
6.37/6.39	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029318s
6.37/6.39	Time used: 0.029309
6.37/6.39	
6.37/6.39	LOG: SAT solveNonLinear - Elapsed time: 0.069224s
6.37/6.39	Cost: 2; Total time: 0.068994
6.37/6.39	Non-termination implied by a set of quasi-invariant(s):
6.37/6.39	Quasi-invariant at l2: 2 <= arg1
6.37/6.39	
6.37/6.39	Strengthening and disabling EXIT transitions...
6.37/6.39	Closed exits from l2: 3
6.37/6.39	Strengthening exit transition (result): 
6.37/6.39	<l2, end, 2 <= arg1 /\ arg2 <= arg1, {all remain the same}>
6.37/6.39	
6.37/6.39	Strengthening and disabling transitions...
6.37/6.39	
6.37/6.39	LOG: CALL solverLinear in Graph for feasibility
6.37/6.39	
6.37/6.39	LOG: RETURN solveLinear in Graph for feasibility
6.37/6.39	Strengthening transition (result): 
6.37/6.39	<l2, l2, 2 <= arg1 /\ 1 + arg1 <= arg2 /\ 3 <= arg2, {arg1 -> 2, arg2 -> 1 + arg1, rest remain the same}>
6.37/6.39	
6.37/6.39	Checking conditional non-termination of SCC {l2}...
6.37/6.39	EXIT TRANSITIONS:
6.37/6.39	<l2, end, 2 <= arg1 /\ arg2 <= arg1, {all remain the same}>
6.37/6.39	
6.37/6.39	Solving with 1 template(s).
6.37/6.39	
6.37/6.39	LOG: CALL solveNonLinearGetFirstSolution
6.37/6.39	
6.37/6.39	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005054s
6.37/6.39	Time used: 0.00495
6.37/6.39	
6.37/6.39	LOG: SAT solveNonLinear - Elapsed time: 0.005054s
6.37/6.39	Cost: 0; Total time: 0.00495
6.37/6.39	Non-termination implied by a set of quasi-invariant(s):
6.37/6.39	Quasi-invariant at l2: 1 + arg1 <= arg2
6.37/6.39	
6.37/6.39	Strengthening and disabling EXIT transitions...
6.37/6.39	Closed exits from l2: 1
6.37/6.39	
6.37/6.39	Strengthening and disabling transitions...
6.37/6.39	
6.37/6.39	LOG: CALL solverLinear in Graph for feasibility
6.37/6.39	
6.37/6.39	LOG: RETURN solveLinear in Graph for feasibility
6.37/6.39	Strengthening transition (result): 
6.37/6.39	<l2, l2, 2 <= arg1 /\ 1 + arg1 <= arg2 /\ 3 <= arg2, {arg1 -> 2, arg2 -> 1 + arg1, rest remain the same}>
6.37/6.39	
6.37/6.39	Calling reachability with...
6.37/6.39	Transition: <l2, end, true, {all remain the same}>
6.37/6.39	Conditions: 2 <= arg1, 1 + arg1 <= arg2, 
6.37/6.39	OPEN EXITS: 
6.37/6.39	<l2, end, 2 <= arg1 /\ 1 + arg1 <= arg2, {all remain the same}>
6.37/6.39	
6.37/6.39	--- Reachability graph ---
6.37/6.39	> Graph without transitions.
6.37/6.39	
6.37/6.39	Calling reachability with...
6.37/6.39	Transition: <l0, l2, arg1 = 13 /\ arg2 = 17, {all remain the same}>
6.37/6.39	Conditions: 2 <= arg1, 1 + arg1 <= arg2, 
6.37/6.39	OPEN EXITS: 
6.37/6.39	<l0, l2, 1 + arg1 <= arg2 /\ arg1 = 13 /\ arg2 = 17, {all remain the same}>
6.37/6.39	
6.37/6.39	> Conditions are reachable!
6.37/6.39	
6.37/6.39	Program does NOT terminate
6.37/6.39	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
6.37/6.39	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
6.37/6.39	EOF