NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef3}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef3}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef3, rest remain the same}> Variables: __const_1000^0, __const_200^0, x^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00234 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000873s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002537s Trying to remove transition: undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006874s Time used: 0.006703 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009181s Time used: 0.008671 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015412s Time used: 0.015404 LOG: SAT solveNonLinear - Elapsed time: 0.024592s Cost: 1; Total time: 0.024075 Failed at location 1: 1 <= __const_1000^0 Before Improving: Quasi-invariant at l1: 1 <= __const_1000^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002832s Remaining time after improvement: 0.998446 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= __const_1000^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef3, 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): undef3, rest remain the same}> Ranking function: -__const_1000^0 - __const_200^0 + x^0 New Graphs: Calling Safety with literal 1 <= __const_1000^0 and entry LOG: CALL check - Post:1 <= __const_1000^0 - Process 1 * Exit transition: * Postcondition : 1 <= __const_1000^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000296s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000373s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= __const_1000^0 , Narrowing transition: undef3, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef3, rest remain the same}> Variables: __const_1000^0, __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000655s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002430s Trying to remove transition: undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006276s Time used: 0.006108 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012330s Time used: 0.011793 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013275s Time used: 0.01326 LOG: SAT solveNonLinear - Elapsed time: 0.025605s Cost: 1; Total time: 0.025053 Failed at location 1: x^0 <= __const_1000^0 + __const_200^0 Before Improving: Quasi-invariant at l1: x^0 <= __const_1000^0 + __const_200^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002379s Remaining time after improvement: 0.998815 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 <= __const_1000^0 + __const_200^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: undef3, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef3, rest remain the same}> New Graphs: Calling Safety with literal x^0 <= __const_1000^0 + __const_200^0 and entry LOG: CALL check - Post:x^0 <= __const_1000^0 + __const_200^0 - Process 2 * Exit transition: * Postcondition : x^0 <= __const_1000^0 + __const_200^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000488s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000573s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= __const_1000^0 + __const_200^0 , Narrowing transition: undef3, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef3, rest remain the same}> Variables: __const_1000^0, __const_200^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000724s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002779s Trying to remove transition: undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005885s Time used: 0.005707 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011843s Time used: 0.011402 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001326s Time used: 4.00037 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002972s Time used: 1.00017 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014873s Time used: 0.008121 Proving non-termination of subgraph 1 Transitions: undef3, rest remain the same}> Variables: __const_1000^0, __const_200^0, x^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001312s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022553s Time used: 0.022245 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.066851s Time used: 0.066837 LOG: SAT solveNonLinear - Elapsed time: 0.089404s Cost: 2; Total time: 0.089082 Failed at location 1: 1 + __const_1000^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + __const_1000^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009881s Remaining time after improvement: 0.998032 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003503s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + __const_1000^0 <= 0 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef3, rest remain the same}> Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016846s Time used: 0.016563 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.028015s Time used: 0.028005 LOG: SAT solveNonLinear - Elapsed time: 0.044861s Cost: 1; Total time: 0.044568 Failed at location 1: __const_200^0 <= 1 + __const_1000^0 + x^0 Before Improving: Quasi-invariant at l1: __const_200^0 <= 1 + __const_1000^0 + x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009673s Remaining time after improvement: 0.997938 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003387s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_200^0 <= 1 + __const_1000^0 + x^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef3, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + __const_1000^0 <= 0, __const_200^0 <= 1 + __const_1000^0 + x^0, OPEN EXITS: (condsUp: 1 + __const_1000^0 <= 0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: __const_200^0 <= 1 + __const_1000^0 + x^0, 1 + __const_1000^0 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate