127.03/127.30 NO 127.03/127.30 127.03/127.30 Solver Timeout: 4 127.03/127.30 Global Timeout: 300 127.03/127.30 No parsing errors! 127.03/127.30 Init Location: 0 127.03/127.30 Transitions: 127.03/127.30 127.03/127.30 127.03/127.30 (1 + num^0)}> 127.03/127.30 0, i^0 -> (1 + i^0), status^0 -> 1}> 127.03/127.30 0, Pdo^0 -> 0, conditional^0 -> undef37}> 127.03/127.30 1, num^0 -> 0}> 127.03/127.30 127.03/127.30 1, conditional^0 -> undef67}> 127.03/127.30 0}> 127.03/127.30 undef81, PPBlockInits^0 -> 1, status^0 -> 0}> 127.03/127.30 0, PPBlockInits^0 -> 1, PPBunlockInits^0 -> 0, Pdolen^0 -> undef96, i^0 -> undef98, status^0 -> 0}> 127.03/127.30 127.03/127.30 127.03/127.30 Fresh variables: 127.03/127.30 undef37, undef67, undef81, undef96, undef98, 127.03/127.31 127.03/127.31 Undef variables: 127.03/127.31 undef37, undef67, undef81, undef96, undef98, 127.03/127.31 127.03/127.31 Abstraction variables: 127.03/127.31 127.03/127.31 Exit nodes: 127.03/127.31 127.03/127.31 Accepting locations: 127.03/127.31 127.03/127.31 Asserts: 127.03/127.31 127.03/127.31 Preprocessed LLVMGraph 127.03/127.31 Init Location: 0 127.03/127.31 Transitions: 127.03/127.31 127.03/127.31 0}> 127.03/127.31 0}> 127.03/127.31 (1 + i^0)}> 127.03/127.31 0}> 127.03/127.31 (1 + num^0)}> 127.03/127.31 127.03/127.31 Fresh variables: 127.03/127.31 undef37, undef67, undef81, undef96, undef98, 127.03/127.31 127.03/127.31 Undef variables: 127.03/127.31 undef37, undef67, undef81, undef96, undef98, 127.03/127.31 127.03/127.31 Abstraction variables: 127.03/127.31 127.03/127.31 Exit nodes: 127.03/127.31 127.03/127.31 Accepting locations: 127.03/127.31 127.03/127.31 Asserts: 127.03/127.31 127.03/127.31 ************************************************************* 127.03/127.31 ******************************************************************************************* 127.03/127.31 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 127.03/127.31 ******************************************************************************************* 127.03/127.31 127.03/127.31 Init Location: 0 127.03/127.31 Graph 0: 127.03/127.31 Transitions: 127.03/127.31 Variables: 127.03/127.31 127.03/127.31 Graph 1: 127.03/127.31 Transitions: 127.03/127.31 1 + i^0, rest remain the same}> 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 127.03/127.31 Graph 2: 127.03/127.31 Transitions: 127.03/127.31 Variables: 127.03/127.31 127.03/127.31 Precedence: 127.03/127.31 Graph 0 127.03/127.31 127.03/127.31 Graph 1 127.03/127.31 127.03/127.31 127.03/127.31 Graph 2 127.03/127.31 0, rest remain the same}> 127.03/127.31 0, rest remain the same}> 127.03/127.31 0, rest remain the same}> 127.03/127.31 127.03/127.31 Map Locations to Subgraph: 127.03/127.31 ( 0 , 0 ) 127.03/127.31 ( 3 , 1 ) 127.03/127.31 ( 5 , 2 ) 127.03/127.31 127.03/127.31 ******************************************************************************************* 127.03/127.31 ******************************** CHECKING ASSERTIONS ******************************** 127.03/127.31 ******************************************************************************************* 127.03/127.31 127.03/127.31 Proving termination of subgraph 0 127.03/127.31 Proving termination of subgraph 1 127.03/127.31 Checking unfeasibility... 127.03/127.31 Time used: 0.004755 127.03/127.31 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001596s 127.03/127.31 Ranking function: -6 + 6*Pdolen^0 - 6*i^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.000695s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.002796s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007613s 127.03/127.31 Time used: 0.007412 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013018s 127.03/127.31 Time used: 0.012457 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019648s 127.03/127.31 Time used: 0.019642 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.032666s 127.03/127.31 Cost: 1; Total time: 0.032099 127.03/127.31 Failed at location 3: 1 + Pdolen^0 <= i^0 127.03/127.31 Before Improving: 127.03/127.31 Quasi-invariant at l3: 1 + Pdolen^0 <= i^0 127.03/127.31 Optimizing invariants... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.004490s 127.03/127.31 Quasi-invariant improved 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001854s 127.03/127.31 Remaining time after improvement: 0.996082 127.03/127.31 Termination implied by a set of quasi-invariant(s): 127.03/127.31 Quasi-invariant at l3: Pdolen^0 <= i^0 127.03/127.31 [ Invariant Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 It's unfeasible. Removing transition: 127.03/127.31 1 + i^0, rest remain the same}> 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 It's unfeasible. Removing transition: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 [ Termination Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 It's unfeasible. Removing transition: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 New Graphs: 127.03/127.31 Calling Safety with literal Pdolen^0 <= i^0 and entry 127.03/127.31 127.03/127.31 LOG: CALL check - Post:Pdolen^0 <= i^0 - Process 1 127.03/127.31 * Exit transition: 127.03/127.31 * Postcondition : Pdolen^0 <= i^0 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.000568s 127.03/127.31 > Postcondition is not implied! 127.03/127.31 127.03/127.31 LOG: RETURN check - Elapsed time: 0.000661s 127.03/127.31 INVARIANTS: 127.03/127.31 3: 127.03/127.31 Quasi-INVARIANTS to narrow Graph: 127.03/127.31 3: Pdolen^0 <= i^0 , 127.03/127.31 Narrowing transition: 127.03/127.31 1 + i^0, rest remain the same}> 127.03/127.31 127.03/127.31 LOG: Narrow transition size 1 127.03/127.31 Narrowing transition: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 127.03/127.31 LOG: Narrow transition size 1 127.03/127.31 invGraph after Narrowing: 127.03/127.31 Transitions: 127.03/127.31 1 + i^0, rest remain the same}> 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001554s 127.03/127.31 Ranking function: -6 + 6*Pdolen^0 - 6*i^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.000693s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.002812s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006975s 127.03/127.31 Time used: 0.006827 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002635s 127.03/127.31 Time used: 4.00191 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007153s 127.03/127.31 Time used: 4.00085 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004224s 127.03/127.31 Time used: 1.00005 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019645s 127.03/127.31 Time used: 0.0122 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017769s 127.03/127.31 Time used: 0.017762 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.037414s 127.03/127.31 Cost: 1; Total time: 0.029962 127.03/127.31 Termination implied by a set of invariant(s): 127.03/127.31 Invariant at l3: i^0 <= 1 + Pdolen^0 127.03/127.31 [ Invariant Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + i^0, rest remain the same}> 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 [ Termination Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Quasi-ranking function: 50000 - num^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.000829s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.003396s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009004s 127.03/127.31 Time used: 0.008833 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001789s 127.03/127.31 Time used: 4.00098 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006564s 127.03/127.31 Time used: 4.00072 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012145s 127.03/127.31 Time used: 1.00016 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022132s 127.03/127.31 Time used: 0.014483 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.023891s 127.03/127.31 Time used: 0.023884 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.046023s 127.03/127.31 Cost: 1; Total time: 0.038367 127.03/127.31 Termination implied by a set of invariant(s): 127.03/127.31 Invariant at l3: i^0 <= Pdolen^0 127.03/127.31 [ Invariant Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + i^0, rest remain the same}> 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 [ Termination Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Quasi-ranking function: 50000 + 2*Pdolen^0 - 2*i^0 - num^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.000984s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.004434s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009944s 127.03/127.31 Time used: 0.0096 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001601s 127.03/127.31 Time used: 4.00104 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015172s 127.03/127.31 Time used: 4.00061 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004982s 127.03/127.31 Time used: 1.00009 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022108s 127.03/127.31 Time used: 0.014687 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014420s 127.03/127.31 Time used: 0.014414 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.036528s 127.03/127.31 Cost: 1; Total time: 0.029101 127.03/127.31 Termination implied by a set of invariant(s): 127.03/127.31 Invariant at l3: i^0 <= Pdolen^0 127.03/127.31 [ Invariant Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + i^0, rest remain the same}> 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 [ Termination Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Quasi-ranking function: 50000 - Pdolen^0 + i^0 - num^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001048s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.004457s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009572s 127.03/127.31 Time used: 0.009378 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002552s 127.03/127.31 Time used: 4.002 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006309s 127.03/127.31 Time used: 4.00083 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013333s 127.03/127.31 Time used: 1.00006 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023613s 127.03/127.31 Time used: 0.015937 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019479s 127.03/127.31 Time used: 0.019473 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.043092s 127.03/127.31 Cost: 1; Total time: 0.03541 127.03/127.31 Quasi-ranking function: 50000 + Pdolen^0 + i^0 - num^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001185s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.005247s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011978s 127.03/127.31 Time used: 0.011781 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003043s 127.03/127.31 Time used: 4.00249 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.019486s 127.03/127.31 Time used: 4.01334 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005178s 127.03/127.31 Time used: 1.00008 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023809s 127.03/127.31 Time used: 0.016104 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.019919s 127.03/127.31 Time used: 0.019906 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.043728s 127.03/127.31 Cost: 1; Total time: 0.03601 127.03/127.31 Quasi-ranking function: 50000 - Pdolen^0 - i^0 - num^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001272s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.006631s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011457s 127.03/127.31 Time used: 0.011233 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004963s 127.03/127.31 Time used: 4.00203 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006940s 127.03/127.31 Time used: 4.00122 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005241s 127.03/127.31 Time used: 1.00005 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023830s 127.03/127.31 Time used: 0.016212 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018791s 127.03/127.31 Time used: 0.018784 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.042621s 127.03/127.31 Cost: 1; Total time: 0.034996 127.03/127.31 Quasi-ranking function: 50000 - i^0 - num^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001386s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.007041s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013026s 127.03/127.31 Time used: 0.012797 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010127s 127.03/127.31 Time used: 4.00143 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.014290s 127.03/127.31 Time used: 4.00945 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005036s 127.03/127.31 Time used: 1.00004 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024626s 127.03/127.31 Time used: 0.016998 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018585s 127.03/127.31 Time used: 0.018578 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.043211s 127.03/127.31 Cost: 1; Total time: 0.035576 127.03/127.31 Quasi-ranking function: 50000 + 100004*i^0 - num^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001487s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.007941s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012521s 127.03/127.31 Time used: 0.012294 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.009659s 127.03/127.31 Time used: 4.00676 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006691s 127.03/127.31 Time used: 4.00105 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005068s 127.03/127.31 Time used: 1.00014 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026077s 127.03/127.31 Time used: 0.018474 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018040s 127.03/127.31 Time used: 0.018034 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.044117s 127.03/127.31 Cost: 1; Total time: 0.036508 127.03/127.31 Termination implied by a set of invariant(s): 127.03/127.31 Invariant at l3: i^0 <= Pdolen^0 127.03/127.31 [ Invariant Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + i^0, rest remain the same}> 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 [ Termination Graph ] 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Quasi-ranking function: 50000 + Pdolen^0 - num^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001582s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.009710s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014360s 127.03/127.31 Time used: 0.013899 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002879s 127.03/127.31 Time used: 4.00222 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006784s 127.03/127.31 Time used: 4.00108 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004486s 127.03/127.31 Time used: 1.00019 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026485s 127.03/127.31 Time used: 0.018873 127.03/127.31 Improving Solution with cost 1 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020065s 127.03/127.31 Time used: 0.02006 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 0.046550s 127.03/127.31 Cost: 1; Total time: 0.038933 127.03/127.31 Quasi-ranking function: 50000 - Pdolen^0 - num^0 127.03/127.31 New Graphs: 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 Checking conditional termination of SCC {l3}... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.001667s 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.011101s 127.03/127.31 Trying to remove transition: 1 + num^0, rest remain the same}> 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013676s 127.03/127.31 Time used: 0.013276 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002741s 127.03/127.31 Time used: 4.00214 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006451s 127.03/127.31 Time used: 4.0011 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004327s 127.03/127.31 Time used: 1.00024 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024885s 127.03/127.31 Time used: 0.017823 127.03/127.31 127.03/127.31 Proving non-termination of subgraph 1 127.03/127.31 Transitions: 127.03/127.31 1 + i^0, rest remain the same}> 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 127.03/127.31 Checking conditional non-termination of SCC {l3}... 127.03/127.31 EXIT TRANSITIONS: 127.03/127.31 127.03/127.31 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002197s 127.03/127.31 Time used: 5.00201 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005578s 127.03/127.31 Time used: 5.00146 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.016071s 127.03/127.31 Time used: 5.00061 127.03/127.31 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO 127.03/127.31 127.03/127.31 Proving non-termination of subgraph 1 127.03/127.31 Transitions: 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 Variables: 127.03/127.31 Pdolen^0, i^0, num^0 127.03/127.31 127.03/127.31 Checking conditional non-termination of SCC {l3}... 127.03/127.31 EXIT TRANSITIONS: 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.377317s 127.03/127.31 Time used: 1.37583 127.03/127.31 Improving Solution with cost 37 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001503s 127.03/127.31 Time used: 1.00147 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 2.378820s 127.03/127.31 Cost: 37; Total time: 2.37731 127.03/127.31 Failed at location 3: 1 + i^0 <= Pdolen^0 127.03/127.31 Before Improving: 127.03/127.31 Quasi-invariant at l3: 1 + i^0 <= Pdolen^0 127.03/127.31 Optimizing invariants... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.023778s 127.03/127.31 Remaining time after improvement: 0.98109 127.03/127.31 Minimizing number of undef constraints... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinear - Elapsed time: 0.040849s 127.03/127.31 Number of undef constraints reduced! 127.03/127.31 127.03/127.31 Non-termination implied by a set of quasi-invariant(s): 127.03/127.31 Quasi-invariant at l3: 1 + i^0 <= Pdolen^0 127.03/127.31 127.03/127.31 Strengthening and disabling EXIT transitions... 127.03/127.31 Closed exits from l3: 23 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 127.03/127.31 Checking conditional non-termination of SCC {l3}... 127.03/127.31 EXIT TRANSITIONS: 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.514847s 127.03/127.31 Time used: 0.513756 127.03/127.31 Improving Solution with cost 15 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001235s 127.03/127.31 Time used: 1.00121 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 1.516083s 127.03/127.31 Cost: 15; Total time: 1.51497 127.03/127.31 Failed at location 3: 1 + Pdolen^0 <= 0 127.03/127.31 Before Improving: 127.03/127.31 Quasi-invariant at l3: 1 + Pdolen^0 <= 0 127.03/127.31 Optimizing invariants... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.017034s 127.03/127.31 Remaining time after improvement: 0.988252 127.03/127.31 Minimizing number of undef constraints... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinear - Elapsed time: 0.022882s 127.03/127.31 Number of undef constraints reduced! 127.03/127.31 127.03/127.31 Non-termination implied by a set of quasi-invariant(s): 127.03/127.31 Quasi-invariant at l3: 1 + Pdolen^0 <= 0 127.03/127.31 127.03/127.31 Strengthening and disabling EXIT transitions... 127.03/127.31 Closed exits from l3: 14 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 127.03/127.31 Checking conditional non-termination of SCC {l3}... 127.03/127.31 EXIT TRANSITIONS: 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.111634s 127.03/127.31 Time used: 0.111113 127.03/127.31 Improving Solution with cost 12 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.242388s 127.03/127.31 Time used: 0.242371 127.03/127.31 Improving Solution with cost 10 ... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetNextSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001566s 127.03/127.31 Time used: 1.00155 127.03/127.31 127.03/127.31 LOG: SAT solveNonLinear - Elapsed time: 1.355589s 127.03/127.31 Cost: 10; Total time: 1.35503 127.03/127.31 Failed at location 3: 0 <= 3 + Pdolen^0 + i^0 127.03/127.31 Before Improving: 127.03/127.31 Quasi-invariant at l3: 0 <= 3 + Pdolen^0 + i^0 127.03/127.31 Optimizing invariants... 127.03/127.31 127.03/127.31 LOG: CALL solveLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear - Elapsed time: 0.041210s 127.03/127.31 Remaining time after improvement: 0.994306 127.03/127.31 Minimizing number of undef constraints... 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinear 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinear - Elapsed time: 0.012763s 127.03/127.31 Number of undef constraints reduced! 127.03/127.31 127.03/127.31 Non-termination implied by a set of quasi-invariant(s): 127.03/127.31 Quasi-invariant at l3: 0 <= 3 + Pdolen^0 + i^0 127.03/127.31 127.03/127.31 Strengthening and disabling EXIT transitions... 127.03/127.31 Closed exits from l3: 4 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 Strengthening exit transition (result): 127.03/127.31 127.03/127.31 127.03/127.31 Strengthening and disabling transitions... 127.03/127.31 127.03/127.31 LOG: CALL solverLinear in Graph for feasibility 127.03/127.31 127.03/127.31 LOG: RETURN solveLinear in Graph for feasibility 127.03/127.31 Strengthening transition (result): 127.03/127.31 1 + num^0, rest remain the same}> 127.03/127.31 127.03/127.31 Checking conditional non-termination of SCC {l3}... 127.03/127.31 EXIT TRANSITIONS: 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 127.03/127.31 Solving with 1 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.014871s 127.03/127.31 Time used: 5.00504 127.03/127.31 Solving with 2 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.007543s 127.03/127.31 Time used: 5.00242 127.03/127.31 Solving with 3 template(s). 127.03/127.31 127.03/127.31 LOG: CALL solveNonLinearGetFirstSolution 127.03/127.31 127.03/127.31 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.016052s 127.03/127.31 Time used: 5.00173 127.03/127.31 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES 127.03/127.31 Calling reachability with... 127.03/127.31 Transition: 127.03/127.31 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.03/127.31 OPEN EXITS: 127.03/127.31 (condsUp: 1 + Pdolen^0 <= 0) 127.03/127.31 127.03/127.31 --- Reachability graph --- 127.03/127.31 > Graph without transitions. 127.03/127.31 127.03/127.31 Calling reachability with... 127.03/127.31 Transition: 127.03/127.31 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.03/127.31 OPEN EXITS: 127.03/127.31 127.03/127.31 127.03/127.31 > Conditions are reachable! 127.03/127.31 127.03/127.31 Program does NOT terminate 127.03/127.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 127.03/127.31 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 127.03/127.31 EOF