MCC'2024- Execution of r528-tall-171683762000842

About the Execution of LTSMin+red for ShieldRVs-PT-040B

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1325.483	146674.00	218536.00	315.40	????T???????????	normal

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.r528-tall-171683762000842.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 ShieldRVs-PT-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762000842
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 960K
-rw-r--r-- 1 mcc users 6.0K 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 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 17:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 498K May 18 16:43 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 ShieldRVs-PT-040B-CTLFireability-2024-00
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-01
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-02
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-03
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-04
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-05
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-06
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-07
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-08
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-09
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-10
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2024-11
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2023-12
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2023-13
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2023-14
FORMULA_NAME ShieldRVs-PT-040B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717269262143

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 19:14:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 19:14:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 19:14:23] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-06-01 19:14:23] [INFO ] Transformed 1603 places.
[2024-06-01 19:14:23] [INFO ] Transformed 1803 transitions.
[2024-06-01 19:14:23] [INFO ] Found NUPN structural information;
[2024-06-01 19:14:23] [INFO ] Parsed PT model containing 1603 places and 1803 transitions and 5760 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 187 out of 1603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1603/1603 places, 1803/1803 transitions.
Discarding 243 places :
Symmetric choice reduction at 0 with 243 rule applications. Total rules 243 place count 1360 transition count 1560
Iterating global reduction 0 with 243 rules applied. Total rules applied 486 place count 1360 transition count 1560
Applied a total of 486 rules in 211 ms. Remains 1360 /1603 variables (removed 243) and now considering 1560/1803 (removed 243) transitions.
// Phase 1: matrix 1560 rows 1360 cols
[2024-06-01 19:14:24] [INFO ] Computed 161 invariants in 30 ms
[2024-06-01 19:14:24] [INFO ] Implicit Places using invariants in 584 ms returned []
[2024-06-01 19:14:24] [INFO ] Invariant cache hit.
[2024-06-01 19:14:25] [INFO ] Implicit Places using invariants and state equation in 1070 ms returned []
Implicit Place search using SMT with State Equation took 1687 ms to find 0 implicit places.
Running 1559 sub problems to find dead transitions.
[2024-06-01 19:14:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1359 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1559 unsolved
SMT process timed out in 30597ms, After SMT, problems are : Problem set: 0 solved, 1559 unsolved
Search for dead transitions found 0 dead transitions in 30627ms
Starting structural reductions in LTL mode, iteration 1 : 1360/1603 places, 1560/1803 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32555 ms. Remains : 1360/1603 places, 1560/1803 transitions.
Support contains 187 out of 1360 places after structural reductions.
[2024-06-01 19:14:56] [INFO ] Flatten gal took : 148 ms
[2024-06-01 19:14:56] [INFO ] Flatten gal took : 84 ms
[2024-06-01 19:14:56] [INFO ] Input system was already deterministic with 1560 transitions.
Support contains 184 out of 1360 places (down from 187) after GAL structural reductions.
RANDOM walk for 40000 steps (20 resets) in 4355 ms. (9 steps per ms) remains 14/100 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 111 ms. (357 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 14/14 properties
[2024-06-01 19:14:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 471/521 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 839/1360 variables, 113/161 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1360 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1560/2920 variables, 1360/1521 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2920 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/2920 variables, 0/1521 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2920/2920 variables, and 1521 constraints, problems are : Problem set: 0 solved, 14 unsolved in 2079 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1360/1360 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 471/521 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 19:15:01] [INFO ] Deduced a trap composed of 48 places in 165 ms of which 29 ms to minimize.
[2024-06-01 19:15:01] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2024-06-01 19:15:01] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 1 ms to minimize.
[2024-06-01 19:15:01] [INFO ] Deduced a trap composed of 55 places in 217 ms of which 1 ms to minimize.
[2024-06-01 19:15:01] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:15:01] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
Problem AtomicPropp22 is UNSAT
[2024-06-01 19:15:02] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 12 ms to minimize.
[2024-06-01 19:15:02] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/521 variables, 8/56 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-06-01 19:15:02] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 16 ms to minimize.
[2024-06-01 19:15:02] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 2/58 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-06-01 19:15:02] [INFO ] Deduced a trap composed of 61 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:15:02] [INFO ] Deduced a trap composed of 46 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:15:02] [INFO ] Deduced a trap composed of 51 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:15:03] [INFO ] Deduced a trap composed of 50 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:15:03] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:03] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/521 variables, 6/64 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/521 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 839/1360 variables, 113/177 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-06-01 19:15:03] [INFO ] Deduced a trap composed of 20 places in 261 ms of which 5 ms to minimize.
[2024-06-01 19:15:04] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 5 ms to minimize.
[2024-06-01 19:15:04] [INFO ] Deduced a trap composed of 26 places in 252 ms of which 4 ms to minimize.
[2024-06-01 19:15:04] [INFO ] Deduced a trap composed of 34 places in 252 ms of which 5 ms to minimize.
[2024-06-01 19:15:04] [INFO ] Deduced a trap composed of 41 places in 249 ms of which 4 ms to minimize.
[2024-06-01 19:15:05] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 4 ms to minimize.
[2024-06-01 19:15:05] [INFO ] Deduced a trap composed of 41 places in 235 ms of which 4 ms to minimize.
[2024-06-01 19:15:05] [INFO ] Deduced a trap composed of 47 places in 257 ms of which 4 ms to minimize.
[2024-06-01 19:15:05] [INFO ] Deduced a trap composed of 49 places in 217 ms of which 4 ms to minimize.
SMT process timed out in 7236ms, After SMT, problems are : Problem set: 1 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 1360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 149 place count 1360 transition count 1411
Reduce places removed 149 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 151 rules applied. Total rules applied 300 place count 1211 transition count 1409
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 302 place count 1209 transition count 1409
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 198 Pre rules applied. Total rules applied 302 place count 1209 transition count 1211
Deduced a syphon composed of 198 places in 3 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 3 with 396 rules applied. Total rules applied 698 place count 1011 transition count 1211
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 724 place count 985 transition count 1185
Iterating global reduction 3 with 26 rules applied. Total rules applied 750 place count 985 transition count 1185
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 750 place count 985 transition count 1176
Deduced a syphon composed of 9 places in 18 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 768 place count 976 transition count 1176
Performed 373 Post agglomeration using F-continuation condition.Transition count delta: 373
Deduced a syphon composed of 373 places in 11 ms
Reduce places removed 373 places and 0 transitions.
Iterating global reduction 3 with 746 rules applied. Total rules applied 1514 place count 603 transition count 803
Partial Free-agglomeration rule applied 77 times.
Drop transitions (Partial Free agglomeration) removed 77 transitions
Iterating global reduction 3 with 77 rules applied. Total rules applied 1591 place count 603 transition count 803
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1592 place count 602 transition count 802
Applied a total of 1592 rules in 505 ms. Remains 602 /1360 variables (removed 758) and now considering 802/1560 (removed 758) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 506 ms. Remains : 602/1360 places, 802/1560 transitions.
RANDOM walk for 40000 steps (72 resets) in 557 ms. (71 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 224 ms. (177 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 4/5 properties
// Phase 1: matrix 802 rows 602 cols
[2024-06-01 19:15:06] [INFO ] Computed 161 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 250/327 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 485/812 variables, 327/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:07] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:15:08] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 19:15:08] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 2 ms to minimize.
[2024-06-01 19:15:08] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:15:08] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:08] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/812 variables, 6/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/812 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 276/1088 variables, 99/529 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1088 variables, 21/550 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:08] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/1088 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1088 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 17/1105 variables, 10/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1105 variables, 17/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1105 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 219/1324 variables, 102/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1324 variables, 22/702 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1324 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 19/1343 variables, 11/713 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1343 variables, 14/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1343 variables, 0/727 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 61/1404 variables, 43/770 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1404 variables, 12/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1404 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 0/1404 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1404/1404 variables, and 782 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2374 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 64/77 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 250/327 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 18/103 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:15:09] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 10/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 485/812 variables, 327/440 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/812 variables, 3/443 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 8 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-06-01 19:15:10] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 0 ms to minimize.
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/812 variables, 19/462 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/812 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/812 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:15:11] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/812 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/812 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 276/1088 variables, 99/566 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1088 variables, 21/587 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1088 variables, 1/588 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1088 variables, 1/589 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:12] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:15:12] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:15:12] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:15:12] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1088 variables, 4/593 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:12] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1088 variables, 1/594 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:12] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1088 variables, 1/595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:12] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1088 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1088 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 17/1105 variables, 10/606 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1105 variables, 17/623 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:12] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1105 variables, 1/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1105 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 219/1324 variables, 102/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1324 variables, 22/748 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:13] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:15:13] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:15:13] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:15:13] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:15:13] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1324 variables, 5/753 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:13] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/1324 variables, 1/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1324 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (OVERLAPS) 19/1343 variables, 11/765 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1343 variables, 14/779 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:13] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/1343 variables, 1/780 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:14] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:14] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1343 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1343 variables, 0/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 37 (OVERLAPS) 61/1404 variables, 43/825 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1404 variables, 12/837 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:14] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1404 variables, 2/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1404 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 41 (OVERLAPS) 0/1404 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1404/1404 variables, and 839 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5605 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 72/72 constraints]
After SMT, in 7990ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2774 ms.
Support contains 13 out of 602 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 602/602 places, 802/802 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 602 transition count 800
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 600 transition count 800
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 4 place count 600 transition count 789
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 26 place count 589 transition count 789
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 50 place count 577 transition count 777
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 55 place count 577 transition count 777
Applied a total of 55 rules in 150 ms. Remains 577 /602 variables (removed 25) and now considering 777/802 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 577/602 places, 777/802 transitions.
RANDOM walk for 40000 steps (80 resets) in 344 ms. (115 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 135 ms. (294 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 203297 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 4
Probabilistic random walk after 203297 steps, saw 49483 distinct states, run finished after 3004 ms. (steps per millisecond=67 ) properties seen :0
// Phase 1: matrix 777 rows 577 cols
[2024-06-01 19:15:21] [INFO ] Computed 161 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 61/74 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 240/314 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 2 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:21] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:22] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:15:22] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 12/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 472/786 variables, 314/411 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:22] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:15:22] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 2/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 273/1059 variables, 99/512 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1059 variables, 24/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1059 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 14/1073 variables, 7/543 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1073 variables, 14/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1073 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 218/1291 variables, 102/659 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1291 variables, 27/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1291 variables, 0/686 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 12/1303 variables, 6/692 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1303 variables, 12/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1303 variables, 0/704 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 51/1354 variables, 36/740 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1354 variables, 12/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1354 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/1354 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1354/1354 variables, and 752 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1756 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 61/74 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 240/314 variables, 70/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 7 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 11/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 472/786 variables, 314/424 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/786 variables, 3/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:15:23] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 3 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 23 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 20 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:24] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/786 variables, 17/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/786 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/786 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 273/1059 variables, 99/544 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1059 variables, 24/568 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1059 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1059 variables, 3/572 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1059 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1059 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 14/1073 variables, 7/581 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1073 variables, 14/595 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:25] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1073 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1073 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 218/1291 variables, 102/698 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1291 variables, 27/725 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1291 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1291 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 26 (OVERLAPS) 12/1303 variables, 6/732 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1303 variables, 12/744 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:15:26] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/1303 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1303 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 30 (OVERLAPS) 51/1354 variables, 36/782 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1354 variables, 12/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1354 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 33 (OVERLAPS) 0/1354 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1354/1354 variables, and 794 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4141 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 577/577 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 52/52 constraints]
After SMT, in 5907ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 1 properties in 2591 ms.
Support contains 11 out of 577 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 577/577 places, 777/777 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 575 transition count 775
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 574 transition count 774
Applied a total of 5 rules in 59 ms. Remains 574 /577 variables (removed 3) and now considering 774/777 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 574/577 places, 774/777 transitions.
RANDOM walk for 40000 steps (80 resets) in 319 ms. (125 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 209 ms. (190 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (9 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 225404 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 225404 steps, saw 54231 distinct states, run finished after 3001 ms. (steps per millisecond=75 ) properties seen :0
// Phase 1: matrix 774 rows 574 cols
[2024-06-01 19:15:33] [INFO ] Computed 161 invariants in 10 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/67 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 238/305 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 8/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 452/757 variables, 305/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:15:33] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 5/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/757 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 218/975 variables, 81/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 20/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:34] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/975 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/975 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 12/987 variables, 6/509 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/987 variables, 12/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/987 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 186/1173 variables, 78/599 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1173 variables, 20/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1173 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 12/1185 variables, 6/625 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1185 variables, 12/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1185 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 96/1281 variables, 48/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1281 variables, 14/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1281 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 4/1285 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1285 variables, 4/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1285 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 50/1335 variables, 24/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1335 variables, 6/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1335 variables, 0/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 4/1339 variables, 2/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1339 variables, 4/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1339 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 9/1348 variables, 6/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1348 variables, 2/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1348 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 0/1348 variables, 0/749 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1348/1348 variables, and 749 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1652 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 56/67 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 238/305 variables, 69/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 13/96 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:34] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:15:34] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 12/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 452/757 variables, 305/413 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/757 variables, 2/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:15:35] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/757 variables, 14/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/757 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 218/975 variables, 81/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/975 variables, 20/530 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/975 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/975 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:15:36] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/975 variables, 5/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/975 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 12/987 variables, 6/543 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/987 variables, 12/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/987 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/987 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 186/1173 variables, 78/634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1173 variables, 20/654 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1173 variables, 2/656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1173 variables, 0/656 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 12/1185 variables, 6/662 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1185 variables, 12/674 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:15:37] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1185 variables, 2/676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1185 variables, 0/676 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 96/1281 variables, 48/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1281 variables, 14/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:38] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:38] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:15:38] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1281 variables, 3/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1281 variables, 0/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 4/1285 variables, 2/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1285 variables, 4/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:38] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/1285 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1285 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 50/1335 variables, 24/772 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1335 variables, 6/778 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:38] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:15:38] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/1335 variables, 2/780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1335 variables, 0/780 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (OVERLAPS) 4/1339 variables, 2/782 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1339 variables, 4/786 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:39] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:15:39] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/1339 variables, 2/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/1339 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 9/1348 variables, 6/794 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/1348 variables, 2/796 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 19:15:39] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:15:39] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 4 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/1348 variables, 2/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/1348 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (OVERLAPS) 0/1348 variables, 0/798 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1348/1348 variables, and 798 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4869 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 574/574 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 60/60 constraints]
After SMT, in 6549ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2339 ms.
Support contains 11 out of 574 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 774/774 transitions.
Applied a total of 0 rules in 27 ms. Remains 574 /574 variables (removed 0) and now considering 774/774 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 574/574 places, 774/774 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 574/574 places, 774/774 transitions.
Applied a total of 0 rules in 16 ms. Remains 574 /574 variables (removed 0) and now considering 774/774 (removed 0) transitions.
[2024-06-01 19:15:42] [INFO ] Invariant cache hit.
[2024-06-01 19:15:42] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 19:15:42] [INFO ] Invariant cache hit.
[2024-06-01 19:15:42] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
[2024-06-01 19:15:43] [INFO ] Redundant transitions in 168 ms returned []
Running 770 sub problems to find dead transitions.
[2024-06-01 19:15:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 22 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 0 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:15:50] [INFO ] Deduced a trap composed of 31 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 0 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 31 places in 47 ms of which 1 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 0 ms to minimize.
[2024-06-01 19:15:51] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:15:52] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:52] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-06-01 19:15:52] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:52] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:52] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-01 19:15:52] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 19:15:52] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 0 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 0 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 33 places in 30 ms of which 0 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 32 places in 45 ms of which 1 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 0 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 0 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2024-06-01 19:15:53] [INFO ] Deduced a trap composed of 58 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:15:55] [INFO ] Deduced a trap composed of 71 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:15:55] [INFO ] Deduced a trap composed of 70 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:15:55] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:15:55] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:15:55] [INFO ] Deduced a trap composed of 73 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:15:55] [INFO ] Deduced a trap composed of 82 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:15:56] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 3 ms to minimize.
[2024-06-01 19:15:56] [INFO ] Deduced a trap composed of 83 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:15:56] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:15:56] [INFO ] Deduced a trap composed of 83 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:15:56] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:15:57] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:15:57] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:15:57] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:15:57] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:15:57] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:15:57] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:15:57] [INFO ] Deduced a trap composed of 73 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:15:57] [INFO ] Deduced a trap composed of 73 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:15:57] [INFO ] Deduced a trap composed of 74 places in 73 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:05] [INFO ] Deduced a trap composed of 83 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:16:05] [INFO ] Deduced a trap composed of 88 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:16:05] [INFO ] Deduced a trap composed of 87 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 73 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 82 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 83 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 88 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:16:06] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 26 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 50 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:07] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 45 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:16:08] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:09] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:16:09] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2024-06-01 19:16:09] [INFO ] Deduced a trap composed of 43 places in 43 ms of which 1 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 88 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 89 places in 74 ms of which 2 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 88 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 89 places in 78 ms of which 2 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 86 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 88 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:16:10] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 85 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 85 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:16:11] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 84 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:16:12] [INFO ] Deduced a trap composed of 90 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/1348 variables, and 182 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 82/161 constraints, State Equation: 0/574 constraints, PredecessorRefiner: 770/770 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 770 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/571 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 770 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/571 variables, 100/182 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 73 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 1 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 61 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:15] [INFO ] Deduced a trap composed of 63 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:16:16] [INFO ] Deduced a trap composed of 69 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:16:16] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:16] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:16:16] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 2 ms to minimize.
[2024-06-01 19:16:16] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:16:16] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:16] [INFO ] Deduced a trap composed of 65 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:17] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:16:17] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:17] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/571 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:18] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2024-06-01 19:16:19] [INFO ] Deduced a trap composed of 69 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:16:19] [INFO ] Deduced a trap composed of 77 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:19] [INFO ] Deduced a trap composed of 72 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:16:19] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:19] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:16:19] [INFO ] Deduced a trap composed of 76 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:19] [INFO ] Deduced a trap composed of 74 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:19] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:19] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 76 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 2 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 72 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:20] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/571 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 0 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 73 places in 76 ms of which 2 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 72 places in 70 ms of which 2 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 70 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 48 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 71 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:16:22] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 55 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 81 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:16:23] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/571 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 72 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 68 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 40 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:25] [INFO ] Deduced a trap composed of 72 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:16:26] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:26] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-06-01 19:16:26] [INFO ] Deduced a trap composed of 70 places in 61 ms of which 2 ms to minimize.
[2024-06-01 19:16:26] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:26] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:26] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:26] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:26] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:27] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 2 ms to minimize.
[2024-06-01 19:16:27] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:27] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:27] [INFO ] Deduced a trap composed of 65 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:27] [INFO ] Deduced a trap composed of 67 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:27] [INFO ] Deduced a trap composed of 66 places in 61 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/571 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 0 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 38 places in 44 ms of which 1 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 0 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-01 19:16:29] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 57 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 59 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:16:30] [INFO ] Deduced a trap composed of 49 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 68 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 1 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 69 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:31] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/571 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 67 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 66 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 70 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 68 places in 64 ms of which 2 ms to minimize.
[2024-06-01 19:16:33] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 70 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 2 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 50 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 70 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 62 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:34] [INFO ] Deduced a trap composed of 72 places in 60 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/571 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:36] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 0 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 50 places in 74 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2024-06-01 19:16:37] [INFO ] Deduced a trap composed of 72 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 56 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 77 places in 66 ms of which 2 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 75 places in 68 ms of which 2 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 76 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 54 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:38] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 770 unsolved
[2024-06-01 19:16:41] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:16:41] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:41] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 2 ms to minimize.
[2024-06-01 19:16:41] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:41] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2024-06-01 19:16:41] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 1 ms to minimize.
[2024-06-01 19:16:41] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 54 places in 70 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 75 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 31 places in 61 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 31 places in 64 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2024-06-01 19:16:42] [INFO ] Deduced a trap composed of 78 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 770 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/1348 variables, and 342 constraints, problems are : Problem set: 0 solved, 770 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 82/161 constraints, State Equation: 0/574 constraints, PredecessorRefiner: 0/770 constraints, Known Traps: 260/260 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 770 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61356 ms. Remains : 574/574 places, 774/774 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-01 19:16:43] [INFO ] Flatten gal took : 63 ms
[2024-06-01 19:16:43] [INFO ] Flatten gal took : 56 ms
[2024-06-01 19:16:43] [INFO ] Input system was already deterministic with 1560 transitions.
Support contains 181 out of 1360 places (down from 182) after GAL structural reductions.
Computed a total of 344 stabilizing places and 344 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1359 transition count 1398
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1198 transition count 1398
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 322 place count 1198 transition count 1199
Deduced a syphon composed of 199 places in 2 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 720 place count 999 transition count 1199
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 757 place count 962 transition count 1162
Iterating global reduction 2 with 37 rules applied. Total rules applied 794 place count 962 transition count 1162
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 794 place count 962 transition count 1144
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 830 place count 944 transition count 1144
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1588 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1590 place count 563 transition count 763
Applied a total of 1590 rules in 246 ms. Remains 563 /1360 variables (removed 797) and now considering 763/1560 (removed 797) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 246 ms. Remains : 563/1360 places, 763/1560 transitions.
[2024-06-01 19:16:43] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:16:43] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:16:44] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 155 place count 1359 transition count 1404
Reduce places removed 155 places and 0 transitions.
Iterating post reduction 1 with 155 rules applied. Total rules applied 310 place count 1204 transition count 1404
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 310 place count 1204 transition count 1203
Deduced a syphon composed of 201 places in 1 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 712 place count 1003 transition count 1203
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 746 place count 969 transition count 1169
Iterating global reduction 2 with 34 rules applied. Total rules applied 780 place count 969 transition count 1169
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 780 place count 969 transition count 1153
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 812 place count 953 transition count 1153
Performed 371 Post agglomeration using F-continuation condition.Transition count delta: 371
Deduced a syphon composed of 371 places in 1 ms
Reduce places removed 371 places and 0 transitions.
Iterating global reduction 2 with 742 rules applied. Total rules applied 1554 place count 582 transition count 782
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1556 place count 580 transition count 780
Applied a total of 1556 rules in 169 ms. Remains 580 /1360 variables (removed 780) and now considering 780/1560 (removed 780) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 171 ms. Remains : 580/1360 places, 780/1560 transitions.
[2024-06-01 19:16:44] [INFO ] Flatten gal took : 28 ms
[2024-06-01 19:16:44] [INFO ] Flatten gal took : 29 ms
[2024-06-01 19:16:44] [INFO ] Input system was already deterministic with 780 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1330 transition count 1530
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1330 transition count 1530
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1329 transition count 1529
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1329 transition count 1529
Applied a total of 62 rules in 83 ms. Remains 1329 /1360 variables (removed 31) and now considering 1529/1560 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 1329/1360 places, 1529/1560 transitions.
[2024-06-01 19:16:44] [INFO ] Flatten gal took : 43 ms
[2024-06-01 19:16:44] [INFO ] Flatten gal took : 55 ms
[2024-06-01 19:16:44] [INFO ] Input system was already deterministic with 1529 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1326 transition count 1526
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1326 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1325 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1325 transition count 1525
Applied a total of 70 rules in 117 ms. Remains 1325 /1360 variables (removed 35) and now considering 1525/1560 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 118 ms. Remains : 1325/1360 places, 1525/1560 transitions.
[2024-06-01 19:16:44] [INFO ] Flatten gal took : 42 ms
[2024-06-01 19:16:44] [INFO ] Flatten gal took : 44 ms
[2024-06-01 19:16:44] [INFO ] Input system was already deterministic with 1525 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 161 transitions
Trivial Post-agglo rules discarded 161 transitions
Performed 161 trivial Post agglomeration. Transition count delta: 161
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1359 transition count 1398
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 1 with 161 rules applied. Total rules applied 322 place count 1198 transition count 1398
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 322 place count 1198 transition count 1199
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 720 place count 999 transition count 1199
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 757 place count 962 transition count 1162
Iterating global reduction 2 with 37 rules applied. Total rules applied 794 place count 962 transition count 1162
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 794 place count 962 transition count 1144
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 830 place count 944 transition count 1144
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 2 with 758 rules applied. Total rules applied 1588 place count 565 transition count 765
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1590 place count 563 transition count 763
Applied a total of 1590 rules in 198 ms. Remains 563 /1360 variables (removed 797) and now considering 763/1560 (removed 797) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 198 ms. Remains : 563/1360 places, 763/1560 transitions.
[2024-06-01 19:16:45] [INFO ] Flatten gal took : 25 ms
[2024-06-01 19:16:45] [INFO ] Flatten gal took : 31 ms
[2024-06-01 19:16:45] [INFO ] Input system was already deterministic with 763 transitions.
RANDOM walk for 1142 steps (0 resets) in 10 ms. (103 steps per ms) remains 0/1 properties
FORMULA ShieldRVs-PT-040B-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1324 transition count 1524
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1324 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1323 transition count 1523
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1323 transition count 1523
Applied a total of 74 rules in 136 ms. Remains 1323 /1360 variables (removed 37) and now considering 1523/1560 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 1323/1360 places, 1523/1560 transitions.
[2024-06-01 19:16:45] [INFO ] Flatten gal took : 40 ms
[2024-06-01 19:16:45] [INFO ] Flatten gal took : 69 ms
[2024-06-01 19:16:45] [INFO ] Input system was already deterministic with 1523 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1328 transition count 1528
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1328 transition count 1528
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1327 transition count 1527
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1327 transition count 1527
Applied a total of 66 rules in 112 ms. Remains 1327 /1360 variables (removed 33) and now considering 1527/1560 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 1327/1360 places, 1527/1560 transitions.
[2024-06-01 19:16:45] [INFO ] Flatten gal took : 37 ms
[2024-06-01 19:16:45] [INFO ] Flatten gal took : 40 ms
[2024-06-01 19:16:46] [INFO ] Input system was already deterministic with 1527 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1324 transition count 1524
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1324 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 1323 transition count 1523
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 1323 transition count 1523
Applied a total of 74 rules in 107 ms. Remains 1323 /1360 variables (removed 37) and now considering 1523/1560 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108 ms. Remains : 1323/1360 places, 1523/1560 transitions.
[2024-06-01 19:16:46] [INFO ] Flatten gal took : 35 ms
[2024-06-01 19:16:46] [INFO ] Flatten gal took : 38 ms
[2024-06-01 19:16:46] [INFO ] Input system was already deterministic with 1523 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1359 transition count 1402
Reduce places removed 157 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 158 rules applied. Total rules applied 315 place count 1202 transition count 1401
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 316 place count 1201 transition count 1401
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 200 Pre rules applied. Total rules applied 316 place count 1201 transition count 1201
Deduced a syphon composed of 200 places in 2 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 3 with 400 rules applied. Total rules applied 716 place count 1001 transition count 1201
Discarding 34 places :
Symmetric choice reduction at 3 with 34 rule applications. Total rules 750 place count 967 transition count 1167
Iterating global reduction 3 with 34 rules applied. Total rules applied 784 place count 967 transition count 1167
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 784 place count 967 transition count 1151
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 816 place count 951 transition count 1151
Performed 379 Post agglomeration using F-continuation condition.Transition count delta: 379
Deduced a syphon composed of 379 places in 1 ms
Reduce places removed 379 places and 0 transitions.
Iterating global reduction 3 with 758 rules applied. Total rules applied 1574 place count 572 transition count 772
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1576 place count 570 transition count 770
Applied a total of 1576 rules in 175 ms. Remains 570 /1360 variables (removed 790) and now considering 770/1560 (removed 790) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 176 ms. Remains : 570/1360 places, 770/1560 transitions.
[2024-06-01 19:16:46] [INFO ] Flatten gal took : 22 ms
[2024-06-01 19:16:46] [INFO ] Flatten gal took : 26 ms
[2024-06-01 19:16:46] [INFO ] Input system was already deterministic with 770 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 159 place count 1359 transition count 1400
Reduce places removed 159 places and 0 transitions.
Iterating post reduction 1 with 159 rules applied. Total rules applied 318 place count 1200 transition count 1400
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 318 place count 1200 transition count 1201
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 716 place count 1001 transition count 1201
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 752 place count 965 transition count 1165
Iterating global reduction 2 with 36 rules applied. Total rules applied 788 place count 965 transition count 1165
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 788 place count 965 transition count 1147
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 824 place count 947 transition count 1147
Performed 377 Post agglomeration using F-continuation condition.Transition count delta: 377
Deduced a syphon composed of 377 places in 1 ms
Reduce places removed 377 places and 0 transitions.
Iterating global reduction 2 with 754 rules applied. Total rules applied 1578 place count 570 transition count 770
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1580 place count 568 transition count 768
Applied a total of 1580 rules in 123 ms. Remains 568 /1360 variables (removed 792) and now considering 768/1560 (removed 792) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 124 ms. Remains : 568/1360 places, 768/1560 transitions.
[2024-06-01 19:16:46] [INFO ] Flatten gal took : 19 ms
[2024-06-01 19:16:46] [INFO ] Flatten gal took : 21 ms
[2024-06-01 19:16:46] [INFO ] Input system was already deterministic with 768 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 157 place count 1359 transition count 1402
Reduce places removed 157 places and 0 transitions.
Iterating post reduction 1 with 157 rules applied. Total rules applied 314 place count 1202 transition count 1402
Performed 199 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 199 Pre rules applied. Total rules applied 314 place count 1202 transition count 1203
Deduced a syphon composed of 199 places in 1 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 2 with 398 rules applied. Total rules applied 712 place count 1003 transition count 1203
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 749 place count 966 transition count 1166
Iterating global reduction 2 with 37 rules applied. Total rules applied 786 place count 966 transition count 1166
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 786 place count 966 transition count 1149
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 820 place count 949 transition count 1149
Performed 378 Post agglomeration using F-continuation condition.Transition count delta: 378
Deduced a syphon composed of 378 places in 1 ms
Reduce places removed 378 places and 0 transitions.
Iterating global reduction 2 with 756 rules applied. Total rules applied 1576 place count 571 transition count 771
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1578 place count 569 transition count 769
Applied a total of 1578 rules in 119 ms. Remains 569 /1360 variables (removed 791) and now considering 769/1560 (removed 791) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 119 ms. Remains : 569/1360 places, 769/1560 transitions.
[2024-06-01 19:16:46] [INFO ] Flatten gal took : 19 ms
[2024-06-01 19:16:46] [INFO ] Flatten gal took : 21 ms
[2024-06-01 19:16:47] [INFO ] Input system was already deterministic with 769 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1325 transition count 1525
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1325 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1324 transition count 1524
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1324 transition count 1524
Applied a total of 72 rules in 80 ms. Remains 1324 /1360 variables (removed 36) and now considering 1524/1560 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 1324/1360 places, 1524/1560 transitions.
[2024-06-01 19:16:47] [INFO ] Flatten gal took : 34 ms
[2024-06-01 19:16:47] [INFO ] Flatten gal took : 36 ms
[2024-06-01 19:16:47] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1326 transition count 1526
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1326 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1325 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1325 transition count 1525
Applied a total of 70 rules in 81 ms. Remains 1325 /1360 variables (removed 35) and now considering 1525/1560 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 1325/1360 places, 1525/1560 transitions.
[2024-06-01 19:16:47] [INFO ] Flatten gal took : 35 ms
[2024-06-01 19:16:47] [INFO ] Flatten gal took : 36 ms
[2024-06-01 19:16:47] [INFO ] Input system was already deterministic with 1525 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1326 transition count 1526
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1326 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1325 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1325 transition count 1525
Applied a total of 70 rules in 78 ms. Remains 1325 /1360 variables (removed 35) and now considering 1525/1560 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 1325/1360 places, 1525/1560 transitions.
[2024-06-01 19:16:47] [INFO ] Flatten gal took : 34 ms
[2024-06-01 19:16:47] [INFO ] Flatten gal took : 36 ms
[2024-06-01 19:16:47] [INFO ] Input system was already deterministic with 1525 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1325 transition count 1525
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1325 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1324 transition count 1524
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1324 transition count 1524
Applied a total of 72 rules in 115 ms. Remains 1324 /1360 variables (removed 36) and now considering 1524/1560 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 1324/1360 places, 1524/1560 transitions.
[2024-06-01 19:16:47] [INFO ] Flatten gal took : 37 ms
[2024-06-01 19:16:47] [INFO ] Flatten gal took : 40 ms
[2024-06-01 19:16:48] [INFO ] Input system was already deterministic with 1524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1360/1360 places, 1560/1560 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1326 transition count 1526
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1326 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1325 transition count 1525
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1325 transition count 1525
Applied a total of 70 rules in 101 ms. Remains 1325 /1360 variables (removed 35) and now considering 1525/1560 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 1325/1360 places, 1525/1560 transitions.
[2024-06-01 19:16:48] [INFO ] Flatten gal took : 35 ms
[2024-06-01 19:16:48] [INFO ] Flatten gal took : 38 ms
[2024-06-01 19:16:48] [INFO ] Input system was already deterministic with 1525 transitions.
[2024-06-01 19:16:48] [INFO ] Flatten gal took : 37 ms
[2024-06-01 19:16:48] [INFO ] Flatten gal took : 37 ms
[2024-06-01 19:16:48] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2024-06-01 19:16:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1360 places, 1560 transitions and 5274 arcs took 11 ms.
Total runtime 145118 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 : ShieldRVs-PT-040B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVs-PT-040B-CTLFireability-2023-15

BK_STOP 1717269408817

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1979/ctl_0_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1979/ctl_1_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1979/ctl_2_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1979/ctl_3_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1979/ctl_4_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1979/ctl_5_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1979/ctl_6_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1979/ctl_7_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1979/ctl_8_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1979/ctl_9_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1979/ctl_10_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1979/ctl_11_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1979/ctl_12_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1979/ctl_13_
ctl formula name ShieldRVs-PT-040B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1979/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="ShieldRVs-PT-040B"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVs-PT-040B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762000842"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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