2.10/2.14	YES
2.10/2.14	
2.10/2.14	Solver Timeout: 4
2.10/2.14	Global Timeout: 300
2.10/2.14	No parsing errors!
2.10/2.14	Init Location: 0
2.10/2.14	Transitions:
2.10/2.14	<l0, l5, true>
2.10/2.14	<l1, l2, true, par{x^0 -> (~(1) + x^0)}>
2.10/2.14	<l2, l3, ((1 + x^0) <= 100)>
2.10/2.14	<l2, l3, (101 <= (0 + x^0))>
2.10/2.14	<l3, l1, true>
2.10/2.14	<l4, l1, true, par{x^0 -> 300}>
2.10/2.14	<l5, l4, true>
2.10/2.14	
2.10/2.14	Fresh variables:
2.10/2.14	
2.10/2.14	Undef variables:
2.10/2.14	
2.10/2.14	Abstraction variables:
2.10/2.14	
2.10/2.14	Exit nodes:
2.10/2.14	
2.10/2.14	Accepting locations:
2.10/2.14	
2.10/2.14	Asserts:
2.10/2.14	
2.10/2.14	Preprocessed LLVMGraph
2.10/2.14	Init Location: 0
2.10/2.14	Transitions:
2.10/2.14	<l0, l1, (x^0 = 300)>
2.10/2.14	<l1, l1, ((1 + (~(1) + x^0)) <= 100), par{x^0 -> (~(1) + x^0)}>
2.10/2.14	<l1, l1, (101 <= (0 + (~(1) + x^0))), par{x^0 -> (~(1) + x^0)}>
2.10/2.14	
2.10/2.14	Fresh variables:
2.10/2.14	
2.10/2.14	Undef variables:
2.10/2.14	
2.10/2.14	Abstraction variables:
2.10/2.14	
2.10/2.14	Exit nodes:
2.10/2.14	
2.10/2.14	Accepting locations:
2.10/2.14	
2.10/2.14	Asserts:
2.10/2.14	
2.10/2.14	*************************************************************
2.10/2.14	*******************************************************************************************
2.10/2.14	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
2.10/2.14	*******************************************************************************************
2.10/2.14	
2.10/2.14	Init Location: 0
2.10/2.14	Graph 0:
2.10/2.14	Transitions:
2.10/2.14	Variables:
2.10/2.14	
2.10/2.14	Graph 1:
2.10/2.14	Transitions:
2.10/2.14	<l1, l1, x^0 <= 100, {x^0 -> -1 + x^0, rest remain the same}>
2.10/2.14	<l1, l1, 102 <= x^0, {x^0 -> -1 + x^0, rest remain the same}>
2.10/2.14	Variables:
2.10/2.14	x^0
2.10/2.14	
2.10/2.14	Precedence: 
2.10/2.14	Graph 0
2.10/2.14	
2.10/2.14	Graph 1
2.10/2.14	<l0, l1, x^0 = 300, {all remain the same}>
2.10/2.14	
2.10/2.14	Map Locations to Subgraph:
2.10/2.14	( 0 , 0 )
2.10/2.14	( 1 , 1 )
2.10/2.14	
2.10/2.14	*******************************************************************************************
2.10/2.14	********************************    CHECKING ASSERTIONS    ********************************
2.10/2.14	*******************************************************************************************
2.10/2.14	
2.10/2.14	Proving termination of subgraph 0
2.10/2.14	Proving termination of subgraph 1
2.10/2.14	Checking unfeasibility...
2.10/2.14	Time used: 2.05411
2.10/2.14	Some transition disabled by a set of invariant(s):
2.10/2.14	Invariant at l1: 101 <= x^0
2.10/2.14	
2.10/2.14	Strengthening and disabling transitions...
2.10/2.14	> It's unfeasible. Removing transition: 
2.10/2.14	<l1, l1, x^0 <= 100, {x^0 -> -1 + x^0, rest remain the same}>
2.10/2.14	
2.10/2.14	LOG: CALL solverLinear in Graph for feasibility
2.10/2.14	
2.10/2.14	LOG: RETURN solveLinear in Graph for feasibility
2.10/2.14	Strengthening transition (result): 
2.10/2.14	<l1, l1, 102 <= x^0, {x^0 -> -1 + x^0, rest remain the same}>
2.10/2.14	Checking unfeasibility...
2.10/2.14	Time used: 0.03545
2.10/2.14	
2.10/2.14	Checking conditional termination of SCC {l1}...
2.10/2.14	
2.10/2.14	LOG: CALL solveLinear
2.10/2.14	
2.10/2.14	LOG: RETURN solveLinear - Elapsed time: 0.001385s
2.10/2.14	Ranking function: -102 + x^0
2.10/2.14	New Graphs: 
2.10/2.14	Program Terminates
2.10/2.14	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
2.10/2.14	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
2.10/2.14	EOF