NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef3}> undef8, i_13^0 -> undef9}> (0 + st_14^0)}> undef22, i_20^0 -> undef23}> Fresh variables: undef3, undef8, undef9, undef13, undef22, undef23, Undef variables: undef3, undef8, undef9, undef13, undef22, undef23, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef22}> Fresh variables: undef3, undef8, undef9, undef13, undef22, undef23, Undef variables: undef3, undef8, undef9, undef13, undef22, undef23, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002246 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000756s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003135s Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006374s Time used: 0.006167 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008711s Time used: 0.008247 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000363s Time used: 1.00036 LOG: SAT solveNonLinear - Elapsed time: 1.009074s Cost: 1; Total time: 1.0086 Failed at location 2: __const_10^0 <= i_13^0 Before Improving: Quasi-invariant at l2: __const_10^0 <= i_13^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005920s Remaining time after improvement: 0.998466 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: __const_10^0 <= i_13^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: undef22, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef22, rest remain the same}> New Graphs: Calling Safety with literal __const_10^0 <= i_13^0 and entry LOG: CALL check - Post:__const_10^0 <= i_13^0 - Process 1 * Exit transition: * Postcondition : __const_10^0 <= i_13^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000523s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000616s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: __const_10^0 <= i_13^0 , Narrowing transition: undef22, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000708s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002942s Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005900s Time used: 0.005717 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002306s Time used: 4.00194 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007210s Time used: 4.00104 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006246s Time used: 1.00055 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013213s Time used: 0.009607 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001747s Time used: 1.00179 LOG: SAT solveNonLinear - Elapsed time: 1.014960s Cost: 1; Total time: 1.0114 Termination implied by a set of invariant(s): Invariant at l2: i_13^0 <= 1 + __const_10^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, 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): undef22, rest remain the same}> Quasi-ranking function: 50000 - 2*__const_10^0 + i_13^0 New Graphs: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000859s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003901s Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007604s Time used: 0.007404 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001930s Time used: 4.00131 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006026s Time used: 4.00118 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006279s Time used: 1.00066 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014157s Time used: 0.010424 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001225s Time used: 1.00109 LOG: SAT solveNonLinear - Elapsed time: 1.015382s Cost: 1; Total time: 1.01152 Termination implied by a set of invariant(s): Invariant at l2: i_13^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, 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): undef22, rest remain the same}> Quasi-ranking function: 50000 + i_13^0 New Graphs: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000952s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003943s Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006983s Time used: 0.006777 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002047s Time used: 4.00141 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006903s Time used: 4.00132 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.761183s Time used: 0.75582 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015408s Time used: 0.011291 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.985341s Time used: 0.985382 LOG: SAT solveNonLinear - Elapsed time: 1.000750s Cost: 1; Total time: 0.996673 Termination implied by a set of invariant(s): Invariant at l2: i_13^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, 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): undef22, rest remain the same}> Quasi-ranking function: 50000 + __const_10^0 + i_13^0 New Graphs: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001069s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005197s Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008162s Time used: 0.007943 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.963268s Time used: 0.962771 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.989375s Time used: 0.986094 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.997174s Time used: 0.993651 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.999429s Time used: 0.99502 Proving non-termination of subgraph 1 Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001767s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025841s Time used: 0.025478 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031356s Time used: 0.031351 LOG: SAT solveNonLinear - Elapsed time: 0.057198s Cost: 1; Total time: 0.056829 Failed at location 2: 1 + i_13^0 <= __const_10^0 Before Improving: Quasi-invariant at l2: 1 + i_13^0 <= __const_10^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011527s Remaining time after improvement: 0.997858 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.004283s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + i_13^0 <= __const_10^0 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + i_13^0 <= __const_10^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + i_13^0 <= __const_10^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate