/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 ******************************************************************************************* *********************** UNPROCESSED TRANSITION SYSTEMS PER FUNCTION *********************** ******************************************************************************************* List of LLVMGraphs + assumeNodes + staticAssertNodes [1] : +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ + + Init Location: 0 Transitions: 0, main_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_c -> 0}> 0))> 0)> 0)> 0))> main_y)> main_y))> main_y}> (main_x - 1)}> (main_c + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: + Assume Nodes [0]: ++++++++++++++++++++++++++++++++++++++++++++++++ + Static Assert Nodes [0]: +++++++++++++++++++++++++++++++++++++++++ + After preprocess (paralelization): ++++++++++++++++++++++++++++++ Init Location: 0 Transitions: 0}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_1}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_2, main_c -> 0}> 0)> 0))> 0)> 0))> main_y)> main_y))> main_y}> (main_x - 1)}> (main_c + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 14, Accepting locations: Asserts: + + +++++++++++++++++++++++++++++++ main +++++++++++++++++++++++++++++++ Function Return and Parameters Information [2 functions]: function name: __VERIFIER_nondet_int [1 return + 0 parameters] demangled: __VERIFIER_nondet_int __VERIFIER_nondet_int__func_return_ [function result] : int function name: main [1 return + 0 parameters] demangled: main main__func_return_ [function result] : int AST Ident Scanner Information [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | c | local variable | integer | | x | local variable | integer | | y | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef4 > 0)> 0) /\ not((undef4 > 0))> 0))> main_y), par{main_c -> (main_c + 1), main_x -> main_y}> main_y)), par{main_c -> (main_c + 1), main_x -> (main_x - 1)}> 0) /\ (main_x > main_y), par{main_c -> (main_c + 1), main_x -> main_y}> 0) /\ not((main_x > main_y)), par{main_c -> (main_c + 1), main_x -> (main_x - 1)}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 14, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_c, main_x -> main_y, rest remain the same}> 1 + main_c, main_x -> -1 + main_x, rest remain the same}> 1 + main_c, main_x -> main_y, rest remain the same}> 1 + main_c, main_x -> -1 + main_x, rest remain the same}> Variables: main_c, main_x, main_y Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 1 ) ( 14 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.010733 Some transition disabled by a set of invariant(s): Invariant at l4: 1 <= main_y Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + main_c, main_x -> main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_c, main_x -> -1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_c, main_x -> main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_c, main_x -> -1 + main_x, rest remain the same}> Checking unfeasibility... Time used: 0.007442 Some transition disabled by a set of invariant(s): Invariant at l4: 0 <= main_x Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + main_c, main_x -> -1 + main_x, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_c, main_x -> main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + main_c, main_x -> -1 + main_x, rest remain the same}> Checking unfeasibility... Time used: 0.005487 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001424s Ranking function: -3 + 3*main_x - 3*main_y New Graphs: Transitions: 1 + main_c, main_x -> -1 + main_x, rest remain the same}> Variables: main_c, main_x, main_y Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000786s Ranking function: -1 + main_x New Graphs: Proving termination of subgraph 2 Analyzing SCC {l14}... No cycles found. Program Terminates