6.63/6.69	NO
6.63/6.69	
6.63/6.69	Solver Timeout: 4
6.63/6.69	Global Timeout: 300
6.63/6.69	No parsing errors!
6.63/6.69	Init Location: 0
6.63/6.69	Transitions:
6.63/6.69	<l0, l4, true>
6.63/6.69	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
6.63/6.69	<l2, l3, (arg1 < 15), par{arg2 -> undef4}>
6.63/6.69	<l3, l2, (arg1 < 15) /\ (((arg1 + 1) - (10 * undef7)) < 10) /\ (((arg1 + 1) - (10 * undef7)) >= 0), par{arg1 -> ((arg1 + 1) - (10 * undef7)), arg2 -> undef6}>
6.63/6.69	<l4, l1, true, par{arg1 -> undef8, arg2 -> undef9}>
6.63/6.69	
6.63/6.69	Fresh variables:
6.63/6.69	undef2, undef4, undef6, undef7, undef8, undef9, 
6.63/6.69	
6.63/6.69	Undef variables:
6.63/6.69	undef2, undef4, undef6, undef7, undef8, undef9, 
6.63/6.69	
6.63/6.69	Abstraction variables:
6.63/6.69	
6.63/6.69	Exit nodes:
6.63/6.69	
6.63/6.69	Accepting locations:
6.63/6.69	
6.63/6.69	Asserts:
6.63/6.69	
6.63/6.69	Preprocessed LLVMGraph
6.63/6.69	Init Location: 0
6.63/6.69	Transitions:
6.63/6.69	<l0, l2, (arg1 = undef9) /\ (undef8 > 0) /\ (undef9 > ~(1))>
6.63/6.69	<l2, l2, (arg1 < 15) /\ (arg1 < 15) /\ (((arg1 + 1) - (10 * undef7)) < 10) /\ (((arg1 + 1) - (10 * undef7)) >= 0), par{arg1 -> ((arg1 + 1) - (10 * undef7))}>
6.63/6.69	
6.63/6.69	Fresh variables:
6.63/6.69	undef2, undef4, undef6, undef7, undef8, undef9, 
6.63/6.69	
6.63/6.69	Undef variables:
6.63/6.69	undef2, undef4, undef6, undef7, undef8, undef9, 
6.63/6.69	
6.63/6.69	Abstraction variables:
6.63/6.69	
6.63/6.69	Exit nodes:
6.63/6.69	
6.63/6.69	Accepting locations:
6.63/6.69	
6.63/6.69	Asserts:
6.63/6.69	
6.63/6.69	*************************************************************
6.63/6.69	*******************************************************************************************
6.63/6.69	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
6.63/6.69	*******************************************************************************************
6.63/6.69	
6.63/6.69	Init Location: 0
6.63/6.69	Graph 0:
6.63/6.69	Transitions:
6.63/6.69	Variables:
6.63/6.69	
6.63/6.69	Graph 1:
6.63/6.69	Transitions:
6.63/6.69	<l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
6.63/6.69	Variables:
6.63/6.69	arg1
6.63/6.69	
6.63/6.69	Precedence: 
6.63/6.69	Graph 0
6.63/6.69	
6.63/6.69	Graph 1
6.63/6.69	<l0, l2, 0 <= undef9 /\ 1 <= undef8 /\ arg1 = undef9, {all remain the same}>
6.63/6.69	
6.63/6.69	Map Locations to Subgraph:
6.63/6.69	( 0 , 0 )
6.63/6.69	( 2 , 1 )
6.63/6.69	
6.63/6.69	*******************************************************************************************
6.63/6.69	********************************    CHECKING ASSERTIONS    ********************************
6.63/6.69	*******************************************************************************************
6.63/6.69	
6.63/6.69	Proving termination of subgraph 0
6.63/6.69	Proving termination of subgraph 1
6.63/6.69	Checking unfeasibility...
6.63/6.69	Time used: 0.001913
6.63/6.69	
6.63/6.69	Checking conditional termination of SCC {l2}...
6.63/6.69	
6.63/6.69	LOG: CALL solveLinear
6.63/6.69	
6.63/6.69	LOG: RETURN solveLinear - Elapsed time: 0.000657s
6.63/6.69	
6.63/6.69	LOG: CALL solveLinear
6.63/6.69	
6.63/6.69	LOG: RETURN solveLinear - Elapsed time: 0.002511s
6.63/6.69	Trying to remove transition: <l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
6.63/6.69	Solving with 1 template(s).
6.63/6.69	
6.63/6.69	LOG: CALL solveNonLinearGetFirstSolution
6.63/6.69	
6.63/6.69	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003777s
6.63/6.69	Time used: 0.003635
6.63/6.69	Solving with 1 template(s).
6.63/6.69	
6.63/6.69	LOG: CALL solveNonLinearGetFirstSolution
6.63/6.69	
6.63/6.69	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.122924s
6.63/6.69	Time used: 0.122606
6.63/6.69	Improving Solution with cost 1 ...
6.63/6.69	
6.63/6.69	LOG: CALL solveNonLinearGetNextSolution
6.63/6.69	
6.63/6.69	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030915s
6.63/6.69	Time used: 0.03091
6.63/6.69	
6.63/6.69	LOG: SAT solveNonLinear - Elapsed time: 0.153839s
6.63/6.69	Cost: 1; Total time: 0.153516
6.63/6.69	Failed at location 2: 15 <= arg1
6.63/6.69	Before Improving: 
6.63/6.69	Quasi-invariant at l2: 15 <= arg1
6.63/6.69	Optimizing invariants...
6.63/6.69	
6.63/6.69	LOG: CALL solveLinear
6.63/6.69	
6.63/6.69	LOG: RETURN solveLinear - Elapsed time: 0.004270s
6.63/6.69	Remaining time after improvement: 0.99868
6.63/6.69	Termination implied by a set of quasi-invariant(s):
6.63/6.69	Quasi-invariant at l2: 15 <= arg1
6.63/6.69	[ Invariant Graph ]
6.63/6.69	Strengthening and disabling transitions...
6.63/6.69	
6.63/6.69	LOG: CALL solverLinear in Graph for feasibility
6.63/6.69	
6.63/6.69	LOG: RETURN solveLinear in Graph for feasibility
6.63/6.69	It's unfeasible. Removing transition: 
6.63/6.69	<l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
6.63/6.69	[ Termination Graph ]
6.63/6.69	Strengthening and disabling transitions...
6.63/6.69	> It's unfeasible. Removing transition: 
6.63/6.69	<l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
6.63/6.69	New Graphs: 
6.63/6.69	Calling Safety with literal 15 <= arg1 and entry <l0, l2, 0 <= undef9 /\ 1 <= undef8 /\ arg1 = undef9, {all remain the same}>
6.63/6.69	
6.63/6.69	LOG: CALL check - Post:15 <= arg1 - Process 1
6.63/6.69	* Exit transition: <l0, l2, 0 <= undef9 /\ 1 <= undef8 /\ arg1 = undef9, {all remain the same}>
6.63/6.69	* Postcondition  : 15 <= arg1
6.63/6.69	
6.63/6.69	LOG: CALL solveLinear
6.63/6.69	
6.63/6.69	LOG: RETURN solveLinear - Elapsed time: 0.000545s
6.63/6.69	> Postcondition is not implied!
6.63/6.69	
6.63/6.69	LOG: RETURN check - Elapsed time: 0.000640s
6.63/6.69	INVARIANTS: 
6.63/6.69	2: 
6.63/6.69	Quasi-INVARIANTS to narrow Graph: 
6.63/6.69	2: 15 <= arg1 , 
6.63/6.69	Narrowing transition: 
6.63/6.69	<l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
6.63/6.69	
6.63/6.69	LOG: Narrow transition size 1
6.63/6.69	invGraph after Narrowing: 
6.63/6.69	Transitions:
6.63/6.69	<l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
6.63/6.69	Variables:
6.63/6.69	arg1
6.63/6.69	Checking conditional termination of SCC {l2}...
6.63/6.69	
6.63/6.69	LOG: CALL solveLinear
6.63/6.69	
6.63/6.69	LOG: RETURN solveLinear - Elapsed time: 0.000601s
6.63/6.69	
6.63/6.69	LOG: CALL solveLinear
6.63/6.69	
6.63/6.69	LOG: RETURN solveLinear - Elapsed time: 0.002401s
6.63/6.69	Trying to remove transition: <l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
6.63/6.69	Solving with 1 template(s).
6.63/6.69	
6.63/6.69	LOG: CALL solveNonLinearGetFirstSolution
6.63/6.69	
6.63/6.69	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003404s
6.63/6.69	Time used: 0.003247
6.63/6.69	Solving with 1 template(s).
6.63/6.69	
6.63/6.69	LOG: CALL solveNonLinearGetFirstSolution
6.63/6.69	
6.63/6.69	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.403023s
6.63/6.69	Time used: 1.40281
6.63/6.69	Solving with 2 template(s).
6.63/6.69	
6.63/6.69	LOG: CALL solveNonLinearGetFirstSolution
6.63/6.69	
6.63/6.69	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.030806s
6.63/6.69	Time used: 4.00084
6.63/6.69	Solving with 3 template(s).
6.63/6.69	
6.63/6.69	LOG: CALL solveNonLinearGetFirstSolution
6.63/6.69	
6.63/6.69	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008339s
6.63/6.69	Time used: 1.00051
6.63/6.69	Solving with 1 template(s).
6.63/6.69	
6.63/6.69	LOG: CALL solveNonLinearGetFirstSolution
6.63/6.69	
6.63/6.69	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009075s
6.63/6.69	Time used: 0.005788
6.63/6.69	
6.63/6.69	Proving non-termination of subgraph 1
6.63/6.69	Transitions:
6.63/6.69	<l2, l2, 10*undef7 <= 1 + arg1 /\ arg1 <= 14 /\ arg1 <= 8 + 10*undef7, {arg1 -> 1 + arg1 - 10*undef7, rest remain the same}>
6.63/6.69	Variables:
6.63/6.69	arg1
6.63/6.69	
6.63/6.69	Checking that every undef value has an assignment...
6.63/6.69	
6.63/6.69	LOG: CALL solveLinear
6.63/6.69	
6.63/6.69	LOG: RETURN solveLinear - Elapsed time: 0.000634s
6.63/6.69	Checking conditional non-termination of SCC {l2}...
6.63/6.69	> No assignment for some undef value.
6.63/6.69	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
6.63/6.69	Calling reachability with...
6.63/6.69	Transition: <l2, end, true, {all remain the same}>
6.63/6.69	Conditions: arg1 <= 14, 
6.63/6.69	OPEN EXITS: 
6.63/6.69	<l2, end, arg1 <= 14, {all remain the same}>
6.63/6.69	
6.63/6.69	--- Reachability graph ---
6.63/6.69	> Graph without transitions.
6.63/6.69	
6.63/6.69	Calling reachability with...
6.63/6.69	Transition: <l0, l2, 0 <= undef9 /\ 1 <= undef8 /\ arg1 = undef9, {all remain the same}>
6.63/6.69	Conditions: arg1 <= 14, 
6.63/6.69	OPEN EXITS: 
6.63/6.69	<l0, l2, 0 <= undef9 /\ 1 <= undef8 /\ arg1 <= 14 /\ arg1 = undef9, {all remain the same}>
6.63/6.69	
6.63/6.69	> Conditions are reachable!
6.63/6.69	
6.63/6.69	Program does NOT terminate
6.63/6.69	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
6.63/6.69	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
6.63/6.69	EOF