12.26/12.30 NO 12.26/12.30 12.26/12.30 Solver Timeout: 4 12.26/12.30 Global Timeout: 300 12.26/12.30 No parsing errors! 12.26/12.30 Init Location: 0 12.26/12.30 Transitions: 12.26/12.30 12.26/12.30 12.26/12.30 12.26/12.30 12.26/12.30 12.26/12.30 (~(1) + curr_serv^0)}> 12.26/12.30 (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.26/12.30 undef31}> 12.26/12.30 12.26/12.30 undef42, curr_serv^0 -> (0 + undef45), resp^0 -> 0, servers^0 -> undef45}> 12.26/12.30 12.26/12.30 12.26/12.30 Fresh variables: 12.26/12.30 undef31, undef42, undef45, 12.26/12.30 12.26/12.30 Undef variables: 12.26/12.30 undef31, undef42, undef45, 12.26/12.30 12.26/12.30 Abstraction variables: 12.26/12.30 12.26/12.30 Exit nodes: 12.26/12.30 12.26/12.30 Accepting locations: 12.26/12.30 12.26/12.30 Asserts: 12.26/12.30 12.26/12.30 Preprocessed LLVMGraph 12.26/12.30 Init Location: 0 12.26/12.30 Transitions: 12.26/12.30 12.26/12.30 (~(1) + curr_serv^0)}> 12.26/12.30 (~(1) + c^0), curr_serv^0 -> (~(1) + curr_serv^0), resp^0 -> (1 + resp^0)}> 12.26/12.30 12.26/12.30 12.26/12.30 12.26/12.30 Fresh variables: 12.26/12.30 undef31, undef42, undef45, 12.26/12.30 12.26/12.30 Undef variables: 12.26/12.30 undef31, undef42, undef45, 12.26/12.30 12.26/12.30 Abstraction variables: 12.26/12.30 12.26/12.30 Exit nodes: 12.26/12.30 12.26/12.30 Accepting locations: 12.26/12.30 12.26/12.30 Asserts: 12.26/12.30 12.26/12.30 ************************************************************* 12.26/12.30 ******************************************************************************************* 12.26/12.30 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 12.26/12.30 ******************************************************************************************* 12.26/12.30 12.26/12.30 Init Location: 0 12.26/12.30 Graph 0: 12.26/12.30 Transitions: 12.26/12.30 Variables: 12.26/12.30 12.26/12.30 Graph 1: 12.26/12.30 Transitions: 12.26/12.30 -1 + curr_serv^0, rest remain the same}> 12.26/12.30 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.26/12.30 Variables: 12.26/12.30 c^0, curr_serv^0, resp^0 12.26/12.30 12.26/12.30 Graph 2: 12.26/12.30 Transitions: 12.26/12.30 12.26/12.30 Variables: 12.26/12.30 12.26/12.30 Precedence: 12.26/12.30 Graph 0 12.26/12.30 12.26/12.30 Graph 1 12.26/12.30 12.26/12.30 12.26/12.30 Graph 2 12.26/12.30 12.26/12.30 12.26/12.30 Map Locations to Subgraph: 12.26/12.30 ( 0 , 0 ) 12.26/12.30 ( 1 , 1 ) 12.26/12.30 ( 5 , 2 ) 12.26/12.30 12.26/12.30 ******************************************************************************************* 12.26/12.30 ******************************** CHECKING ASSERTIONS ******************************** 12.26/12.30 ******************************************************************************************* 12.26/12.30 12.26/12.30 Proving termination of subgraph 0 12.26/12.30 Proving termination of subgraph 1 12.26/12.30 Checking unfeasibility... 12.26/12.30 Time used: 0.005343 12.26/12.30 12.26/12.30 Checking conditional termination of SCC {l1}... 12.26/12.30 12.26/12.30 LOG: CALL solveLinear 12.26/12.30 12.26/12.30 LOG: RETURN solveLinear - Elapsed time: 0.001323s 12.26/12.30 Ranking function: -1 - c^0 + curr_serv^0 12.26/12.30 New Graphs: 12.26/12.30 Transitions: 12.26/12.30 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.26/12.30 Variables: 12.26/12.30 c^0, curr_serv^0, resp^0 12.26/12.30 Checking conditional termination of SCC {l1}... 12.26/12.30 12.26/12.30 LOG: CALL solveLinear 12.26/12.30 12.26/12.30 LOG: RETURN solveLinear - Elapsed time: 0.000702s 12.26/12.30 Ranking function: -1 + curr_serv^0 12.26/12.30 New Graphs: 12.26/12.30 Proving termination of subgraph 2 12.26/12.30 Checking unfeasibility... 12.26/12.30 Time used: 0.000851 12.26/12.30 12.26/12.30 > No variable changes in termination graph. 12.26/12.30 Checking conditional unfeasibility... 12.26/12.30 Termination failed. Trying to show unreachability... 12.26/12.30 Proving unreachability of entry: 12.26/12.30 12.26/12.30 LOG: CALL check - Post:1 <= 0 - Process 1 12.26/12.30 * Exit transition: 12.26/12.30 * Postcondition : 1 <= 0 12.26/12.30 Postcodition moved up: 1 <= 0 12.26/12.30 12.26/12.30 LOG: Try proving POST 12.26/12.30 Postcondition: 1 <= 0 12.26/12.30 12.26/12.30 LOG: CALL check - Post:1 <= 0 - Process 2 12.26/12.30 * Exit transition: 12.26/12.30 * Postcondition : 1 <= 0 12.26/12.30 12.26/12.30 LOG: CALL solveLinear 12.26/12.30 12.26/12.30 LOG: RETURN solveLinear - Elapsed time: 0.000565s 12.26/12.30 > Postcondition is not implied! 12.26/12.30 12.26/12.30 LOG: RETURN check - Elapsed time: 0.000670s 12.26/12.30 12.26/12.30 LOG: NarrowEntry size 1 12.26/12.30 Narrowing transition: 12.26/12.30 -1 + curr_serv^0, rest remain the same}> 12.26/12.30 12.26/12.30 LOG: Narrow transition size 1 12.26/12.30 Narrowing transition: 12.26/12.30 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.26/12.30 12.26/12.30 LOG: Narrow transition size 1 12.26/12.30 ENTRIES: 12.26/12.30 12.26/12.30 END ENTRIES: 12.26/12.30 GRAPH: 12.26/12.30 -1 + curr_serv^0, rest remain the same}> 12.26/12.30 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.26/12.30 END GRAPH: 12.26/12.30 EXIT: 12.26/12.30 POST: 1 <= 0 12.26/12.30 12.26/12.30 12.26/12.30 LOG: Try proving POST 12.26/12.30 Solving with 1 template(s). 12.26/12.30 12.26/12.30 LOG: CALL solveNonLinearGetFirstSolution 12.26/12.30 12.26/12.30 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012062s 12.26/12.30 Time used: 0.011873 12.26/12.30 Improving Solution with cost 51 ... 12.26/12.30 12.26/12.30 LOG: CALL solveNonLinearGetNextSolution 12.26/12.30 12.26/12.30 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032622s 12.26/12.30 Time used: 0.032616 12.26/12.30 12.26/12.30 LOG: SAT solveNonLinear - Elapsed time: 0.044684s 12.26/12.30 Cost: 51; Total time: 0.044489 12.26/12.30 Failed at location 1: curr_serv^0 <= c^0 12.26/12.30 Before Improving: 12.26/12.30 Quasi-invariant at l1: curr_serv^0 <= c^0 12.26/12.30 Optimizing invariants... 12.26/12.30 12.26/12.30 LOG: CALL solveLinear 12.26/12.30 12.26/12.30 LOG: RETURN solveLinear - Elapsed time: 0.002346s 12.26/12.30 Remaining time after improvement: 0.998925 12.26/12.30 Some transition disabled by a set of quasi-invariant(s): 12.26/12.31 Quasi-invariant at l1: curr_serv^0 <= c^0 12.26/12.31 12.26/12.31 LOG: NEXT CALL check - disable 12.26/12.31 12.26/12.31 LOG: CALL check - Post:curr_serv^0 <= c^0 - Process 3 12.26/12.31 * Exit transition: 12.26/12.31 * Postcondition : curr_serv^0 <= c^0 12.26/12.31 12.26/12.31 LOG: CALL solveLinear 12.26/12.31 12.26/12.31 LOG: RETURN solveLinear - Elapsed time: 0.000751s 12.26/12.31 > Postcondition is not implied! 12.26/12.31 12.26/12.31 LOG: RETURN check - Elapsed time: 0.000872s 12.26/12.31 Solving with 2 template(s). 12.26/12.31 12.26/12.31 LOG: CALL solveNonLinearGetFirstSolution 12.26/12.31 12.26/12.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.079306s 12.26/12.31 Time used: 0.07902 12.26/12.31 Improving Solution with cost 51 ... 12.26/12.31 12.26/12.31 LOG: CALL solveNonLinearGetNextSolution 12.26/12.31 12.26/12.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000651s 12.26/12.31 Time used: 1.00059 12.26/12.31 12.26/12.31 LOG: SAT solveNonLinear - Elapsed time: 1.079958s 12.26/12.31 Cost: 51; Total time: 1.07961 12.26/12.31 Failed at location 1: 1 + curr_serv^0 <= c^0 12.26/12.31 Before Improving: 12.26/12.31 Quasi-invariant at l1: 0 <= 1 + curr_serv^0 12.26/12.31 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.26/12.31 Optimizing invariants... 12.26/12.31 12.26/12.31 LOG: CALL solveLinear 12.26/12.31 12.26/12.31 LOG: RETURN solveLinear - Elapsed time: 0.008081s 12.26/12.31 Remaining time after improvement: 0.99825 12.26/12.31 Some transition disabled by a set of quasi-invariant(s): 12.26/12.31 Quasi-invariant at l1: 0 <= 1 + curr_serv^0 12.26/12.31 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.26/12.31 12.26/12.31 LOG: NEXT CALL check - disable 12.26/12.31 12.26/12.31 LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 4 12.26/12.31 * Exit transition: 12.26/12.31 * Postcondition : 1 + curr_serv^0 <= c^0 12.26/12.31 12.26/12.31 LOG: CALL solveLinear 12.26/12.31 12.26/12.31 LOG: RETURN solveLinear - Elapsed time: 0.000938s 12.26/12.31 > Postcondition is not implied! 12.26/12.31 12.26/12.31 LOG: RETURN check - Elapsed time: 0.001060s 12.26/12.31 Solving with 3 template(s). 12.26/12.31 12.26/12.31 LOG: CALL solveNonLinearGetFirstSolution 12.26/12.31 12.26/12.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.656088s 12.26/12.31 Time used: 0.655653 12.26/12.31 Improving Solution with cost 51 ... 12.26/12.31 12.26/12.31 LOG: CALL solveNonLinearGetNextSolution 12.26/12.31 12.26/12.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.345151s 12.26/12.31 Time used: 0.345003 12.26/12.31 12.26/12.31 LOG: SAT solveNonLinear - Elapsed time: 1.001239s 12.26/12.31 Cost: 51; Total time: 1.00066 12.26/12.31 Failed at location 1: 1 + curr_serv^0 <= c^0 12.26/12.31 Before Improving: 12.26/12.31 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.26/12.31 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.26/12.31 Quasi-invariant at l1: 1 <= curr_serv^0 + resp^0 12.26/12.31 Optimizing invariants... 12.26/12.31 12.26/12.31 LOG: CALL solveLinear 12.26/12.31 12.26/12.31 LOG: RETURN solveLinear - Elapsed time: 0.038744s 12.26/12.31 Remaining time after improvement: 0.997544 12.26/12.31 Some transition disabled by a set of quasi-invariant(s): 12.26/12.31 Quasi-invariant at l1: 1 + curr_serv^0 <= c^0 12.26/12.31 Quasi-invariant at l1: 1 <= c^0 + resp^0 12.26/12.31 Quasi-invariant at l1: 1 <= curr_serv^0 + resp^0 12.26/12.31 12.26/12.31 LOG: NEXT CALL check - disable 12.26/12.31 12.26/12.31 LOG: CALL check - Post:1 + curr_serv^0 <= c^0 - Process 5 12.26/12.31 * Exit transition: 12.26/12.31 * Postcondition : 1 + curr_serv^0 <= c^0 12.26/12.31 12.26/12.31 LOG: CALL solveLinear 12.26/12.31 12.26/12.31 LOG: RETURN solveLinear - Elapsed time: 0.001313s 12.26/12.31 > Postcondition is not implied! 12.26/12.31 12.26/12.31 LOG: RETURN check - Elapsed time: 0.001447s 12.26/12.31 12.26/12.31 LOG: Postcondition is not implied - no solution 12.26/12.31 > Postcondition is not implied! 12.26/12.31 12.26/12.31 LOG: RETURN check - Elapsed time: 2.190676s 12.26/12.31 Cannot prove unreachability 12.26/12.31 12.26/12.31 Proving non-termination of subgraph 2 12.26/12.31 Transitions: 12.26/12.31 12.26/12.31 Variables: 12.26/12.31 12.26/12.31 Checking conditional non-termination of SCC {l5}... 12.26/12.31 > No exit transition to close. 12.26/12.31 Calling reachability with... 12.26/12.31 Transition: 12.26/12.31 Conditions: 12.26/12.31 OPEN EXITS: 12.26/12.31 12.26/12.31 12.26/12.31 --- Reachability graph --- 12.26/12.31 > Graph without transitions. 12.26/12.31 12.26/12.31 Calling reachability with... 12.26/12.31 Transition: 12.26/12.31 Conditions: 12.26/12.31 OPEN EXITS: 12.26/12.31 12.26/12.31 12.26/12.31 --- Reachability graph --- 12.26/12.31 > Graph without transitions. 12.26/12.31 12.26/12.31 Calling reachability with... 12.26/12.31 Transition: 12.26/12.31 Conditions: curr_serv^0 <= 0, 12.26/12.31 OPEN EXITS: 12.26/12.31 12.26/12.31 > Conditions are not feasible after transitions. 12.26/12.31 --- Reachability graph --- 12.26/12.31 Transitions: 12.26/12.31 -1 + curr_serv^0, rest remain the same}> 12.26/12.31 Variables: 12.26/12.31 c^0, curr_serv^0 12.26/12.31 Checking edge-closing of SCC {l1}... 12.26/12.31 EXIT TRANSITIONS (TO CLOSE): 12.26/12.31 12.26/12.31 12.26/12.31 Solving with 1 template(s). 12.26/12.31 12.26/12.31 LOG: CALL solveNonLinearGetFirstSolution 12.26/12.31 12.26/12.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022943s 12.26/12.31 Time used: 0.02284 12.26/12.31 Solving with 2 template(s). 12.26/12.31 12.26/12.31 LOG: CALL solveNonLinearGetFirstSolution 12.26/12.31 12.26/12.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.001566s 12.26/12.31 Time used: 5.00053 12.26/12.31 Solving with 3 template(s). 12.26/12.31 12.26/12.31 LOG: CALL solveNonLinearGetFirstSolution 12.26/12.31 12.26/12.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005374s 12.26/12.31 Time used: 5.00086 12.26/12.31 > No quasi-invariants that block all exits have been found. 12.26/12.31 --- Reachability graph --- 12.26/12.31 Transitions: 12.26/12.31 -1 + c^0, curr_serv^0 -> -1 + curr_serv^0, resp^0 -> 1 + resp^0, rest remain the same}> 12.26/12.31 Variables: 12.26/12.31 c^0, curr_serv^0, resp^0 12.26/12.31 Checking edge-closing of SCC {l1}... 12.26/12.31 > No exit transition to close. 12.26/12.31 Checking conditional termination of SCC {l1}... 12.26/12.31 12.26/12.31 LOG: CALL solveLinear 12.26/12.31 12.26/12.31 LOG: RETURN solveLinear - Elapsed time: 0.001001s 12.26/12.31 Ranking function: -1 + curr_serv^0 12.26/12.31 New Graphs: 12.26/12.31 Calling reachability with... 12.26/12.31 Transition: 12.26/12.31 Conditions: 12.26/12.31 OPEN EXITS: 12.26/12.31 12.26/12.31 12.26/12.31 > Conditions are reachable! 12.26/12.31 12.26/12.31 Program does NOT terminate 12.26/12.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 12.26/12.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 12.26/12.31 EOF