33.28/33.34	NO
33.28/33.34	
33.28/33.34	Solver Timeout: 4
33.28/33.34	Global Timeout: 300
33.28/33.34	No parsing errors!
33.28/33.34	Init Location: 0
33.28/33.34	Transitions:
33.28/33.34	<l0, l3, true>
33.28/33.34	<l1, l1, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 - 1)}>
33.28/33.34	<l2, l1, (undef4 <= arg1) /\ (arg2 > ~(1)) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 - 1), arg3 -> arg2}>
33.28/33.34	<l3, l2, true, par{arg1 -> undef7, arg2 -> undef8, arg3 -> undef9}>
33.28/33.34	
33.28/33.34	Fresh variables:
33.28/33.34	undef1, undef4, undef7, undef8, undef9, 
33.28/33.34	
33.28/33.34	Undef variables:
33.28/33.34	undef1, undef4, undef7, undef8, undef9, 
33.28/33.34	
33.28/33.34	Abstraction variables:
33.28/33.34	
33.28/33.34	Exit nodes:
33.28/33.34	
33.28/33.34	Accepting locations:
33.28/33.34	
33.28/33.34	Asserts:
33.28/33.34	
33.28/33.34	Preprocessed LLVMGraph
33.28/33.34	Init Location: 0
33.28/33.34	Transitions:
33.28/33.34	<l0, l1, (arg1 = undef4) /\ (arg2 = (undef8 - 1)) /\ (undef4 <= undef7) /\ (undef8 > ~(1)) /\ (undef7 > 0) /\ (undef4 > 0)>
33.28/33.34	<l1, l1, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 - 1)}>
33.28/33.34	
33.28/33.34	Fresh variables:
33.28/33.34	undef1, undef4, undef7, undef8, undef9, 
33.28/33.34	
33.28/33.34	Undef variables:
33.28/33.34	undef1, undef4, undef7, undef8, undef9, 
33.28/33.34	
33.28/33.34	Abstraction variables:
33.28/33.34	
33.28/33.34	Exit nodes:
33.28/33.34	
33.28/33.34	Accepting locations:
33.28/33.34	
33.28/33.34	Asserts:
33.28/33.34	
33.28/33.34	*************************************************************
33.28/33.34	*******************************************************************************************
33.28/33.34	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
33.28/33.34	*******************************************************************************************
33.28/33.34	
33.28/33.34	Init Location: 0
33.28/33.34	Graph 0:
33.28/33.34	Transitions:
33.28/33.34	Variables:
33.28/33.34	
33.28/33.34	Graph 1:
33.28/33.34	Transitions:
33.28/33.34	<l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1, {arg1 -> undef1, arg2 -> -1 + arg2, rest remain the same}>
33.28/33.34	Variables:
33.28/33.34	arg1, arg2
33.28/33.34	
33.28/33.34	Precedence: 
33.28/33.34	Graph 0
33.28/33.34	
33.28/33.34	Graph 1
33.28/33.34	<l0, l1, undef4 <= undef7 /\ 0 <= undef8 /\ 1 <= undef4 /\ 1 <= undef7 /\ arg1 = undef4 /\ 1 + arg2 = undef8, {all remain the same}>
33.28/33.34	
33.28/33.34	Map Locations to Subgraph:
33.28/33.34	( 0 , 0 )
33.28/33.34	( 1 , 1 )
33.28/33.34	
33.28/33.34	*******************************************************************************************
33.28/33.34	********************************    CHECKING ASSERTIONS    ********************************
33.28/33.34	*******************************************************************************************
33.28/33.34	
33.28/33.34	Proving termination of subgraph 0
33.28/33.34	Proving termination of subgraph 1
33.28/33.34	Checking unfeasibility...
33.28/33.34	Time used: 0.002495
33.28/33.34	
33.28/33.34	Checking conditional termination of SCC {l1}...
33.28/33.34	
33.28/33.34	LOG: CALL solveLinear
33.28/33.34	
33.28/33.34	LOG: RETURN solveLinear - Elapsed time: 0.000654s
33.28/33.34	
33.28/33.34	LOG: CALL solveLinear
33.28/33.34	
33.28/33.34	LOG: RETURN solveLinear - Elapsed time: 0.002203s
33.28/33.34	Trying to remove transition: <l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1, {arg1 -> undef1, arg2 -> -1 + arg2, rest remain the same}>
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006038s
33.28/33.34	Time used: 0.005855
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002614s
33.28/33.34	Time used: 4.00162
33.28/33.34	Solving with 2 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005733s
33.28/33.34	Time used: 4.00067
33.28/33.34	Solving with 3 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004858s
33.28/33.34	Time used: 1.00036
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012178s
33.28/33.34	Time used: 0.008602
33.28/33.34	Improving Solution with cost 1 ...
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetNextSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000745s
33.28/33.34	Time used: 1.0005
33.28/33.34	
33.28/33.34	LOG: SAT solveNonLinear - Elapsed time: 1.012923s
33.28/33.34	Cost: 1; Total time: 1.0091
33.28/33.34	Quasi-ranking function: 50000 + arg2
33.28/33.34	New Graphs: 
33.28/33.34	Transitions:
33.28/33.34	<l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1 /\ 50001 + arg2 <= 0, {arg1 -> undef1, arg2 -> -1 + arg2, rest remain the same}>
33.28/33.34	Variables:
33.28/33.34	arg1, arg2
33.28/33.34	Checking conditional termination of SCC {l1}...
33.28/33.34	
33.28/33.34	LOG: CALL solveLinear
33.28/33.34	
33.28/33.34	LOG: RETURN solveLinear - Elapsed time: 0.000722s
33.28/33.34	
33.28/33.34	LOG: CALL solveLinear
33.28/33.34	
33.28/33.34	LOG: RETURN solveLinear - Elapsed time: 0.002767s
33.28/33.34	Trying to remove transition: <l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1 /\ 50001 + arg2 <= 0, {arg1 -> undef1, arg2 -> -1 + arg2, rest remain the same}>
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008380s
33.28/33.34	Time used: 0.008203
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002519s
33.28/33.34	Time used: 4.00145
33.28/33.34	Solving with 2 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006205s
33.28/33.34	Time used: 4.00082
33.28/33.34	Solving with 3 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004619s
33.28/33.34	Time used: 1.00043
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012838s
33.28/33.34	Time used: 0.009132
33.28/33.34	Improving Solution with cost 1 ...
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetNextSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001070s
33.28/33.34	Time used: 1.00083
33.28/33.34	
33.28/33.34	LOG: SAT solveNonLinear - Elapsed time: 1.013908s
33.28/33.34	Cost: 1; Total time: 1.00996
33.28/33.34	Quasi-ranking function: 50000 + 50000*arg1 + arg2
33.28/33.34	New Graphs: 
33.28/33.34	Transitions:
33.28/33.34	<l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1 /\ 50001 + 50000*arg1 + arg2 <= 0 /\ 50001 + arg2 <= 0, {arg1 -> undef1, arg2 -> -1 + arg2, rest remain the same}>
33.28/33.34	Variables:
33.28/33.34	arg1, arg2
33.28/33.34	Checking conditional termination of SCC {l1}...
33.28/33.34	
33.28/33.34	LOG: CALL solveLinear
33.28/33.34	
33.28/33.34	LOG: RETURN solveLinear - Elapsed time: 0.000867s
33.28/33.34	
33.28/33.34	LOG: CALL solveLinear
33.28/33.34	
33.28/33.34	LOG: RETURN solveLinear - Elapsed time: 0.004331s
33.28/33.34	Trying to remove transition: <l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1 /\ 50001 + 50000*arg1 + arg2 <= 0 /\ 50001 + arg2 <= 0, {arg1 -> undef1, arg2 -> -1 + arg2, rest remain the same}>
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008216s
33.28/33.34	Time used: 0.008013
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002405s
33.28/33.34	Time used: 4.00114
33.28/33.34	Solving with 2 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006375s
33.28/33.34	Time used: 4.00082
33.28/33.34	Solving with 3 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004997s
33.28/33.34	Time used: 1.00077
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.081665s
33.28/33.34	Time used: 4.07602
33.28/33.34	Termination failed. Trying to show unreachability...
33.28/33.34	Proving unreachability of entry: <l0, l1, undef4 <= undef7 /\ 0 <= undef8 /\ 1 <= undef4 /\ 1 <= undef7 /\ arg1 = undef4 /\ 1 + arg2 = undef8, {all remain the same}>
33.28/33.34	
33.28/33.34	LOG: CALL check - Post:1 <= 0 - Process 1
33.28/33.34	* Exit transition: <l0, l1, undef4 <= undef7 /\ 0 <= undef8 /\ 1 <= undef4 /\ 1 <= undef7 /\ arg1 = undef4 /\ 1 + arg2 = undef8, {all remain the same}>
33.28/33.34	* Postcondition  : 1 <= 0
33.28/33.34	
33.28/33.34	LOG: CALL solveLinear
33.28/33.34	
33.28/33.34	LOG: RETURN solveLinear - Elapsed time: 0.007916s
33.28/33.34	> Postcondition is not implied!
33.28/33.34	
33.28/33.34	LOG: RETURN check - Elapsed time: 0.008069s
33.28/33.34	Cannot prove unreachability
33.28/33.34	
33.28/33.34	Proving non-termination of subgraph 1
33.28/33.34	Transitions:
33.28/33.34	<l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1, {arg1 -> undef1, arg2 -> -1 + arg2, rest remain the same}>
33.28/33.34	Variables:
33.28/33.34	arg1, arg2
33.28/33.34	
33.28/33.34	Checking that every undef value has an assignment...
33.28/33.34	
33.28/33.34	LOG: CALL solveLinear
33.28/33.34	
33.28/33.34	LOG: RETURN solveLinear - Elapsed time: 0.001050s
33.28/33.34	Checking conditional non-termination of SCC {l1}...
33.28/33.34	EXIT TRANSITIONS:
33.28/33.34	<l1, end, arg1 <= 0, {all remain the same}>
33.28/33.34	
33.28/33.34	Solving with 1 template(s).
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinearGetFirstSolution
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014769s
33.28/33.34	Time used: 0.014657
33.28/33.34	
33.28/33.34	LOG: SAT solveNonLinear - Elapsed time: 0.014769s
33.28/33.34	Cost: 0; Total time: 0.014657
33.28/33.34	Minimizing number of undef constraints...
33.28/33.34	
33.28/33.34	LOG: CALL solveNonLinear
33.28/33.34	
33.28/33.34	LOG: RETURN solveNonLinear - Elapsed time: 0.004306s
33.28/33.34	Number of undef constraints reduced!
33.28/33.34	
33.28/33.34	Non-termination implied by a set of quasi-invariant(s):
33.28/33.34	Quasi-invariant at l1: 1 <= arg1
33.28/33.34	
33.28/33.34	Strengthening and disabling EXIT transitions...
33.28/33.34	Closed exits from l1: 1
33.28/33.34	
33.28/33.34	Strengthening and disabling transitions...
33.28/33.34	
33.28/33.34	LOG: CALL solverLinear in Graph for feasibility
33.28/33.34	
33.28/33.34	LOG: RETURN solveLinear in Graph for feasibility
33.28/33.34	Strengthening transition (result): 
33.28/33.34	<l1, l1, undef1 <= arg1 /\ 1 <= arg1 /\ 1 <= undef1, {arg1 -> undef1, arg2 -> -1 + arg2, rest remain the same}>
33.28/33.34	
33.28/33.34	Calling reachability with...
33.28/33.34	Transition: <l1, end, true, {all remain the same}>
33.28/33.34	Conditions: 1 <= arg1, 
33.28/33.34	OPEN EXITS: 
33.28/33.34	<l1, end, 1 <= arg1, {all remain the same}>
33.28/33.34	
33.28/33.34	--- Reachability graph ---
33.28/33.34	> Graph without transitions.
33.28/33.34	
33.28/33.34	Calling reachability with...
33.28/33.34	Transition: <l0, l1, undef4 <= undef7 /\ 0 <= undef8 /\ 1 <= undef4 /\ 1 <= undef7 /\ arg1 = undef4 /\ 1 + arg2 = undef8, {all remain the same}>
33.28/33.34	Conditions: 1 <= arg1, 
33.28/33.34	OPEN EXITS: 
33.28/33.34	<l0, l1, undef4 <= undef7 /\ 0 <= undef8 /\ 1 <= arg1 /\ 1 <= undef4 /\ 1 <= undef7 /\ arg1 = undef4 /\ 1 + arg2 = undef8, {all remain the same}>
33.28/33.34	
33.28/33.34	> Conditions are reachable!
33.28/33.34	
33.28/33.34	Program does NOT terminate
33.28/33.34	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
33.28/33.34	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
33.28/33.34	EOF