About the Execution of Marcie+red for AutonomousCar-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10054.947 | 3600000.00 | 3678333.00 | 215.60 | TTTTTT?T?T????T? | 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.r010-oct2-167813599300617.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599300617
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 12:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 12:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 12:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 228K 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 AutonomousCar-PT-06b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-06b-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678699832527
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:30:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:30:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:30:36] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2023-03-13 09:30:36] [INFO ] Transformed 289 places.
[2023-03-13 09:30:36] [INFO ] Transformed 644 transitions.
[2023-03-13 09:30:36] [INFO ] Found NUPN structural information;
[2023-03-13 09:30:36] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 291 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Support contains 82 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 258 transition count 613
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 258 transition count 613
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 206 place count 258 transition count 469
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 210 place count 254 transition count 465
Iterating global reduction 1 with 4 rules applied. Total rules applied 214 place count 254 transition count 465
Applied a total of 214 rules in 100 ms. Remains 254 /289 variables (removed 35) and now considering 465/644 (removed 179) transitions.
// Phase 1: matrix 465 rows 254 cols
[2023-03-13 09:30:36] [INFO ] Computed 11 place invariants in 13 ms
[2023-03-13 09:30:36] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-13 09:30:36] [INFO ] Invariant cache hit.
[2023-03-13 09:30:37] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
[2023-03-13 09:30:37] [INFO ] Invariant cache hit.
[2023-03-13 09:30:37] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 254/289 places, 465/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1493 ms. Remains : 254/289 places, 465/644 transitions.
Support contains 82 out of 254 places after structural reductions.
[2023-03-13 09:30:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 09:30:38] [INFO ] Flatten gal took : 126 ms
FORMULA AutonomousCar-PT-06b-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:30:38] [INFO ] Flatten gal took : 51 ms
[2023-03-13 09:30:38] [INFO ] Input system was already deterministic with 465 transitions.
Support contains 66 out of 254 places (down from 82) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 47) seen :33
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 09:30:39] [INFO ] Invariant cache hit.
[2023-03-13 09:30:39] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-13 09:30:39] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 09:30:39] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2023-03-13 09:30:39] [INFO ] After 313ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-13 09:30:40] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 5 ms to minimize.
[2023-03-13 09:30:40] [INFO ] Deduced a trap composed of 32 places in 710 ms of which 14 ms to minimize.
[2023-03-13 09:30:41] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 2 ms to minimize.
[2023-03-13 09:30:41] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 0 ms to minimize.
[2023-03-13 09:30:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1569 ms
[2023-03-13 09:30:41] [INFO ] After 1905ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 09:30:41] [INFO ] After 2059ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 3 out of 254 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 254/254 places, 465/465 transitions.
Graph (trivial) has 237 edges and 254 vertex of which 4 / 254 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 889 edges and 252 vertex of which 249 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 103 rules applied. Total rules applied 105 place count 249 transition count 357
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 136 rules applied. Total rules applied 241 place count 148 transition count 322
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 263 place count 129 transition count 319
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 266 place count 126 transition count 319
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 266 place count 126 transition count 313
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 278 place count 120 transition count 313
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 282 place count 116 transition count 309
Iterating global reduction 4 with 4 rules applied. Total rules applied 286 place count 116 transition count 309
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 384 place count 67 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 385 place count 67 transition count 259
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 398 place count 54 transition count 180
Iterating global reduction 5 with 13 rules applied. Total rules applied 411 place count 54 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 415 place count 54 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 417 place count 53 transition count 175
Free-agglomeration rule applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 423 place count 53 transition count 169
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 429 place count 47 transition count 169
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 431 place count 47 transition count 167
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 432 place count 47 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 433 place count 46 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 434 place count 45 transition count 166
Applied a total of 434 rules in 141 ms. Remains 45 /254 variables (removed 209) and now considering 166/465 (removed 299) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 45/254 places, 166/465 transitions.
Finished random walk after 537 steps, including 7 resets, run visited all 1 properties in 3 ms. (steps per millisecond=179 )
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2023-03-13 09:30:41] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:30:41] [INFO ] Flatten gal took : 28 ms
[2023-03-13 09:30:41] [INFO ] Input system was already deterministic with 465 transitions.
Computed a total of 46 stabilizing places and 47 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Graph (trivial) has 236 edges and 254 vertex of which 4 / 254 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 251 transition count 361
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 131 rules applied. Total rules applied 233 place count 150 transition count 331
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 18 rules applied. Total rules applied 251 place count 133 transition count 330
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 252 place count 132 transition count 330
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 252 place count 132 transition count 322
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 268 place count 124 transition count 322
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 273 place count 119 transition count 317
Iterating global reduction 4 with 5 rules applied. Total rules applied 278 place count 119 transition count 317
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 360 place count 78 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 361 place count 78 transition count 275
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 374 place count 65 transition count 196
Iterating global reduction 5 with 13 rules applied. Total rules applied 387 place count 65 transition count 196
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 9 rules applied. Total rules applied 396 place count 65 transition count 187
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 400 place count 61 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 402 place count 60 transition count 186
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 404 place count 60 transition count 184
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 1 rules applied. Total rules applied 405 place count 60 transition count 183
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 406 place count 59 transition count 183
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 407 place count 59 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 409 place count 57 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 410 place count 56 transition count 181
Applied a total of 410 rules in 55 ms. Remains 56 /254 variables (removed 198) and now considering 181/465 (removed 284) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 56/254 places, 181/465 transitions.
[2023-03-13 09:30:41] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:30:41] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:30:41] [INFO ] Input system was already deterministic with 181 transitions.
Finished random walk after 101 steps, including 7 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
FORMULA AutonomousCar-PT-06b-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Graph (trivial) has 241 edges and 254 vertex of which 4 / 254 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 251 transition count 357
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 140 rules applied. Total rules applied 246 place count 146 transition count 322
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 266 place count 126 transition count 322
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 266 place count 126 transition count 316
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 278 place count 120 transition count 316
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 284 place count 114 transition count 310
Iterating global reduction 3 with 6 rules applied. Total rules applied 290 place count 114 transition count 310
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 372 place count 73 transition count 269
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 373 place count 73 transition count 268
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 385 place count 61 transition count 195
Iterating global reduction 4 with 12 rules applied. Total rules applied 397 place count 61 transition count 195
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
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 10 rules applied. Total rules applied 407 place count 61 transition count 185
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 412 place count 56 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 414 place count 55 transition count 184
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 415 place count 55 transition count 183
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 417 place count 53 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 418 place count 52 transition count 181
Applied a total of 418 rules in 55 ms. Remains 52 /254 variables (removed 202) and now considering 181/465 (removed 284) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 52/254 places, 181/465 transitions.
[2023-03-13 09:30:41] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:30:42] [INFO ] Input system was already deterministic with 181 transitions.
Finished random walk after 69 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=34 )
FORMULA AutonomousCar-PT-06b-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 239 transition count 450
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 239 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 237 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 237 transition count 448
Applied a total of 34 rules in 34 ms. Remains 237 /254 variables (removed 17) and now considering 448/465 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 237/254 places, 448/465 transitions.
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:30:42] [INFO ] Input system was already deterministic with 448 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Graph (trivial) has 239 edges and 254 vertex of which 4 / 254 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 251 transition count 359
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 136 rules applied. Total rules applied 240 place count 148 transition count 326
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 259 place count 129 transition count 326
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 259 place count 129 transition count 319
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 273 place count 122 transition count 319
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 279 place count 116 transition count 313
Iterating global reduction 3 with 6 rules applied. Total rules applied 285 place count 116 transition count 313
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 367 place count 75 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 368 place count 75 transition count 271
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 380 place count 63 transition count 198
Iterating global reduction 4 with 12 rules applied. Total rules applied 392 place count 63 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
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 8 rules applied. Total rules applied 400 place count 63 transition count 190
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 404 place count 59 transition count 190
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 406 place count 58 transition count 189
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 408 place count 58 transition count 187
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 1 rules applied. Total rules applied 409 place count 58 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 410 place count 57 transition count 186
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 411 place count 57 transition count 186
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 413 place count 55 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 414 place count 54 transition count 184
Applied a total of 414 rules in 95 ms. Remains 54 /254 variables (removed 200) and now considering 184/465 (removed 281) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 54/254 places, 184/465 transitions.
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:30:42] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 238 transition count 449
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 238 transition count 449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 235 transition count 446
Applied a total of 38 rules in 12 ms. Remains 235 /254 variables (removed 19) and now considering 446/465 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 235/254 places, 446/465 transitions.
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:30:42] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Graph (trivial) has 239 edges and 254 vertex of which 4 / 254 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 106 place count 251 transition count 357
Reduce places removed 105 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 141 rules applied. Total rules applied 247 place count 146 transition count 321
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 268 place count 125 transition count 321
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 268 place count 125 transition count 315
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 280 place count 119 transition count 315
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 286 place count 113 transition count 309
Iterating global reduction 3 with 6 rules applied. Total rules applied 292 place count 113 transition count 309
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 374 place count 72 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 375 place count 72 transition count 267
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 388 place count 59 transition count 188
Iterating global reduction 4 with 13 rules applied. Total rules applied 401 place count 59 transition count 188
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 12 rules applied. Total rules applied 413 place count 59 transition count 176
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 419 place count 53 transition count 176
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 421 place count 52 transition count 175
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 422 place count 52 transition count 174
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 424 place count 50 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 425 place count 49 transition count 172
Applied a total of 425 rules in 32 ms. Remains 49 /254 variables (removed 205) and now considering 172/465 (removed 293) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 49/254 places, 172/465 transitions.
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:30:42] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 239 transition count 450
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 239 transition count 450
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 236 transition count 447
Applied a total of 36 rules in 11 ms. Remains 236 /254 variables (removed 18) and now considering 447/465 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 236/254 places, 447/465 transitions.
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:30:42] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 239 transition count 450
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 239 transition count 450
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 236 transition count 447
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 236 transition count 447
Applied a total of 36 rules in 10 ms. Remains 236 /254 variables (removed 18) and now considering 447/465 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 236/254 places, 447/465 transitions.
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:30:42] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 242 transition count 453
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 242 transition count 453
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 239 transition count 450
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 239 transition count 450
Applied a total of 30 rules in 14 ms. Remains 239 /254 variables (removed 15) and now considering 450/465 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 239/254 places, 450/465 transitions.
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:30:42] [INFO ] Input system was already deterministic with 450 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 238 transition count 449
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 238 transition count 449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 235 transition count 446
Applied a total of 38 rules in 11 ms. Remains 235 /254 variables (removed 19) and now considering 446/465 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 235/254 places, 446/465 transitions.
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:30:42] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 238 transition count 449
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 238 transition count 449
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 235 transition count 446
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 235 transition count 446
Applied a total of 38 rules in 11 ms. Remains 235 /254 variables (removed 19) and now considering 446/465 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 235/254 places, 446/465 transitions.
[2023-03-13 09:30:42] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:30:43] [INFO ] Input system was already deterministic with 446 transitions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 241 transition count 452
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 241 transition count 452
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 239 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 239 transition count 450
Applied a total of 30 rules in 9 ms. Remains 239 /254 variables (removed 15) and now considering 450/465 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 239/254 places, 450/465 transitions.
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:30:43] [INFO ] Input system was already deterministic with 450 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Graph (trivial) has 235 edges and 254 vertex of which 4 / 254 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 251 transition count 361
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 134 rules applied. Total rules applied 236 place count 150 transition count 328
Reduce places removed 19 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 21 rules applied. Total rules applied 257 place count 131 transition count 326
Reduce places removed 2 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 4 rules applied. Total rules applied 261 place count 129 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 262 place count 128 transition count 324
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 262 place count 128 transition count 318
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 274 place count 122 transition count 318
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 280 place count 116 transition count 312
Iterating global reduction 5 with 6 rules applied. Total rules applied 286 place count 116 transition count 312
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 366 place count 76 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 367 place count 76 transition count 271
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 378 place count 65 transition count 206
Iterating global reduction 6 with 11 rules applied. Total rules applied 389 place count 65 transition count 206
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 399 place count 65 transition count 196
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 404 place count 60 transition count 196
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 406 place count 59 transition count 195
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 407 place count 59 transition count 194
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 409 place count 57 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 410 place count 56 transition count 192
Applied a total of 410 rules in 36 ms. Remains 56 /254 variables (removed 198) and now considering 192/465 (removed 273) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 56/254 places, 192/465 transitions.
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:30:43] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Graph (trivial) has 237 edges and 254 vertex of which 4 / 254 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 101 place count 251 transition count 362
Reduce places removed 100 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 134 rules applied. Total rules applied 235 place count 151 transition count 328
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 22 rules applied. Total rules applied 257 place count 131 transition count 326
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 259 place count 129 transition count 326
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 259 place count 129 transition count 320
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 271 place count 123 transition count 320
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 277 place count 117 transition count 314
Iterating global reduction 4 with 6 rules applied. Total rules applied 283 place count 117 transition count 314
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 284 place count 117 transition count 313
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 366 place count 76 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 367 place count 76 transition count 271
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 380 place count 63 transition count 192
Iterating global reduction 6 with 13 rules applied. Total rules applied 393 place count 63 transition count 192
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 10 rules applied. Total rules applied 403 place count 63 transition count 182
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 408 place count 58 transition count 182
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 410 place count 57 transition count 181
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 411 place count 57 transition count 180
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 413 place count 55 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 414 place count 54 transition count 178
Applied a total of 414 rules in 42 ms. Remains 54 /254 variables (removed 200) and now considering 178/465 (removed 287) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 54/254 places, 178/465 transitions.
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:30:43] [INFO ] Input system was already deterministic with 178 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 254/254 places, 465/465 transitions.
Graph (trivial) has 219 edges and 254 vertex of which 4 / 254 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 252 transition count 372
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 117 rules applied. Total rules applied 209 place count 161 transition count 346
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 19 rules applied. Total rules applied 228 place count 147 transition count 341
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 233 place count 142 transition count 341
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 233 place count 142 transition count 333
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 249 place count 134 transition count 333
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 256 place count 127 transition count 326
Iterating global reduction 4 with 7 rules applied. Total rules applied 263 place count 127 transition count 326
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 341 place count 88 transition count 287
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 342 place count 88 transition count 286
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 355 place count 75 transition count 207
Iterating global reduction 5 with 13 rules applied. Total rules applied 368 place count 75 transition count 207
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 373 place count 75 transition count 202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 375 place count 73 transition count 202
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 7 with 2 rules applied. Total rules applied 377 place count 72 transition count 201
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 378 place count 72 transition count 200
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 381 place count 72 transition count 200
Applied a total of 381 rules in 30 ms. Remains 72 /254 variables (removed 182) and now considering 200/465 (removed 265) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 72/254 places, 200/465 transitions.
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:30:43] [INFO ] Input system was already deterministic with 200 transitions.
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:30:43] [INFO ] Flatten gal took : 18 ms
[2023-03-13 09:30:43] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 09:30:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 254 places, 465 transitions and 2590 arcs took 3 ms.
Total runtime 7722 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 254 NrTr: 465 NrArc: 2590)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.024sec
net check time: 0m 0.000sec
init dd package: 0m 3.043sec
RS generation: 11m 5.838sec
-> reachability set: #nodes 185682 (1.9e+05) #states 1,737,966,874,788 (12)
starting MCC model checker
--------------------------
checking: EF [EG [[1<=p247 & p247<=1]]]
normalized: E [true U EG [[1<=p247 & p247<=1]]]
abstracting: (p247<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p247)
states: 66,251,669,040 (10)
..........
before gc: list nodes free: 1032175
after gc: idd nodes used:724806, unused:63275194; list nodes free:290419195
.......MC time: 3m46.045sec
checking: AF [[EF [[1<=p92 & p92<=1]] & [0<=p74 & p74<=0]]]
normalized: ~ [EG [~ [[[0<=p74 & p74<=0] & E [true U [1<=p92 & p92<=1]]]]]]
abstracting: (p92<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p92)
states: 73,379,475,112 (10)
abstracting: (p74<=0)
states: 1,670,182,803,084 (12)
abstracting: (0<=p74)
states: 1,737,966,874,788 (12)
..........
before gc: list nodes free: 3054998
after gc: idd nodes used:620043, unused:63379957; list nodes free:290815552
.............
EG iterations: 23
-> the formula is TRUE
FORMULA AutonomousCar-PT-06b-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m31.600sec
checking: EX [[[p162<=1 & 1<=p162] | AF [AX [[p109<=1 & 1<=p109]]]]]
normalized: EX [[~ [EG [EX [~ [[p109<=1 & 1<=p109]]]]] | [p162<=1 & 1<=p162]]]
abstracting: (1<=p162)
states: 70,474,438,416 (10)
abstracting: (p162<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p109)
states: 95,258,633,992 (10)
abstracting: (p109<=1)
states: 1,737,966,874,788 (12)
..........
before gc: list nodes free: 4534886
after gc: idd nodes used:1273445, unused:62726555; list nodes free:288013338
.MC time: 3m38.411sec
checking: [EF [AX [1<=0]] & EX [[[p100<=0 & 0<=p100] | [p37<=1 & 1<=p37]]]]
normalized: [EX [[[p37<=1 & 1<=p37] | [p100<=0 & 0<=p100]]] & E [true U ~ [EX [~ [1<=0]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (0<=p100)
states: 1,737,966,874,788 (12)
abstracting: (p100<=0)
states: 1,664,587,399,676 (12)
abstracting: (1<=p37)
states: 70,474,438,416 (10)
abstracting: (p37<=1)
states: 1,737,966,874,788 (12)
MC time: 3m20.033sec
checking: EF [EG [[[p138<=1 & 1<=p138] | EF [[p179<=0 & 0<=p179]]]]]
normalized: E [true U EG [[E [true U [p179<=0 & 0<=p179]] | [p138<=1 & 1<=p138]]]]
abstracting: (1<=p138)
states: 662,400 (5)
abstracting: (p138<=1)
states: 1,737,966,874,788 (12)
abstracting: (0<=p179)
states: 1,737,966,874,788 (12)
abstracting: (p179<=0)
states: 1,667,492,436,372 (12)
EG iterations: 0
-> the formula is TRUE
FORMULA AutonomousCar-PT-06b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m20.087sec
checking: EG [~ [A [AG [AX [[p214<=1 & 1<=p214]]] U [EX [[1<=p162 & p162<=1]] & [p137<=1 & 1<=p137]]]]]
normalized: EG [~ [[~ [EG [~ [[[p137<=1 & 1<=p137] & EX [[1<=p162 & p162<=1]]]]]] & ~ [E [~ [[[p137<=1 & 1<=p137] & EX [[1<=p162 & p162<=1]]]] U [E [true U EX [~ [[p214<=1 & 1<=p214]]]] & ~ [[[p137<=1 & 1<=p137] & EX [[1<=p162 & p162<=1]]]]]]]]]]
abstracting: (p162<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p162)
states: 70,474,438,416 (10)
.abstracting: (1<=p137)
states: 662,400 (5)
abstracting: (p137<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p214)
states: 146,453,055,120 (11)
abstracting: (p214<=1)
states: 1,737,966,874,788 (12)
.abstracting: (p162<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p162)
states: 70,474,438,416 (10)
.abstracting: (1<=p137)
states: 662,400 (5)
abstracting: (p137<=1)
states: 1,737,966,874,788 (12)
abstracting: (p162<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p162)
states: 70,474,438,416 (10)
.abstracting: (1<=p137)
states: 662,400 (5)
abstracting: (p137<=1)
states: 1,737,966,874,788 (12)
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA AutonomousCar-PT-06b-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m19.872sec
checking: EF [[EF [[[1<=p23 & p23<=1] & [p134<=0 & 0<=p134]]] & EF [EX [[1<=p161 & p161<=1]]]]]
normalized: E [true U [E [true U EX [[1<=p161 & p161<=1]]] & E [true U [[p134<=0 & 0<=p134] & [1<=p23 & p23<=1]]]]]
abstracting: (p23<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p23)
states: 600
abstracting: (0<=p134)
states: 1,737,966,874,788 (12)
abstracting: (p134<=0)
states: 1,670,182,803,084 (12)
abstracting: (p161<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p161)
states: 70,474,438,416 (10)
.
before gc: list nodes free: 4741920
after gc: idd nodes used:707630, unused:63292370; list nodes free:290458537
-> the formula is TRUE
FORMULA AutonomousCar-PT-06b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m24.850sec
checking: AX [AF [[[[~ [[1<=p180 & p180<=1]] & EX [[p4<=0 & 0<=p4]]] & ~ [[0<=p66 & p66<=0]]] | EF [[1<=p48 & p48<=1]]]]]
normalized: ~ [EX [EG [~ [[E [true U [1<=p48 & p48<=1]] | [~ [[0<=p66 & p66<=0]] & [EX [[p4<=0 & 0<=p4]] & ~ [[1<=p180 & p180<=1]]]]]]]]]
abstracting: (p180<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p180)
states: 70,474,438,416 (10)
abstracting: (0<=p4)
states: 1,737,966,874,788 (12)
abstracting: (p4<=0)
states: 873,018,329,141 (11)
.abstracting: (p66<=0)
states: 1,670,182,803,084 (12)
abstracting: (0<=p66)
states: 1,737,966,874,788 (12)
abstracting: (p48<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p48)
states: 42,953,470,560 (10)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA AutonomousCar-PT-06b-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m37.646sec
checking: EG [AF [E [[[p52<=0 & 0<=p52] | [p42<=1 & 1<=p42]] U ~ [AF [[[p104<=0 & 0<=p104] | [p42<=1 & 1<=p42]]]]]]]
normalized: EG [~ [EG [~ [E [[[p42<=1 & 1<=p42] | [p52<=0 & 0<=p52]] U EG [~ [[[p42<=1 & 1<=p42] | [p104<=0 & 0<=p104]]]]]]]]]
abstracting: (0<=p104)
states: 1,737,966,874,788 (12)
abstracting: (p104<=0)
states: 1,642,708,893,596 (12)
abstracting: (1<=p42)
states: 70,474,438,416 (10)
abstracting: (p42<=1)
states: 1,737,966,874,788 (12)
................
before gc: list nodes free: 5455707
after gc: idd nodes used:1162899, unused:62837101; list nodes free:288420492
...................
before gc: list nodes free: 5369445
after gc: idd nodes used:1181448, unused:62818552; list nodes free:288322943
MC time: 4m 7.024sec
checking: EX [AG [[[[AF [[[p116<=1 & 1<=p116] & [p20<=0 & 0<=p20]]] & [p116<=0 & 0<=p116]] | [[[p251<=0 & 0<=p251] & [p125<=1 & 1<=p125]] | [[p163<=0 & 0<=p163] & [p72<=1 & 1<=p72]]]] | [[p2<=0 & 0<=p2] | [p205<=1 & 1<=p205]]]]]
normalized: EX [~ [E [true U ~ [[[[p205<=1 & 1<=p205] | [p2<=0 & 0<=p2]] | [[[[p72<=1 & 1<=p72] & [p163<=0 & 0<=p163]] | [[p125<=1 & 1<=p125] & [p251<=0 & 0<=p251]]] | [[p116<=0 & 0<=p116] & ~ [EG [~ [[[p20<=0 & 0<=p20] & [p116<=1 & 1<=p116]]]]]]]]]]]]
abstracting: (1<=p116)
states: 67,784,071,704 (10)
abstracting: (p116<=1)
states: 1,737,966,874,788 (12)
abstracting: (0<=p20)
states: 1,737,966,874,788 (12)
abstracting: (p20<=0)
states: 1,737,966,874,188 (12)
...............
before gc: list nodes free: 946905
after gc: idd nodes used:1471020, unused:62528980; list nodes free:287038804
.MC time: 3m36.000sec
checking: [EX [AX [[[p174<=1 & 1<=p174] & [[p201<=0 & 0<=p201] | [p33<=1 & 1<=p33]]]]] | AX [EF [[EF [[p44<=1 & 1<=p44]] & [E [[[p67<=0 & 0<=p67] | [p168<=1 & 1<=p168]] U [[p168<=0 & 0<=p168] | [p189<=1 & 1<=p189]]] & ~ [[p140<=1 & 1<=p140]]]]]]]
normalized: [~ [EX [~ [E [true U [[~ [[p140<=1 & 1<=p140]] & E [[[p168<=1 & 1<=p168] | [p67<=0 & 0<=p67]] U [[p189<=1 & 1<=p189] | [p168<=0 & 0<=p168]]]] & E [true U [p44<=1 & 1<=p44]]]]]]] | EX [~ [EX [~ [[[[p33<=1 & 1<=p33] | [p201<=0 & 0<=p201]] & [p174<=1 & 1<=p174]]]]]]]
abstracting: (1<=p174)
states: 70,474,438,416 (10)
abstracting: (p174<=1)
states: 1,737,966,874,788 (12)
abstracting: (0<=p201)
states: 1,737,966,874,788 (12)
abstracting: (p201<=0)
states: 1,725,664,857,060 (12)
abstracting: (1<=p33)
states: 70,474,438,416 (10)
abstracting: (p33<=1)
states: 1,737,966,874,788 (12)
..abstracting: (1<=p44)
states: 70,474,438,416 (10)
abstracting: (p44<=1)
states: 1,737,966,874,788 (12)
abstracting: (0<=p168)
states: 1,737,966,874,788 (12)
abstracting: (p168<=0)
states: 1,667,492,436,372 (12)
abstracting: (1<=p189)
states: 70,474,438,416 (10)
abstracting: (p189<=1)
states: 1,737,966,874,788 (12)
abstracting: (0<=p67)
states: 1,737,966,874,788 (12)
abstracting: (p67<=0)
states: 1,670,182,803,084 (12)
abstracting: (1<=p168)
states: 70,474,438,416 (10)
abstracting: (p168<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p140)
states: 70,474,438,416 (10)
abstracting: (p140<=1)
states: 1,737,966,874,788 (12)
.-> the formula is TRUE
FORMULA AutonomousCar-PT-06b-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m 5.000sec
checking: E [E [[A [~ [[p151<=1 & 1<=p151]] U [~ [[p70<=0 & 0<=p70]] & ~ [[[p96<=0 & 0<=p96] | [p110<=1 & 1<=p110]]]]] | [E [[p192<=1 & 1<=p192] U [[p153<=0 & 0<=p153] | [p251<=1 & 1<=p251]]] | ~ [[p168<=1 & 1<=p168]]]] U EG [AF [[[p136<=0 & 0<=p136] | [p109<=1 & 1<=p109]]]]] U [[p0<=0 & 0<=p0] | [p203<=1 & 1<=p203]]]
normalized: E [E [[[~ [[p168<=1 & 1<=p168]] | E [[p192<=1 & 1<=p192] U [[p251<=1 & 1<=p251] | [p153<=0 & 0<=p153]]]] | [~ [EG [~ [[~ [[[p110<=1 & 1<=p110] | [p96<=0 & 0<=p96]]] & ~ [[p70<=0 & 0<=p70]]]]]] & ~ [E [~ [[~ [[[p110<=1 & 1<=p110] | [p96<=0 & 0<=p96]]] & ~ [[p70<=0 & 0<=p70]]]] U [[p151<=1 & 1<=p151] & ~ [[~ [[[p110<=1 & 1<=p110] | [p96<=0 & 0<=p96]]] & ~ [[p70<=0 & 0<=p70]]]]]]]]] U EG [~ [EG [~ [[[p109<=1 & 1<=p109] | [p136<=0 & 0<=p136]]]]]]] U [[p203<=1 & 1<=p203] | [p0<=0 & 0<=p0]]]
abstracting: (0<=p0)
states: 1,737,966,874,788 (12)
abstracting: (p0<=0)
states: 1,737,966,874,787 (12)
abstracting: (1<=p203)
states: 12,302,017,728 (10)
abstracting: (p203<=1)
states: 1,737,966,874,788 (12)
abstracting: (0<=p136)
states: 1,737,966,874,788 (12)
abstracting: (p136<=0)
states: 1,650,497,468,844 (12)
abstracting: (1<=p109)
states: 95,258,633,992 (10)
abstracting: (p109<=1)
states: 1,737,966,874,788 (12)
...........
before gc: list nodes free: 5314379
after gc: idd nodes used:1538645, unused:62461355; list nodes free:286720933
.............MC time: 3m18.002sec
checking: A [[[[~ [[EF [[[p221<=0 & 0<=p221] | [p35<=1 & 1<=p35]]] & EX [[p160<=1 & 1<=p160]]]] | EG [AX [[p13<=1 & 1<=p13]]]] & [E [[[p95<=0 & 0<=p95] | [p206<=1 & 1<=p206]] U [[p27<=0 & 0<=p27] | [p163<=1 & 1<=p163]]] | ~ [EG [EX [[p205<=1 & 1<=p205]]]]]] & ~ [EG [A [[p74<=1 & 1<=p74] U [[p39<=0 & 0<=p39] | [p220<=1 & 1<=p220]]]]]] U AF [[E [AG [[[p192<=0 & 0<=p192] | [p215<=1 & 1<=p215]]] U AG [[p111<=0 & 0<=p111]]] & ~ [[p177<=1 & 1<=p177]]]]]
normalized: [~ [EG [EG [~ [[~ [[p177<=1 & 1<=p177]] & E [~ [E [true U ~ [[[p215<=1 & 1<=p215] | [p192<=0 & 0<=p192]]]]] U ~ [E [true U ~ [[p111<=0 & 0<=p111]]]]]]]]]] & ~ [E [EG [~ [[~ [[p177<=1 & 1<=p177]] & E [~ [E [true U ~ [[[p215<=1 & 1<=p215] | [p192<=0 & 0<=p192]]]]] U ~ [E [true U ~ [[p111<=0 & 0<=p111]]]]]]]] U [~ [[~ [EG [[~ [EG [~ [[[p220<=1 & 1<=p220] | [p39<=0 & 0<=p39]]]]] & ~ [E [~ [[[p220<=1 & 1<=p220] | [p39<=0 & 0<=p39]]] U [~ [[p74<=1 & 1<=p74]] & ~ [[[p220<=1 & 1<=p220] | [p39<=0 & 0<=p39]]]]]]]]] & [[~ [EG [EX [[p205<=1 & 1<=p205]]]] | E [[[p206<=1 & 1<=p206] | [p95<=0 & 0<=p95]] U [[p163<=1 & 1<=p163] | [p27<=0 & 0<=p27]]]] & [EG [~ [EX [~ [[p13<=1 & 1<=p13]]]]] | ~ [[EX [[p160<=1 & 1<=p160]] & E [true U [[p35<=1 & 1<=p35] | [p221<=0 & 0<=p221]]]]]]]]] & EG [~ [[~ [[p177<=1 & 1<=p177]] & E [~ [E [true U ~ [[[p215<=1 & 1<=p215] | [p192<=0 & 0<=p192]]]]] U ~ [E [true U ~ [[p111<=0 & 0<=p111]]]]]]]]]]]]
abstracting: (0<=p111)
states: 1,737,966,874,788 (12)
abstracting: (p111<=0)
states: 1,670,182,803,084 (12)
abstracting: (0<=p192)
states: 1,737,966,874,788 (12)
abstracting: (p192<=0)
states: 1,646,768,089,452 (12)
abstracting: (1<=p215)
states: 146,453,055,120 (11)
abstracting: (p215<=1)
states: 1,737,966,874,788 (12)
abstracting: (1<=p177)
states: 70,474,438,416 (10)
abstracting: (p177<=1)
states: 1,737,966,874,788 (12)
before gc: list nodes free: 8405135
after gc: idd nodes used:1541000, unused:62459000; list nodes free:286622822
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6092308 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096680 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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.001sec
139319 142078 148911 148290 151531 158012 153527 153691 159651 160673 171553 175247 171427 170085 167161 170037 175320 197051 183937 184917 202880 206859 225928 212849 210646 207712 218998 204865 215277 200150 197206 193113 200650 202309 216695 211516 212354 212686 213898 215435 213126 211883 257224 256912 268306 263127 263902 263326 264624 259655 251426 250365 245421 241818 246299 236400 232085 232930 229114 227499 223313 218523 214963
iterations count:6340854 (13636), effective:124220 (267)
initing FirstDep: 0m 0.000sec
net_ddint.h:600: Timeout: after 225 sec
108519 110663 116577 217421 221352 223829
iterations count:624969 (1344), effective:16479 (35)
net_ddint.h:600: Timeout: after 217 sec
112835 110789 111037 100886 213285 212547 211949 199417
iterations count:840778 (1808), effective:26379 (56)
net_ddint.h:600: Timeout: after 199 sec
iterations count:468 (1), effective:1 (0)
iterations count:465 (1), effective:0 (0)
iterations count:470 (1), effective:2 (0)
iterations count:465 (1), effective:0 (0)
iterations count:482 (1), effective:7 (0)
134482 197044 203490 213772 222949 220579
iterations count:626244 (1346), effective:18303 (39)
iterations count:465 (1), effective:0 (0)
81560 85792 86197 187364 189427 198319
iterations count:648108 (1393), effective:18427 (39)
net_ddint.h:600: Timeout: after 246 sec
net_ddint.h:600: Timeout: after 215 sec
114074 115703 112166 220358 224918 222697
iterations count:617565 (1328), effective:17512 (37)
iterations count:469 (1), effective:1 (0)
iterations count:469 (1), effective:1 (0)
net_ddint.h:600: Timeout: after 197 sec
100579 116139 111508 222968 225538 223479
iterations count:612818 (1317), effective:18000 (38)
iterations count:3800 (8), effective:127 (0)
134499 129362
iterations count:210525 (452), effective:6347 (13)
net_ddint.h:600: Timeout: after 169 sec
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="AutonomousCar-PT-06b"
export BK_EXAMINATION="CTLCardinality"
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 AutonomousCar-PT-06b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-oct2-167813599300617"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;