NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef1, l_11^0 -> (0 + x_12^0), len_98^0 -> undef3}> Fresh variables: undef1, undef3, undef5, Undef variables: undef1, undef3, undef5, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + x_12^0), len_98^0 -> undef3}> Fresh variables: undef1, undef3, undef5, Undef variables: undef1, undef3, undef5, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: x_12^0, len_98^0 -> undef3, rest remain the same}> Variables: l_11^0, len_98^0, x_12^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.00236 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000714s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002637s Trying to remove transition: x_12^0, len_98^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006695s Time used: 0.006496 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008501s Time used: 0.00796 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015389s Time used: 0.015384 LOG: SAT solveNonLinear - Elapsed time: 0.023890s Cost: 1; Total time: 0.023344 Failed at location 1: 1 + len_98^0 <= l_11^0 Before Improving: Quasi-invariant at l1: 1 + len_98^0 <= l_11^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002556s Remaining time after improvement: 0.998765 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + len_98^0 <= l_11^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: x_12^0, len_98^0 -> 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 It's unfeasible. Removing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> New Graphs: Calling Safety with literal 1 + len_98^0 <= l_11^0 and entry LOG: CALL check - Post:1 + len_98^0 <= l_11^0 - Process 1 * Exit transition: * Postcondition : 1 + len_98^0 <= l_11^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000406s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000479s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + len_98^0 <= l_11^0 , Narrowing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x_12^0, len_98^0 -> undef3, rest remain the same}> Variables: l_11^0, len_98^0, x_12^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000741s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002705s Trying to remove transition: x_12^0, len_98^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006052s Time used: 0.005879 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008317s Time used: 0.00776 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012126s Time used: 0.012122 LOG: SAT solveNonLinear - Elapsed time: 0.020443s Cost: 1; Total time: 0.019882 Failed at location 1: 1 + l_11^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + l_11^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002564s Remaining time after improvement: 0.998636 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + l_11^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: x_12^0, len_98^0 -> 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 It's unfeasible. Removing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> New Graphs: Calling Safety with literal 1 + l_11^0 <= 0 and entry LOG: CALL check - Post:1 + l_11^0 <= 0 - Process 2 * Exit transition: * Postcondition : 1 + l_11^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000471s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000542s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + l_11^0 <= 0 , Narrowing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x_12^0, len_98^0 -> undef3, rest remain the same}> Variables: l_11^0, len_98^0, x_12^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000802s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002943s Trying to remove transition: x_12^0, len_98^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006530s Time used: 0.006351 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009069s Time used: 0.008489 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010532s Time used: 0.010528 LOG: SAT solveNonLinear - Elapsed time: 0.019601s Cost: 1; Total time: 0.019017 Failed at location 1: 1 <= l_11^0 Before Improving: Quasi-invariant at l1: 1 <= l_11^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002709s Remaining time after improvement: 0.998491 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= l_11^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: x_12^0, len_98^0 -> undef3, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> New Graphs: Calling Safety with literal 1 <= l_11^0 and entry LOG: CALL check - Post:1 <= l_11^0 - Process 3 * Exit transition: * Postcondition : 1 <= l_11^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000550s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000631s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= l_11^0 , Narrowing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x_12^0, len_98^0 -> undef3, rest remain the same}> Variables: l_11^0, len_98^0, x_12^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000774s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002803s Trying to remove transition: x_12^0, len_98^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006218s Time used: 0.006037 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009185s Time used: 0.00859 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011562s Time used: 0.011558 LOG: SAT solveNonLinear - Elapsed time: 0.020746s Cost: 1; Total time: 0.020148 Failed at location 1: l_11^0 + len_98^0 <= 0 Before Improving: Quasi-invariant at l1: l_11^0 + len_98^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002691s Remaining time after improvement: 0.998511 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: l_11^0 + len_98^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: x_12^0, len_98^0 -> 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 It's unfeasible. Removing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> New Graphs: Calling Safety with literal l_11^0 + len_98^0 <= 0 and entry LOG: CALL check - Post:l_11^0 + len_98^0 <= 0 - Process 4 * Exit transition: * Postcondition : l_11^0 + len_98^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000574s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000661s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: l_11^0 + len_98^0 <= 0 , Narrowing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x_12^0, len_98^0 -> undef3, rest remain the same}> Variables: l_11^0, len_98^0, x_12^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000854s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003155s Trying to remove transition: x_12^0, len_98^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006712s Time used: 0.006524 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011623s Time used: 0.01098 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011366s Time used: 0.011362 LOG: SAT solveNonLinear - Elapsed time: 0.022989s Cost: 1; Total time: 0.022342 Failed at location 1: 1 + x_12^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + x_12^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002943s Remaining time after improvement: 0.998353 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + x_12^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): x_12^0, len_98^0 -> 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): x_12^0, len_98^0 -> undef3, rest remain the same}> Ranking function: l_11^0 New Graphs: Calling Safety with literal 1 + x_12^0 <= 0 and entry LOG: CALL check - Post:1 + x_12^0 <= 0 - Process 5 * Exit transition: * Postcondition : 1 + x_12^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000495s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000584s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + x_12^0 <= 0 , Narrowing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x_12^0, len_98^0 -> undef3, rest remain the same}> Variables: l_11^0, len_98^0, x_12^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000929s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003510s Trying to remove transition: x_12^0, len_98^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006694s Time used: 0.00649 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010787s Time used: 0.010127 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010946s Time used: 0.010941 LOG: SAT solveNonLinear - Elapsed time: 0.021732s Cost: 1; Total time: 0.021068 Failed at location 1: 1 <= l_11^0 + x_12^0 Before Improving: Quasi-invariant at l1: 1 <= l_11^0 + x_12^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003194s Remaining time after improvement: 0.998148 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= l_11^0 + x_12^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x_12^0, len_98^0 -> 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): x_12^0, len_98^0 -> undef3, rest remain the same}> Ranking function: -l_11^0 New Graphs: Calling Safety with literal 1 <= l_11^0 + x_12^0 and entry LOG: CALL check - Post:1 <= l_11^0 + x_12^0 - Process 6 * Exit transition: * Postcondition : 1 <= l_11^0 + x_12^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000554s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000681s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= l_11^0 + x_12^0 , Narrowing transition: x_12^0, len_98^0 -> undef3, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x_12^0, len_98^0 -> undef3, rest remain the same}> Variables: l_11^0, len_98^0, x_12^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000994s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003755s Trying to remove transition: x_12^0, len_98^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007209s Time used: 0.006993 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009559s Time used: 0.00903 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002517s Time used: 4.00157 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.017068s Time used: 1.00061 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015214s Time used: 0.009068 Proving non-termination of subgraph 1 Transitions: x_12^0, len_98^0 -> undef3, rest remain the same}> Variables: l_11^0, len_98^0, x_12^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002158s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.148814s Time used: 0.147995 Improving Solution with cost 13 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.465119s Time used: 0.465117 LOG: SAT solveNonLinear - Elapsed time: 0.613933s Cost: 13; Total time: 0.613112 Failed at location 1: 1 <= l_11^0 + len_98^0 Before Improving: Quasi-invariant at l1: 1 <= l_11^0 + len_98^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.044441s Remaining time after improvement: 0.992096 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.013345s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= l_11^0 + len_98^0 Constraint over undef '1 + len_98^0 <= undef3' in transition: x_12^0, len_98^0 -> undef3, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l1: 10 Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): Strengthening exit transition (result): 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): x_12^0, len_98^0 -> 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.081668s Time used: 0.080953 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.094985s Time used: 0.09498 LOG: SAT solveNonLinear - Elapsed time: 0.176652s Cost: 4; Total time: 0.175933 Failed at location 1: l_11^0 <= 0 Before Improving: Quasi-invariant at l1: l_11^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.034453s Remaining time after improvement: 0.993614 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.010560s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: l_11^0 <= 0 Strengthening and disabling EXIT transitions... Closed exits from l1: 7 Strengthening exit transition (result): Strengthening exit transition (result): 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): x_12^0, len_98^0 -> 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.037022s Time used: 0.036459 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.087844s Time used: 0.087839 LOG: SAT solveNonLinear - Elapsed time: 0.124865s Cost: 2; Total time: 0.124298 Failed at location 1: x_12^0 <= l_11^0 Before Improving: Quasi-invariant at l1: x_12^0 <= l_11^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024162s Remaining time after improvement: 0.994826 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.007468s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x_12^0 <= l_11^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 2 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): x_12^0, len_98^0 -> 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: 5.001555s Time used: 5.00091 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.065654s Time used: 5.00331 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.137361s Time used: 0.080198 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.082552s Time used: 0.082546 LOG: SAT solveNonLinear - Elapsed time: 0.219912s Cost: 1; Total time: 0.162744 Failed at location 1: 0 <= x_12^0 Before Improving: Quasi-invariant at l1: 0 <= x_12^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009198s Remaining time after improvement: 0.995264 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.009869s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 0 <= x_12^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): x_12^0, len_98^0 -> undef3, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= l_11^0 + len_98^0, l_11^0 <= 0, x_12^0 <= l_11^0, 0 <= x_12^0, OPEN EXITS: (condsUp: 0 <= x_12^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= l_11^0 + len_98^0, l_11^0 <= 0, x_12^0 <= l_11^0, 0 <= x_12^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate