INFO     planner time limit: None
INFO     planner memory limit: None

INFO     Running translator.
INFO     translator stdin: None
INFO     translator time limit: None
INFO     translator memory limit: None
INFO     translator command line string: /usr/bin/python3 /home/nadso/thesis/downward/builds/release/bin/translate/translate.py downward-benchmarks/blocksworld/domain.pddl downward-benchmarks/blocksworld/probBLOCKS-4-0.pddl --sas-file output.sas
Parsing...
Parsing: [0.010s CPU, 0.003s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.000s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.000s CPU, 0.002s wall-clock]
Preparing model... [0.000s CPU, 0.001s wall-clock]
Generated 19 rules.
Computing model... [0.000s CPU, 0.004s wall-clock]
129 relevant atoms
72 auxiliary atoms
201 final queue length
377 total queue pushes
Completing instantiation... [0.010s CPU, 0.003s wall-clock]
Instantiating: [0.010s CPU, 0.010s wall-clock]
Computing fact groups...
Finding invariants...
7 initial candidates
Finding invariants: [0.000s CPU, 0.002s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
4 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.000s CPU, 0.003s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Translator axioms removed by simplifying: 0
Processing axioms: [0.000s CPU, 0.000s wall-clock]
Translating task: [0.000s CPU, 0.006s wall-clock]
64 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
4 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.002s wall-clock]
Reordering and filtering variables...
8 of 8 variables necessary.
0 of 4 mutex groups necessary.
80 of 80 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.001s wall-clock]
Translator variables: 8
Translator derived variables: 0
Translator facts: 28
Translator goal facts: 3
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 80
Translator axioms: 0
Translator task size: 519
Translator peak memory: 31068 KB
Writing output... [0.000s CPU, 0.002s wall-clock]
Done! [0.030s CPU, 0.028s wall-clock]
translate exit code: 0

INFO     Running search (release).
INFO     search stdin: output.sas
INFO     search time limit: None
INFO     search memory limit: None
INFO     search command line string: /home/nadso/thesis/downward/builds/release/bin/downward --search 'eager_greedy([blocksworld_infinity_heuristic()])' --internal-plan-file sas_plan < output.sas
[t=0.000220s, 11008 KB] reading input...
[t=0.001100s, 11008 KB] done reading input!
b3
c2
a4
d1
[t=0.004372s, 11264 KB] Building successor generator...done!
[t=0.004619s, 11264 KB] peak memory difference for successor generator creation: 0 KB
[t=0.004658s, 11264 KB] time for successor generation creation: 0.000079s
[t=0.004698s, 11264 KB] Variables: 8
[t=0.004736s, 11264 KB] FactPairs: 28
[t=0.004774s, 11264 KB] Bytes per state: 4
[t=0.004829s, 11264 KB] Conducting best first search without reopening closed nodes, (real) bound = 2147483647
[t=0.004883s, 11264 KB] New best heuristic value for blocksworld infinity dda heuristic: 3
[t=0.004924s, 11264 KB] g=0, 1 evaluated, 0 expanded
[t=0.004965s, 11264 KB] Initial heuristic value for blocksworld infinity dda heuristic: 3
[t=0.005011s, 11264 KB] pruning method: none
[t=0.005116s, 11264 KB] New best heuristic value for blocksworld infinity dda heuristic: 2
[t=0.005191s, 11264 KB] g=1, 10 evaluated, 1 expanded
[t=0.005263s, 11264 KB] New best heuristic value for blocksworld infinity dda heuristic: 1
[t=0.005304s, 11264 KB] g=2, 18 evaluated, 2 expanded
[t=0.005359s, 11264 KB] New best heuristic value for blocksworld infinity dda heuristic: 0
[t=0.005399s, 11264 KB] g=3, 24 evaluated, 3 expanded
[t=0.005440s, 11264 KB] Solution found!
[t=0.005529s, 11264 KB] Actual search time: 0.000519s
move-from-table-onto-block b a (1)
move-from-table-onto-block c b (1)
move-from-table-onto-block d c (1)
[t=0.005582s, 11264 KB] Plan length: 3 step(s).
[t=0.005582s, 11264 KB] Plan cost: 3
[t=0.005582s, 11264 KB] Expanded 4 state(s).
[t=0.005582s, 11264 KB] Reopened 0 state(s).
[t=0.005582s, 11264 KB] Evaluated 25 state(s).
[t=0.005582s, 11264 KB] Evaluations: 25
[t=0.005582s, 11264 KB] Generated 31 state(s).
[t=0.005582s, 11264 KB] Dead ends: 18 state(s).
[t=0.005582s, 11264 KB] Number of registered states: 25
[t=0.005582s, 11264 KB] Int hash set load factor: 25/32 = 0.781250
[t=0.005582s, 11264 KB] Int hash set resizes: 5
[t=0.005582s, 11264 KB] Search time: 0.000754s
[t=0.005582s, 11264 KB] Total time: 0.005582s
Solution found.
Peak memory: 11264 KB
Remove intermediate file output.sas
search exit code: 0

INFO     Planner time: 0.26s
