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-171631132900553.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 DoubleExponent-PT-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900553
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 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 169K 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 DoubleExponent-PT-010-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-010-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717194099950

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:21:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:21:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:21:41] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-31 22:21:41] [INFO ] Transformed 534 places.
[2024-05-31 22:21:41] [INFO ] Transformed 498 transitions.
[2024-05-31 22:21:41] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Support contains 112 out of 534 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 534/534 places, 498/498 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 531 transition count 498
Applied a total of 3 rules in 61 ms. Remains 531 /534 variables (removed 3) and now considering 498/498 (removed 0) transitions.
// Phase 1: matrix 498 rows 531 cols
[2024-05-31 22:21:41] [INFO ] Computed 52 invariants in 77 ms
[2024-05-31 22:21:42] [INFO ] Implicit Places using invariants in 521 ms returned [439]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 552 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/534 places, 498/498 transitions.
Applied a total of 0 rules in 26 ms. Remains 530 /530 variables (removed 0) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 657 ms. Remains : 530/534 places, 498/498 transitions.
Support contains 112 out of 530 places after structural reductions.
[2024-05-31 22:21:42] [INFO ] Flatten gal took : 64 ms
[2024-05-31 22:21:42] [INFO ] Flatten gal took : 28 ms
[2024-05-31 22:21:42] [INFO ] Input system was already deterministic with 498 transitions.
RANDOM walk for 40000 steps (1322 resets) in 2014 ms. (19 steps per ms) remains 68/73 properties
BEST_FIRST walk for 4001 steps (106 resets) in 110 ms. (36 steps per ms) remains 64/68 properties
BEST_FIRST walk for 4001 steps (108 resets) in 98 ms. (40 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (111 resets) in 57 ms. (68 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (111 resets) in 89 ms. (44 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (114 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (108 resets) in 40 ms. (97 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (112 resets) in 32 ms. (121 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (110 resets) in 49 ms. (80 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (112 resets) in 28 ms. (137 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (108 resets) in 50 ms. (78 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (111 resets) in 83 ms. (47 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (109 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (111 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (111 resets) in 34 ms. (114 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (113 resets) in 52 ms. (75 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (107 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (113 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (111 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (109 resets) in 51 ms. (76 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (106 resets) in 28 ms. (138 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (116 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (108 resets) in 70 ms. (56 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (115 resets) in 98 ms. (40 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (102 resets) in 38 ms. (102 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (110 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (107 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (117 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (109 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (117 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (104 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (109 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (101 resets) in 35 ms. (111 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (110 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (108 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (113 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (108 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (120 resets) in 44 ms. (88 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (116 resets) in 39 ms. (100 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (115 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (110 resets) in 30 ms. (129 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (117 resets) in 33 ms. (117 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (111 resets) in 28 ms. (137 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (108 resets) in 45 ms. (86 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (114 resets) in 27 ms. (142 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (113 resets) in 28 ms. (137 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (117 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (113 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (113 resets) in 22 ms. (173 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (114 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (113 resets) in 25 ms. (153 steps per ms) remains 64/64 properties
// Phase 1: matrix 498 rows 530 cols
[2024-05-31 22:21:44] [INFO ] Computed 51 invariants in 31 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 1 (OVERLAPS) 313/410 variables, 4/4 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 1/5 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/410 variables, 0/5 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 10/420 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 54 unsolved
Problem AtomicPropp61 is UNSAT
At refinement iteration 6 (OVERLAPS) 109/529 variables, 43/50 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/50 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 1/530 variables, 1/51 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/51 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 498/1028 variables, 530/581 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1028 variables, 0/581 constraints. Problems are: Problem set: 11 solved, 53 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1028/1028 variables, and 581 constraints, problems are : Problem set: 11 solved, 53 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 530/530 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 326/409 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/409 variables, 1/5 constraints. Problems are: Problem set: 11 solved, 53 unsolved
[2024-05-31 22:21:49] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 23 ms to minimize.
[2024-05-31 22:21:49] [INFO ] Deduced a trap composed of 324 places in 134 ms of which 3 ms to minimize.
[2024-05-31 22:21:49] [INFO ] Deduced a trap composed of 354 places in 124 ms of which 3 ms to minimize.
[2024-05-31 22:21:50] [INFO ] Deduced a trap composed of 325 places in 111 ms of which 2 ms to minimize.
[2024-05-31 22:21:50] [INFO ] Deduced a trap composed of 330 places in 122 ms of which 3 ms to minimize.
[2024-05-31 22:21:50] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 3 ms to minimize.
[2024-05-31 22:21:50] [INFO ] Deduced a trap composed of 349 places in 106 ms of which 3 ms to minimize.
[2024-05-31 22:21:50] [INFO ] Deduced a trap composed of 360 places in 105 ms of which 3 ms to minimize.
[2024-05-31 22:21:50] [INFO ] Deduced a trap composed of 360 places in 100 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/409 variables, 9/14 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/409 variables, 0/14 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 10/419 variables, 2/16 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/419 variables, 0/16 constraints. Problems are: Problem set: 11 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 110/529 variables, 43/59 constraints. Problems are: Problem set: 11 solved, 53 unsolved
[2024-05-31 22:21:53] [INFO ] Deduced a trap composed of 16 places in 164 ms of which 3 ms to minimize.
[2024-05-31 22:21:53] [INFO ] Deduced a trap composed of 30 places in 140 ms of which 6 ms to minimize.
[2024-05-31 22:21:53] [INFO ] Deduced a trap composed of 29 places in 141 ms of which 3 ms to minimize.
[2024-05-31 22:21:53] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 4 ms to minimize.
[2024-05-31 22:21:53] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 4 ms to minimize.
[2024-05-31 22:21:53] [INFO ] Deduced a trap composed of 43 places in 138 ms of which 3 ms to minimize.
[2024-05-31 22:21:54] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 3 ms to minimize.
[2024-05-31 22:21:54] [INFO ] Deduced a trap composed of 230 places in 139 ms of which 4 ms to minimize.
SMT process timed out in 10163ms, After SMT, problems are : Problem set: 11 solved, 53 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 83 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 498/498 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 530 transition count 443
Reduce places removed 55 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 1 with 71 rules applied. Total rules applied 126 place count 475 transition count 427
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 142 place count 459 transition count 427
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 142 place count 459 transition count 408
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 180 place count 440 transition count 408
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 5 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 3 with 108 rules applied. Total rules applied 288 place count 386 transition count 354
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 308 place count 376 transition count 354
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 310 place count 376 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 312 place count 374 transition count 352
Free-agglomeration rule (complex) applied 45 times.
Iterating global reduction 4 with 45 rules applied. Total rules applied 357 place count 374 transition count 307
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 4 with 45 rules applied. Total rules applied 402 place count 329 transition count 307
Partial Free-agglomeration rule applied 31 times.
Drop transitions (Partial Free agglomeration) removed 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 433 place count 329 transition count 307
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 434 place count 329 transition count 307
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 435 place count 328 transition count 306
Applied a total of 435 rules in 157 ms. Remains 328 /530 variables (removed 202) and now considering 306/498 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 328/530 places, 306/498 transitions.
RANDOM walk for 40000 steps (3679 resets) in 736 ms. (54 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (263 resets) in 28 ms. (137 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (264 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (255 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (289 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (265 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (265 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (251 resets) in 42 ms. (93 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (257 resets) in 28 ms. (137 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (274 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (276 resets) in 53 ms. (74 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (264 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (262 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (273 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (265 resets) in 34 ms. (114 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (264 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (254 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (267 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (262 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (277 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (261 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (267 resets) in 19 ms. (200 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (265 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (261 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (270 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (268 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (265 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (269 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (252 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (272 resets) in 22 ms. (174 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (234 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (268 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (260 resets) in 24 ms. (160 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (265 resets) in 35 ms. (111 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (254 resets) in 37 ms. (105 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (263 resets) in 27 ms. (142 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (260 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (269 resets) in 23 ms. (166 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (251 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (266 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (271 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (265 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (258 resets) in 32 ms. (121 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4004 steps (271 resets) in 21 ms. (182 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (255 resets) in 20 ms. (190 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (265 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (254 resets) in 25 ms. (153 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (262 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (266 resets) in 31 ms. (125 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4000 steps (257 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (265 resets) in 21 ms. (181 steps per ms) remains 53/53 properties
Interrupted probabilistic random walk after 195791 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :6 out of 53
Probabilistic random walk after 195791 steps, saw 97935 distinct states, run finished after 3005 ms. (steps per millisecond=65 ) properties seen :6
// Phase 1: matrix 306 rows 328 cols
[2024-05-31 22:21:58] [INFO ] Computed 51 invariants in 23 ms
[2024-05-31 22:21:58] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 239/313 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 11/324 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/324 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 306/630 variables, 324/373 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 15/388 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 4/634 variables, 4/392 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/634 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/634 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/634 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 634/634 variables, and 394 constraints, problems are : Problem set: 0 solved, 47 unsolved in 3557 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 328/328 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 239/313 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 59 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 73 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 71 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 63 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 63 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 66 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 62 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:22:02] [INFO ] Deduced a trap composed of 76 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 11/55 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 79 places in 38 ms of which 1 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 64 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 73 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/313 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/313 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 11/324 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-05-31 22:22:03] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 3 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 3 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 50 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 0 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 48 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:04] [INFO ] Deduced a trap composed of 60 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 113 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 128 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 121 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 109 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
Problem AtomicPropp48 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 20/84 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 67 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 104 places in 93 ms of which 6 ms to minimize.
[2024-05-31 22:22:05] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 115 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 102 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 139 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 128 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 114 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 87 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 88 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 120 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:22:06] [INFO ] Deduced a trap composed of 116 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 131 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 131 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 111 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 114 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 106 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/324 variables, 20/104 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 138 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 130 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 107 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 75 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:07] [INFO ] Deduced a trap composed of 142 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 121 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 129 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 102 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 143 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 111 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 139 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:08] [INFO ] Deduced a trap composed of 137 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 147 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 113 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 117 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 132 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/324 variables, 20/124 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 113 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 107 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 141 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 144 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 133 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:09] [INFO ] Deduced a trap composed of 113 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 118 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 113 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 136 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 114 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 85 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 93 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 91 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 90 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:22:10] [INFO ] Deduced a trap composed of 99 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 104 places in 53 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/324 variables, 20/144 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 135 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 114 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 116 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 127 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 122 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:22:11] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 1 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 121 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 129 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 138 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 95 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 147 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 138 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 139 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 147 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 113 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:12] [INFO ] Deduced a trap composed of 103 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 129 places in 82 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/324 variables, 20/164 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 109 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 132 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 110 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 110 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 120 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 140 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 137 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 134 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:13] [INFO ] Deduced a trap composed of 148 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 140 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 113 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 123 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 118 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 118 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 106 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 113 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 120 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:14] [INFO ] Deduced a trap composed of 112 places in 87 ms of which 3 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 129 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 153 places in 83 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/324 variables, 20/184 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 108 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 137 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 141 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 108 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 126 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 119 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:15] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 135 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 110 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 136 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 114 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 102 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 115 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 125 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 138 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:16] [INFO ] Deduced a trap composed of 125 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:17] [INFO ] Deduced a trap composed of 120 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:22:17] [INFO ] Deduced a trap composed of 130 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:17] [INFO ] Deduced a trap composed of 127 places in 84 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/324 variables, 20/204 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:17] [INFO ] Deduced a trap composed of 93 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:22:17] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:22:17] [INFO ] Deduced a trap composed of 92 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:22:17] [INFO ] Deduced a trap composed of 121 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 132 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 103 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 126 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 149 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 133 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 138 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 110 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 108 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 134 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:22:18] [INFO ] Deduced a trap composed of 131 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 117 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 146 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 134 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 136 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 138 places in 85 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/324 variables, 20/224 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 123 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 121 places in 90 ms of which 1 ms to minimize.
[2024-05-31 22:22:19] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 3 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 101 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 95 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 94 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 147 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 132 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 134 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 109 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 101 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 105 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:20] [INFO ] Deduced a trap composed of 110 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:21] [INFO ] Deduced a trap composed of 101 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:22:21] [INFO ] Deduced a trap composed of 117 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:22:21] [INFO ] Deduced a trap composed of 73 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:22:21] [INFO ] Deduced a trap composed of 99 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:22:21] [INFO ] Deduced a trap composed of 101 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:21] [INFO ] Deduced a trap composed of 104 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:21] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/324 variables, 20/244 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:21] [INFO ] Deduced a trap composed of 126 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:21] [INFO ] Deduced a trap composed of 96 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 102 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 104 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 97 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 106 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 104 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 99 places in 63 ms of which 2 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 113 places in 62 ms of which 2 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 109 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 116 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 120 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:22:22] [INFO ] Deduced a trap composed of 129 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 119 places in 64 ms of which 2 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 113 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 111 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 101 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:23] [INFO ] Deduced a trap composed of 117 places in 83 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/324 variables, 20/264 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 105 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 129 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 105 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 102 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 131 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 107 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 136 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 104 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 113 places in 78 ms of which 1 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 137 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 105 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 110 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:22:24] [INFO ] Deduced a trap composed of 109 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 111 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 110 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 139 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 113 places in 55 ms of which 2 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 104 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 108 places in 82 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/324 variables, 20/284 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:25] [INFO ] Deduced a trap composed of 103 places in 101 ms of which 2 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 98 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 102 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 104 places in 90 ms of which 3 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 133 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:22:26] [INFO ] Deduced a trap composed of 124 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 72 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 86 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 88 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 97 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 92 places in 54 ms of which 2 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 89 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 91 places in 58 ms of which 2 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 92 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 93 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:27] [INFO ] Deduced a trap composed of 92 places in 52 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/324 variables, 20/304 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 138 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 135 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 115 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 152 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 118 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 141 places in 81 ms of which 1 ms to minimize.
[2024-05-31 22:22:28] [INFO ] Deduced a trap composed of 134 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 112 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 148 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 142 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 139 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 116 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 139 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 142 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 150 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 145 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 133 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:29] [INFO ] Deduced a trap composed of 149 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:30] [INFO ] Deduced a trap composed of 142 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:30] [INFO ] Deduced a trap composed of 154 places in 81 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/324 variables, 20/324 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:30] [INFO ] Deduced a trap composed of 136 places in 90 ms of which 1 ms to minimize.
[2024-05-31 22:22:30] [INFO ] Deduced a trap composed of 143 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:30] [INFO ] Deduced a trap composed of 147 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:22:30] [INFO ] Deduced a trap composed of 145 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:30] [INFO ] Deduced a trap composed of 134 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 149 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 129 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 122 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 105 places in 86 ms of which 1 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 102 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 154 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 125 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 132 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:31] [INFO ] Deduced a trap composed of 134 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:32] [INFO ] Deduced a trap composed of 107 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:32] [INFO ] Deduced a trap composed of 136 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:22:32] [INFO ] Deduced a trap composed of 110 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:32] [INFO ] Deduced a trap composed of 115 places in 83 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/324 variables, 20/344 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 126 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 106 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 131 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 115 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 96 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 142 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 140 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 127 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:33] [INFO ] Deduced a trap composed of 125 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 113 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 93 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 110 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 131 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 138 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 132 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 137 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 105 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 135 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:34] [INFO ] Deduced a trap composed of 131 places in 86 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/324 variables, 20/364 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 148 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 128 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 115 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 128 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 140 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 138 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:35] [INFO ] Deduced a trap composed of 116 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 114 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 129 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 107 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 116 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 131 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 114 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 136 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 134 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:36] [INFO ] Deduced a trap composed of 107 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:22:37] [INFO ] Deduced a trap composed of 121 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:37] [INFO ] Deduced a trap composed of 125 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:37] [INFO ] Deduced a trap composed of 105 places in 88 ms of which 3 ms to minimize.
[2024-05-31 22:22:37] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/324 variables, 20/384 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:38] [INFO ] Deduced a trap composed of 95 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:38] [INFO ] Deduced a trap composed of 111 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:38] [INFO ] Deduced a trap composed of 144 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:38] [INFO ] Deduced a trap composed of 133 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 134 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 141 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 101 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 158 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 117 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 139 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 101 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 128 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 145 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 97 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:22:39] [INFO ] Deduced a trap composed of 142 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:22:40] [INFO ] Deduced a trap composed of 139 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:40] [INFO ] Deduced a trap composed of 148 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:40] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 1 ms to minimize.
[2024-05-31 22:22:40] [INFO ] Deduced a trap composed of 128 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:40] [INFO ] Deduced a trap composed of 136 places in 84 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/324 variables, 20/404 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:40] [INFO ] Deduced a trap composed of 89 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:22:40] [INFO ] Deduced a trap composed of 95 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 109 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 116 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 2 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 97 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 93 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 101 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:22:41] [INFO ] Deduced a trap composed of 93 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 109 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 93 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 104 places in 53 ms of which 2 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 107 places in 52 ms of which 2 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 104 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 105 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 107 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 105 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 105 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 57 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:22:42] [INFO ] Deduced a trap composed of 105 places in 53 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/324 variables, 20/424 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 129 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 142 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 122 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 111 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 143 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 149 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 127 places in 62 ms of which 1 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 111 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 146 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 109 places in 65 ms of which 2 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 130 places in 74 ms of which 1 ms to minimize.
[2024-05-31 22:22:44] [INFO ] Deduced a trap composed of 136 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 116 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 120 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 118 places in 68 ms of which 1 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 117 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 124 places in 70 ms of which 1 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 122 places in 70 ms of which 2 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 130 places in 66 ms of which 1 ms to minimize.
[2024-05-31 22:22:45] [INFO ] Deduced a trap composed of 123 places in 81 ms of which 3 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/324 variables, 20/444 constraints. Problems are: Problem set: 1 solved, 46 unsolved
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 137 places in 98 ms of which 2 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 127 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 129 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 130 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 145 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 126 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 130 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:46] [INFO ] Deduced a trap composed of 117 places in 101 ms of which 2 ms to minimize.
SMT process timed out in 48652ms, After SMT, problems are : Problem set: 1 solved, 46 unsolved
Fused 46 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 71 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 306/306 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 328 transition count 304
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 326 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 324 transition count 302
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 22 place count 317 transition count 295
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 316 transition count 296
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 316 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 26 place count 315 transition count 295
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 28 place count 315 transition count 293
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 30 place count 313 transition count 293
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 32 place count 313 transition count 293
Applied a total of 32 rules in 76 ms. Remains 313 /328 variables (removed 15) and now considering 293/306 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 313/328 places, 293/306 transitions.
RANDOM walk for 40000 steps (4320 resets) in 410 ms. (97 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (298 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (308 resets) in 37 ms. (105 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (299 resets) in 35 ms. (111 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (301 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (292 resets) in 25 ms. (153 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (308 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (281 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (294 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (299 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (295 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (289 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (293 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (304 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (275 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (299 resets) in 34 ms. (114 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (303 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (301 resets) in 29 ms. (133 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (300 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (322 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (306 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (322 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (302 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (305 resets) in 28 ms. (137 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (287 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (310 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (298 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (294 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (287 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (293 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (293 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (314 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (300 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (295 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (300 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (306 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (284 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (312 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (293 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (292 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (296 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (303 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (308 resets) in 42 ms. (93 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (312 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (303 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (307 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (317 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
Interrupted probabilistic random walk after 223180 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :0 out of 46
Probabilistic random walk after 223180 steps, saw 111658 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
// Phase 1: matrix 293 rows 313 cols
[2024-05-31 22:22:50] [INFO ] Computed 51 invariants in 11 ms
[2024-05-31 22:22:50] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 227/298 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 11/309 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (OVERLAPS) 293/602 variables, 309/358 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 19/377 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 4/606 variables, 4/381 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/606 variables, 2/383 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/606 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/606 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 383 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3886 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 313/313 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 227/298 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:22:54] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 128 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 135 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 51 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:55] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 51 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 67 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 92 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 135 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 51 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 104 places in 79 ms of which 1 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:22:56] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 130 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 50 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 128 places in 80 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 93 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 51 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 56 places in 35 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 71 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 62 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:22:57] [INFO ] Deduced a trap composed of 64 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 59 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 111 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 0 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 145 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:22:58] [INFO ] Deduced a trap composed of 141 places in 77 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 98 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 131 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 147 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 2 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 136 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:22:59] [INFO ] Deduced a trap composed of 120 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 131 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 143 places in 92 ms of which 1 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 124 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 143 places in 84 ms of which 1 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 2 ms to minimize.
[2024-05-31 22:23:00] [INFO ] Deduced a trap composed of 46 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 15/104 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 11/309 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:23:01] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:23:02] [INFO ] Deduced a trap composed of 140 places in 84 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 293/602 variables, 309/420 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 19/439 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/602 variables, 46/485 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-31 22:23:08] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 62 places in 49 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 69 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 67 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 66 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 70 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:23:09] [INFO ] Deduced a trap composed of 69 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:23:11] [INFO ] Deduced a trap composed of 64 places in 46 ms of which 1 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 120 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 114 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 125 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 127 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:23:12] [INFO ] Deduced a trap composed of 123 places in 92 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/602 variables, 20/505 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:23:17] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:23:18] [INFO ] Deduced a trap composed of 73 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:23:18] [INFO ] Deduced a trap composed of 74 places in 65 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/602 variables, 3/508 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:23:22] [INFO ] Deduced a trap composed of 92 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:23:22] [INFO ] Deduced a trap composed of 88 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:23:22] [INFO ] Deduced a trap composed of 80 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:23:22] [INFO ] Deduced a trap composed of 84 places in 58 ms of which 1 ms to minimize.
[2024-05-31 22:23:22] [INFO ] Deduced a trap composed of 79 places in 61 ms of which 1 ms to minimize.
[2024-05-31 22:23:22] [INFO ] Deduced a trap composed of 80 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:23:22] [INFO ] Deduced a trap composed of 83 places in 61 ms of which 5 ms to minimize.
[2024-05-31 22:23:23] [INFO ] Deduced a trap composed of 81 places in 53 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/602 variables, 8/516 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:23:29] [INFO ] Deduced a trap composed of 114 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:23:29] [INFO ] Deduced a trap composed of 118 places in 96 ms of which 2 ms to minimize.
[2024-05-31 22:23:29] [INFO ] Deduced a trap composed of 115 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:23:29] [INFO ] Deduced a trap composed of 90 places in 92 ms of which 2 ms to minimize.
[2024-05-31 22:23:29] [INFO ] Deduced a trap composed of 130 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:23:29] [INFO ] Deduced a trap composed of 129 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:23:29] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:23:30] [INFO ] Deduced a trap composed of 118 places in 85 ms of which 1 ms to minimize.
[2024-05-31 22:23:30] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:23:30] [INFO ] Deduced a trap composed of 67 places in 43 ms of which 0 ms to minimize.
[2024-05-31 22:23:31] [INFO ] Deduced a trap composed of 112 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:23:31] [INFO ] Deduced a trap composed of 110 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:23:31] [INFO ] Deduced a trap composed of 113 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:23:31] [INFO ] Deduced a trap composed of 124 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:23:32] [INFO ] Deduced a trap composed of 128 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:23:32] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:23:33] [INFO ] Deduced a trap composed of 51 places in 48 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/602 variables, 17/533 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:23:36] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/602 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:23:41] [INFO ] Deduced a trap composed of 92 places in 59 ms of which 1 ms to minimize.
[2024-05-31 22:23:41] [INFO ] Deduced a trap composed of 93 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:23:41] [INFO ] Deduced a trap composed of 91 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:23:41] [INFO ] Deduced a trap composed of 97 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:23:42] [INFO ] Deduced a trap composed of 109 places in 68 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/602 variables, 5/539 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/602 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 20 (OVERLAPS) 4/606 variables, 4/543 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 2/545 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:23:58] [INFO ] Deduced a trap composed of 114 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:23:58] [INFO ] Deduced a trap composed of 113 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:23:58] [INFO ] Deduced a trap composed of 102 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:23:58] [INFO ] Deduced a trap composed of 96 places in 88 ms of which 1 ms to minimize.
[2024-05-31 22:23:59] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 1 ms to minimize.
[2024-05-31 22:24:00] [INFO ] Deduced a trap composed of 116 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:24:01] [INFO ] Deduced a trap composed of 123 places in 83 ms of which 2 ms to minimize.
[2024-05-31 22:24:01] [INFO ] Deduced a trap composed of 116 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:24:01] [INFO ] Deduced a trap composed of 95 places in 73 ms of which 1 ms to minimize.
[2024-05-31 22:24:02] [INFO ] Deduced a trap composed of 100 places in 99 ms of which 2 ms to minimize.
[2024-05-31 22:24:02] [INFO ] Deduced a trap composed of 123 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:24:02] [INFO ] Deduced a trap composed of 119 places in 90 ms of which 2 ms to minimize.
[2024-05-31 22:24:02] [INFO ] Deduced a trap composed of 120 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:24:02] [INFO ] Deduced a trap composed of 117 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:24:02] [INFO ] Deduced a trap composed of 112 places in 91 ms of which 2 ms to minimize.
[2024-05-31 22:24:02] [INFO ] Deduced a trap composed of 126 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:24:02] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
[2024-05-31 22:24:03] [INFO ] Deduced a trap composed of 112 places in 89 ms of which 2 ms to minimize.
[2024-05-31 22:24:03] [INFO ] Deduced a trap composed of 132 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:24:03] [INFO ] Deduced a trap composed of 125 places in 85 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 20/565 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 606/606 variables, and 565 constraints, problems are : Problem set: 0 solved, 46 unsolved in 75015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 313/313 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 136/136 constraints]
After SMT, in 78931ms problems are : Problem set: 0 solved, 46 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 313 /313 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 313/313 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 313/313 places, 293/293 transitions.
Applied a total of 0 rules in 11 ms. Remains 313 /313 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-31 22:24:09] [INFO ] Invariant cache hit.
[2024-05-31 22:24:09] [INFO ] Implicit Places using invariants in 207 ms returned [21, 54, 127, 134, 163, 169, 170, 202, 209, 239, 245, 255, 273, 303, 310]
[2024-05-31 22:24:09] [INFO ] Actually due to overlaps returned [255, 134, 209, 127, 169, 202, 54]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 209 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 306/313 places, 293/293 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 306 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 292
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 305 transition count 292
Applied a total of 3 rules in 33 ms. Remains 305 /306 variables (removed 1) and now considering 292/293 (removed 1) transitions.
// Phase 1: matrix 292 rows 305 cols
[2024-05-31 22:24:09] [INFO ] Computed 44 invariants in 19 ms
[2024-05-31 22:24:09] [INFO ] Implicit Places using invariants in 178 ms returned [21, 160, 166, 233, 239, 265, 295, 302]
[2024-05-31 22:24:09] [INFO ] Actually due to overlaps returned [160, 295, 302, 239, 166, 233]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 180 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 299/313 places, 292/293 transitions.
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 299 transition count 292
Applied a total of 3 rules in 14 ms. Remains 299 /299 variables (removed 0) and now considering 292/292 (removed 0) transitions.
// Phase 1: matrix 292 rows 299 cols
[2024-05-31 22:24:10] [INFO ] Computed 38 invariants in 9 ms
[2024-05-31 22:24:10] [INFO ] Implicit Places using invariants in 150 ms returned [21, 261]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 150 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 297/313 places, 292/293 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 297 transition count 292
Applied a total of 1 rules in 14 ms. Remains 297 /297 variables (removed 0) and now considering 292/292 (removed 0) transitions.
// Phase 1: matrix 292 rows 297 cols
[2024-05-31 22:24:10] [INFO ] Computed 36 invariants in 11 ms
[2024-05-31 22:24:10] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-31 22:24:10] [INFO ] Invariant cache hit.
[2024-05-31 22:24:10] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-31 22:24:11] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 986 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 297/313 places, 292/293 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1597 ms. Remains : 297/313 places, 292/293 transitions.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-010-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 25 ms
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 24 ms
[2024-05-31 22:24:11] [INFO ] Input system was already deterministic with 498 transitions.
Support contains 83 out of 530 places (down from 87) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 900 edges and 530 vertex of which 527 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 528 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 528 transition count 497
Applied a total of 3 rules in 74 ms. Remains 528 /530 variables (removed 2) and now considering 497/498 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 528/530 places, 497/498 transitions.
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 26 ms
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 21 ms
[2024-05-31 22:24:11] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 498
Applied a total of 1 rules in 19 ms. Remains 529 /530 variables (removed 1) and now considering 498/498 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 529/530 places, 498/498 transitions.
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 30 ms
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 18 ms
[2024-05-31 22:24:11] [INFO ] Input system was already deterministic with 498 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Graph (complete) has 900 edges and 530 vertex of which 528 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 114 place count 527 transition count 383
Reduce places removed 113 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 116 rules applied. Total rules applied 230 place count 414 transition count 380
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 233 place count 411 transition count 380
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 233 place count 411 transition count 360
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 273 place count 391 transition count 360
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 397 place count 329 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 398 place count 328 transition count 297
Applied a total of 398 rules in 52 ms. Remains 328 /530 variables (removed 202) and now considering 297/498 (removed 201) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 328/530 places, 297/498 transitions.
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:24:11] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 528 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 528 transition count 497
Applied a total of 3 rules in 46 ms. Remains 528 /530 variables (removed 2) and now considering 497/498 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 528/530 places, 497/498 transitions.
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 16 ms
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 17 ms
[2024-05-31 22:24:11] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 528 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 528 transition count 497
Applied a total of 3 rules in 37 ms. Remains 528 /530 variables (removed 2) and now considering 497/498 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 528/530 places, 497/498 transitions.
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 16 ms
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 17 ms
[2024-05-31 22:24:11] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 528 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 528 transition count 497
Applied a total of 3 rules in 48 ms. Remains 528 /530 variables (removed 2) and now considering 497/498 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 528/530 places, 497/498 transitions.
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 25 ms
[2024-05-31 22:24:11] [INFO ] Flatten gal took : 19 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Graph (complete) has 900 edges and 530 vertex of which 528 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 527 transition count 386
Reduce places removed 110 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 113 rules applied. Total rules applied 224 place count 417 transition count 383
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 227 place count 414 transition count 383
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 227 place count 414 transition count 363
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 267 place count 394 transition count 363
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 399 place count 328 transition count 297
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 401 place count 328 transition count 297
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 402 place count 327 transition count 296
Applied a total of 402 rules in 82 ms. Remains 327 /530 variables (removed 203) and now considering 296/498 (removed 202) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 82 ms. Remains : 327/530 places, 296/498 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 296 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Graph (complete) has 900 edges and 530 vertex of which 528 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 117 rules applied. Total rules applied 118 place count 527 transition count 379
Reduce places removed 117 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 119 rules applied. Total rules applied 237 place count 410 transition count 377
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 239 place count 408 transition count 377
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 239 place count 408 transition count 358
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 277 place count 389 transition count 358
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 419 place count 318 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 420 place count 317 transition count 286
Applied a total of 420 rules in 37 ms. Remains 317 /530 variables (removed 213) and now considering 286/498 (removed 212) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 317/530 places, 286/498 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 528 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 528 transition count 497
Applied a total of 3 rules in 28 ms. Remains 528 /530 variables (removed 2) and now considering 497/498 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 528/530 places, 497/498 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 25 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 16 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 528 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 528 transition count 497
Applied a total of 3 rules in 29 ms. Remains 528 /530 variables (removed 2) and now considering 497/498 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 528/530 places, 497/498 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in LTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 529 transition count 498
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 528 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 528 transition count 497
Applied a total of 3 rules in 29 ms. Remains 528 /530 variables (removed 2) and now considering 497/498 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 528/530 places, 497/498 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 497 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Graph (complete) has 900 edges and 530 vertex of which 528 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 527 transition count 376
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 241 place count 407 transition count 376
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 241 place count 407 transition count 357
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 279 place count 388 transition count 357
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 140 rules applied. Total rules applied 419 place count 318 transition count 287
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 420 place count 317 transition count 286
Applied a total of 420 rules in 28 ms. Remains 317 /530 variables (removed 213) and now considering 286/498 (removed 212) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 317/530 places, 286/498 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Graph (complete) has 900 edges and 530 vertex of which 528 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 120 place count 527 transition count 377
Reduce places removed 119 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 121 rules applied. Total rules applied 241 place count 408 transition count 375
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 243 place count 406 transition count 375
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 243 place count 406 transition count 356
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 281 place count 387 transition count 356
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 142 rules applied. Total rules applied 423 place count 316 transition count 285
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 424 place count 316 transition count 285
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 425 place count 315 transition count 284
Applied a total of 425 rules in 35 ms. Remains 315 /530 variables (removed 215) and now considering 284/498 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 315/530 places, 284/498 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Graph (complete) has 900 edges and 530 vertex of which 528 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 111 place count 527 transition count 386
Reduce places removed 110 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 115 rules applied. Total rules applied 226 place count 417 transition count 381
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 231 place count 412 transition count 381
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 231 place count 412 transition count 362
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 269 place count 393 transition count 362
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 409 place count 323 transition count 292
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 410 place count 323 transition count 292
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 411 place count 322 transition count 291
Applied a total of 411 rules in 38 ms. Remains 322 /530 variables (removed 208) and now considering 291/498 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 322/530 places, 291/498 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 291 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 530/530 places, 498/498 transitions.
Graph (complete) has 900 edges and 530 vertex of which 528 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 527 transition count 376
Reduce places removed 120 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 407 transition count 375
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 243 place count 406 transition count 375
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 243 place count 406 transition count 356
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 281 place count 387 transition count 356
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 425 place count 315 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 426 place count 314 transition count 283
Applied a total of 426 rules in 29 ms. Remains 314 /530 variables (removed 216) and now considering 283/498 (removed 215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 314/530 places, 283/498 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:24:12] [INFO ] Input system was already deterministic with 283 transitions.
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:24:12] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:24:12] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:24:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 530 places, 498 transitions and 1398 arcs took 6 ms.
Total runtime 151797 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 : DoubleExponent-PT-010-CTLCardinality-2024-00
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-01
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-02
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-03
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-04
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-05
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-07
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-08
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-09
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-10
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2024-11
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2023-12
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2023-13
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2023-14
Could not compute solution for formula : DoubleExponent-PT-010-CTLCardinality-2023-15

BK_STOP 1717194253237

--------------------
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 DoubleExponent-PT-010-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/2219/ctl_0_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/2219/ctl_1_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/2219/ctl_2_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/2219/ctl_3_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/2219/ctl_4_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/2219/ctl_5_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/2219/ctl_6_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/2219/ctl_7_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/2219/ctl_8_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/2219/ctl_9_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/2219/ctl_10_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/2219/ctl_11_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/2219/ctl_12_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/2219/ctl_13_
ctl formula name DoubleExponent-PT-010-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/2219/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="DoubleExponent-PT-010"
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 DoubleExponent-PT-010, 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-171631132900553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-010.tgz
mv DoubleExponent-PT-010 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 ;