About the Execution of Marcie+red for AutonomousCar-PT-04a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5682.840 | 15471.00 | 22107.00 | 15.20 | TTFFTFFFTFTFFFFT | 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-167813599200577.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-04a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200577
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 72K 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-04a-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-04a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678699227683
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-04a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:20:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:20:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:20:29] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-13 09:20:29] [INFO ] Transformed 49 places.
[2023-03-13 09:20:29] [INFO ] Transformed 193 transitions.
[2023-03-13 09:20:29] [INFO ] Found NUPN structural information;
[2023-03-13 09:20:29] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
Support contains 45 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Applied a total of 0 rules in 10 ms. Remains 49 /49 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-13 09:20:29] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 49 cols
[2023-03-13 09:20:29] [INFO ] Computed 9 place invariants in 5 ms
[2023-03-13 09:20:29] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-13 09:20:29] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2023-03-13 09:20:29] [INFO ] Invariant cache hit.
[2023-03-13 09:20:30] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-13 09:20:30] [INFO ] Implicit Places using invariants and state equation in 145 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 348 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/49 places, 118/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 363 ms. Remains : 48/49 places, 118/118 transitions.
Support contains 45 out of 48 places after structural reductions.
[2023-03-13 09:20:30] [INFO ] Flatten gal took : 43 ms
[2023-03-13 09:20:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-04a-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:20:30] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:20:30] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 40 out of 48 places (down from 45) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 562 resets, run finished after 264 ms. (steps per millisecond=37 ) properties (out of 51) seen :48
Incomplete Best-First random walk after 10001 steps, including 133 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 108 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-13 09:20:30] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 48 cols
[2023-03-13 09:20:30] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-13 09:20:30] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 09:20:30] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
FORMULA AutonomousCar-PT-04a-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:20:30] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:20:30] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:20:30] [INFO ] Input system was already deterministic with 118 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 44 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 44 transition count 102
Applied a total of 8 rules in 3 ms. Remains 44 /48 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 44/48 places, 102/118 transitions.
[2023-03-13 09:20:30] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:30] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:30] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 43 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 43 transition count 97
Applied a total of 10 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 97/118 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/48 places, 97/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 45 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 45 transition count 107
Applied a total of 6 rules in 1 ms. Remains 45 /48 variables (removed 3) and now considering 107/118 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/48 places, 107/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 45 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 45 transition count 107
Applied a total of 6 rules in 2 ms. Remains 45 /48 variables (removed 3) and now considering 107/118 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/48 places, 107/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 43 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 43 transition count 97
Applied a total of 10 rules in 1 ms. Remains 43 /48 variables (removed 5) and now considering 97/118 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 43/48 places, 97/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 44 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 44 transition count 102
Applied a total of 8 rules in 2 ms. Remains 44 /48 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/48 places, 102/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 45 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 45 transition count 103
Applied a total of 6 rules in 2 ms. Remains 45 /48 variables (removed 3) and now considering 103/118 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/48 places, 103/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 103 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 45 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 45 transition count 107
Applied a total of 6 rules in 2 ms. Remains 45 /48 variables (removed 3) and now considering 107/118 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/48 places, 107/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 44 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 44 transition count 102
Applied a total of 8 rules in 2 ms. Remains 44 /48 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/48 places, 102/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 118/118 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 0 with 5 rules applied. Total rules applied 5 place count 48 transition count 113
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 43 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 15 place count 38 transition count 92
Iterating global reduction 2 with 5 rules applied. Total rules applied 20 place count 38 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 35 transition count 89
Applied a total of 26 rules in 15 ms. Remains 35 /48 variables (removed 13) and now considering 89/118 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 35/48 places, 89/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 46 transition count 115
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 44 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 42 transition count 113
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 14 place count 37 transition count 92
Iterating global reduction 3 with 5 rules applied. Total rules applied 19 place count 37 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 24 place count 34 transition count 90
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 34 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 26 place count 33 transition count 89
Applied a total of 26 rules in 19 ms. Remains 33 /48 variables (removed 15) and now considering 89/118 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 33/48 places, 89/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 89 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 0 with 5 rules applied. Total rules applied 5 place count 46 transition count 113
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 42 transition count 113
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 14 place count 37 transition count 92
Iterating global reduction 2 with 5 rules applied. Total rules applied 19 place count 37 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 7 rules applied. Total rules applied 26 place count 33 transition count 89
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 27 place count 33 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 32 transition count 88
Applied a total of 28 rules in 9 ms. Remains 32 /48 variables (removed 16) and now considering 88/118 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 32/48 places, 88/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 44 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 44 transition count 102
Applied a total of 8 rules in 2 ms. Remains 44 /48 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/48 places, 102/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 118/118 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 48 transition count 115
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 45 transition count 115
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 10 place count 41 transition count 99
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 41 transition count 99
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 39 transition count 97
Applied a total of 18 rules in 8 ms. Remains 39 /48 variables (removed 9) and now considering 97/118 (removed 21) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 39/48 places, 97/118 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:20:31] [INFO ] Input system was already deterministic with 97 transitions.
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:20:31] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 09:20:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 118 transitions and 768 arcs took 2 ms.
Total runtime 1922 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: 48 NrTr: 118 NrArc: 768)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 2.784sec
RS generation: 0m 0.190sec
-> reachability set: #nodes 3652 (3.7e+03) #states 206,492 (5)
starting MCC model checker
--------------------------
checking: AF [EG [[p21<=1 & 1<=p21]]]
normalized: ~ [EG [~ [EG [[p21<=1 & 1<=p21]]]]]
abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p21<=1)
states: 206,492 (5)
.......
EG iterations: 7
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.203sec
checking: EG [[EF [AX [AF [[[p2<=0 & 0<=p2] | [p6<=1 & 1<=p6]]]]] | AX [1<=0]]]
normalized: EG [[~ [EX [~ [1<=0]]] | E [true U ~ [EX [EG [~ [[[p6<=1 & 1<=p6] | [p2<=0 & 0<=p2]]]]]]]]]
abstracting: (0<=p2)
states: 206,492 (5)
abstracting: (p2<=0)
states: 178,784 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
.........
EG iterations: 9
.abstracting: (1<=0)
states: 0
..
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.352sec
checking: AG [[EG [[p26<=0 & 0<=p26]] | AF [EX [[p9<=0 & 0<=p9]]]]]
normalized: ~ [E [true U ~ [[EG [[p26<=0 & 0<=p26]] | ~ [EG [~ [EX [[p9<=0 & 0<=p9]]]]]]]]]
abstracting: (0<=p9)
states: 206,492 (5)
abstracting: (p9<=0)
states: 178,988 (5)
..
EG iterations: 1
abstracting: (0<=p26)
states: 206,492 (5)
abstracting: (p26<=0)
states: 178,988 (5)
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.058sec
checking: AF [AG [AF [[[p27<=0 & 0<=p27] | [p22<=1 & 1<=p22]]]]]
normalized: ~ [EG [E [true U EG [~ [[[p22<=1 & 1<=p22] | [p27<=0 & 0<=p27]]]]]]]
abstracting: (0<=p27)
states: 206,492 (5)
abstracting: (p27<=0)
states: 178,988 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
............
EG iterations: 12
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.333sec
checking: E [AX [1<=0] U [AF [EG [~ [[1<=p24 & p24<=1]]]] & AX [[EF [EG [[p16<=0 & 0<=p16]]] | [[p43<=0 & 0<=p43] | [p24<=1 & 1<=p24]]]]]]
normalized: E [~ [EX [~ [1<=0]]] U [~ [EX [~ [[[[p43<=0 & 0<=p43] | [p24<=1 & 1<=p24]] | E [true U EG [[p16<=0 & 0<=p16]]]]]]] & ~ [EG [~ [EG [~ [[1<=p24 & p24<=1]]]]]]]]
abstracting: (p24<=1)
states: 206,492 (5)
abstracting: (1<=p24)
states: 26,832 (4)
.......
EG iterations: 7
..................................................
EG iterations: 50
abstracting: (0<=p16)
states: 206,492 (5)
abstracting: (p16<=0)
states: 178,988 (5)
.
EG iterations: 1
abstracting: (1<=p24)
states: 26,832 (4)
abstracting: (p24<=1)
states: 206,492 (5)
abstracting: (0<=p43)
states: 206,492 (5)
abstracting: (p43<=0)
states: 165,972 (5)
.abstracting: (1<=0)
states: 0
.-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.575sec
checking: [AF [[[[p38<=0 & 0<=p38] | [p13<=1 & 1<=p13]] & [AF [[p39<=0 & 0<=p39]] & AG [[p6<=0 & 0<=p6]]]]] & EF [EG [AG [[p27<=1 & 1<=p27]]]]]
normalized: [E [true U EG [~ [E [true U ~ [[p27<=1 & 1<=p27]]]]]] & ~ [EG [~ [[[~ [E [true U ~ [[p6<=0 & 0<=p6]]]] & ~ [EG [~ [[p39<=0 & 0<=p39]]]]] & [[p13<=1 & 1<=p13] | [p38<=0 & 0<=p38]]]]]]]
abstracting: (0<=p38)
states: 206,492 (5)
abstracting: (p38<=0)
states: 201,690 (5)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p13<=1)
states: 206,492 (5)
abstracting: (0<=p39)
states: 206,492 (5)
abstracting: (p39<=0)
states: 171,708 (5)
........
EG iterations: 8
abstracting: (0<=p6)
states: 206,492 (5)
abstracting: (p6<=0)
states: 167,847 (5)
..........
EG iterations: 10
abstracting: (1<=p27)
states: 27,504 (4)
abstracting: (p27<=1)
states: 206,492 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.585sec
checking: EG [AG [A [[p33<=1 & 1<=p33] U [AG [[[p21<=0 & 0<=p21] | [p30<=1 & 1<=p30]]] & [[p35<=0 & 0<=p35] | [p39<=1 & 1<=p39]]]]]]
normalized: EG [~ [E [true U ~ [[~ [EG [~ [[[[p39<=1 & 1<=p39] | [p35<=0 & 0<=p35]] & ~ [E [true U ~ [[[p30<=1 & 1<=p30] | [p21<=0 & 0<=p21]]]]]]]]] & ~ [E [~ [[[[p39<=1 & 1<=p39] | [p35<=0 & 0<=p35]] & ~ [E [true U ~ [[[p30<=1 & 1<=p30] | [p21<=0 & 0<=p21]]]]]]] U [~ [[p33<=1 & 1<=p33]] & ~ [[[[p39<=1 & 1<=p39] | [p35<=0 & 0<=p35]] & ~ [E [true U ~ [[[p30<=1 & 1<=p30] | [p21<=0 & 0<=p21]]]]]]]]]]]]]]]
abstracting: (0<=p21)
states: 206,492 (5)
abstracting: (p21<=0)
states: 171,670 (5)
abstracting: (1<=p30)
states: 27,504 (4)
abstracting: (p30<=1)
states: 206,492 (5)
abstracting: (0<=p35)
states: 206,492 (5)
abstracting: (p35<=0)
states: 171,670 (5)
abstracting: (1<=p39)
states: 34,784 (4)
abstracting: (p39<=1)
states: 206,492 (5)
abstracting: (1<=p33)
states: 27,504 (4)
abstracting: (p33<=1)
states: 206,492 (5)
abstracting: (0<=p21)
states: 206,492 (5)
abstracting: (p21<=0)
states: 171,670 (5)
abstracting: (1<=p30)
states: 27,504 (4)
abstracting: (p30<=1)
states: 206,492 (5)
abstracting: (0<=p35)
states: 206,492 (5)
abstracting: (p35<=0)
states: 171,670 (5)
abstracting: (1<=p39)
states: 34,784 (4)
abstracting: (p39<=1)
states: 206,492 (5)
abstracting: (0<=p21)
states: 206,492 (5)
abstracting: (p21<=0)
states: 171,670 (5)
abstracting: (1<=p30)
states: 27,504 (4)
abstracting: (p30<=1)
states: 206,492 (5)
abstracting: (0<=p35)
states: 206,492 (5)
abstracting: (p35<=0)
states: 171,670 (5)
abstracting: (1<=p39)
states: 34,784 (4)
abstracting: (p39<=1)
states: 206,492 (5)
........
EG iterations: 8
.
EG iterations: 1
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.315sec
checking: AX [[[EG [[p4<=1 & 1<=p4]] | [p28<=0 & 0<=p28]] | [[p13<=1 & 1<=p13] | [AF [[[p16<=0 & 0<=p16] & [p10<=1 & 1<=p10]]] & EG [[p4<=0 & 0<=p4]]]]]]
normalized: ~ [EX [~ [[[[EG [[p4<=0 & 0<=p4]] & ~ [EG [~ [[[p10<=1 & 1<=p10] & [p16<=0 & 0<=p16]]]]]] | [p13<=1 & 1<=p13]] | [[p28<=0 & 0<=p28] | EG [[p4<=1 & 1<=p4]]]]]]]
abstracting: (1<=p4)
states: 38,645 (4)
abstracting: (p4<=1)
states: 206,492 (5)
.............
EG iterations: 13
abstracting: (0<=p28)
states: 206,492 (5)
abstracting: (p28<=0)
states: 171,670 (5)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p13<=1)
states: 206,492 (5)
abstracting: (0<=p16)
states: 206,492 (5)
abstracting: (p16<=0)
states: 178,988 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (p10<=1)
states: 206,492 (5)
.......
EG iterations: 7
abstracting: (0<=p4)
states: 206,492 (5)
abstracting: (p4<=0)
states: 167,847 (5)
.........
EG iterations: 9
.-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.278sec
checking: A [~ [[[p27<=0 & 0<=p27] | [p18<=1 & 1<=p18]]] U AF [[EG [[[p14<=0 & 0<=p14] | [p42<=1 & 1<=p42]]] & [AX [[p30<=1 & 1<=p30]] | [[p0<=0 & 0<=p0] | [p39<=1 & 1<=p39]]]]]]
normalized: [~ [EG [EG [~ [[[[[p39<=1 & 1<=p39] | [p0<=0 & 0<=p0]] | ~ [EX [~ [[p30<=1 & 1<=p30]]]]] & EG [[[p42<=1 & 1<=p42] | [p14<=0 & 0<=p14]]]]]]]] & ~ [E [EG [~ [[[[[p39<=1 & 1<=p39] | [p0<=0 & 0<=p0]] | ~ [EX [~ [[p30<=1 & 1<=p30]]]]] & EG [[[p42<=1 & 1<=p42] | [p14<=0 & 0<=p14]]]]]] U [[[p18<=1 & 1<=p18] | [p27<=0 & 0<=p27]] & EG [~ [[[[[p39<=1 & 1<=p39] | [p0<=0 & 0<=p0]] | ~ [EX [~ [[p30<=1 & 1<=p30]]]]] & EG [[[p42<=1 & 1<=p42] | [p14<=0 & 0<=p14]]]]]]]]]]
abstracting: (0<=p14)
states: 206,492 (5)
abstracting: (p14<=0)
states: 171,670 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
....
EG iterations: 4
abstracting: (1<=p30)
states: 27,504 (4)
abstracting: (p30<=1)
states: 206,492 (5)
.abstracting: (0<=p0)
states: 206,492 (5)
abstracting: (p0<=0)
states: 206,491 (5)
abstracting: (1<=p39)
states: 34,784 (4)
abstracting: (p39<=1)
states: 206,492 (5)
..........
EG iterations: 10
abstracting: (0<=p27)
states: 206,492 (5)
abstracting: (p27<=0)
states: 178,988 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p18<=1)
states: 206,492 (5)
abstracting: (0<=p14)
states: 206,492 (5)
abstracting: (p14<=0)
states: 171,670 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
....
EG iterations: 4
abstracting: (1<=p30)
states: 27,504 (4)
abstracting: (p30<=1)
states: 206,492 (5)
.abstracting: (0<=p0)
states: 206,492 (5)
abstracting: (p0<=0)
states: 206,491 (5)
abstracting: (1<=p39)
states: 34,784 (4)
abstracting: (p39<=1)
states: 206,492 (5)
..........
EG iterations: 10
abstracting: (0<=p14)
states: 206,492 (5)
abstracting: (p14<=0)
states: 171,670 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
....
EG iterations: 4
abstracting: (1<=p30)
states: 27,504 (4)
abstracting: (p30<=1)
states: 206,492 (5)
.abstracting: (0<=p0)
states: 206,492 (5)
abstracting: (p0<=0)
states: 206,491 (5)
abstracting: (1<=p39)
states: 34,784 (4)
abstracting: (p39<=1)
states: 206,492 (5)
..........
EG iterations: 10
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-04a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.242sec
checking: E [EF [[[p43<=0 & 0<=p43] | [p18<=1 & 1<=p18]]] U AG [[[AF [[p9<=0 & 0<=p9]] & EX [[p30<=1 & 1<=p30]]] & [~ [EF [[p12<=1 & 1<=p12]]] & [[p30<=0 & 0<=p30] & ~ [AF [[p36<=0 & 0<=p36]]]]]]]]
normalized: E [E [true U [[p18<=1 & 1<=p18] | [p43<=0 & 0<=p43]]] U ~ [E [true U ~ [[[[EG [~ [[p36<=0 & 0<=p36]]] & [p30<=0 & 0<=p30]] & ~ [E [true U [p12<=1 & 1<=p12]]]] & [EX [[p30<=1 & 1<=p30]] & ~ [EG [~ [[p9<=0 & 0<=p9]]]]]]]]]]
abstracting: (0<=p9)
states: 206,492 (5)
abstracting: (p9<=0)
states: 178,988 (5)
............
EG iterations: 12
abstracting: (1<=p30)
states: 27,504 (4)
abstracting: (p30<=1)
states: 206,492 (5)
.abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (0<=p30)
states: 206,492 (5)
abstracting: (p30<=0)
states: 178,988 (5)
abstracting: (0<=p36)
states: 206,492 (5)
abstracting: (p36<=0)
states: 201,690 (5)
...........
EG iterations: 11
abstracting: (0<=p43)
states: 206,492 (5)
abstracting: (p43<=0)
states: 165,972 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p18<=1)
states: 206,492 (5)
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.377sec
checking: AF [[[EF [[[p33<=0 & 0<=p33] & [p29<=1 & 1<=p29]]] & AX [1<=0]] & [[p37<=0 & 0<=p37] & [[p8<=1 & 1<=p8] & [AX [[[p40<=0 & 0<=p40] & [p43<=1 & 1<=p43]]] | EF [[[p41<=0 & 0<=p41] & [p42<=1 & 1<=p42]]]]]]]]
normalized: ~ [EG [~ [[[E [true U [[p29<=1 & 1<=p29] & [p33<=0 & 0<=p33]]] & ~ [EX [~ [1<=0]]]] & [[[~ [EX [~ [[[p43<=1 & 1<=p43] & [p40<=0 & 0<=p40]]]]] | E [true U [[p41<=0 & 0<=p41] & [p42<=1 & 1<=p42]]]] & [p8<=1 & 1<=p8]] & [p37<=0 & 0<=p37]]]]]]
abstracting: (0<=p37)
states: 206,492 (5)
abstracting: (p37<=0)
states: 201,690 (5)
abstracting: (1<=p8)
states: 27,504 (4)
abstracting: (p8<=1)
states: 206,492 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (0<=p41)
states: 206,492 (5)
abstracting: (p41<=0)
states: 137,968 (5)
abstracting: (0<=p40)
states: 206,492 (5)
abstracting: (p40<=0)
states: 171,708 (5)
abstracting: (1<=p43)
states: 40,520 (4)
abstracting: (p43<=1)
states: 206,492 (5)
.abstracting: (1<=0)
states: 0
.abstracting: (0<=p33)
states: 206,492 (5)
abstracting: (p33<=0)
states: 178,988 (5)
abstracting: (1<=p29)
states: 27,504 (4)
abstracting: (p29<=1)
states: 206,492 (5)
........
EG iterations: 8
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.510sec
checking: AG [[[[p12<=1 & 1<=p12] | [p42<=0 & 0<=p42]] | [[p9<=0 & 0<=p9] | [EX [[[p33<=0 & 0<=p33] & [p15<=1 & 1<=p15]]] & [AX [[[p18<=0 & 0<=p18] & [p44<=1 & 1<=p44]]] | [p46<=1 & 1<=p46]]]]]]
normalized: ~ [E [true U ~ [[[[[[p46<=1 & 1<=p46] | ~ [EX [~ [[[p44<=1 & 1<=p44] & [p18<=0 & 0<=p18]]]]]] & EX [[[p15<=1 & 1<=p15] & [p33<=0 & 0<=p33]]]] | [p9<=0 & 0<=p9]] | [[p42<=0 & 0<=p42] | [p12<=1 & 1<=p12]]]]]]
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (0<=p42)
states: 206,492 (5)
abstracting: (p42<=0)
states: 152,499 (5)
abstracting: (0<=p9)
states: 206,492 (5)
abstracting: (p9<=0)
states: 178,988 (5)
abstracting: (0<=p33)
states: 206,492 (5)
abstracting: (p33<=0)
states: 178,988 (5)
abstracting: (1<=p15)
states: 27,504 (4)
abstracting: (p15<=1)
states: 206,492 (5)
.abstracting: (0<=p18)
states: 206,492 (5)
abstracting: (p18<=0)
states: 171,671 (5)
abstracting: (1<=p44)
states: 165,971 (5)
abstracting: (p44<=1)
states: 206,492 (5)
.abstracting: (1<=p46)
states: 40,520 (4)
abstracting: (p46<=1)
states: 206,492 (5)
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.303sec
checking: [EX [~ [E [[[p2<=0 & 0<=p2] | [p19<=1 & 1<=p19]] U [[p17<=0 & 0<=p17] | [p26<=1 & 1<=p26]]]]] | AG [~ [A [AX [EG [[p46<=1 & 1<=p46]]] U [[[p23<=1 & 1<=p23] | [p38<=1 & 1<=p38]] | [[p20<=0 & 0<=p20] | [p21<=1 & 1<=p21]]]]]]]
normalized: [~ [E [true U [~ [EG [~ [[[[p21<=1 & 1<=p21] | [p20<=0 & 0<=p20]] | [[p38<=1 & 1<=p38] | [p23<=1 & 1<=p23]]]]]] & ~ [E [~ [[[[p21<=1 & 1<=p21] | [p20<=0 & 0<=p20]] | [[p38<=1 & 1<=p38] | [p23<=1 & 1<=p23]]]] U [EX [~ [EG [[p46<=1 & 1<=p46]]]] & ~ [[[[p21<=1 & 1<=p21] | [p20<=0 & 0<=p20]] | [[p38<=1 & 1<=p38] | [p23<=1 & 1<=p23]]]]]]]]]] | EX [~ [E [[[p19<=1 & 1<=p19] | [p2<=0 & 0<=p2]] U [[p26<=1 & 1<=p26] | [p17<=0 & 0<=p17]]]]]]
abstracting: (0<=p17)
states: 206,492 (5)
abstracting: (p17<=0)
states: 179,660 (5)
abstracting: (1<=p26)
states: 27,504 (4)
abstracting: (p26<=1)
states: 206,492 (5)
abstracting: (0<=p2)
states: 206,492 (5)
abstracting: (p2<=0)
states: 178,784 (5)
abstracting: (1<=p19)
states: 27,504 (4)
abstracting: (p19<=1)
states: 206,492 (5)
.abstracting: (1<=p23)
states: 27,504 (4)
abstracting: (p23<=1)
states: 206,492 (5)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p38<=1)
states: 206,492 (5)
abstracting: (0<=p20)
states: 206,492 (5)
abstracting: (p20<=0)
states: 178,988 (5)
abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p21<=1)
states: 206,492 (5)
abstracting: (1<=p46)
states: 40,520 (4)
abstracting: (p46<=1)
states: 206,492 (5)
....................................................
EG iterations: 52
.abstracting: (1<=p23)
states: 27,504 (4)
abstracting: (p23<=1)
states: 206,492 (5)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p38<=1)
states: 206,492 (5)
abstracting: (0<=p20)
states: 206,492 (5)
abstracting: (p20<=0)
states: 178,988 (5)
abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p21<=1)
states: 206,492 (5)
abstracting: (1<=p23)
states: 27,504 (4)
abstracting: (p23<=1)
states: 206,492 (5)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p38<=1)
states: 206,492 (5)
abstracting: (0<=p20)
states: 206,492 (5)
abstracting: (p20<=0)
states: 178,988 (5)
abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p21<=1)
states: 206,492 (5)
............
EG iterations: 12
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.694sec
checking: [AF [[p3<=1 & 1<=p3]] & [EG [[[[A [[[p12<=0 & 0<=p12] | [p8<=1 & 1<=p8]] U [[p27<=0 & 0<=p27] | [p20<=1 & 1<=p20]]] & AX [[[p9<=0 & 0<=p9] | [p15<=1 & 1<=p15]]]] | AG [[[p21<=0 & 0<=p21] & [p19<=1 & 1<=p19]]]] | [[p3<=0 & 0<=p3] | [p43<=1 & 1<=p43]]]] & [EX [[p22<=1 & 1<=p22]] | E [AF [[AX [[p25<=1 & 1<=p25]] | AG [[p21<=1 & 1<=p21]]]] U ~ [EX [0<=0]]]]]]
normalized: [[[E [~ [EG [~ [[~ [E [true U ~ [[p21<=1 & 1<=p21]]]] | ~ [EX [~ [[p25<=1 & 1<=p25]]]]]]]] U ~ [EX [0<=0]]] | EX [[p22<=1 & 1<=p22]]] & EG [[[[p43<=1 & 1<=p43] | [p3<=0 & 0<=p3]] | [~ [E [true U ~ [[[p19<=1 & 1<=p19] & [p21<=0 & 0<=p21]]]]] | [~ [EX [~ [[[p15<=1 & 1<=p15] | [p9<=0 & 0<=p9]]]]] & [~ [EG [~ [[[p20<=1 & 1<=p20] | [p27<=0 & 0<=p27]]]]] & ~ [E [~ [[[p20<=1 & 1<=p20] | [p27<=0 & 0<=p27]]] U [~ [[[p8<=1 & 1<=p8] | [p12<=0 & 0<=p12]]] & ~ [[[p20<=1 & 1<=p20] | [p27<=0 & 0<=p27]]]]]]]]]]]] & ~ [EG [~ [[p3<=1 & 1<=p3]]]]]
abstracting: (1<=p3)
states: 26,411 (4)
abstracting: (p3<=1)
states: 206,492 (5)
...............
EG iterations: 15
abstracting: (0<=p27)
states: 206,492 (5)
abstracting: (p27<=0)
states: 178,988 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p20<=1)
states: 206,492 (5)
abstracting: (0<=p12)
states: 206,492 (5)
abstracting: (p12<=0)
states: 178,988 (5)
abstracting: (1<=p8)
states: 27,504 (4)
abstracting: (p8<=1)
states: 206,492 (5)
abstracting: (0<=p27)
states: 206,492 (5)
abstracting: (p27<=0)
states: 178,988 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p20<=1)
states: 206,492 (5)
abstracting: (0<=p27)
states: 206,492 (5)
abstracting: (p27<=0)
states: 178,988 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p20<=1)
states: 206,492 (5)
...........
EG iterations: 11
abstracting: (0<=p9)
states: 206,492 (5)
abstracting: (p9<=0)
states: 178,988 (5)
abstracting: (1<=p15)
states: 27,504 (4)
abstracting: (p15<=1)
states: 206,492 (5)
.abstracting: (0<=p21)
states: 206,492 (5)
abstracting: (p21<=0)
states: 171,670 (5)
abstracting: (1<=p19)
states: 27,504 (4)
abstracting: (p19<=1)
states: 206,492 (5)
abstracting: (0<=p3)
states: 206,492 (5)
abstracting: (p3<=0)
states: 180,081 (5)
abstracting: (1<=p43)
states: 40,520 (4)
abstracting: (p43<=1)
states: 206,492 (5)
.
EG iterations: 1
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
.abstracting: (0<=0)
states: 206,492 (5)
.abstracting: (1<=p25)
states: 34,821 (4)
abstracting: (p25<=1)
states: 206,492 (5)
.abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p21<=1)
states: 206,492 (5)
...................................................
EG iterations: 51
-> the formula is FALSE
FORMULA AutonomousCar-PT-04a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.477sec
totally nodes used: 3242592 (3.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6941273 16395611 23336884
used/not used/entry size/cache size: 16569363 50539501 16 1024MB
basic ops cache: hits/miss/sum: 1165723 1973092 3138815
used/not used/entry size/cache size: 3432467 13344749 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 22749 49210 71959
used/not used/entry size/cache size: 49018 8339590 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64078900
1 2837030
2 174836
3 16614
4 1377
5 103
6 3
7 1
8 0
9 0
>= 10 0
Total processing time: 0m11.461sec
BK_STOP 1678699243154
--------------------
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.000sec
iterations count:20387 (172), effective:1380 (11)
initing FirstDep: 0m 0.000sec
iterations count:4700 (39), effective:270 (2)
iterations count:8484 (71), effective:320 (2)
iterations count:212 (1), effective:1 (0)
iterations count:118 (1), effective:0 (0)
iterations count:12566 (106), effective:718 (6)
iterations count:119 (1), effective:1 (0)
iterations count:1092 (9), effective:12 (0)
iterations count:1092 (9), effective:12 (0)
iterations count:144 (1), effective:1 (0)
iterations count:1092 (9), effective:12 (0)
iterations count:975 (8), effective:11 (0)
iterations count:123 (1), effective:2 (0)
iterations count:6395 (54), effective:146 (1)
iterations count:118 (1), effective:0 (0)
iterations count:119 (1), effective:1 (0)
iterations count:6779 (57), effective:104 (0)
iterations count:5587 (47), effective:138 (1)
iterations count:9266 (78), effective:423 (3)
iterations count:119 (1), effective:1 (0)
iterations count:118 (1), effective:0 (0)
iterations count:119 (1), effective:1 (0)
iterations count:147 (1), effective:1 (0)
iterations count:141 (1), effective:1 (0)
iterations count:5491 (46), effective:135 (1)
iterations count:7837 (66), effective:224 (1)
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-04a"
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-04a, 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-167813599200577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04a.tgz
mv AutonomousCar-PT-04a 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 ;