/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/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_i -> ¿functionCall(__VERIFIER_nondet_int), main_j -> ¿functionCall(__VERIFIER_nondet_int), main_t -> 0}> main_i, main_i -> main_j, main_j -> main_t}> 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_t -> 0}> main_i, main_i -> main_j, main_j -> main_t}> 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 [5 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | i | local variable | integer | | j | local variable | integer | | t | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: main_j, main_j -> main_i}> 0), par{main_i -> main_j, main_j -> main_i}> 0) /\ (main_j = 0)> 0) /\ (main_j < 0), par{main_i -> main_j, main_j -> main_i}> 0) /\ (main_j > 0), par{main_i -> main_j, main_j -> main_i}> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 7, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j 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.007239 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001739s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.031006s [32211 : 32212] [32211 : 32213] Successful child: 32212 [ 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001517s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.025418s [32211 : 32217] [32211 : 32218] Successful child: 32217 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001343s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014365s [32211 : 32222] [32211 : 32223] Successful child: 32222 [ 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= 1 + main_i + main_j - Process 1 * Exit transition: * Postcondition : 0 <= 1 + main_i + main_j LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000940s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001059s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 1 + main_i + main_j , LOG: CALL check - Post:main_i + main_j <= 1 - Process 2 * Exit transition: * Postcondition : main_i + main_j <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000624s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000706s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i + main_j <= 1 , [32211 : 32227] [32211 : 32228] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 0 , 1 + main_j <= 0 , Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001765s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.029937s [32211 : 32229] [32211 : 32230] Successful child: 32229 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001558s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.027655s [32211 : 32234] [32211 : 32235] Successful child: 32234 [ 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001136s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008854s [32211 : 32239] [32211 : 32240] Successful child: 32239 [ 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> New Graphs: [32211 : 32244] [32211 : 32245] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_i + main_j <= 0 , [32211 : 32246] [32211 : 32247] [32211 : 32248] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= 1 + main_i + main_j , [32211 : 32249] [32211 : 32250] [32211 : 32251] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_i <= 0 , 0 <= 1 + main_i , Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: main_j, main_j -> main_i, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002670s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.068359s [32211 : 32252] [32211 : 32253] Successful child: 32252 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, 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): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002480s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.125547s [32211 : 32257] [32211 : 32258] Successful child: 32257 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002051s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040415s [32211 : 32262] [32211 : 32263] Successful child: 32262 [ 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: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_j, main_j -> main_i, rest remain the same}> New Graphs: Transitions: main_j, main_j -> main_i, rest remain the same}> main_j, main_j -> main_i, rest remain the same}> Variables: main_i, main_j Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001267s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009041s [32211 : 32267] [32211 : 32268] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012394s Time used: 0.011795 [32211 : 32272] [32211 : 32276] Successful child: 32276 Program does NOT terminate