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.r135-tall-171631131200498.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 DiscoveryGPU-PT-14b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131200498
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 02:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 12 02:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 12 02:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 12 02:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716371472069

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-14b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 09:51:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 09:51:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 09:51:13] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2024-05-22 09:51:13] [INFO ] Transformed 408 places.
[2024-05-22 09:51:13] [INFO ] Transformed 434 transitions.
[2024-05-22 09:51:13] [INFO ] Found NUPN structural information;
[2024-05-22 09:51:13] [INFO ] Parsed PT model containing 408 places and 434 transitions and 1135 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Support contains 125 out of 408 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 408/408 places, 434/434 transitions.
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 380 transition count 434
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 71 place count 337 transition count 391
Iterating global reduction 1 with 43 rules applied. Total rules applied 114 place count 337 transition count 391
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 122 place count 329 transition count 383
Iterating global reduction 1 with 8 rules applied. Total rules applied 130 place count 329 transition count 383
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 135 place count 324 transition count 378
Iterating global reduction 1 with 5 rules applied. Total rules applied 140 place count 324 transition count 378
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 322 transition count 376
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 322 transition count 376
Applied a total of 144 rules in 87 ms. Remains 322 /408 variables (removed 86) and now considering 376/434 (removed 58) transitions.
// Phase 1: matrix 376 rows 322 cols
[2024-05-22 09:51:13] [INFO ] Computed 2 invariants in 21 ms
[2024-05-22 09:51:13] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-22 09:51:13] [INFO ] Invariant cache hit.
[2024-05-22 09:51:14] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 375 sub problems to find dead transitions.
[2024-05-22 09:51:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/322 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (OVERLAPS) 376/698 variables, 322/324 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 09:51:23] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 25 ms to minimize.
[2024-05-22 09:51:23] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 3 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 2 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 3 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 156 places in 91 ms of which 2 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 2 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 2 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 2 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 2 ms to minimize.
[2024-05-22 09:51:24] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-22 09:51:25] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-22 09:51:25] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-05-22 09:51:25] [INFO ] Deduced a trap composed of 20 places in 92 ms of which 2 ms to minimize.
[2024-05-22 09:51:25] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-22 09:51:25] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 2 ms to minimize.
[2024-05-22 09:51:25] [INFO ] Deduced a trap composed of 26 places in 89 ms of which 2 ms to minimize.
[2024-05-22 09:51:25] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 2 ms to minimize.
[2024-05-22 09:51:25] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/698 variables, 20/344 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 3 ms to minimize.
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 3 ms to minimize.
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 2 ms to minimize.
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 2 ms to minimize.
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 2 ms to minimize.
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 18 places in 51 ms of which 2 ms to minimize.
[2024-05-22 09:51:26] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 10/354 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 7 (OVERLAPS) 0/698 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 375 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 354 constraints, problems are : Problem set: 0 solved, 375 unsolved in 26753 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 375 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 1 (OVERLAPS) 1/322 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/322 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/322 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 4 (OVERLAPS) 376/698 variables, 322/354 constraints. Problems are: Problem set: 0 solved, 375 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/698 variables, 375/729 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 09:51:48] [INFO ] Deduced a trap composed of 207 places in 106 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/698 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 375 unsolved
[2024-05-22 09:51:58] [INFO ] Deduced a trap composed of 212 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 375 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 698/698 variables, and 731 constraints, problems are : Problem set: 0 solved, 375 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 375/375 constraints, Known Traps: 32/32 constraints]
After SMT, in 57044ms problems are : Problem set: 0 solved, 375 unsolved
Search for dead transitions found 0 dead transitions in 57063ms
Starting structural reductions in LTL mode, iteration 1 : 322/408 places, 376/434 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57674 ms. Remains : 322/408 places, 376/434 transitions.
Support contains 125 out of 322 places after structural reductions.
[2024-05-22 09:52:11] [INFO ] Flatten gal took : 57 ms
[2024-05-22 09:52:11] [INFO ] Flatten gal took : 27 ms
[2024-05-22 09:52:11] [INFO ] Input system was already deterministic with 376 transitions.
Support contains 124 out of 322 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (86 resets) in 2404 ms. (16 steps per ms) remains 11/111 properties
BEST_FIRST walk for 40004 steps (11 resets) in 107 ms. (370 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 97 ms. (408 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (11 resets) in 98 ms. (404 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40003 steps (12 resets) in 220 ms. (181 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 75 ms. (526 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 69 ms. (571 steps per ms) remains 4/4 properties
[2024-05-22 09:52:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 11/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 143/165 variables, 22/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 436/601 variables, 217/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 88/689 variables, 74/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/689 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp109 is UNSAT
At refinement iteration 9 (OVERLAPS) 9/698 variables, 9/324 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/698 variables, 0/324 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/698 variables, 0/324 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 324 constraints, problems are : Problem set: 3 solved, 1 unsolved in 312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/16 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 132/148 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/18 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 445/593 variables, 216/234 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/593 variables, 1/235 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/593 variables, 0/235 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 94/687 variables, 79/314 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-22 09:52:13] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/687 variables, 1/315 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/687 variables, 0/315 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/698 variables, 11/326 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/698 variables, 0/326 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/698 variables, 0/326 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 698/698 variables, and 326 constraints, problems are : Problem set: 3 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 322/322 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 634ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 1858 steps, including 18 resets, run visited all 1 properties in 8 ms. (steps per millisecond=232 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 20 ms
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 20 ms
[2024-05-22 09:52:13] [INFO ] Input system was already deterministic with 376 transitions.
Computed a total of 51 stabilizing places and 51 stable transitions
Graph (complete) has 619 edges and 322 vertex of which 314 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 288 transition count 341
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 288 transition count 341
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 82 place count 274 transition count 326
Iterating global reduction 0 with 14 rules applied. Total rules applied 96 place count 274 transition count 326
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 108 place count 262 transition count 310
Iterating global reduction 0 with 12 rules applied. Total rules applied 120 place count 262 transition count 310
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 130 place count 252 transition count 299
Iterating global reduction 0 with 10 rules applied. Total rules applied 140 place count 252 transition count 299
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 149 place count 243 transition count 286
Iterating global reduction 0 with 9 rules applied. Total rules applied 158 place count 243 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 163 place count 238 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 168 place count 238 transition count 281
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 172 place count 234 transition count 277
Iterating global reduction 0 with 4 rules applied. Total rules applied 176 place count 234 transition count 277
Applied a total of 176 rules in 45 ms. Remains 234 /322 variables (removed 88) and now considering 277/376 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 234/322 places, 277/376 transitions.
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 09:52:13] [INFO ] Input system was already deterministic with 277 transitions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 289 transition count 341
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 289 transition count 341
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 76 place count 279 transition count 331
Iterating global reduction 0 with 10 rules applied. Total rules applied 86 place count 279 transition count 331
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 95 place count 270 transition count 320
Iterating global reduction 0 with 9 rules applied. Total rules applied 104 place count 270 transition count 320
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 264 transition count 313
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 264 transition count 313
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 122 place count 258 transition count 304
Iterating global reduction 0 with 6 rules applied. Total rules applied 128 place count 258 transition count 304
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 132 place count 254 transition count 300
Iterating global reduction 0 with 4 rules applied. Total rules applied 136 place count 254 transition count 300
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 138 place count 252 transition count 298
Iterating global reduction 0 with 2 rules applied. Total rules applied 140 place count 252 transition count 298
Applied a total of 140 rules in 44 ms. Remains 252 /322 variables (removed 70) and now considering 298/376 (removed 78) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 252/322 places, 298/376 transitions.
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 12 ms
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 13 ms
[2024-05-22 09:52:13] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 286 transition count 338
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 286 transition count 338
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 86 place count 272 transition count 323
Iterating global reduction 0 with 14 rules applied. Total rules applied 100 place count 272 transition count 323
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 113 place count 259 transition count 306
Iterating global reduction 0 with 13 rules applied. Total rules applied 126 place count 259 transition count 306
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 137 place count 248 transition count 293
Iterating global reduction 0 with 11 rules applied. Total rules applied 148 place count 248 transition count 293
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 158 place count 238 transition count 279
Iterating global reduction 0 with 10 rules applied. Total rules applied 168 place count 238 transition count 279
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 174 place count 232 transition count 273
Iterating global reduction 0 with 6 rules applied. Total rules applied 180 place count 232 transition count 273
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 183 place count 229 transition count 270
Iterating global reduction 0 with 3 rules applied. Total rules applied 186 place count 229 transition count 270
Applied a total of 186 rules in 43 ms. Remains 229 /322 variables (removed 93) and now considering 270/376 (removed 106) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 229/322 places, 270/376 transitions.
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 10 ms
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 11 ms
[2024-05-22 09:52:13] [INFO ] Input system was already deterministic with 270 transitions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 285 transition count 337
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 285 transition count 337
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 89 place count 270 transition count 321
Iterating global reduction 0 with 15 rules applied. Total rules applied 104 place count 270 transition count 321
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 117 place count 257 transition count 304
Iterating global reduction 0 with 13 rules applied. Total rules applied 130 place count 257 transition count 304
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 140 place count 247 transition count 292
Iterating global reduction 0 with 10 rules applied. Total rules applied 150 place count 247 transition count 292
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 158 place count 239 transition count 282
Iterating global reduction 0 with 8 rules applied. Total rules applied 166 place count 239 transition count 282
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 170 place count 235 transition count 278
Iterating global reduction 0 with 4 rules applied. Total rules applied 174 place count 235 transition count 278
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 176 place count 233 transition count 276
Iterating global reduction 0 with 2 rules applied. Total rules applied 178 place count 233 transition count 276
Applied a total of 178 rules in 44 ms. Remains 233 /322 variables (removed 89) and now considering 276/376 (removed 100) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 233/322 places, 276/376 transitions.
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 10 ms
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 10 ms
[2024-05-22 09:52:13] [INFO ] Input system was already deterministic with 276 transitions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 289 transition count 341
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 289 transition count 341
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 79 place count 276 transition count 327
Iterating global reduction 0 with 13 rules applied. Total rules applied 92 place count 276 transition count 327
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 103 place count 265 transition count 314
Iterating global reduction 0 with 11 rules applied. Total rules applied 114 place count 265 transition count 314
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 123 place count 256 transition count 303
Iterating global reduction 0 with 9 rules applied. Total rules applied 132 place count 256 transition count 303
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 140 place count 248 transition count 291
Iterating global reduction 0 with 8 rules applied. Total rules applied 148 place count 248 transition count 291
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 154 place count 242 transition count 285
Iterating global reduction 0 with 6 rules applied. Total rules applied 160 place count 242 transition count 285
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 164 place count 238 transition count 281
Iterating global reduction 0 with 4 rules applied. Total rules applied 168 place count 238 transition count 281
Applied a total of 168 rules in 25 ms. Remains 238 /322 variables (removed 84) and now considering 281/376 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 238/322 places, 281/376 transitions.
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 10 ms
[2024-05-22 09:52:13] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 288 transition count 341
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 288 transition count 341
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 81 place count 275 transition count 327
Iterating global reduction 0 with 13 rules applied. Total rules applied 94 place count 275 transition count 327
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 105 place count 264 transition count 312
Iterating global reduction 0 with 11 rules applied. Total rules applied 116 place count 264 transition count 312
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 126 place count 254 transition count 300
Iterating global reduction 0 with 10 rules applied. Total rules applied 136 place count 254 transition count 300
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 145 place count 245 transition count 288
Iterating global reduction 0 with 9 rules applied. Total rules applied 154 place count 245 transition count 288
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 159 place count 240 transition count 283
Iterating global reduction 0 with 5 rules applied. Total rules applied 164 place count 240 transition count 283
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 167 place count 237 transition count 280
Iterating global reduction 0 with 3 rules applied. Total rules applied 170 place count 237 transition count 280
Applied a total of 170 rules in 23 ms. Remains 237 /322 variables (removed 85) and now considering 280/376 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 237/322 places, 280/376 transitions.
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 09:52:13] [INFO ] Input system was already deterministic with 280 transitions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 287 transition count 340
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 287 transition count 340
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 84 place count 273 transition count 325
Iterating global reduction 0 with 14 rules applied. Total rules applied 98 place count 273 transition count 325
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 109 place count 262 transition count 310
Iterating global reduction 0 with 11 rules applied. Total rules applied 120 place count 262 transition count 310
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 130 place count 252 transition count 299
Iterating global reduction 0 with 10 rules applied. Total rules applied 140 place count 252 transition count 299
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 149 place count 243 transition count 286
Iterating global reduction 0 with 9 rules applied. Total rules applied 158 place count 243 transition count 286
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 163 place count 238 transition count 281
Iterating global reduction 0 with 5 rules applied. Total rules applied 168 place count 238 transition count 281
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 172 place count 234 transition count 277
Iterating global reduction 0 with 4 rules applied. Total rules applied 176 place count 234 transition count 277
Applied a total of 176 rules in 20 ms. Remains 234 /322 variables (removed 88) and now considering 277/376 (removed 99) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 234/322 places, 277/376 transitions.
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:52:13] [INFO ] Flatten gal took : 9 ms
[2024-05-22 09:52:13] [INFO ] Input system was already deterministic with 277 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Graph (complete) has 619 edges and 322 vertex of which 314 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 313 transition count 303
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 249 transition count 303
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 129 place count 249 transition count 272
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 191 place count 218 transition count 272
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 206 place count 203 transition count 255
Iterating global reduction 2 with 15 rules applied. Total rules applied 221 place count 203 transition count 255
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 221 place count 203 transition count 253
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 225 place count 201 transition count 253
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 236 place count 190 transition count 241
Iterating global reduction 2 with 11 rules applied. Total rules applied 247 place count 190 transition count 241
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 255 place count 182 transition count 230
Iterating global reduction 2 with 8 rules applied. Total rules applied 263 place count 182 transition count 230
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 270 place count 175 transition count 219
Iterating global reduction 2 with 7 rules applied. Total rules applied 277 place count 175 transition count 219
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 281 place count 171 transition count 215
Iterating global reduction 2 with 4 rules applied. Total rules applied 285 place count 171 transition count 215
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 341 place count 143 transition count 187
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 343 place count 141 transition count 184
Iterating global reduction 2 with 2 rules applied. Total rules applied 345 place count 141 transition count 184
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 347 place count 139 transition count 181
Iterating global reduction 2 with 2 rules applied. Total rules applied 349 place count 139 transition count 181
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 350 place count 138 transition count 180
Iterating global reduction 2 with 1 rules applied. Total rules applied 351 place count 138 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 353 place count 136 transition count 178
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 163 edges and 134 vertex of which 130 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 143 edges and 130 vertex of which 56 / 130 are part of one of the 28 SCC in 2 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 2 with 47 rules applied. Total rules applied 400 place count 102 transition count 130
Reduce places removed 43 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 3 with 71 rules applied. Total rules applied 471 place count 59 transition count 102
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 483 place count 47 transition count 78
Iterating global reduction 4 with 12 rules applied. Total rules applied 495 place count 47 transition count 78
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 507 place count 35 transition count 54
Iterating global reduction 4 with 12 rules applied. Total rules applied 519 place count 35 transition count 54
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 531 place count 23 transition count 30
Iterating global reduction 4 with 12 rules applied. Total rules applied 543 place count 23 transition count 30
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 555 place count 11 transition count 18
Iterating global reduction 4 with 12 rules applied. Total rules applied 567 place count 11 transition count 18
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 568 place count 11 transition count 17
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 1 rules applied. Total rules applied 569 place count 11 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 570 place count 10 transition count 16
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 572 place count 8 transition count 14
Applied a total of 572 rules in 93 ms. Remains 8 /322 variables (removed 314) and now considering 14/376 (removed 362) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 93 ms. Remains : 8/322 places, 14/376 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 0 ms
[2024-05-22 09:52:14] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Graph (complete) has 619 edges and 322 vertex of which 314 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 313 transition count 306
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 252 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 251 transition count 305
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 125 place count 251 transition count 274
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 187 place count 220 transition count 274
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 203 place count 204 transition count 256
Iterating global reduction 3 with 16 rules applied. Total rules applied 219 place count 204 transition count 256
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 219 place count 204 transition count 254
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 223 place count 202 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 235 place count 190 transition count 241
Iterating global reduction 3 with 12 rules applied. Total rules applied 247 place count 190 transition count 241
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 256 place count 181 transition count 228
Iterating global reduction 3 with 9 rules applied. Total rules applied 265 place count 181 transition count 228
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 273 place count 173 transition count 216
Iterating global reduction 3 with 8 rules applied. Total rules applied 281 place count 173 transition count 216
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 285 place count 169 transition count 212
Iterating global reduction 3 with 4 rules applied. Total rules applied 289 place count 169 transition count 212
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 341 place count 143 transition count 186
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 343 place count 141 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 345 place count 141 transition count 183
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 347 place count 139 transition count 180
Iterating global reduction 3 with 2 rules applied. Total rules applied 349 place count 139 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 350 place count 138 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 351 place count 138 transition count 179
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 353 place count 138 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 355 place count 136 transition count 177
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 171 edges and 134 vertex of which 130 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 137 edges and 130 vertex of which 52 / 130 are part of one of the 26 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 44 rules applied. Total rules applied 399 place count 104 transition count 132
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 67 rules applied. Total rules applied 466 place count 64 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 467 place count 63 transition count 105
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 479 place count 51 transition count 81
Iterating global reduction 6 with 12 rules applied. Total rules applied 491 place count 51 transition count 81
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 502 place count 40 transition count 59
Iterating global reduction 6 with 11 rules applied. Total rules applied 513 place count 40 transition count 59
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 524 place count 29 transition count 37
Iterating global reduction 6 with 11 rules applied. Total rules applied 535 place count 29 transition count 37
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 546 place count 18 transition count 26
Iterating global reduction 6 with 11 rules applied. Total rules applied 557 place count 18 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 561 place count 16 transition count 24
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 6 with 2 rules applied. Total rules applied 563 place count 15 transition count 23
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 565 place count 15 transition count 21
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 1 rules applied. Total rules applied 566 place count 15 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 567 place count 14 transition count 20
Applied a total of 567 rules in 90 ms. Remains 14 /322 variables (removed 308) and now considering 20/376 (removed 356) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 14/322 places, 20/376 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:52:14] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Graph (complete) has 619 edges and 322 vertex of which 314 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 313 transition count 317
Reduce places removed 50 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 57 rules applied. Total rules applied 108 place count 263 transition count 310
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 115 place count 256 transition count 310
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 115 place count 256 transition count 277
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 181 place count 223 transition count 277
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 196 place count 208 transition count 260
Iterating global reduction 3 with 15 rules applied. Total rules applied 211 place count 208 transition count 260
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 222 place count 197 transition count 248
Iterating global reduction 3 with 11 rules applied. Total rules applied 233 place count 197 transition count 248
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 240 place count 190 transition count 238
Iterating global reduction 3 with 7 rules applied. Total rules applied 247 place count 190 transition count 238
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 253 place count 184 transition count 229
Iterating global reduction 3 with 6 rules applied. Total rules applied 259 place count 184 transition count 229
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 262 place count 181 transition count 226
Iterating global reduction 3 with 3 rules applied. Total rules applied 265 place count 181 transition count 226
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 323 place count 152 transition count 197
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 325 place count 150 transition count 194
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 150 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 329 place count 148 transition count 191
Iterating global reduction 3 with 2 rules applied. Total rules applied 331 place count 148 transition count 191
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 332 place count 147 transition count 190
Iterating global reduction 3 with 1 rules applied. Total rules applied 333 place count 147 transition count 190
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 337 place count 147 transition count 190
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 339 place count 145 transition count 188
Applied a total of 339 rules in 58 ms. Remains 145 /322 variables (removed 177) and now considering 188/376 (removed 188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 145/322 places, 188/376 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 6 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 09:52:14] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 286 transition count 338
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 286 transition count 338
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 85 place count 273 transition count 324
Iterating global reduction 0 with 13 rules applied. Total rules applied 98 place count 273 transition count 324
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 263 transition count 310
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 263 transition count 310
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 254 transition count 299
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 254 transition count 299
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 144 place count 246 transition count 289
Iterating global reduction 0 with 8 rules applied. Total rules applied 152 place count 246 transition count 289
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 156 place count 242 transition count 285
Iterating global reduction 0 with 4 rules applied. Total rules applied 160 place count 242 transition count 285
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 240 transition count 283
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 240 transition count 283
Applied a total of 164 rules in 42 ms. Remains 240 /322 variables (removed 82) and now considering 283/376 (removed 93) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 240/322 places, 283/376 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:52:14] [INFO ] Input system was already deterministic with 283 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Graph (complete) has 619 edges and 322 vertex of which 314 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 313 transition count 306
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 124 place count 252 transition count 305
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 251 transition count 305
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 125 place count 251 transition count 274
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 187 place count 220 transition count 274
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 203 place count 204 transition count 256
Iterating global reduction 3 with 16 rules applied. Total rules applied 219 place count 204 transition count 256
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 219 place count 204 transition count 254
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 223 place count 202 transition count 254
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 235 place count 190 transition count 241
Iterating global reduction 3 with 12 rules applied. Total rules applied 247 place count 190 transition count 241
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 255 place count 182 transition count 230
Iterating global reduction 3 with 8 rules applied. Total rules applied 263 place count 182 transition count 230
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 269 place count 176 transition count 221
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 176 transition count 221
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 278 place count 173 transition count 218
Iterating global reduction 3 with 3 rules applied. Total rules applied 281 place count 173 transition count 218
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
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 337 place count 145 transition count 190
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 339 place count 143 transition count 187
Iterating global reduction 3 with 2 rules applied. Total rules applied 341 place count 143 transition count 187
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 343 place count 141 transition count 184
Iterating global reduction 3 with 2 rules applied. Total rules applied 345 place count 141 transition count 184
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 346 place count 140 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 347 place count 140 transition count 183
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 349 place count 140 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 351 place count 138 transition count 181
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 166 edges and 136 vertex of which 132 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 142 edges and 132 vertex of which 54 / 132 are part of one of the 27 SCC in 0 ms
Free SCC test removed 27 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 3 with 46 rules applied. Total rules applied 397 place count 105 transition count 134
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 70 rules applied. Total rules applied 467 place count 63 transition count 106
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 477 place count 53 transition count 86
Iterating global reduction 5 with 10 rules applied. Total rules applied 487 place count 53 transition count 86
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 497 place count 43 transition count 66
Iterating global reduction 5 with 10 rules applied. Total rules applied 507 place count 43 transition count 66
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 517 place count 33 transition count 46
Iterating global reduction 5 with 10 rules applied. Total rules applied 527 place count 33 transition count 46
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 537 place count 23 transition count 36
Iterating global reduction 5 with 10 rules applied. Total rules applied 547 place count 23 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 549 place count 23 transition count 34
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 5 with 2 rules applied. Total rules applied 551 place count 23 transition count 32
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 553 place count 21 transition count 32
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 557 place count 17 transition count 28
Applied a total of 557 rules in 72 ms. Remains 17 /322 variables (removed 305) and now considering 28/376 (removed 348) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 17/322 places, 28/376 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 1 ms
[2024-05-22 09:52:14] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 291 transition count 344
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 291 transition count 344
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 76 place count 277 transition count 329
Iterating global reduction 0 with 14 rules applied. Total rules applied 90 place count 277 transition count 329
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 101 place count 266 transition count 315
Iterating global reduction 0 with 11 rules applied. Total rules applied 112 place count 266 transition count 315
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 120 place count 258 transition count 305
Iterating global reduction 0 with 8 rules applied. Total rules applied 128 place count 258 transition count 305
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 135 place count 251 transition count 295
Iterating global reduction 0 with 7 rules applied. Total rules applied 142 place count 251 transition count 295
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 147 place count 246 transition count 290
Iterating global reduction 0 with 5 rules applied. Total rules applied 152 place count 246 transition count 290
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 155 place count 243 transition count 287
Iterating global reduction 0 with 3 rules applied. Total rules applied 158 place count 243 transition count 287
Applied a total of 158 rules in 42 ms. Remains 243 /322 variables (removed 79) and now considering 287/376 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 243/322 places, 287/376 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:52:14] [INFO ] Input system was already deterministic with 287 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Graph (complete) has 619 edges and 322 vertex of which 314 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 313 transition count 304
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 250 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 249 transition count 303
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 129 place count 249 transition count 272
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 191 place count 218 transition count 272
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 207 place count 202 transition count 254
Iterating global reduction 3 with 16 rules applied. Total rules applied 223 place count 202 transition count 254
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 223 place count 202 transition count 252
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 227 place count 200 transition count 252
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 239 place count 188 transition count 239
Iterating global reduction 3 with 12 rules applied. Total rules applied 251 place count 188 transition count 239
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 260 place count 179 transition count 226
Iterating global reduction 3 with 9 rules applied. Total rules applied 269 place count 179 transition count 226
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 277 place count 171 transition count 214
Iterating global reduction 3 with 8 rules applied. Total rules applied 285 place count 171 transition count 214
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 289 place count 167 transition count 210
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 167 transition count 210
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
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 349 place count 139 transition count 182
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 351 place count 137 transition count 179
Iterating global reduction 3 with 2 rules applied. Total rules applied 353 place count 137 transition count 179
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 355 place count 135 transition count 176
Iterating global reduction 3 with 2 rules applied. Total rules applied 357 place count 135 transition count 176
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 358 place count 134 transition count 175
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 134 transition count 175
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 361 place count 132 transition count 173
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 158 edges and 130 vertex of which 126 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 138 edges and 126 vertex of which 56 / 126 are part of one of the 28 SCC in 0 ms
Free SCC test removed 28 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 44 rules applied. Total rules applied 405 place count 98 transition count 128
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 69 rules applied. Total rules applied 474 place count 58 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 475 place count 57 transition count 99
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 488 place count 44 transition count 73
Iterating global reduction 6 with 13 rules applied. Total rules applied 501 place count 44 transition count 73
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 513 place count 32 transition count 49
Iterating global reduction 6 with 12 rules applied. Total rules applied 525 place count 32 transition count 49
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 537 place count 20 transition count 25
Iterating global reduction 6 with 12 rules applied. Total rules applied 549 place count 20 transition count 25
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 561 place count 8 transition count 13
Iterating global reduction 6 with 12 rules applied. Total rules applied 573 place count 8 transition count 13
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 575 place count 8 transition count 11
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 1 rules applied. Total rules applied 576 place count 8 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 577 place count 7 transition count 10
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 579 place count 5 transition count 8
Applied a total of 579 rules in 53 ms. Remains 5 /322 variables (removed 317) and now considering 8/376 (removed 368) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 5/322 places, 8/376 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 0 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 0 ms
[2024-05-22 09:52:14] [INFO ] Input system was already deterministic with 8 transitions.
RANDOM walk for 50 steps (0 resets) in 6 ms. (7 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-14b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 294 transition count 346
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 294 transition count 346
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 285 transition count 336
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 285 transition count 336
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 277 transition count 324
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 277 transition count 324
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 96 place count 271 transition count 317
Iterating global reduction 0 with 6 rules applied. Total rules applied 102 place count 271 transition count 317
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 107 place count 266 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 112 place count 266 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 113 place count 265 transition count 311
Iterating global reduction 0 with 1 rules applied. Total rules applied 114 place count 265 transition count 311
Applied a total of 114 rules in 36 ms. Remains 265 /322 variables (removed 57) and now considering 311/376 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 265/322 places, 311/376 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 10 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 11 ms
[2024-05-22 09:52:14] [INFO ] Input system was already deterministic with 311 transitions.
Starting structural reductions in LTL mode, iteration 0 : 322/322 places, 376/376 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 286 transition count 338
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 286 transition count 338
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 85 place count 273 transition count 324
Iterating global reduction 0 with 13 rules applied. Total rules applied 98 place count 273 transition count 324
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 108 place count 263 transition count 311
Iterating global reduction 0 with 10 rules applied. Total rules applied 118 place count 263 transition count 311
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 127 place count 254 transition count 300
Iterating global reduction 0 with 9 rules applied. Total rules applied 136 place count 254 transition count 300
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 144 place count 246 transition count 289
Iterating global reduction 0 with 8 rules applied. Total rules applied 152 place count 246 transition count 289
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 157 place count 241 transition count 284
Iterating global reduction 0 with 5 rules applied. Total rules applied 162 place count 241 transition count 284
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 165 place count 238 transition count 281
Iterating global reduction 0 with 3 rules applied. Total rules applied 168 place count 238 transition count 281
Applied a total of 168 rules in 36 ms. Remains 238 /322 variables (removed 84) and now considering 281/376 (removed 95) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 238/322 places, 281/376 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 8 ms
[2024-05-22 09:52:14] [INFO ] Input system was already deterministic with 281 transitions.
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 12 ms
[2024-05-22 09:52:14] [INFO ] Flatten gal took : 12 ms
[2024-05-22 09:52:14] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-22 09:52:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 322 places, 376 transitions and 993 arcs took 4 ms.
Total runtime 61493 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DiscoveryGPU-PT-14b

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 659
MODEL NAME: /home/mcc/execution/412/model
322 places, 376 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.

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLFireability -timeout 360 -rebuildPNML

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="DiscoveryGPU-PT-14b"
export BK_EXAMINATION="CTLFireability"
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 DiscoveryGPU-PT-14b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131200498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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