/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_x -> ¿functionCall(__VERIFIER_nondet_int), main_y -> ¿functionCall(__VERIFIER_nondet_int), main_z -> ¿functionCall(__VERIFIER_nondet_int)}> (main_x + main_z), main_z -> (~(2) * main_y), main_y -> (main_y + 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}> ¿functionCall(__VERIFIER_nondet_int)}> varCall_3}> (main_x + main_z), main_z -> (~(2) * main_y), main_y -> (main_y + 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, ()] | x | local variable | integer | | y | local variable | integer | | z | local variable | integer | | Main function: main Preprocessed LLVMGraph Init Location: 0 Transitions: (main_x + main_z), main_y -> (main_y + 1), main_z -> (~(2) * main_y)}> 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: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z 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.002596 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000836s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001987s [25391 : 25392] [25391 : 25393] Successful child: 25392 [ 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:1 <= main_x - Process 1 * Exit transition: * Postcondition : 1 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000546s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000641s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_x , Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000795s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002089s [25391 : 25397] [25391 : 25398] Successful child: 25397 [ 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> New Graphs: LOG: CALL check - Post:0 <= main_x - Process 2 * Exit transition: * Postcondition : 0 <= main_x LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000641s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000741s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x , Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000794s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002077s [25391 : 25402] [25391 : 25403] Successful child: 25402 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Ranking function: -main_x New Graphs: [25391 : 25407] [25391 : 25408] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 0 <= main_x + main_z , main_y <= 1 + main_x , Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001138s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007647s Piecewise ranking function: min(2,1 - main_x) New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000598s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002043s [25391 : 25409] [25391 : 25410] Successful child: 25409 [ 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Ranking function: -main_y New Graphs: [25391 : 25414] [25391 : 25415] [25391 : 25416] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: main_y <= main_x , 1 <= main_z , Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002250s Ranking function: 2 - 2*main_y New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001242s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011227s Piecewise ranking function: min(0,-1 - main_x) New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000710s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002471s [25391 : 25417] [25391 : 25418] Successful child: 25417 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Ranking function: 90 - main_x + main_y New Graphs: [25391 : 25422] [25391 : 25423] [25391 : 25424] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 2*main_y <= 2*main_x + main_z , Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002967s Ranking function: -6 - 6*main_y New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001482s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.029188s Piecewise ranking function: min(0,-1 - main_x) New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000853s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003848s [25391 : 25425] [25391 : 25426] Successful child: 25425 [ 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Ranking function: 2 - main_x New Graphs: [25391 : 25430] [25391 : 25431] [25391 : 25432] [25391 : 25433] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= main_z , main_y <= 1 + main_x , Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003646s Ranking function: 4 - 4*main_y New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002293s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.059913s Piecewise ranking function: min(-main_x,1) New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001594s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015757s [25391 : 25434] [25391 : 25435] Successful child: 25434 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, 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_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Ranking function: main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001007s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005364s [25391 : 25439] [25391 : 25440] Successful child: 25439 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> New Graphs: [25391 : 25444] [25391 : 25445] [25391 : 25446] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 <= 2*main_y + main_z , [25391 : 25447] [25391 : 25448] [25391 : 25449] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 2*main_y <= 1 + main_x , Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006843s Ranking function: 4 - 8*main_y New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003911s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.360457s Piecewise ranking function: min(0,-1 - main_x) New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003085s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.089578s [25391 : 25450] [25391 : 25451] Successful child: 25451 Ranking function: -2*main_y - main_z Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003474s Ranking function: -1 + main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001102s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004944s [25391 : 25455] [25391 : 25456] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.044281s Time used: 0.043395 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.074722s Time used: 0.074713 LOG: SAT solveNonLinear - Elapsed time: 0.119004s Cost: 1; Total time: 0.118108 Quasi-ranking function: 50000 + main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001233s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011617s [25391 : 25568] [25391 : 25569] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047475s Time used: 0.046371 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.064084s Time used: 0.064075 LOG: SAT solveNonLinear - Elapsed time: 0.111559s Cost: 1; Total time: 0.110446 Quasi-ranking function: 50000 + main_x + main_y + main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001337s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.059518s [25391 : 25573] [25391 : 25574] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.048840s Time used: 0.047723 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.080126s Time used: 0.080116 LOG: SAT solveNonLinear - Elapsed time: 0.128965s Cost: 1; Total time: 0.127839 Quasi-ranking function: 50000 + main_y + 2*main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001464s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.094258s [25391 : 25578] [25391 : 25579] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.042569s Time used: 0.041432 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.061978s Time used: 0.061968 LOG: SAT solveNonLinear - Elapsed time: 0.104546s Cost: 1; Total time: 0.1034 Quasi-ranking function: 50000 + main_x - main_y + main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001510s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.115393s [25391 : 25592] [25391 : 25593] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050172s Time used: 0.049039 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.066014s Time used: 0.066005 LOG: SAT solveNonLinear - Elapsed time: 0.116186s Cost: 1; Total time: 0.115044 Quasi-ranking function: 50000 - main_y New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001542s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.136517s [25391 : 25597] [25391 : 25598] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045010s Time used: 0.0438 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.073402s Time used: 0.073393 LOG: SAT solveNonLinear - Elapsed time: 0.118412s Cost: 1; Total time: 0.117193 Quasi-ranking function: 50000 - main_y + main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001656s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.125401s [25391 : 25602] [25391 : 25603] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.049150s Time used: 0.047856 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.064983s Time used: 0.064957 LOG: SAT solveNonLinear - Elapsed time: 0.114133s Cost: 1; Total time: 0.112813 Quasi-ranking function: 50000 + main_x - main_y New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001660s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.043323s [25391 : 25607] [25391 : 25608] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043823s Time used: 0.042559 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.068874s Time used: 0.068865 LOG: SAT solveNonLinear - Elapsed time: 0.112697s Cost: 1; Total time: 0.111424 Quasi-ranking function: 50000 + 4*main_x + 100002*main_y - main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001776s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.170699s [25391 : 25612] [25391 : 25613] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053398s Time used: 0.051633 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.074257s Time used: 0.074248 LOG: SAT solveNonLinear - Elapsed time: 0.127655s Cost: 1; Total time: 0.125881 Quasi-ranking function: 50000 + 3*main_x - main_y - main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001907s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.183032s [25391 : 25617] [25391 : 25618] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052599s Time used: 0.05065 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.066640s Time used: 0.066632 LOG: SAT solveNonLinear - Elapsed time: 0.119240s Cost: 1; Total time: 0.117282 Quasi-ranking function: 50000 + main_x + main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001935s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.213777s [25391 : 25622] [25391 : 25623] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047323s Time used: 0.045326 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062343s Time used: 0.062333 LOG: SAT solveNonLinear - Elapsed time: 0.109665s Cost: 1; Total time: 0.107659 Quasi-ranking function: 50000 + 3*main_x - main_z New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004268s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.149576s [25391 : 25627] [25391 : 25628] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064232s Time used: 0.06193 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.089029s Time used: 0.089018 LOG: SAT solveNonLinear - Elapsed time: 0.153261s Cost: 1; Total time: 0.150948 Quasi-ranking function: 50000 + main_x New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004585s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.113442s [25391 : 25632] [25391 : 25633] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.047918s Time used: 0.045687 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.067019s Time used: 0.06701 LOG: SAT solveNonLinear - Elapsed time: 0.114937s Cost: 1; Total time: 0.112697 Quasi-ranking function: 50000 + 2*main_x + 50001*main_y New Graphs: Transitions: main_x + main_z, main_y -> 1 + main_y, main_z -> -2*main_y, rest remain the same}> Variables: main_x, main_y, main_z Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002296s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.356995s [25391 : 25637] [25391 : 25638] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.075618s Time used: 0.073857 [25391 : 25642] [25391 : 25646] Successful child: 25642 Program does NOT terminate