NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (~(1) + curr_serv^0)}> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> undef43}> undef58, curr_serv^0 -> (0 + undef61), resp^0 -> 0, servers^0 -> undef61, serversdiv2^0 -> undef62, tmp1^0 -> undef63}> Fresh variables: undef43, undef58, undef61, undef62, undef63, Undef variables: undef43, undef58, undef61, undef62, undef63, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (~(1) + curr_serv^0)}> (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> Fresh variables: undef43, undef58, undef61, undef62, undef63, Undef variables: undef43, undef58, undef61, undef62, undef63, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + curr_serv^0, rest remain the same}> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> Variables: c^0, curr_serv^0, resp^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.005985 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001345s Ranking function: -1 - c^0 + curr_serv^0 New Graphs: Transitions: -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> Variables: c^0, curr_serv^0, resp^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000721s Ranking function: -1 + curr_serv^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.000859 > No variable changes in termination graph. Checking conditional unfeasibility... Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 Postcodition moved up: 1 <= 0 LOG: Try proving POST Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 2 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000683s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000808s LOG: NarrowEntry size 1 Narrowing transition: -1 + curr_serv^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: -1 + curr_serv^0, rest remain the same}> -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> END GRAPH: EXIT: POST: 1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013092s Time used: 0.012877 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000640s Time used: 1.00038 LOG: SAT solveNonLinear - Elapsed time: 1.013732s Cost: 51; Total time: 1.01326 Failed at location 1: curr_serv^0 <= c^0 Before Improving: Quasi-invariant at l1: curr_serv^0 <= c^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004501s Remaining time after improvement: 0.998685 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l1: curr_serv^0 <= c^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 3 * Exit transition: * Postcondition : curr_serv^0 <= c^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000909s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001057s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.093852s Time used: 0.093514 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.014567s Time used: 1.01446 LOG: SAT solveNonLinear - Elapsed time: 1.108419s Cost: 51; Total time: 1.10797 Failed at location 1: 1 + curr_serv^0 <= c^0 Before Improving: Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 Quasi-invariant at l1: 1 <= curr_serv^0 + resp^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008530s Remaining time after improvement: 0.998065 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 Quasi-invariant at l1: 1 <= curr_serv^0 + resp^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 4 * Exit transition: * Postcondition : 1 + curr_serv^0 <= c^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001183s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001328s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.725669s Time used: 0.725039 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.275477s Time used: 0.275427 LOG: SAT solveNonLinear - Elapsed time: 1.001145s Cost: 51; Total time: 1.00047 Failed at location 1: curr_serv^0 <= c^0 Before Improving: Quasi-invariant at l1: curr_serv^0 <= c^0 Quasi-invariant at l1: 0 <= c^0 Quasi-invariant at l1: 0 <= resp^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019955s Remaining time after improvement: 0.99734 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l1: curr_serv^0 <= c^0 Quasi-invariant at l1: 0 <= c^0 Quasi-invariant at l1: 0 <= resp^0 LOG: NEXT CALL check - disable LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 5 * Exit transition: * Postcondition : curr_serv^0 <= c^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001279s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001424s LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 3.173329s Cannot prove unreachability Proving non-termination of subgraph 2 Transitions: Variables: Checking conditional non-termination of SCC {l5}... > No exit transition to close. Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: curr_serv^0 <= 0, OPEN EXITS: > Conditions are not feasible after transitions. --- Reachability graph --- Transitions: -1 + curr_serv^0, rest remain the same}> Variables: c^0, curr_serv^0 Checking edge-closing of SCC {l1}... EXIT TRANSITIONS (TO CLOSE): Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001974s Time used: 5.001 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.006629s Time used: 5.00099 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005871s Time used: 5.00116 > No quasi-invariants that block all exits have been found. --- Reachability graph --- Transitions: -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> Variables: c^0, curr_serv^0, resp^0 Checking edge-closing of SCC {l1}... > No exit transition to close. Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001022s Ranking function: -1 + curr_serv^0 New Graphs: Calling reachability with... Transition: Conditions: OPEN EXITS: > Conditions are reachable! Program does NOT terminate