About the Execution of Marcie+red for ShieldRVs-PT-002A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5480.699 | 10462.00 | 15210.00 | 96.50 | TFTFFTTTFTFFFTFT | 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-167905978400018.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 ShieldRVs-PT-002A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978400018
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.1K Feb 26 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 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 ShieldRVs-PT-002A-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-002A-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679338351008
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 18:52:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 18:52:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 18:52:33] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-20 18:52:33] [INFO ] Transformed 31 places.
[2023-03-20 18:52:33] [INFO ] Transformed 41 transitions.
[2023-03-20 18:52:33] [INFO ] Found NUPN structural information;
[2023-03-20 18:52:33] [INFO ] Parsed PT model containing 31 places and 41 transitions and 184 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-002A-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002A-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 10 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 31 cols
[2023-03-20 18:52:33] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-20 18:52:33] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-20 18:52:33] [INFO ] Invariant cache hit.
[2023-03-20 18:52:33] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-20 18:52:33] [INFO ] Invariant cache hit.
[2023-03-20 18:52:33] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 31/31 places, 41/41 transitions.
Support contains 30 out of 31 places after structural reductions.
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 21 ms
[2023-03-20 18:52:33] [INFO ] Flatten gal took : 9 ms
[2023-03-20 18:52:33] [INFO ] Input system was already deterministic with 41 transitions.
Incomplete random walk after 10000 steps, including 250 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 54) seen :50
Incomplete Best-First random walk after 10000 steps, including 109 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 18:52:34] [INFO ] Invariant cache hit.
[2023-03-20 18:52:34] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 18:52:34] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:52:34] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ShieldRVs-PT-002A-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 6 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 10 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 4 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 41/41 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 30 transition count 40
Applied a total of 2 rules in 8 ms. Remains 30 /31 variables (removed 1) and now considering 40/41 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 30/31 places, 40/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 40 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 8 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 2 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 41/41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Input system was already deterministic with 41 transitions.
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Flatten gal took : 3 ms
[2023-03-20 18:52:34] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 18:52:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 41 transitions and 184 arcs took 0 ms.
Total runtime 1596 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 31 NrTr: 41 NrArc: 184)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.312sec
RS generation: 0m 0.021sec
-> reachability set: #nodes 441 (4.4e+02) #states 16,021 (4)
starting MCC model checker
--------------------------
checking: EF [EG [AF [[[p8<=1 & 1<=p8] & [p13<=1 & 1<=p13]]]]]
normalized: E [true U EG [~ [EG [~ [[[p13<=1 & 1<=p13] & [p8<=1 & 1<=p8]]]]]]]
abstracting: (1<=p8)
states: 7,620 (3)
abstracting: (p8<=1)
states: 16,021 (4)
abstracting: (1<=p13)
states: 5,232 (3)
abstracting: (p13<=1)
states: 16,021 (4)
...........................
EG iterations: 27
................................
EG iterations: 32
-> the formula is TRUE
FORMULA ShieldRVs-PT-002A-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.134sec
checking: E [~ [[p24<=1 & 1<=p24]] U AG [EX [AX [[[p22<=1 & 1<=p22] & [p27<=1 & 1<=p27]]]]]]
normalized: E [~ [[p24<=1 & 1<=p24]] U ~ [E [true U ~ [EX [~ [EX [~ [[[p27<=1 & 1<=p27] & [p22<=1 & 1<=p22]]]]]]]]]]
abstracting: (1<=p22)
states: 7,552 (3)
abstracting: (p22<=1)
states: 16,021 (4)
abstracting: (1<=p27)
states: 4,927 (3)
abstracting: (p27<=1)
states: 16,021 (4)
..abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
-> the formula is FALSE
FORMULA ShieldRVs-PT-002A-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.018sec
checking: [AG [AF [[[0<=p20 & p20<=0] | [[p21<=0 & 0<=p21] | [p26<=0 & 0<=p26]]]]] & EG [EX [[p10<=0 & 0<=p10]]]]
normalized: [~ [E [true U EG [~ [[[[p26<=0 & 0<=p26] | [p21<=0 & 0<=p21]] | [0<=p20 & p20<=0]]]]]] & EG [EX [[p10<=0 & 0<=p10]]]]
abstracting: (0<=p10)
states: 16,021 (4)
abstracting: (p10<=0)
states: 12,781 (4)
.................
EG iterations: 16
abstracting: (p20<=0)
states: 11,458 (4)
abstracting: (0<=p20)
states: 16,021 (4)
abstracting: (0<=p21)
states: 16,021 (4)
abstracting: (p21<=0)
states: 7,553 (3)
abstracting: (0<=p26)
states: 16,021 (4)
abstracting: (p26<=0)
states: 11,716 (4)
.............
EG iterations: 13
-> the formula is TRUE
FORMULA ShieldRVs-PT-002A-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: AX [AG [[AF [[[p26<=0 & 0<=p26] | [p30<=0 & 0<=p30]]] | [[p24<=1 & 1<=p24] | [p18<=0 & 0<=p18]]]]]
normalized: ~ [EX [E [true U ~ [[[[p18<=0 & 0<=p18] | [p24<=1 & 1<=p24]] | ~ [EG [~ [[[p30<=0 & 0<=p30] | [p26<=0 & 0<=p26]]]]]]]]]]
abstracting: (0<=p26)
states: 16,021 (4)
abstracting: (p26<=0)
states: 11,716 (4)
abstracting: (0<=p30)
states: 16,021 (4)
abstracting: (p30<=0)
states: 12,036 (4)
..............
EG iterations: 14
abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
abstracting: (0<=p18)
states: 16,021 (4)
abstracting: (p18<=0)
states: 12,512 (4)
.-> the formula is TRUE
FORMULA ShieldRVs-PT-002A-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.019sec
checking: EX [EF [EX [[[EF [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]]] | [p5<=0 & 0<=p5]] | [[p7<=0 & 0<=p7] | [p11<=0 & 0<=p11]]]]]]
normalized: EX [E [true U EX [[[E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]] | [p5<=0 & 0<=p5]] | [[p11<=0 & 0<=p11] | [p7<=0 & 0<=p7]]]]]]
abstracting: (0<=p7)
states: 16,021 (4)
abstracting: (p7<=0)
states: 7,621 (3)
abstracting: (0<=p11)
states: 16,021 (4)
abstracting: (p11<=0)
states: 12,731 (4)
abstracting: (0<=p5)
states: 16,021 (4)
abstracting: (p5<=0)
states: 12,749 (4)
abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
..-> the formula is TRUE
FORMULA ShieldRVs-PT-002A-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.028sec
checking: AG [~ [A [[[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p16<=1 & 1<=p16]]] U [AG [AF [[p11<=1 & 1<=p11]]] & EX [EG [[p10<=1 & 1<=p10]]]]]]]
normalized: ~ [E [true U [~ [EG [~ [[EX [EG [[p10<=1 & 1<=p10]]] & ~ [E [true U EG [~ [[p11<=1 & 1<=p11]]]]]]]]] & ~ [E [~ [[EX [EG [[p10<=1 & 1<=p10]]] & ~ [E [true U EG [~ [[p11<=1 & 1<=p11]]]]]]] U [~ [[[[p4<=1 & 1<=p4] & [p16<=1 & 1<=p16]] & [p2<=1 & 1<=p2]]] & ~ [[EX [EG [[p10<=1 & 1<=p10]]] & ~ [E [true U EG [~ [[p11<=1 & 1<=p11]]]]]]]]]]]]]
abstracting: (1<=p11)
states: 3,290 (3)
abstracting: (p11<=1)
states: 16,021 (4)
..........
EG iterations: 10
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
.........................
EG iterations: 25
.abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p4)
states: 3,272 (3)
abstracting: (p4<=1)
states: 16,021 (4)
abstracting: (1<=p11)
states: 3,290 (3)
abstracting: (p11<=1)
states: 16,021 (4)
..........
EG iterations: 10
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
.........................
EG iterations: 25
.abstracting: (1<=p11)
states: 3,290 (3)
abstracting: (p11<=1)
states: 16,021 (4)
..........
EG iterations: 10
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
.........................
EG iterations: 25
.
EG iterations: 0
-> the formula is TRUE
FORMULA ShieldRVs-PT-002A-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: [EX [[[EX [AF [[[p10<=1 & 1<=p10] & [[p16<=1 & 1<=p16] & [p23<=1 & 1<=p23]]]]] | [p3<=0 & 0<=p3]] | [[p18<=0 & 0<=p18] | [p30<=0 & 0<=p30]]]] & ~ [E [~ [[p10<=1 & 1<=p10]] U [[p24<=1 & 1<=p24] & [p28<=1 & 1<=p28]]]]]
normalized: [~ [E [~ [[p10<=1 & 1<=p10]] U [[p28<=1 & 1<=p28] & [p24<=1 & 1<=p24]]]] & EX [[[[p30<=0 & 0<=p30] | [p18<=0 & 0<=p18]] | [[p3<=0 & 0<=p3] | EX [~ [EG [~ [[[[p23<=1 & 1<=p23] & [p16<=1 & 1<=p16]] & [p10<=1 & 1<=p10]]]]]]]]]]
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
.
EG iterations: 1
.abstracting: (0<=p3)
states: 16,021 (4)
abstracting: (p3<=0)
states: 11,085 (4)
abstracting: (0<=p18)
states: 16,021 (4)
abstracting: (p18<=0)
states: 12,512 (4)
abstracting: (0<=p30)
states: 16,021 (4)
abstracting: (p30<=0)
states: 12,036 (4)
.abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
-> the formula is FALSE
FORMULA ShieldRVs-PT-002A-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: [A [AG [~ [[[EF [[[p3<=1 & 1<=p3] & [[p20<=1 & 1<=p20] & [p29<=1 & 1<=p29]]]] & [p10<=1 & 1<=p10]] & [[p16<=1 & 1<=p16] & [p23<=1 & 1<=p23]]]]] U AG [EX [[p28<=1 & 1<=p28]]]] & AG [EF [~ [E [~ [[p5<=1 & 1<=p5]] U E [[[p26<=1 & 1<=p26] & [p30<=1 & 1<=p30]] U [[p24<=1 & 1<=p24] & [p28<=1 & 1<=p28]]]]]]]]
normalized: [~ [E [true U ~ [E [true U ~ [E [~ [[p5<=1 & 1<=p5]] U E [[[p30<=1 & 1<=p30] & [p26<=1 & 1<=p26]] U [[p28<=1 & 1<=p28] & [p24<=1 & 1<=p24]]]]]]]]] & [~ [EG [E [true U ~ [EX [[p28<=1 & 1<=p28]]]]]] & ~ [E [E [true U ~ [EX [[p28<=1 & 1<=p28]]]] U [E [true U [[[p23<=1 & 1<=p23] & [p16<=1 & 1<=p16]] & [[p10<=1 & 1<=p10] & E [true U [[[p29<=1 & 1<=p29] & [p20<=1 & 1<=p20]] & [p3<=1 & 1<=p3]]]]]] & E [true U ~ [EX [[p28<=1 & 1<=p28]]]]]]]]]
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
.abstracting: (1<=p3)
states: 4,936 (3)
abstracting: (p3<=1)
states: 16,021 (4)
abstracting: (1<=p20)
states: 4,563 (3)
abstracting: (p20<=1)
states: 16,021 (4)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
.abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
.
EG iterations: 0
abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
abstracting: (1<=p30)
states: 3,985 (3)
abstracting: (p30<=1)
states: 16,021 (4)
abstracting: (1<=p5)
states: 3,272 (3)
abstracting: (p5<=1)
states: 16,021 (4)
-> the formula is FALSE
FORMULA ShieldRVs-PT-002A-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.113sec
checking: AX [[A [EX [[[p10<=1 & 1<=p10] & [[p16<=1 & 1<=p16] & [p23<=1 & 1<=p23]]]] U A [[p29<=1 & 1<=p29] U [EF [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]]] | EX [[p14<=1 & 1<=p14]]]]] & EF [[[AG [[[p6<=1 & 1<=p6] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]] & [p26<=1 & 1<=p26]] & [[p30<=1 & 1<=p30] & [[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]]]]]]]
normalized: ~ [EX [~ [[E [true U [[[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]] & [p30<=1 & 1<=p30]] & [[p26<=1 & 1<=p26] & ~ [E [true U ~ [[[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [p6<=1 & 1<=p6]]]]]]]] & [~ [EG [~ [[~ [EG [~ [[EX [[p14<=1 & 1<=p14]] | E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[EX [[p14<=1 & 1<=p14]] | E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]] U [~ [[p29<=1 & 1<=p29]] & ~ [[EX [[p14<=1 & 1<=p14]] | E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[EX [[p14<=1 & 1<=p14]] | E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[EX [[p14<=1 & 1<=p14]] | E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]] U [~ [[p29<=1 & 1<=p29]] & ~ [[EX [[p14<=1 & 1<=p14]] | E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]]]]] U [~ [EX [[[[p23<=1 & 1<=p23] & [p16<=1 & 1<=p16]] & [p10<=1 & 1<=p10]]]] & ~ [[~ [EG [~ [[EX [[p14<=1 & 1<=p14]] | E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]] & ~ [E [~ [[EX [[p14<=1 & 1<=p14]] | E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]] U [~ [[p29<=1 & 1<=p29]] & ~ [[EX [[p14<=1 & 1<=p14]] | E [true U [[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]]]]]]]]]]]]]
abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
.abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
.abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
..
EG iterations: 1
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
.abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
.abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
.abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
..
EG iterations: 1
abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
.abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
.abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
..
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p7)
states: 8,400 (3)
abstracting: (p7<=1)
states: 16,021 (4)
abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
abstracting: (1<=p30)
states: 3,985 (3)
abstracting: (p30<=1)
states: 16,021 (4)
abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
.-> the formula is FALSE
FORMULA ShieldRVs-PT-002A-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.028sec
checking: EF [[EX [[[EX [[p24<=1 & 1<=p24]] & AX [[p17<=1 & 1<=p17]]] & [[p20<=1 & 1<=p20] & [[p21<=1 & 1<=p21] & [p26<=1 & 1<=p26]]]]] & [AX [[[p26<=0 & 0<=p26] | [p28<=0 & 0<=p28]]] & EX [[[[[p10<=0 & 0<=p10] | [[p16<=0 & 0<=p16] | [p23<=0 & 0<=p23]]] | [[p3<=0 & 0<=p3] | [[p18<=0 & 0<=p18] | [p30<=0 & 0<=p30]]]] & [[p1<=0 & 0<=p1] | [p9<=0 & 0<=p9]]]]]]]
normalized: E [true U [[EX [[[[p9<=0 & 0<=p9] | [p1<=0 & 0<=p1]] & [[[[p30<=0 & 0<=p30] | [p18<=0 & 0<=p18]] | [p3<=0 & 0<=p3]] | [[[p23<=0 & 0<=p23] | [p16<=0 & 0<=p16]] | [p10<=0 & 0<=p10]]]]] & ~ [EX [~ [[[p28<=0 & 0<=p28] | [p26<=0 & 0<=p26]]]]]] & EX [[[[[p26<=1 & 1<=p26] & [p21<=1 & 1<=p21]] & [p20<=1 & 1<=p20]] & [~ [EX [~ [[p17<=1 & 1<=p17]]]] & EX [[p24<=1 & 1<=p24]]]]]]]
abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
.abstracting: (1<=p17)
states: 4,549 (3)
abstracting: (p17<=1)
states: 16,021 (4)
.abstracting: (1<=p20)
states: 4,563 (3)
abstracting: (p20<=1)
states: 16,021 (4)
abstracting: (1<=p21)
states: 8,468 (3)
abstracting: (p21<=1)
states: 16,021 (4)
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
.abstracting: (0<=p26)
states: 16,021 (4)
abstracting: (p26<=0)
states: 11,716 (4)
abstracting: (0<=p28)
states: 16,021 (4)
abstracting: (p28<=0)
states: 12,382 (4)
.abstracting: (0<=p10)
states: 16,021 (4)
abstracting: (p10<=0)
states: 12,781 (4)
abstracting: (0<=p16)
states: 16,021 (4)
abstracting: (p16<=0)
states: 11,763 (4)
abstracting: (0<=p23)
states: 16,021 (4)
abstracting: (p23<=0)
states: 11,257 (4)
abstracting: (0<=p3)
states: 16,021 (4)
abstracting: (p3<=0)
states: 11,085 (4)
abstracting: (0<=p18)
states: 16,021 (4)
abstracting: (p18<=0)
states: 12,512 (4)
abstracting: (0<=p30)
states: 16,021 (4)
abstracting: (p30<=0)
states: 12,036 (4)
abstracting: (0<=p1)
states: 16,021 (4)
abstracting: (p1<=0)
states: 8,401 (3)
abstracting: (0<=p9)
states: 16,021 (4)
abstracting: (p9<=0)
states: 10,789 (4)
.-> the formula is FALSE
FORMULA ShieldRVs-PT-002A-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: E [[~ [[[A [[[[p10<=1 & 1<=p10] & [[p14<=1 & 1<=p14] & [p23<=1 & 1<=p23]]] | [[p19<=1 & 1<=p19] & [[p21<=1 & 1<=p21] & [p25<=1 & 1<=p25]]]] U EG [[p28<=1 & 1<=p28]]] & [EG [AX [[[p2<=1 & 1<=p2] & [[p6<=1 & 1<=p6] & [p16<=1 & 1<=p16]]]]] & [p3<=1 & 1<=p3]]] & [[p20<=1 & 1<=p20] & [[p29<=1 & 1<=p29] & ~ [[[p24<=1 & 1<=p24] & [[p8<=1 & 1<=p8] & [p13<=1 & 1<=p13]]]]]]]] & ~ [[[p6<=1 & 1<=p6] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]]] U [[EX [EF [[[[p19<=1 & 1<=p19] & [[p21<=1 & 1<=p21] & [p25<=1 & 1<=p25]]] & [[p5<=1 & 1<=p5] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]]]] & [p6<=1 & 1<=p6]] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]]
normalized: E [[~ [[[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [p6<=1 & 1<=p6]]] & ~ [[[[~ [[[[p13<=1 & 1<=p13] & [p8<=1 & 1<=p8]] & [p24<=1 & 1<=p24]]] & [p29<=1 & 1<=p29]] & [p20<=1 & 1<=p20]] & [[[p3<=1 & 1<=p3] & EG [~ [EX [~ [[[[p16<=1 & 1<=p16] & [p6<=1 & 1<=p6]] & [p2<=1 & 1<=p2]]]]]]] & [~ [EG [~ [EG [[p28<=1 & 1<=p28]]]]] & ~ [E [~ [EG [[p28<=1 & 1<=p28]]] U [~ [[[[[p25<=1 & 1<=p25] & [p21<=1 & 1<=p21]] & [p19<=1 & 1<=p19]] | [[[p23<=1 & 1<=p23] & [p14<=1 & 1<=p14]] & [p10<=1 & 1<=p10]]]] & ~ [EG [[p28<=1 & 1<=p28]]]]]]]]]]] U [[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [[p6<=1 & 1<=p6] & EX [E [true U [[[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [p5<=1 & 1<=p5]] & [[[p25<=1 & 1<=p25] & [p21<=1 & 1<=p21]] & [p19<=1 & 1<=p19]]]]]]]]
abstracting: (1<=p19)
states: 3,399 (3)
abstracting: (p19<=1)
states: 16,021 (4)
abstracting: (1<=p21)
states: 8,468 (3)
abstracting: (p21<=1)
states: 16,021 (4)
abstracting: (1<=p25)
states: 3,327 (3)
abstracting: (p25<=1)
states: 16,021 (4)
abstracting: (1<=p5)
states: 3,272 (3)
abstracting: (p5<=1)
states: 16,021 (4)
abstracting: (1<=p7)
states: 8,400 (3)
abstracting: (p7<=1)
states: 16,021 (4)
abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
.abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p7)
states: 8,400 (3)
abstracting: (p7<=1)
states: 16,021 (4)
abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
......................
EG iterations: 22
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (1<=p14)
states: 3,240 (3)
abstracting: (p14<=1)
states: 16,021 (4)
abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
abstracting: (1<=p19)
states: 3,399 (3)
abstracting: (p19<=1)
states: 16,021 (4)
abstracting: (1<=p21)
states: 8,468 (3)
abstracting: (p21<=1)
states: 16,021 (4)
abstracting: (1<=p25)
states: 3,327 (3)
abstracting: (p25<=1)
states: 16,021 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
......................
EG iterations: 22
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
......................
EG iterations: 22
EG iterations: 0
abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
...
EG iterations: 2
abstracting: (1<=p3)
states: 4,936 (3)
abstracting: (p3<=1)
states: 16,021 (4)
abstracting: (1<=p20)
states: 4,563 (3)
abstracting: (p20<=1)
states: 16,021 (4)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
abstracting: (1<=p8)
states: 7,620 (3)
abstracting: (p8<=1)
states: 16,021 (4)
abstracting: (1<=p13)
states: 5,232 (3)
abstracting: (p13<=1)
states: 16,021 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p7)
states: 8,400 (3)
abstracting: (p7<=1)
states: 16,021 (4)
abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
-> the formula is TRUE
FORMULA ShieldRVs-PT-002A-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.128sec
checking: E [~ [[[[p5<=1 & 1<=p5] & [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]] | [[AG [[[p1<=1 & 1<=p1] & [p9<=1 & 1<=p9]]] & [AF [[[p26<=1 & 1<=p26] & [p28<=1 & 1<=p28]]] | [~ [[[1<=p6 & p6<=1] & [[p7<=1 & 1<=p7] & [p11<=1 & 1<=p11]]]] & AG [[[p12<=1 & 1<=p12] & [[p16<=1 & 1<=p16] & [p23<=1 & 1<=p23]]]]]]] | ~ [[[p18<=1 & 1<=p18] | [EX [[[p24<=1 & 1<=p24] & [p28<=1 & 1<=p28]]] | A [[[p26<=1 & 1<=p26] & [p28<=1 & 1<=p28]] U [p10<=1 & 1<=p10]]]]]]]] U A [[~ [AX [[p15<=1 & 1<=p15]]] | [p5<=1 & 1<=p5]] U EF [[[AF [[[p3<=1 & 1<=p3] & [[p18<=1 & 1<=p18] & [p29<=1 & 1<=p29]]]] & [[p2<=1 & 1<=p2] & [p6<=1 & 1<=p6]]] & [[p16<=1 & 1<=p16] & [[p26<=1 & 1<=p26] & [p30<=1 & 1<=p30]]]]]]]
normalized: E [~ [[[~ [[[[~ [EG [~ [[p10<=1 & 1<=p10]]]] & ~ [E [~ [[p10<=1 & 1<=p10]] U [~ [[[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]]] & ~ [[p10<=1 & 1<=p10]]]]]] | EX [[[p28<=1 & 1<=p28] & [p24<=1 & 1<=p24]]]] | [p18<=1 & 1<=p18]]] | [[[~ [E [true U ~ [[[[p23<=1 & 1<=p23] & [p16<=1 & 1<=p16]] & [p12<=1 & 1<=p12]]]]] & ~ [[[[p11<=1 & 1<=p11] & [p7<=1 & 1<=p7]] & [1<=p6 & p6<=1]]]] | ~ [EG [~ [[[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]]]]]] & ~ [E [true U ~ [[[p9<=1 & 1<=p9] & [p1<=1 & 1<=p1]]]]]]] | [[[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]] & [p5<=1 & 1<=p5]]]] U [~ [EG [~ [E [true U [[~ [EG [~ [[[[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]] & [p3<=1 & 1<=p3]]]]] & [[p6<=1 & 1<=p6] & [p2<=1 & 1<=p2]]] & [[p16<=1 & 1<=p16] & [[p30<=1 & 1<=p30] & [p26<=1 & 1<=p26]]]]]]]] & ~ [E [~ [E [true U [[~ [EG [~ [[[[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]] & [p3<=1 & 1<=p3]]]]] & [[p6<=1 & 1<=p6] & [p2<=1 & 1<=p2]]] & [[p16<=1 & 1<=p16] & [[p30<=1 & 1<=p30] & [p26<=1 & 1<=p26]]]]]] U [~ [E [true U [[~ [EG [~ [[[[p29<=1 & 1<=p29] & [p18<=1 & 1<=p18]] & [p3<=1 & 1<=p3]]]]] & [[p6<=1 & 1<=p6] & [p2<=1 & 1<=p2]]] & [[p16<=1 & 1<=p16] & [[p30<=1 & 1<=p30] & [p26<=1 & 1<=p26]]]]]] & ~ [[[p5<=1 & 1<=p5] | EX [~ [[p15<=1 & 1<=p15]]]]]]]]]]
abstracting: (1<=p15)
states: 3,290 (3)
abstracting: (p15<=1)
states: 16,021 (4)
.abstracting: (1<=p5)
states: 3,272 (3)
abstracting: (p5<=1)
states: 16,021 (4)
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
abstracting: (1<=p30)
states: 3,985 (3)
abstracting: (p30<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p3)
states: 4,936 (3)
abstracting: (p3<=1)
states: 16,021 (4)
abstracting: (1<=p18)
states: 3,509 (3)
abstracting: (p18<=1)
states: 16,021 (4)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
.
EG iterations: 1
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
abstracting: (1<=p30)
states: 3,985 (3)
abstracting: (p30<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p3)
states: 4,936 (3)
abstracting: (p3<=1)
states: 16,021 (4)
abstracting: (1<=p18)
states: 3,509 (3)
abstracting: (p18<=1)
states: 16,021 (4)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
.
EG iterations: 1
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
abstracting: (1<=p30)
states: 3,985 (3)
abstracting: (p30<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p3)
states: 4,936 (3)
abstracting: (p3<=1)
states: 16,021 (4)
abstracting: (1<=p18)
states: 3,509 (3)
abstracting: (p18<=1)
states: 16,021 (4)
abstracting: (1<=p29)
states: 3,469 (3)
abstracting: (p29<=1)
states: 16,021 (4)
.
EG iterations: 1
EG iterations: 0
abstracting: (1<=p5)
states: 3,272 (3)
abstracting: (p5<=1)
states: 16,021 (4)
abstracting: (1<=p7)
states: 8,400 (3)
abstracting: (p7<=1)
states: 16,021 (4)
abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
abstracting: (1<=p1)
states: 7,620 (3)
abstracting: (p1<=1)
states: 16,021 (4)
abstracting: (1<=p9)
states: 5,232 (3)
abstracting: (p9<=1)
states: 16,021 (4)
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
.
EG iterations: 1
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (1<=p7)
states: 8,400 (3)
abstracting: (p7<=1)
states: 16,021 (4)
abstracting: (1<=p11)
states: 3,290 (3)
abstracting: (p11<=1)
states: 16,021 (4)
abstracting: (1<=p12)
states: 4,258 (3)
abstracting: (p12<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
abstracting: (1<=p18)
states: 3,509 (3)
abstracting: (p18<=1)
states: 16,021 (4)
abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
.abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
abstracting: (1<=p28)
states: 3,639 (3)
abstracting: (p28<=1)
states: 16,021 (4)
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
..................
EG iterations: 18
-> the formula is FALSE
FORMULA ShieldRVs-PT-002A-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.057sec
checking: [EF [[[EX [[[[[[p24<=1 & 1<=p24] & [p30<=1 & 1<=p30]] & [[p19<=1 & 1<=p19] & [[p21<=1 & 1<=p21] & [p25<=1 & 1<=p25]]]] | [[[p19<=1 & 1<=p19] & [[p21<=1 & 1<=p21] & [p26<=1 & 1<=p26]]] | [p4<=1 & 1<=p4]]] & EF [[p5<=1 & 1<=p5]]]] & [p2<=1 & 1<=p2]] & [[p4<=1 & 1<=p4] & [p15<=1 & 1<=p15]]]] & EG [[EG [[[AX [[[p20<=1 & 1<=p20] & [[p21<=1 & 1<=p21] & [p25<=1 & 1<=p25]]]] | [[[p2<=1 & 1<=p2] & [[p6<=1 & 1<=p6] & [p16<=1 & 1<=p16]]] | [[p5<=1 & 1<=p5] & [[p7<=1 & 1<=p7] & [p11<=1 & 1<=p11]]]]] & AX [[[p24<=1 & 1<=p24] & [p30<=1 & 1<=p30]]]]] | EF [[E [[[p2<=1 & 1<=p2] & [[p6<=1 & 1<=p6] & [p15<=1 & 1<=p15]]] U [[p10<=1 & 1<=p10] & [[p16<=1 & 1<=p16] & [p23<=1 & 1<=p23]]]] & A [[[p3<=1 & 1<=p3] & [[p18<=1 & 1<=p18] & [p30<=1 & 1<=p30]]] U [p15<=1 & 1<=p15]]]]]]]
normalized: [EG [[E [true U [[~ [EG [~ [[p15<=1 & 1<=p15]]]] & ~ [E [~ [[p15<=1 & 1<=p15]] U [~ [[[[p30<=1 & 1<=p30] & [p18<=1 & 1<=p18]] & [p3<=1 & 1<=p3]]] & ~ [[p15<=1 & 1<=p15]]]]]] & E [[[[p15<=1 & 1<=p15] & [p6<=1 & 1<=p6]] & [p2<=1 & 1<=p2]] U [[[p23<=1 & 1<=p23] & [p16<=1 & 1<=p16]] & [p10<=1 & 1<=p10]]]]] | EG [[~ [EX [~ [[[p30<=1 & 1<=p30] & [p24<=1 & 1<=p24]]]]] & [[[[[p11<=1 & 1<=p11] & [p7<=1 & 1<=p7]] & [p5<=1 & 1<=p5]] | [[[p16<=1 & 1<=p16] & [p6<=1 & 1<=p6]] & [p2<=1 & 1<=p2]]] | ~ [EX [~ [[[[p25<=1 & 1<=p25] & [p21<=1 & 1<=p21]] & [p20<=1 & 1<=p20]]]]]]]]]] & E [true U [[[p15<=1 & 1<=p15] & [p4<=1 & 1<=p4]] & [[p2<=1 & 1<=p2] & EX [[E [true U [p5<=1 & 1<=p5]] & [[[p4<=1 & 1<=p4] | [[[p26<=1 & 1<=p26] & [p21<=1 & 1<=p21]] & [p19<=1 & 1<=p19]]] | [[[[p25<=1 & 1<=p25] & [p21<=1 & 1<=p21]] & [p19<=1 & 1<=p19]] & [[p30<=1 & 1<=p30] & [p24<=1 & 1<=p24]]]]]]]]]]
abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
abstracting: (1<=p30)
states: 3,985 (3)
abstracting: (p30<=1)
states: 16,021 (4)
abstracting: (1<=p19)
states: 3,399 (3)
abstracting: (p19<=1)
states: 16,021 (4)
abstracting: (1<=p21)
states: 8,468 (3)
abstracting: (p21<=1)
states: 16,021 (4)
abstracting: (1<=p25)
states: 3,327 (3)
abstracting: (p25<=1)
states: 16,021 (4)
abstracting: (1<=p19)
states: 3,399 (3)
abstracting: (p19<=1)
states: 16,021 (4)
abstracting: (1<=p21)
states: 8,468 (3)
abstracting: (p21<=1)
states: 16,021 (4)
abstracting: (1<=p26)
states: 4,305 (3)
abstracting: (p26<=1)
states: 16,021 (4)
abstracting: (1<=p4)
states: 3,272 (3)
abstracting: (p4<=1)
states: 16,021 (4)
abstracting: (1<=p5)
states: 3,272 (3)
abstracting: (p5<=1)
states: 16,021 (4)
.abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (1<=p4)
states: 3,272 (3)
abstracting: (p4<=1)
states: 16,021 (4)
abstracting: (1<=p15)
states: 3,290 (3)
abstracting: (p15<=1)
states: 16,021 (4)
abstracting: (1<=p20)
states: 4,563 (3)
abstracting: (p20<=1)
states: 16,021 (4)
abstracting: (1<=p21)
states: 8,468 (3)
abstracting: (p21<=1)
states: 16,021 (4)
abstracting: (1<=p25)
states: 3,327 (3)
abstracting: (p25<=1)
states: 16,021 (4)
.abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p5)
states: 3,272 (3)
abstracting: (p5<=1)
states: 16,021 (4)
abstracting: (1<=p7)
states: 8,400 (3)
abstracting: (p7<=1)
states: 16,021 (4)
abstracting: (1<=p11)
states: 3,290 (3)
abstracting: (p11<=1)
states: 16,021 (4)
abstracting: (1<=p24)
states: 3,624 (3)
abstracting: (p24<=1)
states: 16,021 (4)
abstracting: (1<=p30)
states: 3,985 (3)
abstracting: (p30<=1)
states: 16,021 (4)
..
EG iterations: 1
abstracting: (1<=p10)
states: 3,240 (3)
abstracting: (p10<=1)
states: 16,021 (4)
abstracting: (1<=p16)
states: 4,258 (3)
abstracting: (p16<=1)
states: 16,021 (4)
abstracting: (1<=p23)
states: 4,764 (3)
abstracting: (p23<=1)
states: 16,021 (4)
abstracting: (1<=p2)
states: 8,400 (3)
abstracting: (p2<=1)
states: 16,021 (4)
abstracting: (1<=p6)
states: 4,540 (3)
abstracting: (p6<=1)
states: 16,021 (4)
abstracting: (1<=p15)
states: 3,290 (3)
abstracting: (p15<=1)
states: 16,021 (4)
abstracting: (1<=p15)
states: 3,290 (3)
abstracting: (p15<=1)
states: 16,021 (4)
abstracting: (1<=p3)
states: 4,936 (3)
abstracting: (p3<=1)
states: 16,021 (4)
abstracting: (1<=p18)
states: 3,509 (3)
abstracting: (p18<=1)
states: 16,021 (4)
abstracting: (1<=p30)
states: 3,985 (3)
abstracting: (p30<=1)
states: 16,021 (4)
abstracting: (1<=p15)
states: 3,290 (3)
abstracting: (p15<=1)
states: 16,021 (4)
abstracting: (1<=p15)
states: 3,290 (3)
abstracting: (p15<=1)
states: 16,021 (4)
..........
EG iterations: 10
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldRVs-PT-002A-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
totally nodes used: 594102 (5.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 480623 1213550 1694173
used/not used/entry size/cache size: 1711093 65397771 16 1024MB
basic ops cache: hits/miss/sum: 199774 383746 583520
used/not used/entry size/cache size: 771940 16005276 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: 2858 6639 9497
used/not used/entry size/cache size: 6635 8381973 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 66547576
1 531580
2 26822
3 2674
4 204
5 8
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 6.737sec
BK_STOP 1679338361470
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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:3812 (92), effective:549 (13)
initing FirstDep: 0m 0.000sec
iterations count:209 (5), effective:23 (0)
iterations count:254 (6), effective:22 (0)
iterations count:1754 (42), effective:279 (6)
iterations count:41 (1), effective:0 (0)
iterations count:362 (8), effective:42 (1)
iterations count:362 (8), effective:42 (1)
iterations count:46 (1), effective:1 (0)
iterations count:362 (8), effective:42 (1)
iterations count:1551 (37), effective:220 (5)
iterations count:142 (3), effective:20 (0)
iterations count:1340 (32), effective:186 (4)
iterations count:1649 (40), effective:251 (6)
iterations count:142 (3), effective:20 (0)
iterations count:41 (1), effective:0 (0)
iterations count:142 (3), effective:20 (0)
iterations count:41 (1), effective:0 (0)
iterations count:1643 (40), effective:243 (5)
iterations count:1402 (34), effective:229 (5)
iterations count:1754 (42), effective:279 (6)
iterations count:1754 (42), effective:279 (6)
iterations count:45 (1), effective:1 (0)
iterations count:1754 (42), effective:279 (6)
iterations count:1754 (42), effective:279 (6)
iterations count:1754 (42), effective:279 (6)
iterations count:45 (1), effective:1 (0)
iterations count:1754 (42), effective:279 (6)
iterations count:41 (1), effective:0 (0)
iterations count:1754 (42), effective:279 (6)
iterations count:1754 (42), effective:279 (6)
iterations count:45 (1), effective:1 (0)
iterations count:1754 (42), effective:279 (6)
iterations count:47 (1), effective:1 (0)
iterations count:2551 (62), effective:352 (8)
iterations count:50 (1), effective:2 (0)
iterations count:1637 (39), effective:217 (5)
iterations count:1856 (45), effective:294 (7)
iterations count:50 (1), effective:1 (0)
iterations count:265 (6), effective:30 (0)
iterations count:61 (1), effective:4 (0)
iterations count:1448 (35), effective:228 (5)
iterations count:2230 (54), effective:365 (8)
iterations count:41 (1), effective:0 (0)
iterations count:43 (1), effective:1 (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="ShieldRVs-PT-002A"
export BK_EXAMINATION="CTLFireability"
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 ShieldRVs-PT-002A, examination is CTLFireability"
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-167905978400018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVs-PT-002A.tgz
mv ShieldRVs-PT-002A execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;