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