NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 3) /\ (undef2 > 3) /\ (undef4 > 3) /\ (undef3 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}> = (undef7 + 1)) /\ (arg2 >= (undef8 + 1)) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (arg4 > 0) /\ (undef5 > ~(1)) /\ (undef6 > 0) /\ (undef7 > ~(1)) /\ (undef8 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}> 3) /\ (undef11 > ~(1)) /\ (undef10 > 4), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}> 2) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef13 > 0) /\ (undef14 > 0) /\ (undef15 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}> 1) /\ (undef17 > 3), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}> 2) /\ (arg2 > 0) /\ (undef21 > 0) /\ (undef22 > ~(1)), par{arg1 -> undef21, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24}> 1) /\ (undef25 > 3), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}> 2) /\ (arg2 > 0) /\ (undef29 > 0) /\ (undef30 > ~(1)), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}> 1) /\ (undef33 > 3), par{arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}> 2) /\ (arg2 > 0) /\ (undef37 > 0) /\ (undef38 > ~(1)), par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}> 2) /\ (arg2 > 0) /\ (undef41 > 1) /\ (undef42 > 1) /\ (undef43 > ~(1)), par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}> 2) /\ (arg2 > 0) /\ (undef45 > 4), par{arg1 -> undef45, arg2 -> undef46, arg3 -> undef47, arg4 -> undef48}> 2) /\ (arg2 > 0) /\ (undef49 > 2), par{arg1 -> undef49, arg2 -> undef50, arg3 -> undef51, arg4 -> undef52}> 2) /\ (undef53 > 2) /\ ((arg2 + 4) <= arg1), par{arg1 -> undef53, arg2 -> undef54, arg3 -> undef55, arg4 -> undef56}> 2) /\ (undef57 > 2) /\ (undef58 > 1) /\ (undef59 > ~(1)), par{arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60}> undef61, arg2 -> undef62, arg3 -> undef63, arg4 -> undef64}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 3) /\ (undef2 > 3) /\ (undef4 > 3) /\ (undef3 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4}> 3) /\ (undef11 > ~(1)) /\ (undef10 > 4), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}> 1) /\ (undef17 > 3), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}> 1) /\ (undef25 > 3), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}> 1) /\ (undef33 > 3), par{arg1 -> undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}> = (undef7 + 1)) /\ (arg2 >= (undef8 + 1)) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (arg4 > 0) /\ (undef5 > ~(1)) /\ (undef6 > 0) /\ (undef7 > ~(1)) /\ (undef8 > ~(1)), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}> 2) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef13 > 0) /\ (undef14 > 0) /\ (undef15 > ~(1)), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16}> 2) /\ (arg2 > 0) /\ (undef21 > 0) /\ (undef22 > ~(1)), par{arg1 -> undef21, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24}> 2) /\ (arg2 > 0) /\ (undef29 > 0) /\ (undef30 > ~(1)), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}> 2) /\ (arg2 > 0) /\ (undef37 > 0) /\ (undef38 > ~(1)), par{arg1 -> undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40}> 2) /\ (arg2 > 0) /\ (undef41 > 1) /\ (undef42 > 1) /\ (undef43 > ~(1)), par{arg1 -> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44}> 2) /\ (arg2 > 0) /\ (undef45 > 4) /\ (undef57 <= undef45) /\ ((undef58 + 1) <= undef45) /\ (undef45 > 2) /\ (undef57 > 2) /\ (undef58 > 1) /\ (undef59 > ~(1)), par{arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60}> 2) /\ (arg2 > 0) /\ (undef49 > 2) /\ (undef57 <= undef49) /\ ((undef58 + 1) <= undef49) /\ (undef49 > 2) /\ (undef57 > 2) /\ (undef58 > 1) /\ (undef59 > ~(1)), par{arg1 -> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 2: Transitions: undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 3: Transitions: undef21, arg2 -> undef22, arg3 -> undef23, arg4 -> undef24, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 4: Transitions: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 5: Transitions: undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> Graph 2 undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28, rest remain the same}> Graph 3 undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20, rest remain the same}> Graph 4 undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> Graph 5 undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 5 ) ( 3 , 4 ) ( 4 , 3 ) ( 5 , 2 ) ( 6 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003773 Checking conditional termination of SCC {l6}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001500s Ranking function: (~(4) / 3) + (1 / 3)*arg1 + (1 / 3)*arg2 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.003321 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001573s Ranking function: (~(4) / 3) + (1 / 3)*arg1 + (1 / 3)*arg2 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.003257 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001554s Ranking function: (~(4) / 3) + (1 / 3)*arg1 + (1 / 3)*arg2 New Graphs: Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.005218 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001188s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005215s Trying to remove transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014176s Time used: 0.013875 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.028739s Time used: 0.027999 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.036264s Time used: 0.036257 LOG: SAT solveNonLinear - Elapsed time: 0.065004s Cost: 4; Total time: 0.064256 Failed at location 3: arg3 <= 0 Failed at location 3: arg3 <= 0 Failed at location 3: arg3 <= 0 Failed at location 3: arg3 <= 0 Before Improving: Quasi-invariant at l3: arg3 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004873s Remaining time after improvement: 0.997623 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg3 <= 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: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> New Graphs: Calling Safety with literal arg3 <= 0 and entry undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> LOG: CALL check - Post:arg3 <= 0 - Process 1 * Exit transition: undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> * Postcondition : arg3 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000692s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000797s Calling Safety with literal arg3 <= 0 and entry undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}> LOG: CALL check - Post:arg3 <= 0 - Process 2 * Exit transition: undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}> * Postcondition : arg3 <= 0 Postcodition moved up: undef43 <= 0 LOG: Try proving POST Postcondition: undef43 <= 0 LOG: CALL check - Post:undef43 <= 0 - Process 3 * Exit transition: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> * Postcondition : undef43 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000644s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000760s LOG: NarrowEntry size 1 Narrowing transition: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> END ENTRIES: GRAPH: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> END GRAPH: EXIT: undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}> POST: arg3 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027322s Time used: 0.027215 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001675s Time used: 4.00101 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002524s Time used: 1.00057 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 5.044074s Calling Safety with literal arg3 <= 0 and entry undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> LOG: CALL check - Post:arg3 <= 0 - Process 4 * Exit transition: undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> * Postcondition : arg3 <= 0 Postcodition moved up: undef59 <= 0 LOG: Try proving POST Postcondition: undef59 <= 0 LOG: CALL check - Post:undef59 <= 0 - Process 5 * Exit transition: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> * Postcondition : undef59 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000875s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001034s LOG: NarrowEntry size 1 Narrowing transition: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> END ENTRIES: GRAPH: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> END GRAPH: EXIT: undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> POST: arg3 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032501s Time used: 0.03239 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001293s Time used: 4.00052 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002680s Time used: 1.00024 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 5.058428s Calling Safety with literal arg3 <= 0 and entry undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> LOG: CALL check - Post:arg3 <= 0 - Process 6 * Exit transition: undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> * Postcondition : arg3 <= 0 Postcodition moved up: undef59 <= 0 LOG: Try proving POST Postcondition: undef59 <= 0 LOG: CALL check - Post:undef59 <= 0 - Process 7 * Exit transition: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> * Postcondition : undef59 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000939s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001098s LOG: NarrowEntry size 1 Narrowing transition: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> END ENTRIES: GRAPH: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> END GRAPH: EXIT: undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> POST: arg3 <= 0 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029694s Time used: 0.029584 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001239s Time used: 4.00049 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003370s Time used: 1.00056 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 5.068238s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: arg3 <= 0 , Narrowing transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001154s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005413s Trying to remove transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013519s Time used: 0.013281 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.066408s Time used: 0.065461 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.047603s Time used: 0.047594 LOG: SAT solveNonLinear - Elapsed time: 0.114011s Cost: 4; Total time: 0.113055 Failed at location 3: arg1 <= 2 Failed at location 3: arg1 <= 2 Failed at location 3: arg1 <= 2 Failed at location 3: arg1 <= 2 Before Improving: Quasi-invariant at l3: arg1 <= 2 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005820s Remaining time after improvement: 0.997426 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: arg1 <= 2 [ 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: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, 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: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> New Graphs: Calling Safety with literal arg1 <= 2 and entry undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> LOG: CALL check - Post:arg1 <= 2 - Process 8 * Exit transition: undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> * Postcondition : arg1 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001080s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001181s Calling Safety with literal arg1 <= 2 and entry undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}> LOG: CALL check - Post:arg1 <= 2 - Process 9 * Exit transition: undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}> * Postcondition : arg1 <= 2 Postcodition moved up: undef41 <= 2 LOG: Try proving POST Postcondition: undef41 <= 2 LOG: CALL check - Post:undef41 <= 2 - Process 10 * Exit transition: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> * Postcondition : undef41 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000832s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000950s LOG: NarrowEntry size 1 Narrowing transition: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> END ENTRIES: GRAPH: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> END GRAPH: EXIT: undef41, arg2 -> undef42, arg3 -> undef43, arg4 -> undef44, rest remain the same}> POST: arg1 <= 2 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.037770s Time used: 0.037661 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001619s Time used: 4.0006 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002874s Time used: 1.00025 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 5.071607s Calling Safety with literal arg1 <= 2 and entry undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> LOG: CALL check - Post:arg1 <= 2 - Process 11 * Exit transition: undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> * Postcondition : arg1 <= 2 Postcodition moved up: undef57 <= 2 LOG: Try proving POST Postcondition: undef57 <= 2 LOG: CALL check - Post:undef57 <= 2 - Process 12 * Exit transition: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> * Postcondition : undef57 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000998s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001154s LOG: NarrowEntry size 1 Narrowing transition: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> END ENTRIES: GRAPH: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> END GRAPH: EXIT: undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> POST: arg1 <= 2 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.031259s Time used: 0.03115 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001393s Time used: 4.00057 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.002982s Time used: 1.00012 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 5.072772s Calling Safety with literal arg1 <= 2 and entry undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> LOG: CALL check - Post:arg1 <= 2 - Process 13 * Exit transition: undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> * Postcondition : arg1 <= 2 Postcodition moved up: undef57 <= 2 LOG: Try proving POST Postcondition: undef57 <= 2 LOG: CALL check - Post:undef57 <= 2 - Process 14 * Exit transition: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> * Postcondition : undef57 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001010s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001167s LOG: NarrowEntry size 1 Narrowing transition: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> LOG: Narrow transition size 1 ENTRIES: undef33, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}> END ENTRIES: GRAPH: undef37, arg2 -> undef38, arg3 -> undef39, arg4 -> undef40, rest remain the same}> END GRAPH: EXIT: undef57, arg2 -> undef58, arg3 -> undef59, arg4 -> undef60, rest remain the same}> POST: arg1 <= 2 LOG: Try proving POST Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032694s Time used: 0.032584 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001723s Time used: 4.00086 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.357186s Time used: 0.354191 LOG: Postcondition is not implied - no solution > Postcondition is not implied! LOG: RETURN check - Elapsed time: 4.427070s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: arg1 <= 2 , Timeout expired! Proving non-termination of subgraph 4 Transitions: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001745s Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.083379s Time used: 0.082861 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.166495s Time used: 0.166484 LOG: SAT solveNonLinear - Elapsed time: 0.249874s Cost: 4; Total time: 0.249345 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.028418s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 <= arg2 Strengthening and disabling EXIT transitions... Closed exits from l3: 1 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): undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.122446s Time used: 0.121999 Improving Solution with cost 7 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.800769s Time used: 0.800736 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.085012s Time used: 0.085004 LOG: SAT solveNonLinear - Elapsed time: 1.008227s Cost: 2; Total time: 1.00774 Failed at location 3: 3 <= arg1 Before Improving: Quasi-invariant at l3: 3 <= arg1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007669s Remaining time after improvement: 0.996244 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.007036s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 3 <= arg1 Constraint over undef '7 <= undef13' in transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l3: 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): undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.098882s Time used: 0.098461 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072523s Time used: 0.072514 LOG: SAT solveNonLinear - Elapsed time: 0.171405s Cost: 4; Total time: 0.170975 Failed at location 3: 1 <= arg3 Failed at location 3: 1 <= arg3 Failed at location 3: 1 <= arg3 Failed at location 3: 1 <= arg3 Before Improving: Quasi-invariant at l3: 1 <= arg3 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.021997s Remaining time after improvement: 0.996753 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.005771s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 <= arg3 Constraint over undef '1 <= undef15' in transition: undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> 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): undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= arg2, 3 <= arg1, 1 <= arg3, Transition: Conditions: 1 <= arg2, 3 <= arg1, 1 <= arg3, Transition: Conditions: 1 <= arg2, 3 <= arg1, 1 <= arg3, Transition: Conditions: 1 <= arg2, 3 <= arg1, 1 <= arg3, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> Conditions: 3 <= arg1, 1 <= arg2, 1 <= arg3, Transition: undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> Conditions: 3 <= arg1, 1 <= arg2, 1 <= arg3, Transition: undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> Conditions: 3 <= arg1, 1 <= arg2, 1 <= arg3, Transition: undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> Conditions: 3 <= arg1, 1 <= arg2, 1 <= arg3, OPEN EXITS: undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12, rest remain the same}> > Conditions are reachable! Program does NOT terminate