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.002323 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000786s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002432s Trying to remove transition: undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006883s Time used: 0.00672 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009115s Time used: 0.008612 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015449s Time used: 0.015445 LOG: SAT solveNonLinear - Elapsed time: 0.024564s Cost: 1; Total time: 0.024057 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.002477s Remaining time after improvement: 0.998819 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): 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 <= 0 and entry LOG: CALL check - Post:1 + __const_1000^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + __const_1000^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000287s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000367s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_1000^0 <= 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.000802s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002559s Trying to remove transition: undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006799s Time used: 0.006633 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012386s Time used: 0.011857 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013138s Time used: 0.013134 LOG: SAT solveNonLinear - Elapsed time: 0.025525s Cost: 1; Total time: 0.024991 Failed at location 1: __const_1000^0 + x^0 <= __const_200^0 Before Improving: Quasi-invariant at l1: __const_1000^0 + x^0 <= __const_200^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002295s Remaining time after improvement: 0.998865 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_1000^0 + x^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 __const_1000^0 + x^0 <= __const_200^0 and entry LOG: CALL check - Post:__const_1000^0 + x^0 <= __const_200^0 - Process 2 * Exit transition: * Postcondition : __const_1000^0 + x^0 <= __const_200^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000462s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000545s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_1000^0 + x^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.000717s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002758s Trying to remove transition: undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005859s Time used: 0.005684 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011079s Time used: 0.010636 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.000995s Time used: 4.00038 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003147s Time used: 1.00018 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015289s Time used: 0.00805 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.001314s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031996s Time used: 0.031677 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.068832s Time used: 0.06869 LOG: SAT solveNonLinear - Elapsed time: 0.100828s Cost: 2; Total time: 0.100367 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.009989s Remaining time after improvement: 0.998013 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003586s 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): 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.016562s Time used: 0.01628 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027883s Time used: 0.027878 LOG: SAT solveNonLinear - Elapsed time: 0.044445s Cost: 1; Total time: 0.044158 Failed at location 1: __const_1000^0 + __const_200^0 <= 1 + x^0 Before Improving: Quasi-invariant at l1: __const_1000^0 + __const_200^0 <= 1 + x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009686s Remaining time after improvement: 0.998003 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003375s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_1000^0 + __const_200^0 <= 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): undef3, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= __const_1000^0, __const_1000^0 + __const_200^0 <= 1 + x^0, OPEN EXITS: (condsUp: 1 <= __const_1000^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: __const_1000^0 + __const_200^0 <= 1 + x^0, 1 <= __const_1000^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate