12.47/12.50	NO
12.47/12.50	
12.47/12.50	Solver Timeout: 4
12.47/12.50	Global Timeout: 300
12.47/12.50	No parsing errors!
12.47/12.50	Init Location: 0
12.47/12.50	Transitions:
12.47/12.50	<l0, l9, true>
12.47/12.50	<l1, l2, true>
12.47/12.50	<l3, l4, true>
12.47/12.50	<l5, l6, true>
12.47/12.50	<l6, l5, true>
12.47/12.50	<l7, l1, ((0 + ___rho_1_^0) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(2) + curr_serv^0)}>
12.47/12.50	<l7, l1, (1 <= (0 + ___rho_1_^0)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(2) + curr_serv^0), resp^0 -> (1 + resp^0)}>
12.47/12.50	<l2, l7, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37), par{___rho_1_^0 -> undef37}>
12.47/12.50	<l2, l5, ((0 + curr_serv^0) <= 0)>
12.47/12.50	<l8, l1, (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4), par{___rho_2_^0 -> undef50, c^0 -> undef51, curr_serv^0 -> (0 + undef54), resp^0 -> 0, servers^0 -> undef54}>
12.47/12.50	<l9, l8, true>
12.47/12.50	
12.47/12.50	Fresh variables:
12.47/12.50	undef37, undef50, undef51, undef54, 
12.47/12.50	
12.47/12.50	Undef variables:
12.47/12.50	undef37, undef50, undef51, undef54, 
12.47/12.50	
12.47/12.50	Abstraction variables:
12.47/12.50	
12.47/12.50	Exit nodes:
12.47/12.50	
12.47/12.50	Accepting locations:
12.47/12.50	
12.47/12.50	Asserts:
12.47/12.50	
12.47/12.50	Preprocessed LLVMGraph
12.47/12.50	Init Location: 0
12.47/12.50	Transitions:
12.47/12.50	<l0, l1, (c^0 = undef51) /\ (curr_serv^0 = (0 + undef54)) /\ (resp^0 = 0) /\ (undef50 = undef50) /\ (undef51 = (0 + undef50)) /\ (1 <= (0 + undef51)) /\ (undef54 = 4)>
12.47/12.50	<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ ((0 + undef37) <= 0) /\ ((1 + c^0) <= (0 + curr_serv^0)), par{curr_serv^0 -> (~(2) + curr_serv^0)}>
12.47/12.50	<l1, l1, (1 <= (0 + curr_serv^0)) /\ (undef37 = undef37) /\ (1 <= (0 + undef37)), par{c^0 -> (~(1) + c^0), curr_serv^0 -> (~(2) + curr_serv^0), resp^0 -> (1 + resp^0)}>
12.47/12.50	<l1, l5, ((0 + curr_serv^0) <= 0)>
12.47/12.50	<l5, l5, true>
12.47/12.50	
12.47/12.50	Fresh variables:
12.47/12.50	undef37, undef50, undef51, undef54, 
12.47/12.50	
12.47/12.50	Undef variables:
12.47/12.50	undef37, undef50, undef51, undef54, 
12.47/12.50	
12.47/12.50	Abstraction variables:
12.47/12.50	
12.47/12.50	Exit nodes:
12.47/12.50	
12.47/12.50	Accepting locations:
12.47/12.50	
12.47/12.50	Asserts:
12.47/12.50	
12.47/12.50	*************************************************************
12.47/12.50	*******************************************************************************************
12.47/12.50	***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
12.47/12.50	*******************************************************************************************
12.47/12.50	
12.47/12.50	Init Location: 0
12.47/12.50	Graph 0:
12.47/12.50	Transitions:
12.47/12.50	Variables:
12.47/12.50	
12.47/12.50	Graph 1:
12.47/12.50	Transitions:
12.47/12.50	<l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -2 + curr_serv^0, rest remain the same}>
12.47/12.50	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.47/12.50	Variables:
12.47/12.50	c^0, curr_serv^0, resp^0
12.47/12.50	
12.47/12.50	Graph 2:
12.47/12.50	Transitions:
12.47/12.50	<l5, l5, true, {all remain the same}>
12.47/12.50	Variables:
12.47/12.50	
12.47/12.50	Precedence: 
12.47/12.50	Graph 0
12.47/12.50	
12.47/12.50	Graph 1
12.47/12.50	<l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.47/12.50	
12.47/12.50	Graph 2
12.47/12.50	<l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.47/12.50	
12.47/12.50	Map Locations to Subgraph:
12.47/12.50	( 0 , 0 )
12.47/12.50	( 1 , 1 )
12.47/12.50	( 5 , 2 )
12.47/12.50	
12.47/12.50	*******************************************************************************************
12.47/12.50	********************************    CHECKING ASSERTIONS    ********************************
12.47/12.50	*******************************************************************************************
12.47/12.50	
12.47/12.50	Proving termination of subgraph 0
12.47/12.50	Proving termination of subgraph 1
12.47/12.50	Checking unfeasibility...
12.47/12.50	Time used: 0.024551
12.47/12.50	
12.47/12.50	Checking conditional termination of SCC {l1}...
12.47/12.50	
12.47/12.50	LOG: CALL solveLinear
12.47/12.50	
12.47/12.50	LOG: RETURN solveLinear - Elapsed time: 0.001696s
12.47/12.50	Ranking function: -1 - c^0 + curr_serv^0
12.47/12.50	New Graphs: 
12.47/12.50	Transitions:
12.47/12.50	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.47/12.50	Variables:
12.47/12.50	c^0, curr_serv^0, resp^0
12.47/12.50	Checking conditional termination of SCC {l1}...
12.47/12.50	
12.47/12.50	LOG: CALL solveLinear
12.47/12.50	
12.47/12.50	LOG: RETURN solveLinear - Elapsed time: 0.000724s
12.47/12.50	Ranking function: (~(1) / 2) + (1 / 2)*curr_serv^0
12.47/12.50	New Graphs: 
12.47/12.50	Proving termination of subgraph 2
12.47/12.50	Checking unfeasibility...
12.47/12.50	Time used: 0.000864
12.47/12.50	
12.47/12.50	> No variable changes in termination graph.
12.47/12.50	Checking conditional unfeasibility...
12.47/12.50	Termination failed. Trying to show unreachability...
12.47/12.50	Proving unreachability of entry: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.47/12.50	
12.47/12.50	LOG: CALL check - Post:1 <= 0 - Process 1
12.47/12.50	* Exit transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.47/12.50	* Postcondition  : 1 <= 0
12.47/12.50	Postcodition moved up: 1 <= 0
12.47/12.50	
12.47/12.50	LOG: Try proving POST
12.47/12.50	Postcondition: 1 <= 0
12.47/12.50	
12.47/12.50	LOG: CALL check - Post:1 <= 0 - Process 2
12.47/12.50	* Exit transition: <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.47/12.50	* Postcondition  : 1 <= 0
12.47/12.50	
12.47/12.50	LOG: CALL solveLinear
12.47/12.50	
12.47/12.50	LOG: RETURN solveLinear - Elapsed time: 0.000642s
12.47/12.50	> Postcondition is not implied!
12.47/12.50	
12.47/12.50	LOG: RETURN check - Elapsed time: 0.000756s
12.47/12.50	
12.47/12.50	LOG: NarrowEntry size 1
12.47/12.50	Narrowing transition: 
12.47/12.50	<l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -2 + curr_serv^0, rest remain the same}>
12.47/12.50	
12.47/12.50	LOG: Narrow transition size 1
12.47/12.50	Narrowing transition: 
12.47/12.50	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.47/12.50	
12.47/12.50	LOG: Narrow transition size 1
12.47/12.50	ENTRIES:
12.47/12.50	<l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.47/12.51	END ENTRIES:
12.47/12.51	GRAPH:
12.47/12.51	<l1, l1, 0 <= 0 /\ undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -2 + curr_serv^0, rest remain the same}>
12.47/12.51	<l1, l1, 0 <= 0 /\ 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.47/12.51	END GRAPH:
12.47/12.51	EXIT: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.47/12.51	POST: 1 <= 0
12.47/12.51	
12.47/12.51	
12.47/12.51	LOG: Try proving POST
12.47/12.51	Solving with 1 template(s).
12.47/12.51	
12.47/12.51	LOG: CALL solveNonLinearGetFirstSolution
12.47/12.51	
12.47/12.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013047s
12.47/12.51	Time used: 0.012849
12.47/12.51	Improving Solution with cost 51 ...
12.47/12.51	
12.47/12.51	LOG: CALL solveNonLinearGetNextSolution
12.47/12.51	
12.47/12.51	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.048865s
12.47/12.51	Time used: 0.048856
12.47/12.51	
12.47/12.51	LOG: SAT solveNonLinear - Elapsed time: 0.061912s
12.47/12.51	Cost: 51; Total time: 0.061705
12.47/12.51	Failed at location 1: curr_serv^0 <= c^0
12.47/12.51	Before Improving: 
12.47/12.51	Quasi-invariant at l1: curr_serv^0 <= c^0
12.47/12.51	Optimizing invariants...
12.47/12.51	
12.47/12.51	LOG: CALL solveLinear
12.47/12.51	
12.47/12.51	LOG: RETURN solveLinear - Elapsed time: 0.002862s
12.47/12.51	Remaining time after improvement: 0.998839
12.47/12.51	Some transition disabled by a set of quasi-invariant(s):
12.47/12.51	Quasi-invariant at l1: curr_serv^0 <= c^0
12.47/12.51	
12.47/12.51	LOG: NEXT CALL check - disable
12.47/12.51	
12.47/12.51	LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 3
12.47/12.51	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.47/12.51	* Postcondition  : curr_serv^0 <= c^0
12.47/12.51	
12.47/12.51	LOG: CALL solveLinear
12.47/12.51	
12.47/12.51	LOG: RETURN solveLinear - Elapsed time: 0.000863s
12.47/12.51	> Postcondition is not implied!
12.47/12.51	
12.47/12.51	LOG: RETURN check - Elapsed time: 0.000996s
12.47/12.51	Solving with 2 template(s).
12.47/12.51	
12.47/12.51	LOG: CALL solveNonLinearGetFirstSolution
12.47/12.51	
12.47/12.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078186s
12.47/12.51	Time used: 0.077857
12.47/12.51	Improving Solution with cost 51 ...
12.47/12.51	
12.47/12.51	LOG: CALL solveNonLinearGetNextSolution
12.47/12.51	
12.47/12.51	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002554s
12.47/12.51	Time used: 1.00039
12.47/12.51	
12.47/12.51	LOG: SAT solveNonLinear - Elapsed time: 1.080740s
12.47/12.51	Cost: 51; Total time: 1.07824
12.47/12.51	Failed at location 1: 1 + curr_serv^0 <= c^0
12.47/12.51	Before Improving: 
12.47/12.51	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.47/12.51	Quasi-invariant at l1: 1 <= c^0 + resp^0
12.47/12.51	Optimizing invariants...
12.47/12.51	
12.47/12.51	LOG: CALL solveLinear
12.47/12.51	
12.47/12.51	LOG: RETURN solveLinear - Elapsed time: 0.009407s
12.47/12.51	Remaining time after improvement: 0.998171
12.47/12.51	Some transition disabled by a set of quasi-invariant(s):
12.47/12.51	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.47/12.51	Quasi-invariant at l1: 1 <= c^0 + resp^0
12.47/12.51	
12.47/12.51	LOG: NEXT CALL check - disable
12.47/12.51	
12.47/12.51	LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 4
12.47/12.51	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.47/12.51	* Postcondition  : 1 + curr_serv^0 <= c^0
12.47/12.51	
12.47/12.51	LOG: CALL solveLinear
12.47/12.51	
12.47/12.51	LOG: RETURN solveLinear - Elapsed time: 0.001045s
12.47/12.51	> Postcondition is not implied!
12.47/12.51	
12.47/12.51	LOG: RETURN check - Elapsed time: 0.001184s
12.47/12.51	Solving with 3 template(s).
12.47/12.51	
12.47/12.51	LOG: CALL solveNonLinearGetFirstSolution
12.47/12.51	
12.47/12.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.561154s
12.47/12.51	Time used: 0.560569
12.47/12.51	Improving Solution with cost 51 ...
12.47/12.51	
12.47/12.51	LOG: CALL solveNonLinearGetNextSolution
12.47/12.51	
12.47/12.51	LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.440404s
12.47/12.51	Time used: 0.440225
12.47/12.51	
12.47/12.51	LOG: SAT solveNonLinear - Elapsed time: 1.001558s
12.47/12.51	Cost: 51; Total time: 1.00079
12.47/12.51	Failed at location 1: 1 + curr_serv^0 <= c^0
12.47/12.51	Before Improving: 
12.47/12.51	Quasi-invariant at l1: 1 <= c^0 + resp^0
12.47/12.51	Quasi-invariant at l1: 1 <= c^0 + resp^0
12.47/12.51	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.47/12.51	Optimizing invariants...
12.47/12.51	
12.47/12.51	LOG: CALL solveLinear
12.47/12.51	
12.47/12.51	LOG: RETURN solveLinear - Elapsed time: 0.051089s
12.47/12.51	Remaining time after improvement: 0.997419
12.47/12.51	Some transition disabled by a set of quasi-invariant(s):
12.47/12.51	Quasi-invariant at l1: 1 <= c^0 + resp^0
12.47/12.51	Quasi-invariant at l1: 1 <= c^0 + resp^0
12.47/12.51	Quasi-invariant at l1: 1 + curr_serv^0 <= c^0
12.47/12.51	
12.47/12.51	LOG: NEXT CALL check - disable
12.47/12.51	
12.47/12.51	LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 5
12.47/12.51	* Exit transition: <l0, l1, 0 <= 0 /\ 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.47/12.51	* Postcondition  : 1 + curr_serv^0 <= c^0
12.47/12.51	
12.47/12.51	LOG: CALL solveLinear
12.47/12.51	
12.47/12.51	LOG: RETURN solveLinear - Elapsed time: 0.001477s
12.47/12.51	> Postcondition is not implied!
12.47/12.51	
12.47/12.51	LOG: RETURN check - Elapsed time: 0.001611s
12.47/12.51	
12.47/12.51	LOG: Postcondition is not implied - no solution
12.47/12.51	> Postcondition is not implied!
12.47/12.51	
12.47/12.51	LOG: RETURN check - Elapsed time: 2.224539s
12.47/12.51	Cannot prove unreachability
12.47/12.51	
12.47/12.51	Proving non-termination of subgraph 2
12.47/12.51	Transitions:
12.47/12.51	<l5, l5, true, {all remain the same}>
12.47/12.51	Variables:
12.47/12.51	
12.47/12.51	Checking conditional non-termination of SCC {l5}...
12.47/12.51	> No exit transition to close.
12.47/12.51	Calling reachability with...
12.47/12.51	Transition: <l5, end, true, {all remain the same}>
12.47/12.51	Conditions: 
12.47/12.51	OPEN EXITS: 
12.47/12.51	<l5, end, true, {all remain the same}>
12.47/12.51	
12.47/12.51	--- Reachability graph ---
12.47/12.51	> Graph without transitions.
12.47/12.51	
12.47/12.51	Calling reachability with...
12.47/12.51	Transition: <l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.47/12.51	Conditions: 
12.47/12.51	OPEN EXITS: 
12.47/12.51	<l1, l5, curr_serv^0 <= 0, {all remain the same}>
12.47/12.51	
12.47/12.51	--- Reachability graph ---
12.47/12.51	> Graph without transitions.
12.47/12.51	
12.47/12.51	Calling reachability with...
12.47/12.51	Transition: <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.47/12.51	Conditions: curr_serv^0 <= 0, 
12.47/12.51	OPEN EXITS: 
12.47/12.51	
12.47/12.51	> Conditions are not feasible after transitions.
12.47/12.51	--- Reachability graph ---
12.47/12.51	Transitions:
12.47/12.51	<l1, l1, undef37 <= 0 /\ 1 + c^0 <= curr_serv^0 /\ 1 <= curr_serv^0, {curr_serv^0 -> -2 + curr_serv^0, rest remain the same}>
12.47/12.51	Variables:
12.47/12.51	c^0, curr_serv^0
12.47/12.51	Checking edge-closing of SCC {l1}...
12.47/12.51	EXIT TRANSITIONS (TO CLOSE):
12.47/12.51	<l1, end, curr_serv^0 <= c^0 /\ 1 <= curr_serv^0, {all remain the same}>
12.47/12.51	
12.47/12.51	Solving with 1 template(s).
12.47/12.51	
12.47/12.51	LOG: CALL solveNonLinearGetFirstSolution
12.47/12.51	
12.47/12.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.176598s
12.47/12.51	Time used: 0.176354
12.47/12.51	Solving with 2 template(s).
12.47/12.51	
12.47/12.51	LOG: CALL solveNonLinearGetFirstSolution
12.47/12.51	
12.47/12.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001761s
12.47/12.51	Time used: 5.00049
12.47/12.51	Solving with 3 template(s).
12.47/12.51	
12.47/12.51	LOG: CALL solveNonLinearGetFirstSolution
12.47/12.51	
12.47/12.51	LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004486s
12.47/12.51	Time used: 5.00082
12.47/12.51	> No quasi-invariants that block all exits have been found.
12.47/12.51	--- Reachability graph ---
12.47/12.51	Transitions:
12.47/12.51	<l1, l1, 1 <= curr_serv^0 /\ 1 <= undef37, {c^0 -> -1 + c^0, curr_serv^0 -> -2 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}>
12.47/12.51	Variables:
12.47/12.51	c^0, curr_serv^0, resp^0
12.47/12.51	Checking edge-closing of SCC {l1}...
12.47/12.51	> No exit transition to close.
12.47/12.51	Checking conditional termination of SCC {l1}...
12.47/12.51	
12.47/12.51	LOG: CALL solveLinear
12.47/12.51	
12.47/12.51	LOG: RETURN solveLinear - Elapsed time: 0.001024s
12.47/12.51	Ranking function: (~(1) / 2) + (1 / 2)*curr_serv^0
12.47/12.51	New Graphs: 
12.47/12.51	Calling reachability with...
12.47/12.51	Transition: <l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.47/12.51	Conditions: 
12.47/12.51	OPEN EXITS: 
12.47/12.51	<l0, l1, 1 <= undef51 /\ c^0 = undef51 /\ curr_serv^0 = undef54 /\ resp^0 = 0 /\ undef50 = undef51 /\ undef54 = 4, {all remain the same}>
12.47/12.51	
12.47/12.51	> Conditions are reachable!
12.47/12.51	
12.47/12.51	Program does NOT terminate
12.47/12.51	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found
12.47/12.51	/export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found
12.47/12.51	EOF