/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)) /\ ((undef1 - 1) <= arg1) /\ ((undef2 - 3) <= arg1) /\ (arg1 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> ~(1)) /\ ((undef5 - 1) <= arg1) /\ (arg1 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}> = undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}> 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef14 > ~(1)) /\ ((undef1 - 1) <= undef13) /\ ((undef2 - 3) <= undef13) /\ (undef13 > 0) /\ (undef1 > 1) /\ (undef2 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> ~(1)) /\ ((undef5 - 1) <= undef13) /\ (undef13 > 0) /\ (undef4 > 3) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}> = undef7) /\ (arg3 > 0) /\ (arg1 >= (undef8 - 3)) /\ ((undef8 - 3) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef7 > 0) /\ (undef8 > 3), par{arg1 -> undef7, arg2 -> undef8}> 0) /\ (arg2 > 0) /\ (undef10 > 3) /\ (undef11 > 0) /\ (0 = arg3), par{arg1 -> undef10, arg2 -> undef11, arg3 -> 0}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Undef variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef10, undef11, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef7, arg2 -> undef8, rest remain the same}> undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> undef4, arg2 -> undef5, arg3 -> 0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.008695 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002238s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012167s [25673 : 25674] [25673 : 25675] Successful child: 25674 [ 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: undef7, arg2 -> undef8, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef7, arg2 -> undef8, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> New Graphs: Transitions: undef10, arg2 -> undef11, arg3 -> 0, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001144s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004606s [25673 : 25684] [25673 : 25685] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011991s Time used: 0.011348 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001367s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001500s Cannot prove unreachability [25673 : 25701] [25673 : 25705] Successful child: 25705 Program does NOT terminate