/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: (0 + deltaext_new^0)}> (0 + deltaext^0)}> (~(1) + deltaext^0)}> (1 + deltaext^0)}> 2}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + (~(1) + deltaext^0))}> (0 + (1 + deltaext^0))}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00362 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000820s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008767s [406 : 407] [406 : 408] Successful child: 407 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> Ranking function: 4 + deltaext^0 + wnt^0 New Graphs: [406 : 412] [406 : 413] INVARIANTS: 3: 0 <= wnt^0 , Quasi-INVARIANTS to narrow Graph: 3: 1 <= deltaext^0 , wnt^0 <= 0 , Narrowing transition: -1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001414s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024193s [406 : 414] [406 : 415] Successful child: 414 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, 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): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001111s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013082s [406 : 419] [406 : 420] Successful child: 419 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> Ranking function: -deltaext^0 + 2*wnt^0 New Graphs: LOG: CALL check - Post:1 <= deltaext^0 - Process 1 * Exit transition: * Postcondition : 1 <= deltaext^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000647s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000739s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 <= deltaext^0 , [406 : 424] [406 : 425] [406 : 426] INVARIANTS: 3: 0 <= deltaext^0 , Quasi-INVARIANTS to narrow Graph: 3: deltaext^0 <= 1 + wnt^0 , wnt^0 <= 1 , Narrowing transition: -1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002007s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.053440s [406 : 427] [406 : 428] Successful child: 427 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, 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): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001690s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.033504s [406 : 432] [406 : 433] Successful child: 432 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001306s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015114s [406 : 437] [406 : 438] Successful child: 437 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001490s Ranking function: -deltaext^0 + wnt^0 New Graphs: LOG: CALL check - Post:deltaext^0 <= 1 + wnt^0 - Process 2 * Exit transition: * Postcondition : deltaext^0 <= 1 + wnt^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000670s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000796s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: deltaext^0 <= 1 + wnt^0 , INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 <= deltaext^0 , LOG: CALL check - Post:deltaext^0 <= wnt^0 - Process 3 * Exit transition: * Postcondition : deltaext^0 <= wnt^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000708s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000817s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: deltaext^0 <= wnt^0 , wnt^0 <= 3 , Narrowing transition: -1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: -1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 4 Narrowing transition: 1 + deltaext^0, rest remain the same}> LOG: Narrow transition size 4 invGraph after Narrowing: Transitions: -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002464s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.098829s [406 : 442] [406 : 443] Successful child: 442 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + deltaext^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + deltaext^0, rest remain the same}> New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> 1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001833s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.044333s [406 : 449] [406 : 450] Successful child: 450 Ranking function: -deltaext^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> -1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002528s Ranking function: -26 + 13*deltaext^0 - 13*wnt^0 New Graphs: Transitions: -1 + deltaext^0, rest remain the same}> Variables: deltaext^0, wnt^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001330s Ranking function: -1 + deltaext^0 - wnt^0 New Graphs: INVARIANTS: 3: wnt^0 <= 3 , Quasi-INVARIANTS to narrow Graph: 3: Program Terminates