NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef2}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef2}> Fresh variables: undef2, Undef variables: undef2, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef2, rest remain the same}> Variables: __const_1000^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.001879 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000734s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002245s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004749s Time used: 0.004591 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007178s Time used: 0.006829 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013759s Time used: 0.013754 LOG: SAT solveNonLinear - Elapsed time: 0.020937s Cost: 1; Total time: 0.020583 Failed at location 1: 1 + x^0 <= __const_1000^0 Before Improving: Quasi-invariant at l1: 1 + x^0 <= __const_1000^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001862s Remaining time after improvement: 0.999095 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + x^0 <= __const_1000^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: undef2, 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: undef2, rest remain the same}> New Graphs: Calling Safety with literal 1 + x^0 <= __const_1000^0 and entry LOG: CALL check - Post:1 + x^0 <= __const_1000^0 - Process 1 * Exit transition: * Postcondition : 1 + x^0 <= __const_1000^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000350s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000420s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + x^0 <= __const_1000^0 , Narrowing transition: undef2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, rest remain the same}> Variables: __const_1000^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000627s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002306s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004176s Time used: 0.00402 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007109s Time used: 0.006759 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012221s Time used: 0.012217 LOG: SAT solveNonLinear - Elapsed time: 0.019330s Cost: 1; Total time: 0.018976 Failed at location 1: x^0 <= __const_1000^0 Before Improving: Quasi-invariant at l1: x^0 <= __const_1000^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001972s Remaining time after improvement: 0.998967 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 <= __const_1000^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: undef2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef2, rest remain the same}> New Graphs: Calling Safety with literal x^0 <= __const_1000^0 and entry LOG: CALL check - Post:x^0 <= __const_1000^0 - Process 2 * Exit transition: * Postcondition : x^0 <= __const_1000^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000432s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000509s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= __const_1000^0 , Narrowing transition: undef2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, rest remain the same}> Variables: __const_1000^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000605s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002207s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004457s Time used: 0.004299 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008224s Time used: 0.007814 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009576s Time used: 0.009572 LOG: SAT solveNonLinear - Elapsed time: 0.017800s Cost: 1; Total time: 0.017386 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.001992s Remaining time after improvement: 0.998931 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): undef2, 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): undef2, rest remain the same}> Ranking function: -__const_1000^0 + x^0 New Graphs: Calling Safety with literal 1 <= __const_1000^0 and entry LOG: CALL check - Post:1 <= __const_1000^0 - Process 3 * Exit transition: * Postcondition : 1 <= __const_1000^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000386s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000456s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= __const_1000^0 , Narrowing transition: undef2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef2, rest remain the same}> Variables: __const_1000^0, x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000663s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002333s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004601s Time used: 0.00444 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008393s Time used: 0.008092 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000876s Time used: 4.00047 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003575s Time used: 1.00051 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009233s Time used: 0.006133 Proving non-termination of subgraph 1 Transitions: undef2, rest remain the same}> Variables: __const_1000^0, x^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001127s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020919s Time used: 0.020644 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045155s Time used: 0.04515 LOG: SAT solveNonLinear - Elapsed time: 0.066074s Cost: 2; Total time: 0.065794 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.007981s Remaining time after improvement: 0.998185 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003263s 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): undef2, 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.013267s Time used: 0.013006 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021987s Time used: 0.021981 LOG: SAT solveNonLinear - Elapsed time: 0.035254s Cost: 1; Total time: 0.034987 Failed at location 1: 0 <= x^0 Before Improving: Quasi-invariant at l1: 0 <= x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007533s Remaining time after improvement: 0.998162 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003023s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 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): undef2, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + __const_1000^0 <= 0, 0 <= x^0, OPEN EXITS: (condsUp: 1 + __const_1000^0 <= 0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 0 <= x^0, 1 + __const_1000^0 <= 0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate