About the Execution of Marcie+red for ShieldRVt-PT-001B
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5482.172 | 9282.00 | 13102.00 | 87.20 | TTFFTFFFFTFFTFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978600185.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-001B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600185
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.1K Feb 25 23:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 23:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 23:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 23:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 25 23:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 25 23:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 23:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:23 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 ShieldRVt-PT-001B-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-001B-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679346115666
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=ShieldRVt-PT-001B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:01:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:01:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:01:57] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-20 21:01:57] [INFO ] Transformed 53 places.
[2023-03-20 21:01:57] [INFO ] Transformed 53 transitions.
[2023-03-20 21:01:57] [INFO ] Found NUPN structural information;
[2023-03-20 21:01:57] [INFO ] Parsed PT model containing 53 places and 53 transitions and 124 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-001B-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Applied a total of 0 rules in 9 ms. Remains 53 /53 variables (removed 0) and now considering 53/53 (removed 0) transitions.
// Phase 1: matrix 53 rows 53 cols
[2023-03-20 21:01:57] [INFO ] Computed 5 place invariants in 4 ms
[2023-03-20 21:01:57] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-20 21:01:57] [INFO ] Invariant cache hit.
[2023-03-20 21:01:57] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-20 21:01:57] [INFO ] Invariant cache hit.
[2023-03-20 21:01:57] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 53/53 places, 53/53 transitions.
Support contains 49 out of 53 places after structural reductions.
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 16 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 47 out of 53 places (down from 49) after GAL structural reductions.
FORMULA ShieldRVt-PT-001B-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 101 steps, including 0 resets, run visited all 52 properties in 20 ms. (steps per millisecond=5 )
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 53 transitions.
Computed a total of 16 stabilizing places and 16 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 45 transition count 45
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 45 transition count 45
Applied a total of 16 rules in 4 ms. Remains 45 /53 variables (removed 8) and now considering 45/53 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 45/53 places, 45/53 transitions.
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 52 transition count 34
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 34 transition count 32
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 33 transition count 32
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 39 place count 33 transition count 30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 31 transition count 30
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 47 place count 27 transition count 26
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 27 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 69 place count 18 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 70 place count 17 transition count 16
Applied a total of 70 rules in 10 ms. Remains 17 /53 variables (removed 36) and now considering 16/53 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 17/53 places, 16/53 transitions.
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 42 transition count 42
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 40 transition count 40
Applied a total of 26 rules in 3 ms. Remains 40 /53 variables (removed 13) and now considering 40/53 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 40/53 places, 40/53 transitions.
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 53 transition count 39
Reduce places removed 14 places and 0 transitions.
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 1 with 16 rules applied. Total rules applied 30 place count 39 transition count 37
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 33 place count 38 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 35 place count 36 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 35 place count 36 transition count 34
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 37 place count 35 transition count 34
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 41 place count 31 transition count 30
Iterating global reduction 4 with 4 rules applied. Total rules applied 45 place count 31 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 45 place count 31 transition count 29
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 47 place count 30 transition count 29
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 63 place count 22 transition count 21
Applied a total of 63 rules in 6 ms. Remains 22 /53 variables (removed 31) and now considering 21/53 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 22/53 places, 21/53 transitions.
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 43 transition count 43
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 2 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/53 places, 42/53 transitions.
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 43 transition count 43
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 43 transition count 43
Applied a total of 20 rules in 2 ms. Remains 43 /53 variables (removed 10) and now considering 43/53 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/53 places, 43/53 transitions.
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 52 transition count 36
Reduce places removed 16 places and 0 transitions.
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 1 with 18 rules applied. Total rules applied 34 place count 36 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 35 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 35 transition count 30
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 43 place count 31 transition count 30
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 50 place count 24 transition count 23
Iterating global reduction 3 with 7 rules applied. Total rules applied 57 place count 24 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 57 place count 24 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 63 place count 21 transition count 20
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
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 75 place count 15 transition count 14
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 15 transition count 14
Applied a total of 76 rules in 6 ms. Remains 15 /53 variables (removed 38) and now considering 14/53 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 15/53 places, 14/53 transitions.
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 14 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 42 transition count 42
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Applied a total of 24 rules in 2 ms. Remains 41 /53 variables (removed 12) and now considering 41/53 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 41/53 places, 41/53 transitions.
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:57] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:57] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 44
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 3 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/53 places, 42/53 transitions.
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 49 transition count 49
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 49 transition count 49
Applied a total of 8 rules in 2 ms. Remains 49 /53 variables (removed 4) and now considering 49/53 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 49/53 places, 49/53 transitions.
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:58] [INFO ] Input system was already deterministic with 49 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 42 transition count 42
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 40 transition count 40
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 40 transition count 40
Applied a total of 26 rules in 4 ms. Remains 40 /53 variables (removed 13) and now considering 40/53 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 40/53 places, 40/53 transitions.
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:58] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 46 transition count 46
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 46 transition count 46
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 45 transition count 45
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 45 transition count 45
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 44 transition count 44
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 44 transition count 44
Applied a total of 18 rules in 4 ms. Remains 44 /53 variables (removed 9) and now considering 44/53 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 44/53 places, 44/53 transitions.
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:58] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 53 transition count 36
Reduce places removed 17 places and 0 transitions.
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 1 with 19 rules applied. Total rules applied 36 place count 36 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 35 transition count 34
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 37 place count 35 transition count 30
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 45 place count 31 transition count 30
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 52 place count 24 transition count 23
Iterating global reduction 3 with 7 rules applied. Total rules applied 59 place count 24 transition count 23
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 59 place count 24 transition count 20
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 65 place count 21 transition count 20
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
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 79 place count 14 transition count 13
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 80 place count 14 transition count 13
Applied a total of 80 rules in 7 ms. Remains 14 /53 variables (removed 39) and now considering 13/53 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 14/53 places, 13/53 transitions.
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:58] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 53/53 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 44 transition count 44
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 44 transition count 44
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 43 transition count 43
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 43 transition count 43
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 42 transition count 42
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 42 transition count 42
Applied a total of 22 rules in 4 ms. Remains 42 /53 variables (removed 11) and now considering 42/53 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 42/53 places, 42/53 transitions.
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:01:58] [INFO ] Input system was already deterministic with 42 transitions.
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:01:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:01:58] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 21:01:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 53 places, 53 transitions and 124 arcs took 1 ms.
Total runtime 883 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: 53 NrTr: 53 NrArc: 124)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.260sec
RS generation: 0m 0.009sec
-> reachability set: #nodes 815 (8.2e+02) #states 21,947 (4)
starting MCC model checker
--------------------------
checking: EX [0<=0]
normalized: EX [0<=0]
abstracting: (0<=0)
states: 21,947 (4)
.-> the formula is TRUE
FORMULA ShieldRVt-PT-001B-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AG [[AX [1<=0] | EF [[[p35<=0 & 0<=p35] & [p1<=1 & 1<=p1]]]]]
normalized: ~ [E [true U ~ [[E [true U [[p35<=0 & 0<=p35] & [p1<=1 & 1<=p1]]] | ~ [EX [~ [1<=0]]]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (1<=p1)
states: 8,048 (3)
abstracting: (p1<=1)
states: 21,947 (4)
abstracting: (0<=p35)
states: 21,947 (4)
abstracting: (p35<=0)
states: 19,326 (4)
-> the formula is FALSE
FORMULA ShieldRVt-PT-001B-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.069sec
checking: AG [EF [[[p5<=0 & 0<=p5] & [p21<=1 & 1<=p21]]]]
normalized: ~ [E [true U ~ [E [true U [[p21<=1 & 1<=p21] & [p5<=0 & 0<=p5]]]]]]
abstracting: (0<=p5)
states: 21,947 (4)
abstracting: (p5<=0)
states: 21,946 (4)
abstracting: (1<=p21)
states: 2,348 (3)
abstracting: (p21<=1)
states: 21,947 (4)
-> the formula is FALSE
FORMULA ShieldRVt-PT-001B-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EF [~ [E [[p24<=0 & 0<=p24] U [p0<=1 & 1<=p0]]]]
normalized: E [true U ~ [E [[p24<=0 & 0<=p24] U [p0<=1 & 1<=p0]]]]
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 21,947 (4)
abstracting: (0<=p24)
states: 21,947 (4)
abstracting: (p24<=0)
states: 19,599 (4)
-> the formula is TRUE
FORMULA ShieldRVt-PT-001B-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [EX [~ [E [[p33<=0 & 0<=p33] U [[p28<=0 & 0<=p28] | [p23<=1 & 1<=p23]]]]]]
normalized: E [true U EX [~ [E [[p33<=0 & 0<=p33] U [[p23<=1 & 1<=p23] | [p28<=0 & 0<=p28]]]]]]
abstracting: (0<=p28)
states: 21,947 (4)
abstracting: (p28<=0)
states: 20,116 (4)
abstracting: (1<=p23)
states: 2,348 (3)
abstracting: (p23<=1)
states: 21,947 (4)
abstracting: (0<=p33)
states: 21,947 (4)
abstracting: (p33<=0)
states: 19,764 (4)
.-> the formula is TRUE
FORMULA ShieldRVt-PT-001B-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: EF [~ [A [[p26<=1 & 1<=p26] U E [[[p50<=0 & 0<=p50] | [p38<=1 & 1<=p38]] U [p15<=0 & 0<=p15]]]]]
normalized: E [true U ~ [[~ [EG [~ [E [[[p38<=1 & 1<=p38] | [p50<=0 & 0<=p50]] U [p15<=0 & 0<=p15]]]]] & ~ [E [~ [E [[[p38<=1 & 1<=p38] | [p50<=0 & 0<=p50]] U [p15<=0 & 0<=p15]]] U [~ [[p26<=1 & 1<=p26]] & ~ [E [[[p38<=1 & 1<=p38] | [p50<=0 & 0<=p50]] U [p15<=0 & 0<=p15]]]]]]]]]
abstracting: (0<=p15)
states: 21,947 (4)
abstracting: (p15<=0)
states: 19,790 (4)
abstracting: (0<=p50)
states: 21,947 (4)
abstracting: (p50<=0)
states: 19,565 (4)
abstracting: (1<=p38)
states: 2,577 (3)
abstracting: (p38<=1)
states: 21,947 (4)
abstracting: (1<=p26)
states: 2,348 (3)
abstracting: (p26<=1)
states: 21,947 (4)
abstracting: (0<=p15)
states: 21,947 (4)
abstracting: (p15<=0)
states: 19,790 (4)
abstracting: (0<=p50)
states: 21,947 (4)
abstracting: (p50<=0)
states: 19,565 (4)
abstracting: (1<=p38)
states: 2,577 (3)
abstracting: (p38<=1)
states: 21,947 (4)
abstracting: (0<=p15)
states: 21,947 (4)
abstracting: (p15<=0)
states: 19,790 (4)
abstracting: (0<=p50)
states: 21,947 (4)
abstracting: (p50<=0)
states: 19,565 (4)
abstracting: (1<=p38)
states: 2,577 (3)
abstracting: (p38<=1)
states: 21,947 (4)
...........
EG iterations: 11
-> the formula is TRUE
FORMULA ShieldRVt-PT-001B-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.025sec
checking: AG [[AX [EF [[~ [[p27<=0 & 0<=p27]] & ~ [[p38<=1 & 1<=p38]]]]] & [EX [[[p19<=0 & 0<=p19] | [p41<=1 & 1<=p41]]] & AF [[p5<=0 & 0<=p5]]]]]
normalized: ~ [E [true U ~ [[[~ [EG [~ [[p5<=0 & 0<=p5]]]] & EX [[[p41<=1 & 1<=p41] | [p19<=0 & 0<=p19]]]] & ~ [EX [~ [E [true U [~ [[p38<=1 & 1<=p38]] & ~ [[p27<=0 & 0<=p27]]]]]]]]]]]
abstracting: (0<=p27)
states: 21,947 (4)
abstracting: (p27<=0)
states: 19,417 (4)
abstracting: (1<=p38)
states: 2,577 (3)
abstracting: (p38<=1)
states: 21,947 (4)
.abstracting: (0<=p19)
states: 21,947 (4)
abstracting: (p19<=0)
states: 20,868 (4)
abstracting: (1<=p41)
states: 51
abstracting: (p41<=1)
states: 21,947 (4)
.abstracting: (0<=p5)
states: 21,947 (4)
abstracting: (p5<=0)
states: 21,946 (4)
..
EG iterations: 2
-> the formula is FALSE
FORMULA ShieldRVt-PT-001B-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: EF [[AG [EX [[p37<=1 & 1<=p37]]] & [EG [EX [[p39<=0 & 0<=p39]]] & [[p8<=0 & 0<=p8] | [[p29<=1 & 1<=p29] | [[p34<=0 & 0<=p34] & [p6<=1 & 1<=p6]]]]]]]
normalized: E [true U [[[[[[p6<=1 & 1<=p6] & [p34<=0 & 0<=p34]] | [p29<=1 & 1<=p29]] | [p8<=0 & 0<=p8]] & EG [EX [[p39<=0 & 0<=p39]]]] & ~ [E [true U ~ [EX [[p37<=1 & 1<=p37]]]]]]]
abstracting: (1<=p37)
states: 2,621 (3)
abstracting: (p37<=1)
states: 21,947 (4)
.abstracting: (0<=p39)
states: 21,947 (4)
abstracting: (p39<=0)
states: 19,226 (4)
..............
EG iterations: 13
abstracting: (0<=p8)
states: 21,947 (4)
abstracting: (p8<=0)
states: 20,868 (4)
abstracting: (1<=p29)
states: 1,831 (3)
abstracting: (p29<=1)
states: 21,947 (4)
abstracting: (0<=p34)
states: 21,947 (4)
abstracting: (p34<=0)
states: 19,326 (4)
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 21,947 (4)
-> the formula is FALSE
FORMULA ShieldRVt-PT-001B-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.038sec
checking: E [[~ [AG [~ [[p42<=0 & 0<=p42]]]] | [p52<=1 & 1<=p52]] U AG [[[p16<=1 & 1<=p16] & [~ [AG [[p4<=0 & 0<=p4]]] | [~ [[p31<=1 & 1<=p31]] & [[p36<=0 & 0<=p36] | [p49<=1 & 1<=p49]]]]]]]
normalized: E [[[p52<=1 & 1<=p52] | E [true U [p42<=0 & 0<=p42]]] U ~ [E [true U ~ [[[[[[p49<=1 & 1<=p49] | [p36<=0 & 0<=p36]] & ~ [[p31<=1 & 1<=p31]]] | E [true U ~ [[p4<=0 & 0<=p4]]]] & [p16<=1 & 1<=p16]]]]]]
abstracting: (1<=p16)
states: 2,094 (3)
abstracting: (p16<=1)
states: 21,947 (4)
abstracting: (0<=p4)
states: 21,947 (4)
abstracting: (p4<=0)
states: 21,946 (4)
abstracting: (1<=p31)
states: 1,202 (3)
abstracting: (p31<=1)
states: 21,947 (4)
abstracting: (0<=p36)
states: 21,947 (4)
abstracting: (p36<=0)
states: 19,326 (4)
abstracting: (1<=p49)
states: 2,626 (3)
abstracting: (p49<=1)
states: 21,947 (4)
abstracting: (0<=p42)
states: 21,947 (4)
abstracting: (p42<=0)
states: 21,878 (4)
abstracting: (1<=p52)
states: 69
abstracting: (p52<=1)
states: 21,947 (4)
-> the formula is FALSE
FORMULA ShieldRVt-PT-001B-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AX [~ [A [E [EF [[p4<=0 & 0<=p4]] U EG [[[p4<=0 & 0<=p4] | [p45<=1 & 1<=p45]]]] U AG [[[[p50<=0 & 0<=p50] | [[p4<=1 & 1<=p4] | [p51<=1 & 1<=p51]]] & ~ [[p6<=0 & 0<=p6]]]]]]]
normalized: ~ [EX [[~ [EG [E [true U ~ [[~ [[p6<=0 & 0<=p6]] & [[[p51<=1 & 1<=p51] | [p4<=1 & 1<=p4]] | [p50<=0 & 0<=p50]]]]]]] & ~ [E [E [true U ~ [[~ [[p6<=0 & 0<=p6]] & [[[p51<=1 & 1<=p51] | [p4<=1 & 1<=p4]] | [p50<=0 & 0<=p50]]]]] U [~ [E [E [true U [p4<=0 & 0<=p4]] U EG [[[p45<=1 & 1<=p45] | [p4<=0 & 0<=p4]]]]] & E [true U ~ [[~ [[p6<=0 & 0<=p6]] & [[[p51<=1 & 1<=p51] | [p4<=1 & 1<=p4]] | [p50<=0 & 0<=p50]]]]]]]]]]]
abstracting: (0<=p50)
states: 21,947 (4)
abstracting: (p50<=0)
states: 19,565 (4)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 21,947 (4)
abstracting: (1<=p51)
states: 2,728 (3)
abstracting: (p51<=1)
states: 21,947 (4)
abstracting: (0<=p6)
states: 21,947 (4)
abstracting: (p6<=0)
states: 21,944 (4)
abstracting: (0<=p4)
states: 21,947 (4)
abstracting: (p4<=0)
states: 21,946 (4)
abstracting: (1<=p45)
states: 1,886 (3)
abstracting: (p45<=1)
states: 21,947 (4)
..
EG iterations: 2
abstracting: (0<=p4)
states: 21,947 (4)
abstracting: (p4<=0)
states: 21,946 (4)
abstracting: (0<=p50)
states: 21,947 (4)
abstracting: (p50<=0)
states: 19,565 (4)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 21,947 (4)
abstracting: (1<=p51)
states: 2,728 (3)
abstracting: (p51<=1)
states: 21,947 (4)
abstracting: (0<=p6)
states: 21,947 (4)
abstracting: (p6<=0)
states: 21,944 (4)
abstracting: (0<=p50)
states: 21,947 (4)
abstracting: (p50<=0)
states: 19,565 (4)
abstracting: (1<=p4)
states: 1
abstracting: (p4<=1)
states: 21,947 (4)
abstracting: (1<=p51)
states: 2,728 (3)
abstracting: (p51<=1)
states: 21,947 (4)
abstracting: (0<=p6)
states: 21,947 (4)
abstracting: (p6<=0)
states: 21,944 (4)
EG iterations: 0
.-> the formula is TRUE
FORMULA ShieldRVt-PT-001B-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [E [AF [[EX [[0<=p5 & p5<=0]] | [EF [[p44<=1 & 1<=p44]] | [EX [[[p43<=0 & 0<=p43] | [p8<=1 & 1<=p8]]] & [[p19<=0 & 0<=p19] | [p14<=1 & 1<=p14]]]]]] U AX [AG [~ [[[p47<=0 & 0<=p47] | [p45<=1 & 1<=p45]]]]]]]
normalized: ~ [EG [~ [E [~ [EG [~ [[[[[[p14<=1 & 1<=p14] | [p19<=0 & 0<=p19]] & EX [[[p8<=1 & 1<=p8] | [p43<=0 & 0<=p43]]]] | E [true U [p44<=1 & 1<=p44]]] | EX [[0<=p5 & p5<=0]]]]]] U ~ [EX [E [true U [[p45<=1 & 1<=p45] | [p47<=0 & 0<=p47]]]]]]]]]
abstracting: (0<=p47)
states: 21,947 (4)
abstracting: (p47<=0)
states: 19,321 (4)
abstracting: (1<=p45)
states: 1,886 (3)
abstracting: (p45<=1)
states: 21,947 (4)
.abstracting: (p5<=0)
states: 21,946 (4)
abstracting: (0<=p5)
states: 21,947 (4)
.abstracting: (1<=p44)
states: 2,626 (3)
abstracting: (p44<=1)
states: 21,947 (4)
abstracting: (0<=p43)
states: 21,947 (4)
abstracting: (p43<=0)
states: 20,267 (4)
abstracting: (1<=p8)
states: 1,079 (3)
abstracting: (p8<=1)
states: 21,947 (4)
.abstracting: (0<=p19)
states: 21,947 (4)
abstracting: (p19<=0)
states: 20,868 (4)
abstracting: (1<=p14)
states: 2,157 (3)
abstracting: (p14<=1)
states: 21,947 (4)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVt-PT-001B-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: [AX [[[p25<=0 & 0<=p25] | AF [[[p45<=0 & 0<=p45] & [p17<=1 & 1<=p17]]]]] & [AX [[p40<=1 & 1<=p40]] & ~ [A [EG [[AG [[p27<=0 & 0<=p27]] & EF [[[p50<=0 & 0<=p50] | [p49<=1 & 1<=p49]]]]] U [~ [AF [[[p22<=0 & 0<=p22] | [p46<=1 & 1<=p46]]]] & EX [~ [[[p22<=0 & 0<=p22] | [p29<=1 & 1<=p29]]]]]]]]]
normalized: [[~ [[~ [EG [~ [[EX [~ [[[p29<=1 & 1<=p29] | [p22<=0 & 0<=p22]]]] & EG [~ [[[p46<=1 & 1<=p46] | [p22<=0 & 0<=p22]]]]]]]] & ~ [E [~ [[EX [~ [[[p29<=1 & 1<=p29] | [p22<=0 & 0<=p22]]]] & EG [~ [[[p46<=1 & 1<=p46] | [p22<=0 & 0<=p22]]]]]] U [~ [EG [[E [true U [[p49<=1 & 1<=p49] | [p50<=0 & 0<=p50]]] & ~ [E [true U ~ [[p27<=0 & 0<=p27]]]]]]] & ~ [[EX [~ [[[p29<=1 & 1<=p29] | [p22<=0 & 0<=p22]]]] & EG [~ [[[p46<=1 & 1<=p46] | [p22<=0 & 0<=p22]]]]]]]]]]] & ~ [EX [~ [[p40<=1 & 1<=p40]]]]] & ~ [EX [~ [[~ [EG [~ [[[p17<=1 & 1<=p17] & [p45<=0 & 0<=p45]]]]] | [p25<=0 & 0<=p25]]]]]]
abstracting: (0<=p25)
states: 21,947 (4)
abstracting: (p25<=0)
states: 19,599 (4)
abstracting: (0<=p45)
states: 21,947 (4)
abstracting: (p45<=0)
states: 20,061 (4)
abstracting: (1<=p17)
states: 2,201 (3)
abstracting: (p17<=1)
states: 21,947 (4)
....................
EG iterations: 20
.abstracting: (1<=p40)
states: 51
abstracting: (p40<=1)
states: 21,947 (4)
.abstracting: (0<=p22)
states: 21,947 (4)
abstracting: (p22<=0)
states: 19,885 (4)
abstracting: (1<=p46)
states: 2,626 (3)
abstracting: (p46<=1)
states: 21,947 (4)
...............
EG iterations: 15
abstracting: (0<=p22)
states: 21,947 (4)
abstracting: (p22<=0)
states: 19,885 (4)
abstracting: (1<=p29)
states: 1,831 (3)
abstracting: (p29<=1)
states: 21,947 (4)
.abstracting: (0<=p27)
states: 21,947 (4)
abstracting: (p27<=0)
states: 19,417 (4)
abstracting: (0<=p50)
states: 21,947 (4)
abstracting: (p50<=0)
states: 19,565 (4)
abstracting: (1<=p49)
states: 2,626 (3)
abstracting: (p49<=1)
states: 21,947 (4)
.
EG iterations: 1
abstracting: (0<=p22)
states: 21,947 (4)
abstracting: (p22<=0)
states: 19,885 (4)
abstracting: (1<=p46)
states: 2,626 (3)
abstracting: (p46<=1)
states: 21,947 (4)
...............
EG iterations: 15
abstracting: (0<=p22)
states: 21,947 (4)
abstracting: (p22<=0)
states: 19,885 (4)
abstracting: (1<=p29)
states: 1,831 (3)
abstracting: (p29<=1)
states: 21,947 (4)
.abstracting: (0<=p22)
states: 21,947 (4)
abstracting: (p22<=0)
states: 19,885 (4)
abstracting: (1<=p46)
states: 2,626 (3)
abstracting: (p46<=1)
states: 21,947 (4)
...............
EG iterations: 15
abstracting: (0<=p22)
states: 21,947 (4)
abstracting: (p22<=0)
states: 19,885 (4)
abstracting: (1<=p29)
states: 1,831 (3)
abstracting: (p29<=1)
states: 21,947 (4)
..
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldRVt-PT-001B-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.079sec
checking: [E [E [[[p7<=0 & 0<=p7] | [p41<=1 & 1<=p41]] U [[[[p17<=1 & 1<=p17] | [p8<=1 & 1<=p8]] & A [[[p6<=0 & 0<=p6] | [p30<=1 & 1<=p30]] U [p36<=1 & 1<=p36]]] | ~ [AG [[[p2<=0 & 0<=p2] | [p30<=1 & 1<=p30]]]]]] U AX [~ [A [[p14<=1 & 1<=p14] U [[p14<=0 & 0<=p14] | [[p51<=1 & 1<=p51] | [p13<=1 & 1<=p13]]]]]]] | AG [[AG [[p40<=0 & 0<=p40]] & EX [[AX [1<=0] & [p1<=1 & 1<=p1]]]]]]
normalized: [~ [E [true U ~ [[EX [[[p1<=1 & 1<=p1] & ~ [EX [~ [1<=0]]]]] & ~ [E [true U ~ [[p40<=0 & 0<=p40]]]]]]]] | E [E [[[p41<=1 & 1<=p41] | [p7<=0 & 0<=p7]] U [E [true U ~ [[[p30<=1 & 1<=p30] | [p2<=0 & 0<=p2]]]] | [[~ [EG [~ [[p36<=1 & 1<=p36]]]] & ~ [E [~ [[p36<=1 & 1<=p36]] U [~ [[[p30<=1 & 1<=p30] | [p6<=0 & 0<=p6]]] & ~ [[p36<=1 & 1<=p36]]]]]] & [[p8<=1 & 1<=p8] | [p17<=1 & 1<=p17]]]]] U ~ [EX [[~ [EG [~ [[[[p13<=1 & 1<=p13] | [p51<=1 & 1<=p51]] | [p14<=0 & 0<=p14]]]]] & ~ [E [~ [[[[p13<=1 & 1<=p13] | [p51<=1 & 1<=p51]] | [p14<=0 & 0<=p14]]] U [~ [[p14<=1 & 1<=p14]] & ~ [[[[p13<=1 & 1<=p13] | [p51<=1 & 1<=p51]] | [p14<=0 & 0<=p14]]]]]]]]]]]
abstracting: (0<=p14)
states: 21,947 (4)
abstracting: (p14<=0)
states: 19,790 (4)
abstracting: (1<=p51)
states: 2,728 (3)
abstracting: (p51<=1)
states: 21,947 (4)
abstracting: (1<=p13)
states: 2,157 (3)
abstracting: (p13<=1)
states: 21,947 (4)
abstracting: (1<=p14)
states: 2,157 (3)
abstracting: (p14<=1)
states: 21,947 (4)
abstracting: (0<=p14)
states: 21,947 (4)
abstracting: (p14<=0)
states: 19,790 (4)
abstracting: (1<=p51)
states: 2,728 (3)
abstracting: (p51<=1)
states: 21,947 (4)
abstracting: (1<=p13)
states: 2,157 (3)
abstracting: (p13<=1)
states: 21,947 (4)
abstracting: (0<=p14)
states: 21,947 (4)
abstracting: (p14<=0)
states: 19,790 (4)
abstracting: (1<=p51)
states: 2,728 (3)
abstracting: (p51<=1)
states: 21,947 (4)
abstracting: (1<=p13)
states: 2,157 (3)
abstracting: (p13<=1)
states: 21,947 (4)
....................
EG iterations: 20
.abstracting: (1<=p17)
states: 2,201 (3)
abstracting: (p17<=1)
states: 21,947 (4)
abstracting: (1<=p8)
states: 1,079 (3)
abstracting: (p8<=1)
states: 21,947 (4)
abstracting: (1<=p36)
states: 2,621 (3)
abstracting: (p36<=1)
states: 21,947 (4)
abstracting: (0<=p6)
states: 21,947 (4)
abstracting: (p6<=0)
states: 21,944 (4)
abstracting: (1<=p30)
states: 51
abstracting: (p30<=1)
states: 21,947 (4)
abstracting: (1<=p36)
states: 2,621 (3)
abstracting: (p36<=1)
states: 21,947 (4)
abstracting: (1<=p36)
states: 2,621 (3)
abstracting: (p36<=1)
states: 21,947 (4)
....................................................................
EG iterations: 68
abstracting: (0<=p2)
states: 21,947 (4)
abstracting: (p2<=0)
states: 15,589 (4)
abstracting: (1<=p30)
states: 51
abstracting: (p30<=1)
states: 21,947 (4)
abstracting: (0<=p7)
states: 21,947 (4)
abstracting: (p7<=0)
states: 21,831 (4)
abstracting: (1<=p41)
states: 51
abstracting: (p41<=1)
states: 21,947 (4)
abstracting: (0<=p40)
states: 21,947 (4)
abstracting: (p40<=0)
states: 21,896 (4)
abstracting: (1<=0)
states: 0
.abstracting: (1<=p1)
states: 8,048 (3)
abstracting: (p1<=1)
states: 21,947 (4)
.-> the formula is FALSE
FORMULA ShieldRVt-PT-001B-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.301sec
checking: [EX [[[[p1<=0 & 0<=p1] & [p32<=1 & 1<=p32]] & [EF [[[p23<=0 & 0<=p23] & [p37<=1 & 1<=p37]]] & E [[[p38<=0 & 0<=p38] | [p6<=1 & 1<=p6]] U [[p0<=0 & 0<=p0] | [p33<=1 & 1<=p33]]]]]] & [AF [[[EX [[[p3<=0 & 0<=p3] | [p21<=1 & 1<=p21]]] | AG [[p45<=0 & 0<=p45]]] & [p35<=0 & 0<=p35]]] | EX [EF [[[p13<=0 & 0<=p13] & ~ [E [[p28<=1 & 1<=p28] U [p18<=1 & 1<=p18]]]]]]]]
normalized: [[EX [E [true U [~ [E [[p28<=1 & 1<=p28] U [p18<=1 & 1<=p18]]] & [p13<=0 & 0<=p13]]]] | ~ [EG [~ [[[p35<=0 & 0<=p35] & [~ [E [true U ~ [[p45<=0 & 0<=p45]]]] | EX [[[p21<=1 & 1<=p21] | [p3<=0 & 0<=p3]]]]]]]]] & EX [[[E [[[p6<=1 & 1<=p6] | [p38<=0 & 0<=p38]] U [[p33<=1 & 1<=p33] | [p0<=0 & 0<=p0]]] & E [true U [[p37<=1 & 1<=p37] & [p23<=0 & 0<=p23]]]] & [[p32<=1 & 1<=p32] & [p1<=0 & 0<=p1]]]]]
abstracting: (0<=p1)
states: 21,947 (4)
abstracting: (p1<=0)
states: 13,899 (4)
abstracting: (1<=p32)
states: 2,621 (3)
abstracting: (p32<=1)
states: 21,947 (4)
abstracting: (0<=p23)
states: 21,947 (4)
abstracting: (p23<=0)
states: 19,599 (4)
abstracting: (1<=p37)
states: 2,621 (3)
abstracting: (p37<=1)
states: 21,947 (4)
abstracting: (0<=p0)
states: 21,947 (4)
abstracting: (p0<=0)
states: 21,946 (4)
abstracting: (1<=p33)
states: 2,183 (3)
abstracting: (p33<=1)
states: 21,947 (4)
abstracting: (0<=p38)
states: 21,947 (4)
abstracting: (p38<=0)
states: 19,370 (4)
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 21,947 (4)
.abstracting: (0<=p3)
states: 21,947 (4)
abstracting: (p3<=0)
states: 14,407 (4)
abstracting: (1<=p21)
states: 2,348 (3)
abstracting: (p21<=1)
states: 21,947 (4)
.abstracting: (0<=p45)
states: 21,947 (4)
abstracting: (p45<=0)
states: 20,061 (4)
abstracting: (0<=p35)
states: 21,947 (4)
abstracting: (p35<=0)
states: 19,326 (4)
..............................
EG iterations: 30
abstracting: (0<=p13)
states: 21,947 (4)
abstracting: (p13<=0)
states: 19,790 (4)
abstracting: (1<=p18)
states: 1,079 (3)
abstracting: (p18<=1)
states: 21,947 (4)
abstracting: (1<=p28)
states: 1,831 (3)
abstracting: (p28<=1)
states: 21,947 (4)
.-> the formula is FALSE
FORMULA ShieldRVt-PT-001B-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.152sec
totally nodes used: 628265 (6.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 707511 1613102 2320613
used/not used/entry size/cache size: 2167604 64941260 16 1024MB
basic ops cache: hits/miss/sum: 159888 320544 480432
used/not used/entry size/cache size: 641159 16136057 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: 4988 11457 16445
used/not used/entry size/cache size: 11455 8377153 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 66517190
1 558805
2 29454
3 3132
4 262
5 18
6 3
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 6.656sec
BK_STOP 1679346124948
--------------------
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:1013 (19), effective:185 (3)
initing FirstDep: 0m 0.000sec
iterations count:386 (7), effective:52 (0)
iterations count:730 (13), effective:125 (2)
iterations count:606 (11), effective:94 (1)
iterations count:730 (13), effective:125 (2)
iterations count:53 (1), effective:0 (0)
iterations count:65 (1), effective:1 (0)
iterations count:92 (1), effective:1 (0)
iterations count:277 (5), effective:44 (0)
iterations count:57 (1), effective:1 (0)
iterations count:57 (1), effective:1 (0)
iterations count:55 (1), effective:1 (0)
iterations count:57 (1), effective:1 (0)
iterations count:577 (10), effective:101 (1)
iterations count:373 (7), effective:57 (1)
iterations count:837 (15), effective:144 (2)
iterations count:62 (1), effective:4 (0)
iterations count:65 (1), effective:1 (0)
iterations count:113 (2), effective:15 (0)
iterations count:55 (1), effective:1 (0)
iterations count:56 (1), effective:1 (0)
iterations count:54 (1), effective:1 (0)
iterations count:66 (1), effective:2 (0)
iterations count:56 (1), effective:1 (0)
iterations count:56 (1), effective:1 (0)
iterations count:55 (1), effective:1 (0)
iterations count:498 (9), effective:79 (1)
iterations count:795 (15), effective:139 (2)
iterations count:371 (7), effective:56 (1)
iterations count:58 (1), effective:1 (0)
iterations count:53 (1), effective:0 (0)
iterations count:68 (1), effective:3 (0)
iterations count:497 (9), effective:78 (1)
iterations count:53 (1), effective:0 (0)
iterations count:53 (1), effective:0 (0)
iterations count:75 (1), effective:6 (0)
iterations count:53 (1), effective:0 (0)
iterations count:607 (11), effective:98 (1)
iterations count:65 (1), effective:1 (0)
iterations count:603 (11), effective:94 (1)
iterations count:57 (1), effective:2 (0)
iterations count:83 (1), effective:4 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-001B"
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 ShieldRVt-PT-001B, 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 r426-tajo-167905978600185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001B.tgz
mv ShieldRVt-PT-001B 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 ;