Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r488-tall-171631132000121.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is Dekker-PT-200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132000121
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-00
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-01
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-02
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-03
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-04
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-05
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-06
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-07
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-08
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-09
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-10
FORMULA_NAME Dekker-PT-200-CTLCardinality-2024-11
FORMULA_NAME Dekker-PT-200-CTLCardinality-2023-12
FORMULA_NAME Dekker-PT-200-CTLCardinality-2023-13
FORMULA_NAME Dekker-PT-200-CTLCardinality-2023-14
FORMULA_NAME Dekker-PT-200-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717186380325

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:13:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:13:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:13:02] [INFO ] Load time of PNML (sax parser for PT used): 1052 ms
[2024-05-31 20:13:02] [INFO ] Transformed 1000 places.
[2024-05-31 20:13:02] [INFO ] Transformed 40400 transitions.
[2024-05-31 20:13:02] [INFO ] Found NUPN structural information;
[2024-05-31 20:13:02] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 1419 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA Dekker-PT-200-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1390 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-31 20:13:04] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2024-05-31 20:13:04] [INFO ] Computed 600 invariants in 36 ms
[2024-05-31 20:13:34] [INFO ] Implicit Places using invariants in 29702 ms returned [403, 409, 412, 415, 418, 424, 427, 430, 433, 436, 439, 445, 451, 454, 457, 460, 463, 472, 475, 478, 481, 484, 487, 493, 496, 499, 502, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 541, 544, 547, 550, 553, 556, 559, 562, 568, 571, 574, 577, 583, 586, 589, 592, 595, 598, 604, 607, 610, 613, 616, 619, 622, 628, 631, 634, 637, 643, 646, 649, 652, 655, 658, 661, 667, 670, 676, 679, 682, 685, 688, 691, 694, 697, 700, 706, 709, 712, 715, 718, 721, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 790, 793, 796, 799, 808, 811, 814, 817, 820, 823, 829, 832, 835, 838, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 910, 913, 916, 919, 922, 928, 931, 934, 940, 943, 949, 952, 955, 958, 964, 967, 970, 973, 976, 979, 982, 985, 988, 991, 994, 997]
Discarding 172 places :
Implicit Place search using SMT only with invariants took 29797 ms to find 172 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 828/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1023 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32239 ms. Remains : 828/1000 places, 40400/40400 transitions.
Support contains 117 out of 828 places after structural reductions.
[2024-05-31 20:13:37] [INFO ] Flatten gal took : 1745 ms
[2024-05-31 20:13:39] [INFO ] Flatten gal took : 1453 ms
[2024-05-31 20:13:41] [INFO ] Input system was already deterministic with 40400 transitions.
Support contains 116 out of 828 places (down from 117) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 4991 ms. (8 steps per ms) remains 13/64 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 548 ms. (72 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 13/13 properties
[2024-05-31 20:13:45] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 828 cols
[2024-05-31 20:13:45] [INFO ] Computed 428 invariants in 9 ms
[2024-05-31 20:13:45] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 48/76 variables, 29/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 48/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 20/96 variables, 19/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 4/100 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 96/196 variables, 100/252 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 352/548 variables, 200/452 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 904/1452 variables, 552/1004 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1452 variables, 552/1556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1452 variables, 152/1708 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1452 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 176/1628 variables, 200/1908 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1628 variables, 176/2084 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1628 variables, 24/2108 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1628 variables, 176/2284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1628 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 0/1628 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2284 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1978 ms.
Refiners :[Domain max(s): 828/828 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 828/828 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 48/76 variables, 29/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 48/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:13:48] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 13 ms to minimize.
[2024-05-31 20:13:48] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 2 ms to minimize.
[2024-05-31 20:13:48] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-31 20:13:48] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 0 ms to minimize.
[2024-05-31 20:13:48] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-31 20:13:49] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-31 20:13:49] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-31 20:13:49] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-31 20:13:49] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 1 ms to minimize.
[2024-05-31 20:13:49] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-31 20:13:49] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 0 ms to minimize.
[2024-05-31 20:13:49] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
[2024-05-31 20:13:50] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-31 20:13:50] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-31 20:13:50] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-05-31 20:13:50] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-31 20:13:50] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-31 20:13:50] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-31 20:13:50] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-31 20:13:50] [INFO ] Deduced a trap composed of 4 places in 117 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:13:51] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-31 20:13:51] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-31 20:13:51] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-31 20:13:51] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:13:51] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-31 20:13:51] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:13:51] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:13:51] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:13:51] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-31 20:13:52] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-31 20:13:52] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-31 20:13:52] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-31 20:13:52] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:13:52] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 4 ms to minimize.
[2024-05-31 20:13:52] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
SMT process timed out in 7514ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 28 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 1252 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1255 ms. Remains : 828/828 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 3578 ms. (11 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 438 ms. (91 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 219492 steps, run timeout after 6001 ms. (steps per millisecond=36 ) properties seen :0 out of 13
Probabilistic random walk after 219492 steps, saw 211346 distinct states, run finished after 6007 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-31 20:14:02] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:14:02] [INFO ] Invariant cache hit.
[2024-05-31 20:14:02] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 48/76 variables, 29/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 48/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 20/96 variables, 19/124 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 4/100 variables, 4/148 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 96/196 variables, 100/252 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 352/548 variables, 200/452 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 904/1452 variables, 552/1004 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1452 variables, 552/1556 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1452 variables, 152/1708 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1452 variables, 0/1708 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 176/1628 variables, 200/1908 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1628 variables, 176/2084 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1628 variables, 24/2108 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1628 variables, 176/2284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1628 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 0/1628 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2284 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1859 ms.
Refiners :[Domain max(s): 828/828 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 828/828 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 48/76 variables, 29/57 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/76 variables, 48/105 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:14:04] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-05-31 20:14:05] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-31 20:14:05] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-05-31 20:14:05] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-31 20:14:05] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-31 20:14:05] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-31 20:14:06] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-31 20:14:06] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 2 ms to minimize.
[2024-05-31 20:14:06] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 1 ms to minimize.
[2024-05-31 20:14:06] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-31 20:14:06] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-31 20:14:06] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-31 20:14:06] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-31 20:14:07] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-31 20:14:07] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-31 20:14:07] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-31 20:14:07] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-31 20:14:07] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 2 ms to minimize.
[2024-05-31 20:14:07] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-31 20:14:07] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/76 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:14:07] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-05-31 20:14:08] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-31 20:14:08] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-31 20:14:08] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-31 20:14:08] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-31 20:14:08] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-31 20:14:08] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-31 20:14:08] [INFO ] Deduced a trap composed of 4 places in 121 ms of which 0 ms to minimize.
[2024-05-31 20:14:08] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 2 ms to minimize.
[2024-05-31 20:14:09] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 1 ms to minimize.
[2024-05-31 20:14:09] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-31 20:14:09] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-31 20:14:09] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 1 ms to minimize.
[2024-05-31 20:14:09] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-31 20:14:09] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
[2024-05-31 20:14:09] [INFO ] Deduced a trap composed of 4 places in 113 ms of which 0 ms to minimize.
[2024-05-31 20:14:09] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-31 20:14:09] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/76 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-31 20:14:10] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-31 20:14:11] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-31 20:14:12] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-31 20:14:13] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 20/185 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:14:14] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-05-31 20:14:14] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-31 20:14:14] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-31 20:14:14] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:14:14] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:14:14] [INFO ] Deduced a trap composed of 4 places in 89 ms of which 0 ms to minimize.
[2024-05-31 20:14:14] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:14:14] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-31 20:14:14] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 0 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 0 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:14:15] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 2 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-31 20:14:16] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-31 20:14:17] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 0 ms to minimize.
[2024-05-31 20:14:17] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:14:17] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:14:17] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 1 ms to minimize.
[2024-05-31 20:14:17] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:14:17] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:14:17] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-05-31 20:14:17] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/76 variables, 19/224 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/76 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 20/96 variables, 19/243 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/96 variables, 20/263 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/96 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 4/100 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/100 variables, 4/271 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/100 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 96/196 variables, 100/371 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/196 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (OVERLAPS) 352/548 variables, 200/571 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/548 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 904/1452 variables, 552/1123 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1452 variables, 552/1675 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1452 variables, 152/1827 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1452 variables, 13/1840 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:14:24] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 2 ms to minimize.
[2024-05-31 20:14:24] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 1 ms to minimize.
[2024-05-31 20:14:25] [INFO ] Deduced a trap composed of 4 places in 579 ms of which 1 ms to minimize.
[2024-05-31 20:14:25] [INFO ] Deduced a trap composed of 4 places in 565 ms of which 1 ms to minimize.
[2024-05-31 20:14:26] [INFO ] Deduced a trap composed of 4 places in 554 ms of which 1 ms to minimize.
[2024-05-31 20:14:27] [INFO ] Deduced a trap composed of 4 places in 584 ms of which 1 ms to minimize.
[2024-05-31 20:14:27] [INFO ] Deduced a trap composed of 4 places in 550 ms of which 1 ms to minimize.
[2024-05-31 20:14:28] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 1 ms to minimize.
[2024-05-31 20:14:28] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 1 ms to minimize.
[2024-05-31 20:14:29] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 1 ms to minimize.
[2024-05-31 20:14:29] [INFO ] Deduced a trap composed of 4 places in 499 ms of which 1 ms to minimize.
[2024-05-31 20:14:30] [INFO ] Deduced a trap composed of 4 places in 481 ms of which 1 ms to minimize.
[2024-05-31 20:14:30] [INFO ] Deduced a trap composed of 4 places in 492 ms of which 1 ms to minimize.
[2024-05-31 20:14:31] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 1 ms to minimize.
[2024-05-31 20:14:32] [INFO ] Deduced a trap composed of 4 places in 489 ms of which 1 ms to minimize.
[2024-05-31 20:14:32] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 1 ms to minimize.
[2024-05-31 20:14:33] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 0 ms to minimize.
[2024-05-31 20:14:33] [INFO ] Deduced a trap composed of 4 places in 434 ms of which 1 ms to minimize.
[2024-05-31 20:14:33] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 1 ms to minimize.
[2024-05-31 20:14:34] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 0 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1452 variables, 20/1860 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:14:35] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 1 ms to minimize.
[2024-05-31 20:14:36] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 1 ms to minimize.
[2024-05-31 20:14:36] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2024-05-31 20:14:37] [INFO ] Deduced a trap composed of 4 places in 373 ms of which 2 ms to minimize.
[2024-05-31 20:14:37] [INFO ] Deduced a trap composed of 6 places in 358 ms of which 1 ms to minimize.
[2024-05-31 20:14:37] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 1 ms to minimize.
[2024-05-31 20:14:38] [INFO ] Deduced a trap composed of 6 places in 360 ms of which 0 ms to minimize.
[2024-05-31 20:14:38] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 0 ms to minimize.
[2024-05-31 20:14:38] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 1 ms to minimize.
[2024-05-31 20:14:39] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-05-31 20:14:39] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 0 ms to minimize.
[2024-05-31 20:14:40] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 0 ms to minimize.
[2024-05-31 20:14:40] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 0 ms to minimize.
[2024-05-31 20:14:40] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-05-31 20:14:41] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 1 ms to minimize.
[2024-05-31 20:14:41] [INFO ] Deduced a trap composed of 6 places in 312 ms of which 0 ms to minimize.
[2024-05-31 20:14:41] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-05-31 20:14:42] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2024-05-31 20:14:42] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2024-05-31 20:14:42] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1452 variables, 20/1880 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-05-31 20:14:44] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 0 ms to minimize.
[2024-05-31 20:14:44] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2024-05-31 20:14:44] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 1 ms to minimize.
[2024-05-31 20:14:44] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-31 20:14:45] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2024-05-31 20:14:45] [INFO ] Deduced a trap composed of 6 places in 227 ms of which 1 ms to minimize.
[2024-05-31 20:14:45] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
[2024-05-31 20:14:46] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2024-05-31 20:14:46] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-31 20:14:46] [INFO ] Deduced a trap composed of 6 places in 232 ms of which 1 ms to minimize.
[2024-05-31 20:14:46] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2024-05-31 20:14:47] [INFO ] Deduced a trap composed of 6 places in 243 ms of which 0 ms to minimize.
[2024-05-31 20:14:47] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 0 ms to minimize.
[2024-05-31 20:14:47] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-31 20:14:47] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-05-31 20:14:48] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 1 ms to minimize.
[2024-05-31 20:14:48] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-31 20:14:48] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-31 20:14:48] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-05-31 20:14:49] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
SMT process timed out in 47182ms, After SMT, problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 1 properties in 26333 ms.
Support contains 26 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 1199 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1199 ms. Remains : 828/828 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 3437 ms. (11 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 110349 steps, run timeout after 3003 ms. (steps per millisecond=36 ) properties seen :0 out of 12
Probabilistic random walk after 110349 steps, saw 106701 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-31 20:15:21] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:15:21] [INFO ] Invariant cache hit.
[2024-05-31 20:15:21] [INFO ] State equation strengthened by 200 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 44/70 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 18/88 variables, 17/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 18/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 4/92 variables, 4/136 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 4/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 88/180 variables, 92/232 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/180 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 356/536 variables, 200/432 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/536 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 914/1450 variables, 558/990 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1450 variables, 558/1548 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1450 variables, 154/1702 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1450 variables, 0/1702 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (OVERLAPS) 178/1628 variables, 202/1904 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1628 variables, 178/2082 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1628 variables, 24/2106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1628 variables, 178/2284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1628 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 24 (OVERLAPS) 0/1628 variables, 0/2284 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1628/1628 variables, and 2284 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1712 ms.
Refiners :[Domain max(s): 828/828 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 828/828 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 44/70 variables, 27/53 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 44/97 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:15:24] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-31 20:15:24] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-05-31 20:15:24] [INFO ] Deduced a trap composed of 4 places in 170 ms of which 0 ms to minimize.
[2024-05-31 20:15:24] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-31 20:15:24] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-31 20:15:25] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-31 20:15:25] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-31 20:15:25] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-31 20:15:25] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 1 ms to minimize.
[2024-05-31 20:15:25] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-31 20:15:25] [INFO ] Deduced a trap composed of 4 places in 118 ms of which 0 ms to minimize.
[2024-05-31 20:15:25] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-31 20:15:25] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-31 20:15:26] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-31 20:15:26] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 1 ms to minimize.
[2024-05-31 20:15:26] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-31 20:15:26] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
[2024-05-31 20:15:26] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-31 20:15:26] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 0 ms to minimize.
[2024-05-31 20:15:26] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:15:26] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 1 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:15:27] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 4 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 1 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 1 ms to minimize.
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:15:33] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 0 ms to minimize.
[2024-05-31 20:15:33] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-05-31 20:15:33] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-31 20:15:33] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-31 20:15:33] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-31 20:15:33] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
[2024-05-31 20:15:33] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 7/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 18/88 variables, 17/201 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/88 variables, 18/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/88 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 4/92 variables, 4/223 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/92 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/92 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 88/180 variables, 92/319 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/180 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 18 (OVERLAPS) 356/536 variables, 200/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/536 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 20 (OVERLAPS) 914/1450 variables, 558/1077 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1450 variables, 558/1635 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1450 variables, 154/1789 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1450 variables, 12/1801 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:15:39] [INFO ] Deduced a trap composed of 4 places in 678 ms of which 1 ms to minimize.
[2024-05-31 20:15:39] [INFO ] Deduced a trap composed of 4 places in 697 ms of which 1 ms to minimize.
[2024-05-31 20:15:40] [INFO ] Deduced a trap composed of 4 places in 646 ms of which 1 ms to minimize.
[2024-05-31 20:15:41] [INFO ] Deduced a trap composed of 4 places in 661 ms of which 1 ms to minimize.
[2024-05-31 20:15:41] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 0 ms to minimize.
[2024-05-31 20:15:42] [INFO ] Deduced a trap composed of 4 places in 607 ms of which 1 ms to minimize.
[2024-05-31 20:15:43] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 1 ms to minimize.
[2024-05-31 20:15:43] [INFO ] Deduced a trap composed of 4 places in 611 ms of which 1 ms to minimize.
[2024-05-31 20:15:44] [INFO ] Deduced a trap composed of 4 places in 570 ms of which 1 ms to minimize.
[2024-05-31 20:15:45] [INFO ] Deduced a trap composed of 4 places in 588 ms of which 1 ms to minimize.
[2024-05-31 20:15:45] [INFO ] Deduced a trap composed of 4 places in 561 ms of which 1 ms to minimize.
[2024-05-31 20:15:46] [INFO ] Deduced a trap composed of 4 places in 590 ms of which 1 ms to minimize.
[2024-05-31 20:15:46] [INFO ] Deduced a trap composed of 4 places in 585 ms of which 1 ms to minimize.
[2024-05-31 20:15:47] [INFO ] Deduced a trap composed of 4 places in 555 ms of which 0 ms to minimize.
[2024-05-31 20:15:48] [INFO ] Deduced a trap composed of 4 places in 540 ms of which 1 ms to minimize.
[2024-05-31 20:15:48] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 1 ms to minimize.
[2024-05-31 20:15:49] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 1 ms to minimize.
[2024-05-31 20:15:49] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 1 ms to minimize.
[2024-05-31 20:15:50] [INFO ] Deduced a trap composed of 4 places in 500 ms of which 1 ms to minimize.
[2024-05-31 20:15:50] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1450 variables, 20/1821 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:15:51] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-31 20:15:52] [INFO ] Deduced a trap composed of 4 places in 485 ms of which 0 ms to minimize.
[2024-05-31 20:15:52] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 1 ms to minimize.
[2024-05-31 20:15:53] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 1 ms to minimize.
[2024-05-31 20:15:53] [INFO ] Deduced a trap composed of 4 places in 456 ms of which 1 ms to minimize.
[2024-05-31 20:15:54] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2024-05-31 20:15:54] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 1 ms to minimize.
[2024-05-31 20:15:55] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2024-05-31 20:15:55] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 1 ms to minimize.
[2024-05-31 20:15:55] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 1 ms to minimize.
[2024-05-31 20:15:56] [INFO ] Deduced a trap composed of 4 places in 428 ms of which 1 ms to minimize.
[2024-05-31 20:15:56] [INFO ] Deduced a trap composed of 4 places in 412 ms of which 1 ms to minimize.
[2024-05-31 20:15:57] [INFO ] Deduced a trap composed of 6 places in 418 ms of which 1 ms to minimize.
[2024-05-31 20:15:57] [INFO ] Deduced a trap composed of 6 places in 389 ms of which 1 ms to minimize.
[2024-05-31 20:15:58] [INFO ] Deduced a trap composed of 6 places in 383 ms of which 1 ms to minimize.
[2024-05-31 20:15:58] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2024-05-31 20:15:58] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2024-05-31 20:15:59] [INFO ] Deduced a trap composed of 6 places in 363 ms of which 1 ms to minimize.
[2024-05-31 20:15:59] [INFO ] Deduced a trap composed of 6 places in 391 ms of which 0 ms to minimize.
[2024-05-31 20:16:00] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1450 variables, 20/1841 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:16:01] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 1 ms to minimize.
[2024-05-31 20:16:01] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 1 ms to minimize.
[2024-05-31 20:16:02] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 0 ms to minimize.
[2024-05-31 20:16:02] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2024-05-31 20:16:02] [INFO ] Deduced a trap composed of 5 places in 413 ms of which 1 ms to minimize.
[2024-05-31 20:16:03] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2024-05-31 20:16:03] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2024-05-31 20:16:04] [INFO ] Deduced a trap composed of 4 places in 397 ms of which 1 ms to minimize.
[2024-05-31 20:16:04] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2024-05-31 20:16:05] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2024-05-31 20:16:05] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 0 ms to minimize.
[2024-05-31 20:16:05] [INFO ] Deduced a trap composed of 4 places in 326 ms of which 1 ms to minimize.
[2024-05-31 20:16:06] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 1 ms to minimize.
[2024-05-31 20:16:06] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2024-05-31 20:16:06] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 1 ms to minimize.
[2024-05-31 20:16:07] [INFO ] Deduced a trap composed of 4 places in 321 ms of which 0 ms to minimize.
[2024-05-31 20:16:07] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 1 ms to minimize.
[2024-05-31 20:16:07] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 0 ms to minimize.
[2024-05-31 20:16:08] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 0 ms to minimize.
[2024-05-31 20:16:08] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1450 variables, 20/1861 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:16:09] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2024-05-31 20:16:10] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2024-05-31 20:16:10] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 0 ms to minimize.
[2024-05-31 20:16:10] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2024-05-31 20:16:11] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2024-05-31 20:16:11] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2024-05-31 20:16:12] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 1 ms to minimize.
[2024-05-31 20:16:12] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 0 ms to minimize.
[2024-05-31 20:16:12] [INFO ] Deduced a trap composed of 4 places in 318 ms of which 1 ms to minimize.
[2024-05-31 20:16:13] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 0 ms to minimize.
[2024-05-31 20:16:13] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-05-31 20:16:13] [INFO ] Deduced a trap composed of 4 places in 273 ms of which 0 ms to minimize.
[2024-05-31 20:16:14] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 0 ms to minimize.
[2024-05-31 20:16:14] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2024-05-31 20:16:14] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 1 ms to minimize.
[2024-05-31 20:16:15] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 1 ms to minimize.
[2024-05-31 20:16:15] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2024-05-31 20:16:15] [INFO ] Deduced a trap composed of 6 places in 258 ms of which 1 ms to minimize.
[2024-05-31 20:16:15] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2024-05-31 20:16:16] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1450 variables, 20/1881 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:16:17] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 1 ms to minimize.
[2024-05-31 20:16:17] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 0 ms to minimize.
[2024-05-31 20:16:17] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2024-05-31 20:16:18] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2024-05-31 20:16:18] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2024-05-31 20:16:18] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2024-05-31 20:16:19] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2024-05-31 20:16:19] [INFO ] Deduced a trap composed of 6 places in 267 ms of which 0 ms to minimize.
[2024-05-31 20:16:19] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-31 20:16:20] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-05-31 20:16:20] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 1 ms to minimize.
[2024-05-31 20:16:20] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-05-31 20:16:20] [INFO ] Deduced a trap composed of 4 places in 280 ms of which 0 ms to minimize.
[2024-05-31 20:16:21] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2024-05-31 20:16:21] [INFO ] Deduced a trap composed of 4 places in 302 ms of which 0 ms to minimize.
[2024-05-31 20:16:21] [INFO ] Deduced a trap composed of 4 places in 270 ms of which 0 ms to minimize.
[2024-05-31 20:16:22] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2024-05-31 20:16:22] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 0 ms to minimize.
[2024-05-31 20:16:22] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2024-05-31 20:16:23] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1450 variables, 20/1901 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:16:24] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2024-05-31 20:16:24] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 1 ms to minimize.
[2024-05-31 20:16:24] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-31 20:16:24] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2024-05-31 20:16:25] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-31 20:16:25] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-31 20:16:25] [INFO ] Deduced a trap composed of 4 places in 219 ms of which 1 ms to minimize.
[2024-05-31 20:16:26] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-05-31 20:16:26] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-31 20:16:26] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2024-05-31 20:16:26] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2024-05-31 20:16:27] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-05-31 20:16:27] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-31 20:16:27] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-31 20:16:28] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-31 20:16:28] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-31 20:16:28] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-31 20:16:28] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-31 20:16:29] [INFO ] Deduced a trap composed of 4 places in 216 ms of which 0 ms to minimize.
[2024-05-31 20:16:29] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1450 variables, 20/1921 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:16:30] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 0 ms to minimize.
[2024-05-31 20:16:30] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2024-05-31 20:16:30] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-31 20:16:31] [INFO ] Deduced a trap composed of 6 places in 262 ms of which 1 ms to minimize.
[2024-05-31 20:16:31] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-31 20:16:31] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-31 20:16:31] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-31 20:16:32] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-31 20:16:32] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-31 20:16:32] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-31 20:16:32] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 1 ms to minimize.
[2024-05-31 20:16:33] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 2 ms to minimize.
[2024-05-31 20:16:33] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-05-31 20:16:33] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2024-05-31 20:16:33] [INFO ] Deduced a trap composed of 6 places in 260 ms of which 0 ms to minimize.
[2024-05-31 20:16:34] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2024-05-31 20:16:34] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-31 20:16:34] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-31 20:16:34] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2024-05-31 20:16:35] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1450 variables, 20/1941 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-31 20:16:36] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-05-31 20:16:36] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-31 20:16:36] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-31 20:16:37] [INFO ] Deduced a trap composed of 4 places in 229 ms of which 1 ms to minimize.
[2024-05-31 20:16:37] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-31 20:16:37] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
[2024-05-31 20:16:37] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-31 20:16:38] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2024-05-31 20:16:38] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2024-05-31 20:16:38] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-31 20:16:38] [INFO ] Deduced a trap composed of 4 places in 230 ms of which 0 ms to minimize.
SMT process timed out in 77121ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 26597 ms.
Support contains 26 out of 828 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 800 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 800 ms. Remains : 828/828 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 735 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-31 20:17:06] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:17:06] [INFO ] Invariant cache hit.
[2024-05-31 20:17:16] [INFO ] Implicit Places using invariants in 9956 ms returned [400, 405, 416, 431, 436, 449, 452, 467, 478, 501, 520, 531, 546, 574, 591, 598, 619, 634, 677, 691, 706, 761, 774, 783, 790, 801]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 9990 ms to find 26 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 802/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 746 ms. Remains 802 /802 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11478 ms. Remains : 802/828 places, 40400/40400 transitions.
[2024-05-31 20:17:19] [INFO ] Flatten gal took : 1171 ms
[2024-05-31 20:17:20] [INFO ] Flatten gal took : 1303 ms
[2024-05-31 20:17:22] [INFO ] Input system was already deterministic with 40400 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 1427 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1430 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:17:25] [INFO ] Flatten gal took : 1171 ms
[2024-05-31 20:17:27] [INFO ] Flatten gal took : 1301 ms
[2024-05-31 20:17:29] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 1324 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1326 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:17:31] [INFO ] Flatten gal took : 1163 ms
[2024-05-31 20:17:33] [INFO ] Flatten gal took : 1290 ms
[2024-05-31 20:17:35] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 1316 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1317 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:17:37] [INFO ] Flatten gal took : 1172 ms
[2024-05-31 20:17:39] [INFO ] Flatten gal took : 1265 ms
[2024-05-31 20:17:41] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 613 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 614 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:17:43] [INFO ] Flatten gal took : 1157 ms
[2024-05-31 20:17:44] [INFO ] Flatten gal took : 1267 ms
[2024-05-31 20:17:46] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 608 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 609 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:17:48] [INFO ] Flatten gal took : 1162 ms
[2024-05-31 20:17:49] [INFO ] Flatten gal took : 1299 ms
[2024-05-31 20:17:51] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 638 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 640 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:17:53] [INFO ] Flatten gal took : 1154 ms
[2024-05-31 20:17:54] [INFO ] Flatten gal took : 1305 ms
[2024-05-31 20:17:57] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 602 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 604 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:17:59] [INFO ] Flatten gal took : 1167 ms
[2024-05-31 20:18:00] [INFO ] Flatten gal took : 1278 ms
[2024-05-31 20:18:02] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 1270 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1271 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:18:05] [INFO ] Flatten gal took : 1165 ms
[2024-05-31 20:18:06] [INFO ] Flatten gal took : 1297 ms
[2024-05-31 20:18:08] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 653 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 653 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:18:10] [INFO ] Flatten gal took : 1166 ms
[2024-05-31 20:18:11] [INFO ] Flatten gal took : 1286 ms
[2024-05-31 20:18:13] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 623 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:18:15] [INFO ] Flatten gal took : 1165 ms
[2024-05-31 20:18:17] [INFO ] Flatten gal took : 1288 ms
[2024-05-31 20:18:19] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 695 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 697 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:18:21] [INFO ] Flatten gal took : 1167 ms
[2024-05-31 20:18:22] [INFO ] Flatten gal took : 1314 ms
[2024-05-31 20:18:24] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 609 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 611 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:18:26] [INFO ] Flatten gal took : 1164 ms
[2024-05-31 20:18:27] [INFO ] Flatten gal took : 1294 ms
[2024-05-31 20:18:29] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 618 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 620 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:18:31] [INFO ] Flatten gal took : 1161 ms
[2024-05-31 20:18:33] [INFO ] Flatten gal took : 1260 ms
[2024-05-31 20:18:35] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 687 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 688 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:18:37] [INFO ] Flatten gal took : 1172 ms
[2024-05-31 20:18:38] [INFO ] Flatten gal took : 1291 ms
[2024-05-31 20:18:40] [INFO ] Input system was already deterministic with 40400 transitions.
Starting structural reductions in LTL mode, iteration 0 : 828/828 places, 40400/40400 transitions.
Applied a total of 0 rules in 628 ms. Remains 828 /828 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 630 ms. Remains : 828/828 places, 40400/40400 transitions.
[2024-05-31 20:18:42] [INFO ] Flatten gal took : 1190 ms
[2024-05-31 20:18:43] [INFO ] Flatten gal took : 1330 ms
[2024-05-31 20:18:45] [INFO ] Input system was already deterministic with 40400 transitions.
[2024-05-31 20:18:47] [INFO ] Flatten gal took : 1222 ms
[2024-05-31 20:18:48] [INFO ] Flatten gal took : 1260 ms
[2024-05-31 20:18:48] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-31 20:18:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 828 places, 40400 transitions and 285828 arcs took 161 ms.
Total runtime 347182 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-00
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-01
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-02
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-03
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-04
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-05
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-06
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-07
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-08
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-09
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2024-10
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2023-12
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2023-13
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2023-14
Could not compute solution for formula : Dekker-PT-200-CTLCardinality-2023-15

BK_STOP 1717186729080

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name Dekker-PT-200-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/1908/ctl_0_
ctl formula name Dekker-PT-200-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/1908/ctl_1_
ctl formula name Dekker-PT-200-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/1908/ctl_2_
ctl formula name Dekker-PT-200-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/1908/ctl_3_
ctl formula name Dekker-PT-200-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/1908/ctl_4_
ctl formula name Dekker-PT-200-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/1908/ctl_5_
ctl formula name Dekker-PT-200-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/1908/ctl_6_
ctl formula name Dekker-PT-200-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/1908/ctl_7_
ctl formula name Dekker-PT-200-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/1908/ctl_8_
ctl formula name Dekker-PT-200-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/1908/ctl_9_
ctl formula name Dekker-PT-200-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/1908/ctl_10_
ctl formula name Dekker-PT-200-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/1908/ctl_11_
ctl formula name Dekker-PT-200-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/1908/ctl_12_
ctl formula name Dekker-PT-200-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/1908/ctl_13_
ctl formula name Dekker-PT-200-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/1908/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-200"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is Dekker-PT-200, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132000121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;