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.r138-smll-167819421400641.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 EGFr-PT-02010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421400641
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 8.9K Feb 25 19:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 19:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 19:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 19:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 19:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 19:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 25 19:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 19:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:02 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 59K 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 EGFr-PT-02010-CTLCardinality-00
FORMULA_NAME EGFr-PT-02010-CTLCardinality-01
FORMULA_NAME EGFr-PT-02010-CTLCardinality-02
FORMULA_NAME EGFr-PT-02010-CTLCardinality-03
FORMULA_NAME EGFr-PT-02010-CTLCardinality-04
FORMULA_NAME EGFr-PT-02010-CTLCardinality-05
FORMULA_NAME EGFr-PT-02010-CTLCardinality-06
FORMULA_NAME EGFr-PT-02010-CTLCardinality-07
FORMULA_NAME EGFr-PT-02010-CTLCardinality-08
FORMULA_NAME EGFr-PT-02010-CTLCardinality-09
FORMULA_NAME EGFr-PT-02010-CTLCardinality-10
FORMULA_NAME EGFr-PT-02010-CTLCardinality-11
FORMULA_NAME EGFr-PT-02010-CTLCardinality-12
FORMULA_NAME EGFr-PT-02010-CTLCardinality-13
FORMULA_NAME EGFr-PT-02010-CTLCardinality-14
FORMULA_NAME EGFr-PT-02010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679018920642

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EGFr-PT-02010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 02:08:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 02:08:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 02:08:43] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2023-03-17 02:08:44] [INFO ] Transformed 40 places.
[2023-03-17 02:08:44] [INFO ] Transformed 68 transitions.
[2023-03-17 02:08:44] [INFO ] Found NUPN structural information;
[2023-03-17 02:08:44] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 375 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Initial state reduction rules removed 2 formulas.
FORMULA EGFr-PT-02010-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 21 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2023-03-17 02:08:44] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2023-03-17 02:08:44] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-17 02:08:44] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-17 02:08:44] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2023-03-17 02:08:44] [INFO ] Invariant cache hit.
[2023-03-17 02:08:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 02:08:44] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-17 02:08:44] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2023-03-17 02:08:44] [INFO ] Invariant cache hit.
[2023-03-17 02:08:44] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 593 ms. Remains : 40/40 places, 68/68 transitions.
Support contains 35 out of 40 places after structural reductions.
[2023-03-17 02:08:45] [INFO ] Flatten gal took : 48 ms
[2023-03-17 02:08:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-17 02:08:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA EGFr-PT-02010-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 02:08:45] [INFO ] Flatten gal took : 22 ms
[2023-03-17 02:08:45] [INFO ] Input system was already deterministic with 68 transitions.
Support contains 30 out of 40 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 450 resets, run finished after 499 ms. (steps per millisecond=20 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-17 02:08:45] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2023-03-17 02:08:45] [INFO ] Invariant cache hit.
[2023-03-17 02:08:45] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-17 02:08:46] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 02:08:46] [INFO ] [Nat]Absence check using 20 positive place invariants in 10 ms returned sat
[2023-03-17 02:08:46] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 02:08:46] [INFO ] State equation strengthened by 19 read => feed constraints.
[2023-03-17 02:08:46] [INFO ] After 36ms SMT Verify possible using 19 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-17 02:08:46] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-17 02:08:46] [INFO ] After 282ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 68/68 transitions.
Graph (complete) has 137 edges and 40 vertex of which 22 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 21 output transitions
Drop transitions removed 21 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 22 transition count 35
Applied a total of 13 rules in 18 ms. Remains 22 /40 variables (removed 18) and now considering 35/68 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 22/40 places, 35/68 transitions.
Incomplete random walk after 10000 steps, including 839 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 240 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Probably explored full state space saw : 168 states, properties seen :0
Probabilistic random walk after 681 steps, saw 168 distinct states, run finished after 60 ms. (steps per millisecond=11 ) properties seen :0
Explored full state space saw : 168 states, properties seen :0
Exhaustive walk after 681 steps, saw 168 distinct states, run finished after 3 ms. (steps per millisecond=227 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EGFr-PT-02010-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 30 ms
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 29 ms
[2023-03-17 02:08:46] [INFO ] Input system was already deterministic with 68 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 25 ms
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 10 ms
[2023-03-17 02:08:46] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 8 ms
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 25 ms
[2023-03-17 02:08:46] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 12 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 8 ms
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 26 ms
[2023-03-17 02:08:46] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 7 ms
[2023-03-17 02:08:46] [INFO ] Flatten gal took : 23 ms
[2023-03-17 02:08:47] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 24 ms
[2023-03-17 02:08:47] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 4 ms
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:08:47] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 17 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:08:47] [INFO ] Input system was already deterministic with 68 transitions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 16 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 40/40 places, 68/68 transitions.
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 4 ms
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:08:47] [INFO ] Input system was already deterministic with 68 transitions.
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 5 ms
[2023-03-17 02:08:47] [INFO ] Flatten gal took : 21 ms
[2023-03-17 02:08:47] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-17 02:08:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 68 transitions and 338 arcs took 1 ms.
Total runtime 3778 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 40 NrTr: 68 NrArc: 338)

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

net check time: 0m 0.000sec

init dd package: 0m 3.278sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 180 (1.8e+02) #states 4,200 (3)



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

checking: EF [AX [EG [[p36<=0 & 0<=p36]]]]
normalized: E [true U ~ [EX [~ [EG [[p36<=0 & 0<=p36]]]]]]

abstracting: (0<=p36)
states: 4,200 (3)
abstracting: (p36<=0)
states: 1,580 (3)
....................
EG iterations: 20
.-> the formula is TRUE

FORMULA EGFr-PT-02010-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: EG [AG [EG [EF [[~ [[p23<=0 & 0<=p23]] & ~ [[p20<=1 & 1<=p20]]]]]]]
normalized: EG [~ [E [true U ~ [EG [E [true U [~ [[p20<=1 & 1<=p20]] & ~ [[p23<=0 & 0<=p23]]]]]]]]]

abstracting: (0<=p23)
states: 4,200 (3)
abstracting: (p23<=0)
states: 2,801 (3)
abstracting: (1<=p20)
states: 939
abstracting: (p20<=1)
states: 4,200 (3)

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA EGFr-PT-02010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AX [AF [AG [[[p37<=0 & 0<=p37] | [p36<=1 & 1<=p36]]]]]
normalized: ~ [EX [EG [E [true U ~ [[[p36<=1 & 1<=p36] | [p37<=0 & 0<=p37]]]]]]]

abstracting: (0<=p37)
states: 4,200 (3)
abstracting: (p37<=0)
states: 2,620 (3)
abstracting: (1<=p36)
states: 2,620 (3)
abstracting: (p36<=1)
states: 4,200 (3)
.....................
EG iterations: 21
.-> the formula is TRUE

FORMULA EGFr-PT-02010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: E [AX [1<=0] U ~ [[[[p29<=0 & 0<=p29] | [p27<=1 & 1<=p27]] & AF [[p22<=1 & 1<=p22]]]]]
normalized: E [~ [EX [~ [1<=0]]] U ~ [[~ [EG [~ [[p22<=1 & 1<=p22]]]] & [[p27<=1 & 1<=p27] | [p29<=0 & 0<=p29]]]]]

abstracting: (0<=p29)
states: 4,200 (3)
abstracting: (p29<=0)
states: 2,302 (3)
abstracting: (1<=p27)
states: 3,240 (3)
abstracting: (p27<=1)
states: 4,200 (3)
abstracting: (1<=p22)
states: 2,801 (3)
abstracting: (p22<=1)
states: 4,200 (3)
.
EG iterations: 1
abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA EGFr-PT-02010-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [AF [[AX [[p25<=0 & 0<=p25]] | [[p31<=0 & 0<=p31] | [[p37<=0 & 0<=p37] & [p21<=1 & 1<=p21]]]]]]
normalized: ~ [E [true U EG [~ [[[[[p21<=1 & 1<=p21] & [p37<=0 & 0<=p37]] | [p31<=0 & 0<=p31]] | ~ [EX [~ [[p25<=0 & 0<=p25]]]]]]]]]

abstracting: (0<=p25)
states: 4,200 (3)
abstracting: (p25<=0)
states: 939
.abstracting: (0<=p31)
states: 4,200 (3)
abstracting: (p31<=0)
states: 1,507 (3)
abstracting: (0<=p37)
states: 4,200 (3)
abstracting: (p37<=0)
states: 2,620 (3)
abstracting: (1<=p21)
states: 3,261 (3)
abstracting: (p21<=1)
states: 4,200 (3)
..................
EG iterations: 18
-> the formula is TRUE

FORMULA EGFr-PT-02010-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: EX [AF [[AG [[~ [[p17<=0 & 0<=p17]] | [~ [[p0<=0 & 0<=p0]] & ~ [[p13<=1 & 1<=p13]]]]] & [~ [[p7<=0 & 0<=p7]] | [~ [[p32<=0 & 0<=p32]] & ~ [[p29<=1 & 1<=p29]]]]]]]
normalized: EX [~ [EG [~ [[[[~ [[p29<=1 & 1<=p29]] & ~ [[p32<=0 & 0<=p32]]] | ~ [[p7<=0 & 0<=p7]]] & ~ [E [true U ~ [[[~ [[p13<=1 & 1<=p13]] & ~ [[p0<=0 & 0<=p0]]] | ~ [[p17<=0 & 0<=p17]]]]]]]]]]]

abstracting: (0<=p17)
states: 4,200 (3)
abstracting: (p17<=0)
states: 2,655 (3)
abstracting: (0<=p0)
states: 4,200 (3)
abstracting: (p0<=0)
states: 2,862 (3)
abstracting: (1<=p13)
states: 4,196 (3)
abstracting: (p13<=1)
states: 4,200 (3)
abstracting: (0<=p7)
states: 4,200 (3)
abstracting: (p7<=0)
states: 2,985 (3)
abstracting: (0<=p32)
states: 4,200 (3)
abstracting: (p32<=0)
states: 3,528 (3)
abstracting: (1<=p29)
states: 1,898 (3)
abstracting: (p29<=1)
states: 4,200 (3)
........................
EG iterations: 24
.-> the formula is TRUE

FORMULA EGFr-PT-02010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: A [[[p23<=0 & 0<=p23] | [[p30<=1 & 1<=p30] | [[p27<=0 & 0<=p27] & [~ [EF [[[p24<=0 & 0<=p24] | [p20<=1 & 1<=p20]]]] | [~ [[[p23<=0 & 0<=p23] | [p9<=1 & 1<=p9]]] | AG [[[p39<=0 & 0<=p39] | [p0<=1 & 1<=p0]]]]]]]] U AF [[~ [[AG [[[p10<=0 & 0<=p10] | [p19<=1 & 1<=p19]]] | AF [[[p20<=0 & 0<=p20] | [p13<=1 & 1<=p13]]]]] & [EX [~ [[p24<=1 & 1<=p24]]] | ~ [[[p34<=0 & 0<=p34] | [p0<=1 & 1<=p0]]]]]]]
normalized: [~ [EG [EG [~ [[[~ [[[p0<=1 & 1<=p0] | [p34<=0 & 0<=p34]]] | EX [~ [[p24<=1 & 1<=p24]]]] & ~ [[~ [EG [~ [[[p13<=1 & 1<=p13] | [p20<=0 & 0<=p20]]]]] | ~ [E [true U ~ [[[p19<=1 & 1<=p19] | [p10<=0 & 0<=p10]]]]]]]]]]]] & ~ [E [EG [~ [[[~ [[[p0<=1 & 1<=p0] | [p34<=0 & 0<=p34]]] | EX [~ [[p24<=1 & 1<=p24]]]] & ~ [[~ [EG [~ [[[p13<=1 & 1<=p13] | [p20<=0 & 0<=p20]]]]] | ~ [E [true U ~ [[[p19<=1 & 1<=p19] | [p10<=0 & 0<=p10]]]]]]]]]] U [~ [[[[[[~ [E [true U ~ [[[p0<=1 & 1<=p0] | [p39<=0 & 0<=p39]]]]] | ~ [[[p9<=1 & 1<=p9] | [p23<=0 & 0<=p23]]]] | ~ [E [true U [[p20<=1 & 1<=p20] | [p24<=0 & 0<=p24]]]]] & [p27<=0 & 0<=p27]] | [p30<=1 & 1<=p30]] | [p23<=0 & 0<=p23]]] & EG [~ [[[~ [[[p0<=1 & 1<=p0] | [p34<=0 & 0<=p34]]] | EX [~ [[p24<=1 & 1<=p24]]]] & ~ [[~ [EG [~ [[[p13<=1 & 1<=p13] | [p20<=0 & 0<=p20]]]]] | ~ [E [true U ~ [[[p19<=1 & 1<=p19] | [p10<=0 & 0<=p10]]]]]]]]]]]]]]

abstracting: (0<=p10)
states: 4,200 (3)
abstracting: (p10<=0)
states: 2,041 (3)
abstracting: (1<=p19)
states: 1,545 (3)
abstracting: (p19<=1)
states: 4,200 (3)
abstracting: (0<=p20)
states: 4,200 (3)
abstracting: (p20<=0)
states: 3,261 (3)
abstracting: (1<=p13)
states: 4,196 (3)
abstracting: (p13<=1)
states: 4,200 (3)
....
EG iterations: 4
abstracting: (1<=p24)
states: 939
abstracting: (p24<=1)
states: 4,200 (3)
.abstracting: (0<=p34)
states: 4,200 (3)
abstracting: (p34<=0)
states: 1,580 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)

EG iterations: 0
abstracting: (0<=p23)
states: 4,200 (3)
abstracting: (p23<=0)
states: 2,801 (3)
abstracting: (1<=p30)
states: 1,507 (3)
abstracting: (p30<=1)
states: 4,200 (3)
abstracting: (0<=p27)
states: 4,200 (3)
abstracting: (p27<=0)
states: 960
abstracting: (0<=p24)
states: 4,200 (3)
abstracting: (p24<=0)
states: 3,261 (3)
abstracting: (1<=p20)
states: 939
abstracting: (p20<=1)
states: 4,200 (3)
abstracting: (0<=p23)
states: 4,200 (3)
abstracting: (p23<=0)
states: 2,801 (3)
abstracting: (1<=p9)
states: 2,187 (3)
abstracting: (p9<=1)
states: 4,200 (3)
abstracting: (0<=p39)
states: 4,200 (3)
abstracting: (p39<=0)
states: 3,957 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (0<=p10)
states: 4,200 (3)
abstracting: (p10<=0)
states: 2,041 (3)
abstracting: (1<=p19)
states: 1,545 (3)
abstracting: (p19<=1)
states: 4,200 (3)
abstracting: (0<=p20)
states: 4,200 (3)
abstracting: (p20<=0)
states: 3,261 (3)
abstracting: (1<=p13)
states: 4,196 (3)
abstracting: (p13<=1)
states: 4,200 (3)
....
EG iterations: 4
abstracting: (1<=p24)
states: 939
abstracting: (p24<=1)
states: 4,200 (3)
.abstracting: (0<=p34)
states: 4,200 (3)
abstracting: (p34<=0)
states: 1,580 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)

EG iterations: 0
abstracting: (0<=p10)
states: 4,200 (3)
abstracting: (p10<=0)
states: 2,041 (3)
abstracting: (1<=p19)
states: 1,545 (3)
abstracting: (p19<=1)
states: 4,200 (3)
abstracting: (0<=p20)
states: 4,200 (3)
abstracting: (p20<=0)
states: 3,261 (3)
abstracting: (1<=p13)
states: 4,196 (3)
abstracting: (p13<=1)
states: 4,200 (3)
....
EG iterations: 4
abstracting: (1<=p24)
states: 939
abstracting: (p24<=1)
states: 4,200 (3)
.abstracting: (0<=p34)
states: 4,200 (3)
abstracting: (p34<=0)
states: 1,580 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA EGFr-PT-02010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AX [A [[[p7<=1 & 1<=p7] & A [[[[p36<=1 & 1<=p36] | [p0<=1 & 1<=p0]] & [[p20<=0 & 0<=p20] | [[p2<=0 & 0<=p2] | [p12<=1 & 1<=p12]]]] U [[[[p19<=0 & 0<=p19] | [p28<=1 & 1<=p28]] & [[p38<=0 & 0<=p38] | [p32<=1 & 1<=p32]]] | [[p32<=1 & 1<=p32] & [[p37<=0 & 0<=p37] | [p34<=1 & 1<=p34]]]]]] U [AF [[p12<=1 & 1<=p12]] & [[AF [[p13<=0 & 0<=p13]] | EG [[p32<=1 & 1<=p32]]] | [[p11<=0 & 0<=p11] | [p39<=1 & 1<=p39]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[[[[p39<=1 & 1<=p39] | [p11<=0 & 0<=p11]] | [EG [[p32<=1 & 1<=p32]] | ~ [EG [~ [[p13<=0 & 0<=p13]]]]]] & ~ [EG [~ [[p12<=1 & 1<=p12]]]]]]]] & ~ [E [~ [[[[[p39<=1 & 1<=p39] | [p11<=0 & 0<=p11]] | [EG [[p32<=1 & 1<=p32]] | ~ [EG [~ [[p13<=0 & 0<=p13]]]]]] & ~ [EG [~ [[p12<=1 & 1<=p12]]]]]] U [~ [[[~ [EG [~ [[[[[p34<=1 & 1<=p34] | [p37<=0 & 0<=p37]] & [p32<=1 & 1<=p32]] | [[[p32<=1 & 1<=p32] | [p38<=0 & 0<=p38]] & [[p28<=1 & 1<=p28] | [p19<=0 & 0<=p19]]]]]]] & ~ [E [~ [[[[[p34<=1 & 1<=p34] | [p37<=0 & 0<=p37]] & [p32<=1 & 1<=p32]] | [[[p32<=1 & 1<=p32] | [p38<=0 & 0<=p38]] & [[p28<=1 & 1<=p28] | [p19<=0 & 0<=p19]]]]] U [~ [[[[[p12<=1 & 1<=p12] | [p2<=0 & 0<=p2]] | [p20<=0 & 0<=p20]] & [[p0<=1 & 1<=p0] | [p36<=1 & 1<=p36]]]] & ~ [[[[[p34<=1 & 1<=p34] | [p37<=0 & 0<=p37]] & [p32<=1 & 1<=p32]] | [[[p32<=1 & 1<=p32] | [p38<=0 & 0<=p38]] & [[p28<=1 & 1<=p28] | [p19<=0 & 0<=p19]]]]]]]]] & [p7<=1 & 1<=p7]]] & ~ [[[[[p39<=1 & 1<=p39] | [p11<=0 & 0<=p11]] | [EG [[p32<=1 & 1<=p32]] | ~ [EG [~ [[p13<=0 & 0<=p13]]]]]] & ~ [EG [~ [[p12<=1 & 1<=p12]]]]]]]]]]]]]

abstracting: (1<=p12)
states: 4
abstracting: (p12<=1)
states: 4,200 (3)
.
EG iterations: 1
abstracting: (0<=p13)
states: 4,200 (3)
abstracting: (p13<=0)
states: 4
.
EG iterations: 1
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
..................
EG iterations: 18
abstracting: (0<=p11)
states: 4,200 (3)
abstracting: (p11<=0)
states: 2,159 (3)
abstracting: (1<=p39)
states: 243
abstracting: (p39<=1)
states: 4,200 (3)
abstracting: (1<=p7)
states: 1,215 (3)
abstracting: (p7<=1)
states: 4,200 (3)
abstracting: (0<=p19)
states: 4,200 (3)
abstracting: (p19<=0)
states: 2,655 (3)
abstracting: (1<=p28)
states: 2,302 (3)
abstracting: (p28<=1)
states: 4,200 (3)
abstracting: (0<=p38)
states: 4,200 (3)
abstracting: (p38<=0)
states: 243
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
abstracting: (0<=p37)
states: 4,200 (3)
abstracting: (p37<=0)
states: 2,620 (3)
abstracting: (1<=p34)
states: 2,620 (3)
abstracting: (p34<=1)
states: 4,200 (3)
abstracting: (1<=p36)
states: 2,620 (3)
abstracting: (p36<=1)
states: 4,200 (3)
abstracting: (1<=p0)
states: 1,338 (3)
abstracting: (p0<=1)
states: 4,200 (3)
abstracting: (0<=p20)
states: 4,200 (3)
abstracting: (p20<=0)
states: 3,261 (3)
abstracting: (0<=p2)
states: 4,200 (3)
abstracting: (p2<=0)
states: 554
abstracting: (1<=p12)
states: 4
abstracting: (p12<=1)
states: 4,200 (3)
abstracting: (0<=p19)
states: 4,200 (3)
abstracting: (p19<=0)
states: 2,655 (3)
abstracting: (1<=p28)
states: 2,302 (3)
abstracting: (p28<=1)
states: 4,200 (3)
abstracting: (0<=p38)
states: 4,200 (3)
abstracting: (p38<=0)
states: 243
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
abstracting: (0<=p37)
states: 4,200 (3)
abstracting: (p37<=0)
states: 2,620 (3)
abstracting: (1<=p34)
states: 2,620 (3)
abstracting: (p34<=1)
states: 4,200 (3)
abstracting: (0<=p19)
states: 4,200 (3)
abstracting: (p19<=0)
states: 2,655 (3)
abstracting: (1<=p28)
states: 2,302 (3)
abstracting: (p28<=1)
states: 4,200 (3)
abstracting: (0<=p38)
states: 4,200 (3)
abstracting: (p38<=0)
states: 243
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
abstracting: (0<=p37)
states: 4,200 (3)
abstracting: (p37<=0)
states: 2,620 (3)
abstracting: (1<=p34)
states: 2,620 (3)
abstracting: (p34<=1)
states: 4,200 (3)
..................
EG iterations: 18
abstracting: (1<=p12)
states: 4
abstracting: (p12<=1)
states: 4,200 (3)
.
EG iterations: 1
abstracting: (0<=p13)
states: 4,200 (3)
abstracting: (p13<=0)
states: 4
.
EG iterations: 1
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
..................
EG iterations: 18
abstracting: (0<=p11)
states: 4,200 (3)
abstracting: (p11<=0)
states: 2,159 (3)
abstracting: (1<=p39)
states: 243
abstracting: (p39<=1)
states: 4,200 (3)
abstracting: (1<=p12)
states: 4
abstracting: (p12<=1)
states: 4,200 (3)
.
EG iterations: 1
abstracting: (0<=p13)
states: 4,200 (3)
abstracting: (p13<=0)
states: 4
.
EG iterations: 1
abstracting: (1<=p32)
states: 672
abstracting: (p32<=1)
states: 4,200 (3)
..................
EG iterations: 18
abstracting: (0<=p11)
states: 4,200 (3)
abstracting: (p11<=0)
states: 2,159 (3)
abstracting: (1<=p39)
states: 243
abstracting: (p39<=1)
states: 4,200 (3)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA EGFr-PT-02010-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

totally nodes used: 169195 (1.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 76802 383985 460787
used/not used/entry size/cache size: 531161 66577703 16 1024MB
basic ops cache: hits/miss/sum: 19248 67102 86350
used/not used/entry size/cache size: 122557 16654659 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: 663 2036 2699
used/not used/entry size/cache size: 2036 8386572 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 66944714
1 159382
2 4506
3 250
4 10
5 1
6 1
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.080sec


BK_STOP 1679018933715

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:998 (14), effective:57 (0)

initing FirstDep: 0m 0.000sec


iterations count:524 (7), effective:38 (0)

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

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

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

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

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

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

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

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

iterations count:132 (1), effective:9 (0)

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

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EGFr-PT-02010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is EGFr-PT-02010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r138-smll-167819421400641"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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