NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> arg2, arg2 -> undef2}> undef4}> 1, arg2 -> undef6}> 0) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1), arg2 -> undef8}> undef9, arg2 -> undef10}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef10 > ~(1))> 1}> 0) /\ ((arg1 + 1) > arg1), par{arg1 -> (arg1 + 1)}> Fresh variables: undef2, undef4, undef6, undef8, undef9, undef10, Undef variables: undef2, undef4, undef6, undef8, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1, rest remain the same}> Variables: arg1 Graph 2: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001594 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000482s Ranking function: -arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001284 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000543s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001293s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003721s Time used: 0.003598 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004942s Time used: 0.004666 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.010885s Time used: 1.01089 LOG: SAT solveNonLinear - Elapsed time: 1.015828s Cost: 1; Total time: 1.01556 Failed at location 3: arg1 <= 0 Before Improving: Quasi-invariant at l3: arg1 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004640s Remaining time after improvement: 0.999018 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg1 <= 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: 1 + arg1, 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: 1 + arg1, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 0 and entry LOG: CALL check - Post:arg1 <= 0 - Process 1 * Exit transition: * Postcondition : arg1 <= 0 Quasi-invariants: Location 2: arg1 <= 0 ; 1 <= 0 ; Postcondition: arg1 <= 0 LOG: CALL check - Post:arg1 <= 0 - Process 2 * Exit transition: * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000420s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000510s Postcondition: 1 <= 0 LOG: CALL check - Post:1 <= 0 - Process 3 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000390s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000469s LOG: NarrowEntry size 2 Narrowing transition: 1, rest remain the same}> LOG: Narrow transition size 2 ENTRIES: END ENTRIES: GRAPH: 1, rest remain the same}> END GRAPH: EXIT: POST: arg1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005105s Time used: 0.004942 Improving Solution with cost 51 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013890s Time used: 0.013885 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014728s Time used: 0.014721 LOG: SAT solveNonLinear - Elapsed time: 0.033722s Cost: 2; Total time: 0.033548 Failed at location 2: 12 <= arg1 Failed at location 2: 12 <= arg1 Before Improving: Quasi-invariant at l2: 12 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002022s Remaining time after improvement: 0.998937 Postcondition implied by a set of quasi-invariant(s): Quasi-invariant at l2: 12 <= arg1 Postcondition: 12 <= arg1 LOG: CALL check - Post:12 <= arg1 - Process 4 * Exit transition: * Postcondition : 12 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000598s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000700s Postcondition: 12 <= arg1 LOG: CALL check - Post:12 <= arg1 - Process 5 * Exit transition: * Postcondition : 12 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000543s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000639s LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 12 <= arg1 , Narrowing transition: 1, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1, rest remain the same}> END GRAPH: EXIT: POST: arg1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052311s Time used: 0.052135 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011227s Time used: 0.011223 LOG: SAT solveNonLinear - Elapsed time: 0.063537s Cost: 2; Total time: 0.063358 Failed at location 2: 10 <= arg1 Failed at location 2: 10 <= arg1 Before Improving: Quasi-invariant at l2: 10 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002120s Remaining time after improvement: 0.998553 Postcondition implied by a set of quasi-invariant(s): Quasi-invariant at l2: 10 <= arg1 Postcondition: 10 <= arg1 LOG: CALL check - Post:10 <= arg1 - Process 6 * Exit transition: * Postcondition : 10 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000612s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000716s Postcondition: 10 <= arg1 LOG: CALL check - Post:10 <= arg1 - Process 7 * Exit transition: * Postcondition : 10 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000575s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000680s LOG: NarrowEntry size 1 LOG: NarrowEntry size 1 INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 10 <= arg1 , Narrowing transition: 1, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: END ENTRIES: GRAPH: 1, rest remain the same}> END GRAPH: EXIT: POST: arg1 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045308s Time used: 0.045209 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.690815s Time used: 0.690363 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.001695s Time used: 1.00033 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 1.855076s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: arg1 <= 0 , Narrowing transition: 1 + arg1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000549s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001368s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003580s Time used: 0.003455 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001796s Time used: 4.00137 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005310s Time used: 4.00116 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.044988s Time used: 1.00094 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009681s Time used: 0.006339 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000678s Time used: 1.00068 LOG: SAT solveNonLinear - Elapsed time: 1.010359s Cost: 1; Total time: 1.00702 Termination implied by a set of invariant(s): Invariant at l3: 0 <= 1 + arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, 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): 1 + arg1, rest remain the same}> Quasi-ranking function: 50000 - arg1 New Graphs: Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000437s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001338s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003939s Time used: 0.003812 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001797s Time used: 4.00136 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005284s Time used: 4.00112 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007604s Time used: 1.0011 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007681s Time used: 4.00275 Proving non-termination of subgraph 2 Transitions: 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003589s Time used: 0.003435 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.004698s Time used: 0.004693 LOG: SAT solveNonLinear - Elapsed time: 0.008287s Cost: 1; Total time: 0.008128 Failed at location 3: 1 <= arg1 Before Improving: Quasi-invariant at l3: 1 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001571s Remaining time after improvement: 0.998883 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 <= arg1 Strengthening and disabling EXIT transitions... Closed exits from l3: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 <= arg1, arg1 <= 9, OPEN EXITS: > Conditions are reachable! Program does NOT terminate