Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r070-smll-174854076300123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is Dekker-PT-050, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-smll-174854076300123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.5M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748647687881

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Dekker-PT-050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-30 23:28:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-05-30 23:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 23:28:11] [INFO ] Load time of PNML (sax parser for PT used): 411 ms
[2025-05-30 23:28:11] [INFO ] Transformed 250 places.
[2025-05-30 23:28:11] [INFO ] Transformed 2600 transitions.
[2025-05-30 23:28:11] [INFO ] Found NUPN structural information;
[2025-05-30 23:28:11] [INFO ] Parsed PT model containing 250 places and 2600 transitions and 20100 arcs in 886 ms.
RANDOM walk for 40000 steps (8 resets) in 3792 ms. (10 steps per ms) remains 49/250 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 49/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 48/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 48/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 47/48 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 45/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 44/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 43/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 42/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 38/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/31 properties
[2025-05-30 23:28:13] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2025-05-30 23:28:13] [INFO ] Computed 150 invariants in 30 ms
[2025-05-30 23:28:13] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 90/120 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 90/180 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 30/150 variables, 30/210 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 30/240 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 120/270 variables, 150/390 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/270 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 40/310 variables, 50/440 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 120/430 variables, 80/520 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 80/600 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 15 (OVERLAPS) 20/450 variables, 40/640 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 20/660 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 20/680 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 20/700 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 20 (OVERLAPS) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 700 constraints, problems are : Problem set: 0 solved, 30 unsolved in 3540 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 90/120 variables, 60/90 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/120 variables, 90/180 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2025-05-30 23:28:17] [INFO ] Deduced a trap composed of 4 places in 600 ms of which 48 ms to minimize.
[2025-05-30 23:28:18] [INFO ] Deduced a trap composed of 4 places in 413 ms of which 4 ms to minimize.
[2025-05-30 23:28:18] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 3 ms to minimize.
[2025-05-30 23:28:18] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 7 ms to minimize.
[2025-05-30 23:28:19] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 2 ms to minimize.
[2025-05-30 23:28:19] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 2 ms to minimize.
[2025-05-30 23:28:19] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 3 ms to minimize.
[2025-05-30 23:28:19] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2025-05-30 23:28:20] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2025-05-30 23:28:20] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 2 ms to minimize.
[2025-05-30 23:28:20] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 2 ms to minimize.
[2025-05-30 23:28:20] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 2 ms to minimize.
[2025-05-30 23:28:20] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 3 ms to minimize.
[2025-05-30 23:28:21] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 3 ms to minimize.
[2025-05-30 23:28:21] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 2 ms to minimize.
[2025-05-30 23:28:21] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 2 ms to minimize.
[2025-05-30 23:28:21] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 2 ms to minimize.
[2025-05-30 23:28:21] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
SMT process timed out in 8794ms, After SMT, problems are : Problem set: 0 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 2600/2600 transitions.
Applied a total of 0 rules in 383 ms. Remains 250 /250 variables (removed 0) and now considering 2600/2600 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 407 ms. Remains : 250/250 places, 2600/2600 transitions.
RANDOM walk for 4000000 steps (8 resets) in 81075 ms. (49 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 990 ms. (403 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 985 ms. (405 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 986 ms. (405 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 987 ms. (404 steps per ms) remains 30/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1008 ms. (396 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400004 steps (8 resets) in 982 ms. (406 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 984 ms. (406 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 986 ms. (405 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 980 ms. (407 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400004 steps (8 resets) in 989 ms. (404 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 986 ms. (405 steps per ms) remains 25/27 properties
BEST_FIRST walk for 400004 steps (8 resets) in 984 ms. (406 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 996 ms. (401 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1069 ms. (373 steps per ms) remains 23/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1226 ms. (326 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1248 ms. (320 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1123 ms. (355 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1003 ms. (398 steps per ms) remains 20/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1125 ms. (355 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1175 ms. (340 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1020 ms. (391 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1004 ms. (398 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1004 ms. (398 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1018 ms. (392 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 987 ms. (404 steps per ms) remains 19/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 984 ms. (406 steps per ms) remains 19/19 properties
[2025-05-30 23:28:51] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
[2025-05-30 23:28:51] [INFO ] Invariant cache hit.
[2025-05-30 23:28:51] [INFO ] State equation strengthened by 50 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 57/76 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 57/114 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 19/95 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 19/152 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 76/171 variables, 95/247 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 62/233 variables, 50/297 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (OVERLAPS) 186/419 variables, 124/421 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/419 variables, 124/545 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/419 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (OVERLAPS) 31/450 variables, 62/607 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/450 variables, 31/638 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 31/669 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 31/700 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (OVERLAPS) 0/450 variables, 0/700 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 450/450 variables, and 700 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1693 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 57/76 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 57/114 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-30 23:28:53] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 3 ms to minimize.
[2025-05-30 23:28:53] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 2 ms to minimize.
[2025-05-30 23:28:53] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 3 ms to minimize.
[2025-05-30 23:28:54] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 2 ms to minimize.
[2025-05-30 23:28:54] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2025-05-30 23:28:54] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 2 ms to minimize.
[2025-05-30 23:28:54] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 2 ms to minimize.
[2025-05-30 23:28:54] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 2 ms to minimize.
[2025-05-30 23:28:54] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 2 ms to minimize.
[2025-05-30 23:28:54] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 2 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 2 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 2 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 3 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 20/134 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-30 23:28:55] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 2 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 2 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 2 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 2 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 3 ms to minimize.
[2025-05-30 23:28:56] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 3 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 2 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 3 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 20/154 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2025-05-30 23:28:57] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2025-05-30 23:28:58] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 1 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 2 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 20/174 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 2 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 2 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 2 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2025-05-30 23:28:59] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 20/194 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2025-05-30 23:29:00] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 2 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 2 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2025-05-30 23:29:01] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 5 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:29:02] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 2 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:29:03] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 20/254 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:04] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/76 variables, 20/274 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2025-05-30 23:29:05] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2025-05-30 23:29:06] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2025-05-30 23:29:06] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2025-05-30 23:29:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2025-05-30 23:29:06] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/76 variables, 13/287 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/76 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (OVERLAPS) 19/95 variables, 19/306 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/95 variables, 19/325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/95 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 76/171 variables, 95/420 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/171 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 19 (OVERLAPS) 62/233 variables, 50/470 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/233 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 21 (OVERLAPS) 186/419 variables, 124/594 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/419 variables, 124/718 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/419 variables, 19/737 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/419 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 25 (OVERLAPS) 31/450 variables, 62/799 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/450 variables, 31/830 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/450 variables, 31/861 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/450 variables, 31/892 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/450 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 30 (OVERLAPS) 0/450 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 450/450 variables, and 892 constraints, problems are : Problem set: 0 solved, 19 unsolved in 15982 ms.
Refiners :[Domain max(s): 250/250 constraints, Positive P Invariants (semi-flows): 100/100 constraints, Generalized P Invariants (flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 173/173 constraints]
After SMT, in 17727ms problems are : Problem set: 0 solved, 19 unsolved
Finished Parikh walk after 700 steps, including 25 resets, run visited all 3 properties in 50 ms. (steps per millisecond=14 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 19 properties in 609 ms.
Able to resolve query StableMarking after proving 250 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK PARIKH_WALK BESTFIRST_WALK TOPOLOGICAL
Total runtime 59247 ms.
ITS solved all properties within timeout

BK_STOP 1748647749747

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-050"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is Dekker-PT-050, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r070-smll-174854076300123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "StableMarking.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;