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-167813599300601.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-05b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599300601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 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:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 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 159K 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-05b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678699485093

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-05b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:24:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:24:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:24:48] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2023-03-13 09:24:48] [INFO ] Transformed 255 places.
[2023-03-13 09:24:48] [INFO ] Transformed 490 transitions.
[2023-03-13 09:24:48] [INFO ] Found NUPN structural information;
[2023-03-13 09:24:48] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 85 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 238 transition count 473
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 238 transition count 473
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 235 transition count 470
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 235 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 234 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 234 transition count 469
Applied a total of 42 rules in 68 ms. Remains 234 /255 variables (removed 21) and now considering 469/490 (removed 21) transitions.
// Phase 1: matrix 469 rows 234 cols
[2023-03-13 09:24:48] [INFO ] Computed 10 place invariants in 21 ms
[2023-03-13 09:24:49] [INFO ] Implicit Places using invariants in 525 ms returned []
[2023-03-13 09:24:49] [INFO ] Invariant cache hit.
[2023-03-13 09:24:50] [INFO ] Implicit Places using invariants and state equation in 1404 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2023-03-13 09:24:50] [INFO ] Invariant cache hit.
[2023-03-13 09:24:50] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 234/255 places, 469/490 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2517 ms. Remains : 234/255 places, 469/490 transitions.
Support contains 85 out of 234 places after structural reductions.
[2023-03-13 09:24:51] [INFO ] Flatten gal took : 88 ms
[2023-03-13 09:24:51] [INFO ] Flatten gal took : 56 ms
[2023-03-13 09:24:51] [INFO ] Input system was already deterministic with 469 transitions.
Support contains 77 out of 234 places (down from 85) after GAL structural reductions.
FORMULA AutonomousCar-PT-05b-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 45 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 52) seen :41
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :6
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-13 09:24:52] [INFO ] Invariant cache hit.
[2023-03-13 09:24:52] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-13 09:24:52] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-13 09:24:53] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-13 09:24:53] [INFO ] Deduced a trap composed of 17 places in 585 ms of which 38 ms to minimize.
[2023-03-13 09:24:54] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 1 ms to minimize.
[2023-03-13 09:24:54] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 26 ms to minimize.
[2023-03-13 09:24:54] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 13 ms to minimize.
[2023-03-13 09:24:54] [INFO ] Deduced a trap composed of 46 places in 159 ms of which 1 ms to minimize.
[2023-03-13 09:24:55] [INFO ] Deduced a trap composed of 43 places in 289 ms of which 1 ms to minimize.
[2023-03-13 09:24:55] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
[2023-03-13 09:24:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2057 ms
[2023-03-13 09:24:55] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 2 ms to minimize.
[2023-03-13 09:24:55] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 0 ms to minimize.
[2023-03-13 09:24:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 379 ms
[2023-03-13 09:24:55] [INFO ] Deduced a trap composed of 31 places in 152 ms of which 1 ms to minimize.
[2023-03-13 09:24:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-13 09:24:55] [INFO ] After 3149ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 149 ms.
[2023-03-13 09:24:56] [INFO ] After 3539ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 64 ms.
Support contains 16 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 469/469 transitions.
Graph (trivial) has 192 edges and 234 vertex of which 4 / 234 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 738 edges and 232 vertex of which 228 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 77 rules applied. Total rules applied 79 place count 228 transition count 386
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 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 94 rules applied. Total rules applied 173 place count 151 transition count 369
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 14 rules applied. Total rules applied 187 place count 143 transition count 363
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 193 place count 137 transition count 363
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 193 place count 137 transition count 357
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 205 place count 131 transition count 357
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 218 place count 118 transition count 344
Iterating global reduction 4 with 13 rules applied. Total rules applied 231 place count 118 transition count 344
Ensure Unique test removed 102 transitions
Reduce isomorphic transitions removed 102 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 103 rules applied. Total rules applied 334 place count 118 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 335 place count 117 transition count 241
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 335 place count 117 transition count 239
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 339 place count 115 transition count 239
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 343 place count 111 transition count 223
Iterating global reduction 6 with 4 rules applied. Total rules applied 347 place count 111 transition count 223
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 419 place count 75 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 420 place count 75 transition count 186
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 427 place count 68 transition count 146
Iterating global reduction 7 with 7 rules applied. Total rules applied 434 place count 68 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 435 place count 68 transition count 145
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 437 place count 67 transition count 144
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 439 place count 67 transition count 142
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 445 place count 67 transition count 136
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 451 place count 61 transition count 136
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 452 place count 61 transition count 135
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 454 place count 61 transition count 135
Applied a total of 454 rules in 91 ms. Remains 61 /234 variables (removed 173) and now considering 135/469 (removed 334) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 61/234 places, 135/469 transitions.
Incomplete random walk after 10000 steps, including 520 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 93 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 135 rows 61 cols
[2023-03-13 09:24:56] [INFO ] Computed 8 place invariants in 5 ms
[2023-03-13 09:24:56] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 09:24:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 09:24:56] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 09:24:56] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-13 09:24:56] [INFO ] After 23ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 09:24:57] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2023-03-13 09:24:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2023-03-13 09:24:57] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 09:24:57] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 26 ms.
Support contains 15 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 135/135 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 134
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 134
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 60 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 59 transition count 133
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 5 place count 59 transition count 132
Applied a total of 5 rules in 15 ms. Remains 59 /61 variables (removed 2) and now considering 132/135 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 59/61 places, 132/135 transitions.
Incomplete random walk after 10000 steps, including 484 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 132 rows 59 cols
[2023-03-13 09:24:57] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 09:24:57] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 09:24:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 28 ms returned sat
[2023-03-13 09:24:57] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 09:24:57] [INFO ] State equation strengthened by 53 read => feed constraints.
[2023-03-13 09:24:57] [INFO ] After 19ms SMT Verify possible using 53 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 09:24:57] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2023-03-13 09:24:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 82 ms
[2023-03-13 09:24:57] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 09:24:57] [INFO ] After 258ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 11 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 132/132 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 0 with 3 rules applied. Total rules applied 3 place count 59 transition count 129
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 57 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 56 transition count 128
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 3 with 2 rules applied. Total rules applied 9 place count 55 transition count 127
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 55 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11 place count 54 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 12 place count 53 transition count 125
Applied a total of 12 rules in 11 ms. Remains 53 /59 variables (removed 6) and now considering 125/132 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 53/59 places, 125/132 transitions.
Incomplete random walk after 10000 steps, including 400 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Finished probabilistic random walk after 130502 steps, run visited all 2 properties in 198 ms. (steps per millisecond=659 )
Probabilistic random walk after 130502 steps, saw 24002 distinct states, run finished after 198 ms. (steps per millisecond=659 ) properties seen :2
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 28 ms
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 27 ms
[2023-03-13 09:24:58] [INFO ] Input system was already deterministic with 469 transitions.
Computed a total of 45 stabilizing places and 46 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 213 transition count 448
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 213 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 142 place count 213 transition count 348
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 146 place count 209 transition count 344
Iterating global reduction 1 with 4 rules applied. Total rules applied 150 place count 209 transition count 344
Applied a total of 150 rules in 10 ms. Remains 209 /234 variables (removed 25) and now considering 344/469 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 209/234 places, 344/469 transitions.
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:24:58] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 214 transition count 449
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 214 transition count 449
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 209 transition count 444
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 209 transition count 444
Applied a total of 50 rules in 12 ms. Remains 209 /234 variables (removed 25) and now considering 444/469 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 209/234 places, 444/469 transitions.
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:24:58] [INFO ] Input system was already deterministic with 444 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 212 transition count 447
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 212 transition count 447
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 144 place count 212 transition count 347
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 149 place count 207 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 154 place count 207 transition count 342
Applied a total of 154 rules in 23 ms. Remains 207 /234 variables (removed 27) and now considering 342/469 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 207/234 places, 342/469 transitions.
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 25 ms
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 22 ms
[2023-03-13 09:24:58] [INFO ] Input system was already deterministic with 342 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 213 transition count 448
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 213 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 142 place count 213 transition count 348
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 146 place count 209 transition count 344
Iterating global reduction 1 with 4 rules applied. Total rules applied 150 place count 209 transition count 344
Applied a total of 150 rules in 12 ms. Remains 209 /234 variables (removed 25) and now considering 344/469 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 209/234 places, 344/469 transitions.
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:24:58] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 212 transition count 447
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 212 transition count 447
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 144 place count 212 transition count 347
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 149 place count 207 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 154 place count 207 transition count 342
Applied a total of 154 rules in 32 ms. Remains 207 /234 variables (removed 27) and now considering 342/469 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 207/234 places, 342/469 transitions.
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 31 ms
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 34 ms
[2023-03-13 09:24:58] [INFO ] Input system was already deterministic with 342 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 214 transition count 449
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 214 transition count 449
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 140 place count 214 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 144 place count 210 transition count 345
Iterating global reduction 1 with 4 rules applied. Total rules applied 148 place count 210 transition count 345
Applied a total of 148 rules in 10 ms. Remains 210 /234 variables (removed 24) and now considering 345/469 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 210/234 places, 345/469 transitions.
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:24:58] [INFO ] Input system was already deterministic with 345 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Graph (trivial) has 198 edges and 234 vertex of which 2 / 234 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 232 transition count 378
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 112 rules applied. Total rules applied 202 place count 143 transition count 355
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 217 place count 130 transition count 353
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 219 place count 128 transition count 353
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 219 place count 128 transition count 344
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 237 place count 119 transition count 344
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 248 place count 108 transition count 333
Iterating global reduction 4 with 11 rules applied. Total rules applied 259 place count 108 transition count 333
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 359 place count 108 transition count 233
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 359 place count 108 transition count 232
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 361 place count 107 transition count 232
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 364 place count 104 transition count 221
Iterating global reduction 5 with 3 rules applied. Total rules applied 367 place count 104 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 368 place count 104 transition count 220
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 6 with 56 rules applied. Total rules applied 424 place count 76 transition count 192
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 425 place count 76 transition count 191
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 429 place count 72 transition count 169
Iterating global reduction 7 with 4 rules applied. Total rules applied 433 place count 72 transition count 169
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 with 4 rules applied. Total rules applied 437 place count 72 transition count 165
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 439 place count 70 transition count 165
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 9 with 2 rules applied. Total rules applied 441 place count 69 transition count 164
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 443 place count 69 transition count 162
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 444 place count 69 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 445 place count 68 transition count 161
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 11 with 4 rules applied. Total rules applied 449 place count 68 transition count 161
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 451 place count 66 transition count 159
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 452 place count 65 transition count 159
Applied a total of 452 rules in 53 ms. Remains 65 /234 variables (removed 169) and now considering 159/469 (removed 310) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 65/234 places, 159/469 transitions.
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:24:58] [INFO ] Input system was already deterministic with 159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 215 transition count 450
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 215 transition count 450
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 138 place count 215 transition count 350
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 143 place count 210 transition count 345
Iterating global reduction 1 with 5 rules applied. Total rules applied 148 place count 210 transition count 345
Applied a total of 148 rules in 21 ms. Remains 210 /234 variables (removed 24) and now considering 345/469 (removed 124) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 210/234 places, 345/469 transitions.
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 23 ms
[2023-03-13 09:24:58] [INFO ] Flatten gal took : 21 ms
[2023-03-13 09:24:59] [INFO ] Input system was already deterministic with 345 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 213 transition count 448
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 213 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 142 place count 213 transition count 348
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 146 place count 209 transition count 344
Iterating global reduction 1 with 4 rules applied. Total rules applied 150 place count 209 transition count 344
Applied a total of 150 rules in 11 ms. Remains 209 /234 variables (removed 25) and now considering 344/469 (removed 125) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 209/234 places, 344/469 transitions.
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:24:59] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 215 transition count 450
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 215 transition count 450
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 138 place count 215 transition count 350
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 142 place count 211 transition count 346
Iterating global reduction 1 with 4 rules applied. Total rules applied 146 place count 211 transition count 346
Applied a total of 146 rules in 9 ms. Remains 211 /234 variables (removed 23) and now considering 346/469 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 211/234 places, 346/469 transitions.
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:24:59] [INFO ] Input system was already deterministic with 346 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Graph (trivial) has 216 edges and 234 vertex of which 4 / 234 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 94 transitions
Trivial Post-agglo rules discarded 94 transitions
Performed 94 trivial Post agglomeration. Transition count delta: 94
Iterating post reduction 0 with 94 rules applied. Total rules applied 95 place count 231 transition count 372
Reduce places removed 94 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 125 rules applied. Total rules applied 220 place count 137 transition count 341
Reduce places removed 18 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 21 rules applied. Total rules applied 241 place count 119 transition count 338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 244 place count 116 transition count 338
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 244 place count 116 transition count 332
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 256 place count 110 transition count 332
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 267 place count 99 transition count 321
Iterating global reduction 4 with 11 rules applied. Total rules applied 278 place count 99 transition count 321
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 378 place count 99 transition count 221
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 378 place count 99 transition count 220
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 380 place count 98 transition count 220
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 383 place count 95 transition count 209
Iterating global reduction 5 with 3 rules applied. Total rules applied 386 place count 95 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 4 rules applied. Total rules applied 390 place count 95 transition count 205
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 392 place count 93 transition count 205
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 452 place count 63 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 453 place count 63 transition count 174
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 459 place count 57 transition count 139
Iterating global reduction 8 with 6 rules applied. Total rules applied 465 place count 57 transition count 139
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 8 with 2 rules applied. Total rules applied 467 place count 57 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 468 place count 56 transition count 137
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 470 place count 55 transition count 136
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 471 place count 55 transition count 135
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 473 place count 55 transition count 135
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 475 place count 53 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 476 place count 52 transition count 133
Applied a total of 476 rules in 47 ms. Remains 52 /234 variables (removed 182) and now considering 133/469 (removed 336) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 52/234 places, 133/469 transitions.
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:24:59] [INFO ] Input system was already deterministic with 133 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Graph (trivial) has 178 edges and 234 vertex of which 4 / 234 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.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 232 transition count 396
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 1 with 84 rules applied. Total rules applied 156 place count 161 transition count 383
Reduce places removed 6 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 17 rules applied. Total rules applied 173 place count 155 transition count 372
Reduce places removed 11 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 13 rules applied. Total rules applied 186 place count 144 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 187 place count 143 transition count 370
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 187 place count 143 transition count 364
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 199 place count 137 transition count 364
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 209 place count 127 transition count 354
Iterating global reduction 5 with 10 rules applied. Total rules applied 219 place count 127 transition count 354
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 5 with 3 rules applied. Total rules applied 222 place count 127 transition count 351
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 223 place count 126 transition count 351
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 223 place count 126 transition count 350
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 225 place count 125 transition count 350
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 227 place count 123 transition count 339
Iterating global reduction 7 with 2 rules applied. Total rules applied 229 place count 123 transition count 339
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 295 place count 90 transition count 306
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 296 place count 90 transition count 305
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 301 place count 85 transition count 251
Iterating global reduction 8 with 5 rules applied. Total rules applied 306 place count 85 transition count 251
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 308 place count 84 transition count 250
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 314 place count 84 transition count 250
Applied a total of 314 rules in 43 ms. Remains 84 /234 variables (removed 150) and now considering 250/469 (removed 219) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 84/234 places, 250/469 transitions.
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:24:59] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 212 transition count 447
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 212 transition count 447
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 144 place count 212 transition count 347
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 149 place count 207 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 154 place count 207 transition count 342
Applied a total of 154 rules in 10 ms. Remains 207 /234 variables (removed 27) and now considering 342/469 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 207/234 places, 342/469 transitions.
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:24:59] [INFO ] Input system was already deterministic with 342 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 213 transition count 448
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 213 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 142 place count 213 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 147 place count 208 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 152 place count 208 transition count 343
Applied a total of 152 rules in 8 ms. Remains 208 /234 variables (removed 26) and now considering 343/469 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 208/234 places, 343/469 transitions.
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:24:59] [INFO ] Input system was already deterministic with 343 transitions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 469/469 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 213 transition count 448
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 213 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 142 place count 213 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 147 place count 208 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 152 place count 208 transition count 343
Applied a total of 152 rules in 23 ms. Remains 208 /234 variables (removed 26) and now considering 343/469 (removed 126) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 208/234 places, 343/469 transitions.
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 17 ms
[2023-03-13 09:24:59] [INFO ] Input system was already deterministic with 343 transitions.
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:24:59] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:24:59] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 09:24:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 234 places, 469 transitions and 2485 arcs took 3 ms.
Total runtime 11709 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: 234 NrTr: 469 NrArc: 2485)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.021sec

net check time: 0m 0.000sec

init dd package: 0m 3.142sec


RS generation: 0m22.265sec


-> reachability set: #nodes 91370 (9.1e+04) #states 90,399,799,416 (10)



starting MCC model checker
--------------------------

checking: [AX [EF [[1<=p57 & p57<=1]]] | AX [AX [AG [EX [0<=0]]]]]
normalized: [~ [EX [EX [E [true U ~ [EX [0<=0]]]]]] | ~ [EX [~ [E [true U [1<=p57 & p57<=1]]]]]]

abstracting: (p57<=1)
states: 90,399,799,416 (10)
abstracting: (1<=p57)
states: 153,600 (5)
.abstracting: (0<=0)
states: 90,399,799,416 (10)
...-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m41.333sec

checking: AG [EX [[0<=p69 & p69<=0]]]
normalized: ~ [E [true U ~ [EX [[0<=p69 & p69<=0]]]]]

abstracting: (p69<=0)
states: 87,039,931,296 (10)
abstracting: (0<=p69)
states: 90,399,799,416 (10)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-05b-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.740sec

checking: EF [EX [EG [~ [E [[0<=p87 & p87<=0] U [p114<=1 & 1<=p114]]]]]]
normalized: E [true U EX [EG [~ [E [[0<=p87 & p87<=0] U [p114<=1 & 1<=p114]]]]]]

abstracting: (1<=p114)
states: 3,359,868,120 (9)
abstracting: (p114<=1)
states: 90,399,799,416 (10)
abstracting: (p87<=0)
states: 85,923,120,336 (10)
abstracting: (0<=p87)
states: 90,399,799,416 (10)
...................
before gc: list nodes free: 238587

after gc: idd nodes used:603707, unused:63396293; list nodes free:288863668
...............................................
EG iterations: 66
.-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m34.183sec

checking: AG [AF [[[[1<=p38 & p38<=1] | [0<=p184 & p184<=0]] | EX [AG [[0<=p3 & p3<=0]]]]]]
normalized: ~ [E [true U EG [~ [[EX [~ [E [true U ~ [[0<=p3 & p3<=0]]]]] | [[0<=p184 & p184<=0] | [1<=p38 & p38<=1]]]]]]]

abstracting: (p38<=1)
states: 90,399,799,416 (10)
abstracting: (1<=p38)
states: 3,669,983,415 (9)
abstracting: (p184<=0)
states: 89,711,574,648 (10)
abstracting: (0<=p184)
states: 90,399,799,416 (10)
abstracting: (p3<=0)
states: 66,430,476,836 (10)
abstracting: (0<=p3)
states: 90,399,799,416 (10)
.......
before gc: list nodes free: 2028142

after gc: idd nodes used:234281, unused:63765719; list nodes free:296755735
.........................
EG iterations: 31
-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.405sec

checking: EF [[AF [[p181<=1 & 1<=p181]] | EX [AG [AG [[~ [[p28<=0 & 0<=p28]] & ~ [[p122<=1 & 1<=p122]]]]]]]]
normalized: E [true U [EX [~ [E [true U E [true U ~ [[~ [[p122<=1 & 1<=p122]] & ~ [[p28<=0 & 0<=p28]]]]]]]] | ~ [EG [~ [[p181<=1 & 1<=p181]]]]]]

abstracting: (1<=p181)
states: 688,224,768 (8)
abstracting: (p181<=1)
states: 90,399,799,416 (10)
.........................................................................
EG iterations: 73
abstracting: (0<=p28)
states: 90,399,799,416 (10)
abstracting: (p28<=0)
states: 90,399,797,016 (10)
abstracting: (1<=p122)
states: 2,204,520,780 (9)
abstracting: (p122<=1)
states: 90,399,799,416 (10)
.-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m28.027sec

checking: EX [[AG [AF [[[p165<=0 & 0<=p165] & [p226<=1 & 1<=p226]]]] | AX [AX [[p187<=1 & 1<=p187]]]]]
normalized: EX [[~ [EX [EX [~ [[p187<=1 & 1<=p187]]]]] | ~ [E [true U EG [~ [[[p226<=1 & 1<=p226] & [p165<=0 & 0<=p165]]]]]]]]

abstracting: (0<=p165)
states: 90,399,799,416 (10)
abstracting: (p165<=0)
states: 86,909,258,901 (10)
abstracting: (1<=p226)
states: 3,024,909,972 (9)
abstracting: (p226<=1)
states: 90,399,799,416 (10)
.....
before gc: list nodes free: 5149414

after gc: idd nodes used:612483, unused:63387517; list nodes free:295075803
...........
before gc: list nodes free: 8783806

after gc: idd nodes used:1628305, unused:62371695; list nodes free:290461629
....MC time: 5m19.071sec

checking: A [[p47<=1 & 1<=p47] U ~ [E [EX [0<=0] U ~ [EG [[[p87<=0 & 0<=p87] | [p46<=1 & 1<=p46]]]]]]]
normalized: [~ [EG [E [EX [0<=0] U ~ [EG [[[p46<=1 & 1<=p46] | [p87<=0 & 0<=p87]]]]]]] & ~ [E [E [EX [0<=0] U ~ [EG [[[p46<=1 & 1<=p46] | [p87<=0 & 0<=p87]]]]] U [~ [[p47<=1 & 1<=p47]] & E [EX [0<=0] U ~ [EG [[[p46<=1 & 1<=p46] | [p87<=0 & 0<=p87]]]]]]]]]

abstracting: (0<=p87)
states: 90,399,799,416 (10)
abstracting: (p87<=0)
states: 85,923,120,336 (10)
abstracting: (1<=p46)
states: 3,669,983,415 (9)
abstracting: (p46<=1)
states: 90,399,799,416 (10)
..............
before gc: list nodes free: 9344703

after gc: idd nodes used:553299, unused:63446701; list nodes free:295357371
.......................................................
EG iterations: 69
abstracting: (0<=0)
states: 90,399,799,416 (10)
.abstracting: (1<=p47)
states: 3,669,983,415 (9)
abstracting: (p47<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p87)
states: 90,399,799,416 (10)
abstracting: (p87<=0)
states: 85,923,120,336 (10)
abstracting: (1<=p46)
states: 3,669,983,415 (9)
abstracting: (p46<=1)
states: 90,399,799,416 (10)
.....................................................................
EG iterations: 69
abstracting: (0<=0)
states: 90,399,799,416 (10)
.abstracting: (0<=p87)
states: 90,399,799,416 (10)
abstracting: (p87<=0)
states: 85,923,120,336 (10)
abstracting: (1<=p46)
states: 3,669,983,415 (9)
abstracting: (p46<=1)
states: 90,399,799,416 (10)
.....................................................................
EG iterations: 69
abstracting: (0<=0)
states: 90,399,799,416 (10)
..
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-05b-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m15.398sec

checking: EF [[AX [[p195<=1 & 1<=p195]] | EG [[[p166<=0 & 0<=p166] & [p113<=1 & 1<=p113]]]]]
normalized: E [true U [EG [[[p113<=1 & 1<=p113] & [p166<=0 & 0<=p166]]] | ~ [EX [~ [[p195<=1 & 1<=p195]]]]]]

abstracting: (1<=p195)
states: 9,316,272,360 (9)
abstracting: (p195<=1)
states: 90,399,799,416 (10)
.abstracting: (0<=p166)
states: 90,399,799,416 (10)
abstracting: (p166<=0)
states: 85,554,194,421 (10)
abstracting: (1<=p113)
states: 4,476,525,480 (9)
abstracting: (p113<=1)
states: 90,399,799,416 (10)
........
before gc: list nodes free: 4485697

after gc: idd nodes used:407347, unused:63592653; list nodes free:295987098
.....................................................................
EG iterations: 77
-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m42.397sec

checking: AF [[A [AF [E [[[p88<=0 & 0<=p88] | [p22<=1 & 1<=p22]] U [[p26<=0 & 0<=p26] | [p41<=1 & 1<=p41]]]] U EX [0<=0]] & AF [EG [[0<=p59 & p59<=0]]]]]
normalized: ~ [EG [~ [[~ [EG [~ [EG [[0<=p59 & p59<=0]]]]] & [~ [EG [~ [EX [0<=0]]]] & ~ [E [~ [EX [0<=0]] U [EG [~ [E [[[p22<=1 & 1<=p22] | [p88<=0 & 0<=p88]] U [[p41<=1 & 1<=p41] | [p26<=0 & 0<=p26]]]]] & ~ [EX [0<=0]]]]]]]]]]

abstracting: (0<=0)
states: 90,399,799,416 (10)
.abstracting: (0<=p26)
states: 90,399,799,416 (10)
abstracting: (p26<=0)
states: 90,399,798,816 (10)
abstracting: (1<=p41)
states: 3,669,983,415 (9)
abstracting: (p41<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p88)
states: 90,399,799,416 (10)
abstracting: (p88<=0)
states: 90,399,645,816 (10)
abstracting: (1<=p22)
states: 600
abstracting: (p22<=1)
states: 90,399,799,416 (10)
.
EG iterations: 1
abstracting: (0<=0)
states: 90,399,799,416 (10)
.abstracting: (0<=0)
states: 90,399,799,416 (10)
..
EG iterations: 1
abstracting: (p59<=0)
states: 90,399,645,816 (10)
abstracting: (0<=p59)
states: 90,399,799,416 (10)

before gc: list nodes free: 10049778

after gc: idd nodes used:446825, unused:63553175; list nodes free:295810302
............................................
EG iterations: 44
................................................
EG iterations: 48
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 0.005sec

checking: EX [AG [[AX [E [[[p54<=0 & 0<=p54] | [p194<=1 & 1<=p194]] U [p5<=1 & 1<=p5]]] | [[p50<=0 & 0<=p50] | [p114<=1 & 1<=p114]]]]]
normalized: EX [~ [E [true U ~ [[[[p114<=1 & 1<=p114] | [p50<=0 & 0<=p50]] | ~ [EX [~ [E [[[p194<=1 & 1<=p194] | [p54<=0 & 0<=p54]] U [p5<=1 & 1<=p5]]]]]]]]]]

abstracting: (1<=p5)
states: 8,925,414,960 (9)
abstracting: (p5<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p54)
states: 90,399,799,416 (10)
abstracting: (p54<=0)
states: 86,729,816,001 (10)
abstracting: (1<=p194)
states: 9,316,272,360 (9)
abstracting: (p194<=1)
states: 90,399,799,416 (10)
.abstracting: (0<=p50)
states: 90,399,799,416 (10)
abstracting: (p50<=0)
states: 86,909,258,901 (10)
abstracting: (1<=p114)
states: 3,359,868,120 (9)
abstracting: (p114<=1)
states: 90,399,799,416 (10)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-05b-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 9.049sec

checking: EF [[EX [0<=0] & AX [[A [[[p145<=0 & 0<=p145] | [p73<=1 & 1<=p73]] U [p67<=0 & 0<=p67]] | [[[p174<=0 & 0<=p174] & [p215<=1 & 1<=p215]] | [p205<=0 & 0<=p205]]]]]]
normalized: E [true U [~ [EX [~ [[[[p205<=0 & 0<=p205] | [[p215<=1 & 1<=p215] & [p174<=0 & 0<=p174]]] | [~ [EG [~ [[p67<=0 & 0<=p67]]]] & ~ [E [~ [[p67<=0 & 0<=p67]] U [~ [[[p73<=1 & 1<=p73] | [p145<=0 & 0<=p145]]] & ~ [[p67<=0 & 0<=p67]]]]]]]]]] & EX [0<=0]]]

abstracting: (0<=0)
states: 90,399,799,416 (10)
.abstracting: (0<=p67)
states: 90,399,799,416 (10)
abstracting: (p67<=0)
states: 87,039,931,296 (10)
abstracting: (0<=p145)
states: 90,399,799,416 (10)
abstracting: (p145<=0)
states: 90,399,633,816 (10)
abstracting: (1<=p73)
states: 3,359,868,120 (9)
abstracting: (p73<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p67)
states: 90,399,799,416 (10)
abstracting: (p67<=0)
states: 87,039,931,296 (10)
abstracting: (0<=p67)
states: 90,399,799,416 (10)
abstracting: (p67<=0)
states: 87,039,931,296 (10)
.......................
before gc: list nodes free: 12013332

after gc: idd nodes used:732070, unused:63267930; list nodes free:294544079
......................................................
EG iterations: 77
abstracting: (0<=p174)
states: 90,399,799,416 (10)
abstracting: (p174<=0)
states: 90,399,632,016 (10)
abstracting: (1<=p215)
states: 3,024,909,972 (9)
abstracting: (p215<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p205)
states: 90,399,799,416 (10)
abstracting: (p205<=0)
states: 86,366,586,120 (10)
.-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m19.245sec

checking: EG [[[p31<=0 & 0<=p31] & [A [EG [[p116<=1 & 1<=p116]] U E [[p15<=1 & 1<=p15] U [p134<=0 & 0<=p134]]] | [EG [[p59<=1 & 1<=p59]] | [[p89<=0 & 0<=p89] & [[p134<=0 & 0<=p134] | [p161<=1 & 1<=p161]]]]]]]
normalized: EG [[[[[[[p161<=1 & 1<=p161] | [p134<=0 & 0<=p134]] & [p89<=0 & 0<=p89]] | EG [[p59<=1 & 1<=p59]]] | [~ [EG [~ [E [[p15<=1 & 1<=p15] U [p134<=0 & 0<=p134]]]]] & ~ [E [~ [E [[p15<=1 & 1<=p15] U [p134<=0 & 0<=p134]]] U [~ [EG [[p116<=1 & 1<=p116]]] & ~ [E [[p15<=1 & 1<=p15] U [p134<=0 & 0<=p134]]]]]]]] & [p31<=0 & 0<=p31]]]

abstracting: (0<=p31)
states: 90,399,799,416 (10)
abstracting: (p31<=0)
states: 90,399,645,816 (10)
abstracting: (0<=p134)
states: 90,399,799,416 (10)
abstracting: (p134<=0)
states: 86,683,719,436 (10)
abstracting: (1<=p15)
states: 14,595,735,588 (10)
abstracting: (p15<=1)
states: 90,399,799,416 (10)
abstracting: (1<=p116)
states: 3,359,868,120 (9)
abstracting: (p116<=1)
states: 90,399,799,416 (10)
.....................
before gc: list nodes free: 12059451

after gc: idd nodes used:996120, unused:63003880; list nodes free:293390042
........................................................
EG iterations: 77
abstracting: (0<=p134)
states: 90,399,799,416 (10)
abstracting: (p134<=0)
states: 86,683,719,436 (10)
abstracting: (1<=p15)
states: 14,595,735,588 (10)
abstracting: (p15<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p134)
states: 90,399,799,416 (10)
abstracting: (p134<=0)
states: 86,683,719,436 (10)
abstracting: (1<=p15)
states: 14,595,735,588 (10)
abstracting: (p15<=1)
states: 90,399,799,416 (10)
.......................
EG iterations: 23
abstracting: (1<=p59)
states: 153,600 (5)
abstracting: (p59<=1)
states: 90,399,799,416 (10)
..................................
EG iterations: 34
abstracting: (0<=p89)
states: 90,399,799,416 (10)
abstracting: (p89<=0)
states: 90,399,645,816 (10)
abstracting: (0<=p134)
states: 90,399,799,416 (10)
abstracting: (p134<=0)
states: 86,683,719,436 (10)
abstracting: (1<=p161)
states: 3,669,983,415 (9)
abstracting: (p161<=1)
states: 90,399,799,416 (10)
............................................
EG iterations: 44
-> the formula is FALSE

FORMULA AutonomousCar-PT-05b-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m22.107sec

checking: E [~ [[[AX [[p182<=1 & 1<=p182]] | ~ [[[p13<=0 & 0<=p13] | [p0<=1 & 1<=p0]]]] & ~ [AG [E [[[p181<=0 & 0<=p181] | [p226<=1 & 1<=p226]] U [p141<=1 & 1<=p141]]]]]] U [AX [[p23<=1 & 1<=p23]] & EG [[~ [[p191<=0 & 0<=p191]] | ~ [[[p147<=0 & 0<=p147] | [p228<=1 & 1<=p228]]]]]]]
normalized: E [~ [[E [true U ~ [E [[[p226<=1 & 1<=p226] | [p181<=0 & 0<=p181]] U [p141<=1 & 1<=p141]]]] & [~ [[[p0<=1 & 1<=p0] | [p13<=0 & 0<=p13]]] | ~ [EX [~ [[p182<=1 & 1<=p182]]]]]]] U [EG [[~ [[[p228<=1 & 1<=p228] | [p147<=0 & 0<=p147]]] | ~ [[p191<=0 & 0<=p191]]]] & ~ [EX [~ [[p23<=1 & 1<=p23]]]]]]

abstracting: (1<=p23)
states: 600
abstracting: (p23<=1)
states: 90,399,799,416 (10)
.abstracting: (0<=p191)
states: 90,399,799,416 (10)
abstracting: (p191<=0)
states: 89,711,574,648 (10)
abstracting: (0<=p147)
states: 90,399,799,416 (10)
abstracting: (p147<=0)
states: 86,729,816,001 (10)
abstracting: (1<=p228)
states: 8,482,640,460 (9)
abstracting: (p228<=1)
states: 90,399,799,416 (10)
........
before gc: list nodes free: 10829953

after gc: idd nodes used:998889, unused:63001111; list nodes free:293371708
.........................................
before gc: list nodes free: 9365808

after gc: idd nodes used:1116628, unused:62883372; list nodes free:292841379
............................
EG iterations: 77
abstracting: (1<=p182)
states: 688,224,768 (8)
abstracting: (p182<=1)
states: 90,399,799,416 (10)
.abstracting: (0<=p13)
states: 90,399,799,416 (10)
abstracting: (p13<=0)
states: 75,804,063,828 (10)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 90,399,799,416 (10)
abstracting: (1<=p141)
states: 3,716,079,980 (9)
abstracting: (p141<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p181)
states: 90,399,799,416 (10)
abstracting: (p181<=0)
states: 89,711,574,648 (10)
abstracting: (1<=p226)
states: 3,024,909,972 (9)
abstracting: (p226<=1)
states: 90,399,799,416 (10)
-> the formula is FALSE

FORMULA AutonomousCar-PT-05b-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m49.566sec

checking: EG [[~ [E [[EG [[p82<=0 & 0<=p82]] | [EF [[p110<=1 & 1<=p110]] & [[p134<=0 & 0<=p134] | [[p91<=1 & 1<=p91] | [p66<=1 & 1<=p66]]]]] U [[[p188<=1 & 1<=p188] & [[p167<=0 & 0<=p167] | [p117<=1 & 1<=p117]]] | [p85<=1 & 1<=p85]]]] | [AF [[p83<=0 & 0<=p83]] & [[p128<=0 & 0<=p128] | [p113<=1 & 1<=p113]]]]]
normalized: EG [[[[[p113<=1 & 1<=p113] | [p128<=0 & 0<=p128]] & ~ [EG [~ [[p83<=0 & 0<=p83]]]]] | ~ [E [[[[[[p66<=1 & 1<=p66] | [p91<=1 & 1<=p91]] | [p134<=0 & 0<=p134]] & E [true U [p110<=1 & 1<=p110]]] | EG [[p82<=0 & 0<=p82]]] U [[p85<=1 & 1<=p85] | [[[p117<=1 & 1<=p117] | [p167<=0 & 0<=p167]] & [p188<=1 & 1<=p188]]]]]]]

abstracting: (1<=p188)
states: 688,224,768 (8)
abstracting: (p188<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p167)
states: 90,399,799,416 (10)
abstracting: (p167<=0)
states: 86,729,816,001 (10)
abstracting: (1<=p117)
states: 3,359,868,120 (9)
abstracting: (p117<=1)
states: 90,399,799,416 (10)
abstracting: (1<=p85)
states: 3,359,868,120 (9)
abstracting: (p85<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p82)
states: 90,399,799,416 (10)
abstracting: (p82<=0)
states: 85,923,273,936 (10)
.................
before gc: list nodes free: 8207499

after gc: idd nodes used:1674095, unused:62325905; list nodes free:290270003
............
before gc: list nodes free: 8468980

after gc: idd nodes used:1490902, unused:62509098; list nodes free:291152947
..MC time: 7m44.018sec

checking: A [EG [[[~ [[p215<=1 & 1<=p215]] | [[p207<=1 & 1<=p207] | [[[p116<=0 & 0<=p116] | [p102<=1 & 1<=p102]] & [[p71<=0 & 0<=p71] | [p128<=1 & 1<=p128]]]]] & [[EF [[[p0<=0 & 0<=p0] | [p151<=1 & 1<=p151]]] | [[p225<=0 & 0<=p225] | [p89<=1 & 1<=p89]]] | [[[p152<=0 & 0<=p152] | [p186<=1 & 1<=p186]] | [[p125<=1 & 1<=p125] | [E [[[p106<=0 & 0<=p106] | [p3<=1 & 1<=p3]] U [p42<=1 & 1<=p42]] & [[[p168<=0 & 0<=p168] | [p65<=1 & 1<=p65]] | [[p191<=0 & 0<=p191] | [p1<=1 & 1<=p1]]]]]]]]] U ~ [[A [[[p143<=0 & 0<=p143] | [p105<=1 & 1<=p105]] U EG [[[p225<=0 & 0<=p225] | [p147<=1 & 1<=p147]]]] | ~ [E [[[p4<=1 & 1<=p4] | ~ [[p138<=1 & 1<=p138]]] U [p62<=1 & 1<=p62]]]]]]
normalized: [~ [EG [[~ [E [[~ [[p138<=1 & 1<=p138]] | [p4<=1 & 1<=p4]] U [p62<=1 & 1<=p62]]] | [~ [EG [~ [EG [[[p147<=1 & 1<=p147] | [p225<=0 & 0<=p225]]]]]] & ~ [E [~ [EG [[[p147<=1 & 1<=p147] | [p225<=0 & 0<=p225]]]] U [~ [[[p105<=1 & 1<=p105] | [p143<=0 & 0<=p143]]] & ~ [EG [[[p147<=1 & 1<=p147] | [p225<=0 & 0<=p225]]]]]]]]]]] & ~ [E [[~ [E [[~ [[p138<=1 & 1<=p138]] | [p4<=1 & 1<=p4]] U [p62<=1 & 1<=p62]]] | [~ [EG [~ [EG [[[p147<=1 & 1<=p147] | [p225<=0 & 0<=p225]]]]]] & ~ [E [~ [EG [[[p147<=1 & 1<=p147] | [p225<=0 & 0<=p225]]]] U [~ [[[p105<=1 & 1<=p105] | [p143<=0 & 0<=p143]]] & ~ [EG [[[p147<=1 & 1<=p147] | [p225<=0 & 0<=p225]]]]]]]]] U [~ [EG [[[[[[[[[p1<=1 & 1<=p1] | [p191<=0 & 0<=p191]] | [[p65<=1 & 1<=p65] | [p168<=0 & 0<=p168]]] & E [[[p3<=1 & 1<=p3] | [p106<=0 & 0<=p106]] U [p42<=1 & 1<=p42]]] | [p125<=1 & 1<=p125]] | [[p186<=1 & 1<=p186] | [p152<=0 & 0<=p152]]] | [[[p89<=1 & 1<=p89] | [p225<=0 & 0<=p225]] | E [true U [[p151<=1 & 1<=p151] | [p0<=0 & 0<=p0]]]]] & [[[[[p128<=1 & 1<=p128] | [p71<=0 & 0<=p71]] & [[p102<=1 & 1<=p102] | [p116<=0 & 0<=p116]]] | [p207<=1 & 1<=p207]] | ~ [[p215<=1 & 1<=p215]]]]]] & [~ [E [[~ [[p138<=1 & 1<=p138]] | [p4<=1 & 1<=p4]] U [p62<=1 & 1<=p62]]] | [~ [EG [~ [EG [[[p147<=1 & 1<=p147] | [p225<=0 & 0<=p225]]]]]] & ~ [E [~ [EG [[[p147<=1 & 1<=p147] | [p225<=0 & 0<=p225]]]] U [~ [[[p105<=1 & 1<=p105] | [p143<=0 & 0<=p143]]] & ~ [EG [[[p147<=1 & 1<=p147] | [p225<=0 & 0<=p225]]]]]]]]]]]]]

abstracting: (0<=p225)
states: 90,399,799,416 (10)
abstracting: (p225<=0)
states: 87,374,889,444 (10)
abstracting: (1<=p147)
states: 3,669,983,415 (9)
abstracting: (p147<=1)
states: 90,399,799,416 (10)
.
EG iterations: 1
abstracting: (0<=p143)
states: 90,399,799,416 (10)
abstracting: (p143<=0)
states: 86,683,719,436 (10)
abstracting: (1<=p105)
states: 3,359,868,120 (9)
abstracting: (p105<=1)
states: 90,399,799,416 (10)
abstracting: (0<=p225)
states: 90,399,799,416 (10)
abstracting: (p225<=0)
states: 87,374,889,444 (10)
abstracting: (1<=p147)
states: 3,669,983,415 (9)
abstracting: (p147<=1)
states: 90,399,799,416 (10)
.
EG iterations: 1
abstracting: (0<=p225)
states: 90,399,799,416 (10)
abstracting: (p225<=0)
states: 87,374,889,444 (10)
abstracting: (1<=p147)
states: 3,669,983,415 (9)
abstracting: (p147<=1)
states: 90,399,799,416 (10)
.
EG iterations: 1
.................
before gc: list nodes free: 7710811

after gc: idd nodes used:1553754, unused:62446246; list nodes free:290841488
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6033684 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16095268 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:
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ 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

64425 91382 86437 79617 82737 81010 92749 95351
iterations count:867539 (1849), effective:27634 (58)

initing FirstDep: 0m 0.001sec


iterations count:508 (1), effective:16 (0)

iterations count:82003 (174), effective:2783 (5)

iterations count:82003 (174), effective:2783 (5)

iterations count:45083 (96), effective:888 (1)

iterations count:38196 (81), effective:922 (1)
76401
iterations count:160106 (341), effective:5001 (10)

iterations count:473 (1), effective:1 (0)

iterations count:469 (1), effective:0 (0)
63119
iterations count:122426 (261), effective:4293 (9)

net_ddint.h:600: Timeout: after 318 sec


iterations count:8625 (18), effective:160 (0)

iterations count:8625 (18), effective:160 (0)

iterations count:470 (1), effective:1 (0)

iterations count:8625 (18), effective:160 (0)

iterations count:85713 (182), effective:3035 (6)

iterations count:471 (1), effective:1 (0)
58916
iterations count:123488 (263), effective:4497 (9)
109135
iterations count:102330 (218), effective:3586 (7)

iterations count:484 (1), effective:3 (0)

iterations count:783 (1), effective:3 (0)

iterations count:783 (1), effective:3 (0)

iterations count:588 (1), effective:27 (0)

iterations count:783 (1), effective:3 (0)

iterations count:51843 (110), effective:1188 (2)

iterations count:51247 (109), effective:1119 (2)

net_ddint.h:600: Timeout: after 463 sec


iterations count:41154 (87), effective:881 (1)

net_ddint.h:600: Timeout: after 309 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-05b"
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-05b, 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-167813599300601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-05b.tgz
mv AutonomousCar-PT-05b 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;