0.00/0.03	YES
0.00/0.03	
0.00/0.03	Solver Timeout: 4
0.00/0.03	Global Timeout: 300
0.00/0.03	No parsing errors!
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l7, true>
0.00/0.03	<l1, l2, ((1 + x^0) <= (0 + ox^0))>
0.00/0.03	<l1, l3, ((0 + ox^0) <= (0 + x^0))>
0.00/0.03	<l4, l2, ((0 + c^0) <= 0)>
0.00/0.03	<l4, l2, true, par{c^0 -> 1, ox^0 -> (0 + x^0)}>
0.00/0.03	<l5, l4, ((0 + c^0) <= 0)>
0.00/0.03	<l5, l1, (1 <= (0 + c^0))>
0.00/0.03	<l2, l5, (1 <= (0 + x^0)), par{x^0 -> (~(1) + x^0)}>
0.00/0.03	<l6, l2, ((0 + c^0) <= 0)>
0.00/0.03	<l7, l6, true>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	Preprocessed LLVMGraph
0.00/0.03	Init Location: 0
0.00/0.03	Transitions:
0.00/0.03	<l0, l2, ((0 + c^0) <= 0)>
0.00/0.03	<l2, l2, (1 <= (0 + x^0)) /\ ((0 + c^0) <= 0) /\ ((0 + c^0) <= 0), par{x^0 -> (~(1) + x^0)}>
0.00/0.03	<l2, l2, (1 <= (0 + x^0)) /\ ((0 + c^0) <= 0), par{c^0 -> 1, ox^0 -> (0 + (~(1) + x^0)), x^0 -> (~(1) + x^0)}>
0.00/0.03	<l2, l2, (1 <= (0 + x^0)) /\ (1 <= (0 + c^0)) /\ ((1 + (~(1) + x^0)) <= (0 + ox^0)), par{x^0 -> (~(1) + x^0)}>
0.00/0.03	<l2, l3, (1 <= (0 + x^0)) /\ (1 <= (0 + c^0)) /\ ((0 + ox^0) <= (0 + (~(1) + x^0))), par{x^0 -> (~(1) + x^0)}>
0.00/0.03	
0.00/0.03	Fresh variables:
0.00/0.03	
0.00/0.03	Undef variables:
0.00/0.03	
0.00/0.03	Abstraction variables:
0.00/0.03	
0.00/0.03	Exit nodes:
0.00/0.03	
0.00/0.03	Accepting locations:
0.00/0.03	
0.00/0.03	Asserts:
0.00/0.03	
0.00/0.03	*************************************************************
0.00/0.03	*******************************************************************************************
0.00/0.03	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Init Location: 0
0.00/0.03	Graph 0:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Graph 1:
0.00/0.03	Transitions:
0.00/0.03	<l2, l2, 1 <= x^0 /\ c^0 <= 0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.03	<l2, l2, 1 <= x^0 /\ c^0 <= 0, {c^0 -> 1, ox^0 -> -1 + x^0, x^0 -> -1 + x^0, rest remain the same}>
0.00/0.03	<l2, l2, 1 <= c^0 /\ 1 <= x^0 /\ x^0 <= ox^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	c^0, x^0, ox^0
0.00/0.03	
0.00/0.03	Graph 2:
0.00/0.03	Transitions:
0.00/0.03	Variables:
0.00/0.03	
0.00/0.03	Precedence: 
0.00/0.03	Graph 0
0.00/0.03	
0.00/0.03	Graph 1
0.00/0.03	<l0, l2, c^0 <= 0, {all remain the same}>
0.00/0.03	
0.00/0.03	Graph 2
0.00/0.03	<l2, l3, 1 <= c^0 /\ 1 + ox^0 <= x^0 /\ 1 <= x^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.03	
0.00/0.03	Map Locations to Subgraph:
0.00/0.03	( 0 , 0 )
0.00/0.03	( 2 , 1 )
0.00/0.03	( 3 , 2 )
0.00/0.03	
0.00/0.03	*******************************************************************************************
0.00/0.03	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.03	*******************************************************************************************
0.00/0.03	
0.00/0.03	Proving termination of subgraph 0
0.00/0.03	Proving termination of subgraph 1
0.00/0.03	Checking unfeasibility...
0.00/0.03	Time used: 0.007978
0.00/0.03	
0.00/0.03	Checking conditional termination of SCC {l2}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.001785s
0.00/0.03	Ranking function: -1 - 4*c^0 + x^0
0.00/0.03	New Graphs: 
0.00/0.03	Transitions:
0.00/0.03	<l2, l2, 1 <= c^0 /\ 1 <= x^0 /\ x^0 <= ox^0, {x^0 -> -1 + x^0, rest remain the same}>
0.00/0.03	Variables:
0.00/0.03	c^0, ox^0, x^0
0.00/0.03	Checking conditional termination of SCC {l2}...
0.00/0.03	
0.00/0.03	LOG: CALL solveLinear
0.00/0.03	
0.00/0.03	LOG: RETURN solveLinear - Elapsed time: 0.000750s
0.00/0.03	Ranking function: -1 + x^0
0.00/0.03	New Graphs: 
0.00/0.03	Proving termination of subgraph 2
0.00/0.03	Analyzing SCC {l3}...
0.00/0.03	No cycles found.
0.00/0.03	
0.00/0.03	Program Terminates
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.03	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.03	EOF