2023-12-09 10:56:23 +00:00
|
|
|
import os
|
2023-12-09 13:38:48 +00:00
|
|
|
import random
|
|
|
|
import sys
|
2023-12-09 10:56:23 +00:00
|
|
|
|
2023-12-09 11:13:56 +00:00
|
|
|
import frozendict
|
2023-12-09 13:38:48 +00:00
|
|
|
import tqdm
|
2023-12-09 10:56:23 +00:00
|
|
|
from deap import creator, base, tools, algorithms
|
|
|
|
|
|
|
|
import fuzzer
|
|
|
|
import instrument
|
2023-12-09 13:38:48 +00:00
|
|
|
from fuzzer import generate_test_case, get_test_class
|
2023-12-09 10:56:23 +00:00
|
|
|
|
|
|
|
INDMUPROB = 0.05
|
2023-12-09 13:38:48 +00:00
|
|
|
MUPROB = 0.33
|
|
|
|
CXPROB = 0.33
|
2023-12-09 10:56:23 +00:00
|
|
|
TOURNSIZE = 3
|
2023-12-09 13:38:48 +00:00
|
|
|
NPOP = 1000
|
2023-12-09 10:56:23 +00:00
|
|
|
NGEN = 200
|
2023-12-09 13:38:48 +00:00
|
|
|
REPS = 10
|
2023-12-09 10:56:23 +00:00
|
|
|
|
|
|
|
to_test: str = ""
|
|
|
|
|
|
|
|
OUT_DIR = os.path.join(os.path.dirname(__file__), "tests")
|
|
|
|
|
|
|
|
|
|
|
|
def normalize(x):
|
|
|
|
return x / (1.0 + x)
|
|
|
|
|
|
|
|
|
2023-12-09 13:38:48 +00:00
|
|
|
def init_deap():
|
|
|
|
creator.create("Fitness", base.Fitness, weights=(-1.0,))
|
|
|
|
creator.create("Individual", list, fitness=creator.Fitness)
|
|
|
|
|
|
|
|
|
|
|
|
def taken_branches_descriptor() -> str:
|
|
|
|
branch_ids = sorted([f"{branch:2d}T" for branch in instrument.archive_true_branches.keys()] +
|
|
|
|
[f"{branch:2d}F" for branch in instrument.archive_false_branches.keys()])
|
|
|
|
return ' '.join([branch.strip() for branch in branch_ids])
|
2023-12-09 10:56:23 +00:00
|
|
|
|
|
|
|
|
|
|
|
def generate(f_name: str):
|
|
|
|
global to_test
|
|
|
|
to_test = f_name
|
|
|
|
|
2023-12-09 13:38:48 +00:00
|
|
|
orig_name = instrument.BranchTransformer.to_original_name(f_name)
|
2023-12-09 10:56:23 +00:00
|
|
|
|
|
|
|
args = instrument.functions[f_name]
|
|
|
|
|
|
|
|
toolbox = base.Toolbox()
|
2023-12-09 13:38:48 +00:00
|
|
|
toolbox.register("attr_test_case", lambda: list(generate_test_case(f_name, args).items()))
|
2023-12-09 11:43:16 +00:00
|
|
|
toolbox.register("individual", tools.initIterate, creator.Individual, lambda: toolbox.attr_test_case())
|
|
|
|
toolbox.register("population", tools.initRepeat, list, toolbox.individual)
|
2023-12-09 11:13:56 +00:00
|
|
|
toolbox.register("evaluate", compute_fitness)
|
2023-12-09 10:56:23 +00:00
|
|
|
|
|
|
|
def mate(tc1, tc2):
|
|
|
|
t1, t2 = frozendict.frozendict(tc1), frozendict.frozendict(tc2)
|
|
|
|
o1, o2 = fuzzer.crossover(t1, t2, args)
|
|
|
|
i1, i2 = creator.Individual(o1.items()), creator.Individual(o2.items())
|
|
|
|
return i1, i2
|
|
|
|
|
|
|
|
def mutate(tc):
|
|
|
|
t = frozendict.frozendict(tc)
|
|
|
|
o = fuzzer.mutate(t, args)
|
|
|
|
i1 = creator.Individual(o.items())
|
|
|
|
return i1,
|
|
|
|
|
|
|
|
toolbox.register("mate", mate)
|
|
|
|
toolbox.register("mutate", mutate)
|
|
|
|
toolbox.register("select", tools.selTournament, tournsize=TOURNSIZE)
|
|
|
|
|
2023-12-09 13:38:48 +00:00
|
|
|
top_result = set()
|
|
|
|
top_coverage = 0
|
|
|
|
|
|
|
|
range_start, range_end = instrument.n_of_branches[to_test]
|
|
|
|
total_branches = (range_end - range_start) * 2 # *2 because of True and False
|
|
|
|
|
2023-12-09 10:56:23 +00:00
|
|
|
coverage = []
|
|
|
|
for i in range(REPS):
|
|
|
|
instrument.archive_true_branches = {}
|
|
|
|
instrument.archive_false_branches = {}
|
|
|
|
population = toolbox.population(n=NPOP)
|
2023-12-09 13:38:48 +00:00
|
|
|
|
|
|
|
algorithms.eaSimple(population, toolbox, CXPROB, MUPROB, NGEN, verbose=False)
|
|
|
|
|
|
|
|
true_covered = len(instrument.archive_true_branches.keys())
|
|
|
|
false_covered = len(instrument.archive_false_branches.keys())
|
|
|
|
tot_covered = true_covered + false_covered
|
|
|
|
|
|
|
|
cov: float = (tot_covered / total_branches) * 100
|
2023-12-09 10:56:23 +00:00
|
|
|
coverage.append(cov)
|
|
|
|
|
2023-12-09 13:38:48 +00:00
|
|
|
branches = taken_branches_descriptor()
|
|
|
|
print(f"{orig_name}: rep #{i:02d}: Cov: {cov:02.02f}% ({tot_covered}/{total_branches} branches): {branches}")
|
|
|
|
|
|
|
|
if cov > top_coverage:
|
|
|
|
top_result = set(list(instrument.archive_true_branches.values()) +
|
|
|
|
list(instrument.archive_false_branches.values()))
|
|
|
|
top_coverage = cov
|
|
|
|
|
2023-12-09 10:56:23 +00:00
|
|
|
print(coverage)
|
2023-12-09 13:38:48 +00:00
|
|
|
|
|
|
|
return top_result
|
2023-12-09 10:56:23 +00:00
|
|
|
|
|
|
|
|
2023-12-09 11:13:56 +00:00
|
|
|
def compute_fitness(individual: list) -> tuple[float]:
|
|
|
|
x = frozendict.frozendict(individual)
|
2023-12-09 10:56:23 +00:00
|
|
|
range_start, range_end = instrument.n_of_branches[to_test]
|
|
|
|
|
|
|
|
# Reset any distance values from previous executions
|
|
|
|
instrument.distances_true = {}
|
|
|
|
instrument.distances_false = {}
|
|
|
|
|
2023-12-09 11:43:16 +00:00
|
|
|
# the archive_true_branches and archive_false_branches are reset after
|
|
|
|
# each generation. This is intentional as they are used to archive branches that
|
|
|
|
# have already been covered, and their presence increases the fitness value of
|
|
|
|
# test cases that would re-cover them
|
|
|
|
|
2023-12-09 11:13:56 +00:00
|
|
|
# Run the function under test
|
|
|
|
try:
|
|
|
|
out = instrument.invoke(to_test, x)
|
|
|
|
except AssertionError:
|
2023-12-09 13:38:48 +00:00
|
|
|
# print(to_test, x, "=", "[FAILS] fitness = 100.0")
|
2023-12-09 11:43:16 +00:00
|
|
|
return 100.0,
|
2023-12-09 11:13:56 +00:00
|
|
|
|
2023-12-09 10:56:23 +00:00
|
|
|
fitness = 0.0
|
2023-12-09 11:13:56 +00:00
|
|
|
|
|
|
|
# Sum up branch distances
|
|
|
|
for branch in range(range_start, range_end):
|
|
|
|
if branch in instrument.distances_true:
|
|
|
|
if instrument.distances_true[branch] == 0 and branch not in instrument.archive_true_branches:
|
|
|
|
instrument.archive_true_branches[branch] = x
|
|
|
|
if branch not in instrument.archive_true_branches:
|
|
|
|
fitness += normalize(instrument.distances_true[branch])
|
2023-12-09 13:38:48 +00:00
|
|
|
|
|
|
|
for branch in range(range_start, range_end):
|
|
|
|
if branch in instrument.distances_false:
|
2023-12-09 11:13:56 +00:00
|
|
|
if instrument.distances_false[branch] == 0 and branch not in instrument.archive_false_branches:
|
|
|
|
instrument.archive_false_branches[branch] = x
|
|
|
|
if branch not in instrument.archive_false_branches:
|
|
|
|
fitness += normalize(instrument.distances_false[branch])
|
2023-12-09 11:43:16 +00:00
|
|
|
|
2023-12-09 13:38:48 +00:00
|
|
|
# print(to_test, x, "=", out, "fitness =", fitness)
|
2023-12-09 10:56:23 +00:00
|
|
|
return fitness,
|
|
|
|
|
|
|
|
|
2023-12-09 13:38:48 +00:00
|
|
|
def build_suite(f_name: str):
|
|
|
|
instr_name = instrument.BranchTransformer.to_instrumented_name(f_name)
|
|
|
|
cases = generate(instr_name)
|
|
|
|
with open(os.path.join(OUT_DIR, f_name + ".py"), "w") as f:
|
|
|
|
f.write(get_test_class(instr_name, cases))
|
|
|
|
|
|
|
|
|
2023-12-09 10:56:23 +00:00
|
|
|
def main():
|
2023-12-09 13:38:48 +00:00
|
|
|
random.seed(0) # init random seed
|
2023-12-09 10:56:23 +00:00
|
|
|
instrument.load_benchmark(save_instrumented=False) # instrument all files in benchmark
|
2023-12-09 13:38:48 +00:00
|
|
|
init_deap()
|
|
|
|
|
|
|
|
for instr_f in tqdm.tqdm(sorted(instrument.functions.keys()), desc="Generating tests"):
|
|
|
|
print("", file=sys.stderr)
|
|
|
|
build_suite(instrument.BranchTransformer.to_original_name(instr_f))
|
2023-12-09 10:56:23 +00:00
|
|
|
|
|
|
|
|
|
|
|
if __name__ == '__main__':
|
|
|
|
main()
|