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_q -> ¿functionCall(__VERIFIER_nondet_int), main_a -> ¿functionCall(__VERIFIER_nondet_int), main_b -> ¿functionCall(__VERIFIER_nondet_int)}> 0))> 0)> ((main_q + main_a) - 1), main_olda -> main_a, main_a -> ((3 * main_olda) - (4 * main_b)), main_b -> ((4 * main_olda) + (3 * main_b))}> 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}> 0)> 0))> ((main_q + main_a) - 1), main_olda -> main_a, main_a -> ((3 * main_olda) - (4 * main_b)), main_b -> ((4 * main_olda) + (3 * main_b))}> 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 [6 idents]: __VERIFIER_nondet_int | function | [integer, ()] | | main | function | [integer, ()] | a | local variable | integer | | b | local variable | integer | | q | local variable | integer | | olda | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: 0), par{main_a -> ((3 * main_a) - (4 * main_b)), main_b -> ((4 * main_a) + (3 * main_b)), main_q -> ((main_q + main_a) - 1)}> 0))> Fresh variables: undef4, undef5, undef6, Undef variables: undef4, undef5, undef6, Abstraction variables: Exit nodes: 6, Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q 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.002163 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000505s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001620s [12443 : 12445] [12443 : 12446] Successful child: 12445 [ 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: LOG: CALL check - Post:main_q <= 0 - Process 1 * Exit transition: * Postcondition : main_q <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000273s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000316s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_q <= 0 , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000279s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001004s [12443 : 12450] [12443 : 12451] Successful child: 12450 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: main_q New Graphs: [12443 : 12455] [12443 : 12456] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 2*main_a + main_q <= 1 , 4*main_q <= 4 + main_b , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003492s Ranking function: -19 - 2*main_a - 4*main_b + 20*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000916s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004217s [12443 : 12457] [12443 : 12458] Successful child: 12457 [ 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: main_a + main_q New Graphs: [12443 : 12462] [12443 : 12463] [12443 : 12464] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= main_b , main_a <= 4 + main_q , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004850s Ranking function: -48 - 4*main_a - 8*main_b + 40*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002197s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.021000s [12443 : 12465] [12443 : 12466] Successful child: 12465 [ 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000514s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003381s [12443 : 12470] [12443 : 12471] Successful child: 12470 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: 2*main_a - 2*main_q New Graphs: LOG: CALL check - Post:4*main_q <= main_b - Process 2 * Exit transition: * Postcondition : 4*main_q <= main_b LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000321s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000384s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= main_b , [12443 : 12475] [12443 : 12476] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 3*main_a <= 20 + 4*main_q , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001539s Ranking function: -36 - 3*main_a - 6*main_b + 30*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000798s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020483s [12443 : 12477] [12443 : 12478] Successful child: 12477 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: -main_b + 4*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000684s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004585s [12443 : 12482] [12443 : 12483] Successful child: 12482 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Ranking function: 4*main_a - 5*main_q New Graphs: [12443 : 12487] [12443 : 12488] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= 5 + main_b , [12443 : 12489] [12443 : 12490] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a <= 9 + 3*main_q , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002760s Ranking function: 27 - 3*main_a - 6*main_b + 30*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001190s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024412s Piecewise ranking function: min(-1 - main_b + 4*main_q,5) New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000381s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001762s [12443 : 12491] [12443 : 12492] Successful child: 12491 [ 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: [12443 : 12496] [12443 : 12497] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 4*main_q <= 5 + main_b , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001430s Ranking function: -29 - 3*main_a - 6*main_b + 30*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000500s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002203s [12443 : 12498] [12443 : 12499] Successful child: 12498 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: [12443 : 12503] [12443 : 12504] [12443 : 12505] [12443 : 12506] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + main_a + main_b + 2*main_q <= 0 , 4*main_q <= 6 + main_b , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003229s Ranking function: 8 + (~(1) / 10)*main_a + (~(1) / 5)*main_b + main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000560s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002637s [12443 : 12507] [12443 : 12508] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016108s Time used: 0.015767 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032216s Time used: 0.032214 LOG: SAT solveNonLinear - Elapsed time: 0.048324s Cost: 1; Total time: 0.047981 Quasi-ranking function: 50000 - main_a - 2*main_b + 10*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000541s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010122s [12443 : 12512] [12443 : 12513] Successful child: 12512 [ 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, 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: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> New Graphs: [12443 : 12517] [12443 : 12518] [12443 : 12519] [12443 : 12520] [12443 : 12521] [12443 : 12522] [12443 : 12523] [12443 : 12524] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_a + main_q <= 0 , 4*main_q <= 6 + main_b , Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006775s Ranking function: (49 / 5) + (~(1) / 10)*main_a + (~(1) / 5)*main_b + main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000632s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005352s [12443 : 12525] [12443 : 12526] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.040510s Time used: 0.039562 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.055064s Time used: 0.054921 LOG: SAT solveNonLinear - Elapsed time: 0.095574s Cost: 1; Total time: 0.094483 Quasi-ranking function: 50000 - main_a - 2*main_b + 10*main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000619s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004815s [12443 : 12530] [12443 : 12531] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043270s Time used: 0.042116 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.056004s Time used: 0.056002 LOG: SAT solveNonLinear - Elapsed time: 0.099275s Cost: 1; Total time: 0.098118 Quasi-ranking function: 50000 - main_b + main_q New Graphs: Transitions: 3*main_a - 4*main_b, main_b -> 4*main_a + 3*main_b, main_q -> -1 + main_a + main_q, rest remain the same}> Variables: main_a, main_b, main_q Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001139s Ranking function: (~(1) / 16668) + (~(1) / 100008)*main_b + (1 / 25002)*main_q New Graphs: Proving termination of subgraph 2 Analyzing SCC {l6}... No cycles found. Program Terminates