/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO 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_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int), main_c -> ¿functionCall(__VERIFIER_nondet_int)}> = 1))> = 1)> ¿functionCall(__VERIFIER_nondet_int), main_b -> 10, main_c -> ((main_c + 1) + main_r), main_a -> main_c}> 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}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> = 1)> = 1))> ¿functionCall(__VERIFIER_nondet_int)}> varCall_4, main_b -> 10, main_c -> ((main_c + 1) + main_r), main_a -> main_c}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 7, 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 [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | a | local variable | integer | | b | local variable | integer | | c | local variable | integer | | r | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 1) /\ (main_a = main_c), par{main_a -> ((main_c + 1) + undef8), main_b -> 10, main_c -> ((main_c + 1) + undef8)}> = 1) /\ (main_a < main_c)> = 1) /\ (main_a > main_c)> = 1))> Fresh variables: undef5, undef6, undef7, undef8, Undef variables: undef5, undef6, undef7, undef8, Abstraction variables: Exit nodes: 7, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> Variables: main_a, main_b, main_c Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 7 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002747 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000679s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002285s [44446 : 44447] [44446 : 44448] Successful child: 44447 [ 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 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> [ Termination 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 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_c <= main_a - Process 1 * Exit transition: * Postcondition : 1 + main_c <= main_a LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000568s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000672s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_c <= main_a , Narrowing transition: 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> Variables: main_a, main_b, main_c Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000642s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002443s [44446 : 44452] [44446 : 44453] Successful child: 44452 [ 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 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> [ Termination 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 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + main_a <= main_c - Process 2 * Exit transition: * Postcondition : 1 + main_a <= main_c LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000681s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000793s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_a <= main_c , Narrowing transition: 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> Variables: main_a, main_b, main_c Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000651s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002385s [44446 : 44457] [44446 : 44458] Successful child: 44457 [ 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 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> New Graphs: LOG: CALL check - Post:main_b <= main_a - Process 3 * Exit transition: * Postcondition : main_b <= main_a LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000730s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000842s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_b <= main_a , Narrowing transition: 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + main_c + undef8, main_b -> 10, main_c -> 1 + main_c + undef8, rest remain the same}> Variables: main_a, main_b, main_c Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000722s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002664s [44446 : 44462] [44446 : 44463] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010918s Time used: 0.010558 [44446 : 44480] [44446 : 44484] Successful child: 44484 Program does NOT terminate