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.r170-tall-167838856600001.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 ERK-PT-000001, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856600001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 8.4K Feb 26 16:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 16:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 16:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:34 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 3.9K 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 2.1K 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 26 16:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 26 16:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 16:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 16:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 7.4K 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 ERK-PT-000001-CTLCardinality-00
FORMULA_NAME ERK-PT-000001-CTLCardinality-01
FORMULA_NAME ERK-PT-000001-CTLCardinality-02
FORMULA_NAME ERK-PT-000001-CTLCardinality-03
FORMULA_NAME ERK-PT-000001-CTLCardinality-04
FORMULA_NAME ERK-PT-000001-CTLCardinality-05
FORMULA_NAME ERK-PT-000001-CTLCardinality-06
FORMULA_NAME ERK-PT-000001-CTLCardinality-07
FORMULA_NAME ERK-PT-000001-CTLCardinality-08
FORMULA_NAME ERK-PT-000001-CTLCardinality-09
FORMULA_NAME ERK-PT-000001-CTLCardinality-10
FORMULA_NAME ERK-PT-000001-CTLCardinality-11
FORMULA_NAME ERK-PT-000001-CTLCardinality-12
FORMULA_NAME ERK-PT-000001-CTLCardinality-13
FORMULA_NAME ERK-PT-000001-CTLCardinality-14
FORMULA_NAME ERK-PT-000001-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678463918745

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=ERK-PT-000001
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 15:58:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 15:58:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 15:58:40] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-10 15:58:40] [INFO ] Transformed 11 places.
[2023-03-10 15:58:40] [INFO ] Transformed 11 transitions.
[2023-03-10 15:58:40] [INFO ] Found NUPN structural information;
[2023-03-10 15:58:40] [INFO ] Parsed PT model containing 11 places and 11 transitions and 34 arcs in 87 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
FORMULA ERK-PT-000001-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 9 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-10 15:58:40] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-10 15:58:40] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-10 15:58:40] [INFO ] Invariant cache hit.
[2023-03-10 15:58:40] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2023-03-10 15:58:40] [INFO ] Invariant cache hit.
[2023-03-10 15:58:40] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 11/11 places, 11/11 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-10 15:58:40] [INFO ] Flatten gal took : 14 ms
[2023-03-10 15:58:40] [INFO ] Flatten gal took : 4 ms
[2023-03-10 15:58:40] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 56) seen :50
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-10 15:58:41] [INFO ] Invariant cache hit.
[2023-03-10 15:58:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-10 15:58:41] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
[2023-03-10 15:58:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 5 ms
FORMULA ERK-PT-000001-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
FORMULA ERK-PT-000001-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 5 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 2 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 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 11 transition count 10
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 9 transition count 10
Applied a total of 3 rules in 4 ms. Remains 9 /11 variables (removed 2) and now considering 10/11 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 9/11 places, 10/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 0 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 6 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 11/11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Input system was already deterministic with 11 transitions.
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Flatten gal took : 1 ms
[2023-03-10 15:58:41] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-10 15:58:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 11 transitions and 34 arcs took 1 ms.
Total runtime 1615 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: 11 NrTr: 11 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 2.779sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 21 (2.1e+01) #states 13



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

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

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: AF [AG [[[p10<=0 & 0<=p10] | [p6<=1 & 1<=p6]]]]
normalized: ~ [EG [E [true U ~ [[[p6<=1 & 1<=p6] | [p10<=0 & 0<=p10]]]]]]

abstracting: (0<=p10)
states: 13
abstracting: (p10<=0)
states: 3
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 13

EG iterations: 0
-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EG [[p3<=0 & 0<=p3]] | EX [[[p4<=0 & 0<=p4] & [p2<=1 & 1<=p2]]]]
normalized: [EX [[[p2<=1 & 1<=p2] & [p4<=0 & 0<=p4]]] | EG [[p3<=0 & 0<=p3]]]

abstracting: (0<=p3)
states: 13
abstracting: (p3<=0)
states: 9
.
EG iterations: 1
abstracting: (0<=p4)
states: 13
abstracting: (p4<=0)
states: 9
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
.-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [[~ [AX [AX [[p3<=1 & 1<=p3]]]] | ~ [EX [[p0<=1 & 1<=p0]]]] U AF [~ [EF [[p5<=0 & 0<=p5]]]]]
normalized: [~ [EG [EG [E [true U [p5<=0 & 0<=p5]]]]] & ~ [E [EG [E [true U [p5<=0 & 0<=p5]]] U [~ [[~ [EX [[p0<=1 & 1<=p0]]] | EX [EX [~ [[p3<=1 & 1<=p3]]]]]] & EG [E [true U [p5<=0 & 0<=p5]]]]]]]

abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12

EG iterations: 0
abstracting: (1<=p3)
states: 4
abstracting: (p3<=1)
states: 13
..abstracting: (1<=p0)
states: 9
abstracting: (p0<=1)
states: 13
.abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12

EG iterations: 0
abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12

EG iterations: 0

EG iterations: 0
-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [EG [E [[p8<=0 & 0<=p8] U E [EG [[p9<=0 & 0<=p9]] U ~ [[[p3<=0 & 0<=p3] | [p2<=1 & 1<=p2]]]]]]]
normalized: EX [EG [E [[p8<=0 & 0<=p8] U E [EG [[p9<=0 & 0<=p9]] U ~ [[[p2<=1 & 1<=p2] | [p3<=0 & 0<=p3]]]]]]]

abstracting: (0<=p3)
states: 13
abstracting: (p3<=0)
states: 9
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
abstracting: (0<=p9)
states: 13
abstracting: (p9<=0)
states: 10
.
EG iterations: 1
abstracting: (0<=p8)
states: 13
abstracting: (p8<=0)
states: 9
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [AG [[EX [[[p8<=0 & 0<=p8] | [p9<=1 & 1<=p9]]] | [[p8<=0 & 0<=p8] & [p9<=1 & 1<=p9]]]]]
normalized: ~ [EX [E [true U ~ [[[[p9<=1 & 1<=p9] & [p8<=0 & 0<=p8]] | EX [[[p9<=1 & 1<=p9] | [p8<=0 & 0<=p8]]]]]]]]

abstracting: (0<=p8)
states: 13
abstracting: (p8<=0)
states: 9
abstracting: (1<=p9)
states: 3
abstracting: (p9<=1)
states: 13
.abstracting: (0<=p8)
states: 13
abstracting: (p8<=0)
states: 9
abstracting: (1<=p9)
states: 3
abstracting: (p9<=1)
states: 13
.-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[[1<=p9 & p9<=1] | [EG [[[p4<=0 & 0<=p4] & [p8<=1 & 1<=p8]]] & [EG [[[p7<=0 & 0<=p7] | [p6<=1 & 1<=p6]]] & [p5<=0 & 0<=p5]]]]]
normalized: ~ [EG [~ [[[[[p5<=0 & 0<=p5] & EG [[[p6<=1 & 1<=p6] | [p7<=0 & 0<=p7]]]] & EG [[[p8<=1 & 1<=p8] & [p4<=0 & 0<=p4]]]] | [1<=p9 & p9<=1]]]]]

abstracting: (p9<=1)
states: 13
abstracting: (1<=p9)
states: 3
abstracting: (0<=p4)
states: 13
abstracting: (p4<=0)
states: 9
abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
.
EG iterations: 1
abstracting: (0<=p7)
states: 13
abstracting: (p7<=0)
states: 4
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 13
..
EG iterations: 2
abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12
.
EG iterations: 1
-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (0<=0)
states: 13
.abstracting: (0<=p7)
states: 13
abstracting: (p7<=0)
states: 4
abstracting: (1<=p0)
states: 9
abstracting: (p0<=1)
states: 13
.abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
abstracting: (0<=p1)
states: 13
abstracting: (p1<=0)
states: 10
abstracting: (1<=p0)
states: 9
abstracting: (p0<=1)
states: 13
abstracting: (0<=p4)
states: 13
abstracting: (p4<=0)
states: 9
abstracting: (1<=p3)
states: 4
abstracting: (p3<=1)
states: 13
.abstracting: (1<=p10)
states: 10
abstracting: (p10<=1)
states: 13
..
EG iterations: 2
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p9)
states: 3
abstracting: (p9<=1)
states: 13
abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 13
abstracting: (1<=p9)
states: 3
abstracting: (p9<=1)
states: 13
abstracting: (1<=p9)
states: 3
abstracting: (p9<=1)
states: 13
.
EG iterations: 1
abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
abstracting: (0<=p7)
states: 13
abstracting: (p7<=0)
states: 4
abstracting: (1<=p0)
states: 9
abstracting: (p0<=1)
states: 13
abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
.
EG iterations: 1
abstracting: (1<=p0)
states: 9
abstracting: (p0<=1)
states: 13
abstracting: (0<=p7)
states: 13
abstracting: (p7<=0)
states: 4
.abstracting: (1<=p9)
states: 3
abstracting: (p9<=1)
states: 13
abstracting: (0<=p6)
states: 13
abstracting: (p6<=0)
states: 10

EG iterations: 0
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [~ [[EG [[p3<=1 & 1<=p3]] | [EG [[[[p6<=1 & 1<=p6] & [p0<=0 & 0<=p0]] | [p3<=1 & 1<=p3]]] | ~ [[[AG [[[p3<=0 & 0<=p3] | [p8<=1 & 1<=p8]]] & [[[p5<=0 & 0<=p5] | [p8<=1 & 1<=p8]] & [p1<=1 & 1<=p1]]] | AF [[p2<=0 & 0<=p2]]]]]]] U [p8<=0 & 0<=p8]]
normalized: E [~ [[[~ [[~ [EG [~ [[p2<=0 & 0<=p2]]]] | [[[p1<=1 & 1<=p1] & [[p8<=1 & 1<=p8] | [p5<=0 & 0<=p5]]] & ~ [E [true U ~ [[[p8<=1 & 1<=p8] | [p3<=0 & 0<=p3]]]]]]]] | EG [[[p3<=1 & 1<=p3] | [[p0<=0 & 0<=p0] & [p6<=1 & 1<=p6]]]]] | EG [[p3<=1 & 1<=p3]]]] U [p8<=0 & 0<=p8]]

abstracting: (0<=p8)
states: 13
abstracting: (p8<=0)
states: 9
abstracting: (1<=p3)
states: 4
abstracting: (p3<=1)
states: 13
.
EG iterations: 1
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 13
abstracting: (0<=p0)
states: 13
abstracting: (p0<=0)
states: 4
abstracting: (1<=p3)
states: 4
abstracting: (p3<=1)
states: 13
.
EG iterations: 1
abstracting: (0<=p3)
states: 13
abstracting: (p3<=0)
states: 9
abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12
abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 13
abstracting: (0<=p2)
states: 13
abstracting: (p2<=0)
states: 10
..
EG iterations: 2
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (0<=p9)
states: 13
abstracting: (p9<=0)
states: 10
abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 13
abstracting: (0<=p0)
states: 13
abstracting: (p0<=0)
states: 4
abstracting: (1<=p3)
states: 4
abstracting: (p3<=1)
states: 13
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 13
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 13

EG iterations: 0
abstracting: (1<=p7)
states: 9
abstracting: (p7<=1)
states: 13
abstracting: (0<=p3)
states: 13
abstracting: (p3<=0)
states: 9
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 13
.abstracting: (0<=p2)
states: 13
abstracting: (p2<=0)
states: 10
abstracting: (1<=p7)
states: 9
abstracting: (p7<=1)
states: 13
abstracting: (1<=p5)
states: 1
abstracting: (p5<=1)
states: 13
...
EG iterations: 2
abstracting: (1<=p0)
states: 9
abstracting: (p0<=1)
states: 13
.-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (0<=p6)
states: 13
abstracting: (p6<=0)
states: 10
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
.abstracting: (1<=p3)
states: 4
abstracting: (p3<=1)
states: 13
abstracting: (0<=p7)
states: 13
abstracting: (p7<=0)
states: 4
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 13
abstracting: (0<=p2)
states: 13
abstracting: (p2<=0)
states: 10
abstracting: (1<=p7)
states: 9
abstracting: (p7<=1)
states: 13
abstracting: (0<=p7)
states: 13
abstracting: (p7<=0)
states: 4
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 13
abstracting: (0<=p7)
states: 13
abstracting: (p7<=0)
states: 4
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 13
.
EG iterations: 1
abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12
..abstracting: (1<=p10)
states: 10
abstracting: (p10<=1)
states: 13
abstracting: (1<=p9)
states: 3
abstracting: (p9<=1)
states: 13
.abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
abstracting: (0<=p1)
states: 13
abstracting: (p1<=0)
states: 10
abstracting: (0<=p10)
states: 13
abstracting: (p10<=0)
states: 3
abstracting: (1<=p7)
states: 9
abstracting: (p7<=1)
states: 13
abstracting: (0<=p0)
states: 13
abstracting: (p0<=0)
states: 4
-> the formula is TRUE

FORMULA ERK-PT-000001-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 13
abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
abstracting: (0<=p10)
states: 13
abstracting: (p10<=0)
states: 3
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
abstracting: (0<=p9)
states: 13
abstracting: (p9<=0)
states: 10
abstracting: (1<=p7)
states: 9
abstracting: (p7<=1)
states: 13
.
EG iterations: 1
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 13
abstracting: (0<=p6)
states: 13
abstracting: (p6<=0)
states: 10
abstracting: (1<=p10)
states: 10
abstracting: (p10<=1)
states: 13
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 13
abstracting: (1<=p6)
states: 3
abstracting: (p6<=1)
states: 13
..
EG iterations: 2
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 13
abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
abstracting: (0<=p10)
states: 13
abstracting: (p10<=0)
states: 3
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
abstracting: (0<=p9)
states: 13
abstracting: (p9<=0)
states: 10
abstracting: (1<=p7)
states: 9
abstracting: (p7<=1)
states: 13
.
EG iterations: 1
abstracting: (1<=p1)
states: 3
abstracting: (p1<=1)
states: 13
abstracting: (1<=p8)
states: 4
abstracting: (p8<=1)
states: 13
abstracting: (0<=p5)
states: 13
abstracting: (p5<=0)
states: 12
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
abstracting: (0<=p10)
states: 13
abstracting: (p10<=0)
states: 3
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
abstracting: (0<=p9)
states: 13
abstracting: (p9<=0)
states: 10
abstracting: (1<=p7)
states: 9
abstracting: (p7<=1)
states: 13
.
EG iterations: 1
..
EG iterations: 2
abstracting: (0<=p8)
states: 13
abstracting: (p8<=0)
states: 9
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 13
abstracting: (0<=p2)
states: 13
abstracting: (p2<=0)
states: 10
abstracting: (0<=p8)
states: 13
abstracting: (p8<=0)
states: 9
abstracting: (1<=p2)
states: 3
abstracting: (p2<=1)
states: 13
abstracting: (0<=p8)
states: 13
abstracting: (p8<=0)
states: 9
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 13
abstracting: (0<=p2)
states: 13
abstracting: (p2<=0)
states: 10
abstracting: (0<=p8)
states: 13
abstracting: (p8<=0)
states: 9
abstracting: (1<=p4)
states: 4
abstracting: (p4<=1)
states: 13
abstracting: (0<=p2)
states: 13
abstracting: (p2<=0)
states: 10
..
EG iterations: 2
-> the formula is FALSE

FORMULA ERK-PT-000001-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 619 (6.2e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1394 2908 4302
used/not used/entry size/cache size: 3479 67105385 16 1024MB
basic ops cache: hits/miss/sum: 835 1318 2153
used/not used/entry size/cache size: 2259 16774957 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: 300 143 443
used/not used/entry size/cache size: 143 8388465 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 67108257
1 595
2 12
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.393sec


BK_STOP 1678463928057

--------------------
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:35 (3), effective:8 (0)

initing FirstDep: 0m 0.000sec


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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:11 (1), effective:0 (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="ERK-PT-000001"
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 ERK-PT-000001, 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 r170-tall-167838856600001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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