/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 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> ((0 + (~(1) * argc^0)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + argc^0) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 2, i^0 -> 0, s^0 -> 0}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(5)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 7}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 8}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 6}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> ((0 + (~(1) * 2)) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 5}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 9}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 16}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(2)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(1)}> (~(1) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> ((0 + 2) + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(6)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(5)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(4)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> ~(3)}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 1}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (1 + i^0), s^0 -> ((0 + i^0) + s^0)}> 0}> (1 + i^0), s^0 -> ((0 + i^0) + s^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 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 2: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 3: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 4: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 5: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 6: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 7: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 8: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 9: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 10: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 11: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 12: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 13: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 14: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 15: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 16: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 17: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 18: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 19: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 20: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 21: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 22: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 23: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 24: Transitions: 1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 25: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 26: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 27: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 28: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 29: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 30: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 31: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 32: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 33: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 34: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 35: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 36: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 37: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 38: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 39: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 40: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 41: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 42: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 43: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 44: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 45: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 46: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 47: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 48: Transitions: 2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 49: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 50: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 51: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 52: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 53: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 54: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 55: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 56: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 57: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 58: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 59: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 60: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 61: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 62: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 63: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 64: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 65: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 66: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 67: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 68: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 69: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 70: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 71: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 72: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 73: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 74: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 75: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 76: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 77: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 78: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 79: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 80: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 81: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 82: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 83: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 84: Transitions: -1 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 85: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 86: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 87: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 88: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 89: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 90: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 91: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 92: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 93: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 94: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 95: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 96: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 97: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 98: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 99: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 100: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 101: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 102: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 103: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 104: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 105: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 106: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 107: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 108: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 109: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 110: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 111: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 112: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 113: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 114: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 115: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 116: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 117: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 118: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 119: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 120: Transitions: -2 + i^0, s^0 -> i^0 + s^0, rest remain the same}> Variables: i^0, s^0 Graph 121: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 0, rest remain the same}> Graph 3 0, rest remain the same}> Graph 4 0, rest remain the same}> Graph 5 1, rest remain the same}> Graph 6 1, rest remain the same}> Graph 7 1, rest remain the same}> Graph 8 1, rest remain the same}> Graph 9 -3, rest remain the same}> Graph 10 -3, rest remain the same}> Graph 11 -3, rest remain the same}> Graph 12 -3, rest remain the same}> Graph 13 -4, rest remain the same}> Graph 14 -4, rest remain the same}> Graph 15 -4, rest remain the same}> Graph 16 -4, rest remain the same}> Graph 17 -5, rest remain the same}> Graph 18 -5, rest remain the same}> Graph 19 -5, rest remain the same}> Graph 20 -5, rest remain the same}> Graph 21 -6, rest remain the same}> Graph 22 -6, rest remain the same}> Graph 23 -6, rest remain the same}> Graph 24 -6, rest remain the same}> Graph 25 0, rest remain the same}> Graph 26 0, rest remain the same}> Graph 27 0, rest remain the same}> Graph 28 0, rest remain the same}> Graph 29 1, rest remain the same}> Graph 30 1, rest remain the same}> Graph 31 1, rest remain the same}> Graph 32 1, rest remain the same}> Graph 33 -3, rest remain the same}> Graph 34 -3, rest remain the same}> Graph 35 -3, rest remain the same}> Graph 36 -3, rest remain the same}> Graph 37 -4, rest remain the same}> Graph 38 -4, rest remain the same}> Graph 39 -4, rest remain the same}> Graph 40 -4, rest remain the same}> Graph 41 -5, rest remain the same}> Graph 42 -5, rest remain the same}> Graph 43 -5, rest remain the same}> Graph 44 -5, rest remain the same}> Graph 45 -6, rest remain the same}> Graph 46 -6, rest remain the same}> Graph 47 -6, rest remain the same}> Graph 48 -6, rest remain the same}> Graph 49 5, rest remain the same}> Graph 50 5, rest remain the same}> Graph 51 5, rest remain the same}> Graph 52 5, rest remain the same}> Graph 53 6, rest remain the same}> Graph 54 6, rest remain the same}> Graph 55 6, rest remain the same}> Graph 56 6, rest remain the same}> Graph 57 7, rest remain the same}> Graph 58 7, rest remain the same}> Graph 59 7, rest remain the same}> Graph 60 7, rest remain the same}> Graph 61 8, rest remain the same}> Graph 62 8, rest remain the same}> Graph 63 8, rest remain the same}> Graph 64 8, rest remain the same}> Graph 65 9, rest remain the same}> Graph 66 9, rest remain the same}> Graph 67 9, rest remain the same}> Graph 68 9, rest remain the same}> Graph 69 0, rest remain the same}> Graph 70 0, rest remain the same}> Graph 71 0, rest remain the same}> Graph 72 0, rest remain the same}> Graph 73 -1, rest remain the same}> Graph 74 -1, rest remain the same}> Graph 75 -1, rest remain the same}> Graph 76 -1, rest remain the same}> Graph 77 -2, rest remain the same}> Graph 78 -2, rest remain the same}> Graph 79 -2, rest remain the same}> Graph 80 -2, rest remain the same}> Graph 81 16, rest remain the same}> Graph 82 16, rest remain the same}> Graph 83 16, rest remain the same}> Graph 84 16, rest remain the same}> Graph 85 5, rest remain the same}> Graph 86 5, rest remain the same}> Graph 87 5, rest remain the same}> Graph 88 5, rest remain the same}> Graph 89 6, rest remain the same}> Graph 90 6, rest remain the same}> Graph 91 6, rest remain the same}> Graph 92 6, rest remain the same}> Graph 93 7, rest remain the same}> Graph 94 7, rest remain the same}> Graph 95 7, rest remain the same}> Graph 96 7, rest remain the same}> Graph 97 8, rest remain the same}> Graph 98 8, rest remain the same}> Graph 99 8, rest remain the same}> Graph 100 8, rest remain the same}> Graph 101 9, rest remain the same}> Graph 102 9, rest remain the same}> Graph 103 9, rest remain the same}> Graph 104 9, rest remain the same}> Graph 105 0, rest remain the same}> Graph 106 0, rest remain the same}> Graph 107 0, rest remain the same}> Graph 108 0, rest remain the same}> Graph 109 -1, rest remain the same}> Graph 110 -1, rest remain the same}> Graph 111 -1, rest remain the same}> Graph 112 -1, rest remain the same}> Graph 113 -2, rest remain the same}> Graph 114 -2, rest remain the same}> Graph 115 -2, rest remain the same}> Graph 116 -2, rest remain the same}> Graph 117 16, rest remain the same}> Graph 118 16, rest remain the same}> Graph 119 16, rest remain the same}> Graph 120 16, rest remain the same}> Graph 121 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 42 ) ( 3 , 43 ) ( 5 , 44 ) ( 7 , 45 ) ( 9 , 46 ) ( 11 , 47 ) ( 14 , 121 ) ( 15 , 120 ) ( 17 , 119 ) ( 18 , 48 ) ( 21 , 118 ) ( 23 , 117 ) ( 25 , 116 ) ( 26 , 49 ) ( 28 , 114 ) ( 31 , 115 ) ( 32 , 50 ) ( 35 , 113 ) ( 36 , 51 ) ( 39 , 112 ) ( 40 , 52 ) ( 43 , 111 ) ( 45 , 110 ) ( 47 , 109 ) ( 48 , 53 ) ( 51 , 108 ) ( 53 , 107 ) ( 54 , 54 ) ( 57 , 106 ) ( 59 , 105 ) ( 60 , 55 ) ( 63 , 104 ) ( 64 , 56 ) ( 67 , 103 ) ( 69 , 102 ) ( 71 , 101 ) ( 72 , 57 ) ( 75 , 100 ) ( 77 , 99 ) ( 78 , 58 ) ( 81 , 98 ) ( 82 , 59 ) ( 85 , 97 ) ( 87 , 96 ) ( 88 , 60 ) ( 91 , 95 ) ( 93 , 94 ) ( 95 , 93 ) ( 96 , 61 ) ( 99 , 92 ) ( 100 , 62 ) ( 103 , 91 ) ( 105 , 90 ) ( 106 , 63 ) ( 109 , 89 ) ( 110 , 64 ) ( 113 , 88 ) ( 115 , 87 ) ( 117 , 86 ) ( 119 , 85 ) ( 120 , 65 ) ( 123 , 84 ) ( 124 , 66 ) ( 127 , 83 ) ( 129 , 82 ) ( 130 , 67 ) ( 133 , 81 ) ( 134 , 68 ) ( 137 , 80 ) ( 139 , 79 ) ( 141 , 78 ) ( 142 , 69 ) ( 145 , 77 ) ( 147 , 76 ) ( 148 , 70 ) ( 151 , 75 ) ( 152 , 71 ) ( 155 , 74 ) ( 157 , 73 ) ( 158 , 72 ) ( 161 , 41 ) ( 163 , 40 ) ( 165 , 39 ) ( 167 , 38 ) ( 169 , 37 ) ( 171 , 36 ) ( 173 , 35 ) ( 175 , 34 ) ( 177 , 33 ) ( 179 , 32 ) ( 181 , 31 ) ( 183 , 30 ) ( 185 , 29 ) ( 187 , 28 ) ( 189 , 27 ) ( 191 , 26 ) ( 193 , 25 ) ( 195 , 24 ) ( 197 , 23 ) ( 199 , 22 ) ( 201 , 21 ) ( 203 , 20 ) ( 205 , 19 ) ( 207 , 18 ) ( 209 , 17 ) ( 211 , 16 ) ( 213 , 15 ) ( 215 , 14 ) ( 217 , 13 ) ( 219 , 12 ) ( 221 , 11 ) ( 223 , 10 ) ( 225 , 9 ) ( 227 , 8 ) ( 229 , 7 ) ( 231 , 6 ) ( 233 , 5 ) ( 235 , 4 ) ( 237 , 3 ) ( 239 , 2 ) ( 241 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00194 Checking conditional termination of SCC {l241}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001063s Ranking function: 2 - i^0 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001557 Checking conditional termination of SCC {l239}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001074s Ranking function: 3 - i^0 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.00154 Checking conditional termination of SCC {l237}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001091s Ranking function: 2 - i^0 New Graphs: Proving termination of subgraph 4 Checking unfeasibility... Time used: 0.001544 Checking conditional termination of SCC {l235}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001040s Ranking function: 3 - i^0 New Graphs: Proving termination of subgraph 5 Checking unfeasibility... Time used: 0.001653 Checking conditional termination of SCC {l233}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001086s Ranking function: 1 - i^0 New Graphs: Proving termination of subgraph 6 Checking unfeasibility... Time used: 0.001649 Checking conditional termination of SCC {l231}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001164s Ranking function: 2 - i^0 New Graphs: Proving termination of subgraph 7 Checking unfeasibility... Time used: 0.00166 Checking conditional termination of SCC {l229}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001148s Ranking function: 1 - i^0 New Graphs: Proving termination of subgraph 8 Checking unfeasibility... Time used: 0.001666 Checking conditional termination of SCC {l227}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001162s Ranking function: 2 - i^0 New Graphs: Proving termination of subgraph 9 Checking unfeasibility... Time used: 0.0044 Checking conditional termination of SCC {l225}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001212s Ranking function: -3 - i^0 New Graphs: Proving termination of subgraph 10 Checking unfeasibility... Time used: 0.001898 Checking conditional termination of SCC {l223}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001179s Ranking function: -2 - i^0 New Graphs: Proving termination of subgraph 11 Checking unfeasibility... Time used: 0.004376 Checking conditional termination of SCC {l221}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001181s Ranking function: -3 - i^0 New Graphs: Proving termination of subgraph 12 Checking unfeasibility... Time used: 0.001903 Checking conditional termination of SCC {l219}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001168s Ranking function: -2 - i^0 New Graphs: Proving termination of subgraph 13 Checking unfeasibility... Time used: 0.001919 Checking conditional termination of SCC {l217}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001156s Ranking function: -2 - i^0 New Graphs: Proving termination of subgraph 14 Checking unfeasibility... Time used: 0.001851 Checking conditional termination of SCC {l215}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001460s Ranking function: -1 - i^0 New Graphs: Proving termination of subgraph 15 Checking unfeasibility... Time used: 0.001861 Checking conditional termination of SCC {l213}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001281s Ranking function: -2 - i^0 New Graphs: Proving termination of subgraph 16 Checking unfeasibility... Time used: 0.001879 Checking conditional termination of SCC {l211}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001407s Ranking function: -1 - i^0 New Graphs: Proving termination of subgraph 17 Checking unfeasibility... Time used: 0.00189 Checking conditional termination of SCC {l209}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001423s Ranking function: -1 - i^0 New Graphs: Proving termination of subgraph 18 Checking unfeasibility... Time used: 0.001722 Checking conditional termination of SCC {l207}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001489s Ranking function: -i^0 New Graphs: Proving termination of subgraph 19 Checking unfeasibility... Time used: 0.001897 Checking conditional termination of SCC {l205}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001500s Ranking function: -1 - i^0 New Graphs: Proving termination of subgraph 20 Checking unfeasibility... Time used: 0.001734 Checking conditional termination of SCC {l203}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001484s Ranking function: -i^0 New Graphs: Proving termination of subgraph 21 Checking unfeasibility... Time used: 0.001907 Checking conditional termination of SCC {l201}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001320s Ranking function: 3 - i^0 New Graphs: Proving termination of subgraph 22 Checking unfeasibility... Time used: 0.001889 Checking conditional termination of SCC {l199}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001361s Ranking function: 4 - i^0 New Graphs: Proving termination of subgraph 23 Checking unfeasibility... Time used: 0.001902 Checking conditional termination of SCC {l197}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001366s Ranking function: 3 - i^0 New Graphs: Proving termination of subgraph 24 Checking unfeasibility... Time used: 0.001916 Checking conditional termination of SCC {l195}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001358s Ranking function: 4 - i^0 New Graphs: Proving termination of subgraph 25 Checking unfeasibility... Time used: 0.001871 Checking conditional termination of SCC {l193}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001430s Ranking function: 1 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 26 Checking unfeasibility... Time used: 0.001908 Checking conditional termination of SCC {l191}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001431s Ranking function: (3 / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 27 Checking unfeasibility... Time used: 0.001916 Checking conditional termination of SCC {l189}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001467s Ranking function: 1 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 28 Checking unfeasibility... Time used: 0.001897 Checking conditional termination of SCC {l187}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001485s Ranking function: (3 / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 29 Checking unfeasibility... Time used: 0.004978 Checking conditional termination of SCC {l185}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001407s Ranking function: (1 / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 30 Checking unfeasibility... Time used: 0.004765 Checking conditional termination of SCC {l183}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001414s Ranking function: 1 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 31 Checking unfeasibility... Time used: 0.004781 Checking conditional termination of SCC {l181}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001426s Ranking function: (1 / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 32 Checking unfeasibility... Time used: 0.004683 Checking conditional termination of SCC {l179}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001497s Ranking function: 1 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 33 Checking unfeasibility... Time used: 0.009332 Checking conditional termination of SCC {l177}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001480s Ranking function: (~(3) / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 34 Checking unfeasibility... Time used: 0.006096 Checking conditional termination of SCC {l175}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001752s Ranking function: -1 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 35 Checking unfeasibility... Time used: 0.009407 Checking conditional termination of SCC {l173}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001516s Ranking function: (~(3) / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 36 Checking unfeasibility... Time used: 0.006103 Checking conditional termination of SCC {l171}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001736s Ranking function: -1 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 37 Checking unfeasibility... Time used: 0.006297 Checking conditional termination of SCC {l169}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001754s Ranking function: -1 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 38 Checking unfeasibility... Time used: 0.0061 Checking conditional termination of SCC {l167}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001564s Ranking function: (~(1) / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 39 Checking unfeasibility... Time used: 0.006351 Checking conditional termination of SCC {l165}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001791s Ranking function: -1 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 40 Checking unfeasibility... Time used: 0.006119 Checking conditional termination of SCC {l163}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001600s Ranking function: (~(1) / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 41 Checking unfeasibility... Time used: 0.006119 Checking conditional termination of SCC {l161}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001798s Ranking function: (~(1) / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 42 Checking unfeasibility... Time used: 0.002238 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001895s Ranking function: (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 43 Checking unfeasibility... Time used: 0.006352 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001840s Ranking function: (~(1) / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 44 Checking unfeasibility... Time used: 0.002255 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001841s Ranking function: (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 45 Checking unfeasibility... Time used: 0.002317 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001677s Ranking function: (3 / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 46 Checking unfeasibility... Time used: 0.002296 Checking conditional termination of SCC {l9}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001738s Ranking function: 2 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 47 Checking unfeasibility... Time used: 0.002321 Checking conditional termination of SCC {l11}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001706s Ranking function: (3 / 2) + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 48 Checking unfeasibility... Time used: 0.002332 Checking conditional termination of SCC {l18}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001732s Ranking function: 2 + (~(1) / 2)*i^0 New Graphs: Proving termination of subgraph 49 Checking unfeasibility... Time used: 0.005228 Checking conditional termination of SCC {l26}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001879s Ranking function: -3 + i^0 New Graphs: Proving termination of subgraph 50 Checking unfeasibility... Time used: 0.002145 Checking conditional termination of SCC {l32}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001719s Ranking function: -2 + i^0 New Graphs: Proving termination of subgraph 51 Checking unfeasibility... Time used: 0.005276 Checking conditional termination of SCC {l36}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001743s Ranking function: -3 + i^0 New Graphs: Proving termination of subgraph 52 Checking unfeasibility... Time used: 0.002176 Checking conditional termination of SCC {l40}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001796s Ranking function: -2 + i^0 New Graphs: Proving termination of subgraph 53 Checking unfeasibility... Time used: 0.002199 Checking conditional termination of SCC {l48}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001752s Ranking function: -2 + i^0 New Graphs: Proving termination of subgraph 54 Checking unfeasibility... Time used: 0.002136 Checking conditional termination of SCC {l54}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001777s Ranking function: -1 + i^0 New Graphs: Proving termination of subgraph 55 Checking unfeasibility... Time used: 0.002137 Checking conditional termination of SCC {l60}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001839s Ranking function: -2 + i^0 New Graphs: Proving termination of subgraph 56 Checking unfeasibility... Time used: 0.002139 Checking conditional termination of SCC {l64}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001779s Ranking function: -1 + i^0 New Graphs: Proving termination of subgraph 57 Checking unfeasibility... Time used: 0.00216 Checking conditional termination of SCC {l72}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001854s Ranking function: -1 + i^0 New Graphs: Proving termination of subgraph 58 Checking unfeasibility... Time used: 0.001985 Checking conditional termination of SCC {l78}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001818s Ranking function: i^0 New Graphs: Proving termination of subgraph 59 Checking unfeasibility... Time used: 0.002157 Checking conditional termination of SCC {l82}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001872s Ranking function: -1 + i^0 New Graphs: Proving termination of subgraph 60 Checking unfeasibility... Time used: 0.001985 Checking conditional termination of SCC {l88}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001846s Ranking function: i^0 New Graphs: Proving termination of subgraph 61 Checking unfeasibility... Time used: 0.002044 Checking conditional termination of SCC {l96}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001921s Ranking function: i^0 New Graphs: Proving termination of subgraph 62 Checking unfeasibility... Time used: 0.002056 Checking conditional termination of SCC {l100}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001893s Ranking function: 1 + i^0 New Graphs: Proving termination of subgraph 63 Checking unfeasibility... Time used: 0.002061 Checking conditional termination of SCC {l106}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001949s Ranking function: i^0 New Graphs: Proving termination of subgraph 64 Checking unfeasibility... Time used: 0.002069 Checking conditional termination of SCC {l110}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001924s Ranking function: 1 + i^0 New Graphs: Proving termination of subgraph 65 Checking unfeasibility... Time used: 0.002076 Checking conditional termination of SCC {l120}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002005s Ranking function: 1 + i^0 New Graphs: Proving termination of subgraph 66 Checking unfeasibility... Time used: 0.002094 Checking conditional termination of SCC {l124}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001892s Ranking function: 2 + i^0 New Graphs: Proving termination of subgraph 67 Checking unfeasibility... Time used: 0.002141 Checking conditional termination of SCC {l130}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002032s Ranking function: 1 + i^0 New Graphs: Proving termination of subgraph 68 Checking unfeasibility... Time used: 0.002099 Checking conditional termination of SCC {l134}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002054s Ranking function: 2 + i^0 New Graphs: Proving termination of subgraph 69 Checking unfeasibility... Time used: 0.001991 Checking conditional termination of SCC {l142}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002028s Ranking function: 2 + i^0 New Graphs: Proving termination of subgraph 70 Checking unfeasibility... Time used: 0.001983 Checking conditional termination of SCC {l148}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002037s Ranking function: 3 + i^0 New Graphs: Proving termination of subgraph 71 Checking unfeasibility... Time used: 0.002004 Checking conditional termination of SCC {l152}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002047s Ranking function: 2 + i^0 New Graphs: Proving termination of subgraph 72 Checking unfeasibility... Time used: 0.002004 Checking conditional termination of SCC {l158}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002061s Ranking function: 3 + i^0 New Graphs: Proving termination of subgraph 73 Checking unfeasibility... Time used: 0.002152 Checking conditional termination of SCC {l157}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002075s Ranking function: 4 + i^0 New Graphs: Proving termination of subgraph 74 Checking unfeasibility... Time used: 0.002151 Checking conditional termination of SCC {l155}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002073s Ranking function: 5 + i^0 New Graphs: Proving termination of subgraph 75 Checking unfeasibility... Time used: 0.002179 Checking conditional termination of SCC {l151}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002089s Ranking function: 4 + i^0 New Graphs: Proving termination of subgraph 76 Checking unfeasibility... Time used: 0.002181 Checking conditional termination of SCC {l147}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002115s Ranking function: 5 + i^0 New Graphs: Proving termination of subgraph 77 Checking unfeasibility... Time used: 0.005029 Checking conditional termination of SCC {l145}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002026s Ranking function: 6 + i^0 New Graphs: Proving termination of subgraph 78 Checking unfeasibility... Time used: 0.00495 Checking conditional termination of SCC {l141}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002157s Ranking function: 7 + i^0 New Graphs: Proving termination of subgraph 79 Checking unfeasibility... Time used: 0.004888 Checking conditional termination of SCC {l139}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002118s Ranking function: 6 + i^0 New Graphs: Proving termination of subgraph 80 Checking unfeasibility... Time used: 0.005003 Checking conditional termination of SCC {l137}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002039s Ranking function: 7 + i^0 New Graphs: Proving termination of subgraph 81 Checking unfeasibility... Time used: 0.002208 Checking conditional termination of SCC {l133}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002221s Ranking function: 7 + i^0 New Graphs: Proving termination of subgraph 82 Checking unfeasibility... Time used: 0.002205 Checking conditional termination of SCC {l129}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002128s Ranking function: 8 + i^0 New Graphs: Proving termination of subgraph 83 Checking unfeasibility... Time used: 0.002241 Checking conditional termination of SCC {l127}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002129s Ranking function: 7 + i^0 New Graphs: Proving termination of subgraph 84 Checking unfeasibility... Time used: 0.002227 Checking conditional termination of SCC {l123}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002201s Ranking function: 8 + i^0 New Graphs: Proving termination of subgraph 85 Checking unfeasibility... Time used: 0.011436 Checking conditional termination of SCC {l119}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002171s Ranking function: (~(3) / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 86 Checking unfeasibility... Time used: 0.006745 Checking conditional termination of SCC {l117}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002183s Ranking function: -1 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 87 Checking unfeasibility... Time used: 0.01174 Checking conditional termination of SCC {l115}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002298s Ranking function: (~(3) / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 88 Checking unfeasibility... Time used: 0.006948 Checking conditional termination of SCC {l113}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002224s Ranking function: -1 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 89 Checking unfeasibility... Time used: 0.008108 Checking conditional termination of SCC {l109}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002306s Ranking function: -1 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 90 Checking unfeasibility... Time used: 0.007627 Checking conditional termination of SCC {l105}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002509s Ranking function: (~(1) / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 91 Checking unfeasibility... Time used: 0.007513 Checking conditional termination of SCC {l103}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002574s Ranking function: -1 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 92 Checking unfeasibility... Time used: 0.007675 Checking conditional termination of SCC {l99}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002367s Ranking function: (~(1) / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 93 Checking unfeasibility... Time used: 0.007161 Checking conditional termination of SCC {l95}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002608s Ranking function: (~(1) / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 94 Checking unfeasibility... Time used: 0.002662 Checking conditional termination of SCC {l93}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002310s Ranking function: (1 / 2)*i^0 New Graphs: Proving termination of subgraph 95 Checking unfeasibility... Time used: 0.007445 Checking conditional termination of SCC {l91}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002363s Ranking function: (~(1) / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 96 Checking unfeasibility... Time used: 0.002677 Checking conditional termination of SCC {l87}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002336s Ranking function: (1 / 2)*i^0 New Graphs: Proving termination of subgraph 97 Checking unfeasibility... Time used: 0.002707 Checking conditional termination of SCC {l85}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002354s Ranking function: (1 / 2)*i^0 New Graphs: Proving termination of subgraph 98 Checking unfeasibility... Time used: 0.002716 Checking conditional termination of SCC {l81}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002326s Ranking function: (1 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 99 Checking unfeasibility... Time used: 0.002748 Checking conditional termination of SCC {l77}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002368s Ranking function: (1 / 2)*i^0 New Graphs: Proving termination of subgraph 100 Checking unfeasibility... Time used: 0.002733 Checking conditional termination of SCC {l75}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002531s Ranking function: (1 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 101 Checking unfeasibility... Time used: 0.002762 Checking conditional termination of SCC {l71}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002396s Ranking function: (1 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 102 Checking unfeasibility... Time used: 0.002737 Checking conditional termination of SCC {l69}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002582s Ranking function: 1 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 103 Checking unfeasibility... Time used: 0.00279 Checking conditional termination of SCC {l67}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002421s Ranking function: (1 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 104 Checking unfeasibility... Time used: 0.002751 Checking conditional termination of SCC {l63}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002592s Ranking function: 1 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 105 Checking unfeasibility... Time used: 0.002457 Checking conditional termination of SCC {l59}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002511s Ranking function: 1 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 106 Checking unfeasibility... Time used: 0.00245 Checking conditional termination of SCC {l57}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002548s Ranking function: (3 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 107 Checking unfeasibility... Time used: 0.002474 Checking conditional termination of SCC {l53}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002531s Ranking function: 1 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 108 Checking unfeasibility... Time used: 0.002451 Checking conditional termination of SCC {l51}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002580s Ranking function: (3 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 109 Checking unfeasibility... Time used: 0.006143 Checking conditional termination of SCC {l47}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002727s Ranking function: 2 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 110 Checking unfeasibility... Time used: 0.006052 Checking conditional termination of SCC {l45}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002802s Ranking function: (5 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 111 Checking unfeasibility... Time used: 0.006108 Checking conditional termination of SCC {l43}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002620s Ranking function: 2 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 112 Checking unfeasibility... Time used: 0.006156 Checking conditional termination of SCC {l39}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002643s Ranking function: (5 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 113 Checking unfeasibility... Time used: 0.012787 Checking conditional termination of SCC {l35}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002635s Ranking function: 3 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 114 Checking unfeasibility... Time used: 0.013106 Checking conditional termination of SCC {l28}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002579s Ranking function: (7 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 115 Checking unfeasibility... Time used: 0.01322 Checking conditional termination of SCC {l31}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002594s Ranking function: 3 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 116 Checking unfeasibility... Time used: 0.01287 Checking conditional termination of SCC {l25}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002677s Ranking function: (7 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 117 Checking unfeasibility... Time used: 0.002884 Checking conditional termination of SCC {l23}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002707s Ranking function: (7 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 118 Checking unfeasibility... Time used: 0.002877 Checking conditional termination of SCC {l21}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002758s Ranking function: 4 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 119 Checking unfeasibility... Time used: 0.002892 Checking conditional termination of SCC {l17}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002692s Ranking function: (7 / 2) + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 120 Checking unfeasibility... Time used: 0.002888 Checking conditional termination of SCC {l15}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002737s Ranking function: 4 + (1 / 2)*i^0 New Graphs: Proving termination of subgraph 121 Analyzing SCC {l14}... No cycles found. Program Terminates