About the Execution of Marcie+red for HealthRecord-PT-16
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10130.327 | 3600000.00 | 3663632.00 | 10257.20 | ??FT?FF???F?FTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r202-smll-167840348600354.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is HealthRecord-PT-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348600354
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.5K Feb 26 18:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 18:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 18:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 26 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 18:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 125K Mar 5 18:22 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 HealthRecord-PT-16-CTLFireability-00
FORMULA_NAME HealthRecord-PT-16-CTLFireability-01
FORMULA_NAME HealthRecord-PT-16-CTLFireability-02
FORMULA_NAME HealthRecord-PT-16-CTLFireability-03
FORMULA_NAME HealthRecord-PT-16-CTLFireability-04
FORMULA_NAME HealthRecord-PT-16-CTLFireability-05
FORMULA_NAME HealthRecord-PT-16-CTLFireability-06
FORMULA_NAME HealthRecord-PT-16-CTLFireability-07
FORMULA_NAME HealthRecord-PT-16-CTLFireability-08
FORMULA_NAME HealthRecord-PT-16-CTLFireability-09
FORMULA_NAME HealthRecord-PT-16-CTLFireability-10
FORMULA_NAME HealthRecord-PT-16-CTLFireability-11
FORMULA_NAME HealthRecord-PT-16-CTLFireability-12
FORMULA_NAME HealthRecord-PT-16-CTLFireability-13
FORMULA_NAME HealthRecord-PT-16-CTLFireability-14
FORMULA_NAME HealthRecord-PT-16-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678721723882
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 15:35:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 15:35:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 15:35:26] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-13 15:35:26] [INFO ] Transformed 453 places.
[2023-03-13 15:35:26] [INFO ] Transformed 594 transitions.
[2023-03-13 15:35:26] [INFO ] Found NUPN structural information;
[2023-03-13 15:35:26] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 253 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 91 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 383 transition count 515
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 383 transition count 515
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 165 place count 358 transition count 483
Iterating global reduction 0 with 25 rules applied. Total rules applied 190 place count 358 transition count 483
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 192 place count 358 transition count 481
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 204 place count 346 transition count 459
Iterating global reduction 1 with 12 rules applied. Total rules applied 216 place count 346 transition count 459
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 220 place count 342 transition count 452
Iterating global reduction 1 with 4 rules applied. Total rules applied 224 place count 342 transition count 452
Applied a total of 224 rules in 135 ms. Remains 342 /453 variables (removed 111) and now considering 452/594 (removed 142) transitions.
// Phase 1: matrix 452 rows 342 cols
[2023-03-13 15:35:27] [INFO ] Computed 14 place invariants in 43 ms
[2023-03-13 15:35:27] [INFO ] Implicit Places using invariants in 636 ms returned []
[2023-03-13 15:35:27] [INFO ] Invariant cache hit.
[2023-03-13 15:35:28] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
[2023-03-13 15:35:28] [INFO ] Invariant cache hit.
[2023-03-13 15:35:28] [INFO ] Dead Transitions using invariants and state equation in 471 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 342/453 places, 452/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1877 ms. Remains : 342/453 places, 452/594 transitions.
Support contains 91 out of 342 places after structural reductions.
[2023-03-13 15:35:29] [INFO ] Flatten gal took : 116 ms
[2023-03-13 15:35:29] [INFO ] Flatten gal took : 51 ms
[2023-03-13 15:35:29] [INFO ] Input system was already deterministic with 452 transitions.
Support contains 88 out of 342 places (down from 91) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 962 ms. (steps per millisecond=10 ) properties (out of 63) seen :28
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2023-03-13 15:35:30] [INFO ] Invariant cache hit.
[2023-03-13 15:35:31] [INFO ] [Real]Absence check using 8 positive place invariants in 17 ms returned sat
[2023-03-13 15:35:31] [INFO ] [Real]Absence check using 8 positive and 6 generalized place invariants in 10 ms returned sat
[2023-03-13 15:35:31] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-13 15:35:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2023-03-13 15:35:31] [INFO ] [Nat]Absence check using 8 positive and 6 generalized place invariants in 8 ms returned sat
[2023-03-13 15:35:33] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :30
[2023-03-13 15:35:33] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 9 ms to minimize.
[2023-03-13 15:35:33] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 2 ms to minimize.
[2023-03-13 15:35:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 497 ms
[2023-03-13 15:35:33] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 2 ms to minimize.
[2023-03-13 15:35:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2023-03-13 15:35:34] [INFO ] Deduced a trap composed of 70 places in 105 ms of which 2 ms to minimize.
[2023-03-13 15:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2023-03-13 15:35:34] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 1 ms to minimize.
[2023-03-13 15:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 182 ms
[2023-03-13 15:35:34] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 1 ms to minimize.
[2023-03-13 15:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-13 15:35:34] [INFO ] Deduced a trap composed of 72 places in 117 ms of which 0 ms to minimize.
[2023-03-13 15:35:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 168 ms
[2023-03-13 15:35:35] [INFO ] Deduced a trap composed of 57 places in 183 ms of which 1 ms to minimize.
[2023-03-13 15:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2023-03-13 15:35:35] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 2 ms to minimize.
[2023-03-13 15:35:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 281 ms
[2023-03-13 15:35:36] [INFO ] After 3989ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :30
Attempting to minimize the solution found.
Minimization took 707 ms.
[2023-03-13 15:35:36] [INFO ] After 5333ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :30
Fused 34 Parikh solutions to 30 different solutions.
Parikh walk visited 21 properties in 398 ms.
Support contains 16 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 452/452 transitions.
Graph (trivial) has 361 edges and 342 vertex of which 44 / 342 are part of one of the 16 SCC in 10 ms
Free SCC test removed 28 places
Drop transitions removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Graph (complete) has 623 edges and 314 vertex of which 305 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 305 transition count 281
Reduce places removed 123 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 144 rules applied. Total rules applied 269 place count 182 transition count 260
Reduce places removed 10 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 18 rules applied. Total rules applied 287 place count 172 transition count 252
Reduce places removed 8 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 3 with 11 rules applied. Total rules applied 298 place count 164 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 299 place count 163 transition count 249
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 299 place count 163 transition count 241
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 315 place count 155 transition count 241
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 334 place count 136 transition count 204
Iterating global reduction 5 with 19 rules applied. Total rules applied 353 place count 136 transition count 204
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 356 place count 136 transition count 201
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 359 place count 133 transition count 201
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 365 place count 127 transition count 190
Iterating global reduction 7 with 6 rules applied. Total rules applied 371 place count 127 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 372 place count 127 transition count 189
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 373 place count 126 transition count 188
Iterating global reduction 8 with 1 rules applied. Total rules applied 374 place count 126 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 375 place count 126 transition count 187
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 9 with 70 rules applied. Total rules applied 445 place count 91 transition count 151
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 450 place count 91 transition count 146
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 453 place count 88 transition count 140
Iterating global reduction 10 with 3 rules applied. Total rules applied 456 place count 88 transition count 140
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 457 place count 87 transition count 138
Iterating global reduction 10 with 1 rules applied. Total rules applied 458 place count 87 transition count 138
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 459 place count 86 transition count 137
Iterating global reduction 10 with 1 rules applied. Total rules applied 460 place count 86 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 461 place count 86 transition count 136
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 11 with 16 rules applied. Total rules applied 477 place count 78 transition count 195
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 479 place count 76 transition count 191
Iterating global reduction 11 with 2 rules applied. Total rules applied 481 place count 76 transition count 191
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 482 place count 76 transition count 190
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 483 place count 75 transition count 189
Iterating global reduction 11 with 1 rules applied. Total rules applied 484 place count 75 transition count 189
Free-agglomeration rule applied 12 times.
Iterating global reduction 11 with 12 rules applied. Total rules applied 496 place count 75 transition count 177
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 11 with 12 rules applied. Total rules applied 508 place count 63 transition count 177
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 509 place count 63 transition count 176
Partial Free-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 12 with 12 rules applied. Total rules applied 521 place count 63 transition count 176
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 12 with 11 rules applied. Total rules applied 532 place count 63 transition count 176
Applied a total of 532 rules in 143 ms. Remains 63 /342 variables (removed 279) and now considering 176/452 (removed 276) transitions.
[2023-03-13 15:35:37] [INFO ] Flow matrix only has 168 transitions (discarded 8 similar events)
// Phase 1: matrix 168 rows 63 cols
[2023-03-13 15:35:37] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-13 15:35:37] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 276 ms. Remains : 63/342 places, 176/452 transitions.
Incomplete random walk after 10000 steps, including 817 resets, run finished after 206 ms. (steps per millisecond=48 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 123 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 134 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 15:35:37] [INFO ] Flow matrix only has 168 transitions (discarded 8 similar events)
[2023-03-13 15:35:37] [INFO ] Invariant cache hit.
[2023-03-13 15:35:37] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-13 15:35:37] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 15:35:37] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-13 15:35:38] [INFO ] After 102ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-13 15:35:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-13 15:35:38] [INFO ] After 63ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-13 15:35:38] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-13 15:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2023-03-13 15:35:38] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
[2023-03-13 15:35:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-13 15:35:38] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-13 15:35:38] [INFO ] After 531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 26 ms.
Support contains 14 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 176/176 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 63 transition count 175
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 62 transition count 175
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 62 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 61 transition count 174
Applied a total of 4 rules in 33 ms. Remains 61 /63 variables (removed 2) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 61/63 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 894 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 131 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 145 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 127 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-13 15:35:39] [INFO ] Flow matrix only has 166 transitions (discarded 8 similar events)
// Phase 1: matrix 166 rows 61 cols
[2023-03-13 15:35:39] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-13 15:35:39] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 15:35:39] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-13 15:35:39] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-13 15:35:39] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-13 15:35:39] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-13 15:35:39] [INFO ] After 68ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-13 15:35:39] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2023-03-13 15:35:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-13 15:35:39] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-13 15:35:39] [INFO ] After 558ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 29 ms.
Support contains 13 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 174/174 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 173
Applied a total of 2 rules in 14 ms. Remains 60 /61 variables (removed 1) and now considering 173/174 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 60/61 places, 173/174 transitions.
Incomplete random walk after 10000 steps, including 888 resets, run finished after 316 ms. (steps per millisecond=31 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 129 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Finished probabilistic random walk after 298693 steps, run visited all 7 properties in 637 ms. (steps per millisecond=468 )
Probabilistic random walk after 298693 steps, saw 53238 distinct states, run finished after 637 ms. (steps per millisecond=468 ) properties seen :7
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA HealthRecord-PT-16-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 26 ms
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 27 ms
[2023-03-13 15:35:41] [INFO ] Input system was already deterministic with 452 transitions.
Support contains 72 out of 342 places (down from 74) after GAL structural reductions.
Computed a total of 96 stabilizing places and 106 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 317 transition count 416
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 317 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 317 transition count 415
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 304 transition count 392
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 304 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 79 place count 304 transition count 390
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 85 place count 298 transition count 380
Iterating global reduction 2 with 6 rules applied. Total rules applied 91 place count 298 transition count 380
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 295 transition count 376
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 295 transition count 376
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 292 transition count 371
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 292 transition count 371
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 289 transition count 367
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 289 transition count 367
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 287 transition count 364
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 287 transition count 364
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 115 place count 287 transition count 362
Applied a total of 115 rules in 75 ms. Remains 287 /342 variables (removed 55) and now considering 362/452 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 287/342 places, 362/452 transitions.
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 18 ms
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 19 ms
[2023-03-13 15:35:41] [INFO ] Input system was already deterministic with 362 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 318 transition count 416
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 318 transition count 416
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 61 place count 305 transition count 393
Iterating global reduction 0 with 13 rules applied. Total rules applied 74 place count 305 transition count 393
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 76 place count 305 transition count 391
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 299 transition count 381
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 299 transition count 381
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 90 place count 297 transition count 379
Iterating global reduction 1 with 2 rules applied. Total rules applied 92 place count 297 transition count 379
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 93 place count 296 transition count 377
Iterating global reduction 1 with 1 rules applied. Total rules applied 94 place count 296 transition count 377
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 95 place count 295 transition count 375
Iterating global reduction 1 with 1 rules applied. Total rules applied 96 place count 295 transition count 375
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 294 transition count 373
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 294 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 294 transition count 372
Applied a total of 99 rules in 79 ms. Remains 294 /342 variables (removed 48) and now considering 372/452 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 294/342 places, 372/452 transitions.
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 17 ms
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 17 ms
[2023-03-13 15:35:41] [INFO ] Input system was already deterministic with 372 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Graph (trivial) has 391 edges and 342 vertex of which 46 / 342 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 312 transition count 289
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 149 rules applied. Total rules applied 280 place count 182 transition count 270
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 293 place count 173 transition count 266
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 299 place count 169 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 300 place count 168 transition count 264
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 300 place count 168 transition count 257
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 314 place count 161 transition count 257
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 347 place count 128 transition count 197
Iterating global reduction 5 with 33 rules applied. Total rules applied 380 place count 128 transition count 197
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 5 with 5 rules applied. Total rules applied 385 place count 128 transition count 192
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 390 place count 123 transition count 192
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 399 place count 114 transition count 175
Iterating global reduction 7 with 9 rules applied. Total rules applied 408 place count 114 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 410 place count 114 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 411 place count 113 transition count 173
Discarding 4 places :
Symmetric choice reduction at 9 with 4 rule applications. Total rules 415 place count 109 transition count 167
Iterating global reduction 9 with 4 rules applied. Total rules applied 419 place count 109 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 420 place count 109 transition count 166
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 421 place count 108 transition count 165
Iterating global reduction 10 with 1 rules applied. Total rules applied 422 place count 108 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 423 place count 108 transition count 164
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 443 place count 98 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 445 place count 98 transition count 152
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 449 place count 94 transition count 144
Iterating global reduction 12 with 4 rules applied. Total rules applied 453 place count 94 transition count 144
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 457 place count 90 transition count 139
Iterating global reduction 12 with 4 rules applied. Total rules applied 461 place count 90 transition count 139
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 464 place count 87 transition count 134
Iterating global reduction 12 with 3 rules applied. Total rules applied 467 place count 87 transition count 134
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 470 place count 84 transition count 128
Iterating global reduction 12 with 3 rules applied. Total rules applied 473 place count 84 transition count 128
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 476 place count 81 transition count 122
Iterating global reduction 12 with 3 rules applied. Total rules applied 479 place count 81 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 481 place count 81 transition count 120
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 482 place count 80 transition count 118
Iterating global reduction 13 with 1 rules applied. Total rules applied 483 place count 80 transition count 118
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 486 place count 80 transition count 115
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 1 rules applied. Total rules applied 487 place count 80 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 488 place count 79 transition count 114
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 489 place count 78 transition count 112
Iterating global reduction 15 with 1 rules applied. Total rules applied 490 place count 78 transition count 112
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 491 place count 77 transition count 110
Iterating global reduction 15 with 1 rules applied. Total rules applied 492 place count 77 transition count 110
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 493 place count 76 transition count 109
Iterating global reduction 15 with 1 rules applied. Total rules applied 494 place count 76 transition count 109
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 15 with 4 rules applied. Total rules applied 498 place count 74 transition count 107
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 499 place count 73 transition count 106
Iterating global reduction 15 with 1 rules applied. Total rules applied 500 place count 73 transition count 106
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 502 place count 73 transition count 104
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 15 with 1 rules applied. Total rules applied 503 place count 73 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 504 place count 72 transition count 103
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 17 with 1 rules applied. Total rules applied 505 place count 71 transition count 102
Applied a total of 505 rules in 106 ms. Remains 71 /342 variables (removed 271) and now considering 102/452 (removed 350) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 106 ms. Remains : 71/342 places, 102/452 transitions.
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 6 ms
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 6 ms
[2023-03-13 15:35:41] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Graph (trivial) has 389 edges and 342 vertex of which 46 / 342 are part of one of the 17 SCC in 0 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 312 transition count 288
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 152 rules applied. Total rules applied 284 place count 181 transition count 267
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 295 place count 171 transition count 266
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 296 place count 170 transition count 266
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 296 place count 170 transition count 259
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 310 place count 163 transition count 259
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 344 place count 129 transition count 199
Iterating global reduction 4 with 34 rules applied. Total rules applied 378 place count 129 transition count 199
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 383 place count 129 transition count 194
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 388 place count 124 transition count 194
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 398 place count 114 transition count 175
Iterating global reduction 6 with 10 rules applied. Total rules applied 408 place count 114 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 410 place count 114 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 411 place count 113 transition count 173
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 416 place count 108 transition count 165
Iterating global reduction 8 with 5 rules applied. Total rules applied 421 place count 108 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 422 place count 108 transition count 164
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 424 place count 106 transition count 162
Iterating global reduction 9 with 2 rules applied. Total rules applied 426 place count 106 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 427 place count 106 transition count 161
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 428 place count 105 transition count 159
Iterating global reduction 10 with 1 rules applied. Total rules applied 429 place count 105 transition count 159
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 430 place count 104 transition count 157
Iterating global reduction 10 with 1 rules applied. Total rules applied 431 place count 104 transition count 157
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 432 place count 103 transition count 155
Iterating global reduction 10 with 1 rules applied. Total rules applied 433 place count 103 transition count 155
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 455 place count 92 transition count 144
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 457 place count 92 transition count 142
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 460 place count 89 transition count 136
Iterating global reduction 11 with 3 rules applied. Total rules applied 463 place count 89 transition count 136
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 466 place count 86 transition count 133
Iterating global reduction 11 with 3 rules applied. Total rules applied 469 place count 86 transition count 133
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 471 place count 84 transition count 129
Iterating global reduction 11 with 2 rules applied. Total rules applied 473 place count 84 transition count 129
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 475 place count 82 transition count 125
Iterating global reduction 11 with 2 rules applied. Total rules applied 477 place count 82 transition count 125
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 479 place count 80 transition count 121
Iterating global reduction 11 with 2 rules applied. Total rules applied 481 place count 80 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 483 place count 80 transition count 119
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 485 place count 80 transition count 117
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 12 with 4 rules applied. Total rules applied 489 place count 78 transition count 115
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 490 place count 77 transition count 114
Iterating global reduction 12 with 1 rules applied. Total rules applied 491 place count 77 transition count 114
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 492 place count 77 transition count 113
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 493 place count 77 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 494 place count 76 transition count 112
Partial Post-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 14 with 5 rules applied. Total rules applied 499 place count 76 transition count 112
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 500 place count 75 transition count 111
Iterating global reduction 14 with 1 rules applied. Total rules applied 501 place count 75 transition count 111
Applied a total of 501 rules in 72 ms. Remains 75 /342 variables (removed 267) and now considering 111/452 (removed 341) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 75/342 places, 111/452 transitions.
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 5 ms
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 6 ms
[2023-03-13 15:35:41] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 315 transition count 413
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 315 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 315 transition count 412
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 69 place count 301 transition count 387
Iterating global reduction 1 with 14 rules applied. Total rules applied 83 place count 301 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 301 transition count 385
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 294 transition count 374
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 294 transition count 374
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 292 transition count 371
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 292 transition count 371
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 290 transition count 368
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 290 transition count 368
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 288 transition count 366
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 288 transition count 366
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 112 place count 287 transition count 365
Iterating global reduction 2 with 1 rules applied. Total rules applied 113 place count 287 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 287 transition count 364
Applied a total of 114 rules in 64 ms. Remains 287 /342 variables (removed 55) and now considering 364/452 (removed 88) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 287/342 places, 364/452 transitions.
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 15 ms
[2023-03-13 15:35:41] [INFO ] Flatten gal took : 16 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 364 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 319 transition count 420
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 319 transition count 420
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 319 transition count 419
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 56 place count 310 transition count 404
Iterating global reduction 1 with 9 rules applied. Total rules applied 65 place count 310 transition count 404
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 310 transition count 402
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 306 transition count 395
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 306 transition count 395
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 305 transition count 394
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 305 transition count 394
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 78 place count 304 transition count 392
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 304 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 80 place count 303 transition count 391
Iterating global reduction 2 with 1 rules applied. Total rules applied 81 place count 303 transition count 391
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 302 transition count 390
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 302 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 302 transition count 389
Applied a total of 84 rules in 68 ms. Remains 302 /342 variables (removed 40) and now considering 389/452 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 302/342 places, 389/452 transitions.
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 15 ms
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 16 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 389 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 315 transition count 413
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 315 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 315 transition count 412
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 69 place count 301 transition count 387
Iterating global reduction 1 with 14 rules applied. Total rules applied 83 place count 301 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 85 place count 301 transition count 385
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 294 transition count 374
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 294 transition count 374
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 102 place count 291 transition count 370
Iterating global reduction 2 with 3 rules applied. Total rules applied 105 place count 291 transition count 370
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 108 place count 288 transition count 365
Iterating global reduction 2 with 3 rules applied. Total rules applied 111 place count 288 transition count 365
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 114 place count 285 transition count 361
Iterating global reduction 2 with 3 rules applied. Total rules applied 117 place count 285 transition count 361
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 119 place count 283 transition count 358
Iterating global reduction 2 with 2 rules applied. Total rules applied 121 place count 283 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 123 place count 283 transition count 356
Applied a total of 123 rules in 58 ms. Remains 283 /342 variables (removed 59) and now considering 356/452 (removed 96) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 283/342 places, 356/452 transitions.
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 12 ms
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 13 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 319 transition count 419
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 319 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 319 transition count 418
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 59 place count 307 transition count 396
Iterating global reduction 1 with 12 rules applied. Total rules applied 71 place count 307 transition count 396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 307 transition count 394
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 78 place count 302 transition count 387
Iterating global reduction 2 with 5 rules applied. Total rules applied 83 place count 302 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 301 transition count 385
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 301 transition count 385
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 300 transition count 384
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 300 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 299 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 299 transition count 383
Applied a total of 89 rules in 46 ms. Remains 299 /342 variables (removed 43) and now considering 383/452 (removed 69) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 299/342 places, 383/452 transitions.
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 13 ms
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 14 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 316 transition count 415
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 316 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 316 transition count 414
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 67 place count 302 transition count 389
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 302 transition count 389
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 302 transition count 387
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 295 transition count 376
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 295 transition count 376
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 292 transition count 372
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 292 transition count 372
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 106 place count 289 transition count 367
Iterating global reduction 2 with 3 rules applied. Total rules applied 109 place count 289 transition count 367
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 286 transition count 363
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 286 transition count 363
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 117 place count 284 transition count 360
Iterating global reduction 2 with 2 rules applied. Total rules applied 119 place count 284 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 284 transition count 358
Applied a total of 121 rules in 49 ms. Remains 284 /342 variables (removed 58) and now considering 358/452 (removed 94) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 284/342 places, 358/452 transitions.
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 12 ms
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 13 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 358 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Graph (trivial) has 375 edges and 342 vertex of which 41 / 342 are part of one of the 16 SCC in 0 ms
Free SCC test removed 25 places
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 127 place count 316 transition count 298
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 142 rules applied. Total rules applied 269 place count 190 transition count 282
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 279 place count 182 transition count 280
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 281 place count 180 transition count 280
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 281 place count 180 transition count 273
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 295 place count 173 transition count 273
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 324 place count 144 transition count 221
Iterating global reduction 4 with 29 rules applied. Total rules applied 353 place count 144 transition count 221
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 4 rules applied. Total rules applied 357 place count 144 transition count 217
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 361 place count 140 transition count 217
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 368 place count 133 transition count 204
Iterating global reduction 6 with 7 rules applied. Total rules applied 375 place count 133 transition count 204
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 378 place count 130 transition count 200
Iterating global reduction 6 with 3 rules applied. Total rules applied 381 place count 130 transition count 200
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 382 place count 130 transition count 199
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 408 place count 117 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 410 place count 117 transition count 184
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 415 place count 112 transition count 174
Iterating global reduction 8 with 5 rules applied. Total rules applied 420 place count 112 transition count 174
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 423 place count 109 transition count 170
Iterating global reduction 8 with 3 rules applied. Total rules applied 426 place count 109 transition count 170
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 427 place count 108 transition count 168
Iterating global reduction 8 with 1 rules applied. Total rules applied 428 place count 108 transition count 168
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 429 place count 107 transition count 166
Iterating global reduction 8 with 1 rules applied. Total rules applied 430 place count 107 transition count 166
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 431 place count 106 transition count 164
Iterating global reduction 8 with 1 rules applied. Total rules applied 432 place count 106 transition count 164
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 433 place count 106 transition count 163
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 437 place count 106 transition count 159
Drop transitions 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 438 place count 106 transition count 158
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 2 rules applied. Total rules applied 440 place count 105 transition count 157
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 441 place count 104 transition count 157
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 442 place count 103 transition count 155
Iterating global reduction 12 with 1 rules applied. Total rules applied 443 place count 103 transition count 155
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 444 place count 102 transition count 153
Iterating global reduction 12 with 1 rules applied. Total rules applied 445 place count 102 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 12 with 4 rules applied. Total rules applied 449 place count 100 transition count 151
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 450 place count 99 transition count 150
Iterating global reduction 12 with 1 rules applied. Total rules applied 451 place count 99 transition count 150
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 452 place count 99 transition count 149
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 452 place count 99 transition count 148
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 454 place count 98 transition count 148
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 456 place count 98 transition count 148
Applied a total of 456 rules in 62 ms. Remains 98 /342 variables (removed 244) and now considering 148/452 (removed 304) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 63 ms. Remains : 98/342 places, 148/452 transitions.
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 6 ms
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 6 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Graph (trivial) has 383 edges and 342 vertex of which 42 / 342 are part of one of the 15 SCC in 1 ms
Free SCC test removed 27 places
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 130 transitions
Trivial Post-agglo rules discarded 130 transitions
Performed 130 trivial Post agglomeration. Transition count delta: 130
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 314 transition count 291
Reduce places removed 130 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 151 rules applied. Total rules applied 282 place count 184 transition count 270
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 293 place count 174 transition count 269
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 294 place count 173 transition count 269
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 294 place count 173 transition count 262
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 308 place count 166 transition count 262
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 341 place count 133 transition count 204
Iterating global reduction 4 with 33 rules applied. Total rules applied 374 place count 133 transition count 204
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 379 place count 133 transition count 199
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 384 place count 128 transition count 199
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 393 place count 119 transition count 182
Iterating global reduction 6 with 9 rules applied. Total rules applied 402 place count 119 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 404 place count 119 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 405 place count 118 transition count 180
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 410 place count 113 transition count 172
Iterating global reduction 8 with 5 rules applied. Total rules applied 415 place count 113 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 416 place count 113 transition count 171
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 417 place count 112 transition count 170
Iterating global reduction 9 with 1 rules applied. Total rules applied 418 place count 112 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 419 place count 112 transition count 169
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 10 with 22 rules applied. Total rules applied 441 place count 101 transition count 158
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 443 place count 101 transition count 156
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 446 place count 98 transition count 150
Iterating global reduction 11 with 3 rules applied. Total rules applied 449 place count 98 transition count 150
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 452 place count 95 transition count 147
Iterating global reduction 11 with 3 rules applied. Total rules applied 455 place count 95 transition count 147
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 457 place count 93 transition count 143
Iterating global reduction 11 with 2 rules applied. Total rules applied 459 place count 93 transition count 143
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 461 place count 91 transition count 139
Iterating global reduction 11 with 2 rules applied. Total rules applied 463 place count 91 transition count 139
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 465 place count 89 transition count 135
Iterating global reduction 11 with 2 rules applied. Total rules applied 467 place count 89 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 468 place count 89 transition count 134
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 469 place count 89 transition count 133
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 12 with 2 rules applied. Total rules applied 471 place count 88 transition count 132
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 472 place count 87 transition count 131
Iterating global reduction 12 with 1 rules applied. Total rules applied 473 place count 87 transition count 131
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 474 place count 87 transition count 130
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 475 place count 87 transition count 129
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 476 place count 86 transition count 129
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 478 place count 86 transition count 129
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 480 place count 84 transition count 127
Iterating global reduction 14 with 2 rules applied. Total rules applied 482 place count 84 transition count 127
Applied a total of 482 rules in 57 ms. Remains 84 /342 variables (removed 258) and now considering 127/452 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 84/342 places, 127/452 transitions.
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 5 ms
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 6 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 317 transition count 416
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 317 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 317 transition count 415
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 64 place count 304 transition count 391
Iterating global reduction 1 with 13 rules applied. Total rules applied 77 place count 304 transition count 391
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 304 transition count 390
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 298 transition count 381
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 298 transition count 381
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 93 place count 295 transition count 377
Iterating global reduction 2 with 3 rules applied. Total rules applied 96 place count 295 transition count 377
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 99 place count 292 transition count 372
Iterating global reduction 2 with 3 rules applied. Total rules applied 102 place count 292 transition count 372
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 289 transition count 368
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 289 transition count 368
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 109 place count 288 transition count 367
Iterating global reduction 2 with 1 rules applied. Total rules applied 110 place count 288 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 111 place count 288 transition count 366
Applied a total of 111 rules in 58 ms. Remains 288 /342 variables (removed 54) and now considering 366/452 (removed 86) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 288/342 places, 366/452 transitions.
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 12 ms
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 17 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 366 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 316 transition count 414
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 316 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 316 transition count 413
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 67 place count 302 transition count 388
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 302 transition count 388
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 302 transition count 386
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 295 transition count 375
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 295 transition count 375
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 292 transition count 371
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 292 transition count 371
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 290 transition count 367
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 290 transition count 367
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 109 place count 288 transition count 364
Iterating global reduction 2 with 2 rules applied. Total rules applied 111 place count 288 transition count 364
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 113 place count 286 transition count 361
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 286 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 286 transition count 360
Applied a total of 116 rules in 33 ms. Remains 286 /342 variables (removed 56) and now considering 360/452 (removed 92) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 286/342 places, 360/452 transitions.
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 12 ms
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 13 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 316 transition count 415
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 316 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 316 transition count 414
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 67 place count 302 transition count 389
Iterating global reduction 1 with 14 rules applied. Total rules applied 81 place count 302 transition count 389
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 83 place count 302 transition count 387
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 295 transition count 376
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 295 transition count 376
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 293 transition count 374
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 293 transition count 374
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 291 transition count 370
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 291 transition count 370
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 289 transition count 367
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 289 transition count 367
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 287 transition count 364
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 287 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 114 place count 287 transition count 363
Applied a total of 114 rules in 32 ms. Remains 287 /342 variables (removed 55) and now considering 363/452 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 287/342 places, 363/452 transitions.
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 12 ms
[2023-03-13 15:35:42] [INFO ] Flatten gal took : 12 ms
[2023-03-13 15:35:42] [INFO ] Input system was already deterministic with 363 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 342/342 places, 452/452 transitions.
Graph (trivial) has 386 edges and 342 vertex of which 46 / 342 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 128 transitions
Trivial Post-agglo rules discarded 128 transitions
Performed 128 trivial Post agglomeration. Transition count delta: 128
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 312 transition count 291
Reduce places removed 128 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 147 rules applied. Total rules applied 276 place count 184 transition count 272
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 12 rules applied. Total rules applied 288 place count 175 transition count 269
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 291 place count 172 transition count 269
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 291 place count 172 transition count 262
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 305 place count 165 transition count 262
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 337 place count 133 transition count 204
Iterating global reduction 4 with 32 rules applied. Total rules applied 369 place count 133 transition count 204
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 4 with 5 rules applied. Total rules applied 374 place count 133 transition count 199
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 379 place count 128 transition count 199
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 388 place count 119 transition count 182
Iterating global reduction 6 with 9 rules applied. Total rules applied 397 place count 119 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 399 place count 119 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 400 place count 118 transition count 180
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 404 place count 114 transition count 174
Iterating global reduction 8 with 4 rules applied. Total rules applied 408 place count 114 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 409 place count 114 transition count 173
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 410 place count 113 transition count 172
Iterating global reduction 9 with 1 rules applied. Total rules applied 411 place count 113 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 412 place count 113 transition count 171
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 436 place count 101 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 438 place count 101 transition count 157
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 442 place count 97 transition count 149
Iterating global reduction 11 with 4 rules applied. Total rules applied 446 place count 97 transition count 149
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 450 place count 93 transition count 144
Iterating global reduction 11 with 4 rules applied. Total rules applied 454 place count 93 transition count 144
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 457 place count 90 transition count 139
Iterating global reduction 11 with 3 rules applied. Total rules applied 460 place count 90 transition count 139
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 463 place count 87 transition count 133
Iterating global reduction 11 with 3 rules applied. Total rules applied 466 place count 87 transition count 133
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 469 place count 84 transition count 127
Iterating global reduction 11 with 3 rules applied. Total rules applied 472 place count 84 transition count 127
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 474 place count 84 transition count 125
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 475 place count 83 transition count 123
Iterating global reduction 12 with 1 rules applied. Total rules applied 476 place count 83 transition count 123
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 479 place count 83 transition count 120
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 1 rules applied. Total rules applied 480 place count 83 transition count 119
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 481 place count 82 transition count 119
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 482 place count 81 transition count 117
Iterating global reduction 14 with 1 rules applied. Total rules applied 483 place count 81 transition count 117
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 484 place count 80 transition count 115
Iterating global reduction 14 with 1 rules applied. Total rules applied 485 place count 80 transition count 115
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 486 place count 79 transition count 114
Iterating global reduction 14 with 1 rules applied. Total rules applied 487 place count 79 transition count 114
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 14 with 4 rules applied. Total rules applied 491 place count 77 transition count 112
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 492 place count 76 transition count 111
Iterating global reduction 14 with 1 rules applied. Total rules applied 493 place count 76 transition count 111
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 495 place count 76 transition count 109
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 495 place count 76 transition count 108
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 497 place count 75 transition count 108
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 498 place count 75 transition count 108
Applied a total of 498 rules in 54 ms. Remains 75 /342 variables (removed 267) and now considering 108/452 (removed 344) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 75/342 places, 108/452 transitions.
[2023-03-13 15:35:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 15:35:43] [INFO ] Flatten gal took : 4 ms
[2023-03-13 15:35:43] [INFO ] Input system was already deterministic with 108 transitions.
[2023-03-13 15:35:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 15:35:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 15:35:43] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 15:35:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 342 places, 452 transitions and 1043 arcs took 4 ms.
Total runtime 16551 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets
authors: Alex Tovchigrechko (IDD package and CTL model checking)
Martin Schwarick (Symbolic numerical analysis and CSL model checking)
Christian Rohr (Simulative and approximative numerical model checking)
marcie@informatik.tu-cottbus.de
called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 342 NrTr: 452 NrArc: 1043)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.013sec
net check time: 0m 0.000sec
init dd package: 0m 3.706sec
RS generation: 1m 3.657sec
-> reachability set: #nodes 124826 (1.2e+05) #states 541,817,268,471 (11)
starting MCC model checker
--------------------------
checking: AG [AF [[[p70<=1 & 1<=p70] | [p187<=1 & 1<=p187]]]]
normalized: ~ [E [true U EG [~ [[[p187<=1 & 1<=p187] | [p70<=1 & 1<=p70]]]]]]
abstracting: (1<=p70)
states: 18,245,340,354 (10)
abstracting: (p70<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p187)
states: 18,441,285,748 (10)
abstracting: (p187<=1)
states: 541,817,268,471 (11)
............
before gc: list nodes free: 501043
after gc: idd nodes used:814843, unused:63185157; list nodes free:289993189
..........MC time: 3m56.008sec
checking: E [~ [[p264<=1 & 1<=p264]] U AX [AG [[p202<=1 & 1<=p202]]]]
normalized: E [~ [[p264<=1 & 1<=p264]] U ~ [EX [E [true U ~ [[p202<=1 & 1<=p202]]]]]]
abstracting: (1<=p202)
states: 768
abstracting: (p202<=1)
states: 541,817,268,471 (11)
before gc: list nodes free: 1870014
after gc: idd nodes used:423587, unused:63576413; list nodes free:293812287
.abstracting: (1<=p264)
states: 757,554,829 (8)
abstracting: (p264<=1)
states: 541,817,268,471 (11)
-> the formula is FALSE
FORMULA HealthRecord-PT-16-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m48.520sec
checking: EF [EX [A [[p23<=1 & 1<=p23] U EX [[p305<=1 & 1<=p305]]]]]
normalized: E [true U EX [[~ [EG [~ [EX [[p305<=1 & 1<=p305]]]]] & ~ [E [~ [EX [[p305<=1 & 1<=p305]]] U [~ [[p23<=1 & 1<=p23]] & ~ [EX [[p305<=1 & 1<=p305]]]]]]]]]
abstracting: (1<=p305)
states: 5,978,124,075 (9)
abstracting: (p305<=1)
states: 541,817,268,471 (11)
.abstracting: (1<=p23)
states: 17,259,942,703 (10)
abstracting: (p23<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p305)
states: 5,978,124,075 (9)
abstracting: (p305<=1)
states: 541,817,268,471 (11)
.abstracting: (1<=p305)
states: 5,978,124,075 (9)
abstracting: (p305<=1)
states: 541,817,268,471 (11)
..
EG iterations: 1
.-> the formula is TRUE
FORMULA HealthRecord-PT-16-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m23.264sec
checking: AG [EF [[[p153<=0 & 0<=p153] & [[p216<=0 & 0<=p216] | [p335<=0 & 0<=p335]]]]]
normalized: ~ [E [true U ~ [E [true U [[[p335<=0 & 0<=p335] | [p216<=0 & 0<=p216]] & [p153<=0 & 0<=p153]]]]]]
abstracting: (0<=p153)
states: 541,817,268,471 (11)
abstracting: (p153<=0)
states: 522,671,989,911 (11)
abstracting: (0<=p216)
states: 541,817,268,471 (11)
abstracting: (p216<=0)
states: 520,404,097,456 (11)
abstracting: (0<=p335)
states: 541,817,268,471 (11)
abstracting: (p335<=0)
states: 524,111,032,545 (11)
-> the formula is TRUE
FORMULA HealthRecord-PT-16-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m22.212sec
checking: [AG [[AX [[AX [[p176<=0 & 0<=p176]] & [p22<=0 & 0<=p22]]] & [p224<=0 & 0<=p224]]] | AX [1<=0]]
normalized: [~ [EX [~ [1<=0]]] | ~ [E [true U ~ [[[p224<=0 & 0<=p224] & ~ [EX [~ [[[p22<=0 & 0<=p22] & ~ [EX [~ [[p176<=0 & 0<=p176]]]]]]]]]]]]]
abstracting: (0<=p176)
states: 541,817,268,471 (11)
abstracting: (p176<=0)
states: 523,375,982,723 (11)
.abstracting: (0<=p22)
states: 541,817,268,471 (11)
abstracting: (p22<=0)
states: 524,557,325,768 (11)
.abstracting: (0<=p224)
states: 541,817,268,471 (11)
abstracting: (p224<=0)
states: 520,728,278,635 (11)
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA HealthRecord-PT-16-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m 3.886sec
checking: AF [[AF [EG [[[p189<=0 & 0<=p189] & [p142<=0 & 0<=p142]]]] | AX [[AG [[p149<=0 & 0<=p149]] | AG [[p56<=0 & 0<=p56]]]]]]
normalized: ~ [EG [~ [[~ [EX [~ [[~ [E [true U ~ [[p56<=0 & 0<=p56]]]] | ~ [E [true U ~ [[p149<=0 & 0<=p149]]]]]]]] | ~ [EG [~ [EG [[[p142<=0 & 0<=p142] & [p189<=0 & 0<=p189]]]]]]]]]]
abstracting: (0<=p189)
states: 541,817,268,471 (11)
abstracting: (p189<=0)
states: 523,375,982,723 (11)
abstracting: (0<=p142)
states: 541,817,268,471 (11)
abstracting: (p142<=0)
states: 524,100,606,987 (11)
before gc: list nodes free: 5803051
after gc: idd nodes used:813340, unused:63186660; list nodes free:292027171
..............
before gc: list nodes free: 349522
after gc: idd nodes used:1176298, unused:62823702; list nodes free:290366211
...MC time: 4m30.048sec
checking: EF [[EG [[[[p190<=1 & 1<=p190] | [p324<=1 & 1<=p324]] & [[p204<=0 & 0<=p204] | [p335<=0 & 0<=p335]]]] | [p299<=1 & 1<=p299]]]
normalized: E [true U [[p299<=1 & 1<=p299] | EG [[[[p335<=0 & 0<=p335] | [p204<=0 & 0<=p204]] & [[p324<=1 & 1<=p324] | [p190<=1 & 1<=p190]]]]]]
abstracting: (1<=p190)
states: 18,441,285,748 (10)
abstracting: (p190<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p324)
states: 192
abstracting: (p324<=1)
states: 541,817,268,471 (11)
abstracting: (0<=p204)
states: 541,817,268,471 (11)
abstracting: (p204<=0)
states: 520,404,097,456 (11)
abstracting: (0<=p335)
states: 541,817,268,471 (11)
abstracting: (p335<=0)
states: 524,111,032,545 (11)
...............
before gc: list nodes free: 902425
after gc: idd nodes used:977006, unused:63022994; list nodes free:291368214
..........................................
EG iterations: 57
abstracting: (1<=p299)
states: 6,217,249,038 (9)
abstracting: (p299<=1)
states: 541,817,268,471 (11)
MC time: 4m 5.003sec
checking: AG [EX [[[p65<=0 & 0<=p65] | [[EF [[p245<=0 & 0<=p245]] & [p198<=0 & 0<=p198]] & [[p130<=0 & 0<=p130] & [p265<=0 & 0<=p265]]]]]]
normalized: ~ [E [true U ~ [EX [[[[[p265<=0 & 0<=p265] & [p130<=0 & 0<=p130]] & [[p198<=0 & 0<=p198] & E [true U [p245<=0 & 0<=p245]]]] | [p65<=0 & 0<=p65]]]]]]
abstracting: (0<=p65)
states: 541,817,268,471 (11)
abstracting: (p65<=0)
states: 541,817,249,187 (11)
abstracting: (0<=p245)
states: 541,817,268,471 (11)
abstracting: (p245<=0)
states: 529,143,643,633 (11)
abstracting: (0<=p198)
states: 541,817,268,471 (11)
abstracting: (p198<=0)
states: 523,607,733,219 (11)
abstracting: (0<=p130)
states: 541,817,268,471 (11)
abstracting: (p130<=0)
states: 524,674,416,909 (11)
abstracting: (0<=p265)
states: 541,817,268,471 (11)
abstracting: (p265<=0)
states: 541,059,713,642 (11)
.
before gc: list nodes free: 1490450
after gc: idd nodes used:876142, unused:63123858; list nodes free:293911577
-> the formula is FALSE
FORMULA HealthRecord-PT-16-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m 3.371sec
checking: AG [AF [~ [E [[AF [[[p248<=1 & 1<=p248] & [p334<=1 & 1<=p334]]] & [[p104<=1 & 1<=p104] & [p90<=1 & 1<=p90]]] U [p261<=1 & 1<=p261]]]]]
normalized: ~ [E [true U EG [E [[[[p90<=1 & 1<=p90] & [p104<=1 & 1<=p104]] & ~ [EG [~ [[[p334<=1 & 1<=p334] & [p248<=1 & 1<=p248]]]]]] U [p261<=1 & 1<=p261]]]]]
abstracting: (1<=p261)
states: 757,554,829 (8)
abstracting: (p261<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p248)
states: 36,079,241,111 (10)
abstracting: (p248<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p334)
states: 19,302,575,518 (10)
abstracting: (p334<=1)
states: 541,817,268,471 (11)
.
EG iterations: 1
abstracting: (1<=p104)
states: 17,142,851,562 (10)
abstracting: (p104<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p90)
states: 18,476,949,540 (10)
abstracting: (p90<=1)
states: 541,817,268,471 (11)
.............................
EG iterations: 29
-> the formula is FALSE
FORMULA HealthRecord-PT-16-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m11.841sec
checking: EX [[AF [E [[~ [[p206<=1 & 1<=p206]] & [[p313<=1 & 1<=p313] & [p128<=1 & 1<=p128]]] U E [[1<=p266 & p266<=1] U [p80<=1 & 1<=p80]]]] & EF [[[p195<=0 & 0<=p195] | [p330<=0 & 0<=p330]]]]]
normalized: EX [[E [true U [[p330<=0 & 0<=p330] | [p195<=0 & 0<=p195]]] & ~ [EG [~ [E [[[[p128<=1 & 1<=p128] & [p313<=1 & 1<=p313]] & ~ [[p206<=1 & 1<=p206]]] U E [[1<=p266 & p266<=1] U [p80<=1 & 1<=p80]]]]]]]]
abstracting: (1<=p80)
states: 16,912,740,160 (10)
abstracting: (p80<=1)
states: 541,817,268,471 (11)
abstracting: (p266<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p266)
states: 757,554,829 (8)
abstracting: (1<=p206)
states: 21,413,171,015 (10)
abstracting: (p206<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p313)
states: 6,695,498,964 (9)
abstracting: (p313<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p128)
states: 17,346,548,760 (10)
abstracting: (p128<=1)
states: 541,817,268,471 (11)
....
before gc: list nodes free: 8668895
after gc: idd nodes used:1646394, unused:62353606; list nodes free:290448985
.........MC time: 4m10.052sec
checking: AF [EX [[AX [[[p48<=1 & 1<=p48] & [p295<=1 & 1<=p295]]] & [EF [[p270<=1 & 1<=p270]] | E [EX [[[p248<=1 & 1<=p248] & [p321<=1 & 1<=p321]]] U ~ [[[p248<=1 & 1<=p248] & [p321<=1 & 1<=p321]]]]]]]]
normalized: ~ [EG [~ [EX [[[E [EX [[[p321<=1 & 1<=p321] & [p248<=1 & 1<=p248]]] U ~ [[[p248<=1 & 1<=p248] & [p321<=1 & 1<=p321]]]] | E [true U [p270<=1 & 1<=p270]]] & ~ [EX [~ [[[p295<=1 & 1<=p295] & [p48<=1 & 1<=p48]]]]]]]]]]
abstracting: (1<=p48)
states: 17,259,942,703 (10)
abstracting: (p48<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p295)
states: 5,978,124,075 (9)
abstracting: (p295<=1)
states: 541,817,268,471 (11)
before gc: list nodes free: 2485020
after gc: idd nodes used:1397745, unused:62602255; list nodes free:291572236
.abstracting: (1<=p270)
states: 757,554,829 (8)
abstracting: (p270<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p321)
states: 17,266,604,350 (10)
abstracting: (p321<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p248)
states: 36,079,241,111 (10)
abstracting: (p248<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p248)
states: 36,079,241,111 (10)
abstracting: (p248<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p321)
states: 17,266,604,350 (10)
abstracting: (p321<=1)
states: 541,817,268,471 (11)
........MC time: 3m43.083sec
checking: [AG [[p244<=0 & 0<=p244]] & [E [~ [[[p248<=1 & 1<=p248] & [p314<=1 & 1<=p314]]] U [p36<=1 & 1<=p36]] & EX [[[p44<=0 & 0<=p44] & [EG [[p38<=0 & 0<=p38]] & [[p284<=0 & 0<=p284] | EG [[p255<=0 & 0<=p255]]]]]]]]
normalized: [[EX [[[[EG [[p255<=0 & 0<=p255]] | [p284<=0 & 0<=p284]] & EG [[p38<=0 & 0<=p38]]] & [p44<=0 & 0<=p44]]] & E [~ [[[p314<=1 & 1<=p314] & [p248<=1 & 1<=p248]]] U [p36<=1 & 1<=p36]]] & ~ [E [true U ~ [[p244<=0 & 0<=p244]]]]]
abstracting: (0<=p244)
states: 541,817,268,471 (11)
abstracting: (p244<=0)
states: 529,143,643,633 (11)
before gc: list nodes free: 4458938
after gc: idd nodes used:1339433, unused:62660567; list nodes free:291840796
abstracting: (1<=p36)
states: 5,270,297,171 (9)
abstracting: (p36<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p248)
states: 36,079,241,111 (10)
abstracting: (p248<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p314)
states: 6,695,498,964 (9)
abstracting: (p314<=1)
states: 541,817,268,471 (11)
abstracting: (0<=p44)
states: 541,817,268,471 (11)
abstracting: (p44<=0)
states: 536,115,965,235 (11)
abstracting: (0<=p38)
states: 541,817,268,471 (11)
abstracting: (p38<=0)
states: 537,055,199,762 (11)
.
EG iterations: 1
abstracting: (0<=p284)
states: 541,817,268,471 (11)
abstracting: (p284<=0)
states: 535,839,144,396 (11)
abstracting: (0<=p255)
states: 541,817,268,471 (11)
abstracting: (p255<=0)
states: 505,738,027,360 (11)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA HealthRecord-PT-16-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m32.297sec
checking: EF [AG [[AX [[[p166<=0 & 0<=p166] & [p120<=0 & 0<=p120]]] & [AX [EG [[p127<=1 & 1<=p127]]] | [[[p105<=0 & 0<=p105] | [p72<=0 & 0<=p72]] & [[[p114<=1 & 1<=p114] | [p285<=1 & 1<=p285]] | [[p150<=1 & 1<=p150] | [p22<=1 & 1<=p22]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[[[p22<=1 & 1<=p22] | [p150<=1 & 1<=p150]] | [[p285<=1 & 1<=p285] | [p114<=1 & 1<=p114]]] & [[p72<=0 & 0<=p72] | [p105<=0 & 0<=p105]]] | ~ [EX [~ [EG [[p127<=1 & 1<=p127]]]]]] & ~ [EX [~ [[[p120<=0 & 0<=p120] & [p166<=0 & 0<=p166]]]]]]]]]]
abstracting: (0<=p166)
states: 541,817,268,471 (11)
abstracting: (p166<=0)
states: 522,921,706,200 (11)
abstracting: (0<=p120)
states: 541,817,268,471 (11)
abstracting: (p120<=0)
states: 525,308,302,349 (11)
.abstracting: (1<=p127)
states: 17,346,548,760 (10)
abstracting: (p127<=1)
states: 541,817,268,471 (11)
................
before gc: list nodes free: 1412279
after gc: idd nodes used:1804118, unused:62195882; list nodes free:289780357
........MC time: 3m23.016sec
checking: [~ [A [AF [[p72<=1 & 1<=p72]] U [[p135<=1 & 1<=p135] | [p31<=1 & 1<=p31]]]] & [AF [~ [E [[p222<=1 & 1<=p222] U [p236<=1 & 1<=p236]]]] | EG [[[EF [[p23<=1 & 1<=p23]] & [p261<=0 & 0<=p261]] | [[p92<=0 & 0<=p92] & [p294<=0 & 0<=p294]]]]]]
normalized: [[EG [[[[p294<=0 & 0<=p294] & [p92<=0 & 0<=p92]] | [[p261<=0 & 0<=p261] & E [true U [p23<=1 & 1<=p23]]]]] | ~ [EG [E [[p222<=1 & 1<=p222] U [p236<=1 & 1<=p236]]]]] & ~ [[~ [EG [~ [[[p31<=1 & 1<=p31] | [p135<=1 & 1<=p135]]]]] & ~ [E [~ [[[p31<=1 & 1<=p31] | [p135<=1 & 1<=p135]]] U [EG [~ [[p72<=1 & 1<=p72]]] & ~ [[[p31<=1 & 1<=p31] | [p135<=1 & 1<=p135]]]]]]]]]
abstracting: (1<=p135)
states: 17,142,851,562 (10)
abstracting: (p135<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p31)
states: 5,460,620,981 (9)
abstracting: (p31<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p72)
states: 18,245,340,354 (10)
abstracting: (p72<=1)
states: 541,817,268,471 (11)
.
EG iterations: 1
abstracting: (1<=p135)
states: 17,142,851,562 (10)
abstracting: (p135<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p31)
states: 5,460,620,981 (9)
abstracting: (p31<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p135)
states: 17,142,851,562 (10)
abstracting: (p135<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p31)
states: 5,460,620,981 (9)
abstracting: (p31<=1)
states: 541,817,268,471 (11)
.......
before gc: list nodes free: 4108749
after gc: idd nodes used:2124134, unused:61875866; list nodes free:288258827
.MC time: 2m58.112sec
checking: AF [[EG [[[EG [[p123<=0 & 0<=p123]] | [p43<=0 & 0<=p43]] & [AX [[[p25<=0 & 0<=p25] | [p335<=0 & 0<=p335]]] & [p296<=0 & 0<=p296]]]] & [AF [[[EX [[p306<=1 & 1<=p306]] & [p302<=1 & 1<=p302]] | AX [[p115<=0 & 0<=p115]]]] | [AF [[p326<=1 & 1<=p326]] & AF [[[p243<=1 & 1<=p243] & [[p62<=1 & 1<=p62] & [p294<=1 & 1<=p294]]]]]]]]
normalized: ~ [EG [~ [[EG [[[[p296<=0 & 0<=p296] & ~ [EX [~ [[[p335<=0 & 0<=p335] | [p25<=0 & 0<=p25]]]]]] & [[p43<=0 & 0<=p43] | EG [[p123<=0 & 0<=p123]]]]] & [[~ [EG [~ [[[[p62<=1 & 1<=p62] & [p294<=1 & 1<=p294]] & [p243<=1 & 1<=p243]]]]] & ~ [EG [~ [[p326<=1 & 1<=p326]]]]] | ~ [EG [~ [[~ [EX [~ [[p115<=0 & 0<=p115]]]] | [[p302<=1 & 1<=p302] & EX [[p306<=1 & 1<=p306]]]]]]]]]]]]
abstracting: (1<=p306)
states: 6,695,498,964 (9)
abstracting: (p306<=1)
states: 541,817,268,471 (11)
.abstracting: (1<=p302)
states: 5,978,124,075 (9)
abstracting: (p302<=1)
states: 541,817,268,471 (11)
abstracting: (0<=p115)
states: 541,817,268,471 (11)
abstracting: (p115<=0)
states: 525,947,598,271 (11)
........................
before gc: list nodes free: 4262057
after gc: idd nodes used:1936718, unused:62063282; list nodes free:289192822
MC time: 2m39.298sec
checking: AG [AF [[[p70<=1 & 1<=p70] | [p187<=1 & 1<=p187]]]]
normalized: ~ [E [true U EG [~ [[[p187<=1 & 1<=p187] | [p70<=1 & 1<=p70]]]]]]
abstracting: (1<=p70)
states: 18,245,340,354 (10)
abstracting: (p70<=1)
states: 541,817,268,471 (11)
abstracting: (1<=p187)
states: 18,441,285,748 (10)
abstracting: (p187<=1)
states: 541,817,268,471 (11)
.................
before gc: list nodes free: 1776435
after gc: idd nodes used:2208803, unused:61791197; list nodes free:287984072
..................
before gc: list nodes free: 881135
after gc: idd nodes used:2000513, unused:61999487; list nodes free:288911242
......................
EG iterations: 57
-> the formula is FALSE
FORMULA HealthRecord-PT-16-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 6015036 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097488 kB
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.006sec
104850
iterations count:183235 (405), effective:12675 (28)
initing FirstDep: 0m 0.001sec
net_ddint.h:600: Timeout: after 235 sec
iterations count:454 (1), effective:1 (0)
iterations count:7142 (15), effective:273 (0)
iterations count:454 (1), effective:1 (0)
iterations count:13660 (30), effective:583 (1)
iterations count:1728 (3), effective:115 (0)
iterations count:5377 (11), effective:276 (0)
net_ddint.h:600: Timeout: after 269 sec
sat_reach.icc:155: Timeout: after 244 sec
iterations count:536 (1), effective:1 (0)
iterations count:7234 (16), effective:314 (0)
iterations count:452 (1), effective:0 (0)
iterations count:541 (1), effective:26 (0)
iterations count:758 (1), effective:36 (0)
iterations count:466 (1), effective:5 (0)
net_ddint.h:600: Timeout: after 249 sec
iterations count:496 (1), effective:17 (0)
iterations count:464 (1), effective:1 (0)
net_ddint.h:600: Timeout: after 222 sec
iterations count:12948 (28), effective:568 (1)
iterations count:13800 (30), effective:573 (1)
net_ddint.h:600: Timeout: after 202 sec
iterations count:455 (1), effective:1 (0)
net_ddint.h:600: Timeout: after 177 sec
net_ddint.h:600: Timeout: after 155 sec
iterations count:474 (1), effective:4 (0)
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="HealthRecord-PT-16"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is HealthRecord-PT-16, 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 r202-smll-167840348600354"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-16.tgz
mv HealthRecord-PT-16 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 ;