12.29/12.32	NO
12.29/12.32	
12.29/12.32	Solver Timeout: 4
12.29/12.32	Global Timeout: 300
12.29/12.32	No parsing errors!
12.29/12.32	Init Location: 0
12.29/12.32	Transitions:
12.29/12.32	<l0, l9, true>
12.29/12.32	<l1, l2, true>
12.29/12.32	<l3, l4, true>
12.29/12.32	<l5, l6, true>
12.29/12.32	<l6, l5, true>
12.29/12.32	<l7, l1, ((0 + ___rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
12.29/12.32	<l7, l1, (1 <= (0 + ___rho_1_^0)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}>
12.29/12.32	<l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef31 = undef31), par{___rho_1_^0 -> undef31}>
12.29/12.32	<l2, l5, ((0 + curr_serv^0) <= 0)>
12.29/12.32	<l8, l1, (undef42 = undef42) /\ (1 <= (0 + undef42)) /\ (undef45 = 8), par{c^0 -> undef42, curr_serv^0 -> (0 + undef45), resp^0 -> 0, servers^0 -> undef45}>
12.29/12.32	<l9, l8, true>
12.29/12.32	
12.29/12.32	Fresh variables:
12.29/12.32	undef31, undef42, undef45, 
12.29/12.32	
12.29/12.32	Undef variables:
12.29/12.32	undef31, undef42, undef45, 
12.29/12.32	
12.29/12.32	Abstraction variables:
12.29/12.32	
12.29/12.32	Exit nodes:
12.29/12.32	
12.29/12.32	Accepting locations:
12.29/12.32	
12.29/12.32	Asserts:
12.29/12.32	
12.29/12.32	Preprocessed LLVMGraph
12.29/12.32	Init Location: 0
12.29/12.32	Transitions:
12.29/12.32	<l0, l1, (c^0 = undef42) /\ (curr_serv^0 = (0 + undef45)) /\ (resp^0 = 0) /\ (undef42 = undef42) /\ (1 <= (0 + undef42)) /\ (undef45 = 8)>
12.29/12.32	<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef31 = undef31) /\ ((0 + undef31) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(1) + curr_serv^0)}>
12.29/12.32	<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef31 = undef31) /\ (1 <= (0 + undef31)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}>
12.29/12.32	<l1, l5, ((0 + curr_serv^0) <= 0)>
12.29/12.32	<l5, l5, true>
12.29/12.32	
12.29/12.32	Fresh variables:
12.29/12.32	undef31, undef42, undef45, 
12.29/12.32	
12.29/12.32	Undef variables:
12.29/12.32	undef31, undef42, undef45, 
12.29/12.32	
12.29/12.32	Abstraction variables:
12.29/12.32	
12.29/12.32	Exit nodes:
12.29/12.32	
12.29/12.32	Accepting locations:
12.29/12.32	
12.29/12.32	Asserts:
12.29/12.32	
12.29/12.32	*************************************************************
12.29/12.32	*******************************************************************************************
12.29/12.32	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
12.29/12.32	*******************************************************************************************
12.29/12.32	
12.29/12.32	Init Location: 0
12.29/12.32	Graph 0:
12.29/12.32	Transitions:
12.29/12.32	Variables:
12.29/12.32	
12.29/12.32	Graph 1:
12.29/12.32	Transitions:
12.29/12.32	<l1, l1, undef31 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
12.29/12.32	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef31, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.29/12.32	Variables:
12.29/12.32	c^0, curr_serv^0, resp^0
12.29/12.32	
12.29/12.32	Graph 2:
12.29/12.32	Transitions:
12.29/12.32	<l5, l5, true, {all remain the same}>
12.29/12.32	Variables:
12.29/12.32	
12.29/12.32	Precedence: 
12.29/12.32	Graph 0
12.29/12.32	
12.29/12.32	Graph 1
12.29/12.32	<l0, l1, 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 8, {all remain the same}>
12.29/12.32	
12.29/12.32	Graph 2
12.29/12.32	<l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.29/12.32	
12.29/12.32	Map Locations to Subgraph:
12.29/12.32	( 0 , 0 )
12.29/12.32	( 1 , 1 )
12.29/12.32	( 5 , 2 )
12.29/12.32	
12.29/12.32	*******************************************************************************************
12.29/12.32	********************************    CHECKING ASSERTIONS    ********************************
12.29/12.32	*******************************************************************************************
12.29/12.32	
12.29/12.32	Proving termination of subgraph 0
12.29/12.32	Proving termination of subgraph 1
12.29/12.32	Checking unfeasibility...
12.29/12.32	Time used: 0.005317
12.29/12.32	
12.29/12.32	Checking conditional termination of SCC {l1}...
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.001337s
12.29/12.32	Ranking function: -1 - c^0 + curr_serv^0
12.29/12.32	New Graphs: 
12.29/12.32	Transitions:
12.29/12.32	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef31, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.29/12.32	Variables:
12.29/12.32	c^0, curr_serv^0, resp^0
12.29/12.32	Checking conditional termination of SCC {l1}...
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.000717s
12.29/12.32	Ranking function: -1 + curr_serv^0
12.29/12.32	New Graphs: 
12.29/12.32	Proving termination of subgraph 2
12.29/12.32	Checking unfeasibility...
12.29/12.32	Time used: 0.000843
12.29/12.32	
12.29/12.32	> No variable changes in termination graph.
12.29/12.32	Checking conditional unfeasibility...
12.29/12.32	Termination failed. Trying to show unreachability...
12.29/12.32	Proving unreachability of entry: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.29/12.32	
12.29/12.32	LOG: CALL check - Post:1 <= 0 - Process 1
12.29/12.32	* Exit transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.29/12.32	* Postcondition  : 1 <= 0
12.29/12.32	Postcodition moved up: 1 <= 0
12.29/12.32	
12.29/12.32	LOG: Try proving POST
12.29/12.32	Postcondition: 1 <= 0
12.29/12.32	
12.29/12.32	LOG: CALL check - Post:1 <= 0 - Process 2
12.29/12.32	* Exit transition: <l0, l1, 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 8, {all remain the same}>
12.29/12.32	* Postcondition  : 1 <= 0
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.000558s
12.29/12.32	> Postcondition is not implied!
12.29/12.32	
12.29/12.32	LOG: RETURN check - Elapsed time: 0.000661s
12.29/12.32	
12.29/12.32	LOG: NarrowEntry size 1
12.29/12.32	Narrowing transition: 
12.29/12.32	<l1, l1, undef31 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
12.29/12.32	
12.29/12.32	LOG: Narrow transition size 1
12.29/12.32	Narrowing transition: 
12.29/12.32	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef31, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.29/12.32	
12.29/12.32	LOG: Narrow transition size 1
12.29/12.32	ENTRIES:
12.29/12.32	<l0, l1, 0 <= 0 /\ 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 8, {all remain the same}>
12.29/12.32	END ENTRIES:
12.29/12.32	GRAPH:
12.29/12.32	<l1, l1, 0 <= 0 /\ undef31 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
12.29/12.32	<l1, l1, 0 <= 0 /\ 1 <= curr_serv^0 /\ 1 <= undef31, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.29/12.32	END GRAPH:
12.29/12.32	EXIT: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.29/12.32	POST: 1 <= 0
12.29/12.32	
12.29/12.32	
12.29/12.32	LOG: Try proving POST
12.29/12.32	Solving with 1 template(s).
12.29/12.32	
12.29/12.32	LOG: CALL solveNonLinearGetFirstSolution
12.29/12.32	
12.29/12.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011976s
12.29/12.32	Time used: 0.011785
12.29/12.32	Improving Solution with cost 51 ...
12.29/12.32	
12.29/12.32	LOG: CALL solveNonLinearGetNextSolution
12.29/12.32	
12.29/12.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.039536s
12.29/12.32	Time used: 0.03953
12.29/12.32	
12.29/12.32	LOG: SAT solveNonLinear - Elapsed time: 0.051512s
12.29/12.32	Cost: 51; Total time: 0.051315
12.29/12.32	Failed at location 1: curr_serv^0 <= c^0
12.29/12.32	Before Improving: 
12.29/12.32	Quasi-invariant at l1: curr_serv^0 <= c^0
12.29/12.32	Optimizing invariants...
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.002290s
12.29/12.32	Remaining time after improvement: 0.998932
12.29/12.32	Some transition disabled by a set of quasi-invariant(s):
12.29/12.32	Quasi-invariant at l1: curr_serv^0 <= c^0
12.29/12.32	
12.29/12.32	LOG: NEXT CALL check - disable
12.29/12.32	
12.29/12.32	LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 3
12.29/12.32	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 8, {all remain the same}>
12.29/12.32	* Postcondition  : curr_serv^0 <= c^0
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.000755s
12.29/12.32	> Postcondition is not implied!
12.29/12.32	
12.29/12.32	LOG: RETURN check - Elapsed time: 0.000875s
12.29/12.32	Solving with 2 template(s).
12.29/12.32	
12.29/12.32	LOG: CALL solveNonLinearGetFirstSolution
12.29/12.32	
12.29/12.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079485s
12.29/12.32	Time used: 0.079195
12.29/12.32	Improving Solution with cost 51 ...
12.29/12.32	
12.29/12.32	LOG: CALL solveNonLinearGetNextSolution
12.29/12.32	
12.29/12.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000400s
12.29/12.32	Time used: 1.00036
12.29/12.32	
12.29/12.32	LOG: SAT solveNonLinear - Elapsed time: 1.079886s
12.29/12.32	Cost: 51; Total time: 1.07955
12.29/12.32	Failed at location 1: 1 + curr_serv^0 <= c^0
12.29/12.32	Before Improving: 
12.29/12.32	Quasi-invariant at l1: 0 <= 1 + curr_serv^0
12.29/12.32	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.29/12.32	Optimizing invariants...
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.008223s
12.29/12.32	Remaining time after improvement: 0.998251
12.29/12.32	Some transition disabled by a set of quasi-invariant(s):
12.29/12.32	Quasi-invariant at l1: 0 <= 1 + curr_serv^0
12.29/12.32	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.29/12.32	
12.29/12.32	LOG: NEXT CALL check - disable
12.29/12.32	
12.29/12.32	LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 4
12.29/12.32	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 8, {all remain the same}>
12.29/12.32	* Postcondition  : 1 + curr_serv^0 <= c^0
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.000942s
12.29/12.32	> Postcondition is not implied!
12.29/12.32	
12.29/12.32	LOG: RETURN check - Elapsed time: 0.001064s
12.29/12.32	Solving with 3 template(s).
12.29/12.32	
12.29/12.32	LOG: CALL solveNonLinearGetFirstSolution
12.29/12.32	
12.29/12.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.662320s
12.29/12.32	Time used: 0.661758
12.29/12.32	Improving Solution with cost 51 ...
12.29/12.32	
12.29/12.32	LOG: CALL solveNonLinearGetNextSolution
12.29/12.32	
12.29/12.32	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.339010s
12.29/12.32	Time used: 0.338998
12.29/12.32	
12.29/12.32	LOG: SAT solveNonLinear - Elapsed time: 1.001330s
12.29/12.32	Cost: 51; Total time: 1.00076
12.29/12.32	Failed at location 1: curr_serv^0 <= c^0
12.29/12.32	Before Improving: 
12.29/12.32	Quasi-invariant at l1: curr_serv^0 <= c^0
12.29/12.32	Quasi-invariant at l1: 1 <= c^0 + resp^0
12.29/12.32	Optimizing invariants...
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.039275s
12.29/12.32	Remaining time after improvement: 0.997539
12.29/12.32	Some transition disabled by a set of quasi-invariant(s):
12.29/12.32	Quasi-invariant at l1: curr_serv^0 <= c^0
12.29/12.32	Quasi-invariant at l1: 1 <= c^0 + resp^0
12.29/12.32	
12.29/12.32	LOG: NEXT CALL check - disable
12.29/12.32	
12.29/12.32	LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 5
12.29/12.32	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 8, {all remain the same}>
12.29/12.32	* Postcondition  : curr_serv^0 <= c^0
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.001306s
12.29/12.32	> Postcondition is not implied!
12.29/12.32	
12.29/12.32	LOG: RETURN check - Elapsed time: 0.001432s
12.29/12.32	
12.29/12.32	LOG: Postcondition is not implied - no solution
12.29/12.32	> Postcondition is not implied!
12.29/12.32	
12.29/12.32	LOG: RETURN check - Elapsed time: 2.213606s
12.29/12.32	Cannot prove unreachability
12.29/12.32	
12.29/12.32	Proving non-termination of subgraph 2
12.29/12.32	Transitions:
12.29/12.32	<l5, l5, true, {all remain the same}>
12.29/12.32	Variables:
12.29/12.32	
12.29/12.32	Checking conditional non-termination of SCC {l5}...
12.29/12.32	> No exit transition to close.
12.29/12.32	Calling reachability with...
12.29/12.32	Transition: <l5, end, true, {all remain the same}>
12.29/12.32	Conditions: 
12.29/12.32	OPEN EXITS: 
12.29/12.32	<l5, end, true, {all remain the same}>
12.29/12.32	
12.29/12.32	--- Reachability graph ---
12.29/12.32	> Graph without transitions.
12.29/12.32	
12.29/12.32	Calling reachability with...
12.29/12.32	Transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.29/12.32	Conditions: 
12.29/12.32	OPEN EXITS: 
12.29/12.32	<l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.29/12.32	
12.29/12.32	--- Reachability graph ---
12.29/12.32	> Graph without transitions.
12.29/12.32	
12.29/12.32	Calling reachability with...
12.29/12.32	Transition: <l0, l1, 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 8, {all remain the same}>
12.29/12.32	Conditions: curr_serv^0 <= 0, 
12.29/12.32	OPEN EXITS: 
12.29/12.32	
12.29/12.32	> Conditions are not feasible after transitions.
12.29/12.32	--- Reachability graph ---
12.29/12.32	Transitions:
12.29/12.32	<l1, l1, undef31 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -1 + curr_serv^0, rest remain the same}>
12.29/12.32	Variables:
12.29/12.32	c^0, curr_serv^0
12.29/12.32	Checking edge-closing of SCC {l1}...
12.29/12.32	EXIT TRANSITIONS (TO CLOSE):
12.29/12.32	<l1, end, curr_serv^0 <= c^0 /\ 1 <= curr_serv^0, {all remain the same}>
12.29/12.32	
12.29/12.32	Solving with 1 template(s).
12.29/12.32	
12.29/12.32	LOG: CALL solveNonLinearGetFirstSolution
12.29/12.32	
12.29/12.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027028s
12.29/12.32	Time used: 0.026925
12.29/12.32	Solving with 2 template(s).
12.29/12.32	
12.29/12.32	LOG: CALL solveNonLinearGetFirstSolution
12.29/12.32	
12.29/12.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001545s
12.29/12.32	Time used: 5.00054
12.29/12.32	Solving with 3 template(s).
12.29/12.32	
12.29/12.32	LOG: CALL solveNonLinearGetFirstSolution
12.29/12.32	
12.29/12.32	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005313s
12.29/12.32	Time used: 5.00099
12.29/12.32	> No quasi-invariants that block all exits have been found.
12.29/12.32	--- Reachability graph ---
12.29/12.32	Transitions:
12.29/12.32	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef31, {c^0 -> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.29/12.32	Variables:
12.29/12.32	c^0, curr_serv^0, resp^0
12.29/12.32	Checking edge-closing of SCC {l1}...
12.29/12.32	> No exit transition to close.
12.29/12.32	Checking conditional termination of SCC {l1}...
12.29/12.32	
12.29/12.32	LOG: CALL solveLinear
12.29/12.32	
12.29/12.32	LOG: RETURN solveLinear - Elapsed time: 0.001036s
12.29/12.32	Ranking function: -1 + curr_serv^0
12.29/12.32	New Graphs: 
12.29/12.32	Calling reachability with...
12.29/12.32	Transition: <l0, l1, 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 8, {all remain the same}>
12.29/12.32	Conditions: 
12.29/12.32	OPEN EXITS: 
12.29/12.32	<l0, l1, 1 <= undef42 /\ c^0 = undef42 /\ curr_serv^0 = undef45 /\ resp^0 = 0 /\ undef45 = 8, {all remain the same}>
12.29/12.32	
12.29/12.32	> Conditions are reachable!
12.29/12.32	
12.29/12.32	Program does NOT terminate
12.29/12.32	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
12.29/12.32	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
12.29/12.32	EOF