5.17/5.23	NO
5.17/5.23	
5.17/5.23	Solver Timeout: 4
5.17/5.23	Global Timeout: 300
5.17/5.23	No parsing errors!
5.17/5.23	Init Location: 0
5.17/5.23	Transitions:
5.17/5.23	<l0, l4, true>
5.17/5.23	<l1, l2, (undef5 = ((0 + __const_300^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef5)), par{x^0 -> undef5}>
5.17/5.23	<l2, l1, (undef10 = ((0 + __const_400^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}>
5.17/5.23	<l3, l1, (undef15 = ((0 + __const_200^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef15)), par{x^0 -> undef15}>
5.17/5.23	<l3, l2, (undef20 = ((0 + __const_100^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef20)), par{x^0 -> undef20}>
5.17/5.23	<l4, l3, true>
5.17/5.23	
5.17/5.23	Fresh variables:
5.17/5.23	undef5, undef10, undef15, undef20, 
5.17/5.23	
5.17/5.23	Undef variables:
5.17/5.23	undef5, undef10, undef15, undef20, 
5.17/5.23	
5.17/5.23	Abstraction variables:
5.17/5.23	
5.17/5.23	Exit nodes:
5.17/5.23	
5.17/5.23	Accepting locations:
5.17/5.23	
5.17/5.23	Asserts:
5.17/5.23	
5.17/5.23	Preprocessed LLVMGraph
5.17/5.23	Init Location: 0
5.17/5.23	Transitions:
5.17/5.23	<l0, l1, (undef15 = ((0 + __const_200^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef15)), par{x^0 -> undef15}>
5.17/5.23	<l0, l1, (undef20 = ((0 + __const_100^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef20)) /\ (undef10 = ((0 + __const_400^0) + undef20)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}>
5.17/5.23	<l1, l1, (undef5 = ((0 + __const_300^0) + x^0)) /\ ((1 + __const_100^0) <= (0 + undef5)) /\ (undef10 = ((0 + __const_400^0) + undef5)) /\ ((1 + __const_100^0) <= (0 + undef10)), par{x^0 -> undef10}>
5.17/5.23	
5.17/5.23	Fresh variables:
5.17/5.23	undef5, undef10, undef15, undef20, 
5.17/5.23	
5.17/5.23	Undef variables:
5.17/5.23	undef5, undef10, undef15, undef20, 
5.17/5.23	
5.17/5.23	Abstraction variables:
5.17/5.23	
5.17/5.23	Exit nodes:
5.17/5.23	
5.17/5.23	Accepting locations:
5.17/5.23	
5.17/5.23	Asserts:
5.17/5.23	
5.17/5.23	*************************************************************
5.17/5.23	*******************************************************************************************
5.17/5.23	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
5.17/5.23	*******************************************************************************************
5.17/5.23	
5.17/5.23	Init Location: 0
5.17/5.23	Graph 0:
5.17/5.23	Transitions:
5.17/5.23	Variables:
5.17/5.23	
5.17/5.23	Graph 1:
5.17/5.23	Transitions:
5.17/5.23	<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Variables:
5.17/5.23	__const_100^0, __const_300^0, __const_400^0, x^0
5.17/5.23	
5.17/5.23	Precedence: 
5.17/5.23	Graph 0
5.17/5.23	
5.17/5.23	Graph 1
5.17/5.23	<l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
5.17/5.23	<l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	
5.17/5.23	Map Locations to Subgraph:
5.17/5.23	( 0 , 0 )
5.17/5.23	( 1 , 1 )
5.17/5.23	
5.17/5.23	*******************************************************************************************
5.17/5.23	********************************    CHECKING ASSERTIONS    ********************************
5.17/5.23	*******************************************************************************************
5.17/5.23	
5.17/5.23	Proving termination of subgraph 0
5.17/5.23	Proving termination of subgraph 1
5.17/5.23	Checking unfeasibility...
5.17/5.23	Time used: 0.00355
5.17/5.23	
5.17/5.23	Checking conditional termination of SCC {l1}...
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.000853s
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.003435s
5.17/5.23	Trying to remove transition: <l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Solving with 1 template(s).
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetFirstSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008543s
5.17/5.23	Time used: 0.008295
5.17/5.23	Solving with 1 template(s).
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetFirstSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012776s
5.17/5.23	Time used: 0.012139
5.17/5.23	Improving Solution with cost 2 ...
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetNextSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018572s
5.17/5.23	Time used: 0.018563
5.17/5.23	
5.17/5.23	LOG: SAT solveNonLinear - Elapsed time: 0.031347s
5.17/5.23	Cost: 2; Total time: 0.030702
5.17/5.23	Failed at location 1: __const_300^0 + x^0 <= __const_100^0
5.17/5.23	Failed at location 1: __const_300^0 + x^0 <= __const_100^0
5.17/5.23	Before Improving: 
5.17/5.23	Quasi-invariant at l1: __const_300^0 + x^0 <= __const_100^0
5.17/5.23	Optimizing invariants...
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.003599s
5.17/5.23	Remaining time after improvement: 0.998308
5.17/5.23	Termination implied by a set of quasi-invariant(s):
5.17/5.23	Quasi-invariant at l1: __const_300^0 + x^0 <= __const_100^0
5.17/5.23	[ Invariant Graph ]
5.17/5.23	Strengthening and disabling transitions...
5.17/5.23	
5.17/5.23	LOG: CALL solverLinear in Graph for feasibility
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear in Graph for feasibility
5.17/5.23	It's unfeasible. Removing transition: 
5.17/5.23	<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	[ Termination Graph ]
5.17/5.23	Strengthening and disabling transitions...
5.17/5.23	> It's unfeasible. Removing transition: 
5.17/5.23	<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	New Graphs: 
5.17/5.23	Calling Safety with literal __const_300^0 + x^0 <= __const_100^0 and entry <l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
5.17/5.23	
5.17/5.23	LOG: CALL check - Post:__const_300^0 + x^0 <= __const_100^0 - Process 1
5.17/5.23	* Exit transition: <l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
5.17/5.23	* Postcondition  : __const_300^0 + x^0 <= __const_100^0
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.000544s
5.17/5.23	> Postcondition is not implied!
5.17/5.23	
5.17/5.23	LOG: RETURN check - Elapsed time: 0.000649s
5.17/5.23	Calling Safety with literal __const_300^0 + x^0 <= __const_100^0 and entry <l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	
5.17/5.23	LOG: CALL check - Post:__const_300^0 + x^0 <= __const_100^0 - Process 2
5.17/5.23	* Exit transition: <l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	* Postcondition  : __const_300^0 + x^0 <= __const_100^0
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.000570s
5.17/5.23	> Postcondition is not implied!
5.17/5.23	
5.17/5.23	LOG: RETURN check - Elapsed time: 0.000690s
5.17/5.23	INVARIANTS: 
5.17/5.23	1: 
5.17/5.23	Quasi-INVARIANTS to narrow Graph: 
5.17/5.23	1: __const_300^0 + x^0 <= __const_100^0 , 
5.17/5.23	Narrowing transition: 
5.17/5.23	<l1, l1, 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	
5.17/5.23	LOG: Narrow transition size 1
5.17/5.23	invGraph after Narrowing: 
5.17/5.23	Transitions:
5.17/5.23	<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Variables:
5.17/5.23	__const_100^0, __const_300^0, __const_400^0, x^0
5.17/5.23	Checking conditional termination of SCC {l1}...
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.000856s
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.003560s
5.17/5.23	Trying to remove transition: <l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Solving with 1 template(s).
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetFirstSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007427s
5.17/5.23	Time used: 0.007132
5.17/5.23	Solving with 1 template(s).
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetFirstSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014999s
5.17/5.23	Time used: 0.014284
5.17/5.23	Improving Solution with cost 2 ...
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetNextSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013559s
5.17/5.23	Time used: 0.013553
5.17/5.23	
5.17/5.23	LOG: SAT solveNonLinear - Elapsed time: 0.028558s
5.17/5.23	Cost: 2; Total time: 0.027837
5.17/5.23	Failed at location 1: 1 + __const_300^0 + __const_400^0 <= 0
5.17/5.23	Failed at location 1: 1 + __const_300^0 + __const_400^0 <= 0
5.17/5.23	Before Improving: 
5.17/5.23	Quasi-invariant at l1: 1 + __const_300^0 + __const_400^0 <= 0
5.17/5.23	Optimizing invariants...
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.003825s
5.17/5.23	Remaining time after improvement: 0.998029
5.17/5.23	Termination implied by a set of quasi-invariant(s):
5.17/5.23	Quasi-invariant at l1: 1 + __const_300^0 + __const_400^0 <= 0
5.17/5.23	[ Invariant Graph ]
5.17/5.23	Strengthening and disabling transitions...
5.17/5.23	
5.17/5.23	LOG: CALL solverLinear in Graph for feasibility
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear in Graph for feasibility
5.17/5.23	Strengthening transition (result): 
5.17/5.23	<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_300^0 + __const_400^0 <= 0 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	[ Termination Graph ]
5.17/5.23	Strengthening and disabling transitions...
5.17/5.23	
5.17/5.23	LOG: CALL solverLinear in Graph for feasibility
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear in Graph for feasibility
5.17/5.23	Strengthening transition (result): 
5.17/5.23	<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_300^0 + __const_400^0 <= 0 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Ranking function: -__const_100^0 + __const_300^0 + x^0
5.17/5.23	New Graphs: 
5.17/5.23	Calling Safety with literal 1 + __const_300^0 + __const_400^0 <= 0 and entry <l0, l1, 1 + __const_100^0 <= __const_300^0 + undef15 /\ 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
5.17/5.23	
5.17/5.23	LOG: CALL check - Post:1 + __const_300^0 + __const_400^0 <= 0 - Process 3
5.17/5.23	* Exit transition: <l0, l1, 1 + __const_100^0 <= __const_300^0 + undef15 /\ 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
5.17/5.23	* Postcondition  : 1 + __const_300^0 + __const_400^0 <= 0
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.000505s
5.17/5.23	> Postcondition is not implied!
5.17/5.23	
5.17/5.23	LOG: RETURN check - Elapsed time: 0.000607s
5.17/5.23	Calling Safety with literal 1 + __const_300^0 + __const_400^0 <= 0 and entry <l0, l1, 1 + __const_100^0 <= __const_300^0 + undef10 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	
5.17/5.23	LOG: CALL check - Post:1 + __const_300^0 + __const_400^0 <= 0 - Process 4
5.17/5.23	* Exit transition: <l0, l1, 1 + __const_100^0 <= __const_300^0 + undef10 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	* Postcondition  : 1 + __const_300^0 + __const_400^0 <= 0
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.000546s
5.17/5.23	> Postcondition is not implied!
5.17/5.23	
5.17/5.23	LOG: RETURN check - Elapsed time: 0.000669s
5.17/5.23	INVARIANTS: 
5.17/5.23	1: 
5.17/5.23	Quasi-INVARIANTS to narrow Graph: 
5.17/5.23	1: 1 + __const_300^0 + __const_400^0 <= 0 , 
5.17/5.23	Narrowing transition: 
5.17/5.23	<l1, l1, 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	
5.17/5.23	LOG: Narrow transition size 1
5.17/5.23	invGraph after Narrowing: 
5.17/5.23	Transitions:
5.17/5.23	<l1, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Variables:
5.17/5.23	__const_100^0, __const_300^0, __const_400^0, x^0
5.17/5.23	Checking conditional termination of SCC {l1}...
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.000940s
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.003815s
5.17/5.23	Trying to remove transition: <l1, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Solving with 1 template(s).
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetFirstSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008231s
5.17/5.23	Time used: 0.007907
5.17/5.23	Solving with 1 template(s).
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetFirstSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018796s
5.17/5.23	Time used: 0.017933
5.17/5.23	Solving with 2 template(s).
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetFirstSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001928s
5.17/5.23	Time used: 4.00041
5.17/5.23	Solving with 3 template(s).
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetFirstSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003354s
5.17/5.23	Time used: 1.00004
5.17/5.23	Solving with 1 template(s).
5.17/5.23	
5.17/5.23	LOG: CALL solveNonLinearGetFirstSolution
5.17/5.23	
5.17/5.23	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021480s
5.17/5.23	Time used: 0.009972
5.17/5.23	
5.17/5.23	Proving non-termination of subgraph 1
5.17/5.23	Transitions:
5.17/5.23	<l1, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + x^0 /\ 1 + __const_100^0 <= undef5 /\ 1 + __const_100^0 <= undef10 /\ __const_300^0 + x^0 = undef5 /\ __const_400^0 + undef5 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Variables:
5.17/5.23	__const_100^0, __const_300^0, __const_400^0, x^0
5.17/5.23	
5.17/5.23	Checking that every undef value has an assignment...
5.17/5.23	
5.17/5.23	LOG: CALL solveLinear
5.17/5.23	
5.17/5.23	LOG: RETURN solveLinear - Elapsed time: 0.001525s
5.17/5.23	Checking conditional non-termination of SCC {l1}...
5.17/5.23	> No assignment for some undef value.
5.17/5.23	> Checking if the negation of the conditions of every pending exit is quasi-invariant... YES
5.17/5.23	Calling reachability with...
5.17/5.23	Transition: <l1, end, true, {all remain the same}>
5.17/5.23	Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
5.17/5.23	Transition: <l1, end, true, {all remain the same}>
5.17/5.23	Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
5.17/5.23	OPEN EXITS: 
5.17/5.23	<l1, end, 1 + __const_100^0 <= __const_300^0 + x^0, {all remain the same}> (condsUp: 0 <= __const_300^0 + __const_400^0)
5.17/5.23	<l1, end, 1 + __const_100^0 <= __const_300^0 + x^0, {all remain the same}> (condsUp: 0 <= __const_300^0 + __const_400^0)
5.17/5.23	
5.17/5.23	--- Reachability graph ---
5.17/5.23	> Graph without transitions.
5.17/5.23	
5.17/5.23	Calling reachability with...
5.17/5.23	Transition: <l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
5.17/5.23	Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
5.17/5.23	Transition: <l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
5.17/5.23	Transition: <l0, l1, 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
5.17/5.23	Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
5.17/5.23	Transition: <l0, l1, 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	Conditions: 1 + __const_100^0 <= __const_300^0 + x^0, 0 <= __const_300^0 + __const_400^0, 
5.17/5.23	OPEN EXITS: 
5.17/5.23	<l0, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + undef15 /\ 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
5.17/5.23	<l0, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + undef10 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	<l0, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + undef15 /\ 1 + __const_100^0 <= undef15 /\ __const_200^0 + x^0 = undef15, {x^0 -> undef15, rest remain the same}>
5.17/5.23	<l0, l1, 0 <= __const_300^0 + __const_400^0 /\ 1 + __const_100^0 <= __const_300^0 + undef10 /\ 1 + __const_100^0 <= undef10 /\ 1 + __const_100^0 <= undef20 /\ __const_100^0 + x^0 = undef20 /\ __const_400^0 + undef20 = undef10, {x^0 -> undef10, rest remain the same}>
5.17/5.23	
5.17/5.23	> Conditions are reachable!
5.17/5.23	
5.17/5.23	Program does NOT terminate
5.17/5.23	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
5.17/5.23	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
5.17/5.23	EOF