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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 23:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.1K 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 15K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 23:01 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 3.7K 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-001A-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-001A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679346043488

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=ShieldRVt-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:00:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:00:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:00:45] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2023-03-20 21:00:45] [INFO ] Transformed 11 places.
[2023-03-20 21:00:45] [INFO ] Transformed 11 transitions.
[2023-03-20 21:00:45] [INFO ] Found NUPN structural information;
[2023-03-20 21:00:45] [INFO ] Parsed PT model containing 11 places and 11 transitions and 40 arcs in 88 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-001A-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 8 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-20 21:00:45] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 21:00:45] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-20 21:00:45] [INFO ] Invariant cache hit.
[2023-03-20 21:00:45] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2023-03-20 21:00:45] [INFO ] Invariant cache hit.
[2023-03-20 21:00:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 217 ms. Remains : 11/11 places, 10/10 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 13 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 21:00:45] [INFO ] Invariant cache hit.
[2023-03-20 21:00:45] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-20 21:00:45] [INFO ] After 33ms 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 9 simplifications.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 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 8 transition count 8
Applied a total of 3 rules in 6 ms. Remains 8 /11 variables (removed 3) and now considering 8/10 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 8/11 places, 8/10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 8 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
FORMULA ShieldRVt-PT-001A-CTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 0 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Input system was already deterministic with 10 transitions.
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:45] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 21:00:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 10 transitions and 38 arcs took 0 ms.
Total runtime 767 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: 11 NrTr: 10 NrArc: 38)

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

net check time: 0m 0.000sec

init dd package: 0m 3.554sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 25 (2.5e+01) #states 33



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

checking: EX [[1<=p3 & p3<=1]]
normalized: EX [[1<=p3 & p3<=1]]

abstracting: (p3<=1)
states: 33
abstracting: (1<=p3)
states: 16
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [[p7<=0 & 0<=p7]]
normalized: ~ [EX [~ [[p7<=0 & 0<=p7]]]]

abstracting: (0<=p7)
states: 33
abstracting: (p7<=0)
states: 17
.-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [AX [A [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] U ~ [E [[p9<=1 & 1<=p9] U [[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]]]]]]]
normalized: ~ [E [true U EX [~ [[~ [E [E [[p9<=1 & 1<=p9] U [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] U [E [[p9<=1 & 1<=p9] U [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] & ~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] & ~ [EG [E [[p9<=1 & 1<=p9] U [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]]]

abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
........
EG iterations: 8
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[[~ [[p0<=1 & 1<=p0]] & [p2<=1 & 1<=p2]] & [[p4<=1 & 1<=p4] & [p10<=1 & 1<=p10]]] U ~ [A [~ [[~ [[[p6<=1 & 1<=p6] & [p9<=1 & 1<=p9]]] & [[p8<=1 & 1<=p8] & [p10<=1 & 1<=p10]]]] U EF [[p3<=1 & 1<=p3]]]]]
normalized: E [[[[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]] & [[p2<=1 & 1<=p2] & ~ [[p0<=1 & 1<=p0]]]] U ~ [[~ [EG [~ [E [true U [p3<=1 & 1<=p3]]]]] & ~ [E [~ [E [true U [p3<=1 & 1<=p3]]] U [~ [E [true U [p3<=1 & 1<=p3]]] & [[[p10<=1 & 1<=p10] & [p8<=1 & 1<=p8]] & ~ [[[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]]]]]]]]

abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
.
EG iterations: 1
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
....
EG iterations: 4
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
.abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
.
EG iterations: 1
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
.......
EG iterations: 7
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[EX [[[[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p10<=1 & 1<=p10]]] | [[[p2<=0 & 0<=p2] | [[p4<=0 & 0<=p4] | [p10<=0 & 0<=p10]]] & AF [[p7<=1 & 1<=p7]]]]] | [AG [~ [A [[p5<=1 & 1<=p5] U [[p8<=1 & 1<=p8] & [p10<=1 & 1<=p10]]]]] & A [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] U [A [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] U [p7<=1 & 1<=p7]] & ~ [[p3<=1 & 1<=p3]]]]]]]
normalized: E [true U [[[~ [EG [~ [[~ [[p3<=1 & 1<=p3]] & [~ [EG [~ [[p7<=1 & 1<=p7]]]] & ~ [E [~ [[p7<=1 & 1<=p7]] U [~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] & ~ [[p7<=1 & 1<=p7]]]]]]]]]] & ~ [E [~ [[~ [[p3<=1 & 1<=p3]] & [~ [EG [~ [[p7<=1 & 1<=p7]]]] & ~ [E [~ [[p7<=1 & 1<=p7]] U [~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] & ~ [[p7<=1 & 1<=p7]]]]]]]] U [~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] & ~ [[~ [[p3<=1 & 1<=p3]] & [~ [EG [~ [[p7<=1 & 1<=p7]]]] & ~ [E [~ [[p7<=1 & 1<=p7]] U [~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] & ~ [[p7<=1 & 1<=p7]]]]]]]]]]]] & ~ [E [true U [~ [EG [~ [[[p10<=1 & 1<=p10] & [p8<=1 & 1<=p8]]]]] & ~ [E [~ [[[p10<=1 & 1<=p10] & [p8<=1 & 1<=p8]]] U [~ [[p5<=1 & 1<=p5]] & ~ [[[p10<=1 & 1<=p10] & [p8<=1 & 1<=p8]]]]]]]]]] | EX [[[~ [EG [~ [[p7<=1 & 1<=p7]]]] & [[[p10<=0 & 0<=p10] | [p4<=0 & 0<=p4]] | [p2<=0 & 0<=p2]]] | [[[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]]]]]]

abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (0<=p4)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
..........
EG iterations: 10
.abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
.......
EG iterations: 7
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
..........
EG iterations: 10
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
..........
EG iterations: 10
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
..........
EG iterations: 10
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
...
EG iterations: 3
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [[EG [~ [A [[[[p6<=1 & 1<=p6] & [p9<=1 & 1<=p9]] | [[p2<=1 & 1<=p2] & [[p4<=1 & 1<=p4] & [p10<=1 & 1<=p10]]]] U [[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]]]]] | [EF [[[p2<=0 & 0<=p2] | [[p4<=0 & 0<=p4] | [p10<=0 & 0<=p10]]]] & [AF [[p3<=1 & 1<=p3]] & [EF [[[p4<=1 & 1<=p4] & [[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]]]] | [[p0<=0 & 0<=p0] & [[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]]]]]
normalized: EG [[[[~ [EG [~ [[p3<=1 & 1<=p3]]]] & [[[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]] & [p0<=0 & 0<=p0]] | E [true U [[[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]] & [p4<=1 & 1<=p4]]]]] & E [true U [[[p10<=0 & 0<=p10] | [p4<=0 & 0<=p4]] | [p2<=0 & 0<=p2]]]] | EG [~ [[~ [EG [~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]] & ~ [E [~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] U [~ [[[[[p10<=1 & 1<=p10] & [p4<=1 & 1<=p4]] & [p2<=1 & 1<=p2]] | [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]] & ~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]]]]

abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
......
EG iterations: 6
......
EG iterations: 6
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (0<=p4)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 33
abstracting: (0<=p0)
states: 33
abstracting: (p0<=0)
states: 32
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
.abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 33
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
.abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
.abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
.abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
.......
EG iterations: 6
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 1341 (1.3e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2260 4883 7143
used/not used/entry size/cache size: 6190 67102674 16 1024MB
basic ops cache: hits/miss/sum: 1573 2060 3633
used/not used/entry size/cache size: 3695 16773521 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: 287 106 393
used/not used/entry size/cache size: 106 8388502 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 67107534
1 1319
2 11
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.121sec


BK_STOP 1679346052247

--------------------
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 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:81 (8), effective:18 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

iterations count:50 (5), effective:12 (1)

iterations count:45 (4), effective:8 (0)

iterations count:45 (4), effective:8 (0)

iterations count:45 (4), effective:8 (0)

iterations count:20 (2), effective:5 (0)

iterations count:33 (3), effective:8 (0)

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

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

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

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

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

iterations count:31 (3), effective:5 (0)

iterations count:23 (2), effective:3 (0)

iterations count:43 (4), effective:9 (0)

iterations count:31 (3), effective:6 (0)

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

iterations count:24 (2), effective:5 (0)

iterations count:35 (3), effective:5 (0)

iterations count:31 (3), effective:6 (0)

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

iterations count:31 (3), effective:6 (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-001A"
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 ShieldRVt-PT-001A, 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-167905978600178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001A.tgz
mv ShieldRVt-PT-001A 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;