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-167905978600193.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-002A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600193
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 23:01 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.3K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 23:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 23:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 23:02 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 6.2K 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-002A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-002A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679346168581

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-002A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:02:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:02:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:02:50] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-20 21:02:50] [INFO ] Transformed 19 places.
[2023-03-20 21:02:50] [INFO ] Transformed 19 transitions.
[2023-03-20 21:02:50] [INFO ] Found NUPN structural information;
[2023-03-20 21:02:50] [INFO ] Parsed PT model containing 19 places and 19 transitions and 74 arcs in 93 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-002A-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002A-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002A-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002A-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 9 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-20 21:02:50] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-20 21:02:50] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-20 21:02:50] [INFO ] Invariant cache hit.
[2023-03-20 21:02:50] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-20 21:02:50] [INFO ] Invariant cache hit.
[2023-03-20 21:02:50] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 260 ms. Remains : 19/19 places, 18/18 transitions.
Support contains 19 out of 19 places after structural reductions.
[2023-03-20 21:02:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 21:02:50] [INFO ] Flatten gal took : 15 ms
FORMULA ShieldRVt-PT-002A-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 21:02:50] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:02:50] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 54) seen :53
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 21:02:50] [INFO ] Invariant cache hit.
[2023-03-20 21:02:51] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 16 transition count 16
Applied a total of 3 rules in 7 ms. Remains 16 /19 variables (removed 3) and now considering 16/18 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 16/19 places, 16/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 5 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 19/19 places, 18/18 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 18 transition count 17
Applied a total of 2 rules in 2 ms. Remains 18 /19 variables (removed 1) and now considering 17/18 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 18/19 places, 17/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:02:51] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:02:51] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 21:02:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 19 places, 18 transitions and 72 arcs took 1 ms.
Total runtime 937 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: 19 NrTr: 18 NrArc: 72)

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

net check time: 0m 0.000sec

init dd package: 0m 3.421sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 45 (4.5e+01) #states 513



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

checking: EG [[0<=p2 & p2<=0]]
normalized: EG [[0<=p2 & p2<=0]]

abstracting: (p2<=0)
states: 257
abstracting: (0<=p2)
states: 513
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [EX [[EF [[p0<=0 & 0<=p0]] | [p14<=1 & 1<=p14]]]]
normalized: E [true U EX [[E [true U [p0<=0 & 0<=p0]] | [p14<=1 & 1<=p14]]]]

abstracting: (1<=p14)
states: 256
abstracting: (p14<=1)
states: 513
abstracting: (0<=p0)
states: 513
abstracting: (p0<=0)
states: 512
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [AF [~ [[[p14<=0 & 0<=p14] | [p0<=1 & 1<=p0]]]] U [p15<=1 & 1<=p15]]
normalized: [~ [EG [~ [[p15<=1 & 1<=p15]]]] & ~ [E [~ [[p15<=1 & 1<=p15]] U [~ [[p15<=1 & 1<=p15]] & EG [[[p0<=1 & 1<=p0] | [p14<=0 & 0<=p14]]]]]]]

abstracting: (0<=p14)
states: 513
abstracting: (p14<=0)
states: 257
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 513
..
EG iterations: 2
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
..........
EG iterations: 10
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EG [AG [EX [[EG [[[p2<=0 & 0<=p2] | [p12<=1 & 1<=p12]]] | [[p18<=0 & 0<=p18] | [p8<=1 & 1<=p8]]]]]]
normalized: EG [~ [E [true U ~ [EX [[[[p8<=1 & 1<=p8] | [p18<=0 & 0<=p18]] | EG [[[p12<=1 & 1<=p12] | [p2<=0 & 0<=p2]]]]]]]]]

abstracting: (0<=p2)
states: 513
abstracting: (p2<=0)
states: 257
abstracting: (1<=p12)
states: 256
abstracting: (p12<=1)
states: 513
.
EG iterations: 1
abstracting: (0<=p18)
states: 513
abstracting: (p18<=0)
states: 257
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
.
EG iterations: 0
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EF [[AG [[[p4<=1 & 1<=p4] & [p11<=0 & 0<=p11]]] | EX [AF [[p5<=0 & 0<=p5]]]]] & AG [[p2<=0 & 0<=p2]]]
normalized: [~ [E [true U ~ [[p2<=0 & 0<=p2]]]] & E [true U [EX [~ [EG [~ [[p5<=0 & 0<=p5]]]]] | ~ [E [true U ~ [[[p11<=0 & 0<=p11] & [p4<=1 & 1<=p4]]]]]]]]

abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (0<=p11)
states: 513
abstracting: (p11<=0)
states: 257
abstracting: (0<=p5)
states: 513
abstracting: (p5<=0)
states: 257
.
EG iterations: 1
.abstracting: (0<=p2)
states: 513
abstracting: (p2<=0)
states: 257
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [AX [[E [EX [[p7<=0 & 0<=p7]] U E [[[p5<=0 & 0<=p5] | [p18<=1 & 1<=p18]] U [[p8<=0 & 0<=p8] | [p7<=1 & 1<=p7]]]] & [[p3<=0 & 0<=p3] | EF [[[p15<=0 & 0<=p15] | [p11<=1 & 1<=p11]]]]]]]
normalized: ~ [E [true U EX [~ [[[E [true U [[p11<=1 & 1<=p11] | [p15<=0 & 0<=p15]]] | [p3<=0 & 0<=p3]] & E [EX [[p7<=0 & 0<=p7]] U E [[[p18<=1 & 1<=p18] | [p5<=0 & 0<=p5]] U [[p7<=1 & 1<=p7] | [p8<=0 & 0<=p8]]]]]]]]]

abstracting: (0<=p8)
states: 513
abstracting: (p8<=0)
states: 257
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (0<=p5)
states: 513
abstracting: (p5<=0)
states: 257
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
abstracting: (0<=p7)
states: 513
abstracting: (p7<=0)
states: 257
.abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [EX [0<=0] U [[p4<=1 & 1<=p4] & [[p7<=0 & 0<=p7] & [E [[A [[p13<=1 & 1<=p13] U [p9<=1 & 1<=p9]] & AX [[p7<=1 & 1<=p7]]] U [p16<=1 & 1<=p16]] | AG [[[[p13<=1 & 1<=p13] | [[p4<=0 & 0<=p4] | [p16<=1 & 1<=p16]]] & ~ [[p16<=0 & 0<=p16]]]]]]]]
normalized: [~ [EG [~ [[[[~ [E [true U ~ [[~ [[p16<=0 & 0<=p16]] & [[[p16<=1 & 1<=p16] | [p4<=0 & 0<=p4]] | [p13<=1 & 1<=p13]]]]]] | E [[~ [EX [~ [[p7<=1 & 1<=p7]]]] & [~ [EG [~ [[p9<=1 & 1<=p9]]]] & ~ [E [~ [[p9<=1 & 1<=p9]] U [~ [[p13<=1 & 1<=p13]] & ~ [[p9<=1 & 1<=p9]]]]]]] U [p16<=1 & 1<=p16]]] & [p7<=0 & 0<=p7]] & [p4<=1 & 1<=p4]]]]] & ~ [E [~ [[[[~ [E [true U ~ [[~ [[p16<=0 & 0<=p16]] & [[[p16<=1 & 1<=p16] | [p4<=0 & 0<=p4]] | [p13<=1 & 1<=p13]]]]]] | E [[~ [EX [~ [[p7<=1 & 1<=p7]]]] & [~ [EG [~ [[p9<=1 & 1<=p9]]]] & ~ [E [~ [[p9<=1 & 1<=p9]] U [~ [[p13<=1 & 1<=p13]] & ~ [[p9<=1 & 1<=p9]]]]]]] U [p16<=1 & 1<=p16]]] & [p7<=0 & 0<=p7]] & [p4<=1 & 1<=p4]]] U [~ [[[[~ [E [true U ~ [[~ [[p16<=0 & 0<=p16]] & [[[p16<=1 & 1<=p16] | [p4<=0 & 0<=p4]] | [p13<=1 & 1<=p13]]]]]] | E [[~ [EX [~ [[p7<=1 & 1<=p7]]]] & [~ [EG [~ [[p9<=1 & 1<=p9]]]] & ~ [E [~ [[p9<=1 & 1<=p9]] U [~ [[p13<=1 & 1<=p13]] & ~ [[p9<=1 & 1<=p9]]]]]]] U [p16<=1 & 1<=p16]]] & [p7<=0 & 0<=p7]] & [p4<=1 & 1<=p4]]] & ~ [EX [0<=0]]]]]]

abstracting: (0<=0)
states: 513
.abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (0<=p7)
states: 513
abstracting: (p7<=0)
states: 257
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (0<=p4)
states: 513
abstracting: (p4<=0)
states: 257
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (0<=p16)
states: 513
abstracting: (p16<=0)
states: 257
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (0<=p7)
states: 513
abstracting: (p7<=0)
states: 257
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (0<=p4)
states: 513
abstracting: (p4<=0)
states: 257
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (0<=p16)
states: 513
abstracting: (p16<=0)
states: 257
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (0<=p7)
states: 513
abstracting: (p7<=0)
states: 257
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (0<=p4)
states: 513
abstracting: (p4<=0)
states: 257
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (0<=p16)
states: 513
abstracting: (p16<=0)
states: 257
..
EG iterations: 2
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [[EF [[AG [[[p7<=0 & 0<=p7] & [p4<=1 & 1<=p4]]] | EF [[[[p18<=0 & 0<=p18] | [p4<=1 & 1<=p4]] & [p9<=0 & 0<=p9]]]]] & AX [EG [[AX [[[p10<=0 & 0<=p10] & [p1<=1 & 1<=p1]]] | A [[[p0<=0 & 0<=p0] | [p3<=1 & 1<=p3]] U [p11<=1 & 1<=p11]]]]]] & [AX [[[p4<=0 & 0<=p4] & [p5<=1 & 1<=p5]]] & EG [[[p17<=0 & 0<=p17] | [p6<=1 & 1<=p6]]]]]
normalized: [[E [true U [E [true U [[[p4<=1 & 1<=p4] | [p18<=0 & 0<=p18]] & [p9<=0 & 0<=p9]]] | ~ [E [true U ~ [[[p4<=1 & 1<=p4] & [p7<=0 & 0<=p7]]]]]]] & ~ [EX [~ [EG [[[~ [EG [~ [[p11<=1 & 1<=p11]]]] & ~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[[p3<=1 & 1<=p3] | [p0<=0 & 0<=p0]]] & ~ [[p11<=1 & 1<=p11]]]]]] | ~ [EX [~ [[[p1<=1 & 1<=p1] & [p10<=0 & 0<=p10]]]]]]]]]]] & [EG [[[p6<=1 & 1<=p6] | [p17<=0 & 0<=p17]]] & ~ [EX [~ [[[p5<=1 & 1<=p5] & [p4<=0 & 0<=p4]]]]]]]

abstracting: (0<=p4)
states: 513
abstracting: (p4<=0)
states: 257
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
.abstracting: (0<=p17)
states: 513
abstracting: (p17<=0)
states: 257
abstracting: (1<=p6)
states: 256
abstracting: (p6<=1)
states: 513
.
EG iterations: 1
abstracting: (0<=p10)
states: 513
abstracting: (p10<=0)
states: 257
abstracting: (1<=p1)
states: 256
abstracting: (p1<=1)
states: 513
.abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
abstracting: (0<=p0)
states: 513
abstracting: (p0<=0)
states: 512
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (0<=p7)
states: 513
abstracting: (p7<=0)
states: 257
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (0<=p9)
states: 513
abstracting: (p9<=0)
states: 257
abstracting: (0<=p18)
states: 513
abstracting: (p18<=0)
states: 257
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [A [EX [AF [AX [[p8<=1 & 1<=p8]]]] U [[[AX [~ [[p3<=0 & 0<=p3]]] & [~ [[[p5<=1 & 1<=p5] & [[p5<=0 & 0<=p5] | [p9<=1 & 1<=p9]]]] & [p4<=1 & 1<=p4]]] | ~ [E [[p3<=1 & 1<=p3] U [p15<=0 & 0<=p15]]]] & ~ [EX [[[[p8<=0 & 0<=p8] | [[p0<=1 & 1<=p0] | [p6<=0 & 0<=p6]]] | [[p5<=1 & 1<=p5] | [[p1<=0 & 0<=p1] | [p2<=1 & 1<=p2]]]]]]]] | AF [[p2<=1 & 1<=p2]]]
normalized: [[~ [EG [~ [[~ [EX [[[[[p2<=1 & 1<=p2] | [p1<=0 & 0<=p1]] | [p5<=1 & 1<=p5]] | [[[p6<=0 & 0<=p6] | [p0<=1 & 1<=p0]] | [p8<=0 & 0<=p8]]]]] & [~ [E [[p3<=1 & 1<=p3] U [p15<=0 & 0<=p15]]] | [[[p4<=1 & 1<=p4] & ~ [[[[p9<=1 & 1<=p9] | [p5<=0 & 0<=p5]] & [p5<=1 & 1<=p5]]]] & ~ [EX [[p3<=0 & 0<=p3]]]]]]]]] & ~ [E [~ [[~ [EX [[[[[p2<=1 & 1<=p2] | [p1<=0 & 0<=p1]] | [p5<=1 & 1<=p5]] | [[[p6<=0 & 0<=p6] | [p0<=1 & 1<=p0]] | [p8<=0 & 0<=p8]]]]] & [~ [E [[p3<=1 & 1<=p3] U [p15<=0 & 0<=p15]]] | [[[p4<=1 & 1<=p4] & ~ [[[[p9<=1 & 1<=p9] | [p5<=0 & 0<=p5]] & [p5<=1 & 1<=p5]]]] & ~ [EX [[p3<=0 & 0<=p3]]]]]]] U [~ [EX [~ [EG [EX [~ [[p8<=1 & 1<=p8]]]]]]] & ~ [[~ [EX [[[[[p2<=1 & 1<=p2] | [p1<=0 & 0<=p1]] | [p5<=1 & 1<=p5]] | [[[p6<=0 & 0<=p6] | [p0<=1 & 1<=p0]] | [p8<=0 & 0<=p8]]]]] & [~ [E [[p3<=1 & 1<=p3] U [p15<=0 & 0<=p15]]] | [[[p4<=1 & 1<=p4] & ~ [[[[p9<=1 & 1<=p9] | [p5<=0 & 0<=p5]] & [p5<=1 & 1<=p5]]]] & ~ [EX [[p3<=0 & 0<=p3]]]]]]]]]]] | ~ [EG [~ [[p2<=1 & 1<=p2]]]]]

abstracting: (1<=p2)
states: 256
abstracting: (p2<=1)
states: 513
.
EG iterations: 1
abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
.abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (0<=p5)
states: 513
abstracting: (p5<=0)
states: 257
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
abstracting: (0<=p8)
states: 513
abstracting: (p8<=0)
states: 257
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 513
abstracting: (0<=p6)
states: 513
abstracting: (p6<=0)
states: 257
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (0<=p1)
states: 513
abstracting: (p1<=0)
states: 257
abstracting: (1<=p2)
states: 256
abstracting: (p2<=1)
states: 513
.abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
..
EG iterations: 1
.abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
.abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (0<=p5)
states: 513
abstracting: (p5<=0)
states: 257
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
abstracting: (0<=p8)
states: 513
abstracting: (p8<=0)
states: 257
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 513
abstracting: (0<=p6)
states: 513
abstracting: (p6<=0)
states: 257
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (0<=p1)
states: 513
abstracting: (p1<=0)
states: 257
abstracting: (1<=p2)
states: 256
abstracting: (p2<=1)
states: 513
.abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
.abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (0<=p5)
states: 513
abstracting: (p5<=0)
states: 257
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
abstracting: (0<=p8)
states: 513
abstracting: (p8<=0)
states: 257
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 513
abstracting: (0<=p6)
states: 513
abstracting: (p6<=0)
states: 257
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (0<=p1)
states: 513
abstracting: (p1<=0)
states: 257
abstracting: (1<=p2)
states: 256
abstracting: (p2<=1)
states: 513
.
EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[E [[[EG [[[p0<=0 & 0<=p0] | [p18<=1 & 1<=p18]]] | EF [[p7<=1 & 1<=p7]]] | [A [[[[p13<=0 & 0<=p13] | [p9<=1 & 1<=p9]] & [[p14<=0 & 0<=p14] | [p17<=1 & 1<=p17]]] U [p15<=0 & 0<=p15]] | [[p10<=0 & 0<=p10] | [p15<=1 & 1<=p15]]]] U [~ [E [[[p3<=0 & 0<=p3] | [p6<=1 & 1<=p6]] U [[p7<=0 & 0<=p7] | [p6<=1 & 1<=p6]]]] & [[[p15<=0 & 0<=p15] | [p11<=1 & 1<=p11]] & [[[p14<=0 & 0<=p14] | [p13<=1 & 1<=p13]] | [[p15<=1 & 1<=p15] | [[p17<=1 & 1<=p17] | [p8<=1 & 1<=p8]]]]]]] | [[p1<=0 & 0<=p1] | [p15<=1 & 1<=p15]]]]
normalized: ~ [E [true U ~ [[E [[[[[p15<=1 & 1<=p15] | [p10<=0 & 0<=p10]] | [~ [EG [~ [[p15<=0 & 0<=p15]]]] & ~ [E [~ [[p15<=0 & 0<=p15]] U [~ [[[[p17<=1 & 1<=p17] | [p14<=0 & 0<=p14]] & [[p9<=1 & 1<=p9] | [p13<=0 & 0<=p13]]]] & ~ [[p15<=0 & 0<=p15]]]]]]] | [E [true U [p7<=1 & 1<=p7]] | EG [[[p18<=1 & 1<=p18] | [p0<=0 & 0<=p0]]]]] U [[[[[[p8<=1 & 1<=p8] | [p17<=1 & 1<=p17]] | [p15<=1 & 1<=p15]] | [[p13<=1 & 1<=p13] | [p14<=0 & 0<=p14]]] & [[p11<=1 & 1<=p11] | [p15<=0 & 0<=p15]]] & ~ [E [[[p6<=1 & 1<=p6] | [p3<=0 & 0<=p3]] U [[p6<=1 & 1<=p6] | [p7<=0 & 0<=p7]]]]]] | [[p15<=1 & 1<=p15] | [p1<=0 & 0<=p1]]]]]]

abstracting: (0<=p1)
states: 513
abstracting: (p1<=0)
states: 257
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
abstracting: (0<=p7)
states: 513
abstracting: (p7<=0)
states: 257
abstracting: (1<=p6)
states: 256
abstracting: (p6<=1)
states: 513
abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
abstracting: (1<=p6)
states: 256
abstracting: (p6<=1)
states: 513
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
abstracting: (0<=p14)
states: 513
abstracting: (p14<=0)
states: 257
abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
abstracting: (0<=p0)
states: 513
abstracting: (p0<=0)
states: 512
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (0<=p13)
states: 513
abstracting: (p13<=0)
states: 257
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (0<=p14)
states: 513
abstracting: (p14<=0)
states: 257
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
..........
EG iterations: 10
abstracting: (0<=p10)
states: 513
abstracting: (p10<=0)
states: 257
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AF [[[[AF [[~ [[p5<=0 & 0<=p5]] & ~ [[p3<=1 & 1<=p3]]]] & AX [[~ [[p2<=0 & 0<=p2]] & ~ [[p8<=1 & 1<=p8]]]]] & [~ [[p13<=0 & 0<=p13]] & [~ [[p9<=1 & 1<=p9]] & ~ [[p15<=0 & 0<=p15]]]]] & [[~ [[p7<=1 & 1<=p7]] & [AX [EG [~ [[p13<=0 & 0<=p13]]]] & [~ [[p5<=1 & 1<=p5]] | [~ [[p15<=1 & 1<=p15]] & [~ [[p0<=0 & 0<=p0]] & ~ [[p17<=1 & 1<=p17]]]]]]] & [[[AX [[~ [[p12<=0 & 0<=p12]] & ~ [[p8<=1 & 1<=p8]]]] | ~ [[p16<=1 & 1<=p16]]] | [[p12<=0 & 0<=p12] | [p6<=1 & 1<=p6]]] & [[EX [[p3<=0 & 0<=p3]] | [[EX [[[p1<=0 & 0<=p1] | [p3<=1 & 1<=p3]]] & A [[p4<=0 & 0<=p4] U [p17<=0 & 0<=p17]]] & [[p3<=0 & 0<=p3] & [[p10<=0 & 0<=p10] | [p4<=1 & 1<=p4]]]]] & [E [EG [[[p1<=0 & 0<=p1] | [p3<=1 & 1<=p3]]] U A [[[p14<=0 & 0<=p14] | [p9<=1 & 1<=p9]] U [[p18<=0 & 0<=p18] | [p17<=1 & 1<=p17]]]] | [p3<=1 & 1<=p3]]]]]]]
normalized: ~ [EG [~ [[[[[[[p3<=1 & 1<=p3] | E [EG [[[p3<=1 & 1<=p3] | [p1<=0 & 0<=p1]]] U [~ [EG [~ [[[p17<=1 & 1<=p17] | [p18<=0 & 0<=p18]]]]] & ~ [E [~ [[[p17<=1 & 1<=p17] | [p18<=0 & 0<=p18]]] U [~ [[[p9<=1 & 1<=p9] | [p14<=0 & 0<=p14]]] & ~ [[[p17<=1 & 1<=p17] | [p18<=0 & 0<=p18]]]]]]]]] & [[[[[p4<=1 & 1<=p4] | [p10<=0 & 0<=p10]] & [p3<=0 & 0<=p3]] & [[~ [EG [~ [[p17<=0 & 0<=p17]]]] & ~ [E [~ [[p17<=0 & 0<=p17]] U [~ [[p4<=0 & 0<=p4]] & ~ [[p17<=0 & 0<=p17]]]]]] & EX [[[p3<=1 & 1<=p3] | [p1<=0 & 0<=p1]]]]] | EX [[p3<=0 & 0<=p3]]]] & [[[p6<=1 & 1<=p6] | [p12<=0 & 0<=p12]] | [~ [[p16<=1 & 1<=p16]] | ~ [EX [~ [[~ [[p8<=1 & 1<=p8]] & ~ [[p12<=0 & 0<=p12]]]]]]]]] & [[[[[~ [[p17<=1 & 1<=p17]] & ~ [[p0<=0 & 0<=p0]]] & ~ [[p15<=1 & 1<=p15]]] | ~ [[p5<=1 & 1<=p5]]] & ~ [EX [~ [EG [~ [[p13<=0 & 0<=p13]]]]]]] & ~ [[p7<=1 & 1<=p7]]]] & [[[~ [[p15<=0 & 0<=p15]] & ~ [[p9<=1 & 1<=p9]]] & ~ [[p13<=0 & 0<=p13]]] & [~ [EX [~ [[~ [[p8<=1 & 1<=p8]] & ~ [[p2<=0 & 0<=p2]]]]]] & ~ [EG [~ [[~ [[p3<=1 & 1<=p3]] & ~ [[p5<=0 & 0<=p5]]]]]]]]]]]]

abstracting: (0<=p5)
states: 513
abstracting: (p5<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
.
EG iterations: 1
abstracting: (0<=p2)
states: 513
abstracting: (p2<=0)
states: 257
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
.abstracting: (0<=p13)
states: 513
abstracting: (p13<=0)
states: 257
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (0<=p13)
states: 513
abstracting: (p13<=0)
states: 257
.
EG iterations: 1
.abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
abstracting: (0<=p0)
states: 513
abstracting: (p0<=0)
states: 512
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (0<=p12)
states: 513
abstracting: (p12<=0)
states: 257
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
.abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (0<=p12)
states: 513
abstracting: (p12<=0)
states: 257
abstracting: (1<=p6)
states: 256
abstracting: (p6<=1)
states: 513
abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
.abstracting: (0<=p1)
states: 513
abstracting: (p1<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
.abstracting: (0<=p17)
states: 513
abstracting: (p17<=0)
states: 257
abstracting: (0<=p4)
states: 513
abstracting: (p4<=0)
states: 257
abstracting: (0<=p17)
states: 513
abstracting: (p17<=0)
states: 257
abstracting: (0<=p17)
states: 513
abstracting: (p17<=0)
states: 257
....
EG iterations: 4
abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
abstracting: (0<=p10)
states: 513
abstracting: (p10<=0)
states: 257
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (0<=p18)
states: 513
abstracting: (p18<=0)
states: 257
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (0<=p14)
states: 513
abstracting: (p14<=0)
states: 257
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (0<=p18)
states: 513
abstracting: (p18<=0)
states: 257
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (0<=p18)
states: 513
abstracting: (p18<=0)
states: 257
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
....
EG iterations: 4
abstracting: (0<=p1)
states: 513
abstracting: (p1<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
..
EG iterations: 2
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 5528 (5.5e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7981 19044 27025
used/not used/entry size/cache size: 24736 67084128 16 1024MB
basic ops cache: hits/miss/sum: 3357 5878 9235
used/not used/entry size/cache size: 10655 16766561 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: 477 315 792
used/not used/entry size/cache size: 315 8388293 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 67103354
1 5492
2 18
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.740sec


BK_STOP 1679346177152

--------------------
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:220 (12), effective:47 (2)

initing FirstDep: 0m 0.000sec


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

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

iterations count:52 (2), effective:8 (0)

iterations count:62 (3), effective:9 (0)

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

iterations count:73 (4), effective:10 (0)

iterations count:68 (3), effective:11 (0)

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

iterations count:31 (1), effective:4 (0)

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

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

iterations count:37 (2), effective:4 (0)

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

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

iterations count:37 (2), effective:4 (0)

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

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

iterations count:37 (2), effective:4 (0)

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

iterations count:62 (3), effective:9 (0)

iterations count:22 (1), effective:2 (0)

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

iterations count:31 (1), effective:4 (0)

iterations count:31 (1), effective:4 (0)

iterations count:100 (5), effective:20 (1)

iterations count:31 (1), effective:4 (0)

iterations count:21 (1), effective:2 (0)

iterations count:81 (4), effective:11 (0)

iterations count:25 (1), effective:2 (0)

iterations count:140 (7), effective:30 (1)

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

iterations count:37 (2), effective:7 (0)

iterations count:36 (2), 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-002A"
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-002A, 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-167905978600193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-002A.tgz
mv ShieldRVt-PT-002A execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;