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.001885 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000652s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002153s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004768s Time used: 0.004622 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006978s Time used: 0.00662 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013847s Time used: 0.013843 LOG: SAT solveNonLinear - Elapsed time: 0.020825s Cost: 1; Total time: 0.020463 Failed at location 1: 1 + __const_1000^0 + x^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + __const_1000^0 + x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001864s Remaining time after improvement: 0.999141 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + __const_1000^0 + x^0 <= 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 + __const_1000^0 + x^0 <= 0 and entry LOG: CALL check - Post:1 + __const_1000^0 + x^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + __const_1000^0 + x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000329s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000398s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_1000^0 + x^0 <= 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.000713s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002392s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004198s Time used: 0.004036 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008381s Time used: 0.007986 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012261s Time used: 0.012258 LOG: SAT solveNonLinear - Elapsed time: 0.020643s Cost: 1; Total time: 0.020244 Failed at location 1: __const_1000^0 + x^0 <= 0 Before Improving: Quasi-invariant at l1: __const_1000^0 + x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001963s Remaining time after improvement: 0.999 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_1000^0 + x^0 <= 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 __const_1000^0 + x^0 <= 0 and entry LOG: CALL check - Post:__const_1000^0 + x^0 <= 0 - Process 2 * Exit transition: * Postcondition : __const_1000^0 + x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000379s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000454s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_1000^0 + x^0 <= 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.000593s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002196s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004479s Time used: 0.004316 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008369s Time used: 0.007953 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010482s Time used: 0.010479 LOG: SAT solveNonLinear - Elapsed time: 0.018851s Cost: 1; Total time: 0.018432 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.002057s Remaining time after improvement: 0.998914 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + __const_1000^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): 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 <= 0 and entry LOG: CALL check - Post:1 + __const_1000^0 <= 0 - Process 3 * Exit transition: * Postcondition : 1 + __const_1000^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000346s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000416s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_1000^0 <= 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.000657s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002344s Trying to remove transition: undef2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004625s Time used: 0.00446 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008522s Time used: 0.008213 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000879s Time used: 4.00068 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003746s Time used: 1.00038 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009324s Time used: 0.006176 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.001119s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018079s Time used: 0.017826 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.046028s Time used: 0.046025 LOG: SAT solveNonLinear - Elapsed time: 0.064108s Cost: 2; Total time: 0.063851 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.007949s Remaining time after improvement: 0.998241 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003229s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= __const_1000^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.015099s Time used: 0.014854 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021663s Time used: 0.021658 LOG: SAT solveNonLinear - Elapsed time: 0.036762s Cost: 1; Total time: 0.036512 Failed at location 1: 1 <= x^0 Before Improving: Quasi-invariant at l1: 1 <= x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007503s Remaining time after improvement: 0.998238 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003030s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= 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, 1 <= x^0, OPEN EXITS: (condsUp: 1 <= __const_1000^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= x^0, 1 <= __const_1000^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate