About the Execution of Marcie+red for AutonomousCar-PT-01b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5616.880 | 13084.00 | 20313.00 | 32.50 | FTTFTFTTTFFFTTFT | 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-167813599200537.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-01b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200537
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 11K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:55 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 31K 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-01b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-01b-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678698631291
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-01b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:10:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 09:10:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:10:33] [INFO ] Load time of PNML (sax parser for PT used): 56 ms
[2023-03-13 09:10:33] [INFO ] Transformed 119 places.
[2023-03-13 09:10:33] [INFO ] Transformed 132 transitions.
[2023-03-13 09:10:33] [INFO ] Found NUPN structural information;
[2023-03-13 09:10:33] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 72 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 128
Applied a total of 8 rules in 15 ms. Remains 115 /119 variables (removed 4) and now considering 128/132 (removed 4) transitions.
// Phase 1: matrix 128 rows 115 cols
[2023-03-13 09:10:33] [INFO ] Computed 6 place invariants in 10 ms
[2023-03-13 09:10:33] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-03-13 09:10:33] [INFO ] Invariant cache hit.
[2023-03-13 09:10:33] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 475 ms to find 0 implicit places.
[2023-03-13 09:10:33] [INFO ] Invariant cache hit.
[2023-03-13 09:10:34] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/119 places, 128/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 656 ms. Remains : 115/119 places, 128/132 transitions.
Support contains 72 out of 115 places after structural reductions.
[2023-03-13 09:10:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 09:10:34] [INFO ] Flatten gal took : 68 ms
FORMULA AutonomousCar-PT-01b-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:10:34] [INFO ] Flatten gal took : 14 ms
[2023-03-13 09:10:34] [INFO ] Input system was already deterministic with 128 transitions.
Support contains 61 out of 115 places (down from 72) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 50) seen :42
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-13 09:10:34] [INFO ] Invariant cache hit.
[2023-03-13 09:10:34] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-13 09:10:34] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-13 09:10:34] [INFO ] [Nat]Absence check using 6 positive place invariants in 13 ms returned sat
[2023-03-13 09:10:35] [INFO ] After 44ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-13 09:10:35] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 9 ms to minimize.
[2023-03-13 09:10:35] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 1 ms to minimize.
[2023-03-13 09:10:35] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2023-03-13 09:10:35] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-13 09:10:35] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 0 ms to minimize.
[2023-03-13 09:10:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 310 ms
[2023-03-13 09:10:35] [INFO ] After 357ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :0
[2023-03-13 09:10:35] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 128 transitions.
Computed a total of 30 stabilizing places and 31 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 103 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 103 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 103 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 101 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 101 transition count 110
Applied a total of 32 rules in 7 ms. Remains 101 /115 variables (removed 14) and now considering 110/128 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 101/115 places, 110/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 99 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 99 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 95 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 95 transition count 104
Applied a total of 44 rules in 18 ms. Remains 95 /115 variables (removed 20) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 95/115 places, 104/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 99 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 96 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 96 transition count 105
Applied a total of 42 rules in 8 ms. Remains 96 /115 variables (removed 19) and now considering 105/128 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 96/115 places, 105/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 100 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 96 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 96 transition count 105
Applied a total of 42 rules in 5 ms. Remains 96 /115 variables (removed 19) and now considering 105/128 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 96/115 places, 105/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 100 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 100 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 97 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 97 transition count 106
Applied a total of 40 rules in 4 ms. Remains 97 /115 variables (removed 18) and now considering 106/128 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/115 places, 106/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 103 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 103 transition count 116
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 100 transition count 113
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 100 transition count 113
Applied a total of 30 rules in 4 ms. Remains 100 /115 variables (removed 15) and now considering 113/128 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 100/115 places, 113/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 99 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 99 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 95 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 95 transition count 104
Applied a total of 44 rules in 3 ms. Remains 95 /115 variables (removed 20) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 95/115 places, 104/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 100 transition count 113
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 96 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 96 transition count 105
Applied a total of 42 rules in 3 ms. Remains 96 /115 variables (removed 19) and now considering 105/128 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/115 places, 105/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Graph (trivial) has 99 edges and 115 vertex of which 2 / 115 are part of one of the 1 SCC in 3 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 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 113 transition count 77
Reduce places removed 49 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 60 rules applied. Total rules applied 110 place count 64 transition count 66
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 116 place count 58 transition count 66
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 116 place count 58 transition count 60
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 128 place count 52 transition count 60
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 136 place count 44 transition count 52
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 44 transition count 52
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 44 transition count 47
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 152 place count 41 transition count 44
Iterating global reduction 4 with 3 rules applied. Total rules applied 155 place count 41 transition count 44
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 4 with 2 rules applied. Total rules applied 157 place count 41 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 158 place count 40 transition count 42
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 178 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 179 place count 29 transition count 30
Iterating global reduction 6 with 1 rules applied. Total rules applied 180 place count 29 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 182 place count 29 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 184 place count 27 transition count 28
Applied a total of 184 rules in 20 ms. Remains 27 /115 variables (removed 88) and now considering 28/128 (removed 100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 27/115 places, 28/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Graph (trivial) has 106 edges and 115 vertex of which 4 / 115 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 112 transition count 74
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 1 with 60 rules applied. Total rules applied 112 place count 61 transition count 65
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 56 transition count 65
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 117 place count 56 transition count 58
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 131 place count 49 transition count 58
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 140 place count 40 transition count 49
Iterating global reduction 3 with 9 rules applied. Total rules applied 149 place count 40 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 153 place count 40 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 153 place count 40 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 155 place count 39 transition count 44
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 157 place count 37 transition count 42
Iterating global reduction 4 with 2 rules applied. Total rules applied 159 place count 37 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 37 transition count 41
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 180 place count 27 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 27 transition count 30
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 182 place count 26 transition count 28
Iterating global reduction 6 with 1 rules applied. Total rules applied 183 place count 26 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 185 place count 25 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 186 place count 25 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 188 place count 23 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 189 place count 22 transition count 24
Applied a total of 189 rules in 11 ms. Remains 22 /115 variables (removed 93) and now considering 24/128 (removed 104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 22/115 places, 24/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 99 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 96 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 96 transition count 105
Applied a total of 42 rules in 3 ms. Remains 96 /115 variables (removed 19) and now considering 105/128 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 96/115 places, 105/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 99 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 99 transition count 108
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 40 place count 95 transition count 104
Iterating global reduction 1 with 4 rules applied. Total rules applied 44 place count 95 transition count 104
Applied a total of 44 rules in 3 ms. Remains 95 /115 variables (removed 20) and now considering 104/128 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 95/115 places, 104/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 102 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 102 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 102 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 33 place count 99 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 36 place count 99 transition count 108
Applied a total of 36 rules in 3 ms. Remains 99 /115 variables (removed 16) and now considering 108/128 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 99/115 places, 108/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 99 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 99 transition count 112
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 99 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 96 transition count 105
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 96 transition count 105
Applied a total of 42 rules in 4 ms. Remains 96 /115 variables (removed 19) and now considering 105/128 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 96/115 places, 105/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 128/128 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 101 transition count 114
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 101 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 101 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 35 place count 98 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 38 place count 98 transition count 107
Applied a total of 38 rules in 3 ms. Remains 98 /115 variables (removed 17) and now considering 107/128 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 98/115 places, 107/128 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:35] [INFO ] Input system was already deterministic with 107 transitions.
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:10:35] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:10:35] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 09:10:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 115 places, 128 transitions and 331 arcs took 2 ms.
Total runtime 2568 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: 115 NrTr: 128 NrArc: 331)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 2.976sec
RS generation: 0m 0.079sec
-> reachability set: #nodes 2884 (2.9e+03) #states 112,781 (5)
starting MCC model checker
--------------------------
checking: EG [EX [0<=0]]
normalized: EG [EX [0<=0]]
abstracting: (0<=0)
states: 112,781 (5)
..............................................
EG iterations: 45
-> the formula is TRUE
FORMULA AutonomousCar-PT-01b-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.394sec
checking: EX [AG [AX [AF [AX [[p114<=0 & 0<=p114]]]]]]
normalized: EX [~ [E [true U EX [EG [EX [~ [[p114<=0 & 0<=p114]]]]]]]]
abstracting: (0<=p114)
states: 112,781 (5)
abstracting: (p114<=0)
states: 110,321 (5)
.........................................................
EG iterations: 56
..-> the formula is TRUE
FORMULA AutonomousCar-PT-01b-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.238sec
checking: EF [AG [[p30<=1 & 1<=p30]]]
normalized: E [true U ~ [E [true U ~ [[p30<=1 & 1<=p30]]]]]
abstracting: (1<=p30)
states: 4,009 (3)
abstracting: (p30<=1)
states: 112,781 (5)
-> the formula is FALSE
FORMULA AutonomousCar-PT-01b-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.035sec
checking: EG [EX [[[p26<=0 & 0<=p26] | [p114<=1 & 1<=p114]]]]
normalized: EG [EX [[[p114<=1 & 1<=p114] | [p26<=0 & 0<=p26]]]]
abstracting: (0<=p26)
states: 112,781 (5)
abstracting: (p26<=0)
states: 108,772 (5)
abstracting: (1<=p114)
states: 2,460 (3)
abstracting: (p114<=1)
states: 112,781 (5)
..............................................
EG iterations: 45
-> the formula is TRUE
FORMULA AutonomousCar-PT-01b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EX [[AF [AG [[p73<=0 & 0<=p73]]] | AG [[[p106<=0 & 0<=p106] | [p46<=1 & 1<=p46]]]]]
normalized: EX [[~ [E [true U ~ [[[p46<=1 & 1<=p46] | [p106<=0 & 0<=p106]]]]] | ~ [EG [E [true U ~ [[p73<=0 & 0<=p73]]]]]]]
abstracting: (0<=p73)
states: 112,781 (5)
abstracting: (p73<=0)
states: 110,735 (5)
...........................
EG iterations: 27
abstracting: (0<=p106)
states: 112,781 (5)
abstracting: (p106<=0)
states: 110,342 (5)
abstracting: (1<=p46)
states: 600
abstracting: (p46<=1)
states: 112,781 (5)
.-> the formula is FALSE
FORMULA AutonomousCar-PT-01b-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.260sec
checking: AG [EX [AF [[EG [[[p80<=0 & 0<=p80] | [p51<=1 & 1<=p51]]] & [[p21<=0 & 0<=p21] | [p2<=1 & 1<=p2]]]]]]
normalized: ~ [E [true U ~ [EX [~ [EG [~ [[[[p2<=1 & 1<=p2] | [p21<=0 & 0<=p21]] & EG [[[p51<=1 & 1<=p51] | [p80<=0 & 0<=p80]]]]]]]]]]]
abstracting: (0<=p80)
states: 112,781 (5)
abstracting: (p80<=0)
states: 112,289 (5)
abstracting: (1<=p51)
states: 3,128 (3)
abstracting: (p51<=1)
states: 112,781 (5)
.......................................................
EG iterations: 55
abstracting: (0<=p21)
states: 112,781 (5)
abstracting: (p21<=0)
states: 108,772 (5)
abstracting: (1<=p2)
states: 1,531 (3)
abstracting: (p2<=1)
states: 112,781 (5)
......................
EG iterations: 22
.-> the formula is FALSE
FORMULA AutonomousCar-PT-01b-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.497sec
checking: AX [[[p91<=0 & 0<=p91] & E [[p98<=1 & 1<=p98] U [[p73<=1 & 1<=p73] | ~ [AG [[p106<=0 & 0<=p106]]]]]]]
normalized: ~ [EX [~ [[E [[p98<=1 & 1<=p98] U [E [true U ~ [[p106<=0 & 0<=p106]]] | [p73<=1 & 1<=p73]]] & [p91<=0 & 0<=p91]]]]]
abstracting: (0<=p91)
states: 112,781 (5)
abstracting: (p91<=0)
states: 104,433 (5)
abstracting: (1<=p73)
states: 2,046 (3)
abstracting: (p73<=1)
states: 112,781 (5)
abstracting: (0<=p106)
states: 112,781 (5)
abstracting: (p106<=0)
states: 110,342 (5)
abstracting: (1<=p98)
states: 2,439 (3)
abstracting: (p98<=1)
states: 112,781 (5)
.-> the formula is TRUE
FORMULA AutonomousCar-PT-01b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.079sec
checking: A [~ [EG [[AX [[p105<=1 & 1<=p105]] & ~ [[p25<=0 & 0<=p25]]]]] U EG [EF [EX [[[p26<=1 & 1<=p26] & [[p64<=0 & 0<=p64] | [p29<=1 & 1<=p29]]]]]]]
normalized: [~ [EG [~ [EG [E [true U EX [[[[p29<=1 & 1<=p29] | [p64<=0 & 0<=p64]] & [p26<=1 & 1<=p26]]]]]]]] & ~ [E [~ [EG [E [true U EX [[[[p29<=1 & 1<=p29] | [p64<=0 & 0<=p64]] & [p26<=1 & 1<=p26]]]]]] U [EG [[~ [EX [~ [[p105<=1 & 1<=p105]]]] & ~ [[p25<=0 & 0<=p25]]]] & ~ [EG [E [true U EX [[[[p29<=1 & 1<=p29] | [p64<=0 & 0<=p64]] & [p26<=1 & 1<=p26]]]]]]]]]]
abstracting: (1<=p26)
states: 4,009 (3)
abstracting: (p26<=1)
states: 112,781 (5)
abstracting: (0<=p64)
states: 112,781 (5)
abstracting: (p64<=0)
states: 109,653 (5)
abstracting: (1<=p29)
states: 4,009 (3)
abstracting: (p29<=1)
states: 112,781 (5)
.........................................
EG iterations: 40
abstracting: (0<=p25)
states: 112,781 (5)
abstracting: (p25<=0)
states: 108,772 (5)
abstracting: (1<=p105)
states: 2,439 (3)
abstracting: (p105<=1)
states: 112,781 (5)
..
EG iterations: 1
abstracting: (1<=p26)
states: 4,009 (3)
abstracting: (p26<=1)
states: 112,781 (5)
abstracting: (0<=p64)
states: 112,781 (5)
abstracting: (p64<=0)
states: 109,653 (5)
abstracting: (1<=p29)
states: 4,009 (3)
abstracting: (p29<=1)
states: 112,781 (5)
.........................................
EG iterations: 40
abstracting: (1<=p26)
states: 4,009 (3)
abstracting: (p26<=1)
states: 112,781 (5)
abstracting: (0<=p64)
states: 112,781 (5)
abstracting: (p64<=0)
states: 109,653 (5)
abstracting: (1<=p29)
states: 4,009 (3)
abstracting: (p29<=1)
states: 112,781 (5)
.........................................
EG iterations: 40
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-01b-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.164sec
checking: AF [EG [[[p113<=0 & 0<=p113] | [AG [[p5<=0 & 0<=p5]] | [AF [[p94<=0 & 0<=p94]] & [[p75<=0 & 0<=p75] | [p96<=1 & 1<=p96]]]]]]]
normalized: ~ [EG [~ [EG [[[[[[p96<=1 & 1<=p96] | [p75<=0 & 0<=p75]] & ~ [EG [~ [[p94<=0 & 0<=p94]]]]] | ~ [E [true U ~ [[p5<=0 & 0<=p5]]]]] | [p113<=0 & 0<=p113]]]]]]
abstracting: (0<=p113)
states: 112,781 (5)
abstracting: (p113<=0)
states: 110,321 (5)
abstracting: (0<=p5)
states: 112,781 (5)
abstracting: (p5<=0)
states: 71,473 (4)
abstracting: (0<=p94)
states: 112,781 (5)
abstracting: (p94<=0)
states: 110,342 (5)
..............................................
EG iterations: 46
abstracting: (0<=p75)
states: 112,781 (5)
abstracting: (p75<=0)
states: 98,829 (4)
abstracting: (1<=p96)
states: 2,439 (3)
abstracting: (p96<=1)
states: 112,781 (5)
.
EG iterations: 1
................
EG iterations: 16
-> the formula is TRUE
FORMULA AutonomousCar-PT-01b-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.238sec
checking: [EX [EG [[p83<=1 & 1<=p83]]] | EF [[[AG [[p40<=0 & 0<=p40]] & EX [[p21<=1 & 1<=p21]]] & [[p30<=0 & 0<=p30] & AG [E [[p69<=0 & 0<=p69] U [p48<=0 & 0<=p48]]]]]]]
normalized: [E [true U [[~ [E [true U ~ [E [[p69<=0 & 0<=p69] U [p48<=0 & 0<=p48]]]]] & [p30<=0 & 0<=p30]] & [EX [[p21<=1 & 1<=p21]] & ~ [E [true U ~ [[p40<=0 & 0<=p40]]]]]]] | EX [EG [[p83<=1 & 1<=p83]]]]
abstracting: (1<=p83)
states: 3,252 (3)
abstracting: (p83<=1)
states: 112,781 (5)
..............................................
EG iterations: 46
.abstracting: (0<=p40)
states: 112,781 (5)
abstracting: (p40<=0)
states: 108,772 (5)
abstracting: (1<=p21)
states: 4,009 (3)
abstracting: (p21<=1)
states: 112,781 (5)
.abstracting: (0<=p30)
states: 112,781 (5)
abstracting: (p30<=0)
states: 108,772 (5)
abstracting: (0<=p48)
states: 112,781 (5)
abstracting: (p48<=0)
states: 112,181 (5)
abstracting: (0<=p69)
states: 112,781 (5)
abstracting: (p69<=0)
states: 110,735 (5)
-> the formula is TRUE
FORMULA AutonomousCar-PT-01b-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.167sec
checking: AX [A [~ [[~ [[[p98<=0 & 0<=p98] | [[p28<=1 & 1<=p28] | [p103<=1 & 1<=p103]]]] & [[p113<=0 & 0<=p113] | [p98<=1 & 1<=p98]]]] U ~ [[p87<=0 & 0<=p87]]]]
normalized: ~ [EX [~ [[~ [EG [[p87<=0 & 0<=p87]]] & ~ [E [[p87<=0 & 0<=p87] U [[[[p98<=1 & 1<=p98] | [p113<=0 & 0<=p113]] & ~ [[[[p103<=1 & 1<=p103] | [p28<=1 & 1<=p28]] | [p98<=0 & 0<=p98]]]] & [p87<=0 & 0<=p87]]]]]]]]
abstracting: (0<=p87)
states: 112,781 (5)
abstracting: (p87<=0)
states: 109,529 (5)
abstracting: (0<=p98)
states: 112,781 (5)
abstracting: (p98<=0)
states: 110,342 (5)
abstracting: (1<=p28)
states: 4,009 (3)
abstracting: (p28<=1)
states: 112,781 (5)
abstracting: (1<=p103)
states: 2,439 (3)
abstracting: (p103<=1)
states: 112,781 (5)
abstracting: (0<=p113)
states: 112,781 (5)
abstracting: (p113<=0)
states: 110,321 (5)
abstracting: (1<=p98)
states: 2,439 (3)
abstracting: (p98<=1)
states: 112,781 (5)
abstracting: (0<=p87)
states: 112,781 (5)
abstracting: (p87<=0)
states: 109,529 (5)
abstracting: (0<=p87)
states: 112,781 (5)
abstracting: (p87<=0)
states: 109,529 (5)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA AutonomousCar-PT-01b-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.136sec
checking: EX [[EG [[AF [[[p22<=0 & 0<=p22] | [p87<=1 & 1<=p87]]] | EG [[[p33<=0 & 0<=p33] | [p97<=1 & 1<=p97]]]]] & [[p55<=0 & 0<=p55] | [p36<=1 & 1<=p36]]]]
normalized: EX [[EG [[EG [[[p97<=1 & 1<=p97] | [p33<=0 & 0<=p33]]] | ~ [EG [~ [[[p87<=1 & 1<=p87] | [p22<=0 & 0<=p22]]]]]]] & [[p36<=1 & 1<=p36] | [p55<=0 & 0<=p55]]]]
abstracting: (0<=p55)
states: 112,781 (5)
abstracting: (p55<=0)
states: 109,653 (5)
abstracting: (1<=p36)
states: 1,416 (3)
abstracting: (p36<=1)
states: 112,781 (5)
abstracting: (0<=p22)
states: 112,781 (5)
abstracting: (p22<=0)
states: 108,772 (5)
abstracting: (1<=p87)
states: 3,252 (3)
abstracting: (p87<=1)
states: 112,781 (5)
...................
EG iterations: 19
abstracting: (0<=p33)
states: 112,781 (5)
abstracting: (p33<=0)
states: 108,772 (5)
abstracting: (1<=p97)
states: 2,439 (3)
abstracting: (p97<=1)
states: 112,781 (5)
.........
EG iterations: 9
EG iterations: 0
.-> the formula is TRUE
FORMULA AutonomousCar-PT-01b-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.145sec
checking: AX [AG [[[EG [[[p103<=0 & 0<=p103] & [p98<=1 & 1<=p98]]] | [p94<=1 & 1<=p94]] | [[EF [[p23<=0 & 0<=p23]] & EG [[[p20<=0 & 0<=p20] | [p11<=1 & 1<=p11]]]] | [[[p45<=0 & 0<=p45] & [p48<=1 & 1<=p48]] | [[p19<=0 & 0<=p19] & [p43<=1 & 1<=p43]]]]]]]
normalized: ~ [EX [E [true U ~ [[[[[[p43<=1 & 1<=p43] & [p19<=0 & 0<=p19]] | [[p48<=1 & 1<=p48] & [p45<=0 & 0<=p45]]] | [EG [[[p11<=1 & 1<=p11] | [p20<=0 & 0<=p20]]] & E [true U [p23<=0 & 0<=p23]]]] | [[p94<=1 & 1<=p94] | EG [[[p98<=1 & 1<=p98] & [p103<=0 & 0<=p103]]]]]]]]]
abstracting: (0<=p103)
states: 112,781 (5)
abstracting: (p103<=0)
states: 110,342 (5)
abstracting: (1<=p98)
states: 2,439 (3)
abstracting: (p98<=1)
states: 112,781 (5)
..............................................
EG iterations: 46
abstracting: (1<=p94)
states: 2,439 (3)
abstracting: (p94<=1)
states: 112,781 (5)
abstracting: (0<=p23)
states: 112,781 (5)
abstracting: (p23<=0)
states: 108,772 (5)
abstracting: (0<=p20)
states: 112,781 (5)
abstracting: (p20<=0)
states: 110,645 (5)
abstracting: (1<=p11)
states: 20,654 (4)
abstracting: (p11<=1)
states: 112,781 (5)
.............................
EG iterations: 29
abstracting: (0<=p45)
states: 112,781 (5)
abstracting: (p45<=0)
states: 112,181 (5)
abstracting: (1<=p48)
states: 600
abstracting: (p48<=1)
states: 112,781 (5)
abstracting: (0<=p19)
states: 112,781 (5)
abstracting: (p19<=0)
states: 110,645 (5)
abstracting: (1<=p43)
states: 4,009 (3)
abstracting: (p43<=1)
states: 112,781 (5)
.-> the formula is FALSE
FORMULA AutonomousCar-PT-01b-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.210sec
checking: A [[[p3<=0 & 0<=p3] & A [E [[[p86<=0 & 0<=p86] | [p12<=1 & 1<=p12]] U AG [[[p58<=0 & 0<=p58] | [p109<=1 & 1<=p109]]]] U [[p17<=0 & 0<=p17] | [p70<=1 & 1<=p70]]]] U [AX [[p15<=1 & 1<=p15]] & [[p2<=0 & 0<=p2] | [p54<=1 & 1<=p54]]]]
normalized: [~ [EG [~ [[[[p54<=1 & 1<=p54] | [p2<=0 & 0<=p2]] & ~ [EX [~ [[p15<=1 & 1<=p15]]]]]]]] & ~ [E [~ [[[[p54<=1 & 1<=p54] | [p2<=0 & 0<=p2]] & ~ [EX [~ [[p15<=1 & 1<=p15]]]]]] U [~ [[[~ [EG [~ [[[p70<=1 & 1<=p70] | [p17<=0 & 0<=p17]]]]] & ~ [E [~ [[[p70<=1 & 1<=p70] | [p17<=0 & 0<=p17]]] U [~ [E [[[p12<=1 & 1<=p12] | [p86<=0 & 0<=p86]] U ~ [E [true U ~ [[[p109<=1 & 1<=p109] | [p58<=0 & 0<=p58]]]]]]] & ~ [[[p70<=1 & 1<=p70] | [p17<=0 & 0<=p17]]]]]]] & [p3<=0 & 0<=p3]]] & ~ [[[[p54<=1 & 1<=p54] | [p2<=0 & 0<=p2]] & ~ [EX [~ [[p15<=1 & 1<=p15]]]]]]]]]]
abstracting: (1<=p15)
states: 150
abstracting: (p15<=1)
states: 112,781 (5)
.abstracting: (0<=p2)
states: 112,781 (5)
abstracting: (p2<=0)
states: 111,250 (5)
abstracting: (1<=p54)
states: 3,128 (3)
abstracting: (p54<=1)
states: 112,781 (5)
abstracting: (0<=p3)
states: 112,781 (5)
abstracting: (p3<=0)
states: 105,278 (5)
abstracting: (0<=p17)
states: 112,781 (5)
abstracting: (p17<=0)
states: 108,772 (5)
abstracting: (1<=p70)
states: 2,046 (3)
abstracting: (p70<=1)
states: 112,781 (5)
abstracting: (0<=p58)
states: 112,781 (5)
abstracting: (p58<=0)
states: 109,653 (5)
abstracting: (1<=p109)
states: 18,785 (4)
abstracting: (p109<=1)
states: 112,781 (5)
abstracting: (0<=p86)
states: 112,781 (5)
abstracting: (p86<=0)
states: 109,529 (5)
abstracting: (1<=p12)
states: 20,654 (4)
abstracting: (p12<=1)
states: 112,781 (5)
abstracting: (0<=p17)
states: 112,781 (5)
abstracting: (p17<=0)
states: 108,772 (5)
abstracting: (1<=p70)
states: 2,046 (3)
abstracting: (p70<=1)
states: 112,781 (5)
abstracting: (0<=p17)
states: 112,781 (5)
abstracting: (p17<=0)
states: 108,772 (5)
abstracting: (1<=p70)
states: 2,046 (3)
abstracting: (p70<=1)
states: 112,781 (5)
...................
EG iterations: 19
abstracting: (1<=p15)
states: 150
abstracting: (p15<=1)
states: 112,781 (5)
.abstracting: (0<=p2)
states: 112,781 (5)
abstracting: (p2<=0)
states: 111,250 (5)
abstracting: (1<=p54)
states: 3,128 (3)
abstracting: (p54<=1)
states: 112,781 (5)
abstracting: (1<=p15)
states: 150
abstracting: (p15<=1)
states: 112,781 (5)
.abstracting: (0<=p2)
states: 112,781 (5)
abstracting: (p2<=0)
states: 111,250 (5)
abstracting: (1<=p54)
states: 3,128 (3)
abstracting: (p54<=1)
states: 112,781 (5)
.............................................
EG iterations: 45
-> the formula is FALSE
FORMULA AutonomousCar-PT-01b-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.339sec
checking: ~ [A [~ [EX [[p50<=1 & 1<=p50]]] U [A [[~ [[[p107<=0 & 0<=p107] | [p42<=1 & 1<=p42]]] | A [[[p88<=0 & 0<=p88] | [p38<=1 & 1<=p38]] U [p35<=1 & 1<=p35]]] U AX [[p59<=1 & 1<=p59]]] & E [EG [[[p17<=0 & 0<=p17] | [p74<=1 & 1<=p74]]] U EG [[p34<=1 & 1<=p34]]]]]]
normalized: ~ [[~ [EG [~ [[[~ [EG [EX [~ [[p59<=1 & 1<=p59]]]]] & ~ [E [EX [~ [[p59<=1 & 1<=p59]]] U [~ [[~ [[[p42<=1 & 1<=p42] | [p107<=0 & 0<=p107]]] | [~ [EG [~ [[p35<=1 & 1<=p35]]]] & ~ [E [~ [[p35<=1 & 1<=p35]] U [~ [[[p38<=1 & 1<=p38] | [p88<=0 & 0<=p88]]] & ~ [[p35<=1 & 1<=p35]]]]]]]] & EX [~ [[p59<=1 & 1<=p59]]]]]]] & E [EG [[[p17<=0 & 0<=p17] | [p74<=1 & 1<=p74]]] U EG [[p34<=1 & 1<=p34]]]]]]] & ~ [E [~ [[[~ [EG [EX [~ [[p59<=1 & 1<=p59]]]]] & ~ [E [EX [~ [[p59<=1 & 1<=p59]]] U [~ [[~ [[[p42<=1 & 1<=p42] | [p107<=0 & 0<=p107]]] | [~ [EG [~ [[p35<=1 & 1<=p35]]]] & ~ [E [~ [[p35<=1 & 1<=p35]] U [~ [[[p38<=1 & 1<=p38] | [p88<=0 & 0<=p88]]] & ~ [[p35<=1 & 1<=p35]]]]]]]] & EX [~ [[p59<=1 & 1<=p59]]]]]]] & E [EG [[[p17<=0 & 0<=p17] | [p74<=1 & 1<=p74]]] U EG [[p34<=1 & 1<=p34]]]]] U [~ [[[~ [EG [EX [~ [[p59<=1 & 1<=p59]]]]] & ~ [E [EX [~ [[p59<=1 & 1<=p59]]] U [~ [[~ [[[p42<=1 & 1<=p42] | [p107<=0 & 0<=p107]]] | [~ [EG [~ [[p35<=1 & 1<=p35]]]] & ~ [E [~ [[p35<=1 & 1<=p35]] U [~ [[[p38<=1 & 1<=p38] | [p88<=0 & 0<=p88]]] & ~ [[p35<=1 & 1<=p35]]]]]]]] & EX [~ [[p59<=1 & 1<=p59]]]]]]] & E [EG [[[p17<=0 & 0<=p17] | [p74<=1 & 1<=p74]]] U EG [[p34<=1 & 1<=p34]]]]] & EX [[p50<=1 & 1<=p50]]]]]]]
abstracting: (1<=p50)
states: 1,050 (3)
abstracting: (p50<=1)
states: 112,781 (5)
.abstracting: (1<=p34)
states: 4,009 (3)
abstracting: (p34<=1)
states: 112,781 (5)
...................
EG iterations: 19
abstracting: (1<=p74)
states: 20,297 (4)
abstracting: (p74<=1)
states: 112,781 (5)
abstracting: (0<=p17)
states: 112,781 (5)
abstracting: (p17<=0)
states: 108,772 (5)
.
EG iterations: 1
abstracting: (1<=p59)
states: 3,128 (3)
abstracting: (p59<=1)
states: 112,781 (5)
.abstracting: (1<=p35)
states: 2,136 (3)
abstracting: (p35<=1)
states: 112,781 (5)
abstracting: (0<=p88)
states: 112,781 (5)
abstracting: (p88<=0)
states: 109,529 (5)
abstracting: (1<=p38)
states: 6,145 (3)
abstracting: (p38<=1)
states: 112,781 (5)
abstracting: (1<=p35)
states: 2,136 (3)
abstracting: (p35<=1)
states: 112,781 (5)
abstracting: (1<=p35)
states: 2,136 (3)
abstracting: (p35<=1)
states: 112,781 (5)
.
EG iterations: 1
abstracting: (0<=p107)
states: 112,781 (5)
abstracting: (p107<=0)
states: 110,342 (5)
abstracting: (1<=p42)
states: 4,009 (3)
abstracting: (p42<=1)
states: 112,781 (5)
abstracting: (1<=p59)
states: 3,128 (3)
abstracting: (p59<=1)
states: 112,781 (5)
.abstracting: (1<=p59)
states: 3,128 (3)
abstracting: (p59<=1)
states: 112,781 (5)
..............................................
EG iterations: 45
abstracting: (1<=p34)
states: 4,009 (3)
abstracting: (p34<=1)
states: 112,781 (5)
...................
EG iterations: 19
abstracting: (1<=p74)
states: 20,297 (4)
abstracting: (p74<=1)
states: 112,781 (5)
abstracting: (0<=p17)
states: 112,781 (5)
abstracting: (p17<=0)
states: 108,772 (5)
.
EG iterations: 1
abstracting: (1<=p59)
states: 3,128 (3)
abstracting: (p59<=1)
states: 112,781 (5)
.abstracting: (1<=p35)
states: 2,136 (3)
abstracting: (p35<=1)
states: 112,781 (5)
abstracting: (0<=p88)
states: 112,781 (5)
abstracting: (p88<=0)
states: 109,529 (5)
abstracting: (1<=p38)
states: 6,145 (3)
abstracting: (p38<=1)
states: 112,781 (5)
abstracting: (1<=p35)
states: 2,136 (3)
abstracting: (p35<=1)
states: 112,781 (5)
abstracting: (1<=p35)
states: 2,136 (3)
abstracting: (p35<=1)
states: 112,781 (5)
.
EG iterations: 1
abstracting: (0<=p107)
states: 112,781 (5)
abstracting: (p107<=0)
states: 110,342 (5)
abstracting: (1<=p42)
states: 4,009 (3)
abstracting: (p42<=1)
states: 112,781 (5)
abstracting: (1<=p59)
states: 3,128 (3)
abstracting: (p59<=1)
states: 112,781 (5)
.abstracting: (1<=p59)
states: 3,128 (3)
abstracting: (p59<=1)
states: 112,781 (5)
..............................................
EG iterations: 45
abstracting: (1<=p34)
states: 4,009 (3)
abstracting: (p34<=1)
states: 112,781 (5)
...................
EG iterations: 19
abstracting: (1<=p74)
states: 20,297 (4)
abstracting: (p74<=1)
states: 112,781 (5)
abstracting: (0<=p17)
states: 112,781 (5)
abstracting: (p17<=0)
states: 108,772 (5)
.
EG iterations: 1
abstracting: (1<=p59)
states: 3,128 (3)
abstracting: (p59<=1)
states: 112,781 (5)
.abstracting: (1<=p35)
states: 2,136 (3)
abstracting: (p35<=1)
states: 112,781 (5)
abstracting: (0<=p88)
states: 112,781 (5)
abstracting: (p88<=0)
states: 109,529 (5)
abstracting: (1<=p38)
states: 6,145 (3)
abstracting: (p38<=1)
states: 112,781 (5)
abstracting: (1<=p35)
states: 2,136 (3)
abstracting: (p35<=1)
states: 112,781 (5)
abstracting: (1<=p35)
states: 2,136 (3)
abstracting: (p35<=1)
states: 112,781 (5)
.
EG iterations: 1
abstracting: (0<=p107)
states: 112,781 (5)
abstracting: (p107<=0)
states: 110,342 (5)
abstracting: (1<=p42)
states: 4,009 (3)
abstracting: (p42<=1)
states: 112,781 (5)
abstracting: (1<=p59)
states: 3,128 (3)
abstracting: (p59<=1)
states: 112,781 (5)
.abstracting: (1<=p59)
states: 3,128 (3)
abstracting: (p59<=1)
states: 112,781 (5)
..............................................
EG iterations: 45
.
EG iterations: 1
-> the formula is TRUE
FORMULA AutonomousCar-PT-01b-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.287sec
totally nodes used: 2496626 (2.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3256873 8774418 12031291
used/not used/entry size/cache size: 10488499 56620365 16 1024MB
basic ops cache: hits/miss/sum: 347273 896886 1244159
used/not used/entry size/cache size: 1609045 15168171 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: 8306 27440 35746
used/not used/entry size/cache size: 27404 8361204 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 64856582
1 2040364
2 183058
3 25623
4 2935
5 278
6 21
7 3
8 0
9 0
>= 10 0
Total processing time: 0m 8.352sec
BK_STOP 1678698644375
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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:5609 (43), effective:409 (3)
initing FirstDep: 0m 0.000sec
iterations count:132 (1), effective:1 (0)
iterations count:2194 (17), effective:188 (1)
iterations count:2034 (15), effective:145 (1)
iterations count:3252 (25), effective:273 (2)
iterations count:2034 (15), effective:145 (1)
iterations count:598 (4), effective:46 (0)
iterations count:1244 (9), effective:101 (0)
iterations count:1244 (9), effective:101 (0)
iterations count:1244 (9), effective:101 (0)
iterations count:2080 (16), effective:159 (1)
iterations count:1234 (9), effective:101 (0)
iterations count:130 (1), effective:1 (0)
iterations count:1370 (10), effective:112 (0)
iterations count:2039 (15), effective:145 (1)
iterations count:131 (1), effective:1 (0)
iterations count:1434 (11), effective:123 (0)
iterations count:2070 (16), effective:157 (1)
iterations count:1907 (14), effective:146 (1)
iterations count:132 (1), effective:2 (0)
iterations count:2519 (19), effective:202 (1)
iterations count:1336 (10), effective:103 (0)
iterations count:2085 (16), effective:178 (1)
iterations count:147 (1), effective:3 (0)
iterations count:1336 (10), effective:103 (0)
iterations count:2085 (16), effective:178 (1)
iterations count:147 (1), effective:3 (0)
iterations count:133 (1), effective:2 (0)
iterations count:1336 (10), effective:103 (0)
iterations count:2085 (16), effective:178 (1)
iterations count:147 (1), effective:3 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-01b"
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-01b, 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-167813599200537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-01b.tgz
mv AutonomousCar-PT-01b 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 ;