About the Execution of GreatSPN+red for CO4-PT-08
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
13660.344 | 3600000.00 | 14336491.00 | 187.10 | ???TTTTFFFFT???? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r549-tall-171734897700058.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 CO4-PT-08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r549-tall-171734897700058
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 138K Jun 2 16:33 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CO4-PT-08-CTLFireability-2024-00
FORMULA_NAME CO4-PT-08-CTLFireability-2024-01
FORMULA_NAME CO4-PT-08-CTLFireability-2024-02
FORMULA_NAME CO4-PT-08-CTLFireability-2024-03
FORMULA_NAME CO4-PT-08-CTLFireability-2024-04
FORMULA_NAME CO4-PT-08-CTLFireability-2024-05
FORMULA_NAME CO4-PT-08-CTLFireability-2024-06
FORMULA_NAME CO4-PT-08-CTLFireability-2024-07
FORMULA_NAME CO4-PT-08-CTLFireability-2024-08
FORMULA_NAME CO4-PT-08-CTLFireability-2024-09
FORMULA_NAME CO4-PT-08-CTLFireability-2024-10
FORMULA_NAME CO4-PT-08-CTLFireability-2024-11
FORMULA_NAME CO4-PT-08-CTLFireability-2024-12
FORMULA_NAME CO4-PT-08-CTLFireability-2024-13
FORMULA_NAME CO4-PT-08-CTLFireability-2024-14
FORMULA_NAME CO4-PT-08-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717351989922
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 18:13:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:13:11] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-06-02 18:13:11] [INFO ] Transformed 467 places.
[2024-06-02 18:13:11] [INFO ] Transformed 600 transitions.
[2024-06-02 18:13:11] [INFO ] Found NUPN structural information;
[2024-06-02 18:13:11] [INFO ] Parsed PT model containing 467 places and 600 transitions and 1596 arcs in 193 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Deduced a syphon composed of 108 places in 13 ms
Reduce places removed 108 places and 155 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-08-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 359 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 359/359 places, 445/445 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 346 transition count 443
Discarding 73 places :
Symmetric choice reduction at 1 with 73 rule applications. Total rules 88 place count 273 transition count 369
Iterating global reduction 1 with 73 rules applied. Total rules applied 161 place count 273 transition count 369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 164 place count 273 transition count 366
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 194 place count 243 transition count 328
Iterating global reduction 2 with 30 rules applied. Total rules applied 224 place count 243 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 228 place count 239 transition count 321
Iterating global reduction 2 with 4 rules applied. Total rules applied 232 place count 239 transition count 321
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 235 place count 236 transition count 318
Iterating global reduction 2 with 3 rules applied. Total rules applied 238 place count 236 transition count 318
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 240 place count 234 transition count 316
Iterating global reduction 2 with 2 rules applied. Total rules applied 242 place count 234 transition count 316
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 244 place count 234 transition count 314
Applied a total of 244 rules in 89 ms. Remains 234 /359 variables (removed 125) and now considering 314/445 (removed 131) transitions.
// Phase 1: matrix 314 rows 234 cols
[2024-06-02 18:13:11] [INFO ] Computed 6 invariants in 21 ms
[2024-06-02 18:13:11] [INFO ] Implicit Places using invariants in 242 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 275 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/359 places, 314/445 transitions.
Applied a total of 0 rules in 4 ms. Remains 233 /233 variables (removed 0) and now considering 314/314 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 386 ms. Remains : 233/359 places, 314/445 transitions.
Support contains 48 out of 233 places after structural reductions.
[2024-06-02 18:13:11] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-06-02 18:13:12] [INFO ] Flatten gal took : 53 ms
FORMULA CO4-PT-08-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:13:12] [INFO ] Flatten gal took : 21 ms
[2024-06-02 18:13:12] [INFO ] Input system was already deterministic with 314 transitions.
Support contains 40 out of 233 places (down from 48) after GAL structural reductions.
RANDOM walk for 40000 steps (238 resets) in 2258 ms. (17 steps per ms) remains 20/26 properties
BEST_FIRST walk for 4003 steps (32 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (32 resets) in 30 ms. (129 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (28 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (33 resets) in 33 ms. (117 steps per ms) remains 18/19 properties
BEST_FIRST walk for 4003 steps (31 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (27 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (24 resets) in 31 ms. (125 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (28 resets) in 19 ms. (200 steps per ms) remains 15/18 properties
BEST_FIRST walk for 4004 steps (20 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (30 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (26 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 16 ms. (235 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4003 steps (29 resets) in 8 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4001 steps (23 resets) in 24 ms. (160 steps per ms) remains 14/14 properties
// Phase 1: matrix 314 rows 233 cols
[2024-06-02 18:13:13] [INFO ] Computed 5 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 17/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 11/51 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 124/175 variables, 51/56 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/175 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 207/382 variables, 86/142 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/382 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 134/516 variables, 74/216 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/516 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 26/542 variables, 19/235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/542 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
At refinement iteration 13 (OVERLAPS) 5/547 variables, 3/238 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/238 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 15 (OVERLAPS) 0/547 variables, 0/238 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 238 constraints, problems are : Problem set: 3 solved, 11 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 20/36 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 11/47 variables, 2/5 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 116/163 variables, 47/52 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 2/54 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-06-02 18:13:14] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 12 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 1/55 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/55 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 206/369 variables, 83/138 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 9/147 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 0/147 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 143/512 variables, 79/226 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 14 (OVERLAPS) 29/541 variables, 20/246 constraints. Problems are: Problem set: 3 solved, 11 unsolved
[2024-06-02 18:13:15] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/541 variables, 1/247 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/541 variables, 0/247 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 17 (OVERLAPS) 6/547 variables, 4/251 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/547 variables, 0/251 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 19 (OVERLAPS) 0/547 variables, 0/251 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 547/547 variables, and 251 constraints, problems are : Problem set: 3 solved, 11 unsolved in 1938 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 2/2 constraints]
After SMT, in 3148ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Finished Parikh walk after 506 steps, including 9 resets, run visited all 1 properties in 2 ms. (steps per millisecond=253 )
Parikh walk visited 11 properties in 1169 ms.
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA CO4-PT-08-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-08-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 18 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 314 transitions.
Computed a total of 16 stabilizing places and 32 stable transitions
Graph (complete) has 456 edges and 233 vertex of which 229 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 314/314 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 214 transition count 284
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 214 transition count 284
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 214 transition count 280
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 206 transition count 271
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 206 transition count 271
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 62 place count 202 transition count 265
Iterating global reduction 1 with 4 rules applied. Total rules applied 66 place count 202 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 67 place count 202 transition count 264
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 69 place count 200 transition count 262
Iterating global reduction 2 with 2 rules applied. Total rules applied 71 place count 200 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 72 place count 199 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 73 place count 199 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 199 transition count 260
Applied a total of 74 rules in 17 ms. Remains 199 /233 variables (removed 34) and now considering 260/314 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 199/233 places, 260/314 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 314/314 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 216 transition count 289
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 216 transition count 289
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 216 transition count 286
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 209 transition count 277
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 209 transition count 277
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 206 transition count 273
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 206 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 58 place count 206 transition count 272
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 205 transition count 271
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 205 transition count 271
Applied a total of 60 rules in 23 ms. Remains 205 /233 variables (removed 28) and now considering 271/314 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 205/233 places, 271/314 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 271 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 314/314 transitions.
Graph (trivial) has 238 edges and 233 vertex of which 2 / 233 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 455 edges and 232 vertex of which 228 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 84 place count 227 transition count 225
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 85 rules applied. Total rules applied 169 place count 145 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 144 transition count 222
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 170 place count 144 transition count 206
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 202 place count 128 transition count 206
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 214 place count 116 transition count 182
Iterating global reduction 3 with 12 rules applied. Total rules applied 226 place count 116 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 229 place count 116 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 229 place count 116 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 233 place count 114 transition count 177
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 237 place count 110 transition count 172
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 110 transition count 172
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 269 place count 96 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 272 place count 96 transition count 154
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 273 place count 95 transition count 153
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 95 transition count 153
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 5 with 4 rules applied. Total rules applied 278 place count 93 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 284 place count 93 transition count 145
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 290 place count 91 transition count 141
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 5 rules applied. Total rules applied 295 place count 89 transition count 138
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 297 place count 88 transition count 137
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 9 with 4 rules applied. Total rules applied 301 place count 86 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 306 place count 86 transition count 130
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 9 with 1 rules applied. Total rules applied 307 place count 86 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 308 place count 85 transition count 129
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 11 with 2 rules applied. Total rules applied 310 place count 84 transition count 128
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 312 place count 82 transition count 126
Applied a total of 312 rules in 69 ms. Remains 82 /233 variables (removed 151) and now considering 126/314 (removed 188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 82/233 places, 126/314 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 5 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 126 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 314/314 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 215 transition count 285
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 215 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 215 transition count 282
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 208 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 208 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 205 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 205 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 205 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 204 transition count 268
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 204 transition count 268
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 203 transition count 267
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 203 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 203 transition count 266
Applied a total of 65 rules in 22 ms. Remains 203 /233 variables (removed 30) and now considering 266/314 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 203/233 places, 266/314 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 266 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 314/314 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 213 transition count 283
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 213 transition count 283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 213 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 205 transition count 270
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 205 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 201 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 201 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 201 transition count 263
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 199 transition count 261
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 199 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 198 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 198 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 198 transition count 259
Applied a total of 76 rules in 28 ms. Remains 198 /233 variables (removed 35) and now considering 259/314 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 198/233 places, 259/314 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 259 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 314/314 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 214 transition count 285
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 214 transition count 285
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 214 transition count 281
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 207 transition count 273
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 207 transition count 273
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 204 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 204 transition count 268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 64 place count 202 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 66 place count 202 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 201 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 201 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 201 transition count 264
Applied a total of 69 rules in 20 ms. Remains 201 /233 variables (removed 32) and now considering 264/314 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 201/233 places, 264/314 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 233/233 places, 314/314 transitions.
Graph (trivial) has 238 edges and 233 vertex of which 2 / 233 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 455 edges and 232 vertex of which 228 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 83 place count 227 transition count 226
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 84 rules applied. Total rules applied 167 place count 146 transition count 223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 145 transition count 223
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 168 place count 145 transition count 206
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 202 place count 128 transition count 206
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 214 place count 116 transition count 182
Iterating global reduction 3 with 12 rules applied. Total rules applied 226 place count 116 transition count 182
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 229 place count 116 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 229 place count 116 transition count 177
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 233 place count 114 transition count 177
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 237 place count 110 transition count 172
Iterating global reduction 4 with 4 rules applied. Total rules applied 241 place count 110 transition count 172
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 269 place count 96 transition count 157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 272 place count 96 transition count 154
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 273 place count 95 transition count 153
Iterating global reduction 5 with 1 rules applied. Total rules applied 274 place count 95 transition count 153
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 5 with 4 rules applied. Total rules applied 278 place count 93 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 283 place count 93 transition count 146
Reduce places removed 1 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 6 with 3 rules applied. Total rules applied 286 place count 92 transition count 144
Reduce places removed 1 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 7 with 3 rules applied. Total rules applied 289 place count 91 transition count 142
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 292 place count 90 transition count 140
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 294 place count 89 transition count 139
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 10 with 2 rules applied. Total rules applied 296 place count 88 transition count 138
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 301 place count 88 transition count 133
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 10 with 1 rules applied. Total rules applied 302 place count 88 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 303 place count 87 transition count 132
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 305 place count 86 transition count 131
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 307 place count 84 transition count 129
Applied a total of 307 rules in 53 ms. Remains 84 /233 variables (removed 149) and now considering 129/314 (removed 185) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 84/233 places, 129/314 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 4 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 314/314 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 215 transition count 285
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 215 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 215 transition count 282
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 208 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 208 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 205 transition count 269
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 205 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 205 transition count 268
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 62 place count 203 transition count 266
Iterating global reduction 2 with 2 rules applied. Total rules applied 64 place count 203 transition count 266
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 202 transition count 265
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 202 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 202 transition count 264
Applied a total of 67 rules in 20 ms. Remains 202 /233 variables (removed 31) and now considering 264/314 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 202/233 places, 264/314 transitions.
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:13:17] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:13:17] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 314/314 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 213 transition count 283
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 213 transition count 283
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 213 transition count 279
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 205 transition count 270
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 205 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 64 place count 201 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 68 place count 201 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 201 transition count 263
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 199 transition count 261
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 199 transition count 261
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 198 transition count 260
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 198 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 76 place count 198 transition count 259
Applied a total of 76 rules in 22 ms. Remains 198 /233 variables (removed 35) and now considering 259/314 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 198/233 places, 259/314 transitions.
[2024-06-02 18:13:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:13:18] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:13:18] [INFO ] Input system was already deterministic with 259 transitions.
[2024-06-02 18:13:18] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:13:18] [INFO ] Flatten gal took : 27 ms
[2024-06-02 18:13:18] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-02 18:13:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 314 transitions and 809 arcs took 6 ms.
Total runtime 7040 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CO4-PT-08
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 233
TRANSITIONS: 314
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]
SAVING FILE /home/mcc/execution/407/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: 532
MODEL NAME: /home/mcc/execution/407/model
233 places, 314 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 CO4-PT-08-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CO4-PT-08-CTLFireability-2024-11 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 4194304 at unique_table.cc, line 313
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="CO4-PT-08"
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 CO4-PT-08, 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 r549-tall-171734897700058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-08.tgz
mv CO4-PT-08 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 '
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 ;