NO Solver Timeout: 4 Global Timeout: 60 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)}> = 7))> = 7)> main_a, main_a -> main_b, main_b -> (main_olda + 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}> = 7)> = 7))> main_a, main_a -> main_b, main_b -> (main_olda + 1)}> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: 6, 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, ()] | a | local variable | integer | | b | local variable | integer | | olda | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: = 7), par{main_a -> main_b, main_b -> (main_a + 1)}> = 7))> Fresh variables: undef3, undef4, Undef variables: undef3, undef4, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002008 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000534s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001540s [58091 : 58093] [58091 : 58094] Successful child: 58093 [ 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_b, main_b -> 1 + main_a, 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_b, main_b -> 1 + main_a, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 2 - Process 1 * Exit transition: * Postcondition : main_a <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000474s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000566s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 2 , Narrowing transition: main_b, main_b -> 1 + main_a, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000507s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001642s [58091 : 58098] [58091 : 58099] Successful child: 58098 [ 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_b, main_b -> 1 + main_a, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b, main_b -> 1 + main_a, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 3 - Process 2 * Exit transition: * Postcondition : main_a <= 3 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000544s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000638s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 3 , Narrowing transition: main_b, main_b -> 1 + main_a, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000503s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001624s [58091 : 58103] [58091 : 58104] Successful child: 58103 [ 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_b, main_b -> 1 + main_a, 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_b, main_b -> 1 + main_a, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 5 - Process 3 * Exit transition: * Postcondition : main_a <= 5 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000564s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000662s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 5 , Narrowing transition: main_b, main_b -> 1 + main_a, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000504s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001647s [58091 : 58108] [58091 : 58109] Successful child: 58108 [ 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_b, main_b -> 1 + main_a, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_b, main_b -> 1 + main_a, rest remain the same}> New Graphs: LOG: CALL check - Post:main_a <= 6 - Process 4 * Exit transition: * Postcondition : main_a <= 6 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000599s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000707s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 6 , Narrowing transition: main_b, main_b -> 1 + main_a, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000495s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001660s [58091 : 58113] [58091 : 58114] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006657s Time used: 0.006315 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013035s Time used: 0.013029 LOG: SAT solveNonLinear - Elapsed time: 0.019691s Cost: 1; Total time: 0.019344 Quasi-ranking function: 50000 - main_a - main_b New Graphs: Transitions: main_b, main_b -> 1 + main_a, rest remain the same}> Variables: main_a, main_b Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000579s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002153s [58091 : 58119] [58091 : 58120] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007800s Time used: 0.007423 [58091 : 58124] [58091 : 58128] Successful child: 58124 Program does NOT terminate