5.05/5.11	NO
5.05/5.11	
5.05/5.11	Solver Timeout: 4
5.05/5.11	Global Timeout: 300
5.05/5.11	No parsing errors!
5.05/5.11	Init Location: 0
5.05/5.11	Transitions:
5.05/5.11	<l0, l4, true>
5.05/5.11	<l1, l2, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}>
5.05/5.11	<l2, l3, ((arg1 - (5 * undef5)) = 0) /\ (arg1 > 2), par{arg2 -> undef4}>
5.05/5.11	<l3, l2, (arg1 > 2) /\ ((arg1 - (5 * undef8)) = 0) /\ ((arg1 - (5 * undef8)) < 5) /\ ((arg1 - (5 * undef8)) >= 0), par{arg2 -> undef7}>
5.05/5.11	<l2, l3, ((arg1 - (5 * undef11)) > 0) /\ (arg1 > 2), par{arg2 -> undef10}>
5.05/5.11	<l3, l2, ((arg1 - (5 * undef14)) > 0) /\ ((arg1 - (5 * undef14)) < 5) /\ (arg1 > 2), par{arg1 -> (arg1 - 1), arg2 -> undef13}>
5.05/5.11	<l4, l1, true, par{arg1 -> undef15, arg2 -> undef16}>
5.05/5.11	
5.05/5.11	Fresh variables:
5.05/5.11	undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 
5.05/5.11	
5.05/5.11	Undef variables:
5.05/5.11	undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 
5.05/5.11	
5.05/5.11	Abstraction variables:
5.05/5.11	
5.05/5.11	Exit nodes:
5.05/5.11	
5.05/5.11	Accepting locations:
5.05/5.11	
5.05/5.11	Asserts:
5.05/5.11	
5.05/5.11	Preprocessed LLVMGraph
5.05/5.11	Init Location: 0
5.05/5.11	Transitions:
5.05/5.11	<l0, l2, (arg1 = undef16) /\ (undef15 > 0) /\ (undef16 > ~(1))>
5.05/5.11	<l2, l2, ((arg1 - (5 * undef5)) = 0) /\ (arg1 > 2) /\ (arg1 > 2) /\ ((arg1 - (5 * undef8)) = 0) /\ ((arg1 - (5 * undef8)) < 5) /\ ((arg1 - (5 * undef8)) >= 0)>
5.05/5.11	<l2, l2, ((arg1 - (5 * undef11)) > 0) /\ (arg1 > 2) /\ (arg1 > 2) /\ ((arg1 - (5 * undef8)) = 0) /\ ((arg1 - (5 * undef8)) < 5) /\ ((arg1 - (5 * undef8)) >= 0)>
5.05/5.11	<l2, l2, ((arg1 - (5 * undef11)) > 0) /\ (arg1 > 2) /\ ((arg1 - (5 * undef14)) > 0) /\ ((arg1 - (5 * undef14)) < 5) /\ (arg1 > 2), par{arg1 -> (arg1 - 1)}>
5.05/5.11	
5.05/5.11	Fresh variables:
5.05/5.11	undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 
5.05/5.11	
5.05/5.11	Undef variables:
5.05/5.11	undef2, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, undef16, 
5.05/5.11	
5.05/5.11	Abstraction variables:
5.05/5.11	
5.05/5.11	Exit nodes:
5.05/5.11	
5.05/5.11	Accepting locations:
5.05/5.11	
5.05/5.11	Asserts:
5.05/5.11	
5.05/5.11	*************************************************************
5.05/5.11	*******************************************************************************************
5.05/5.11	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.05/5.11	*******************************************************************************************
5.05/5.11	
5.05/5.11	Init Location: 0
5.05/5.11	Graph 0:
5.05/5.11	Transitions:
5.05/5.11	Variables:
5.05/5.11	
5.05/5.11	Graph 1:
5.05/5.11	Transitions:
5.05/5.11	<l2, l2, 3 <= arg1 /\ arg1 = 5*undef5 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 3 <= arg1 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 1 + 5*undef14 <= arg1 /\ 3 <= arg1 /\ arg1 <= 4 + 5*undef14, {arg1 -> -1 + arg1, rest remain the same}>
5.05/5.11	Variables:
5.05/5.11	arg1
5.05/5.11	
5.05/5.11	Precedence: 
5.05/5.11	Graph 0
5.05/5.11	
5.05/5.11	Graph 1
5.05/5.11	<l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = undef16, {all remain the same}>
5.05/5.11	
5.05/5.11	Map Locations to Subgraph:
5.05/5.11	( 0 , 0 )
5.05/5.11	( 2 , 1 )
5.05/5.11	
5.05/5.11	*******************************************************************************************
5.05/5.11	********************************    CHECKING ASSERTIONS    ********************************
5.05/5.11	*******************************************************************************************
5.05/5.11	
5.05/5.11	Proving termination of subgraph 0
5.05/5.11	Proving termination of subgraph 1
5.05/5.11	Checking unfeasibility...
5.05/5.11	Time used: 0.004405
5.05/5.11	
5.05/5.11	Checking conditional termination of SCC {l2}...
5.05/5.11	
5.05/5.11	LOG: CALL solveLinear
5.05/5.11	
5.05/5.11	LOG: RETURN solveLinear - Elapsed time: 0.000981s
5.05/5.11	Ranking function: -3 + arg1
5.05/5.11	New Graphs: 
5.05/5.11	Transitions:
5.05/5.11	<l2, l2, 3 <= arg1 /\ arg1 = 5*undef5 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 3 <= arg1 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	Variables:
5.05/5.11	arg1
5.05/5.11	> No variable changes in termination graph.
5.05/5.11	Checking conditional unfeasibility...
5.05/5.11	Calling Safety with literal arg1 <= 2 and entry <l2, l2, true, {all remain the same}>
5.05/5.11	
5.05/5.11	LOG: CALL check - Post:arg1 <= 2 - Process 1
5.05/5.11	* Exit transition: <l2, l2, true, {all remain the same}>
5.05/5.11	* Postcondition  : arg1 <= 2
5.05/5.11	Quasi-invariants: 
5.05/5.11	Location 2: arg1 <= 2 ; 
5.05/5.11	Postcondition: arg1 <= 2
5.05/5.11	
5.05/5.11	LOG: CALL check - Post:arg1 <= 2 - Process 2
5.05/5.11	* Exit transition: <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = undef16, {all remain the same}>
5.05/5.11	* Postcondition  : arg1 <= 2
5.05/5.11	
5.05/5.11	LOG: CALL solveLinear
5.05/5.11	
5.05/5.11	LOG: RETURN solveLinear - Elapsed time: 0.000420s
5.05/5.11	> Postcondition is not implied!
5.05/5.11	
5.05/5.11	LOG: RETURN check - Elapsed time: 0.000519s
5.05/5.11	
5.05/5.11	LOG: NarrowEntry size 1
5.05/5.11	Narrowing transition: 
5.05/5.11	<l2, l2, 3 <= arg1 /\ arg1 = 5*undef5 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	
5.05/5.11	LOG: Narrow transition size 1
5.05/5.11	Narrowing transition: 
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 3 <= arg1 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	
5.05/5.11	LOG: Narrow transition size 1
5.05/5.11	Narrowing transition: 
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 1 + 5*undef14 <= arg1 /\ 3 <= arg1 /\ arg1 <= 4 + 5*undef14, {arg1 -> -1 + arg1, rest remain the same}>
5.05/5.11	
5.05/5.11	LOG: Narrow transition size 1
5.05/5.11	ENTRIES:
5.05/5.11	<l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ 3 <= arg1 /\ arg1 = undef16, {all remain the same}>
5.05/5.11	END ENTRIES:
5.05/5.11	GRAPH:
5.05/5.11	<l2, l2, 3 <= arg1 /\ arg1 = 5*undef5 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 3 <= arg1 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 1 + 5*undef14 <= arg1 /\ 3 <= arg1 /\ arg1 <= 4 + 5*undef14, {arg1 -> -1 + arg1, rest remain the same}>
5.05/5.11	END GRAPH:
5.05/5.11	EXIT: <l2, l2, true, {all remain the same}>
5.05/5.11	POST: arg1 <= 2
5.05/5.11	
5.05/5.11	
5.05/5.11	LOG: Try proving POST
5.05/5.11	Solving with 1 template(s).
5.05/5.11	
5.05/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.05/5.11	
5.05/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015844s
5.05/5.11	Time used: 0.015739
5.05/5.11	Solving with 2 template(s).
5.05/5.11	
5.05/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.05/5.11	
5.05/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001279s
5.05/5.11	Time used: 4.0005
5.05/5.11	Solving with 3 template(s).
5.05/5.11	
5.05/5.11	LOG: CALL solveNonLinearGetFirstSolution
5.05/5.11	
5.05/5.11	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007324s
5.05/5.11	Time used: 1.00049
5.05/5.11	
5.05/5.11	LOG: Postcondition is not implied - no solution
5.05/5.11	> Postcondition is not implied!
5.05/5.11	
5.05/5.11	LOG: RETURN check - Elapsed time: 5.034763s
5.05/5.11	
5.05/5.11	Proving non-termination of subgraph 1
5.05/5.11	Transitions:
5.05/5.11	<l2, l2, 3 <= arg1 /\ arg1 = 5*undef5 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 3 <= arg1 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 1 + 5*undef14 <= arg1 /\ 3 <= arg1 /\ arg1 <= 4 + 5*undef14, {arg1 -> -1 + arg1, rest remain the same}>
5.05/5.11	Variables:
5.05/5.11	arg1
5.05/5.11	
5.05/5.11	Checking that every undef value has an assignment...
5.05/5.11	
5.05/5.11	LOG: CALL solveLinear
5.05/5.11	
5.05/5.11	LOG: RETURN solveLinear - Elapsed time: 0.001365s
5.05/5.11	Checking conditional non-termination of SCC {l2}...
5.05/5.11	> No assignment for some undef value.
5.05/5.11	> Checking if the negation of the conditions of every pending exit is quasi-invariant... NO
5.05/5.11	
5.05/5.11	Proving non-termination of subgraph 1
5.05/5.11	Transitions:
5.05/5.11	<l2, l2, 3 <= arg1 /\ arg1 = 5*undef5 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	<l2, l2, 1 + 5*undef11 <= arg1 /\ 3 <= arg1 /\ arg1 = 5*undef8, {all remain the same}>
5.05/5.11	Variables:
5.05/5.11	arg1
5.05/5.11	
5.05/5.11	Checking that every undef value has an assignment...
5.05/5.11	
5.05/5.11	LOG: CALL solveLinear
5.05/5.11	
5.05/5.11	LOG: RETURN solveLinear - Elapsed time: 0.001043s
5.05/5.11	Checking conditional non-termination of SCC {l2}...
5.05/5.11	> No assignment for some undef value.
5.05/5.11	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
5.05/5.11	Calling reachability with...
5.05/5.11	Transition: <l2, end, true, {all remain the same}>
5.05/5.11	Conditions: 3 <= arg1, 
5.05/5.11	OPEN EXITS: 
5.05/5.11	<l2, end, 3 <= arg1, {all remain the same}>
5.05/5.11	
5.05/5.11	--- Reachability graph ---
5.05/5.11	> Graph without transitions.
5.05/5.11	
5.05/5.11	Calling reachability with...
5.05/5.11	Transition: <l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ arg1 = undef16, {all remain the same}>
5.05/5.11	Conditions: 3 <= arg1, 
5.05/5.11	OPEN EXITS: 
5.05/5.11	<l0, l2, 0 <= undef16 /\ 1 <= undef15 /\ 3 <= arg1 /\ arg1 = undef16, {all remain the same}>
5.05/5.11	
5.05/5.11	> Conditions are reachable!
5.05/5.11	
5.05/5.11	Program does NOT terminate
5.05/5.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.05/5.11	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.05/5.11	EOF