/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 + 1)}> ~(1)) /\ (arg1 > 0) /\ (undef4 > 0), par{arg1 -> undef4, arg2 -> (arg2 + 1), arg3 -> arg2}> undef7, arg2 -> undef8, arg3 -> undef9}> Fresh variables: undef1, undef4, undef7, undef8, undef9, Undef variables: undef1, undef4, undef7, undef8, undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef7 > 0) /\ (undef4 > 0)> 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> (arg2 + 1)}> Fresh variables: undef1, undef4, undef7, undef8, undef9, Undef variables: undef1, undef4, undef7, undef8, undef9, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 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.00239 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000653s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002161s [50616 : 50617] [50616 : 50618] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008836s Time used: 0.008362 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016182s Time used: 0.016179 LOG: SAT solveNonLinear - Elapsed time: 0.025018s Cost: 1; Total time: 0.024541 Termination implied by a set of invariant(s): Invariant at l1: 1 <= arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef1, arg2 -> 1 + arg2, 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): undef1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: undef1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000676s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002567s [50616 : 50626] [50616 : 50627] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009015s Time used: 0.008539 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014509s Time used: 0.014505 LOG: SAT solveNonLinear - Elapsed time: 0.023524s Cost: 1; Total time: 0.023044 Termination implied by a set of invariant(s): Invariant at l1: 0 <= arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef1, arg2 -> 1 + arg2, 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): undef1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + arg1 - arg2 New Graphs: Transitions: undef1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000780s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003291s [50616 : 50636] [50616 : 50637] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008910s Time used: 0.008502 Termination failed. Trying to show unreachability... Proving unreachability of entry: LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000973s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001100s Cannot prove unreachability [50616 : 50641] [50616 : 50645] Successful child: 50641 Program does NOT terminate