python2.7 probfd-qcomp19/builds/release64/bin/translate/translate.py domain.pddl p01-c4-p2-a2-s3846.pddl
probfd-qcomp19/builds/release64/bin/downward --sas output.sas --engine fretpi-hdp --heuristic hmax --enable-caching --epsilon 1e-6
Probabilistic-FD FRET-pi + HDP configuration
Parsing...
Parsing: [0.010s CPU, 0.006s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.001s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.006s wall-clock]
Preparing model... [0.000s CPU, 0.003s wall-clock]
Generated 103 rules.
Computing model... [0.020s CPU, 0.015s wall-clock]
640 relevant atoms
520 auxiliary atoms
1160 final queue length
1640 total queue pushes
Completing instantiation... [0.030s CPU, 0.029s wall-clock]
Instantiating: [0.060s CPU, 0.055s wall-clock]
Computing fact groups...
Finding invariants...
32 initial candidates
Finding invariants: [0.020s CPU, 0.018s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
6 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.020s CPU, 0.020s 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]
Processing axioms: [0.000s CPU, 0.001s wall-clock]
Translating task: [0.030s CPU, 0.026s wall-clock]
32 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
0 axioms removed
12 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.011s wall-clock]
Reordering and filtering variables...
8 of 12 variables necessary.
0 of 8 mutex groups necessary.
424 of 424 operators necessary.
0 of 0 axiom rules necessary.
Reordering and filtering variables: [0.000s CPU, 0.002s wall-clock]
Translator variables: 8
Translator derived variables: 0
Translator facts: 58
Translator goal facts: 2
Translator mutex groups: 0
Translator total mutex groups size: 0
Translator operators: 424
Translator axioms: 0
Translator task size: 2124
Translator peak memory: 51908 KB
Writing output... [0.010s CPU, 0.004s wall-clock]
Done! [0.140s CPU, 0.126s wall-clock]
reading input... [t=7.0719e-05s]
done reading input! [t=0.00120087s]
variables: 8
goals: 2
actions: 424
axioms: 0
has conditional effects: 0
reconstructing probabilistic actions... [t=0.00123004s]
done reconstructing probabilistic actions! [t=0.00236503s]
probabilistic actions: 424 (with 528 outcomes)
constructing successor generator... [t=0.0024942s]
done constructing successor generator! [t=0.00261267s]
Bytes per state: 4
Property: MaxProb
Preparing hmax dead end detection heuristic... [t=0.00264816s]
hmax initialization done! [t=0.00282303s]
Engine: FRET-pi with HDP
Starting trap elimination heuristic search wrapper...
Initial state reward: 1
Expansions: 1946
Registered states: 10348
Generated states: 20526
Cached transitions: 17335
Expansion cache hits: 5982
Transition cache hits: 8379546
Approximate transition cache memory usage: 685KB
Solver time: 0.6902311340000000239s
Total time: 0.6930915770000000142s