127.07/127.23 NO 127.07/127.23 127.07/127.23 Solver Timeout: 4 127.07/127.23 Global Timeout: 300 127.07/127.23 No parsing errors! 127.07/127.23 Init Location: 0 127.07/127.23 Transitions: 127.07/127.23 127.07/127.23 127.07/127.23 (1 + num^0)}> 127.07/127.23 0, i^0 -> (1 + i^0), status^0 -> 1}> 127.07/127.23 0, Pdo^0 -> 0, conditional^0 -> undef40}> 127.07/127.23 (~(1) + rho_1^0)}> 127.07/127.23 127.07/127.23 1, num^0 -> 0}> 127.07/127.23 127.07/127.23 1, conditional^0 -> undef95}> 127.07/127.23 0}> 127.07/127.23 undef111, PPBlockInits^0 -> 1, status^0 -> 0}> 127.07/127.23 0, PPBlockInits^0 -> 1, PPBunlockInits^0 -> 0, Pdolen^0 -> undef127, i^0 -> undef129, status^0 -> 0}> 127.07/127.23 127.07/127.23 127.07/127.23 Fresh variables: 127.07/127.23 undef40, undef95, undef111, undef127, undef129, 127.07/127.23 127.07/127.23 Undef variables: 127.07/127.23 undef40, undef95, undef111, undef127, undef129, 127.07/127.23 127.07/127.23 Abstraction variables: 127.07/127.23 127.07/127.23 Exit nodes: 127.07/127.23 127.07/127.23 Accepting locations: 127.07/127.23 127.07/127.23 Asserts: 127.07/127.23 127.07/127.23 Preprocessed LLVMGraph 127.07/127.23 Init Location: 0 127.07/127.23 Transitions: 127.07/127.23 127.07/127.23 (~(1) + rho_1^0)}> 127.07/127.23 0}> 127.07/127.23 127.07/127.23 127.07/127.23 (1 + i^0)}> 127.07/127.23 127.07/127.23 (1 + num^0)}> 127.07/127.23 127.07/127.23 Fresh variables: 127.07/127.23 undef40, undef95, undef111, undef127, undef129, 127.07/127.23 127.07/127.23 Undef variables: 127.07/127.23 undef40, undef95, undef111, undef127, undef129, 127.07/127.23 127.07/127.23 Abstraction variables: 127.07/127.23 127.07/127.23 Exit nodes: 127.07/127.23 127.07/127.23 Accepting locations: 127.07/127.23 127.07/127.23 Asserts: 127.07/127.23 127.07/127.23 ************************************************************* 127.07/127.23 ******************************************************************************************* 127.07/127.23 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 127.07/127.23 ******************************************************************************************* 127.07/127.23 127.07/127.23 Init Location: 0 127.07/127.23 Graph 0: 127.07/127.23 Transitions: 127.07/127.23 Variables: 127.07/127.23 127.07/127.23 Graph 1: 127.07/127.23 Transitions: 127.07/127.23 1 + i^0, rest remain the same}> 127.07/127.23 1 + num^0, rest remain the same}> 127.07/127.23 Variables: 127.07/127.23 Pdolen^0, i^0, num^0 127.07/127.23 127.07/127.23 Graph 2: 127.07/127.23 Transitions: 127.07/127.23 -1 + rho_1^0, rest remain the same}> 127.07/127.23 Variables: 127.07/127.23 rho_1^0 127.07/127.23 127.07/127.23 Graph 3: 127.07/127.23 Transitions: 127.07/127.23 Variables: 127.07/127.23 127.07/127.23 Precedence: 127.07/127.23 Graph 0 127.07/127.23 127.07/127.23 Graph 1 127.07/127.23 127.07/127.23 127.07/127.23 Graph 2 127.07/127.23 127.07/127.23 127.07/127.23 127.07/127.23 127.07/127.23 Graph 3 127.07/127.23 0, rest remain the same}> 127.07/127.23 127.07/127.23 Map Locations to Subgraph: 127.07/127.23 ( 0 , 0 ) 127.07/127.23 ( 2 , 2 ) 127.07/127.23 ( 3 , 1 ) 127.07/127.23 ( 6 , 3 ) 127.07/127.23 127.07/127.23 ******************************************************************************************* 127.07/127.23 ******************************** CHECKING ASSERTIONS ******************************** 127.07/127.23 ******************************************************************************************* 127.07/127.23 127.07/127.23 Proving termination of subgraph 0 127.07/127.23 Proving termination of subgraph 1 127.07/127.23 Checking unfeasibility... 127.07/127.24 Time used: 0.004779 127.07/127.24 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001645s 127.07/127.24 Ranking function: -6 + 6*Pdolen^0 - 6*i^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.000692s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.002804s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007581s 127.07/127.24 Time used: 0.007386 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013043s 127.07/127.24 Time used: 0.012471 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019165s 127.07/127.24 Time used: 0.019156 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.032208s 127.07/127.24 Cost: 1; Total time: 0.031627 127.07/127.24 Failed at location 3: 1 + Pdolen^0 <= i^0 127.07/127.24 Before Improving: 127.07/127.24 Quasi-invariant at l3: 1 + Pdolen^0 <= i^0 127.07/127.24 Optimizing invariants... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.004470s 127.07/127.24 Quasi-invariant improved 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001846s 127.07/127.24 Remaining time after improvement: 0.99606 127.07/127.24 Termination implied by a set of quasi-invariant(s): 127.07/127.24 Quasi-invariant at l3: Pdolen^0 <= i^0 127.07/127.24 [ Invariant Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 It's unfeasible. Removing transition: 127.07/127.24 1 + i^0, rest remain the same}> 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 It's unfeasible. Removing transition: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 [ Termination Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 It's unfeasible. Removing transition: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 New Graphs: 127.07/127.24 Calling Safety with literal Pdolen^0 <= i^0 and entry 127.07/127.24 127.07/127.24 LOG: CALL check - Post:Pdolen^0 <= i^0 - Process 1 127.07/127.24 * Exit transition: 127.07/127.24 * Postcondition : Pdolen^0 <= i^0 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.000587s 127.07/127.24 > Postcondition is not implied! 127.07/127.24 127.07/127.24 LOG: RETURN check - Elapsed time: 0.000688s 127.07/127.24 INVARIANTS: 127.07/127.24 3: 127.07/127.24 Quasi-INVARIANTS to narrow Graph: 127.07/127.24 3: Pdolen^0 <= i^0 , 127.07/127.24 Narrowing transition: 127.07/127.24 1 + i^0, rest remain the same}> 127.07/127.24 127.07/127.24 LOG: Narrow transition size 1 127.07/127.24 Narrowing transition: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 127.07/127.24 LOG: Narrow transition size 1 127.07/127.24 invGraph after Narrowing: 127.07/127.24 Transitions: 127.07/127.24 1 + i^0, rest remain the same}> 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001574s 127.07/127.24 Ranking function: -6 + 6*Pdolen^0 - 6*i^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.000710s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.002806s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006962s 127.07/127.24 Time used: 0.006811 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006485s 127.07/127.24 Time used: 4.0023 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.018634s 127.07/127.24 Time used: 4.01264 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004824s 127.07/127.24 Time used: 1.00064 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019239s 127.07/127.24 Time used: 0.011869 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017616s 127.07/127.24 Time used: 0.017607 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.036855s 127.07/127.24 Cost: 1; Total time: 0.029476 127.07/127.24 Termination implied by a set of invariant(s): 127.07/127.24 Invariant at l3: i^0 <= 1 + Pdolen^0 127.07/127.24 [ Invariant Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + i^0, rest remain the same}> 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 [ Termination Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Quasi-ranking function: 50000 - num^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.000810s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.003287s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008845s 127.07/127.24 Time used: 0.008672 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008648s 127.07/127.24 Time used: 4.00089 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006086s 127.07/127.24 Time used: 4.00093 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007169s 127.07/127.24 Time used: 1.00015 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021468s 127.07/127.24 Time used: 0.014009 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023544s 127.07/127.24 Time used: 0.023535 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.045011s 127.07/127.24 Cost: 1; Total time: 0.037544 127.07/127.24 Termination implied by a set of invariant(s): 127.07/127.24 Invariant at l3: i^0 <= Pdolen^0 127.07/127.24 [ Invariant Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + i^0, rest remain the same}> 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 [ Termination Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Quasi-ranking function: 50000 + 2*Pdolen^0 - 2*i^0 - num^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.000947s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.004288s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009675s 127.07/127.24 Time used: 0.009491 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.068518s 127.07/127.24 Time used: 4.06575 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005398s 127.07/127.24 Time used: 4.00078 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005131s 127.07/127.24 Time used: 1.00011 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022134s 127.07/127.24 Time used: 0.014611 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014424s 127.07/127.24 Time used: 0.014417 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.036558s 127.07/127.24 Cost: 1; Total time: 0.029028 127.07/127.24 Termination implied by a set of invariant(s): 127.07/127.24 Invariant at l3: i^0 <= Pdolen^0 127.07/127.24 [ Invariant Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + i^0, rest remain the same}> 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 [ Termination Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Quasi-ranking function: 50000 - Pdolen^0 + i^0 - num^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001052s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.004375s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009523s 127.07/127.24 Time used: 0.009333 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005543s 127.07/127.24 Time used: 4.00175 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006712s 127.07/127.24 Time used: 4.00087 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005175s 127.07/127.24 Time used: 1.00003 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024214s 127.07/127.24 Time used: 0.0162 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019421s 127.07/127.24 Time used: 0.019413 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.043635s 127.07/127.24 Cost: 1; Total time: 0.035613 127.07/127.24 Quasi-ranking function: 50000 + Pdolen^0 + i^0 - num^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001167s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.005192s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011929s 127.07/127.24 Time used: 0.011736 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003981s 127.07/127.24 Time used: 4.00285 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011798s 127.07/127.24 Time used: 4.00314 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004374s 127.07/127.24 Time used: 1.00014 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023588s 127.07/127.24 Time used: 0.016089 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019784s 127.07/127.24 Time used: 0.019776 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.043372s 127.07/127.24 Cost: 1; Total time: 0.035865 127.07/127.24 Quasi-ranking function: 50000 - Pdolen^0 - i^0 - num^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001291s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.006631s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011406s 127.07/127.24 Time used: 0.011203 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003251s 127.07/127.24 Time used: 4.00219 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007032s 127.07/127.24 Time used: 4.00099 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005357s 127.07/127.24 Time used: 1.00008 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023557s 127.07/127.24 Time used: 0.016497 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018686s 127.07/127.24 Time used: 0.018678 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.042243s 127.07/127.24 Cost: 1; Total time: 0.035175 127.07/127.24 Quasi-ranking function: 50000 - i^0 - num^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001394s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.007066s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013275s 127.07/127.24 Time used: 0.013055 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002451s 127.07/127.24 Time used: 4.00134 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011932s 127.07/127.24 Time used: 4.00705 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004337s 127.07/127.24 Time used: 1.00001 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024481s 127.07/127.24 Time used: 0.016972 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018501s 127.07/127.24 Time used: 0.018487 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.042982s 127.07/127.24 Cost: 1; Total time: 0.035459 127.07/127.24 Quasi-ranking function: 50000 + 100004*i^0 - num^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001481s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.007925s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012555s 127.07/127.24 Time used: 0.012326 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003799s 127.07/127.24 Time used: 4.0027 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007217s 127.07/127.24 Time used: 4.00101 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005054s 127.07/127.24 Time used: 1.00003 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026116s 127.07/127.24 Time used: 0.018535 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018114s 127.07/127.24 Time used: 0.018105 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.044229s 127.07/127.24 Cost: 1; Total time: 0.03664 127.07/127.24 Termination implied by a set of invariant(s): 127.07/127.24 Invariant at l3: i^0 <= Pdolen^0 127.07/127.24 [ Invariant Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + i^0, rest remain the same}> 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 [ Termination Graph ] 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Quasi-ranking function: 50000 + Pdolen^0 - num^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001577s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.009698s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014375s 127.07/127.24 Time used: 0.013909 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003713s 127.07/127.24 Time used: 4.00269 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006976s 127.07/127.24 Time used: 4.00122 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004479s 127.07/127.24 Time used: 1.00019 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026480s 127.07/127.24 Time used: 0.018909 127.07/127.24 Improving Solution with cost 1 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020355s 127.07/127.24 Time used: 0.020346 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 0.046835s 127.07/127.24 Cost: 1; Total time: 0.039255 127.07/127.24 Quasi-ranking function: 50000 - Pdolen^0 - num^0 127.07/127.24 New Graphs: 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 Checking conditional termination of SCC {l3}... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.001665s 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.011077s 127.07/127.24 Trying to remove transition: 1 + num^0, rest remain the same}> 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013721s 127.07/127.24 Time used: 0.013315 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003571s 127.07/127.24 Time used: 4.00254 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007159s 127.07/127.24 Time used: 4.0011 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006464s 127.07/127.24 Time used: 1.00001 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024881s 127.07/127.24 Time used: 0.017862 127.07/127.24 127.07/127.24 Proving non-termination of subgraph 1 127.07/127.24 Transitions: 127.07/127.24 1 + i^0, rest remain the same}> 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 127.07/127.24 Checking conditional non-termination of SCC {l3}... 127.07/127.24 EXIT TRANSITIONS: 127.07/127.24 127.07/127.24 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002479s 127.07/127.24 Time used: 5.00133 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.015172s 127.07/127.24 Time used: 5.00165 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.009137s 127.07/127.24 Time used: 5.00016 127.07/127.24 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO 127.07/127.24 127.07/127.24 Proving non-termination of subgraph 1 127.07/127.24 Transitions: 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 Variables: 127.07/127.24 Pdolen^0, i^0, num^0 127.07/127.24 127.07/127.24 Checking conditional non-termination of SCC {l3}... 127.07/127.24 EXIT TRANSITIONS: 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.367872s 127.07/127.24 Time used: 1.36624 127.07/127.24 Improving Solution with cost 37 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001701s 127.07/127.24 Time used: 1.00157 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 2.369573s 127.07/127.24 Cost: 37; Total time: 2.36781 127.07/127.24 Failed at location 3: 1 + i^0 <= Pdolen^0 127.07/127.24 Before Improving: 127.07/127.24 Quasi-invariant at l3: 1 + i^0 <= Pdolen^0 127.07/127.24 Optimizing invariants... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.023820s 127.07/127.24 Remaining time after improvement: 0.981072 127.07/127.24 Minimizing number of undef constraints... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinear - Elapsed time: 0.040320s 127.07/127.24 Number of undef constraints reduced! 127.07/127.24 127.07/127.24 Non-termination implied by a set of quasi-invariant(s): 127.07/127.24 Quasi-invariant at l3: 1 + i^0 <= Pdolen^0 127.07/127.24 127.07/127.24 Strengthening and disabling EXIT transitions... 127.07/127.24 Closed exits from l3: 23 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 127.07/127.24 Checking conditional non-termination of SCC {l3}... 127.07/127.24 EXIT TRANSITIONS: 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.513536s 127.07/127.24 Time used: 0.512388 127.07/127.24 Improving Solution with cost 15 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001620s 127.07/127.24 Time used: 1.00147 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 1.515156s 127.07/127.24 Cost: 15; Total time: 1.51386 127.07/127.24 Failed at location 3: 1 + Pdolen^0 <= 0 127.07/127.24 Before Improving: 127.07/127.24 Quasi-invariant at l3: 1 + Pdolen^0 <= 0 127.07/127.24 Optimizing invariants... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.016966s 127.07/127.24 Remaining time after improvement: 0.988195 127.07/127.24 Minimizing number of undef constraints... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinear - Elapsed time: 0.022817s 127.07/127.24 Number of undef constraints reduced! 127.07/127.24 127.07/127.24 Non-termination implied by a set of quasi-invariant(s): 127.07/127.24 Quasi-invariant at l3: 1 + Pdolen^0 <= 0 127.07/127.24 127.07/127.24 Strengthening and disabling EXIT transitions... 127.07/127.24 Closed exits from l3: 14 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 127.07/127.24 Checking conditional non-termination of SCC {l3}... 127.07/127.24 EXIT TRANSITIONS: 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.111925s 127.07/127.24 Time used: 0.1114 127.07/127.24 Improving Solution with cost 12 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.244686s 127.07/127.24 Time used: 0.240275 127.07/127.24 Improving Solution with cost 10 ... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetNextSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001595s 127.07/127.24 Time used: 1.00145 127.07/127.24 127.07/127.24 LOG: SAT solveNonLinear - Elapsed time: 1.358206s 127.07/127.24 Cost: 10; Total time: 1.35313 127.07/127.24 Failed at location 3: 0 <= 3 + Pdolen^0 + i^0 127.07/127.24 Before Improving: 127.07/127.24 Quasi-invariant at l3: 0 <= 3 + Pdolen^0 + i^0 127.07/127.24 Optimizing invariants... 127.07/127.24 127.07/127.24 LOG: CALL solveLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear - Elapsed time: 0.039921s 127.07/127.24 Remaining time after improvement: 0.994287 127.07/127.24 Minimizing number of undef constraints... 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinear 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinear - Elapsed time: 0.012778s 127.07/127.24 Number of undef constraints reduced! 127.07/127.24 127.07/127.24 Non-termination implied by a set of quasi-invariant(s): 127.07/127.24 Quasi-invariant at l3: 0 <= 3 + Pdolen^0 + i^0 127.07/127.24 127.07/127.24 Strengthening and disabling EXIT transitions... 127.07/127.24 Closed exits from l3: 4 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 Strengthening exit transition (result): 127.07/127.24 127.07/127.24 127.07/127.24 Strengthening and disabling transitions... 127.07/127.24 127.07/127.24 LOG: CALL solverLinear in Graph for feasibility 127.07/127.24 127.07/127.24 LOG: RETURN solveLinear in Graph for feasibility 127.07/127.24 Strengthening transition (result): 127.07/127.24 1 + num^0, rest remain the same}> 127.07/127.24 127.07/127.24 Checking conditional non-termination of SCC {l3}... 127.07/127.24 EXIT TRANSITIONS: 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 127.07/127.24 Solving with 1 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004004s 127.07/127.24 Time used: 5.00326 127.07/127.24 Solving with 2 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.008540s 127.07/127.24 Time used: 5.00195 127.07/127.24 Solving with 3 template(s). 127.07/127.24 127.07/127.24 LOG: CALL solveNonLinearGetFirstSolution 127.07/127.24 127.07/127.24 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.008781s 127.07/127.24 Time used: 5.00176 127.07/127.24 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES 127.07/127.24 Calling reachability with... 127.07/127.24 Transition: 127.07/127.24 Conditions: 1 + i^0 <= Pdolen^0, 50001 <= Pdolen^0 + i^0 + num^0, 50001 + i^0 <= Pdolen^0 + num^0, 50001 <= Pdolen^0 + num^0, 50001 + Pdolen^0 + i^0 <= num^0, 50001 + Pdolen^0 <= num^0, 50001 + 2*Pdolen^0 <= 2*i^0 + num^0, 50001 <= i^0 + num^0, 50001 <= num^0, 50001 + 100004*i^0 <= num^0, 1 + Pdolen^0 <= 0, 0 <= 3 + Pdolen^0 + i^0, 127.07/127.24 OPEN EXITS: 127.07/127.24 (condsUp: 1 + Pdolen^0 <= 0) 127.07/127.24 127.07/127.24 --- Reachability graph --- 127.07/127.24 > Graph without transitions. 127.07/127.24 127.07/127.24 Calling reachability with... 127.07/127.24 Transition: 127.07/127.24 Conditions: 1 + i^0 <= Pdolen^0, 50001 + Pdolen^0 + i^0 <= num^0, 50001 + Pdolen^0 <= num^0, 50001 + 2*Pdolen^0 <= 2*i^0 + num^0, 50001 + i^0 <= Pdolen^0 + num^0, 50001 <= Pdolen^0 + i^0 + num^0, 50001 <= Pdolen^0 + num^0, 50001 <= i^0 + num^0, 50001 + 100004*i^0 <= num^0, 50001 <= num^0, 0 <= 3 + Pdolen^0 + i^0, 1 + Pdolen^0 <= 0, 127.07/127.24 OPEN EXITS: 127.07/127.24 127.07/127.24 127.07/127.24 > Conditions are reachable! 127.07/127.24 127.07/127.24 Program does NOT terminate 127.07/127.24 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 127.07/127.24 /export/starexec/sandbox2/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 127.07/127.24 EOF