/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: ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (arg1 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6, arg2 -> undef7}> ~(1)) /\ (arg2 > 1) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef13 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef18 > ~(1)) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17), arg2 -> undef16}> (arg1 - 1), arg2 -> undef21}> 0), par{arg1 -> (arg1 - 1), arg2 -> undef23}> undef24, arg2 -> undef25}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef25 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef24 > 0) /\ (undef6 > ~(1)) /\ (undef25 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef24 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef25 > 1) /\ ((undef4 - (2 * undef5)) = 1) /\ (undef4 > ~(1)) /\ (undef24 > 0) /\ (undef17 > ~(1)) /\ (undef25 > 1) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef18 > ~(1)) /\ (undef24 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}> ~(1)) /\ (undef25 > 1) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef13 > ~(1)) /\ (undef24 > 0) /\ (undef6 > ~(1)) /\ (undef25 > 1) /\ ((undef8 - (2 * undef9)) = 1) /\ (undef8 > ~(1)) /\ (undef24 > 0) /\ ((undef8 - (2 * undef9)) < 2) /\ ((undef8 - (2 * undef9)) >= 0), par{arg1 -> undef6}> ~(1)) /\ (undef25 > 1) /\ ((undef13 - (2 * undef14)) = 0) /\ (undef13 > ~(1)) /\ (undef24 > 0) /\ (undef17 > ~(1)) /\ (undef25 > 1) /\ ((undef18 - (2 * undef19)) = 0) /\ (undef18 > ~(1)) /\ (undef24 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> (0 - undef17)}> (arg1 - 1)}> 0), par{arg1 -> (arg1 - 1)}> Fresh variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Undef variables: undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef23, undef24, undef25, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, rest remain the same}> -1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 undef6, rest remain the same}> -undef17, rest remain the same}> undef6, rest remain the same}> -undef17, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.004128 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000868s Ranking function: -1 + 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.000372s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001107s [13134 : 13135] [13134 : 13136] Successful child: 13135 [ 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}> 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... > It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> New Graphs: [13134 : 13140] [13134 : 13141] INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 0 <= arg1 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> 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.000395s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001161s [13134 : 13142] [13134 : 13143] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005763s Time used: 0.005445 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010748s Time used: 0.010743 LOG: SAT solveNonLinear - Elapsed time: 0.016511s Cost: 1; Total time: 0.016188 Termination implied by a set of invariant(s): Invariant at l3: arg1 <= 1 [ 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.000384s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001161s [13134 : 13147] [13134 : 13148] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005174s Time used: 0.004878 [13134 : 13152] [13134 : 13156] Successful child: 13152 Program does NOT terminate