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.r553-tall-171734901400321.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 FireWire-PT-20, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901400321
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 247K Jun 2 16:33 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 FireWire-PT-20-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717358036027

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:53:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:53:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:53:57] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-06-02 19:53:57] [INFO ] Transformed 626 places.
[2024-06-02 19:53:57] [INFO ] Transformed 1031 transitions.
[2024-06-02 19:53:57] [INFO ] Found NUPN structural information;
[2024-06-02 19:53:57] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-20-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 94 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 615 transition count 1031
Discarding 118 places :
Symmetric choice reduction at 1 with 118 rule applications. Total rules 129 place count 497 transition count 913
Iterating global reduction 1 with 118 rules applied. Total rules applied 247 place count 497 transition count 913
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 248 place count 497 transition count 912
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 270 place count 475 transition count 793
Iterating global reduction 2 with 22 rules applied. Total rules applied 292 place count 475 transition count 793
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 475 transition count 792
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 297 place count 471 transition count 786
Iterating global reduction 3 with 4 rules applied. Total rules applied 301 place count 471 transition count 786
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 302 place count 471 transition count 785
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 303 place count 470 transition count 782
Iterating global reduction 4 with 1 rules applied. Total rules applied 304 place count 470 transition count 782
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 305 place count 469 transition count 780
Iterating global reduction 4 with 1 rules applied. Total rules applied 306 place count 469 transition count 780
Applied a total of 306 rules in 139 ms. Remains 469 /626 variables (removed 157) and now considering 780/1031 (removed 251) transitions.
// Phase 1: matrix 780 rows 469 cols
[2024-06-02 19:53:57] [INFO ] Computed 10 invariants in 24 ms
[2024-06-02 19:53:57] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-02 19:53:57] [INFO ] Invariant cache hit.
[2024-06-02 19:53:58] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
Running 779 sub problems to find dead transitions.
[2024-06-02 19:53:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (OVERLAPS) 1/465 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-02 19:54:09] [INFO ] Deduced a trap composed of 285 places in 236 ms of which 27 ms to minimize.
[2024-06-02 19:54:09] [INFO ] Deduced a trap composed of 247 places in 185 ms of which 3 ms to minimize.
[2024-06-02 19:54:10] [INFO ] Deduced a trap composed of 87 places in 58 ms of which 2 ms to minimize.
[2024-06-02 19:54:10] [INFO ] Deduced a trap composed of 100 places in 54 ms of which 1 ms to minimize.
[2024-06-02 19:54:10] [INFO ] Deduced a trap composed of 89 places in 56 ms of which 2 ms to minimize.
[2024-06-02 19:54:11] [INFO ] Deduced a trap composed of 280 places in 168 ms of which 4 ms to minimize.
[2024-06-02 19:54:11] [INFO ] Deduced a trap composed of 96 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:54:13] [INFO ] Deduced a trap composed of 82 places in 69 ms of which 2 ms to minimize.
[2024-06-02 19:54:13] [INFO ] Deduced a trap composed of 96 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:54:13] [INFO ] Deduced a trap composed of 100 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:54:13] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-06-02 19:54:14] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-06-02 19:54:14] [INFO ] Deduced a trap composed of 127 places in 156 ms of which 3 ms to minimize.
[2024-06-02 19:54:15] [INFO ] Deduced a trap composed of 64 places in 151 ms of which 2 ms to minimize.
[2024-06-02 19:54:16] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 3 ms to minimize.
[2024-06-02 19:54:18] [INFO ] Deduced a trap composed of 93 places in 142 ms of which 2 ms to minimize.
[2024-06-02 19:54:19] [INFO ] Deduced a trap composed of 92 places in 140 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 17/27 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 3 ms to minimize.
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 283 places in 146 ms of which 2 ms to minimize.
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 3 ms to minimize.
[2024-06-02 19:54:20] [INFO ] Deduced a trap composed of 270 places in 152 ms of which 3 ms to minimize.
[2024-06-02 19:54:21] [INFO ] Deduced a trap composed of 107 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 779 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 465/1249 variables, and 32 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/469 constraints, PredecessorRefiner: 779/779 constraints, Known Traps: 22/22 constraints]
Escalating to Integer solving :Problem set: 0 solved, 779 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/464 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 1 (OVERLAPS) 1/465 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 779 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/465 variables, 22/32 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-02 19:54:34] [INFO ] Deduced a trap composed of 269 places in 157 ms of which 3 ms to minimize.
[2024-06-02 19:54:35] [INFO ] Deduced a trap composed of 275 places in 150 ms of which 2 ms to minimize.
[2024-06-02 19:54:35] [INFO ] Deduced a trap composed of 109 places in 151 ms of which 3 ms to minimize.
[2024-06-02 19:54:36] [INFO ] Deduced a trap composed of 111 places in 53 ms of which 2 ms to minimize.
[2024-06-02 19:54:36] [INFO ] Deduced a trap composed of 117 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:54:36] [INFO ] Deduced a trap composed of 104 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/465 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-02 19:54:44] [INFO ] Deduced a trap composed of 106 places in 89 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/465 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 779 unsolved
[2024-06-02 19:54:52] [INFO ] Deduced a trap composed of 89 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 465/1249 variables, and 40 constraints, problems are : Problem set: 0 solved, 779 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/469 constraints, PredecessorRefiner: 0/779 constraints, Known Traps: 30/30 constraints]
After SMT, in 60629ms problems are : Problem set: 0 solved, 779 unsolved
Search for dead transitions found 0 dead transitions in 60651ms
Starting structural reductions in LTL mode, iteration 1 : 469/626 places, 780/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61676 ms. Remains : 469/626 places, 780/1031 transitions.
Support contains 94 out of 469 places after structural reductions.
[2024-06-02 19:54:59] [INFO ] Flatten gal took : 83 ms
[2024-06-02 19:54:59] [INFO ] Flatten gal took : 46 ms
[2024-06-02 19:54:59] [INFO ] Input system was already deterministic with 780 transitions.
Support contains 85 out of 469 places (down from 94) after GAL structural reductions.
FORMULA FireWire-PT-20-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (15 resets) in 1473 ms. (27 steps per ms) remains 24/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (8 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 7 ms. (500 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
[2024-06-02 19:55:00] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 365/428 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 749/1177 variables, 428/438 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1177 variables, 0/438 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 48/1225 variables, 28/466 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1225 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 17/1242 variables, 8/474 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1242 variables, 0/474 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 7/1249 variables, 5/479 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1249 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/1249 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1249/1249 variables, and 479 constraints, problems are : Problem set: 1 solved, 23 unsolved in 2583 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 469/469 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 367/428 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 3 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 3 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 43 places in 258 ms of which 3 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 100 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:55:03] [INFO ] Deduced a trap composed of 87 places in 55 ms of which 5 ms to minimize.
[2024-06-02 19:55:04] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 2 ms to minimize.
[2024-06-02 19:55:04] [INFO ] Deduced a trap composed of 104 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:55:04] [INFO ] Deduced a trap composed of 90 places in 83 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/428 variables, 8/18 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 749/1177 variables, 428/446 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1177 variables, 20/466 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-02 19:55:05] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1177 variables, 1/467 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1177 variables, 0/467 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 48/1225 variables, 28/495 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1225 variables, 3/498 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-06-02 19:55:07] [INFO ] Deduced a trap composed of 135 places in 162 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1225 variables, 1/499 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1225/1249 variables, and 499 constraints, problems are : Problem set: 1 solved, 23 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 456/469 constraints, PredecessorRefiner: 23/24 constraints, Known Traps: 10/10 constraints]
After SMT, in 7607ms problems are : Problem set: 1 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 61 out of 469 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 469/469 places, 780/780 transitions.
Graph (trivial) has 251 edges and 469 vertex of which 8 / 469 are part of one of the 2 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 1441 edges and 463 vertex of which 461 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 461 transition count 727
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 420 transition count 724
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 9 rules applied. Total rules applied 96 place count 419 transition count 716
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 104 place count 411 transition count 716
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 104 place count 411 transition count 686
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 164 place count 381 transition count 686
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 171 place count 374 transition count 678
Iterating global reduction 4 with 7 rules applied. Total rules applied 178 place count 374 transition count 678
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 178 place count 374 transition count 676
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 182 place count 372 transition count 676
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 183 place count 371 transition count 675
Iterating global reduction 4 with 1 rules applied. Total rules applied 184 place count 371 transition count 675
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 4 with 80 rules applied. Total rules applied 264 place count 331 transition count 635
Performed 25 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 314 place count 306 transition count 683
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 317 place count 306 transition count 680
Free-agglomeration rule applied 28 times.
Iterating global reduction 4 with 28 rules applied. Total rules applied 345 place count 306 transition count 652
Reduce places removed 28 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 375 place count 278 transition count 650
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 378 place count 275 transition count 647
Iterating global reduction 5 with 3 rules applied. Total rules applied 381 place count 275 transition count 647
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 382 place count 275 transition count 646
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 6 with 8 rules applied. Total rules applied 390 place count 275 transition count 638
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 400 place count 275 transition count 638
Applied a total of 400 rules in 311 ms. Remains 275 /469 variables (removed 194) and now considering 638/780 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 275/469 places, 638/780 transitions.
RANDOM walk for 40000 steps (1126 resets) in 758 ms. (52 steps per ms) remains 14/23 properties
BEST_FIRST walk for 40004 steps (225 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (213 resets) in 94 ms. (421 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (220 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (223 resets) in 79 ms. (500 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (212 resets) in 97 ms. (408 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (215 resets) in 74 ms. (533 steps per ms) remains 11/13 properties
BEST_FIRST walk for 40003 steps (219 resets) in 86 ms. (459 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (215 resets) in 68 ms. (579 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (166 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (219 resets) in 87 ms. (454 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (222 resets) in 73 ms. (540 steps per ms) remains 11/11 properties
[2024-06-02 19:55:08] [INFO ] Flow matrix only has 637 transitions (discarded 1 similar events)
// Phase 1: matrix 637 rows 275 cols
[2024-06-02 19:55:08] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:55:08] [INFO ] State equation strengthened by 97 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 223/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 633/887 variables, 254/264 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/887 variables, 97/361 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 24/911 variables, 20/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/911 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 1/912 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/912 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/912 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 912/912 variables, and 382 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 275/275 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 223/254 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-02 19:55:10] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:55:10] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 1 ms to minimize.
[2024-06-02 19:55:10] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-02 19:55:10] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 0 ms to minimize.
[2024-06-02 19:55:10] [INFO ] Deduced a trap composed of 60 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:55:10] [INFO ] Deduced a trap composed of 54 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:55:10] [INFO ] Deduced a trap composed of 68 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 633/887 variables, 254/271 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/887 variables, 97/368 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/887 variables, 10/378 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/887 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 24/911 variables, 20/398 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/911 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/911 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 11 (OVERLAPS) 1/912 variables, 1/400 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 19:55:11] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/912 variables, 1/401 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/912 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/912 variables, 0/401 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 912/912 variables, and 401 constraints, problems are : Problem set: 1 solved, 10 unsolved in 2728 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 275/275 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 8/8 constraints]
After SMT, in 3767ms problems are : Problem set: 1 solved, 10 unsolved
Parikh walk visited 3 properties in 3110 ms.
Support contains 18 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 638/638 transitions.
Graph (trivial) has 72 edges and 275 vertex of which 2 / 275 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1166 edges and 274 vertex of which 273 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 273 transition count 625
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 262 transition count 624
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 25 place count 262 transition count 617
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 255 transition count 617
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 49 place count 245 transition count 603
Iterating global reduction 2 with 10 rules applied. Total rules applied 59 place count 245 transition count 603
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 245 transition count 601
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 63 place count 243 transition count 596
Iterating global reduction 3 with 2 rules applied. Total rules applied 65 place count 243 transition count 596
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 243 transition count 595
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 66 place count 243 transition count 594
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 68 place count 242 transition count 594
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 241 transition count 591
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 241 transition count 591
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 240 transition count 589
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 240 transition count 589
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 239 transition count 586
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 239 transition count 586
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 238 transition count 584
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 238 transition count 584
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 237 transition count 581
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 237 transition count 581
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 236 transition count 579
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 236 transition count 579
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 235 transition count 577
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 235 transition count 577
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 234 transition count 575
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 234 transition count 575
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 96 place count 228 transition count 569
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 227 transition count 567
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 227 transition count 567
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 106 place count 223 transition count 572
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 107 place count 223 transition count 571
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 113 place count 223 transition count 565
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 120 place count 223 transition count 558
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 127 place count 216 transition count 558
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 128 place count 216 transition count 557
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 216 transition count 560
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 131 place count 215 transition count 559
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 132 place count 215 transition count 558
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 136 place count 215 transition count 558
Applied a total of 136 rules in 157 ms. Remains 215 /275 variables (removed 60) and now considering 558/638 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 157 ms. Remains : 215/275 places, 558/638 transitions.
RANDOM walk for 40000 steps (1334 resets) in 349 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (248 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (265 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (273 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (253 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (257 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (255 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (256 resets) in 50 ms. (784 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 512244 steps, run timeout after 3001 ms. (steps per millisecond=170 ) properties seen :2 out of 7
Probabilistic random walk after 512244 steps, saw 157860 distinct states, run finished after 3004 ms. (steps per millisecond=170 ) properties seen :2
[2024-06-02 19:55:19] [INFO ] Flow matrix only has 552 transitions (discarded 6 similar events)
// Phase 1: matrix 552 rows 215 cols
[2024-06-02 19:55:19] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 19:55:19] [INFO ] State equation strengthened by 91 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 155/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/201 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:55:19] [INFO ] Deduced a trap composed of 48 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:55:19] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 552/753 variables, 201/213 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/753 variables, 91/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 14/767 variables, 14/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/767 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/767 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 767/767 variables, and 318 constraints, problems are : Problem set: 0 solved, 5 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 215/215 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 155/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:55:19] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 31/201 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/201 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:55:19] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 552/753 variables, 201/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 91/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 5/311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:55:20] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 2 ms to minimize.
[2024-06-02 19:55:20] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/753 variables, 2/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/753 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 14/767 variables, 14/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/767 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/767 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 767/767 variables, and 327 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1122 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 215/215 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1610ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 626 ms.
Support contains 15 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 558/558 transitions.
Graph (complete) has 1035 edges and 215 vertex of which 214 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 212 transition count 556
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 212 transition count 556
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 211 transition count 555
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 8 place count 210 transition count 554
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 210 transition count 554
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 10 place count 209 transition count 548
Iterating global reduction 0 with 1 rules applied. Total rules applied 11 place count 209 transition count 548
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 12 place count 208 transition count 546
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 208 transition count 546
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 208 transition count 545
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 208 transition count 545
Applied a total of 15 rules in 48 ms. Remains 208 /215 variables (removed 7) and now considering 545/558 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 208/215 places, 545/558 transitions.
RANDOM walk for 40000 steps (1333 resets) in 154 ms. (258 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (260 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (266 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (262 resets) in 105 ms. (377 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (281 resets) in 102 ms. (388 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (266 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 445603 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :0 out of 5
Probabilistic random walk after 445603 steps, saw 126422 distinct states, run finished after 3001 ms. (steps per millisecond=148 ) properties seen :0
[2024-06-02 19:55:24] [INFO ] Flow matrix only has 539 transitions (discarded 6 similar events)
// Phase 1: matrix 539 rows 208 cols
[2024-06-02 19:55:24] [INFO ] Computed 10 invariants in 15 ms
[2024-06-02 19:55:24] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/196 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 539/735 variables, 196/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/735 variables, 88/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/747 variables, 12/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/747 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/747 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 747/747 variables, and 306 constraints, problems are : Problem set: 0 solved, 5 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:55:25] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 31/196 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:55:25] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2024-06-02 19:55:25] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:55:25] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:55:25] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:55:25] [INFO ] Deduced a trap composed of 46 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 539/735 variables, 196/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 88/300 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/735 variables, 5/305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 12/747 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/747 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/747 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 747/747 variables, and 317 constraints, problems are : Problem set: 0 solved, 5 unsolved in 990 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 1394ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2187 ms.
Support contains 15 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 545/545 transitions.
Applied a total of 0 rules in 8 ms. Remains 208 /208 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 208/208 places, 545/545 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 545/545 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2024-06-02 19:55:28] [INFO ] Flow matrix only has 539 transitions (discarded 6 similar events)
[2024-06-02 19:55:28] [INFO ] Invariant cache hit.
[2024-06-02 19:55:28] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 19:55:28] [INFO ] Flow matrix only has 539 transitions (discarded 6 similar events)
[2024-06-02 19:55:28] [INFO ] Invariant cache hit.
[2024-06-02 19:55:28] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 19:55:29] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2024-06-02 19:55:29] [INFO ] Redundant transitions in 51 ms returned [423]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 536 sub problems to find dead transitions.
[2024-06-02 19:55:29] [INFO ] Flow matrix only has 538 transitions (discarded 6 similar events)
// Phase 1: matrix 538 rows 208 cols
[2024-06-02 19:55:29] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 19:55:29] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 536 unsolved
[2024-06-02 19:55:33] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 1 ms to minimize.
[2024-06-02 19:55:33] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 2 ms to minimize.
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 1 ms to minimize.
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 117 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:55:34] [INFO ] Deduced a trap composed of 42 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:55:36] [INFO ] Deduced a trap composed of 149 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:55:36] [INFO ] Deduced a trap composed of 161 places in 81 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 536 unsolved
[2024-06-02 19:55:37] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 5 (OVERLAPS) 538/746 variables, 208/229 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 88/317 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 8 (OVERLAPS) 0/746 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 536 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 317 constraints, problems are : Problem set: 0 solved, 536 unsolved in 26285 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 536/536 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 536 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 4 (OVERLAPS) 538/746 variables, 208/229 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 88/317 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 536/853 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 536 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/746 variables, and 853 constraints, problems are : Problem set: 0 solved, 536 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 536/536 constraints, Known Traps: 11/11 constraints]
After SMT, in 56906ms problems are : Problem set: 0 solved, 536 unsolved
Search for dead transitions found 0 dead transitions in 56912ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 208/208 places, 544/545 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 57644 ms. Remains : 208/208 places, 544/545 transitions.
RANDOM walk for 40000 steps (1365 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (253 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (250 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (256 resets) in 54 ms. (727 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (265 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (270 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 546845 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :0 out of 5
Probabilistic random walk after 546845 steps, saw 158129 distinct states, run finished after 3001 ms. (steps per millisecond=182 ) properties seen :0
[2024-06-02 19:56:29] [INFO ] Flow matrix only has 538 transitions (discarded 6 similar events)
[2024-06-02 19:56:29] [INFO ] Invariant cache hit.
[2024-06-02 19:56:29] [INFO ] State equation strengthened by 88 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/196 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:56:29] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:56:29] [INFO ] Deduced a trap composed of 46 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:56:29] [INFO ] Deduced a trap composed of 71 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:56:29] [INFO ] Deduced a trap composed of 37 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 538/734 variables, 196/210 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 88/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 12/746 variables, 12/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/746 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/746 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 310 constraints, problems are : Problem set: 0 solved, 5 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 150/165 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:56:30] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 31/196 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:56:30] [INFO ] Deduced a trap composed of 66 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:56:30] [INFO ] Deduced a trap composed of 48 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:56:30] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 538/734 variables, 196/214 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 88/302 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/734 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/734 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 12/746 variables, 12/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/746 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/746 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 746/746 variables, and 319 constraints, problems are : Problem set: 0 solved, 5 unsolved in 967 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 8/8 constraints]
After SMT, in 1648ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 1203 ms.
Support contains 15 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 544/544 transitions.
Applied a total of 0 rules in 17 ms. Remains 208 /208 variables (removed 0) and now considering 544/544 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 208/208 places, 544/544 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 544/544 transitions.
Applied a total of 0 rules in 7 ms. Remains 208 /208 variables (removed 0) and now considering 544/544 (removed 0) transitions.
[2024-06-02 19:56:32] [INFO ] Flow matrix only has 538 transitions (discarded 6 similar events)
[2024-06-02 19:56:32] [INFO ] Invariant cache hit.
[2024-06-02 19:56:32] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-06-02 19:56:32] [INFO ] Flow matrix only has 538 transitions (discarded 6 similar events)
[2024-06-02 19:56:32] [INFO ] Invariant cache hit.
[2024-06-02 19:56:32] [INFO ] State equation strengthened by 88 read => feed constraints.
[2024-06-02 19:56:33] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 987 ms to find 0 implicit places.
[2024-06-02 19:56:33] [INFO ] Redundant transitions in 5 ms returned []
Running 536 sub problems to find dead transitions.
[2024-06-02 19:56:33] [INFO ] Flow matrix only has 538 transitions (discarded 6 similar events)
[2024-06-02 19:56:33] [INFO ] Invariant cache hit.
[2024-06-02 19:56:33] [INFO ] State equation strengthened by 88 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 536 unsolved
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 68 places in 93 ms of which 2 ms to minimize.
[2024-06-02 19:56:37] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:56:38] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:56:38] [INFO ] Deduced a trap composed of 46 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:56:38] [INFO ] Deduced a trap composed of 48 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:56:38] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:56:38] [INFO ] Deduced a trap composed of 117 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:56:38] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:56:40] [INFO ] Deduced a trap composed of 149 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:56:40] [INFO ] Deduced a trap composed of 161 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 536 unsolved
[2024-06-02 19:56:41] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 5 (OVERLAPS) 538/746 variables, 208/229 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 88/317 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 8 (OVERLAPS) 0/746 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 536 unsolved
No progress, stopping.
After SMT solving in domain Real declared 746/746 variables, and 317 constraints, problems are : Problem set: 0 solved, 536 unsolved in 26791 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 536/536 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 536 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 4 (OVERLAPS) 538/746 variables, 208/229 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/746 variables, 88/317 constraints. Problems are: Problem set: 0 solved, 536 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/746 variables, 536/853 constraints. Problems are: Problem set: 0 solved, 536 unsolved
[2024-06-02 19:57:23] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/746 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 536 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 746/746 variables, and 854 constraints, problems are : Problem set: 0 solved, 536 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 88/88 constraints, PredecessorRefiner: 536/536 constraints, Known Traps: 12/12 constraints]
After SMT, in 57356ms problems are : Problem set: 0 solved, 536 unsolved
Search for dead transitions found 0 dead transitions in 57361ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58367 ms. Remains : 208/208 places, 544/544 transitions.
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2024-06-02 19:57:30] [INFO ] Flatten gal took : 34 ms
[2024-06-02 19:57:30] [INFO ] Flatten gal took : 35 ms
[2024-06-02 19:57:30] [INFO ] Input system was already deterministic with 780 transitions.
Computed a total of 143 stabilizing places and 218 stable transitions
Graph (complete) has 1454 edges and 469 vertex of which 465 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.22 ms
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 34 place count 435 transition count 747
Iterating global reduction 1 with 30 rules applied. Total rules applied 64 place count 435 transition count 747
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 65 place count 435 transition count 746
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 78 place count 422 transition count 726
Iterating global reduction 2 with 13 rules applied. Total rules applied 91 place count 422 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 422 transition count 725
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 96 place count 418 transition count 717
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 418 transition count 717
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 102 place count 416 transition count 712
Iterating global reduction 3 with 2 rules applied. Total rules applied 104 place count 416 transition count 712
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 106 place count 414 transition count 707
Iterating global reduction 3 with 2 rules applied. Total rules applied 108 place count 414 transition count 707
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 110 place count 412 transition count 702
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 412 transition count 702
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 114 place count 410 transition count 697
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 410 transition count 697
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 118 place count 408 transition count 692
Iterating global reduction 3 with 2 rules applied. Total rules applied 120 place count 408 transition count 692
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 406 transition count 688
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 406 transition count 688
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 404 transition count 683
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 404 transition count 683
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 130 place count 402 transition count 680
Iterating global reduction 3 with 2 rules applied. Total rules applied 132 place count 402 transition count 680
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 133 place count 401 transition count 677
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 401 transition count 677
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 135 place count 400 transition count 675
Iterating global reduction 3 with 1 rules applied. Total rules applied 136 place count 400 transition count 675
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 399 transition count 673
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 399 transition count 673
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 139 place count 398 transition count 671
Iterating global reduction 3 with 1 rules applied. Total rules applied 140 place count 398 transition count 671
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 397 transition count 670
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 397 transition count 670
Applied a total of 142 rules in 68 ms. Remains 397 /469 variables (removed 72) and now considering 670/780 (removed 110) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 397/469 places, 670/780 transitions.
[2024-06-02 19:57:30] [INFO ] Flatten gal took : 24 ms
[2024-06-02 19:57:30] [INFO ] Flatten gal took : 25 ms
[2024-06-02 19:57:30] [INFO ] Input system was already deterministic with 670 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 402 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 402 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 399 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 396 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 396 transition count 669
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 393 transition count 663
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 393 transition count 663
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 390 transition count 655
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 387 transition count 650
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 385 transition count 644
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 383 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 383 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 381 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 380 transition count 634
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 379 transition count 633
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 379 transition count 633
Applied a total of 178 rules in 64 ms. Remains 379 /469 variables (removed 90) and now considering 633/780 (removed 147) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 379/469 places, 633/780 transitions.
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 21 ms
[2024-06-02 19:57:31] [INFO ] Input system was already deterministic with 633 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 466 transition count 780
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 33 place count 436 transition count 745
Iterating global reduction 1 with 30 rules applied. Total rules applied 63 place count 436 transition count 745
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 75 place count 424 transition count 726
Iterating global reduction 1 with 12 rules applied. Total rules applied 87 place count 424 transition count 726
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 88 place count 424 transition count 725
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 421 transition count 718
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 421 transition count 718
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 96 place count 419 transition count 713
Iterating global reduction 2 with 2 rules applied. Total rules applied 98 place count 419 transition count 713
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 100 place count 417 transition count 708
Iterating global reduction 2 with 2 rules applied. Total rules applied 102 place count 417 transition count 708
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 104 place count 415 transition count 703
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 415 transition count 703
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 108 place count 413 transition count 698
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 413 transition count 698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 411 transition count 693
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 411 transition count 693
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 409 transition count 689
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 409 transition count 689
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 407 transition count 684
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 407 transition count 684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 405 transition count 681
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 405 transition count 681
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 127 place count 404 transition count 678
Iterating global reduction 2 with 1 rules applied. Total rules applied 128 place count 404 transition count 678
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 129 place count 403 transition count 676
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 403 transition count 676
Applied a total of 130 rules in 54 ms. Remains 403 /469 variables (removed 66) and now considering 676/780 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 403/469 places, 676/780 transitions.
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:57:31] [INFO ] Input system was already deterministic with 676 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Graph (trivial) has 313 edges and 469 vertex of which 11 / 469 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1444 edges and 461 vertex of which 457 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 456 transition count 709
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 395 transition count 706
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 394 transition count 706
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 128 place count 394 transition count 674
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 192 place count 362 transition count 674
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 216 place count 338 transition count 644
Iterating global reduction 3 with 24 rules applied. Total rules applied 240 place count 338 transition count 644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 243 place count 338 transition count 641
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 244 place count 337 transition count 641
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 244 place count 337 transition count 638
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 250 place count 334 transition count 638
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 257 place count 327 transition count 629
Iterating global reduction 5 with 7 rules applied. Total rules applied 264 place count 327 transition count 629
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 266 place count 327 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 267 place count 326 transition count 627
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 270 place count 323 transition count 620
Iterating global reduction 7 with 3 rules applied. Total rules applied 273 place count 323 transition count 620
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 275 place count 321 transition count 615
Iterating global reduction 7 with 2 rules applied. Total rules applied 277 place count 321 transition count 615
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 279 place count 319 transition count 610
Iterating global reduction 7 with 2 rules applied. Total rules applied 281 place count 319 transition count 610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 282 place count 318 transition count 608
Iterating global reduction 7 with 1 rules applied. Total rules applied 283 place count 318 transition count 608
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 284 place count 317 transition count 605
Iterating global reduction 7 with 1 rules applied. Total rules applied 285 place count 317 transition count 605
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 286 place count 316 transition count 603
Iterating global reduction 7 with 1 rules applied. Total rules applied 287 place count 316 transition count 603
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 288 place count 315 transition count 601
Iterating global reduction 7 with 1 rules applied. Total rules applied 289 place count 315 transition count 601
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 290 place count 314 transition count 599
Iterating global reduction 7 with 1 rules applied. Total rules applied 291 place count 314 transition count 599
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 333 place count 293 transition count 578
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 335 place count 291 transition count 574
Iterating global reduction 7 with 2 rules applied. Total rules applied 337 place count 291 transition count 574
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 338 place count 291 transition count 574
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 339 place count 290 transition count 573
Applied a total of 339 rules in 153 ms. Remains 290 /469 variables (removed 179) and now considering 573/780 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 153 ms. Remains : 290/469 places, 573/780 transitions.
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:57:31] [INFO ] Input system was already deterministic with 573 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 466 transition count 780
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 32 place count 437 transition count 748
Iterating global reduction 1 with 29 rules applied. Total rules applied 61 place count 437 transition count 748
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 437 transition count 747
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 74 place count 425 transition count 729
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 425 transition count 729
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 425 transition count 728
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 423 transition count 724
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 423 transition count 724
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 421 transition count 718
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 421 transition count 718
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 97 place count 419 transition count 714
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 419 transition count 714
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 101 place count 417 transition count 708
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 417 transition count 708
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 105 place count 415 transition count 704
Iterating global reduction 3 with 2 rules applied. Total rules applied 107 place count 415 transition count 704
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 413 transition count 698
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 413 transition count 698
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 411 transition count 694
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 411 transition count 694
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 117 place count 409 transition count 688
Iterating global reduction 3 with 2 rules applied. Total rules applied 119 place count 409 transition count 688
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 121 place count 407 transition count 684
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 407 transition count 684
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 125 place count 405 transition count 678
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 405 transition count 678
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 403 transition count 674
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 403 transition count 674
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 401 transition count 670
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 401 transition count 670
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 399 transition count 666
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 399 transition count 666
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 397 transition count 664
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 397 transition count 664
Applied a total of 143 rules in 70 ms. Remains 397 /469 variables (removed 72) and now considering 664/780 (removed 116) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 397/469 places, 664/780 transitions.
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 18 ms
[2024-06-02 19:57:31] [INFO ] Input system was already deterministic with 664 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 466 transition count 780
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 36 place count 433 transition count 742
Iterating global reduction 1 with 33 rules applied. Total rules applied 69 place count 433 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 433 transition count 741
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 82 place count 421 transition count 722
Iterating global reduction 2 with 12 rules applied. Total rules applied 94 place count 421 transition count 722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 421 transition count 721
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 98 place count 418 transition count 714
Iterating global reduction 3 with 3 rules applied. Total rules applied 101 place count 418 transition count 714
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 416 transition count 709
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 416 transition count 709
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 414 transition count 704
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 414 transition count 704
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 412 transition count 699
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 412 transition count 699
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 115 place count 410 transition count 694
Iterating global reduction 3 with 2 rules applied. Total rules applied 117 place count 410 transition count 694
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 408 transition count 689
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 408 transition count 689
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 406 transition count 685
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 406 transition count 685
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 404 transition count 680
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 404 transition count 680
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 402 transition count 677
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 402 transition count 677
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 134 place count 401 transition count 674
Iterating global reduction 3 with 1 rules applied. Total rules applied 135 place count 401 transition count 674
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 136 place count 400 transition count 672
Iterating global reduction 3 with 1 rules applied. Total rules applied 137 place count 400 transition count 672
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 138 place count 399 transition count 670
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 399 transition count 670
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 398 transition count 668
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 place count 398 transition count 668
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 397 transition count 667
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 place count 397 transition count 667
Applied a total of 143 rules in 70 ms. Remains 397 /469 variables (removed 72) and now considering 667/780 (removed 113) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 397/469 places, 667/780 transitions.
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 32 ms
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:57:31] [INFO ] Input system was already deterministic with 667 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 37 place count 432 transition count 742
Iterating global reduction 1 with 33 rules applied. Total rules applied 70 place count 432 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 432 transition count 741
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 85 place count 418 transition count 720
Iterating global reduction 2 with 14 rules applied. Total rules applied 99 place count 418 transition count 720
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 418 transition count 719
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 105 place count 413 transition count 709
Iterating global reduction 3 with 5 rules applied. Total rules applied 110 place count 413 transition count 709
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 410 transition count 701
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 410 transition count 701
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 407 transition count 694
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 407 transition count 694
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 124 place count 405 transition count 689
Iterating global reduction 3 with 2 rules applied. Total rules applied 126 place count 405 transition count 689
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 403 transition count 684
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 403 transition count 684
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 401 transition count 679
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 401 transition count 679
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 399 transition count 675
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 399 transition count 675
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 397 transition count 670
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 397 transition count 670
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 395 transition count 667
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 395 transition count 667
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 147 place count 394 transition count 664
Iterating global reduction 3 with 1 rules applied. Total rules applied 148 place count 394 transition count 664
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 393 transition count 662
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 393 transition count 662
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 392 transition count 660
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 392 transition count 660
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 391 transition count 658
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 391 transition count 658
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 390 transition count 657
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 390 transition count 657
Applied a total of 156 rules in 69 ms. Remains 390 /469 variables (removed 79) and now considering 657/780 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 390/469 places, 657/780 transitions.
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:57:31] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:57:32] [INFO ] Input system was already deterministic with 657 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 35 place count 434 transition count 745
Iterating global reduction 1 with 31 rules applied. Total rules applied 66 place count 434 transition count 745
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 434 transition count 744
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 423 transition count 727
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 423 transition count 727
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 94 place count 418 transition count 717
Iterating global reduction 2 with 5 rules applied. Total rules applied 99 place count 418 transition count 717
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 415 transition count 709
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 415 transition count 709
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 412 transition count 702
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 412 transition count 702
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 409 transition count 694
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 409 transition count 694
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 407 transition count 690
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 407 transition count 690
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 405 transition count 684
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 405 transition count 684
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 403 transition count 680
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 403 transition count 680
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 401 transition count 674
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 401 transition count 674
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 399 transition count 670
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 399 transition count 670
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 139 place count 397 transition count 664
Iterating global reduction 2 with 2 rules applied. Total rules applied 141 place count 397 transition count 664
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 395 transition count 660
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 395 transition count 660
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 393 transition count 656
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 393 transition count 656
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 391 transition count 652
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 391 transition count 652
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 389 transition count 650
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 389 transition count 650
Applied a total of 157 rules in 68 ms. Remains 389 /469 variables (removed 80) and now considering 650/780 (removed 130) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 389/469 places, 650/780 transitions.
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 31 ms
[2024-06-02 19:57:32] [INFO ] Input system was already deterministic with 650 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 402 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 402 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 399 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 396 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 396 transition count 669
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 393 transition count 663
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 393 transition count 663
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 390 transition count 655
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 387 transition count 650
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 385 transition count 644
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 383 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 383 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 381 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 381 transition count 636
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 379 transition count 632
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 379 transition count 632
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 377 transition count 630
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 377 transition count 630
Applied a total of 182 rules in 92 ms. Remains 377 /469 variables (removed 92) and now considering 630/780 (removed 150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 377/469 places, 630/780 transitions.
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:57:32] [INFO ] Input system was already deterministic with 630 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Graph (trivial) has 327 edges and 469 vertex of which 11 / 469 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1444 edges and 461 vertex of which 457 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 456 transition count 702
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 142 place count 388 transition count 698
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 387 transition count 698
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 143 place count 387 transition count 666
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 207 place count 355 transition count 666
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 233 place count 329 transition count 633
Iterating global reduction 3 with 26 rules applied. Total rules applied 259 place count 329 transition count 633
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 262 place count 329 transition count 630
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 263 place count 328 transition count 630
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 263 place count 328 transition count 626
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 271 place count 324 transition count 626
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 279 place count 316 transition count 615
Iterating global reduction 5 with 8 rules applied. Total rules applied 287 place count 316 transition count 615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 289 place count 316 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 290 place count 315 transition count 613
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 294 place count 311 transition count 604
Iterating global reduction 7 with 4 rules applied. Total rules applied 298 place count 311 transition count 604
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 301 place count 308 transition count 596
Iterating global reduction 7 with 3 rules applied. Total rules applied 304 place count 308 transition count 596
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 307 place count 305 transition count 589
Iterating global reduction 7 with 3 rules applied. Total rules applied 310 place count 305 transition count 589
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 313 place count 302 transition count 581
Iterating global reduction 7 with 3 rules applied. Total rules applied 316 place count 302 transition count 581
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 319 place count 299 transition count 574
Iterating global reduction 7 with 3 rules applied. Total rules applied 322 place count 299 transition count 574
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 325 place count 296 transition count 566
Iterating global reduction 7 with 3 rules applied. Total rules applied 328 place count 296 transition count 566
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 331 place count 293 transition count 560
Iterating global reduction 7 with 3 rules applied. Total rules applied 334 place count 293 transition count 560
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 337 place count 290 transition count 552
Iterating global reduction 7 with 3 rules applied. Total rules applied 340 place count 290 transition count 552
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 342 place count 288 transition count 548
Iterating global reduction 7 with 2 rules applied. Total rules applied 344 place count 288 transition count 548
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 346 place count 286 transition count 542
Iterating global reduction 7 with 2 rules applied. Total rules applied 348 place count 286 transition count 542
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 350 place count 284 transition count 538
Iterating global reduction 7 with 2 rules applied. Total rules applied 352 place count 284 transition count 538
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 354 place count 282 transition count 534
Iterating global reduction 7 with 2 rules applied. Total rules applied 356 place count 282 transition count 534
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 358 place count 280 transition count 530
Iterating global reduction 7 with 2 rules applied. Total rules applied 360 place count 280 transition count 530
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 402 place count 259 transition count 509
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 404 place count 257 transition count 505
Iterating global reduction 7 with 2 rules applied. Total rules applied 406 place count 257 transition count 505
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 407 place count 256 transition count 504
Applied a total of 407 rules in 109 ms. Remains 256 /469 variables (removed 213) and now considering 504/780 (removed 276) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 109 ms. Remains : 256/469 places, 504/780 transitions.
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:57:32] [INFO ] Input system was already deterministic with 504 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 128 place count 403 transition count 687
Iterating global reduction 3 with 2 rules applied. Total rules applied 130 place count 403 transition count 687
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 132 place count 401 transition count 682
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 401 transition count 682
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 136 place count 399 transition count 677
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 140 place count 397 transition count 673
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 397 transition count 673
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 144 place count 395 transition count 668
Iterating global reduction 3 with 2 rules applied. Total rules applied 146 place count 395 transition count 668
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 148 place count 393 transition count 665
Iterating global reduction 3 with 2 rules applied. Total rules applied 150 place count 393 transition count 665
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 151 place count 392 transition count 662
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 392 transition count 662
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 391 transition count 660
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 391 transition count 660
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 390 transition count 658
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 390 transition count 658
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 389 transition count 656
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 389 transition count 656
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 159 place count 388 transition count 655
Iterating global reduction 3 with 1 rules applied. Total rules applied 160 place count 388 transition count 655
Applied a total of 160 rules in 66 ms. Remains 388 /469 variables (removed 81) and now considering 655/780 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66 ms. Remains : 388/469 places, 655/780 transitions.
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 16 ms
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:57:32] [INFO ] Input system was already deterministic with 655 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 402 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 402 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 399 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 396 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 396 transition count 669
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 393 transition count 663
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 393 transition count 663
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 390 transition count 655
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 387 transition count 650
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 385 transition count 644
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 383 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 383 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 381 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 381 transition count 636
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 379 transition count 632
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 379 transition count 632
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 377 transition count 630
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 377 transition count 630
Applied a total of 182 rules in 71 ms. Remains 377 /469 variables (removed 92) and now considering 630/780 (removed 150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 377/469 places, 630/780 transitions.
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:57:32] [INFO ] Input system was already deterministic with 630 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 39 place count 430 transition count 740
Iterating global reduction 1 with 35 rules applied. Total rules applied 74 place count 430 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 75 place count 430 transition count 739
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 89 place count 416 transition count 718
Iterating global reduction 2 with 14 rules applied. Total rules applied 103 place count 416 transition count 718
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 416 transition count 717
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 411 transition count 707
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 411 transition count 707
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 408 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 408 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 123 place count 405 transition count 692
Iterating global reduction 3 with 3 rules applied. Total rules applied 126 place count 405 transition count 692
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 129 place count 402 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 132 place count 402 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 135 place count 399 transition count 677
Iterating global reduction 3 with 3 rules applied. Total rules applied 138 place count 399 transition count 677
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 396 transition count 669
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 396 transition count 669
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 393 transition count 663
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 393 transition count 663
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 390 transition count 655
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 387 transition count 650
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 385 transition count 644
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 385 transition count 644
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 168 place count 383 transition count 640
Iterating global reduction 3 with 2 rules applied. Total rules applied 170 place count 383 transition count 640
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 381 transition count 636
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 381 transition count 636
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 176 place count 379 transition count 632
Iterating global reduction 3 with 2 rules applied. Total rules applied 178 place count 379 transition count 632
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 377 transition count 630
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 377 transition count 630
Applied a total of 182 rules in 61 ms. Remains 377 /469 variables (removed 92) and now considering 630/780 (removed 150) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 377/469 places, 630/780 transitions.
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 14 ms
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:57:32] [INFO ] Input system was already deterministic with 630 transitions.
Starting structural reductions in LTL mode, iteration 0 : 469/469 places, 780/780 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 465 transition count 780
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 37 place count 432 transition count 742
Iterating global reduction 1 with 33 rules applied. Total rules applied 70 place count 432 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 71 place count 432 transition count 741
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 83 place count 420 transition count 723
Iterating global reduction 2 with 12 rules applied. Total rules applied 95 place count 420 transition count 723
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 96 place count 420 transition count 722
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 100 place count 416 transition count 714
Iterating global reduction 3 with 4 rules applied. Total rules applied 104 place count 416 transition count 714
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 413 transition count 706
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 413 transition count 706
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 410 transition count 699
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 410 transition count 699
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 119 place count 407 transition count 691
Iterating global reduction 3 with 3 rules applied. Total rules applied 122 place count 407 transition count 691
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 125 place count 404 transition count 684
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 404 transition count 684
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 131 place count 401 transition count 676
Iterating global reduction 3 with 3 rules applied. Total rules applied 134 place count 401 transition count 676
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 137 place count 398 transition count 670
Iterating global reduction 3 with 3 rules applied. Total rules applied 140 place count 398 transition count 670
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 143 place count 395 transition count 662
Iterating global reduction 3 with 3 rules applied. Total rules applied 146 place count 395 transition count 662
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 149 place count 392 transition count 657
Iterating global reduction 3 with 3 rules applied. Total rules applied 152 place count 392 transition count 657
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 154 place count 390 transition count 651
Iterating global reduction 3 with 2 rules applied. Total rules applied 156 place count 390 transition count 651
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 388 transition count 647
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 388 transition count 647
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 162 place count 386 transition count 643
Iterating global reduction 3 with 2 rules applied. Total rules applied 164 place count 386 transition count 643
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 166 place count 384 transition count 639
Iterating global reduction 3 with 2 rules applied. Total rules applied 168 place count 384 transition count 639
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 382 transition count 637
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 382 transition count 637
Applied a total of 172 rules in 61 ms. Remains 382 /469 variables (removed 87) and now considering 637/780 (removed 143) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 382/469 places, 637/780 transitions.
[2024-06-02 19:57:32] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:57:33] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:57:33] [INFO ] Input system was already deterministic with 637 transitions.
[2024-06-02 19:57:33] [INFO ] Flatten gal took : 17 ms
[2024-06-02 19:57:33] [INFO ] Flatten gal took : 26 ms
[2024-06-02 19:57:33] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-02 19:57:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 469 places, 780 transitions and 2440 arcs took 3 ms.
Total runtime 215973 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 : FireWire-PT-20-CTLCardinality-2024-00
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-01
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-03
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-04
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-05
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-07
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-08
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-09
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-10
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-11
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-12
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-13
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-14
Could not compute solution for formula : FireWire-PT-20-CTLCardinality-2024-15

BK_STOP 1717358253512

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name FireWire-PT-20-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/869/ctl_0_
ctl formula name FireWire-PT-20-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/869/ctl_1_
ctl formula name FireWire-PT-20-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/869/ctl_2_
ctl formula name FireWire-PT-20-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/869/ctl_3_
ctl formula name FireWire-PT-20-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/869/ctl_4_
ctl formula name FireWire-PT-20-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/869/ctl_5_
ctl formula name FireWire-PT-20-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/869/ctl_6_
ctl formula name FireWire-PT-20-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/869/ctl_7_
ctl formula name FireWire-PT-20-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/869/ctl_8_
ctl formula name FireWire-PT-20-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/869/ctl_9_
ctl formula name FireWire-PT-20-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/869/ctl_10_
ctl formula name FireWire-PT-20-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/869/ctl_11_
ctl formula name FireWire-PT-20-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/869/ctl_12_
ctl formula name FireWire-PT-20-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/869/ctl_13_
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="FireWire-PT-20"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-20, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901400321"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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