/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef3, oldX1^0 -> undef4, oldX2^0 -> undef5, oldX3^0 -> undef6, x0^0 -> (0 + undef3), x1^0 -> (0 + undef4), x2^0 -> (0 + undef5), x3^0 -> (0 + undef6)}> undef17, oldX1^0 -> undef18, oldX2^0 -> undef19, oldX3^0 -> undef20, x0^0 -> (0 + undef17), x1^0 -> (0 + undef18), x2^0 -> (0 + undef19), x3^0 -> (~(1) + undef20)}> undef45, oldX1^0 -> undef46, oldX2^0 -> undef47, oldX3^0 -> (0 + x3^0), oldX4^0 -> undef49, x0^0 -> (0 + undef45), x1^0 -> (0 + undef46), x2^0 -> (0 + undef47), x3^0 -> (0 + undef49)}> undef59, oldX1^0 -> undef60, oldX2^0 -> undef61, oldX3^0 -> (0 + x3^0), x0^0 -> (0 + undef59), x1^0 -> (0 + undef60), x2^0 -> (0 + undef61), x3^0 -> (0 + undef61)}> undef73, oldX1^0 -> undef74, oldX2^0 -> undef75, oldX3^0 -> (0 + x3^0), oldX4^0 -> undef77, x0^0 -> (0 + undef73), x1^0 -> (0 + undef74), x2^0 -> ((0 + (~(1) * __const_8^0)) + undef75), x3^0 -> (0 + undef77)}> undef87, oldX1^0 -> undef88, oldX2^0 -> undef89, oldX3^0 -> (0 + x3^0), oldX4^0 -> undef91, x0^0 -> (0 + undef87), x1^0 -> (0 + undef88), x2^0 -> (0 + undef89), x3^0 -> (0 + undef91)}> undef101, oldX1^0 -> undef102, oldX2^0 -> undef103, oldX3^0 -> (0 + x3^0), oldX4^0 -> undef105, x0^0 -> (0 + undef101), x1^0 -> (0 + undef102), x2^0 -> (0 + undef103), x3^0 -> (0 + undef105)}> undef115, oldX1^0 -> undef116, oldX2^0 -> (0 + x2^0), oldX3^0 -> (0 + x3^0), oldX4^0 -> undef119, x0^0 -> (0 + undef115), x1^0 -> (0 + undef116), x2^0 -> (0 + undef116), x3^0 -> (0 + undef119)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> (0 + x3^0), oldX4^0 -> undef133, oldX5^0 -> undef134, oldX6^0 -> undef135, oldX7^0 -> undef136, x0^0 -> (0 + undef133), x1^0 -> (0 + undef134), x2^0 -> (0 + undef135), x3^0 -> (0 + undef136)}> undef143, oldX1^0 -> undef144, oldX2^0 -> (0 + x2^0), oldX3^0 -> (0 + x3^0), oldX4^0 -> undef147, oldX5^0 -> undef148, x0^0 -> (0 + undef143), x1^0 -> (0 + undef144), x2^0 -> (0 + undef147), x3^0 -> (0 + undef148)}> undef157, oldX1^0 -> undef158, oldX2^0 -> (0 + x2^0), oldX3^0 -> (0 + x3^0), oldX4^0 -> undef161, oldX5^0 -> undef162, x0^0 -> (0 + undef157), x1^0 -> (0 + undef158), x2^0 -> (0 + undef161), x3^0 -> (0 + undef162)}> (0 + x0^0), oldX1^0 -> (0 + x1^0), oldX2^0 -> (0 + x2^0), oldX3^0 -> (0 + x3^0), oldX4^0 -> undef175, oldX5^0 -> undef176, oldX6^0 -> undef177, oldX7^0 -> undef178, x0^0 -> (0 + undef175), x1^0 -> (0 + undef176), x2^0 -> (0 + undef177), x3^0 -> (0 + undef178)}> undef185, oldX1^0 -> undef186, oldX2^0 -> (0 + x2^0), oldX3^0 -> (0 + x3^0), oldX4^0 -> undef189, oldX5^0 -> undef190, x0^0 -> (0 + undef185), x1^0 -> (0 + undef186), x2^0 -> (0 + undef189), x3^0 -> (0 + undef190)}> Fresh variables: undef3, undef4, undef5, undef6, undef17, undef18, undef19, undef20, undef45, undef46, undef47, undef49, undef59, undef60, undef61, undef73, undef74, undef75, undef77, undef87, undef88, undef89, undef91, undef101, undef102, undef103, undef105, undef115, undef116, undef119, undef133, undef134, undef135, undef136, undef143, undef144, undef147, undef148, undef157, undef158, undef161, undef162, undef175, undef176, undef177, undef178, undef185, undef186, undef189, undef190, Undef variables: undef3, undef4, undef5, undef6, undef17, undef18, undef19, undef20, undef45, undef46, undef47, undef49, undef59, undef60, undef61, undef73, undef74, undef75, undef77, undef87, undef88, undef89, undef91, undef101, undef102, undef103, undef105, undef115, undef116, undef119, undef133, undef134, undef135, undef136, undef143, undef144, undef147, undef148, undef157, undef158, undef161, undef162, undef175, undef176, undef177, undef178, undef185, undef186, undef189, undef190, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef175), x1^0 -> (0 + undef176), x2^0 -> (0 + undef177), x3^0 -> (0 + undef178)}> (0 + undef59), x1^0 -> (0 + undef60), x2^0 -> (0 + undef61), x3^0 -> (0 + undef61)}> (0 + undef101), x1^0 -> (0 + undef102), x2^0 -> (0 + undef103), x3^0 -> (0 + undef105)}> (0 + undef133), x1^0 -> (0 + undef134), x2^0 -> (0 + undef135), x3^0 -> (0 + undef136)}> (0 + undef175), x1^0 -> (0 + undef176), x2^0 -> (0 + undef177), x3^0 -> (0 + undef178)}> (0 + undef59), x1^0 -> (0 + undef60), x2^0 -> (0 + undef61), x3^0 -> (0 + undef61)}> (0 + undef175), x1^0 -> (0 + undef176), x2^0 -> (0 + undef177), x3^0 -> (0 + undef178)}> (0 + undef59), x1^0 -> (0 + undef60), x2^0 -> (0 + undef61), x3^0 -> (0 + undef61)}> (0 + undef101), x1^0 -> (0 + undef102), x2^0 -> (0 + undef103), x3^0 -> (0 + undef105)}> (0 + undef175), x1^0 -> (0 + undef176), x2^0 -> (0 + undef177), x3^0 -> (0 + undef178)}> (0 + undef59), x1^0 -> (0 + undef60), x2^0 -> (0 + undef61), x3^0 -> (0 + undef61)}> (0 + undef101), x1^0 -> (0 + undef102), x2^0 -> (0 + undef103), x3^0 -> (0 + undef105)}> (0 + undef133), x1^0 -> (0 + undef134), x2^0 -> (0 + undef135), x3^0 -> (0 + undef136)}> (0 + undef175), x1^0 -> (0 + undef176), x2^0 -> (0 + undef177), x3^0 -> (0 + undef178)}> (0 + undef59), x1^0 -> (0 + undef60), x2^0 -> (0 + undef61), x3^0 -> (0 + undef61)}> (0 + undef101), x1^0 -> (0 + undef102), x2^0 -> (0 + undef103), x3^0 -> (0 + undef105)}> (0 + undef133), x1^0 -> (0 + undef134), x2^0 -> (0 + undef135), x3^0 -> (0 + undef136)}> (0 + undef175), x1^0 -> (0 + undef176), x2^0 -> (0 + undef177), x3^0 -> (0 + undef178)}> (0 + undef175), x1^0 -> (0 + undef176), x2^0 -> (0 + undef177), x3^0 -> (0 + undef178)}> (0 + undef17), x1^0 -> (0 + undef18), x2^0 -> (0 + undef19), x3^0 -> (~(1) + undef20)}> (0 + undef175), x1^0 -> (0 + undef176), x2^0 -> (0 + undef177), x3^0 -> (0 + undef178)}> (0 + undef59), x1^0 -> (0 + undef60), x2^0 -> (0 + undef61), x3^0 -> (0 + undef61)}> (0 + undef101), x1^0 -> (0 + undef102), x2^0 -> (0 + undef103), x3^0 -> (0 + undef105)}> Fresh variables: undef3, undef4, undef5, undef6, undef17, undef18, undef19, undef20, undef45, undef46, undef47, undef49, undef59, undef60, undef61, undef73, undef74, undef75, undef77, undef87, undef88, undef89, undef91, undef101, undef102, undef103, undef105, undef115, undef116, undef119, undef133, undef134, undef135, undef136, undef143, undef144, undef147, undef148, undef157, undef158, undef161, undef162, undef175, undef176, undef177, undef178, undef185, undef186, undef189, undef190, Undef variables: undef3, undef4, undef5, undef6, undef17, undef18, undef19, undef20, undef45, undef46, undef47, undef49, undef59, undef60, undef61, undef73, undef74, undef75, undef77, undef87, undef88, undef89, undef91, undef101, undef102, undef103, undef105, undef115, undef116, undef119, undef133, undef134, undef135, undef136, undef143, undef144, undef147, undef148, undef157, undef158, undef161, undef162, undef175, undef176, undef177, undef178, undef185, undef186, undef189, undef190, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> Variables: __const_7^0, __const_8^0, x0^0, x1^0, x2^0, x3^0 Graph 2: Transitions: undef17, x1^0 -> undef18, x2^0 -> undef19, x3^0 -> -1 + undef20, rest remain the same}> Variables: x0^0, x1^0, x2^0, x3^0 Graph 3: Transitions: Variables: Precedence: Graph 0 Graph 1 undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> Graph 2 undef59, x1^0 -> undef60, x2^0 -> undef61, x3^0 -> undef61, rest remain the same}> undef59, x1^0 -> undef60, x2^0 -> undef61, x3^0 -> undef61, rest remain the same}> undef59, x1^0 -> undef60, x2^0 -> undef61, x3^0 -> undef61, rest remain the same}> undef59, x1^0 -> undef60, x2^0 -> undef61, x3^0 -> undef61, rest remain the same}> undef59, x1^0 -> undef60, x2^0 -> undef61, x3^0 -> undef61, rest remain the same}> undef59, x1^0 -> undef60, x2^0 -> undef61, x3^0 -> undef61, rest remain the same}> Graph 3 undef175, x1^0 -> undef176, x2^0 -> undef177, x3^0 -> undef178, rest remain the same}> undef133, x1^0 -> undef134, x2^0 -> undef135, x3^0 -> undef136, rest remain the same}> undef175, x1^0 -> undef176, x2^0 -> undef177, x3^0 -> undef178, rest remain the same}> undef175, x1^0 -> undef176, x2^0 -> undef177, x3^0 -> undef178, rest remain the same}> undef175, x1^0 -> undef176, x2^0 -> undef177, x3^0 -> undef178, rest remain the same}> undef133, x1^0 -> undef134, x2^0 -> undef135, x3^0 -> undef136, rest remain the same}> undef175, x1^0 -> undef176, x2^0 -> undef177, x3^0 -> undef178, rest remain the same}> undef133, x1^0 -> undef134, x2^0 -> undef135, x3^0 -> undef136, rest remain the same}> undef175, x1^0 -> undef176, x2^0 -> undef177, x3^0 -> undef178, rest remain the same}> undef175, x1^0 -> undef176, x2^0 -> undef177, x3^0 -> undef178, rest remain the same}> undef175, x1^0 -> undef176, x2^0 -> undef177, x3^0 -> undef178, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 2 ) ( 5 , 1 ) ( 9 , 3 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.006847 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001453s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005866s [64430 : 64437] [64430 : 64438] Successful child: 64437 [ 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: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> New Graphs: [64430 : 64446] [64430 : 64447] [64430 : 64448] [64430 : 64449] [64430 : 64450] INVARIANTS: 5: Quasi-INVARIANTS to narrow Graph: 5: 1 + x2^0 <= __const_7^0 + __const_8^0 , Narrowing transition: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> Variables: __const_7^0, __const_8^0, x0^0, x1^0, x2^0, x3^0 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001292s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006552s [64430 : 64451] [64430 : 64452] Successful child: 64451 [ 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: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, 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: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> New Graphs: [64430 : 64456] [64430 : 64457] [64430 : 64458] [64430 : 64459] [64430 : 64460] INVARIANTS: 5: Quasi-INVARIANTS to narrow Graph: 5: x2^0 <= __const_7^0 + __const_8^0 , Narrowing transition: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> Variables: __const_7^0, __const_8^0, x0^0, x1^0, x2^0, x3^0 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001264s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006535s [64430 : 64461] [64430 : 64462] Successful child: 64461 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, 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): undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> Ranking function: -__const_7^0 - __const_8^0 + x2^0 New Graphs: [64430 : 64468] [64430 : 64469] [64430 : 64470] [64430 : 64471] [64430 : 64472] INVARIANTS: 5: Quasi-INVARIANTS to narrow Graph: 5: 1 <= __const_8^0 , Narrowing transition: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef101, x1^0 -> undef102, x2^0 -> undef103, x3^0 -> undef105, rest remain the same}> Variables: __const_7^0, __const_8^0, x0^0, x1^0, x2^0, x3^0 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001330s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007235s [64430 : 64473] [64430 : 64474] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019020s Time used: 0.017825 [64430 : 64478] [64430 : 64479] Successful child: 64479 Program does NOT terminate