Implement Benchmarking Strategy: Heuristic 2 (Binary Search Strategy)

Closes #49 (closed) Please review @she Tested with unit-test with a complex input and with manual test for the following two workloads: (1 = successful experiment, in the sense that the application could handle the load, 0 = unsuccessful experiment):

Manual Workload 1

dim_value/instances	1	2
100	1	1
200	1	1

The result of the execution was as follows (executed experiments marked with 'x', not executed with 'o'):

dim_value/instances	1	2
100	x	o
200	x	o

Manual Workload 2

dim_value/instances	1	2
100	1	1
200.000	0	0

The result of the execution was as follows (executed experiments marked with 'x', not executed with 'o'):

dim_value/instances	1	2
100	x	o
200.000	x	x

execution/theodolite.py

-#!/usr/bin/env python3.7
+#!/usr/bin/env python
 
 import sys
 import os