/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) /\ (arg2 > ~(1)), par{arg1 -> 20, arg2 -> 0, arg3 -> arg2, arg4 -> undef4}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0), par{arg3 -> (arg3 + 1), arg4 -> (arg1 - 2)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0), par{arg3 -> (arg3 + 1), arg4 -> (arg1 - 2)}> ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2), par{arg2 -> (arg3 - 1), arg3 -> (arg1 - 2), arg4 -> undef16}> 0) /\ (arg1 = arg3), par{arg2 -> (arg1 - 1), arg3 -> (arg1 - 2), arg4 -> undef20}> arg3), par{arg4 -> undef24}> undef28}> arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef32}> 0, arg3 -> arg2, arg4 -> undef36}> arg2), par{arg2 -> 0, arg3 -> arg2, arg4 -> undef40}> 0, arg3 -> arg2, arg4 -> undef44}> 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef48}> 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1, arg4 -> undef52}> (arg1 - 1), arg4 -> undef56}> 0, arg2 -> 0, arg3 -> ~(1), arg4 -> undef60}> (arg1 - 1), arg2 -> 0, arg3 -> arg2, arg4 -> undef64}> (arg1 - 1), arg2 -> 0, arg3 -> arg2, arg4 -> undef68}> 2, arg2 -> 1, arg3 -> 1, arg4 -> undef72}> undef73, arg2 -> undef74, arg3 -> undef75, arg4 -> undef76}> Fresh variables: undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, Undef variables: undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef74 > ~(1))> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ ((arg1 - 2) > (arg3 + 1)), par{arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ ((arg1 - 2) < (arg3 + 1)), par{arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 < 0) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ ((arg1 - 2) > (arg3 + 1)), par{arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ ((arg1 - 2) < (arg3 + 1)), par{arg3 -> (arg3 + 1)}> 0) /\ (arg3 < arg1) /\ (arg1 > ~(1)) /\ (arg2 > 0) /\ ((arg3 + 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg3 -> (arg3 + 1)}> ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ ((arg1 - 2) > (arg3 - 1)), par{arg2 -> 0, arg3 -> (arg3 - 1)}> ~(1)) /\ (arg3 > 0) /\ (arg3 < arg1) /\ (0 = arg2) /\ ((arg3 - 1) = (arg1 - 2)), par{arg1 -> (arg1 - 1), arg2 -> 0, arg3 -> (arg3 - 1)}> 0) /\ (arg1 = arg3) /\ ((arg1 - 2) < (arg1 - 1)), par{arg2 -> 0, arg3 -> (arg1 - 1)}> 0) /\ (arg1 < 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}> 3) /\ (0 = arg3), par{arg2 -> 1, arg3 -> 1}> 0, arg2 -> 0, arg3 -> ~(1)}> 2, arg2 -> 1, arg3 -> 1}> Fresh variables: undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, Undef variables: undef4, undef16, undef20, undef24, undef28, undef32, undef36, undef40, undef44, undef48, undef52, undef56, undef60, undef64, undef68, undef72, undef73, undef74, undef75, undef76, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 0, arg2 -> 0, arg3 -> -1, rest remain the same}> 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 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.098669 Some transition disabled by a set of invariant(s): Invariant at l2: 1 <= arg1 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 0, arg2 -> 0, arg3 -> -1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Checking unfeasibility... Time used: 0.069572 Some transition disabled by a set of invariant(s): Invariant at l2: 0 <= arg2 Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Checking unfeasibility... Time used: 4.10101 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.032213s Ranking function: -16 + 4*arg1 New Graphs: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005024s Ranking function: -6 + 3*arg1 New Graphs: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003018s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.196229s [63374 : 63605] [63374 : 63606] Successful child: 63605 [ 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 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 2, arg2 -> 1, arg3 -> 1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + arg1 <= arg3 - Process 1 * Exit transition: * Postcondition : 1 + arg1 <= arg3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001332s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001456s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg1 <= arg3 , Narrowing transition: 1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 0, arg3 -> -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, arg3 -> 1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1, arg3 -> 1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 2, arg2 -> 1, arg3 -> 1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007109s Ranking function: -28 + 7*arg1 New Graphs: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 2, arg2 -> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005623s Ranking function: -6 + 3*arg1 New Graphs: Transitions: 1 + arg3, rest remain the same}> 1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg3, rest remain the same}> 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003269s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.202198s [63374 : 63610] [63374 : 63611] Successful child: 63610 [ 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 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + arg1, arg3 -> 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 2, arg2 -> 1, arg3 -> 1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 0, arg3 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, arg3 -> -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1, arg3 -> 1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1, arg3 -> 1, rest remain the same}> New Graphs: Transitions: 0, arg3 -> -1 + arg1, rest remain the same}> 1, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001557s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008951s [63374 : 63615] [63374 : 63616] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.102120s Time used: 4.10002 [63374 : 64039] [63374 : 64043] Successful child: 64039 Program does NOT terminate