Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r234-tall-167856420500546.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is MAPK-PT-00008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420500546
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.0K Feb 26 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 10:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 10:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Feb 26 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K Mar 5 18:22 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 MAPK-PT-00008-CTLFireability-00
FORMULA_NAME MAPK-PT-00008-CTLFireability-01
FORMULA_NAME MAPK-PT-00008-CTLFireability-02
FORMULA_NAME MAPK-PT-00008-CTLFireability-03
FORMULA_NAME MAPK-PT-00008-CTLFireability-04
FORMULA_NAME MAPK-PT-00008-CTLFireability-05
FORMULA_NAME MAPK-PT-00008-CTLFireability-06
FORMULA_NAME MAPK-PT-00008-CTLFireability-07
FORMULA_NAME MAPK-PT-00008-CTLFireability-08
FORMULA_NAME MAPK-PT-00008-CTLFireability-09
FORMULA_NAME MAPK-PT-00008-CTLFireability-10
FORMULA_NAME MAPK-PT-00008-CTLFireability-11
FORMULA_NAME MAPK-PT-00008-CTLFireability-12
FORMULA_NAME MAPK-PT-00008-CTLFireability-13
FORMULA_NAME MAPK-PT-00008-CTLFireability-14
FORMULA_NAME MAPK-PT-00008-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679532350604

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=MAPK-PT-00008
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:45:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 00:45:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:45:52] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-23 00:45:52] [INFO ] Transformed 22 places.
[2023-03-23 00:45:52] [INFO ] Transformed 30 transitions.
[2023-03-23 00:45:52] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Initial state reduction rules removed 4 formulas.
FORMULA MAPK-PT-00008-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00008-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00008-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-00008-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 22 cols
[2023-03-23 00:45:52] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-23 00:45:52] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-23 00:45:52] [INFO ] Invariant cache hit.
[2023-03-23 00:45:52] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-23 00:45:52] [INFO ] Invariant cache hit.
[2023-03-23 00:45:52] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 243 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-23 00:45:52] [INFO ] Flatten gal took : 16 ms
[2023-03-23 00:45:52] [INFO ] Flatten gal took : 5 ms
[2023-03-23 00:45:52] [INFO ] Input system was already deterministic with 30 transitions.
Finished random walk after 812 steps, including 0 resets, run visited all 29 properties in 51 ms. (steps per millisecond=15 )
[2023-03-23 00:45:52] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:45:52] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 8 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 6 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
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 20 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 20 transition count 27
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 3 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 3 rules applied. Total rules applied 8 place count 17 transition count 27
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 17 transition count 25
Applied a total of 10 rules in 12 ms. Remains 17 /22 variables (removed 5) and now considering 25/30 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 17/22 places, 25/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Input system was already deterministic with 30 transitions.
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:45:53] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:45:53] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-23 00:45:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 22 places, 30 transitions and 90 arcs took 1 ms.
Total runtime 847 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: 22 NrTr: 30 NrArc: 90)

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

net check time: 0m 0.000sec

init dd package: 0m 2.717sec


RS generation: 0m 0.005sec


-> reachability set: #nodes 667 (6.7e+02) #states 6,110,643 (6)



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

checking: EF [EX [AG [1<=p17]]]
normalized: E [true U EX [~ [E [true U ~ [1<=p17]]]]]

abstracting: (1<=p17)
states: 3,582,355 (6)
.-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [AG [1<=p12]]
normalized: E [true U ~ [E [true U ~ [1<=p12]]]]

abstracting: (1<=p12)
states: 1,831,956 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[AX [1<=p12] & AG [1<=p0]]]
normalized: E [true U [~ [E [true U ~ [1<=p0]]] & ~ [EX [~ [1<=p12]]]]]

abstracting: (1<=p12)
states: 1,831,956 (6)
.abstracting: (1<=p0)
states: 1,368,759 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [EX [AG [[p14<=0 & [p17<=0 & [p8<=0 | p10<=0]]]]]]
normalized: E [true U EX [~ [E [true U ~ [[[[p8<=0 | p10<=0] & p17<=0] & p14<=0]]]]]]

abstracting: (p14<=0)
states: 3,752,259 (6)
abstracting: (p17<=0)
states: 2,528,288 (6)
abstracting: (p10<=0)
states: 3,752,259 (6)
abstracting: (p8<=0)
states: 110,250 (5)
.-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [E [EG [~ [[1<=p12 | AX [1<=p1]]]] U AG [~ [[AG [1<=p0] | [1<=p12 | 1<=p19]]]]]]
normalized: EG [E [EG [~ [[~ [EX [~ [1<=p1]]] | 1<=p12]]] U ~ [E [true U [[1<=p12 | 1<=p19] | ~ [E [true U ~ [1<=p0]]]]]]]]

abstracting: (1<=p0)
states: 1,368,759 (6)
abstracting: (1<=p19)
states: 4,594,323 (6)
abstracting: (1<=p12)
states: 1,831,956 (6)
abstracting: (1<=p12)
states: 1,831,956 (6)
abstracting: (1<=p1)
states: 1,368,759 (6)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: [EG [AF [[1<=p20 & 1<=p21]]] & [AX [p5<=0] & E [EG [p12<=0] U 1<=p5]]]
normalized: [[E [EG [p12<=0] U 1<=p5] & ~ [EX [~ [p5<=0]]]] & EG [~ [EG [~ [[1<=p20 & 1<=p21]]]]]]

abstracting: (1<=p21)
states: 4,701,298 (6)
abstracting: (1<=p20)
states: 4,558,463 (6)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (p5<=0)
states: 2,599,933 (6)
.abstracting: (1<=p5)
states: 3,510,710 (6)
abstracting: (p12<=0)
states: 4,278,687 (6)
.
EG iterations: 1
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: [EX [~ [E [AG [p1<=0] U AF [p18<=0]]]] & AG [[AX [[p18<=0 & [p17<=0 & p0<=0]]] & [p7<=0 | p8<=0]]]]
normalized: [~ [E [true U ~ [[[p7<=0 | p8<=0] & ~ [EX [~ [[p18<=0 & [p17<=0 & p0<=0]]]]]]]]] & EX [~ [E [~ [E [true U ~ [p1<=0]]] U ~ [EG [~ [p18<=0]]]]]]]

abstracting: (p18<=0)
states: 4,278,687 (6)
.
EG iterations: 1
abstracting: (p1<=0)
states: 4,741,884 (6)
.abstracting: (p0<=0)
states: 4,741,884 (6)
abstracting: (p17<=0)
states: 2,528,288 (6)
abstracting: (p18<=0)
states: 4,278,687 (6)
.abstracting: (p8<=0)
states: 110,250 (5)
abstracting: (p7<=0)
states: 3,752,259 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [EX [[EF [[p2<=0 | p16<=0]] & [AG [[1<=p7 & 1<=p15]] & [p18<=0 | [p19<=0 | AG [[p3<=0 | p16<=0]]]]]]]]
normalized: E [true U EX [[[[p18<=0 | [p19<=0 | ~ [E [true U ~ [[p3<=0 | p16<=0]]]]]] & ~ [E [true U ~ [[1<=p7 & 1<=p15]]]]] & E [true U [p2<=0 | p16<=0]]]]]

abstracting: (p16<=0)
states: 1,409,345 (6)
abstracting: (p2<=0)
states: 252,450 (5)
abstracting: (1<=p15)
states: 3,510,710 (6)
abstracting: (1<=p7)
states: 2,358,384 (6)
abstracting: (p16<=0)
states: 1,409,345 (6)
abstracting: (p3<=0)
states: 3,752,259 (6)
abstracting: (p19<=0)
states: 1,516,320 (6)
abstracting: (p18<=0)
states: 4,278,687 (6)
.-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[EG [~ [A [[1<=p3 & 1<=p16] U 1<=p4]]] | [[1<=p9 & 1<=p11] | [EF [[p17<=0 | [[1<=p10 & 1<=p16] | AX [1<=p4]]]] & [EX [p4<=0] | [AG [p4<=0] | AG [[1<=p20 & 1<=p21]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[~ [E [true U ~ [[1<=p20 & 1<=p21]]]] | ~ [E [true U ~ [p4<=0]]]] | EX [p4<=0]] & E [true U [p17<=0 | [~ [EX [~ [1<=p4]]] | [1<=p10 & 1<=p16]]]]] | [1<=p9 & 1<=p11]] | EG [~ [[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [[1<=p3 & 1<=p16]] & ~ [1<=p4]]]]]]]]]]]

abstracting: (1<=p4)
states: 3,510,710 (6)
abstracting: (1<=p16)
states: 4,701,298 (6)
abstracting: (1<=p3)
states: 2,358,384 (6)
abstracting: (1<=p4)
states: 3,510,710 (6)
abstracting: (1<=p4)
states: 3,510,710 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p11)
states: 3,510,710 (6)
abstracting: (1<=p9)
states: 5,990,348 (6)
abstracting: (1<=p16)
states: 4,701,298 (6)
abstracting: (1<=p10)
states: 2,358,384 (6)
abstracting: (1<=p4)
states: 3,510,710 (6)
.abstracting: (p17<=0)
states: 2,528,288 (6)
abstracting: (p4<=0)
states: 2,599,933 (6)
.abstracting: (p4<=0)
states: 2,599,933 (6)
abstracting: (1<=p21)
states: 4,701,298 (6)
abstracting: (1<=p20)
states: 4,558,463 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: [AF [[EX [[p14<=0 | p17<=0]] & EF [AX [p14<=0]]]] & [AF [[p5<=0 & [[[p7<=0 | [p8<=0 | p12<=0]] & AX [[p20<=0 | p21<=0]]] | A [1<=p19 U [1<=p20 & 1<=p21]]]]] & AG [EF [1<=p12]]]]
normalized: [[~ [E [true U ~ [E [true U 1<=p12]]]] & ~ [EG [~ [[p5<=0 & [[~ [EG [~ [[1<=p20 & 1<=p21]]]] & ~ [E [~ [[1<=p20 & 1<=p21]] U [~ [1<=p19] & ~ [[1<=p20 & 1<=p21]]]]]] | [~ [EX [~ [[p20<=0 | p21<=0]]]] & [p7<=0 | [p8<=0 | p12<=0]]]]]]]]] & ~ [EG [~ [[E [true U ~ [EX [~ [p14<=0]]]] & EX [[p14<=0 | p17<=0]]]]]]]

abstracting: (p17<=0)
states: 2,528,288 (6)
abstracting: (p14<=0)
states: 3,752,259 (6)
.abstracting: (p14<=0)
states: 3,752,259 (6)
...
EG iterations: 2
abstracting: (p12<=0)
states: 4,278,687 (6)
abstracting: (p8<=0)
states: 110,250 (5)
abstracting: (p7<=0)
states: 3,752,259 (6)
abstracting: (p21<=0)
states: 1,409,345 (6)
abstracting: (p20<=0)
states: 1,552,180 (6)
.abstracting: (1<=p21)
states: 4,701,298 (6)
abstracting: (1<=p20)
states: 4,558,463 (6)
abstracting: (1<=p19)
states: 4,594,323 (6)
abstracting: (1<=p21)
states: 4,701,298 (6)
abstracting: (1<=p20)
states: 4,558,463 (6)
abstracting: (1<=p21)
states: 4,701,298 (6)
abstracting: (1<=p20)
states: 4,558,463 (6)
..
EG iterations: 2
abstracting: (p5<=0)
states: 2,599,933 (6)
..
EG iterations: 2
abstracting: (1<=p12)
states: 1,831,956 (6)
-> the formula is TRUE

FORMULA MAPK-PT-00008-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: [A [[[p12<=0 & [AF [~ [[[1<=p8 & 1<=p10] | 1<=p5]]] & EG [1<=p14]]] & [EG [1<=p19] & [EF [1<=p5] & [1<=p13 | ~ [AF [1<=p1]]]]]] U [[E [~ [EX [1<=p19]] U [1<=p7 & 1<=p8]] | 1<=p12] | [1<=p14 | AF [EG [1<=p12]]]]] & AG [EF [1<=p18]]]
normalized: [~ [E [true U ~ [E [true U 1<=p18]]]] & [~ [EG [~ [[[1<=p14 | ~ [EG [~ [EG [1<=p12]]]]] | [1<=p12 | E [~ [EX [1<=p19]] U [1<=p7 & 1<=p8]]]]]]] & ~ [E [~ [[[1<=p14 | ~ [EG [~ [EG [1<=p12]]]]] | [1<=p12 | E [~ [EX [1<=p19]] U [1<=p7 & 1<=p8]]]]] U [~ [[[[[1<=p13 | EG [~ [1<=p1]]] & E [true U 1<=p5]] & EG [1<=p19]] & [p12<=0 & [EG [1<=p14] & ~ [EG [[1<=p5 | [1<=p8 & 1<=p10]]]]]]]] & ~ [[[1<=p14 | ~ [EG [~ [EG [1<=p12]]]]] | [1<=p12 | E [~ [EX [1<=p19]] U [1<=p7 & 1<=p8]]]]]]]]]]

abstracting: (1<=p8)
states: 6,000,393 (6)
abstracting: (1<=p7)
states: 2,358,384 (6)
abstracting: (1<=p19)
states: 4,594,323 (6)
.abstracting: (1<=p12)
states: 1,831,956 (6)
abstracting: (1<=p12)
states: 1,831,956 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p14)
states: 2,358,384 (6)
abstracting: (1<=p10)
states: 2,358,384 (6)
abstracting: (1<=p8)
states: 6,000,393 (6)
abstracting: (1<=p5)
states: 3,510,710 (6)
.
EG iterations: 1
abstracting: (1<=p14)
states: 2,358,384 (6)
.
EG iterations: 1
abstracting: (p12<=0)
states: 4,278,687 (6)
abstracting: (1<=p19)
states: 4,594,323 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 3,510,710 (6)
abstracting: (1<=p1)
states: 1,368,759 (6)
.
EG iterations: 1
abstracting: (1<=p13)
states: 2,358,384 (6)
abstracting: (1<=p8)
states: 6,000,393 (6)
abstracting: (1<=p7)
states: 2,358,384 (6)
abstracting: (1<=p19)
states: 4,594,323 (6)
.abstracting: (1<=p12)
states: 1,831,956 (6)
abstracting: (1<=p12)
states: 1,831,956 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p14)
states: 2,358,384 (6)
abstracting: (1<=p8)
states: 6,000,393 (6)
abstracting: (1<=p7)
states: 2,358,384 (6)
abstracting: (1<=p19)
states: 4,594,323 (6)
.abstracting: (1<=p12)
states: 1,831,956 (6)
abstracting: (1<=p12)
states: 1,831,956 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p14)
states: 2,358,384 (6)
.
EG iterations: 1
abstracting: (1<=p18)
states: 1,831,956 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

checking: AG [E [~ [[[~ [[1<=p16 & 1<=p3]] | [[1<=p8 & [1<=p10 & 1<=p14]] | ~ [[1<=p20 & 1<=p21]]]] & [~ [AF [[1<=p6 & 1<=p7]]] & [[1<=p9 & 1<=p11] | [1<=p12 | EX [1<=p1]]]]]] U [AF [1<=p18] | [EG [1<=p17] | ~ [[[EG [1<=p14] & 1<=p19] & [1<=p4 & AX [[1<=p3 & 1<=p16]]]]]]]]]
normalized: ~ [E [true U ~ [E [~ [[[[[1<=p12 | EX [1<=p1]] | [1<=p9 & 1<=p11]] & EG [~ [[1<=p6 & 1<=p7]]]] & [[~ [[1<=p20 & 1<=p21]] | [1<=p8 & [1<=p10 & 1<=p14]]] | ~ [[1<=p16 & 1<=p3]]]]] U [[~ [[[1<=p4 & ~ [EX [~ [[1<=p3 & 1<=p16]]]]] & [1<=p19 & EG [1<=p14]]]] | EG [1<=p17]] | ~ [EG [~ [1<=p18]]]]]]]]

abstracting: (1<=p18)
states: 1,831,956 (6)
.
EG iterations: 1
abstracting: (1<=p17)
states: 3,582,355 (6)
.
EG iterations: 1
abstracting: (1<=p14)
states: 2,358,384 (6)
.
EG iterations: 1
abstracting: (1<=p19)
states: 4,594,323 (6)
abstracting: (1<=p16)
states: 4,701,298 (6)
abstracting: (1<=p3)
states: 2,358,384 (6)
.abstracting: (1<=p4)
states: 3,510,710 (6)
abstracting: (1<=p3)
states: 2,358,384 (6)
abstracting: (1<=p16)
states: 4,701,298 (6)
abstracting: (1<=p14)
states: 2,358,384 (6)
abstracting: (1<=p10)
states: 2,358,384 (6)
abstracting: (1<=p8)
states: 6,000,393 (6)
abstracting: (1<=p21)
states: 4,701,298 (6)
abstracting: (1<=p20)
states: 4,558,463 (6)
abstracting: (1<=p7)
states: 2,358,384 (6)
abstracting: (1<=p6)
states: 3,510,710 (6)
.
EG iterations: 1
abstracting: (1<=p11)
states: 3,510,710 (6)
abstracting: (1<=p9)
states: 5,990,348 (6)
abstracting: (1<=p1)
states: 1,368,759 (6)
.abstracting: (1<=p12)
states: 1,831,956 (6)
-> the formula is FALSE

FORMULA MAPK-PT-00008-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

totally nodes used: 82402 (8.2e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 477911 364140 842051
used/not used/entry size/cache size: 431291 66677573 16 1024MB
basic ops cache: hits/miss/sum: 90584 76294 166878
used/not used/entry size/cache size: 141170 16636046 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: 10223 7461 17684
used/not used/entry size/cache size: 7459 8381149 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 67036841
1 69023
2 1666
3 383
4 360
5 127
6 49
7 108
8 47
9 39
>= 10 221

Total processing time: 0m 4.471sec


BK_STOP 1679532358912

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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:761 (25), effective:112 (3)

initing FirstDep: 0m 0.000sec


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

iterations count:102 (3), effective:4 (0)

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

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

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

iterations count:91 (3), effective:10 (0)

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

iterations count:139 (4), effective:16 (0)

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

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

iterations count:218 (7), effective:32 (1)

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

iterations count:141 (4), effective:13 (0)

iterations count:154 (5), effective:22 (0)

iterations count:165 (5), effective:21 (0)

iterations count:142 (4), effective:16 (0)

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

iterations count:199 (6), effective:27 (0)

iterations count:186 (6), effective:24 (0)

iterations count:84 (2), effective:6 (0)

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

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

iterations count:136 (4), effective:15 (0)

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

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

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

iterations count:134 (4), effective:12 (0)

iterations count:72 (2), effective:6 (0)

iterations count:515 (17), effective:72 (2)

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="MAPK-PT-00008"
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 MAPK-PT-00008, 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 r234-tall-167856420500546"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MAPK-PT-00008.tgz
mv MAPK-PT-00008 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 ;