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)}> undef31}> undef42, curr_serv^0 -> (0 + undef45), resp^0 -> 0, servers^0 -> undef45}> Fresh variables: undef31, undef42, undef45, Undef variables: undef31, undef42, undef45, 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: undef31, undef42, undef45, Undef variables: undef31, undef42, undef45, 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.005336 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001338s 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.000707s Ranking function: -1 + curr_serv^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.000855 > 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.000562s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000667s 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.012029s Time used: 0.011841 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032629s Time used: 0.032626 LOG: SAT solveNonLinear - Elapsed time: 0.044659s Cost: 51; Total time: 0.044467 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.002286s Remaining time after improvement: 0.998936 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.000762s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000886s Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079589s Time used: 0.079315 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000286s Time used: 1.00032 LOG: SAT solveNonLinear - Elapsed time: 1.079875s Cost: 51; Total time: 1.07964 Failed at location 1: 1 + curr_serv^0 <= c^0 Before Improving: Quasi-invariant at l1: 0 <= 1 + curr_serv^0 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007935s Remaining time after improvement: 0.998259 Some transition disabled by a set of quasi-invariant(s): Quasi-invariant at l1: 0 <= 1 + curr_serv^0 Quasi-invariant at l1: 1 + curr_serv^0 <= c^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.000925s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001057s Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.654989s Time used: 0.654635 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.346341s Time used: 0.346354 LOG: SAT solveNonLinear - Elapsed time: 1.001330s Cost: 51; Total time: 1.00099 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 <= c^0 + resp^0 Quasi-invariant at l1: 1 <= curr_serv^0 + resp^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.038801s Remaining time after improvement: 0.997548 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 <= c^0 + resp^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 5 * Exit transition: * Postcondition : 1 + curr_serv^0 <= c^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001317s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001444s LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 2.190339s 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: 0.022924s Time used: 0.022824 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.000856s Time used: 5.0006 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004437s Time used: 5.0008 > 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.001003s Ranking function: -1 + curr_serv^0 New Graphs: Calling reachability with... Transition: Conditions: OPEN EXITS: > Conditions are reachable! Program does NOT terminate