About the Execution of Marcie+red for ShieldPPPt-PT-001A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5452.260 | 9156.00 | 14190.00 | 51.80 | TFFFTTFTTFFFFFFT | 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.r394-oct2-167903718000529.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 ShieldPPPt-PT-001A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903718000529
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.8K Feb 25 20:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 20:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 20:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 20:53 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 20:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Feb 25 20:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 20:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 20:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 7.4K 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 ShieldPPPt-PT-001A-CTLCardinality-00
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldPPPt-PT-001A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679523012394
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=ShieldPPPt-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 22:10:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 22:10:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 22:10:15] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-22 22:10:15] [INFO ] Transformed 28 places.
[2023-03-22 22:10:15] [INFO ] Transformed 21 transitions.
[2023-03-22 22:10:15] [INFO ] Found NUPN structural information;
[2023-03-22 22:10:15] [INFO ] Parsed PT model containing 28 places and 21 transitions and 78 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPt-PT-001A-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 14 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 28 cols
[2023-03-22 22:10:15] [INFO ] Computed 12 place invariants in 3 ms
[2023-03-22 22:10:15] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-22 22:10:15] [INFO ] Invariant cache hit.
[2023-03-22 22:10:15] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-22 22:10:15] [INFO ] Invariant cache hit.
[2023-03-22 22:10:15] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 720 ms. Remains : 28/28 places, 20/20 transitions.
Support contains 26 out of 28 places after structural reductions.
[2023-03-22 22:10:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 16 ms
[2023-03-22 22:10:16] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldPPPt-PT-001A-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 5 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
Finished random walk after 499 steps, including 0 resets, run visited all 27 properties in 30 ms. (steps per millisecond=16 )
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 4 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 20/20 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 27 transition count 19
Applied a total of 2 rules in 7 ms. Remains 27 /28 variables (removed 1) and now considering 19/20 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 27/28 places, 19/20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 19 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 20/20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Input system was already deterministic with 20 transitions.
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 22:10:16] [INFO ] Flatten gal took : 1 ms
[2023-03-22 22:10:16] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-22 22:10:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 28 places, 20 transitions and 76 arcs took 0 ms.
Total runtime 1501 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: 28 NrTr: 20 NrArc: 76)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.968sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 73 (7.3e+01) #states 8,001 (3)
starting MCC model checker
--------------------------
checking: EG [AX [1<=0]]
normalized: EG [~ [EX [~ [1<=0]]]]
abstracting: (1<=0)
states: 0
..
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.024sec
checking: AG [EX [AG [EX [[p22<=0 & 0<=p22]]]]]
normalized: ~ [E [true U ~ [EX [~ [E [true U ~ [EX [[p22<=0 & 0<=p22]]]]]]]]]
abstracting: (0<=p22)
states: 8,001 (3)
abstracting: (p22<=0)
states: 4,001 (3)
..-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[AX [[[p22<=0 & 0<=p22] | [p7<=0 & 0<=p7]]] & EG [AX [EG [[p15<=1 & 1<=p15]]]]]]
normalized: E [true U [EG [~ [EX [~ [EG [[p15<=1 & 1<=p15]]]]]] & ~ [EX [~ [[[p7<=0 & 0<=p7] | [p22<=0 & 0<=p22]]]]]]]
abstracting: (0<=p22)
states: 8,001 (3)
abstracting: (p22<=0)
states: 4,001 (3)
abstracting: (0<=p7)
states: 8,001 (3)
abstracting: (p7<=0)
states: 4,801 (3)
.abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
.........
EG iterations: 9
..
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[AX [1<=0] | AX [[[[p1<=0 & 0<=p1] & [p22<=1 & 1<=p22]] & [[p14<=0 & 0<=p14] & [p25<=1 & 1<=p25]]]]]]
normalized: ~ [E [true U ~ [[~ [EX [~ [[[[p25<=1 & 1<=p25] & [p14<=0 & 0<=p14]] & [[p22<=1 & 1<=p22] & [p1<=0 & 0<=p1]]]]]] | ~ [EX [~ [1<=0]]]]]]]
abstracting: (1<=0)
states: 0
.abstracting: (0<=p1)
states: 8,001 (3)
abstracting: (p1<=0)
states: 4,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (0<=p14)
states: 8,001 (3)
abstracting: (p14<=0)
states: 4,801 (3)
abstracting: (1<=p25)
states: 4,000 (3)
abstracting: (p25<=1)
states: 8,001 (3)
.-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [A [E [[[p14<=1 & 1<=p14] | [[p15<=0 & 0<=p15] | [p8<=1 & 1<=p8]]] U EG [[p27<=1 & 1<=p27]]] U EF [[p27<=1 & 1<=p27]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [true U [p27<=1 & 1<=p27]]]]] & ~ [E [~ [E [true U [p27<=1 & 1<=p27]]] U [~ [E [[[[p8<=1 & 1<=p8] | [p15<=0 & 0<=p15]] | [p14<=1 & 1<=p14]] U EG [[p27<=1 & 1<=p27]]]] & ~ [E [true U [p27<=1 & 1<=p27]]]]]]]]]]
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
..................................
EG iterations: 34
abstracting: (1<=p14)
states: 3,200 (3)
abstracting: (p14<=1)
states: 8,001 (3)
abstracting: (0<=p15)
states: 8,001 (3)
abstracting: (p15<=0)
states: 6,401 (3)
abstracting: (1<=p8)
states: 3,200 (3)
abstracting: (p8<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
abstracting: (1<=p27)
states: 4,000 (3)
abstracting: (p27<=1)
states: 8,001 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EX [AX [~ [E [~ [[[p21<=0 & 0<=p21] | [p22<=1 & 1<=p22]]] U [[p9<=1 & 1<=p9] & [[p15<=0 & 0<=p15] | [p22<=1 & 1<=p22]]]]]]]
normalized: EX [~ [EX [E [~ [[[p22<=1 & 1<=p22] | [p21<=0 & 0<=p21]]] U [[[p15<=0 & 0<=p15] | [p22<=1 & 1<=p22]] & [p9<=1 & 1<=p9]]]]]]
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (0<=p15)
states: 8,001 (3)
abstracting: (p15<=0)
states: 6,401 (3)
abstracting: (0<=p21)
states: 8,001 (3)
abstracting: (p21<=0)
states: 4,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
..-> the formula is TRUE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [A [AG [[[p7<=0 & 0<=p7] | [p0<=1 & 1<=p0]]] U AF [[p9<=1 & 1<=p9]]] & [AX [[[[p23<=1 & 1<=p23] | [[p1<=0 & 0<=p1] | [p22<=1 & 1<=p22]]] & [p0<=0 & 0<=p0]]] & EX [EX [~ [A [~ [[p22<=0 & 0<=p22]] U EF [[p15<=1 & 1<=p15]]]]]]]]
normalized: [[EX [EX [~ [[~ [EG [~ [E [true U [p15<=1 & 1<=p15]]]]] & ~ [E [~ [E [true U [p15<=1 & 1<=p15]]] U [[p22<=0 & 0<=p22] & ~ [E [true U [p15<=1 & 1<=p15]]]]]]]]]] & ~ [EX [~ [[[p0<=0 & 0<=p0] & [[[p22<=1 & 1<=p22] | [p1<=0 & 0<=p1]] | [p23<=1 & 1<=p23]]]]]]] & [~ [EG [EG [~ [[p9<=1 & 1<=p9]]]]] & ~ [E [EG [~ [[p9<=1 & 1<=p9]]] U [E [true U ~ [[[p0<=1 & 1<=p0] | [p7<=0 & 0<=p7]]]] & EG [~ [[p9<=1 & 1<=p9]]]]]]]]
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (0<=p7)
states: 8,001 (3)
abstracting: (p7<=0)
states: 4,801 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 8,001 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p23)
states: 4,000 (3)
abstracting: (p23<=1)
states: 8,001 (3)
abstracting: (0<=p1)
states: 8,001 (3)
abstracting: (p1<=0)
states: 4,001 (3)
abstracting: (1<=p22)
states: 4,000 (3)
abstracting: (p22<=1)
states: 8,001 (3)
abstracting: (0<=p0)
states: 8,001 (3)
abstracting: (p0<=0)
states: 8,000 (3)
.abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (0<=p22)
states: 8,001 (3)
abstracting: (p22<=0)
states: 4,001 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
.
EG iterations: 1
..-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[A [~ [EF [[p4<=0 & 0<=p4]]] U AG [[[p18<=0 & 0<=p18] | [p9<=1 & 1<=p9]]]] | [EG [AG [[~ [[p20<=0 & 0<=p20]] & ~ [[p16<=1 & 1<=p16]]]]] & [[[p13<=0 & 0<=p13] | EF [[p22<=0 & 0<=p22]]] & [EX [[p14<=0 & 0<=p14]] | [AG [[[p17<=0 & 0<=p17] & [p21<=1 & 1<=p21]]] & EG [[p1<=0 & 0<=p1]]]]]]]]
normalized: E [true U [[[[E [true U [p22<=0 & 0<=p22]] | [p13<=0 & 0<=p13]] & [[EG [[p1<=0 & 0<=p1]] & ~ [E [true U ~ [[[p21<=1 & 1<=p21] & [p17<=0 & 0<=p17]]]]]] | EX [[p14<=0 & 0<=p14]]]] & EG [~ [E [true U ~ [[~ [[p16<=1 & 1<=p16]] & ~ [[p20<=0 & 0<=p20]]]]]]]] | [~ [EG [E [true U ~ [[[p9<=1 & 1<=p9] | [p18<=0 & 0<=p18]]]]]] & ~ [E [E [true U ~ [[[p9<=1 & 1<=p9] | [p18<=0 & 0<=p18]]]] U [E [true U [p4<=0 & 0<=p4]] & E [true U ~ [[[p9<=1 & 1<=p9] | [p18<=0 & 0<=p18]]]]]]]]]]
abstracting: (0<=p18)
states: 8,001 (3)
abstracting: (p18<=0)
states: 4,801 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (0<=p4)
states: 8,001 (3)
abstracting: (p4<=0)
states: 4,001 (3)
abstracting: (0<=p18)
states: 8,001 (3)
abstracting: (p18<=0)
states: 4,801 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
abstracting: (0<=p18)
states: 8,001 (3)
abstracting: (p18<=0)
states: 4,801 (3)
abstracting: (1<=p9)
states: 3,200 (3)
abstracting: (p9<=1)
states: 8,001 (3)
EG iterations: 0
abstracting: (0<=p20)
states: 8,001 (3)
abstracting: (p20<=0)
states: 4,001 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
.
EG iterations: 1
abstracting: (0<=p14)
states: 8,001 (3)
abstracting: (p14<=0)
states: 4,801 (3)
.abstracting: (0<=p17)
states: 8,001 (3)
abstracting: (p17<=0)
states: 4,801 (3)
abstracting: (1<=p21)
states: 4,000 (3)
abstracting: (p21<=1)
states: 8,001 (3)
abstracting: (0<=p1)
states: 8,001 (3)
abstracting: (p1<=0)
states: 4,001 (3)
..
EG iterations: 2
abstracting: (0<=p13)
states: 8,001 (3)
abstracting: (p13<=0)
states: 4,801 (3)
abstracting: (0<=p22)
states: 8,001 (3)
abstracting: (p22<=0)
states: 4,001 (3)
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: A [[AF [[[p0<=0 & 0<=p0] | A [[p26<=0 & 0<=p26] U [p24<=0 & 0<=p24]]]] & [E [[p12<=0 & 0<=p12] U EG [[[p15<=1 & 1<=p15] & [[p27<=0 & 0<=p27] | [p15<=1 & 1<=p15]]]]] | [[p19<=0 & 0<=p19] | [p16<=1 & 1<=p16]]]] U [AG [[[~ [[[p9<=0 & 0<=p9] | [p16<=1 & 1<=p16]]] | [[[p10<=0 & 0<=p10] | [p11<=1 & 1<=p11]] & [[p2<=0 & 0<=p2] | [[p5<=0 & 0<=p5] | [p2<=1 & 1<=p2]]]]] | [[p10<=0 & 0<=p10] | [p15<=1 & 1<=p15]]]] & EG [[~ [[AG [[p12<=1 & 1<=p12]] & [p17<=1 & 1<=p17]]] | ~ [EX [0<=0]]]]]]
normalized: [~ [EG [~ [[EG [[~ [EX [0<=0]] | ~ [[[p17<=1 & 1<=p17] & ~ [E [true U ~ [[p12<=1 & 1<=p12]]]]]]]] & ~ [E [true U ~ [[[[p15<=1 & 1<=p15] | [p10<=0 & 0<=p10]] | [[[[[p2<=1 & 1<=p2] | [p5<=0 & 0<=p5]] | [p2<=0 & 0<=p2]] & [[p11<=1 & 1<=p11] | [p10<=0 & 0<=p10]]] | ~ [[[p16<=1 & 1<=p16] | [p9<=0 & 0<=p9]]]]]]]]]]]] & ~ [E [~ [[EG [[~ [EX [0<=0]] | ~ [[[p17<=1 & 1<=p17] & ~ [E [true U ~ [[p12<=1 & 1<=p12]]]]]]]] & ~ [E [true U ~ [[[[p15<=1 & 1<=p15] | [p10<=0 & 0<=p10]] | [[[[[p2<=1 & 1<=p2] | [p5<=0 & 0<=p5]] | [p2<=0 & 0<=p2]] & [[p11<=1 & 1<=p11] | [p10<=0 & 0<=p10]]] | ~ [[[p16<=1 & 1<=p16] | [p9<=0 & 0<=p9]]]]]]]]]] U [~ [[[[[p16<=1 & 1<=p16] | [p19<=0 & 0<=p19]] | E [[p12<=0 & 0<=p12] U EG [[[[p15<=1 & 1<=p15] | [p27<=0 & 0<=p27]] & [p15<=1 & 1<=p15]]]]] & ~ [EG [~ [[[~ [EG [~ [[p24<=0 & 0<=p24]]]] & ~ [E [~ [[p24<=0 & 0<=p24]] U [~ [[p26<=0 & 0<=p26]] & ~ [[p24<=0 & 0<=p24]]]]]] | [p0<=0 & 0<=p0]]]]]]] & ~ [[EG [[~ [EX [0<=0]] | ~ [[[p17<=1 & 1<=p17] & ~ [E [true U ~ [[p12<=1 & 1<=p12]]]]]]]] & ~ [E [true U ~ [[[[p15<=1 & 1<=p15] | [p10<=0 & 0<=p10]] | [[[[[p2<=1 & 1<=p2] | [p5<=0 & 0<=p5]] | [p2<=0 & 0<=p2]] & [[p11<=1 & 1<=p11] | [p10<=0 & 0<=p10]]] | ~ [[[p16<=1 & 1<=p16] | [p9<=0 & 0<=p9]]]]]]]]]]]]]]
abstracting: (0<=p9)
states: 8,001 (3)
abstracting: (p9<=0)
states: 4,801 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (0<=p10)
states: 8,001 (3)
abstracting: (p10<=0)
states: 6,401 (3)
abstracting: (1<=p11)
states: 3,200 (3)
abstracting: (p11<=1)
states: 8,001 (3)
abstracting: (0<=p2)
states: 8,001 (3)
abstracting: (p2<=0)
states: 4,001 (3)
abstracting: (0<=p5)
states: 8,001 (3)
abstracting: (p5<=0)
states: 6,401 (3)
abstracting: (1<=p2)
states: 4,000 (3)
abstracting: (p2<=1)
states: 8,001 (3)
abstracting: (0<=p10)
states: 8,001 (3)
abstracting: (p10<=0)
states: 6,401 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (1<=p12)
states: 3,200 (3)
abstracting: (p12<=1)
states: 8,001 (3)
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (p17<=1)
states: 8,001 (3)
abstracting: (0<=0)
states: 8,001 (3)
.
EG iterations: 0
abstracting: (0<=p0)
states: 8,001 (3)
abstracting: (p0<=0)
states: 8,000 (3)
abstracting: (0<=p24)
states: 8,001 (3)
abstracting: (p24<=0)
states: 4,001 (3)
abstracting: (0<=p26)
states: 8,001 (3)
abstracting: (p26<=0)
states: 4,001 (3)
abstracting: (0<=p24)
states: 8,001 (3)
abstracting: (p24<=0)
states: 4,001 (3)
abstracting: (0<=p24)
states: 8,001 (3)
abstracting: (p24<=0)
states: 4,001 (3)
.......................................
EG iterations: 39
.
EG iterations: 1
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (0<=p27)
states: 8,001 (3)
abstracting: (p27<=0)
states: 4,001 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
.........
EG iterations: 9
abstracting: (0<=p12)
states: 8,001 (3)
abstracting: (p12<=0)
states: 4,801 (3)
abstracting: (0<=p19)
states: 8,001 (3)
abstracting: (p19<=0)
states: 4,801 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (0<=p9)
states: 8,001 (3)
abstracting: (p9<=0)
states: 4,801 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (0<=p10)
states: 8,001 (3)
abstracting: (p10<=0)
states: 6,401 (3)
abstracting: (1<=p11)
states: 3,200 (3)
abstracting: (p11<=1)
states: 8,001 (3)
abstracting: (0<=p2)
states: 8,001 (3)
abstracting: (p2<=0)
states: 4,001 (3)
abstracting: (0<=p5)
states: 8,001 (3)
abstracting: (p5<=0)
states: 6,401 (3)
abstracting: (1<=p2)
states: 4,000 (3)
abstracting: (p2<=1)
states: 8,001 (3)
abstracting: (0<=p10)
states: 8,001 (3)
abstracting: (p10<=0)
states: 6,401 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (1<=p12)
states: 3,200 (3)
abstracting: (p12<=1)
states: 8,001 (3)
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (p17<=1)
states: 8,001 (3)
abstracting: (0<=0)
states: 8,001 (3)
.
EG iterations: 0
abstracting: (0<=p9)
states: 8,001 (3)
abstracting: (p9<=0)
states: 4,801 (3)
abstracting: (1<=p16)
states: 3,200 (3)
abstracting: (p16<=1)
states: 8,001 (3)
abstracting: (0<=p10)
states: 8,001 (3)
abstracting: (p10<=0)
states: 6,401 (3)
abstracting: (1<=p11)
states: 3,200 (3)
abstracting: (p11<=1)
states: 8,001 (3)
abstracting: (0<=p2)
states: 8,001 (3)
abstracting: (p2<=0)
states: 4,001 (3)
abstracting: (0<=p5)
states: 8,001 (3)
abstracting: (p5<=0)
states: 6,401 (3)
abstracting: (1<=p2)
states: 4,000 (3)
abstracting: (p2<=1)
states: 8,001 (3)
abstracting: (0<=p10)
states: 8,001 (3)
abstracting: (p10<=0)
states: 6,401 (3)
abstracting: (1<=p15)
states: 1,600 (3)
abstracting: (p15<=1)
states: 8,001 (3)
abstracting: (1<=p12)
states: 3,200 (3)
abstracting: (p12<=1)
states: 8,001 (3)
abstracting: (1<=p17)
states: 3,200 (3)
abstracting: (p17<=1)
states: 8,001 (3)
abstracting: (0<=0)
states: 8,001 (3)
.
EG iterations: 0
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldPPPt-PT-001A-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
totally nodes used: 24070 (2.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16363 50335 66698
used/not used/entry size/cache size: 71188 67037676 16 1024MB
basic ops cache: hits/miss/sum: 5905 14048 19953
used/not used/entry size/cache size: 28630 16748586 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: 447 775 1222
used/not used/entry size/cache size: 775 8387833 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 67085050
1 23563
2 246
3 5
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.907sec
BK_STOP 1679523021550
--------------------
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.013sec
iterations count:311 (15), effective:76 (3)
initing FirstDep: 0m 0.000sec
iterations count:20 (1), effective:0 (0)
iterations count:38 (1), effective:2 (0)
iterations count:38 (1), effective:2 (0)
iterations count:38 (1), effective:2 (0)
iterations count:50 (2), effective:8 (0)
iterations count:94 (4), effective:15 (0)
iterations count:20 (1), effective:0 (0)
iterations count:68 (3), effective:11 (0)
iterations count:68 (3), effective:11 (0)
iterations count:68 (3), effective:11 (0)
iterations count:55 (2), effective:8 (0)
iterations count:32 (1), effective:2 (0)
iterations count:55 (2), effective:8 (0)
iterations count:20 (1), effective:0 (0)
iterations count:55 (2), effective:8 (0)
iterations count:49 (2), effective:9 (0)
iterations count:27 (1), effective:3 (0)
iterations count:22 (1), effective:1 (0)
iterations count:70 (3), effective:11 (0)
iterations count:28 (1), effective:3 (0)
iterations count:43 (2), effective:8 (0)
iterations count:63 (3), effective:10 (0)
iterations count:70 (3), effective:11 (0)
iterations count:28 (1), effective:3 (0)
iterations count:89 (4), effective:16 (0)
iterations count:70 (3), effective:11 (0)
iterations count:28 (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="ShieldPPPt-PT-001A"
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 ShieldPPPt-PT-001A, 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 r394-oct2-167903718000529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-001A.tgz
mv ShieldPPPt-PT-001A 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 ;