0.00/0.06	YES
0.00/0.06	
0.00/0.06	Solver Timeout: 4
0.00/0.06	Global Timeout: 300
0.00/0.06	No parsing errors!
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l18, true>
0.00/0.06	<l1, l2, ((0 + nodecount^0) <= (0 + i^0))>
0.00/0.06	<l1, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l4, l5, true, par{i^0 -> (1 + i^0)}>
0.00/0.06	<l4, l2, true>
0.00/0.06	<l6, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}>
0.00/0.06	<l6, l4, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef53 = undef53) /\ (undef54 = undef54), par{x^0 -> undef53, y^0 -> undef54}>
0.00/0.06	<l7, l8, true, par{j^0 -> (1 + j^0)}>
0.00/0.06	<l9, l10, ((0 + edgecount^0) <= (0 + j^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l9, l7, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef80 = undef80) /\ (undef81 = undef81), par{x^0 -> undef80, y^0 -> undef81}>
0.00/0.06	<l11, l5, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
0.00/0.06	<l11, l8, ((1 + i^0) <= (0 + nodecount^0)), par{j^0 -> 0}>
0.00/0.06	<l12, l13, true>
0.00/0.06	<l13, l14, true, par{i^0 -> (1 + i^0)}>
0.00/0.06	<l15, l12, ((1 + source^0) <= (0 + i^0))>
0.00/0.06	<l15, l12, ((1 + i^0) <= (0 + source^0))>
0.00/0.06	<l15, l13, ((0 + i^0) <= (0 + source^0)) /\ ((0 + source^0) <= (0 + i^0))>
0.00/0.06	<l16, l10, ((0 + nodecount^0) <= (0 + i^0)), par{i^0 -> 0}>
0.00/0.06	<l16, l15, ((1 + i^0) <= (0 + nodecount^0))>
0.00/0.06	<l14, l16, true>
0.00/0.06	<l10, l11, true>
0.00/0.06	<l8, l9, true>
0.00/0.06	<l5, l6, true>
0.00/0.06	<l3, l1, true>
0.00/0.06	<l17, l14, true, par{edgecount^0 -> (0 + __const_19^0), i^0 -> 0, nodecount^0 -> (0 + __const_5^0), source^0 -> 0}>
0.00/0.06	<l18, l17, true>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef53, undef54, undef80, undef81, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef53, undef54, undef80, undef81, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	Preprocessed LLVMGraph
0.00/0.06	Init Location: 0
0.00/0.06	Transitions:
0.00/0.06	<l0, l14, (edgecount^0 = (0 + edgecount^0)) /\ (i^0 = 0) /\ (nodecount^0 = (0 + nodecount^0)) /\ (0 = 0)>
0.00/0.06	<l3, l2, ((0 + nodecount^0) <= (0 + i^0))>
0.00/0.06	<l3, l3, ((1 + i^0) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l5, l3, ((0 + edgecount^0) <= (0 + i^0)), par{i^0 -> 0}>
0.00/0.06	<l5, l5, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef53 = undef53) /\ (undef54 = undef54), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l5, l2, ((1 + i^0) <= (0 + edgecount^0)) /\ (undef53 = undef53) /\ (undef54 = undef54)>
0.00/0.06	<l8, l5, ((0 + edgecount^0) <= (0 + j^0)) /\ ((0 + nodecount^0) <= (0 + (1 + i^0))), par{i^0 -> 0}>
0.00/0.06	<l8, l8, ((0 + edgecount^0) <= (0 + j^0)) /\ ((1 + (1 + i^0)) <= (0 + nodecount^0)), par{i^0 -> (1 + i^0), j^0 -> 0}>
0.00/0.06	<l8, l8, ((1 + j^0) <= (0 + edgecount^0)) /\ (undef80 = undef80) /\ (undef81 = undef81), par{j^0 -> (1 + j^0)}>
0.00/0.06	<l14, l5, ((0 + nodecount^0) <= (0 + i^0)) /\ ((0 + nodecount^0) <= (0 + 0)), par{i^0 -> 0}>
0.00/0.06	<l14, l8, ((0 + nodecount^0) <= (0 + i^0)) /\ ((1 + 0) <= (0 + nodecount^0)), par{i^0 -> 0, j^0 -> 0}>
0.00/0.06	<l14, l14, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l14, l14, ((1 + i^0) <= (0 + nodecount^0)) /\ ((1 + i^0) <= (0 + 0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	<l14, l14, ((1 + i^0) <= (0 + nodecount^0)) /\ ((0 + i^0) <= (0 + 0)) /\ ((0 + 0) <= (0 + i^0)), par{i^0 -> (1 + i^0)}>
0.00/0.06	
0.00/0.06	Fresh variables:
0.00/0.06	undef53, undef54, undef80, undef81, 
0.00/0.06	
0.00/0.06	Undef variables:
0.00/0.06	undef53, undef54, undef80, undef81, 
0.00/0.06	
0.00/0.06	Abstraction variables:
0.00/0.06	
0.00/0.06	Exit nodes:
0.00/0.06	
0.00/0.06	Accepting locations:
0.00/0.06	
0.00/0.06	Asserts:
0.00/0.06	
0.00/0.06	*************************************************************
0.00/0.06	*******************************************************************************************
0.00/0.06	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Init Location: 0
0.00/0.06	Graph 0:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Graph 1:
0.00/0.06	Transitions:
0.00/0.06	<l14, l14, 1 + i^0 <= nodecount^0 /\ 1 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	<l14, l14, 1 + i^0 <= 0 /\ 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	<l14, l14, 1 + i^0 <= nodecount^0 /\ i^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i^0, nodecount^0
0.00/0.06	
0.00/0.06	Graph 2:
0.00/0.06	Transitions:
0.00/0.06	<l8, l8, edgecount^0 <= j^0 /\ 2 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, j^0 -> 0, rest remain the same}>
0.00/0.06	<l8, l8, 1 + j^0 <= edgecount^0, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	edgecount^0, i^0, j^0, nodecount^0
0.00/0.06	
0.00/0.06	Graph 3:
0.00/0.06	Transitions:
0.00/0.06	<l5, l5, 1 + i^0 <= edgecount^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	edgecount^0, i^0
0.00/0.06	
0.00/0.06	Graph 4:
0.00/0.06	Transitions:
0.00/0.06	<l3, l3, 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i^0, nodecount^0
0.00/0.06	
0.00/0.06	Graph 5:
0.00/0.06	Transitions:
0.00/0.06	Variables:
0.00/0.06	
0.00/0.06	Precedence: 
0.00/0.06	Graph 0
0.00/0.06	
0.00/0.06	Graph 1
0.00/0.06	<l0, l14, i^0 = 0, {all remain the same}>
0.00/0.06	
0.00/0.06	Graph 2
0.00/0.06	<l14, l8, nodecount^0 <= i^0 /\ 1 <= nodecount^0, {i^0 -> 0, j^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 3
0.00/0.06	<l8, l5, edgecount^0 <= j^0 /\ nodecount^0 <= 1 + i^0, {i^0 -> 0, rest remain the same}>
0.00/0.06	<l14, l5, nodecount^0 <= i^0 /\ nodecount^0 <= 0, {i^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 4
0.00/0.06	<l5, l3, edgecount^0 <= i^0, {i^0 -> 0, rest remain the same}>
0.00/0.06	
0.00/0.06	Graph 5
0.00/0.06	<l3, l2, nodecount^0 <= i^0, {all remain the same}>
0.00/0.06	<l5, l2, 1 + i^0 <= edgecount^0, {all remain the same}>
0.00/0.06	
0.00/0.06	Map Locations to Subgraph:
0.00/0.06	( 0 , 0 )
0.00/0.06	( 2 , 5 )
0.00/0.06	( 3 , 4 )
0.00/0.06	( 5 , 3 )
0.00/0.06	( 8 , 2 )
0.00/0.06	( 14 , 1 )
0.00/0.06	
0.00/0.06	*******************************************************************************************
0.00/0.06	********************************    CHECKING ASSERTIONS    ********************************
0.00/0.06	*******************************************************************************************
0.00/0.06	
0.00/0.06	Proving termination of subgraph 0
0.00/0.06	Proving termination of subgraph 1
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.005585
0.00/0.06	Some transition disabled by a set of invariant(s):
0.00/0.06	Invariant at l14: 0 <= i^0
0.00/0.06	
0.00/0.06	Strengthening and disabling transitions...
0.00/0.06	> It's unfeasible. Removing transition: 
0.00/0.06	<l14, l14, 1 + i^0 <= 0 /\ 1 + i^0 <= nodecount^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l14, l14, 1 + i^0 <= nodecount^0 /\ 1 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	
0.00/0.06	LOG: CALL solverLinear in Graph for feasibility
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear in Graph for feasibility
0.00/0.06	Strengthening transition (result): 
0.00/0.06	<l14, l14, 1 + i^0 <= nodecount^0 /\ i^0 = 0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.00334
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l14}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001138s
0.00/0.06	Ranking function: -i^0
0.00/0.06	New Graphs: 
0.00/0.06	Transitions:
0.00/0.06	<l14, l14, 1 + i^0 <= nodecount^0 /\ 1 <= i^0, {i^0 -> 1 + i^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	i^0, nodecount^0
0.00/0.06	Checking conditional termination of SCC {l14}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000702s
0.00/0.06	Ranking function: -1 - i^0 + nodecount^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 2
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.004455
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l8}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.001410s
0.00/0.06	Ranking function: -2 - i^0 + nodecount^0
0.00/0.06	New Graphs: 
0.00/0.06	Transitions:
0.00/0.06	<l8, l8, 1 + j^0 <= edgecount^0, {j^0 -> 1 + j^0, rest remain the same}>
0.00/0.06	Variables:
0.00/0.06	edgecount^0, j^0
0.00/0.06	Checking conditional termination of SCC {l8}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000833s
0.00/0.06	Ranking function: -1 + edgecount^0 - j^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 3
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001682
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l5}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000920s
0.00/0.06	Ranking function: -1 + edgecount^0 - i^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 4
0.00/0.06	Checking unfeasibility...
0.00/0.06	Time used: 0.001609
0.00/0.06	
0.00/0.06	Checking conditional termination of SCC {l3}...
0.00/0.06	
0.00/0.06	LOG: CALL solveLinear
0.00/0.06	
0.00/0.06	LOG: RETURN solveLinear - Elapsed time: 0.000905s
0.00/0.06	Ranking function: -1 - i^0 + nodecount^0
0.00/0.06	New Graphs: 
0.00/0.06	Proving termination of subgraph 5
0.00/0.06	Analyzing SCC {l2}...
0.00/0.06	No cycles found.
0.00/0.06	
0.00/0.06	Program Terminates
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
0.00/0.06	/export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
0.00/0.06	EOF