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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K 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.9K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 12 02:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 12 02:00 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 68K 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-09b-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-09b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716363482029

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-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 07:38:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 07:38:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 07:38:03] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-22 07:38:03] [INFO ] Transformed 268 places.
[2024-05-22 07:38:03] [INFO ] Transformed 284 transitions.
[2024-05-22 07:38:03] [INFO ] Found NUPN structural information;
[2024-05-22 07:38:03] [INFO ] Parsed PT model containing 268 places and 284 transitions and 740 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 87 out of 268 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 268/268 places, 284/284 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 250 transition count 284
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 42 place count 226 transition count 260
Iterating global reduction 1 with 24 rules applied. Total rules applied 66 place count 226 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 223 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 223 transition count 257
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 222 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 222 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 221 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 221 transition count 255
Applied a total of 76 rules in 74 ms. Remains 221 /268 variables (removed 47) and now considering 255/284 (removed 29) transitions.
// Phase 1: matrix 255 rows 221 cols
[2024-05-22 07:38:03] [INFO ] Computed 2 invariants in 15 ms
[2024-05-22 07:38:03] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-22 07:38:03] [INFO ] Invariant cache hit.
[2024-05-22 07:38:03] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2024-05-22 07:38:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 255/476 variables, 221/223 constraints. Problems are: Problem set: 0 solved, 254 unsolved
[2024-05-22 07:38:08] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 24 ms to minimize.
[2024-05-22 07:38:08] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 3 ms to minimize.
[2024-05-22 07:38:08] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 2 ms to minimize.
[2024-05-22 07:38:08] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 2 ms to minimize.
[2024-05-22 07:38:08] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 2 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 2 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 2 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 10 places in 80 ms of which 2 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-22 07:38:09] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/476 variables, 19/242 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/476 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 476/476 variables, and 242 constraints, problems are : Problem set: 0 solved, 254 unsolved in 12233 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (OVERLAPS) 255/476 variables, 221/242 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/476 variables, 254/496 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/476 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/476 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 476/476 variables, and 496 constraints, problems are : Problem set: 0 solved, 254 unsolved in 11606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 19/19 constraints]
After SMT, in 23996ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 24015ms
Starting structural reductions in LTL mode, iteration 1 : 221/268 places, 255/284 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24578 ms. Remains : 221/268 places, 255/284 transitions.
Support contains 87 out of 221 places after structural reductions.
[2024-05-22 07:38:28] [INFO ] Flatten gal took : 42 ms
[2024-05-22 07:38:28] [INFO ] Flatten gal took : 18 ms
[2024-05-22 07:38:28] [INFO ] Input system was already deterministic with 255 transitions.
RANDOM walk for 40000 steps (133 resets) in 1747 ms. (22 steps per ms) remains 3/68 properties
BEST_FIRST walk for 40004 steps (23 resets) in 213 ms. (186 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (25 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 111 ms. (357 steps per ms) remains 1/2 properties
[2024-05-22 07:38:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/13 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 89/102 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 299/401 variables, 145/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp61 is UNSAT
After SMT solving in domain Real declared 470/476 variables, and 217 constraints, problems are : Problem set: 1 solved, 0 unsolved in 95 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 215/221 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 13 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 255 transitions.
Support contains 82 out of 221 places (down from 85) after GAL structural reductions.
Computed a total of 37 stabilizing places and 37 stable transitions
Graph (complete) has 413 edges and 221 vertex of which 211 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 197 transition count 231
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 197 transition count 231
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 190 transition count 223
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 190 transition count 223
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 185 transition count 217
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 185 transition count 217
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 180 transition count 211
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 180 transition count 211
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 86 place count 176 transition count 205
Iterating global reduction 0 with 4 rules applied. Total rules applied 90 place count 176 transition count 205
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 93 place count 173 transition count 202
Iterating global reduction 0 with 3 rules applied. Total rules applied 96 place count 173 transition count 202
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 171 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 171 transition count 200
Applied a total of 100 rules in 28 ms. Remains 171 /221 variables (removed 50) and now considering 200/255 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 171/221 places, 200/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 10 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 227
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 227
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 63 place count 186 transition count 220
Iterating global reduction 0 with 7 rules applied. Total rules applied 70 place count 186 transition count 220
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 180 transition count 213
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 180 transition count 213
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 88 place count 174 transition count 205
Iterating global reduction 0 with 6 rules applied. Total rules applied 94 place count 174 transition count 205
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 100 place count 168 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 106 place count 168 transition count 196
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 111 place count 163 transition count 191
Iterating global reduction 0 with 5 rules applied. Total rules applied 116 place count 163 transition count 191
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 119 place count 160 transition count 188
Iterating global reduction 0 with 3 rules applied. Total rules applied 122 place count 160 transition count 188
Applied a total of 122 rules in 25 ms. Remains 160 /221 variables (removed 61) and now considering 188/255 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 160/221 places, 188/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 192 transition count 226
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 192 transition count 226
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 183 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 183 transition count 216
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 175 transition count 207
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 175 transition count 207
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 99 place count 168 transition count 198
Iterating global reduction 0 with 7 rules applied. Total rules applied 106 place count 168 transition count 198
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 112 place count 162 transition count 189
Iterating global reduction 0 with 6 rules applied. Total rules applied 118 place count 162 transition count 189
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 123 place count 157 transition count 184
Iterating global reduction 0 with 5 rules applied. Total rules applied 128 place count 157 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 131 place count 154 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 134 place count 154 transition count 181
Applied a total of 134 rules in 24 ms. Remains 154 /221 variables (removed 67) and now considering 181/255 (removed 74) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 154/221 places, 181/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 199 transition count 233
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 199 transition count 233
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 195 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 195 transition count 229
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 192 transition count 226
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 192 transition count 226
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 189 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 189 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 187 transition count 219
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 187 transition count 219
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 185 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 185 transition count 217
Applied a total of 72 rules in 27 ms. Remains 185 /221 variables (removed 36) and now considering 217/255 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 185/221 places, 217/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Graph (complete) has 413 edges and 221 vertex of which 211 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
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 0 with 43 rules applied. Total rules applied 44 place count 210 transition count 201
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 167 transition count 201
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 87 place count 167 transition count 180
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 129 place count 146 transition count 180
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 139 place count 136 transition count 169
Iterating global reduction 2 with 10 rules applied. Total rules applied 149 place count 136 transition count 169
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 149 place count 136 transition count 168
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 151 place count 135 transition count 168
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 158 place count 128 transition count 161
Iterating global reduction 2 with 7 rules applied. Total rules applied 165 place count 128 transition count 161
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 171 place count 122 transition count 150
Iterating global reduction 2 with 6 rules applied. Total rules applied 177 place count 122 transition count 150
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 183 place count 116 transition count 143
Iterating global reduction 2 with 6 rules applied. Total rules applied 189 place count 116 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 190 place count 115 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 191 place count 115 transition count 142
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 233 place count 94 transition count 121
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 93 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 93 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 92 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 92 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 238 place count 91 transition count 117
Iterating global reduction 2 with 1 rules applied. Total rules applied 239 place count 91 transition count 117
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 241 place count 89 transition count 115
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 252 place count 88 transition count 105
Reduce places removed 10 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 3 with 12 rules applied. Total rules applied 264 place count 78 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 265 place count 77 transition count 103
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 265 place count 77 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 267 place count 76 transition count 102
Applied a total of 267 rules in 59 ms. Remains 76 /221 variables (removed 145) and now considering 102/255 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 76/221 places, 102/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 4 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 192 transition count 226
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 192 transition count 226
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 67 place count 183 transition count 216
Iterating global reduction 0 with 9 rules applied. Total rules applied 76 place count 183 transition count 216
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 84 place count 175 transition count 207
Iterating global reduction 0 with 8 rules applied. Total rules applied 92 place count 175 transition count 207
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 167 transition count 197
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 167 transition count 197
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 114 place count 161 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 120 place count 161 transition count 188
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 125 place count 156 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 130 place count 156 transition count 183
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 133 place count 153 transition count 180
Iterating global reduction 0 with 3 rules applied. Total rules applied 136 place count 153 transition count 180
Applied a total of 136 rules in 24 ms. Remains 153 /221 variables (removed 68) and now considering 180/255 (removed 75) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 153/221 places, 180/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 227
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 227
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 184 transition count 217
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 184 transition count 217
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 176 transition count 208
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 176 transition count 208
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 169 transition count 199
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 169 transition count 199
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 163 transition count 190
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 163 transition count 190
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 121 place count 158 transition count 185
Iterating global reduction 0 with 5 rules applied. Total rules applied 126 place count 158 transition count 185
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 155 transition count 182
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 155 transition count 182
Applied a total of 132 rules in 23 ms. Remains 155 /221 variables (removed 66) and now considering 182/255 (removed 73) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 155/221 places, 182/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Graph (complete) has 413 edges and 221 vertex of which 211 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
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 0 with 43 rules applied. Total rules applied 44 place count 210 transition count 201
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 167 transition count 201
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 87 place count 167 transition count 179
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 131 place count 145 transition count 179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 140 place count 136 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 149 place count 136 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 149 place count 136 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 135 transition count 169
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 157 place count 129 transition count 163
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 129 transition count 163
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 169 place count 123 transition count 152
Iterating global reduction 2 with 6 rules applied. Total rules applied 175 place count 123 transition count 152
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 181 place count 117 transition count 145
Iterating global reduction 2 with 6 rules applied. Total rules applied 187 place count 117 transition count 145
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 188 place count 116 transition count 144
Iterating global reduction 2 with 1 rules applied. Total rules applied 189 place count 116 transition count 144
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 231 place count 95 transition count 123
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 232 place count 94 transition count 122
Iterating global reduction 2 with 1 rules applied. Total rules applied 233 place count 94 transition count 122
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 234 place count 93 transition count 120
Iterating global reduction 2 with 1 rules applied. Total rules applied 235 place count 93 transition count 120
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 236 place count 92 transition count 119
Iterating global reduction 2 with 1 rules applied. Total rules applied 237 place count 92 transition count 119
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 238 place count 92 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 240 place count 90 transition count 117
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 107 edges and 88 vertex of which 84 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 92 edges and 84 vertex of which 36 / 84 are part of one of the 18 SCC in 2 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 2 with 31 rules applied. Total rules applied 271 place count 66 transition count 85
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 316 place count 39 transition count 67
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 323 place count 32 transition count 53
Iterating global reduction 4 with 7 rules applied. Total rules applied 330 place count 32 transition count 53
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 337 place count 25 transition count 39
Iterating global reduction 4 with 7 rules applied. Total rules applied 344 place count 25 transition count 39
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 351 place count 18 transition count 25
Iterating global reduction 4 with 7 rules applied. Total rules applied 358 place count 18 transition count 25
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 365 place count 11 transition count 18
Iterating global reduction 4 with 7 rules applied. Total rules applied 372 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 373 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 374 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 375 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 377 place count 8 transition count 14
Applied a total of 377 rules in 56 ms. Remains 8 /221 variables (removed 213) and now considering 14/255 (removed 241) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 8/221 places, 14/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 1 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 1 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 196 transition count 230
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 196 transition count 230
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 56 place count 190 transition count 224
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 190 transition count 224
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 185 transition count 218
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 185 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 76 place count 181 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 80 place count 181 transition count 213
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 83 place count 178 transition count 209
Iterating global reduction 0 with 3 rules applied. Total rules applied 86 place count 178 transition count 209
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 176 transition count 207
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 176 transition count 207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 175 transition count 206
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 175 transition count 206
Applied a total of 92 rules in 24 ms. Remains 175 /221 variables (removed 46) and now considering 206/255 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 175/221 places, 206/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 206 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 195 transition count 229
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 195 transition count 229
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 187 transition count 220
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 187 transition count 220
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 180 transition count 212
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 180 transition count 212
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 173 transition count 204
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 173 transition count 204
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 102 place count 167 transition count 194
Iterating global reduction 0 with 6 rules applied. Total rules applied 108 place count 167 transition count 194
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 162 transition count 189
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 162 transition count 189
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 158 transition count 185
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 158 transition count 185
Applied a total of 126 rules in 29 ms. Remains 158 /221 variables (removed 63) and now considering 185/255 (removed 70) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 158/221 places, 185/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 227
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 227
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 184 transition count 217
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 184 transition count 217
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 176 transition count 208
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 176 transition count 208
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 169 transition count 199
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 169 transition count 199
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 111 place count 162 transition count 188
Iterating global reduction 0 with 7 rules applied. Total rules applied 118 place count 162 transition count 188
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 123 place count 157 transition count 183
Iterating global reduction 0 with 5 rules applied. Total rules applied 128 place count 157 transition count 183
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 132 place count 153 transition count 179
Iterating global reduction 0 with 4 rules applied. Total rules applied 136 place count 153 transition count 179
Applied a total of 136 rules in 22 ms. Remains 153 /221 variables (removed 68) and now considering 179/255 (removed 76) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 153/221 places, 179/255 transitions.
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 07:38:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 07:38:29] [INFO ] Input system was already deterministic with 179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Graph (complete) has 413 edges and 221 vertex of which 211 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
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 0 with 42 rules applied. Total rules applied 43 place count 210 transition count 202
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 168 transition count 202
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 85 place count 168 transition count 180
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 129 place count 146 transition count 180
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 138 place count 137 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 147 place count 137 transition count 170
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 131 transition count 164
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 131 transition count 164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 164 place count 126 transition count 155
Iterating global reduction 2 with 5 rules applied. Total rules applied 169 place count 126 transition count 155
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 121 transition count 149
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 121 transition count 149
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 221 place count 100 transition count 128
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 222 place count 99 transition count 127
Iterating global reduction 2 with 1 rules applied. Total rules applied 223 place count 99 transition count 127
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 224 place count 98 transition count 125
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 98 transition count 125
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 226 place count 97 transition count 124
Iterating global reduction 2 with 1 rules applied. Total rules applied 227 place count 97 transition count 124
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 228 place count 97 transition count 124
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 230 place count 95 transition count 122
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 140 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 91 edges and 93 vertex of which 36 / 93 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 12 rules applied. Total rules applied 242 place count 75 transition count 112
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 3 with 27 rules applied. Total rules applied 269 place count 66 transition count 94
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 269 place count 66 transition count 85
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 287 place count 57 transition count 85
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 293 place count 51 transition count 73
Iterating global reduction 4 with 6 rules applied. Total rules applied 299 place count 51 transition count 73
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 305 place count 45 transition count 61
Iterating global reduction 4 with 6 rules applied. Total rules applied 311 place count 45 transition count 61
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 317 place count 39 transition count 55
Iterating global reduction 4 with 6 rules applied. Total rules applied 323 place count 39 transition count 55
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 329 place count 33 transition count 43
Iterating global reduction 4 with 6 rules applied. Total rules applied 335 place count 33 transition count 43
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 341 place count 27 transition count 37
Iterating global reduction 4 with 6 rules applied. Total rules applied 347 place count 27 transition count 37
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 350 place count 24 transition count 34
Applied a total of 350 rules in 51 ms. Remains 24 /221 variables (removed 197) and now considering 34/255 (removed 221) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 24/221 places, 34/255 transitions.
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 1 ms
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 1 ms
[2024-05-22 07:38:30] [INFO ] Input system was already deterministic with 34 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 196 transition count 230
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 196 transition count 230
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 187 transition count 220
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 187 transition count 220
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 75 place count 180 transition count 212
Iterating global reduction 0 with 7 rules applied. Total rules applied 82 place count 180 transition count 212
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 89 place count 173 transition count 203
Iterating global reduction 0 with 7 rules applied. Total rules applied 96 place count 173 transition count 203
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 103 place count 166 transition count 192
Iterating global reduction 0 with 7 rules applied. Total rules applied 110 place count 166 transition count 192
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 116 place count 160 transition count 186
Iterating global reduction 0 with 6 rules applied. Total rules applied 122 place count 160 transition count 186
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 126 place count 156 transition count 182
Iterating global reduction 0 with 4 rules applied. Total rules applied 130 place count 156 transition count 182
Applied a total of 130 rules in 25 ms. Remains 156 /221 variables (removed 65) and now considering 182/255 (removed 73) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 156/221 places, 182/255 transitions.
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 07:38:30] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 193 transition count 227
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 193 transition count 227
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 65 place count 184 transition count 217
Iterating global reduction 0 with 9 rules applied. Total rules applied 74 place count 184 transition count 217
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 177 transition count 210
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 177 transition count 210
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 95 place count 170 transition count 201
Iterating global reduction 0 with 7 rules applied. Total rules applied 102 place count 170 transition count 201
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 108 place count 164 transition count 191
Iterating global reduction 0 with 6 rules applied. Total rules applied 114 place count 164 transition count 191
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 120 place count 158 transition count 185
Iterating global reduction 0 with 6 rules applied. Total rules applied 126 place count 158 transition count 185
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 130 place count 154 transition count 181
Iterating global reduction 0 with 4 rules applied. Total rules applied 134 place count 154 transition count 181
Applied a total of 134 rules in 26 ms. Remains 154 /221 variables (removed 67) and now considering 181/255 (removed 74) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 154/221 places, 181/255 transitions.
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 07:38:30] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Graph (complete) has 413 edges and 221 vertex of which 211 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 39 place count 210 transition count 206
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 172 transition count 206
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 77 place count 172 transition count 186
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 117 place count 152 transition count 186
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 125 place count 144 transition count 177
Iterating global reduction 2 with 8 rules applied. Total rules applied 133 place count 144 transition count 177
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 139 place count 138 transition count 171
Iterating global reduction 2 with 6 rules applied. Total rules applied 145 place count 138 transition count 171
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 150 place count 133 transition count 162
Iterating global reduction 2 with 5 rules applied. Total rules applied 155 place count 133 transition count 162
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 160 place count 128 transition count 156
Iterating global reduction 2 with 5 rules applied. Total rules applied 165 place count 128 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 166 place count 127 transition count 155
Iterating global reduction 2 with 1 rules applied. Total rules applied 167 place count 127 transition count 155
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 205 place count 108 transition count 136
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 206 place count 107 transition count 135
Iterating global reduction 2 with 1 rules applied. Total rules applied 207 place count 107 transition count 135
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 208 place count 106 transition count 133
Iterating global reduction 2 with 1 rules applied. Total rules applied 209 place count 106 transition count 133
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 210 place count 105 transition count 132
Iterating global reduction 2 with 1 rules applied. Total rules applied 211 place count 105 transition count 132
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 105 transition count 132
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 215 place count 103 transition count 130
Applied a total of 215 rules in 36 ms. Remains 103 /221 variables (removed 118) and now considering 130/255 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 103/221 places, 130/255 transitions.
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 07:38:30] [INFO ] Input system was already deterministic with 130 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 221/221 places, 255/255 transitions.
Graph (complete) has 413 edges and 221 vertex of which 211 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
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 0 with 40 rules applied. Total rules applied 41 place count 210 transition count 204
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 170 transition count 202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 168 transition count 202
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 85 place count 168 transition count 180
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 129 place count 146 transition count 180
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 139 place count 136 transition count 169
Iterating global reduction 3 with 10 rules applied. Total rules applied 149 place count 136 transition count 169
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 155 place count 130 transition count 163
Iterating global reduction 3 with 6 rules applied. Total rules applied 161 place count 130 transition count 163
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 166 place count 125 transition count 154
Iterating global reduction 3 with 5 rules applied. Total rules applied 171 place count 125 transition count 154
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 176 place count 120 transition count 148
Iterating global reduction 3 with 5 rules applied. Total rules applied 181 place count 120 transition count 148
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 182 place count 119 transition count 147
Iterating global reduction 3 with 1 rules applied. Total rules applied 183 place count 119 transition count 147
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 225 place count 98 transition count 126
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 226 place count 97 transition count 125
Iterating global reduction 3 with 1 rules applied. Total rules applied 227 place count 97 transition count 125
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 228 place count 96 transition count 123
Iterating global reduction 3 with 1 rules applied. Total rules applied 229 place count 96 transition count 123
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 230 place count 95 transition count 122
Iterating global reduction 3 with 1 rules applied. Total rules applied 231 place count 95 transition count 122
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 233 place count 95 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 235 place count 93 transition count 120
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 137 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 87 edges and 91 vertex of which 32 / 91 are part of one of the 16 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 12 rules applied. Total rules applied 247 place count 75 transition count 110
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 272 place count 66 transition count 94
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 272 place count 66 transition count 85
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 290 place count 57 transition count 85
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 295 place count 52 transition count 75
Iterating global reduction 5 with 5 rules applied. Total rules applied 300 place count 52 transition count 75
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 305 place count 47 transition count 65
Iterating global reduction 5 with 5 rules applied. Total rules applied 310 place count 47 transition count 65
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 315 place count 42 transition count 60
Iterating global reduction 5 with 5 rules applied. Total rules applied 320 place count 42 transition count 60
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 325 place count 37 transition count 50
Iterating global reduction 5 with 5 rules applied. Total rules applied 330 place count 37 transition count 50
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 335 place count 32 transition count 45
Iterating global reduction 5 with 5 rules applied. Total rules applied 340 place count 32 transition count 45
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 344 place count 28 transition count 41
Applied a total of 344 rules in 46 ms. Remains 28 /221 variables (removed 193) and now considering 41/255 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 28/221 places, 41/255 transitions.
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 1 ms
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 1 ms
[2024-05-22 07:38:30] [INFO ] Input system was already deterministic with 41 transitions.
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:38:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 07:38:30] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-22 07:38:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 221 places, 255 transitions and 666 arcs took 2 ms.
Total runtime 27138 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DiscoveryGPU-PT-09b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/409/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 221
TRANSITIONS: 255
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


SAVING FILE /home/mcc/execution/409/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 607
MODEL NAME: /home/mcc/execution/409/model
221 places, 255 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 DiscoveryGPU-PT-09b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-09b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-09b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-09b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-09b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-09b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DiscoveryGPU-PT-09b-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
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="DiscoveryGPU-PT-09b"
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-09b, 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-171631131100418"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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