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.r549-tall-171734898300313.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 greatspnxred
Input is FireWire-PT-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734898300313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 221K 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-19-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-19-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717373758209

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:15:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-03 00:15:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:15:59] [INFO ] Load time of PNML (sax parser for PT used): 128 ms
[2024-06-03 00:15:59] [INFO ] Transformed 602 places.
[2024-06-03 00:15:59] [INFO ] Transformed 944 transitions.
[2024-06-03 00:15:59] [INFO ] Found NUPN structural information;
[2024-06-03 00:15:59] [INFO ] Parsed PT model containing 602 places and 944 transitions and 2776 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 124 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 944/944 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 597 transition count 944
Discarding 89 places :
Symmetric choice reduction at 1 with 89 rule applications. Total rules 94 place count 508 transition count 855
Iterating global reduction 1 with 89 rules applied. Total rules applied 183 place count 508 transition count 855
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 197 place count 494 transition count 836
Iterating global reduction 1 with 14 rules applied. Total rules applied 211 place count 494 transition count 836
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 213 place count 494 transition count 834
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 215 place count 492 transition count 832
Iterating global reduction 2 with 2 rules applied. Total rules applied 217 place count 492 transition count 832
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 491 transition count 831
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 491 transition count 831
Applied a total of 219 rules in 119 ms. Remains 491 /602 variables (removed 111) and now considering 831/944 (removed 113) transitions.
// Phase 1: matrix 831 rows 491 cols
[2024-06-03 00:15:59] [INFO ] Computed 10 invariants in 28 ms
[2024-06-03 00:16:00] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-06-03 00:16:00] [INFO ] Invariant cache hit.
[2024-06-03 00:16:00] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 922 ms to find 0 implicit places.
Running 830 sub problems to find dead transitions.
[2024-06-03 00:16:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-03 00:16:13] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 12 ms to minimize.
[2024-06-03 00:16:13] [INFO ] Deduced a trap composed of 97 places in 78 ms of which 2 ms to minimize.
[2024-06-03 00:16:14] [INFO ] Deduced a trap composed of 96 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:16:14] [INFO ] Deduced a trap composed of 80 places in 59 ms of which 1 ms to minimize.
[2024-06-03 00:16:14] [INFO ] Deduced a trap composed of 87 places in 70 ms of which 1 ms to minimize.
[2024-06-03 00:16:15] [INFO ] Deduced a trap composed of 108 places in 68 ms of which 1 ms to minimize.
[2024-06-03 00:16:15] [INFO ] Deduced a trap composed of 104 places in 63 ms of which 1 ms to minimize.
[2024-06-03 00:16:16] [INFO ] Deduced a trap composed of 92 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:16:17] [INFO ] Deduced a trap composed of 97 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:16:17] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 1 ms to minimize.
[2024-06-03 00:16:17] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 15 ms to minimize.
[2024-06-03 00:16:18] [INFO ] Deduced a trap composed of 88 places in 138 ms of which 2 ms to minimize.
[2024-06-03 00:16:18] [INFO ] Deduced a trap composed of 79 places in 141 ms of which 3 ms to minimize.
[2024-06-03 00:16:18] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 2 ms to minimize.
[2024-06-03 00:16:18] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2024-06-03 00:16:18] [INFO ] Deduced a trap composed of 65 places in 145 ms of which 2 ms to minimize.
[2024-06-03 00:16:19] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 3 ms to minimize.
[2024-06-03 00:16:23] [INFO ] Deduced a trap composed of 64 places in 150 ms of which 3 ms to minimize.
[2024-06-03 00:16:24] [INFO ] Deduced a trap composed of 94 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-03 00:16:25] [INFO ] Deduced a trap composed of 101 places in 55 ms of which 1 ms to minimize.
[2024-06-03 00:16:27] [INFO ] Deduced a trap composed of 108 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:16:28] [INFO ] Deduced a trap composed of 97 places in 56 ms of which 2 ms to minimize.
[2024-06-03 00:16:29] [INFO ] Deduced a trap composed of 84 places in 135 ms of which 2 ms to minimize.
[2024-06-03 00:16:29] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 2 ms to minimize.
[2024-06-03 00:16:30] [INFO ] Deduced a trap composed of 186 places in 158 ms of which 3 ms to minimize.
[2024-06-03 00:16:30] [INFO ] Deduced a trap composed of 110 places in 161 ms of which 3 ms to minimize.
[2024-06-03 00:16:31] [INFO ] Deduced a trap composed of 150 places in 155 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 487/1322 variables, and 37 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/491 constraints, PredecessorRefiner: 830/830 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 830 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 1 (OVERLAPS) 1/487 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 830 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/487 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-03 00:16:38] [INFO ] Deduced a trap composed of 93 places in 57 ms of which 1 ms to minimize.
[2024-06-03 00:16:41] [INFO ] Deduced a trap composed of 97 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/487 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 830 unsolved
[2024-06-03 00:16:49] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 3 ms to minimize.
[2024-06-03 00:16:51] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-06-03 00:16:52] [INFO ] Deduced a trap composed of 79 places in 147 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 487/1322 variables, and 42 constraints, problems are : Problem set: 0 solved, 830 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/491 constraints, PredecessorRefiner: 0/830 constraints, Known Traps: 32/32 constraints]
After SMT, in 60573ms problems are : Problem set: 0 solved, 830 unsolved
Search for dead transitions found 0 dead transitions in 60596ms
Starting structural reductions in LTL mode, iteration 1 : 491/602 places, 831/944 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61662 ms. Remains : 491/602 places, 831/944 transitions.
Support contains 124 out of 491 places after structural reductions.
[2024-06-03 00:17:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-03 00:17:01] [INFO ] Flatten gal took : 104 ms
[2024-06-03 00:17:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-19-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-19-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 00:17:01] [INFO ] Flatten gal took : 59 ms
[2024-06-03 00:17:01] [INFO ] Input system was already deterministic with 831 transitions.
Support contains 94 out of 491 places (down from 124) after GAL structural reductions.
RANDOM walk for 40000 steps (13 resets) in 2654 ms. (15 steps per ms) remains 37/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 37/37 properties
[2024-06-03 00:17:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 357/417 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/9 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 11/428 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 778/1206 variables, 428/438 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/438 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 51/1257 variables, 26/464 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1257 variables, 0/464 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 38/1295 variables, 21/485 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1295 variables, 0/485 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 17/1312 variables, 10/495 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1312 variables, 0/495 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 13 (OVERLAPS) 9/1321 variables, 5/500 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1321 variables, 0/500 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 15 (OVERLAPS) 1/1322 variables, 1/501 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1322 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 17 (OVERLAPS) 0/1322 variables, 0/501 constraints. Problems are: Problem set: 2 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1322/1322 variables, and 501 constraints, problems are : Problem set: 2 solved, 35 unsolved in 5003 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 491/491 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 353/405 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-03 00:17:08] [INFO ] Deduced a trap composed of 92 places in 65 ms of which 2 ms to minimize.
[2024-06-03 00:17:08] [INFO ] Deduced a trap composed of 80 places in 65 ms of which 2 ms to minimize.
[2024-06-03 00:17:08] [INFO ] Deduced a trap composed of 92 places in 62 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/405 variables, 3/11 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/405 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 23/428 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-03 00:17:09] [INFO ] Deduced a trap composed of 98 places in 65 ms of which 1 ms to minimize.
[2024-06-03 00:17:09] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
[2024-06-03 00:17:09] [INFO ] Deduced a trap composed of 98 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 3/16 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-03 00:17:10] [INFO ] Deduced a trap composed of 98 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 1/17 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/428 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 778/1206 variables, 428/445 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1206 variables, 31/476 constraints. Problems are: Problem set: 2 solved, 35 unsolved
[2024-06-03 00:17:12] [INFO ] Deduced a trap composed of 154 places in 164 ms of which 3 ms to minimize.
[2024-06-03 00:17:12] [INFO ] Deduced a trap composed of 102 places in 155 ms of which 2 ms to minimize.
[2024-06-03 00:17:12] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 3 ms to minimize.
[2024-06-03 00:17:13] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1322 variables, and 480 constraints, problems are : Problem set: 2 solved, 35 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 428/491 constraints, PredecessorRefiner: 31/37 constraints, Known Traps: 11/11 constraints]
After SMT, in 10041ms problems are : Problem set: 2 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 52 out of 491 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 316 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 3 ms
Free SCC test removed 15 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 1406 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 472 transition count 732
Reduce places removed 77 places and 0 transitions.
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 1 with 79 rules applied. Total rules applied 159 place count 395 transition count 730
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 168 place count 394 transition count 722
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 10 rules applied. Total rules applied 178 place count 386 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 179 place count 385 transition count 720
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 29 Pre rules applied. Total rules applied 179 place count 385 transition count 691
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 237 place count 356 transition count 691
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 247 place count 346 transition count 681
Iterating global reduction 5 with 10 rules applied. Total rules applied 257 place count 346 transition count 681
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 346 transition count 680
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 258 place count 346 transition count 678
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 262 place count 344 transition count 678
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 265 place count 341 transition count 675
Iterating global reduction 6 with 3 rules applied. Total rules applied 268 place count 341 transition count 675
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 6 with 2 rules applied. Total rules applied 270 place count 341 transition count 673
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 271 place count 340 transition count 673
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 8 with 98 rules applied. Total rules applied 369 place count 291 transition count 624
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 370 place count 290 transition count 594
Iterating global reduction 8 with 1 rules applied. Total rules applied 371 place count 290 transition count 594
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -108
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 429 place count 261 transition count 702
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 433 place count 261 transition count 698
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 9 with 22 rules applied. Total rules applied 455 place count 261 transition count 676
Free-agglomeration rule applied 34 times.
Iterating global reduction 9 with 34 rules applied. Total rules applied 489 place count 261 transition count 642
Reduce places removed 34 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 38 rules applied. Total rules applied 527 place count 227 transition count 638
Drop transitions (Redundant composition of simpler transitions.) removed 114 transitions
Redundant transition composition rules discarded 114 transitions
Iterating global reduction 10 with 114 rules applied. Total rules applied 641 place count 227 transition count 524
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 646 place count 227 transition count 524
Applied a total of 646 rules in 208 ms. Remains 227 /491 variables (removed 264) and now considering 524/831 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 227/491 places, 524/831 transitions.
RANDOM walk for 40000 steps (999 resets) in 1039 ms. (38 steps per ms) remains 14/35 properties
BEST_FIRST walk for 40003 steps (185 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (182 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (180 resets) in 123 ms. (322 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40003 steps (175 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (178 resets) in 127 ms. (312 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (170 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (179 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (152 resets) in 69 ms. (571 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (170 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (163 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (177 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (185 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (183 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
[2024-06-03 00:17:14] [INFO ] Flow matrix only has 512 transitions (discarded 12 similar events)
// Phase 1: matrix 512 rows 227 cols
[2024-06-03 00:17:14] [INFO ] Computed 10 invariants in 8 ms
[2024-06-03 00:17:14] [INFO ] State equation strengthened by 85 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 180/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 14/215 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/215 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 507/722 variables, 215/225 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/722 variables, 83/308 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/722 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 13/735 variables, 9/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/735 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 3/738 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/738 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/738 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 1/739 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/739 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/739 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 739/739 variables, and 322 constraints, problems are : Problem set: 0 solved, 12 unsolved in 901 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 180/201 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-03 00:17:15] [INFO ] Deduced a trap composed of 47 places in 36 ms of which 1 ms to minimize.
[2024-06-03 00:17:15] [INFO ] Deduced a trap composed of 60 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:17:15] [INFO ] Deduced a trap composed of 56 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/201 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 14/215 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-03 00:17:15] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 507/722 variables, 215/229 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/722 variables, 83/312 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/722 variables, 10/322 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-03 00:17:15] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-06-03 00:17:16] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 1 ms to minimize.
[2024-06-03 00:17:16] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/722 variables, 3/325 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-06-03 00:17:16] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 2 ms to minimize.
[2024-06-03 00:17:16] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/722 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/722 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 13 (OVERLAPS) 13/735 variables, 9/336 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/735 variables, 1/337 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/735 variables, 0/337 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 16 (OVERLAPS) 3/738 variables, 2/339 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/738 variables, 2/341 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/738 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 1/739 variables, 1/342 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/739 variables, 0/342 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 21 (OVERLAPS) 0/739 variables, 0/342 constraints. Problems are: Problem set: 1 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 739/739 variables, and 342 constraints, problems are : Problem set: 1 solved, 11 unsolved in 3158 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, ReadFeed: 85/85 constraints, PredecessorRefiner: 11/12 constraints, Known Traps: 9/9 constraints]
After SMT, in 4103ms problems are : Problem set: 1 solved, 11 unsolved
Parikh walk visited 1 properties in 13622 ms.
Support contains 16 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 524/524 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 227 transition count 510
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 213 transition count 510
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 28 place count 213 transition count 506
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 36 place count 209 transition count 506
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 209 transition count 505
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 39 place count 207 transition count 501
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 207 transition count 501
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 69 place count 193 transition count 486
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 74 place count 193 transition count 481
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 92 place count 184 transition count 494
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 96 place count 184 transition count 490
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 5 with 22 rules applied. Total rules applied 118 place count 184 transition count 468
Applied a total of 118 rules in 65 ms. Remains 184 /227 variables (removed 43) and now considering 468/524 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 184/227 places, 468/524 transitions.
RANDOM walk for 40000 steps (1449 resets) in 205 ms. (194 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40003 steps (300 resets) in 53 ms. (740 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (297 resets) in 57 ms. (689 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (297 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (301 resets) in 61 ms. (645 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (313 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (297 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (299 resets) in 72 ms. (547 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (300 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
[2024-06-03 00:17:32] [INFO ] Flow matrix only has 411 transitions (discarded 57 similar events)
// Phase 1: matrix 411 rows 184 cols
[2024-06-03 00:17:32] [INFO ] Computed 10 invariants in 4 ms
[2024-06-03 00:17:32] [INFO ] State equation strengthened by 90 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 147/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 18/177 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 410/587 variables, 177/187 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/587 variables, 88/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 7/594 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/594 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/594 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/595 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/595 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/595 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 284 constraints, problems are : Problem set: 0 solved, 7 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 147/159 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:17:32] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 18/177 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/177 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 410/587 variables, 177/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/587 variables, 88/276 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 6/282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:17:33] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/587 variables, 1/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/587 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 7/594 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/594 variables, 2/291 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/594 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/594 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 1/595 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-03 00:17:33] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/595 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/595 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 0/595 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 294 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1408 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 184/184 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 1930ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 2 properties in 1134 ms.
Support contains 8 out of 184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 184/184 places, 468/468 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 184 transition count 466
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 182 transition count 466
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 181 transition count 465
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 181 transition count 465
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 181 transition count 464
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 180 transition count 464
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 180 transition count 462
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 179 transition count 461
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 177 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 26 place count 177 transition count 452
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 28 place count 177 transition count 450
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 31 place count 175 transition count 449
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 32 place count 174 transition count 447
Iterating global reduction 4 with 1 rules applied. Total rules applied 33 place count 174 transition count 447
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 35 place count 174 transition count 445
Applied a total of 35 rules in 61 ms. Remains 174 /184 variables (removed 10) and now considering 445/468 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 174/184 places, 445/468 transitions.
RANDOM walk for 40000 steps (1537 resets) in 201 ms. (198 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (332 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (302 resets) in 47 ms. (833 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (312 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (315 resets) in 35 ms. (1111 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (316 resets) in 78 ms. (506 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 421005 steps, run timeout after 3001 ms. (steps per millisecond=140 ) properties seen :1 out of 5
Probabilistic random walk after 421005 steps, saw 132628 distinct states, run finished after 3006 ms. (steps per millisecond=140 ) properties seen :1
[2024-06-03 00:17:38] [INFO ] Flow matrix only has 391 transitions (discarded 54 similar events)
// Phase 1: matrix 391 rows 174 cols
[2024-06-03 00:17:38] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:17:38] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 138/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 390/558 variables, 168/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 84/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/564 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 2/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/565 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/565 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 270 constraints, problems are : Problem set: 0 solved, 4 unsolved in 289 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 138/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 23/168 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:17:38] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2024-06-03 00:17:39] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 2 ms to minimize.
[2024-06-03 00:17:39] [INFO ] Deduced a trap composed of 36 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 390/558 variables, 168/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 84/265 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 4/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:17:39] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/558 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/558 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 6/564 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/565 variables, 1/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/565 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 278 constraints, problems are : Problem set: 0 solved, 4 unsolved in 796 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 174/174 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 1095ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 899 ms.
Support contains 7 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 445/445 transitions.
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 2 place count 173 transition count 444
Applied a total of 2 rules in 10 ms. Remains 173 /174 variables (removed 1) and now considering 444/445 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 173/174 places, 444/445 transitions.
RANDOM walk for 40000 steps (1512 resets) in 196 ms. (203 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (318 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (316 resets) in 67 ms. (588 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (313 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (318 resets) in 34 ms. (1142 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 460359 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 4
Probabilistic random walk after 460359 steps, saw 149325 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2024-06-03 00:17:43] [INFO ] Flow matrix only has 390 transitions (discarded 54 similar events)
// Phase 1: matrix 390 rows 173 cols
[2024-06-03 00:17:43] [INFO ] Computed 10 invariants in 5 ms
[2024-06-03 00:17:43] [INFO ] State equation strengthened by 86 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 138/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 22/167 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 389/556 variables, 167/177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 84/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/562 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/563 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/563 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/563 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 269 constraints, problems are : Problem set: 0 solved, 4 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 138/145 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 22/167 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-03 00:17:44] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 389/556 variables, 167/178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 84/262 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 4/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/556 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/562 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 2/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/563 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/563 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 274 constraints, problems are : Problem set: 0 solved, 4 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 844ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1106 ms.
Support contains 7 out of 173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 444/444 transitions.
Applied a total of 0 rules in 7 ms. Remains 173 /173 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 173/173 places, 444/444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 173/173 places, 444/444 transitions.
Applied a total of 0 rules in 16 ms. Remains 173 /173 variables (removed 0) and now considering 444/444 (removed 0) transitions.
[2024-06-03 00:17:45] [INFO ] Flow matrix only has 390 transitions (discarded 54 similar events)
[2024-06-03 00:17:45] [INFO ] Invariant cache hit.
[2024-06-03 00:17:45] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-03 00:17:45] [INFO ] Flow matrix only has 390 transitions (discarded 54 similar events)
[2024-06-03 00:17:45] [INFO ] Invariant cache hit.
[2024-06-03 00:17:45] [INFO ] State equation strengthened by 86 read => feed constraints.
[2024-06-03 00:17:46] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2024-06-03 00:17:46] [INFO ] Redundant transitions in 24 ms returned []
Running 440 sub problems to find dead transitions.
[2024-06-03 00:17:46] [INFO ] Flow matrix only has 390 transitions (discarded 54 similar events)
[2024-06-03 00:17:46] [INFO ] Invariant cache hit.
[2024-06-03 00:17:46] [INFO ] State equation strengthened by 86 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-03 00:17:49] [INFO ] Deduced a trap composed of 36 places in 32 ms of which 1 ms to minimize.
[2024-06-03 00:17:49] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-06-03 00:17:49] [INFO ] Deduced a trap composed of 61 places in 84 ms of which 2 ms to minimize.
[2024-06-03 00:17:49] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 2 ms to minimize.
[2024-06-03 00:17:49] [INFO ] Deduced a trap composed of 36 places in 40 ms of which 1 ms to minimize.
[2024-06-03 00:17:49] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-03 00:17:50] [INFO ] Deduced a trap composed of 36 places in 42 ms of which 0 ms to minimize.
[2024-06-03 00:17:51] [INFO ] Deduced a trap composed of 38 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-03 00:17:52] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (OVERLAPS) 390/563 variables, 173/192 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 86/278 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 8 (OVERLAPS) 0/563 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 440 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 278 constraints, problems are : Problem set: 0 solved, 440 unsolved in 21662 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 440 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 4 (OVERLAPS) 390/563 variables, 173/192 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 86/278 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 440/718 constraints. Problems are: Problem set: 0 solved, 440 unsolved
[2024-06-03 00:18:21] [INFO ] Deduced a trap composed of 59 places in 94 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 1/719 constraints. Problems are: Problem set: 0 solved, 440 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/719 constraints. Problems are: Problem set: 0 solved, 440 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/563 variables, and 719 constraints, problems are : Problem set: 0 solved, 440 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 173/173 constraints, ReadFeed: 86/86 constraints, PredecessorRefiner: 440/440 constraints, Known Traps: 10/10 constraints]
After SMT, in 52011ms problems are : Problem set: 0 solved, 440 unsolved
Search for dead transitions found 0 dead transitions in 52016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52528 ms. Remains : 173/173 places, 444/444 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 155 edges and 173 vertex of which 24 / 173 are part of one of the 5 SCC in 1 ms
Free SCC test removed 19 places
Drop transitions (Empty/Sink Transition effects.) removed 80 transitions
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 113 transitions.
Graph (complete) has 636 edges and 154 vertex of which 151 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) 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 0 with 2 rules applied. Total rules applied 4 place count 151 transition count 329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 150 transition count 329
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 8 place count 147 transition count 326
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 147 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 147 transition count 324
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 3 with 2 rules applied. Total rules applied 15 place count 146 transition count 323
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 19 place count 144 transition count 325
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 25 place count 144 transition count 319
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 47 place count 144 transition count 297
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 3 rules applied. Total rules applied 50 place count 144 transition count 294
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 4 rules applied. Total rules applied 54 place count 141 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 55 place count 140 transition count 293
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 65 place count 135 transition count 288
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 70 place count 135 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 72 place count 135 transition count 281
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 74 place count 134 transition count 280
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 84 place count 134 transition count 270
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 11 rules applied. Total rules applied 95 place count 124 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 98 place count 124 transition count 266
Free-agglomeration rule applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 100 place count 124 transition count 264
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 102 place count 122 transition count 264
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 109 place count 122 transition count 264
Applied a total of 109 rules in 53 ms. Remains 122 /173 variables (removed 51) and now considering 264/444 (removed 180) transitions.
Running SMT prover for 4 properties.
[2024-06-03 00:18:38] [INFO ] Flow matrix only has 262 transitions (discarded 2 similar events)
// Phase 1: matrix 262 rows 122 cols
[2024-06-03 00:18:38] [INFO ] Computed 10 invariants in 2 ms
[2024-06-03 00:18:38] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-03 00:18:38] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-03 00:18:38] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-03 00:18:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-03 00:18:38] [INFO ] After 34ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-03 00:18:38] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-03 00:18:38] [INFO ] After 257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 363 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA FireWire-PT-19-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-03 00:18:38] [INFO ] Flatten gal took : 38 ms
[2024-06-03 00:18:38] [INFO ] Flatten gal took : 41 ms
[2024-06-03 00:18:38] [INFO ] Input system was already deterministic with 831 transitions.
Support contains 72 out of 491 places (down from 76) after GAL structural reductions.
Computed a total of 83 stabilizing places and 86 stable transitions
Graph (complete) has 1426 edges and 491 vertex of which 487 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.12 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 385 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 471 transition count 709
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 109 rules applied. Total rules applied 216 place count 366 transition count 705
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 218 place count 364 transition count 705
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 218 place count 364 transition count 677
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 274 place count 336 transition count 677
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 298 place count 312 transition count 650
Iterating global reduction 3 with 24 rules applied. Total rules applied 322 place count 312 transition count 650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 324 place count 312 transition count 648
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 324 place count 312 transition count 640
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 340 place count 304 transition count 640
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 345 place count 299 transition count 605
Iterating global reduction 4 with 5 rules applied. Total rules applied 350 place count 299 transition count 605
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 4 with 2 rules applied. Total rules applied 352 place count 299 transition count 603
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 353 place count 298 transition count 603
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 423 place count 263 transition count 568
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 426 place count 260 transition count 534
Iterating global reduction 6 with 3 rules applied. Total rules applied 429 place count 260 transition count 534
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 430 place count 260 transition count 533
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 431 place count 260 transition count 533
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 433 place count 258 transition count 531
Applied a total of 433 rules in 91 ms. Remains 258 /491 variables (removed 233) and now considering 531/831 (removed 300) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 258/491 places, 531/831 transitions.
[2024-06-03 00:18:38] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:18:38] [INFO ] Flatten gal took : 23 ms
[2024-06-03 00:18:38] [INFO ] Input system was already deterministic with 531 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 49 place count 442 transition count 782
Iterating global reduction 1 with 45 rules applied. Total rules applied 94 place count 442 transition count 782
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 106 place count 430 transition count 741
Iterating global reduction 1 with 12 rules applied. Total rules applied 118 place count 430 transition count 741
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 120 place count 430 transition count 739
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 428 transition count 737
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 428 transition count 737
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 126 place count 426 transition count 735
Iterating global reduction 2 with 2 rules applied. Total rules applied 128 place count 426 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 424 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 424 transition count 733
Applied a total of 132 rules in 33 ms. Remains 424 /491 variables (removed 67) and now considering 733/831 (removed 98) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 424/491 places, 733/831 transitions.
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 27 ms
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 28 ms
[2024-06-03 00:18:39] [INFO ] Input system was already deterministic with 733 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 51 place count 440 transition count 780
Iterating global reduction 1 with 47 rules applied. Total rules applied 98 place count 440 transition count 780
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 112 place count 426 transition count 734
Iterating global reduction 1 with 14 rules applied. Total rules applied 126 place count 426 transition count 734
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 128 place count 426 transition count 732
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 130 place count 424 transition count 730
Iterating global reduction 2 with 2 rules applied. Total rules applied 132 place count 424 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 422 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 422 transition count 728
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 420 transition count 726
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 420 transition count 726
Applied a total of 140 rules in 32 ms. Remains 420 /491 variables (removed 71) and now considering 726/831 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 420/491 places, 726/831 transitions.
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:18:39] [INFO ] Input system was already deterministic with 726 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 48 places :
Symmetric choice reduction at 1 with 48 rule applications. Total rules 52 place count 439 transition count 779
Iterating global reduction 1 with 48 rules applied. Total rules applied 100 place count 439 transition count 779
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 115 place count 424 transition count 732
Iterating global reduction 1 with 15 rules applied. Total rules applied 130 place count 424 transition count 732
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 132 place count 424 transition count 730
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 134 place count 422 transition count 728
Iterating global reduction 2 with 2 rules applied. Total rules applied 136 place count 422 transition count 728
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 138 place count 420 transition count 726
Iterating global reduction 2 with 2 rules applied. Total rules applied 140 place count 420 transition count 726
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 142 place count 418 transition count 724
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 418 transition count 724
Applied a total of 144 rules in 31 ms. Remains 418 /491 variables (removed 73) and now considering 724/831 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 418/491 places, 724/831 transitions.
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 24 ms
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 25 ms
[2024-06-03 00:18:39] [INFO ] Input system was already deterministic with 724 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 387 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 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 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 471 transition count 708
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 218 place count 365 transition count 704
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 221 place count 363 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 362 transition count 703
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 222 place count 362 transition count 675
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 278 place count 334 transition count 675
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 301 place count 311 transition count 648
Iterating global reduction 4 with 23 rules applied. Total rules applied 324 place count 311 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 326 place count 311 transition count 646
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 326 place count 311 transition count 639
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 340 place count 304 transition count 639
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 345 place count 299 transition count 604
Iterating global reduction 5 with 5 rules applied. Total rules applied 350 place count 299 transition count 604
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 352 place count 299 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 353 place count 298 transition count 602
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 423 place count 263 transition count 567
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 426 place count 260 transition count 533
Iterating global reduction 7 with 3 rules applied. Total rules applied 429 place count 260 transition count 533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 430 place count 260 transition count 532
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 431 place count 259 transition count 531
Applied a total of 431 rules in 65 ms. Remains 259 /491 variables (removed 232) and now considering 531/831 (removed 300) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 259/491 places, 531/831 transitions.
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 18 ms
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:18:39] [INFO ] Input system was already deterministic with 531 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 386 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 473 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 107 place count 473 transition count 710
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 109 rules applied. Total rules applied 216 place count 368 transition count 706
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 218 place count 366 transition count 706
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 218 place count 366 transition count 678
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 274 place count 338 transition count 678
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 296 place count 316 transition count 652
Iterating global reduction 3 with 22 rules applied. Total rules applied 318 place count 316 transition count 652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 316 transition count 651
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 319 place count 316 transition count 644
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 333 place count 309 transition count 644
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 337 place count 305 transition count 611
Iterating global reduction 4 with 4 rules applied. Total rules applied 341 place count 305 transition count 611
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 4 with 2 rules applied. Total rules applied 343 place count 305 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 344 place count 304 transition count 609
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 420 place count 266 transition count 571
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 423 place count 263 transition count 537
Iterating global reduction 6 with 3 rules applied. Total rules applied 426 place count 263 transition count 537
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 427 place count 263 transition count 536
Applied a total of 427 rules in 51 ms. Remains 263 /491 variables (removed 228) and now considering 536/831 (removed 295) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 263/491 places, 536/831 transitions.
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:18:39] [INFO ] Input system was already deterministic with 536 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 51 place count 440 transition count 780
Iterating global reduction 1 with 47 rules applied. Total rules applied 98 place count 440 transition count 780
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 113 place count 425 transition count 733
Iterating global reduction 1 with 15 rules applied. Total rules applied 128 place count 425 transition count 733
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 130 place count 425 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 132 place count 423 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 134 place count 423 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 421 transition count 727
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 421 transition count 727
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 419 transition count 725
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 419 transition count 725
Applied a total of 142 rules in 26 ms. Remains 419 /491 variables (removed 72) and now considering 725/831 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 419/491 places, 725/831 transitions.
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 22 ms
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 23 ms
[2024-06-03 00:18:39] [INFO ] Input system was already deterministic with 725 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 488 transition count 831
Discarding 47 places :
Symmetric choice reduction at 1 with 47 rule applications. Total rules 50 place count 441 transition count 780
Iterating global reduction 1 with 47 rules applied. Total rules applied 97 place count 441 transition count 780
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 110 place count 428 transition count 735
Iterating global reduction 1 with 13 rules applied. Total rules applied 123 place count 428 transition count 735
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 125 place count 428 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 127 place count 426 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 129 place count 426 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 131 place count 424 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 424 transition count 729
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 135 place count 422 transition count 727
Iterating global reduction 2 with 2 rules applied. Total rules applied 137 place count 422 transition count 727
Applied a total of 137 rules in 27 ms. Remains 422 /491 variables (removed 69) and now considering 727/831 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 422/491 places, 727/831 transitions.
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:18:39] [INFO ] Input system was already deterministic with 727 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 487 transition count 831
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 50 place count 441 transition count 781
Iterating global reduction 1 with 46 rules applied. Total rules applied 96 place count 441 transition count 781
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 109 place count 428 transition count 736
Iterating global reduction 1 with 13 rules applied. Total rules applied 122 place count 428 transition count 736
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 123 place count 428 transition count 735
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 125 place count 426 transition count 733
Iterating global reduction 2 with 2 rules applied. Total rules applied 127 place count 426 transition count 733
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 129 place count 424 transition count 731
Iterating global reduction 2 with 2 rules applied. Total rules applied 131 place count 424 transition count 731
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 133 place count 422 transition count 729
Iterating global reduction 2 with 2 rules applied. Total rules applied 135 place count 422 transition count 729
Applied a total of 135 rules in 32 ms. Remains 422 /491 variables (removed 69) and now considering 729/831 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 422/491 places, 729/831 transitions.
[2024-06-03 00:18:39] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:18:40] [INFO ] Input system was already deterministic with 729 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 388 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 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 107 transitions
Trivial Post-agglo rules discarded 107 transitions
Performed 107 trivial Post agglomeration. Transition count delta: 107
Iterating post reduction 0 with 107 rules applied. Total rules applied 109 place count 471 transition count 707
Reduce places removed 107 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 111 rules applied. Total rules applied 220 place count 364 transition count 703
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 222 place count 362 transition count 703
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 222 place count 362 transition count 675
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 278 place count 334 transition count 675
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 302 place count 310 transition count 647
Iterating global reduction 3 with 24 rules applied. Total rules applied 326 place count 310 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 328 place count 310 transition count 645
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 328 place count 310 transition count 638
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 342 place count 303 transition count 638
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 347 place count 298 transition count 603
Iterating global reduction 4 with 5 rules applied. Total rules applied 352 place count 298 transition count 603
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 4 with 2 rules applied. Total rules applied 354 place count 298 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 297 transition count 601
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 427 place count 261 transition count 565
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 430 place count 258 transition count 531
Iterating global reduction 6 with 3 rules applied. Total rules applied 433 place count 258 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 434 place count 258 transition count 530
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 435 place count 258 transition count 530
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 437 place count 256 transition count 528
Applied a total of 437 rules in 62 ms. Remains 256 /491 variables (removed 235) and now considering 528/831 (removed 303) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 256/491 places, 528/831 transitions.
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 16 ms
[2024-06-03 00:18:40] [INFO ] Input system was already deterministic with 528 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 386 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 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 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 471 transition count 708
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 218 place count 365 transition count 704
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 220 place count 363 transition count 704
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 220 place count 363 transition count 676
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 276 place count 335 transition count 676
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 300 place count 311 transition count 648
Iterating global reduction 3 with 24 rules applied. Total rules applied 324 place count 311 transition count 648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 326 place count 311 transition count 646
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 326 place count 311 transition count 638
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 342 place count 303 transition count 638
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 347 place count 298 transition count 603
Iterating global reduction 4 with 5 rules applied. Total rules applied 352 place count 298 transition count 603
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 4 with 2 rules applied. Total rules applied 354 place count 298 transition count 601
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 297 transition count 601
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 425 place count 262 transition count 566
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 428 place count 259 transition count 532
Iterating global reduction 6 with 3 rules applied. Total rules applied 431 place count 259 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 432 place count 259 transition count 531
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 434 place count 257 transition count 529
Applied a total of 434 rules in 55 ms. Remains 257 /491 variables (removed 234) and now considering 529/831 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 257/491 places, 529/831 transitions.
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 15 ms
[2024-06-03 00:18:40] [INFO ] Input system was already deterministic with 529 transitions.
Starting structural reductions in LTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 488 transition count 831
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 44 place count 447 transition count 788
Iterating global reduction 1 with 41 rules applied. Total rules applied 85 place count 447 transition count 788
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 96 place count 436 transition count 747
Iterating global reduction 1 with 11 rules applied. Total rules applied 107 place count 436 transition count 747
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 109 place count 436 transition count 745
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 435 transition count 744
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 435 transition count 744
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 434 transition count 743
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 434 transition count 743
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 433 transition count 742
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 433 transition count 742
Applied a total of 115 rules in 25 ms. Remains 433 /491 variables (removed 58) and now considering 742/831 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 433/491 places, 742/831 transitions.
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 19 ms
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 20 ms
[2024-06-03 00:18:40] [INFO ] Input system was already deterministic with 742 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 491/491 places, 831/831 transitions.
Graph (trivial) has 386 edges and 491 vertex of which 18 / 491 are part of one of the 3 SCC in 0 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 1409 edges and 476 vertex of which 472 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 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 108 place count 471 transition count 708
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 110 rules applied. Total rules applied 218 place count 365 transition count 704
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 221 place count 363 transition count 703
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 362 transition count 703
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 222 place count 362 transition count 676
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 276 place count 335 transition count 676
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 301 place count 310 transition count 647
Iterating global reduction 4 with 25 rules applied. Total rules applied 326 place count 310 transition count 647
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 328 place count 310 transition count 645
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 328 place count 310 transition count 637
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 344 place count 302 transition count 637
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 349 place count 297 transition count 602
Iterating global reduction 5 with 5 rules applied. Total rules applied 354 place count 297 transition count 602
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 356 place count 297 transition count 600
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 357 place count 296 transition count 600
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 427 place count 261 transition count 565
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 430 place count 258 transition count 531
Iterating global reduction 7 with 3 rules applied. Total rules applied 433 place count 258 transition count 531
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 434 place count 258 transition count 530
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 436 place count 256 transition count 528
Applied a total of 436 rules in 67 ms. Remains 256 /491 variables (removed 235) and now considering 528/831 (removed 303) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 256/491 places, 528/831 transitions.
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 12 ms
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 13 ms
[2024-06-03 00:18:40] [INFO ] Input system was already deterministic with 528 transitions.
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 22 ms
[2024-06-03 00:18:40] [INFO ] Flatten gal took : 21 ms
[2024-06-03 00:18:40] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-06-03 00:18:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 491 places, 831 transitions and 2522 arcs took 5 ms.
Total runtime 161284 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FireWire-PT-19

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 491
TRANSITIONS: 831
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.011s, Sys 0.003s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.002s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 826
MODEL NAME: /home/mcc/execution/410/model
491 places, 831 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FireWire-PT-19-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-12 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-14 CANNOT_COMPUTE
FORMULA FireWire-PT-19-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717375663435

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 524288 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-19"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is FireWire-PT-19, 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 r549-tall-171734898300313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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