NO Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: (1 + num^0)}> 0, status^0 -> 1}> 0, Pdo^0 -> 0, conditional^0 -> undef37}> 1, num^0 -> 0}> 1, conditional^0 -> undef77}> (~(1) + i^0)}> (1 + i^0)}> 0}> undef111, PPBlockInits^0 -> 1, status^0 -> 0}> 0, PPBlockInits^0 -> 1, PPBunlockInits^0 -> 0, Pdolen^0 -> undef126, i^0 -> undef128, status^0 -> 0}> Fresh variables: undef37, undef77, undef111, undef126, undef128, Undef variables: undef37, undef77, undef111, undef126, undef128, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0}> (~(1) + i^0)}> (1 + i^0)}> (1 + num^0)}> Fresh variables: undef37, undef77, undef111, undef126, undef128, Undef variables: undef37, undef77, undef111, undef126, undef128, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Graph 2: Transitions: 0, rest remain the same}> Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004845 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001156s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006168s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007336s Time used: 0.007162 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005742s Time used: 0.005192 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004538s Time used: 0.004127 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014675s Time used: 0.01421 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.038426s Time used: 0.038424 LOG: SAT solveNonLinear - Elapsed time: 0.053101s Cost: 1; Total time: 0.052634 Failed at location 3: 1 + Pdolen^0 <= i^0 Before Improving: Quasi-invariant at l3: 1 + Pdolen^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005330s Remaining time after improvement: 0.998521 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + Pdolen^0 <= i^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + num^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + num^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + i^0, rest remain the same}> New Graphs: Calling Safety with literal 1 + Pdolen^0 <= i^0 and entry LOG: CALL check - Post:1 + Pdolen^0 <= i^0 - Process 1 * Exit transition: * Postcondition : 1 + Pdolen^0 <= i^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000388s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000425s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + Pdolen^0 <= i^0 , Narrowing transition: -1 + i^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + i^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + num^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000738s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005465s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006220s Time used: 0.005901 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005776s Time used: 0.005196 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004592s Time used: 0.00413 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015616s Time used: 0.015101 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026415s Time used: 0.026414 LOG: SAT solveNonLinear - Elapsed time: 0.042031s Cost: 1; Total time: 0.041515 Failed at location 3: Pdolen^0 <= i^0 Before Improving: Quasi-invariant at l3: Pdolen^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005586s Remaining time after improvement: 0.998297 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: Pdolen^0 <= i^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + num^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + num^0, rest remain the same}> New Graphs: Calling Safety with literal Pdolen^0 <= i^0 and entry LOG: CALL check - Post:Pdolen^0 <= i^0 - Process 2 * Exit transition: * Postcondition : Pdolen^0 <= i^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000426s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000468s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: Pdolen^0 <= i^0 , Narrowing transition: -1 + i^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + i^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + num^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000754s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005453s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006270s Time used: 0.005932 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005824s Time used: 0.005198 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004620s Time used: 0.004147 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001936s Time used: 4.00138 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005440s Time used: 4.00063 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005519s Time used: 1.00009 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037084s Time used: 0.015693 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029623s Time used: 0.029621 LOG: SAT solveNonLinear - Elapsed time: 0.066707s Cost: 1; Total time: 0.045314 Termination implied by a set of invariant(s): Invariant at l3: i^0 <= 1 + Pdolen^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + num^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + num^0, rest remain the same}> Quasi-ranking function: 50000 - num^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000878s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006722s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008471s Time used: 0.007998 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007119s Time used: 0.006331 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005842s Time used: 0.005244 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002409s Time used: 4.00178 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005807s Time used: 4.00066 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005640s Time used: 1.00002 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028045s Time used: 0.0163 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027750s Time used: 0.027748 LOG: SAT solveNonLinear - Elapsed time: 0.055795s Cost: 1; Total time: 0.044048 Quasi-ranking function: 50000 + Pdolen^0 - num^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000993s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007560s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007818s Time used: 0.007406 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007333s Time used: 0.006552 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006197s Time used: 0.005586 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004405s Time used: 4.00373 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004851s Time used: 4.00216 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.011912s Time used: 1.0001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028588s Time used: 0.016423 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032217s Time used: 0.032215 LOG: SAT solveNonLinear - Elapsed time: 0.060805s Cost: 1; Total time: 0.048638 Quasi-ranking function: 50000 - Pdolen^0 - num^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001056s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007775s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009667s Time used: 0.00922 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008013s Time used: 0.007207 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006908s Time used: 0.006421 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.620231s Time used: 4.6197 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006692s Time used: 4.0012 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005856s Time used: 1.00015 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031027s Time used: 0.018608 Proving non-termination of subgraph 1 Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.002427s Time used: 5.00225 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005492s Time used: 5.00157 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.010199s Time used: 5.00155 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO Proving non-termination of subgraph 1 Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038237s Time used: 0.037976 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.136128s Time used: 0.136119 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.034105s Time used: 0.034103 LOG: SAT solveNonLinear - Elapsed time: 0.208469s Cost: 1; Total time: 0.208198 Failed at location 3: 1 + i^0 <= Pdolen^0 Before Improving: Quasi-invariant at l3: 1 + i^0 <= Pdolen^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005711s Remaining time after improvement: 0.99725 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.005178s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + i^0 <= Pdolen^0 Constraint over undef '6 <= undef77' in transition: 1 + i^0, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l3: 4 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + num^0, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + i^0 <= Pdolen^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + i^0 <= Pdolen^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate