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-167856420500562.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-00040, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856420500562
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.5K Feb 26 10:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 10:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 10:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 10:49 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.4K Feb 25 16:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.8K Feb 26 10:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 10:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 10:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 10:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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-00040-CTLFireability-00
FORMULA_NAME MAPK-PT-00040-CTLFireability-01
FORMULA_NAME MAPK-PT-00040-CTLFireability-02
FORMULA_NAME MAPK-PT-00040-CTLFireability-03
FORMULA_NAME MAPK-PT-00040-CTLFireability-04
FORMULA_NAME MAPK-PT-00040-CTLFireability-05
FORMULA_NAME MAPK-PT-00040-CTLFireability-06
FORMULA_NAME MAPK-PT-00040-CTLFireability-07
FORMULA_NAME MAPK-PT-00040-CTLFireability-08
FORMULA_NAME MAPK-PT-00040-CTLFireability-09
FORMULA_NAME MAPK-PT-00040-CTLFireability-10
FORMULA_NAME MAPK-PT-00040-CTLFireability-11
FORMULA_NAME MAPK-PT-00040-CTLFireability-12
FORMULA_NAME MAPK-PT-00040-CTLFireability-13
FORMULA_NAME MAPK-PT-00040-CTLFireability-14
FORMULA_NAME MAPK-PT-00040-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679532632006

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-00040
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 00:50:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 00:50:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 00:50:33] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2023-03-23 00:50:33] [INFO ] Transformed 22 places.
[2023-03-23 00:50:33] [INFO ] Transformed 30 transitions.
[2023-03-23 00:50:33] [INFO ] Parsed PT model containing 22 places and 30 transitions and 90 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MAPK-PT-00040-CTLFireability-08 TRUE 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:50:33] [INFO ] Computed 7 place invariants in 8 ms
[2023-03-23 00:50:33] [INFO ] Implicit Places using invariants in 369 ms returned []
[2023-03-23 00:50:33] [INFO ] Invariant cache hit.
[2023-03-23 00:50:34] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
[2023-03-23 00:50:34] [INFO ] Invariant cache hit.
[2023-03-23 00:50:34] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 22/22 places, 30/30 transitions.
Support contains 22 out of 22 places after structural reductions.
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 17 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 6 ms
[2023-03-23 00:50:34] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 31) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-23 00:50:34] [INFO ] Invariant cache hit.
[2023-03-23 00:50:34] [INFO ] After 18ms 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 15 simplifications.
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 17 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 16 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 3 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 22/22 places, 30/30 transitions.
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 22 transition count 30
Applied a total of 1 rules in 6 ms. Remains 22 /22 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL 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 SI_CTL mode , in 1 iterations and 1 ms. Remains : 22/22 places, 30/30 transitions.
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [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
Applied a total of 3 rules in 3 ms. Remains 20 /22 variables (removed 2) and now considering 29/30 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 20/22 places, 29/30 transitions.
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Input system was already deterministic with 29 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:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [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:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [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
Performed 1 Post agglomeration using F-continuation condition.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.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 18 transition count 27
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 18 transition count 27
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 10 place count 17 transition count 26
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 17 transition count 26
Applied a total of 11 rules in 5 ms. Remains 17 /22 variables (removed 5) and now considering 26/30 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 17/22 places, 26/30 transitions.
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 1 ms
[2023-03-23 00:50:34] [INFO ] Input system was already deterministic with 26 transitions.
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [INFO ] Flatten gal took : 2 ms
[2023-03-23 00:50:34] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-23 00:50:34] [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 1491 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.716sec


RS generation: 0m 0.293sec


-> reachability set: #nodes 27287 (2.7e+04) #states 478,293,389,221,095 (14)



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

checking: EX [AF [1<=p17]]
normalized: EX [~ [EG [~ [1<=p17]]]]

abstracting: (1<=p17)
states: 421,872,267,018,945 (14)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.367sec

checking: EX [[1<=p7 & 1<=p8]]
normalized: EX [[1<=p7 & 1<=p8]]

abstracting: (1<=p8)
states: 478,286,415,151,839 (14)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
.-> the formula is FALSE

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

MC time: 0m 0.310sec

checking: AG [EF [[1<=p2 & 1<=p16]]]
normalized: ~ [E [true U ~ [E [true U [1<=p2 & 1<=p16]]]]]

abstracting: (1<=p16)
states: 450,680,841,133,320 (14)
abstracting: (1<=p2)
states: 475,913,876,080,113 (14)
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.138sec

checking: EG [EF [[EF [1<=p0] & [p10<=0 | p16<=0]]]]
normalized: EG [E [true U [[p10<=0 | p16<=0] & E [true U 1<=p0]]]]

abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
abstracting: (p16<=0)
states: 27,612,548,087,775 (13)
abstracting: (p10<=0)
states: 123,005,404,155,195 (14)

EG iterations: 0
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.639sec

checking: AG [AX [[[AX [p1<=0] | EG [p13<=0]] | [1<=p17 | p12<=0]]]]
normalized: ~ [E [true U EX [~ [[[1<=p17 | p12<=0] | [EG [p13<=0] | ~ [EX [~ [p1<=0]]]]]]]]]

abstracting: (p1<=0)
states: 169,509,997,521,430 (14)
.abstracting: (p13<=0)
states: 123,005,404,155,195 (14)
.
EG iterations: 1
abstracting: (p12<=0)
states: 143,337,672,020,055 (14)
abstracting: (1<=p17)
states: 421,872,267,018,945 (14)
.-> the formula is FALSE

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

MC time: 0m 1.803sec

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

abstracting: (p0<=0)
states: 169,509,997,521,430 (14)
abstracting: (p14<=0)
states: 123,005,404,155,195 (14)
abstracting: (p17<=0)
states: 56,421,122,202,150 (13)
abstracting: (p0<=0)
states: 169,509,997,521,430 (14)
abstracting: (p0<=0)
states: 169,509,997,521,430 (14)
-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.555sec

checking: AX [[~ [E [p17<=0 U 1<=p14]] | [1<=p5 | [AF [EG [1<=p19]] & p4<=0]]]]
normalized: ~ [EX [~ [[[1<=p5 | [p4<=0 & ~ [EG [~ [EG [1<=p19]]]]]] | ~ [E [p17<=0 U 1<=p14]]]]]]

abstracting: (1<=p14)
states: 355,287,985,065,900 (14)
abstracting: (p17<=0)
states: 56,421,122,202,150 (13)
abstracting: (1<=p19)
states: 448,841,232,870,555 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p4<=0)
states: 62,912,256,217,955 (13)
abstracting: (1<=p5)
states: 415,381,133,003,140 (14)
.-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.792sec

checking: AG [EF [EX [[[1<=p17 | [1<=p5 | [1<=p6 & [1<=p7 & 1<=p0]]]] & p19<=0]]]]
normalized: ~ [E [true U ~ [E [true U EX [[p19<=0 & [1<=p17 | [1<=p5 | [1<=p6 & [1<=p7 & 1<=p0]]]]]]]]]]

abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
abstracting: (1<=p6)
states: 415,381,133,003,140 (14)
abstracting: (1<=p5)
states: 415,381,133,003,140 (14)
abstracting: (1<=p17)
states: 421,872,267,018,945 (14)
abstracting: (p19<=0)
states: 29,452,156,350,540 (13)
.-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.503sec

checking: E [EX [1<=p19] U EF [[AG [[EG [1<=p0] | p1<=0]] & EX [[[1<=p9 & 1<=p11] & [1<=p3 & 1<=p16]]]]]]
normalized: E [EX [1<=p19] U E [true U [~ [E [true U ~ [[p1<=0 | EG [1<=p0]]]]] & EX [[[1<=p9 & 1<=p11] & [1<=p3 & 1<=p16]]]]]]

abstracting: (1<=p16)
states: 450,680,841,133,320 (14)
abstracting: (1<=p3)
states: 355,287,985,065,900 (14)
abstracting: (1<=p11)
states: 415,381,133,003,140 (14)
abstracting: (1<=p9)
states: 478,255,658,118,400 (14)
.abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
.
EG iterations: 1
abstracting: (p1<=0)
states: 169,509,997,521,430 (14)
abstracting: (1<=p19)
states: 448,841,232,870,555 (14)
.-> the formula is FALSE

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

MC time: 0m 1.221sec

checking: AG [[[EF [AX [[p2<=0 | p16<=0]]] | AF [p19<=0]] | [EF [AG [[p9<=0 | p11<=0]]] | [EX [EG [1<=p0]] | [1<=p3 & [1<=p16 & p14<=0]]]]]]
normalized: ~ [E [true U ~ [[[[[1<=p3 & [1<=p16 & p14<=0]] | EX [EG [1<=p0]]] | E [true U ~ [E [true U ~ [[p9<=0 | p11<=0]]]]]] | [~ [EG [~ [p19<=0]]] | E [true U ~ [EX [~ [[p2<=0 | p16<=0]]]]]]]]]]

abstracting: (p16<=0)
states: 27,612,548,087,775 (13)
abstracting: (p2<=0)
states: 2,379,513,140,982 (12)
.abstracting: (p19<=0)
states: 29,452,156,350,540 (13)
.
EG iterations: 1
abstracting: (p11<=0)
states: 62,912,256,217,955 (13)
abstracting: (p9<=0)
states: 37,731,102,695 (10)
abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
.
EG iterations: 1
.abstracting: (p14<=0)
states: 123,005,404,155,195 (14)
abstracting: (1<=p16)
states: 450,680,841,133,320 (14)
abstracting: (1<=p3)
states: 355,287,985,065,900 (14)
-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.348sec

checking: AX [[EX [[[[p1<=0 & p18<=0] | ~ [A [1<=p12 U [1<=p7 & 1<=p8]]]] & p12<=0]] | E [AF [[1<=p20 & 1<=p21]] U 1<=p14]]]
normalized: ~ [EX [~ [[E [~ [EG [~ [[1<=p20 & 1<=p21]]]] U 1<=p14] | EX [[p12<=0 & [~ [[~ [EG [~ [[1<=p7 & 1<=p8]]]] & ~ [E [~ [[1<=p7 & 1<=p8]] U [~ [1<=p12] & ~ [[1<=p7 & 1<=p8]]]]]]] | [p1<=0 & p18<=0]]]]]]]]

abstracting: (p18<=0)
states: 143,337,672,020,055 (14)
abstracting: (p1<=0)
states: 169,509,997,521,430 (14)
abstracting: (1<=p8)
states: 478,286,415,151,839 (14)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
abstracting: (1<=p12)
states: 334,955,717,201,040 (14)
abstracting: (1<=p8)
states: 478,286,415,151,839 (14)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
abstracting: (1<=p8)
states: 478,286,415,151,839 (14)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
.
EG iterations: 1
abstracting: (p12<=0)
states: 143,337,672,020,055 (14)
.abstracting: (1<=p14)
states: 355,287,985,065,900 (14)
abstracting: (1<=p21)
states: 450,680,841,133,320 (14)
abstracting: (1<=p20)
states: 447,236,295,761,655 (14)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.826sec

checking: EF [EG [A [[[1<=p17 & 1<=p1] | [[1<=p0 & [1<=p9 & 1<=p11]] | [1<=p8 & [1<=p10 & 1<=p13]]]] U AG [[1<=p12 | 1<=p0]]]]]
normalized: E [true U EG [[~ [EG [E [true U ~ [[1<=p12 | 1<=p0]]]]] & ~ [E [E [true U ~ [[1<=p12 | 1<=p0]]] U [~ [[[[1<=p8 & [1<=p10 & 1<=p13]] | [1<=p0 & [1<=p9 & 1<=p11]]] | [1<=p17 & 1<=p1]]] & E [true U ~ [[1<=p12 | 1<=p0]]]]]]]]]

abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
abstracting: (1<=p12)
states: 334,955,717,201,040 (14)
abstracting: (1<=p1)
states: 308,783,391,699,665 (14)
abstracting: (1<=p17)
states: 421,872,267,018,945 (14)
abstracting: (1<=p11)
states: 415,381,133,003,140 (14)
abstracting: (1<=p9)
states: 478,255,658,118,400 (14)
abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
abstracting: (1<=p13)
states: 355,287,985,065,900 (14)
abstracting: (1<=p10)
states: 355,287,985,065,900 (14)
abstracting: (1<=p8)
states: 478,286,415,151,839 (14)
abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
abstracting: (1<=p12)
states: 334,955,717,201,040 (14)
abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
abstracting: (1<=p12)
states: 334,955,717,201,040 (14)

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 2.708sec

checking: [~ [E [[1<=p13 & [EF [1<=p17] & AF [E [1<=p5 U 1<=p4]]]] U AX [[1<=p7 & 1<=p15]]]] | [E [~ [AX [[1<=p6 & 1<=p7]]] U E [1<=p13 U 1<=p12]] & EX [1<=p1]]]
normalized: [[EX [1<=p1] & E [EX [~ [[1<=p6 & 1<=p7]]] U E [1<=p13 U 1<=p12]]] | ~ [E [[1<=p13 & [~ [EG [~ [E [1<=p5 U 1<=p4]]]] & E [true U 1<=p17]]] U ~ [EX [~ [[1<=p7 & 1<=p15]]]]]]]

abstracting: (1<=p15)
states: 415,381,133,003,140 (14)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
.abstracting: (1<=p17)
states: 421,872,267,018,945 (14)
abstracting: (1<=p4)
states: 415,381,133,003,140 (14)
abstracting: (1<=p5)
states: 415,381,133,003,140 (14)
.
EG iterations: 1
abstracting: (1<=p13)
states: 355,287,985,065,900 (14)
abstracting: (1<=p12)
states: 334,955,717,201,040 (14)
abstracting: (1<=p13)
states: 355,287,985,065,900 (14)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
abstracting: (1<=p6)
states: 415,381,133,003,140 (14)
.abstracting: (1<=p1)
states: 308,783,391,699,665 (14)
.-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.543sec

checking: [EF [[1<=p0 | [p1<=0 | 1<=p0]]] & EX [[[EF [[1<=p20 & [1<=p21 & [p2<=0 | p16<=0]]]] | AX [[p10<=0 | p16<=0]]] | [p5<=0 | [p18<=0 | p1<=0]]]]]
normalized: [EX [[[p5<=0 | [p18<=0 | p1<=0]] | [~ [EX [~ [[p10<=0 | p16<=0]]]] | E [true U [1<=p20 & [1<=p21 & [p2<=0 | p16<=0]]]]]]] & E [true U [1<=p0 | [p1<=0 | 1<=p0]]]]

abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
abstracting: (p1<=0)
states: 169,509,997,521,430 (14)
abstracting: (1<=p0)
states: 308,783,391,699,665 (14)
abstracting: (p16<=0)
states: 27,612,548,087,775 (13)
abstracting: (p2<=0)
states: 2,379,513,140,982 (12)
abstracting: (1<=p21)
states: 450,680,841,133,320 (14)
abstracting: (1<=p20)
states: 447,236,295,761,655 (14)
abstracting: (p16<=0)
states: 27,612,548,087,775 (13)
abstracting: (p10<=0)
states: 123,005,404,155,195 (14)
.abstracting: (p1<=0)
states: 169,509,997,521,430 (14)
abstracting: (p18<=0)
states: 143,337,672,020,055 (14)
abstracting: (p5<=0)
states: 62,912,256,217,955 (13)
.-> the formula is TRUE

FORMULA MAPK-PT-00040-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.481sec

checking: ~ [E [[EF [[~ [[1<=p7 & 1<=p15]] & E [1<=p1 U 1<=p17]]] | [[~ [[1<=p14 & [1<=p4 & p19<=0]]] | ~ [A [[1<=p6 & 1<=p9] U 1<=p17]]] & ~ [AG [1<=p19]]]] U ~ [[EG [[AG [~ [[p2<=0 | p16<=0]]] & [[1<=p6 & 1<=p7] | [1<=p6 & 1<=p9]]]] | AX [[~ [[1<=p6 & 1<=p7]] & AF [[1<=p7 & 1<=p15]]]]]]]]
normalized: ~ [E [[[E [true U ~ [1<=p19]] & [~ [[~ [EG [~ [1<=p17]]] & ~ [E [~ [1<=p17] U [~ [[1<=p6 & 1<=p9]] & ~ [1<=p17]]]]]] | ~ [[1<=p14 & [1<=p4 & p19<=0]]]]] | E [true U [E [1<=p1 U 1<=p17] & ~ [[1<=p7 & 1<=p15]]]]] U ~ [[~ [EX [~ [[~ [EG [~ [[1<=p7 & 1<=p15]]]] & ~ [[1<=p6 & 1<=p7]]]]]] | EG [[[[1<=p6 & 1<=p9] | [1<=p6 & 1<=p7]] & ~ [E [true U [p2<=0 | p16<=0]]]]]]]]]

abstracting: (p16<=0)
states: 27,612,548,087,775 (13)
abstracting: (p2<=0)
states: 2,379,513,140,982 (12)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
abstracting: (1<=p6)
states: 415,381,133,003,140 (14)
abstracting: (1<=p9)
states: 478,255,658,118,400 (14)
abstracting: (1<=p6)
states: 415,381,133,003,140 (14)
.
EG iterations: 1
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
abstracting: (1<=p6)
states: 415,381,133,003,140 (14)
abstracting: (1<=p15)
states: 415,381,133,003,140 (14)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
.
EG iterations: 1
.abstracting: (1<=p15)
states: 415,381,133,003,140 (14)
abstracting: (1<=p7)
states: 355,287,985,065,900 (14)
abstracting: (1<=p17)
states: 421,872,267,018,945 (14)
abstracting: (1<=p1)
states: 308,783,391,699,665 (14)
abstracting: (p19<=0)
states: 29,452,156,350,540 (13)
abstracting: (1<=p4)
states: 415,381,133,003,140 (14)
abstracting: (1<=p14)
states: 355,287,985,065,900 (14)
abstracting: (1<=p17)
states: 421,872,267,018,945 (14)
abstracting: (1<=p9)
states: 478,255,658,118,400 (14)
abstracting: (1<=p6)
states: 415,381,133,003,140 (14)
abstracting: (1<=p17)
states: 421,872,267,018,945 (14)
abstracting: (1<=p17)
states: 421,872,267,018,945 (14)
..
EG iterations: 2
abstracting: (1<=p19)
states: 448,841,232,870,555 (14)
-> the formula is FALSE

FORMULA MAPK-PT-00040-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.486sec

totally nodes used: 5490590 (5.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 104727877 17738652 122466529
used/not used/entry size/cache size: 18796170 48312694 16 1024MB
basic ops cache: hits/miss/sum: 32227973 5777521 38005494
used/not used/entry size/cache size: 6563842 10213374 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: 1488377 265106 1753483
used/not used/entry size/cache size: 261025 8127583 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 63321770
1 3486767
2 165274
3 32710
4 20074
5 16875
6 11199
7 10891
8 9176
9 5504
>= 10 28624

Total processing time: 0m35.048sec


BK_STOP 1679532670960

--------------------
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:3665 (122), effective:560 (18)

initing FirstDep: 0m 0.000sec


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

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

iterations count:130 (4), effective:20 (0)

iterations count:447 (14), effective:54 (1)

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

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

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

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

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

iterations count:391 (13), effective:48 (1)

iterations count:158 (5), effective:35 (1)

iterations count:1080 (36), effective:130 (4)

iterations count:150 (5), effective:17 (0)

iterations count:130 (4), effective:20 (0)

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

iterations count:410 (13), effective:40 (1)

iterations count:410 (13), effective:40 (1)

iterations count:206 (6), effective:59 (1)

iterations count:410 (13), effective:40 (1)

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

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

iterations count:290 (9), effective:38 (1)

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

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

iterations count:112 (3), effective:21 (0)

iterations count:984 (32), effective:162 (5)

iterations count:970 (32), effective:160 (5)

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

iterations count:168 (5), effective:35 (1)

iterations count:295 (9), effective:65 (2)

iterations count:300 (10), effective:30 (1)

iterations count:32 (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="MAPK-PT-00040"
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-00040, 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-167856420500562"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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