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.r330-tall-167889203400554.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 RefineWMG-PT-005006, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400554
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 6.2K Feb 26 16:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 16:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 15:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 15:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 16:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-00
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-01
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-02
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-03
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-04
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-05
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-06
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-07
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-08
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-09
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-10
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-11
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-12
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-13
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-14
FORMULA_NAME RefineWMG-PT-005006-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679169975595

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=RefineWMG-PT-005006
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:06:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 20:06:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:06:17] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-18 20:06:17] [INFO ] Transformed 29 places.
[2023-03-18 20:06:17] [INFO ] Transformed 23 transitions.
[2023-03-18 20:06:17] [INFO ] Parsed PT model containing 29 places and 23 transitions and 68 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-005006-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005006-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005006-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 10 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:06:17] [INFO ] Computed 12 place invariants in 10 ms
[2023-03-18 20:06:17] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
[2023-03-18 20:06:17] [INFO ] Invariant cache hit.
[2023-03-18 20:06:17] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-18 20:06:17] [INFO ] Invariant cache hit.
[2023-03-18 20:06:17] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-18 20:06:17] [INFO ] Invariant cache hit.
[2023-03-18 20:06:17] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 29/29 places, 23/23 transitions.
Support contains 29 out of 29 places after structural reductions.
[2023-03-18 20:06:17] [INFO ] Flatten gal took : 16 ms
[2023-03-18 20:06:17] [INFO ] Flatten gal took : 5 ms
[2023-03-18 20:06:17] [INFO ] Input system was already deterministic with 23 transitions.
Finished random walk after 9626 steps, including 2 resets, run visited all 33 properties in 106 ms. (steps per millisecond=90 )
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 49 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 9 edges and 29 vertex of which 6 / 29 are part of one of the 3 SCC in 3 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 9 rules applied. Total rules applied 12 place count 17 transition count 15
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 14 place count 17 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 16 place count 15 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 14 transition count 12
Applied a total of 18 rules in 11 ms. Remains 14 /29 variables (removed 15) and now considering 12/23 (removed 11) transitions.
// Phase 1: matrix 12 rows 14 cols
[2023-03-18 20:06:18] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 14/29 places, 12/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2023-03-18 20:06:18] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
[2023-03-18 20:06:18] [INFO ] Invariant cache hit.
[2023-03-18 20:06:18] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 29/29 places, 23/23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 1 ms
[2023-03-18 20:06:18] [INFO ] Input system was already deterministic with 23 transitions.
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 3 ms
[2023-03-18 20:06:18] [INFO ] Flatten gal took : 2 ms
[2023-03-18 20:06:18] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-18 20:06:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 29 places, 23 transitions and 68 arcs took 1 ms.
Total runtime 1587 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: 29 NrTr: 23 NrArc: 68)

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

net check time: 0m 0.000sec

init dd package: 0m 2.790sec


RS generation: 0m 0.020sec


-> reachability set: #nodes 584 (5.8e+02) #states 2,908,365,163,704 (12)



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

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

abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
.-> the formula is TRUE

FORMULA RefineWMG-PT-005006-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [1<=p20]
normalized: EX [1<=p20]

abstracting: (1<=p20)
states: 2,492,884,426,032 (12)
.-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (p7<=0)
states: 415,480,737,672 (11)
abstracting: (1<=p25)
states: 2,492,884,426,032 (12)
.-> the formula is TRUE

FORMULA RefineWMG-PT-005006-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: [AF [[EF [AX [p5<=0]] & 1<=p28]] | EX [AG [EF [EX [1<=p17]]]]]
normalized: [EX [~ [E [true U ~ [E [true U EX [1<=p17]]]]]] | ~ [EG [~ [[1<=p28 & E [true U ~ [EX [~ [p5<=0]]]]]]]]]

abstracting: (p5<=0)
states: 415,480,737,672 (11)
.abstracting: (1<=p28)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
..-> the formula is TRUE

FORMULA RefineWMG-PT-005006-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EG [~ [E [EX [[E [1<=p17 U 1<=p5] | EX [1<=p12]]] U AG [[2<=p1 & 2<=p2]]]]]
normalized: EG [~ [E [EX [[EX [1<=p12] | E [1<=p17 U 1<=p5]]] U ~ [E [true U ~ [[2<=p1 & 2<=p2]]]]]]]

abstracting: (2<=p2)
states: 1,938,910,109,136 (12)
abstracting: (2<=p1)
states: 783,021,390,228 (11)
abstracting: (1<=p5)
states: 2,492,884,426,032 (12)
abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
..
EG iterations: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-005006-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

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

abstracting: (1<=p18)
states: 2,492,884,426,032 (12)
abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
.abstracting: (1<=p9)
states: 1,566,042,780,456 (12)
abstracting: (1<=p7)
states: 2,492,884,426,032 (12)
abstracting: (1<=p6)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p7)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p18)
states: 2,492,884,426,032 (12)
abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
.abstracting: (1<=p18)
states: 2,492,884,426,032 (12)
abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
.
EG iterations: 0
-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[EG [[[1<=p21 & [1<=p22 & 1<=p24]] | 1<=p25]] | [AG [AX [1<=p13]] | [p28<=0 & AX [1<=p20]]]]]
normalized: E [true U [[[p28<=0 & ~ [EX [~ [1<=p20]]]] | ~ [E [true U EX [~ [1<=p13]]]]] | EG [[1<=p25 | [1<=p21 & [1<=p22 & 1<=p24]]]]]]

abstracting: (1<=p24)
states: 1,566,042,780,456 (12)
abstracting: (1<=p22)
states: 2,492,884,426,032 (12)
abstracting: (1<=p21)
states: 2,492,884,426,032 (12)
abstracting: (1<=p25)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p13)
states: 2,492,884,426,032 (12)
.abstracting: (1<=p20)
states: 2,492,884,426,032 (12)
.abstracting: (p28<=0)
states: 415,480,737,672 (11)
-> the formula is TRUE

FORMULA RefineWMG-PT-005006-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EX [AX [~ [A [A [3<=p3 U [1<=p11 & [1<=p12 & 1<=p14]]] U AX [[1<=p0 & [1<=p26 & 1<=p27]]]]]]]
normalized: EX [~ [EX [[~ [EG [EX [~ [[1<=p0 & [1<=p26 & 1<=p27]]]]]] & ~ [E [EX [~ [[1<=p0 & [1<=p26 & 1<=p27]]]] U [~ [[~ [EG [~ [[1<=p11 & [1<=p12 & 1<=p14]]]]] & ~ [E [~ [[1<=p11 & [1<=p12 & 1<=p14]]] U [~ [3<=p3] & ~ [[1<=p11 & [1<=p12 & 1<=p14]]]]]]]] & EX [~ [[1<=p0 & [1<=p26 & 1<=p27]]]]]]]]]]]

abstracting: (1<=p27)
states: 2,492,884,426,032 (12)
abstracting: (1<=p26)
states: 2,492,884,426,032 (12)
abstracting: (1<=p0)
states: 1,566,042,780,456 (12)
.abstracting: (1<=p14)
states: 1,566,042,780,456 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
abstracting: (1<=p11)
states: 2,492,884,426,032 (12)
abstracting: (3<=p3)
states: 1,454,182,581,852 (12)
abstracting: (1<=p14)
states: 1,566,042,780,456 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
abstracting: (1<=p11)
states: 2,492,884,426,032 (12)
abstracting: (1<=p14)
states: 1,566,042,780,456 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
abstracting: (1<=p11)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p27)
states: 2,492,884,426,032 (12)
abstracting: (1<=p26)
states: 2,492,884,426,032 (12)
abstracting: (1<=p0)
states: 1,566,042,780,456 (12)
.abstracting: (1<=p27)
states: 2,492,884,426,032 (12)
abstracting: (1<=p26)
states: 2,492,884,426,032 (12)
abstracting: (1<=p0)
states: 1,566,042,780,456 (12)
..
EG iterations: 1
..-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EX [[AX [EF [AX [3<=p3]]] & EF [[AF [[p6<=0 | [p7<=0 | p9<=0]]] | [EG [p4<=4] | EX [[[2<=p1 & 2<=p2] | 1<=p20]]]]]]]
normalized: EX [[E [true U [[EX [[1<=p20 | [2<=p1 & 2<=p2]]] | EG [p4<=4]] | ~ [EG [~ [[p6<=0 | [p7<=0 | p9<=0]]]]]]] & ~ [EX [~ [E [true U ~ [EX [~ [3<=p3]]]]]]]]]

abstracting: (3<=p3)
states: 1,454,182,581,852 (12)
..abstracting: (p9<=0)
states: 1,342,322,383,248 (12)
abstracting: (p7<=0)
states: 415,480,737,672 (11)
abstracting: (p6<=0)
states: 415,480,737,672 (11)
.
EG iterations: 1
abstracting: (p4<=4)
states: 2,860,909,321,872 (12)
.
EG iterations: 1
abstracting: (2<=p2)
states: 1,938,910,109,136 (12)
abstracting: (2<=p1)
states: 783,021,390,228 (11)
abstracting: (1<=p20)
states: 2,492,884,426,032 (12)
..-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: EF [AG [[AG [[[p6<=0 | [p7<=0 | p9<=0]] & p8<=0]] | [p13<=0 & [[p3<=2 | p10<=0] & [p1<=1 | [p2<=1 | p3<=2]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[p13<=0 & [[p1<=1 | [p2<=1 | p3<=2]] & [p3<=2 | p10<=0]]] | ~ [E [true U ~ [[p8<=0 & [p6<=0 | [p7<=0 | p9<=0]]]]]]]]]]]

abstracting: (p9<=0)
states: 1,342,322,383,248 (12)
abstracting: (p7<=0)
states: 415,480,737,672 (11)
abstracting: (p6<=0)
states: 415,480,737,672 (11)
abstracting: (p8<=0)
states: 415,480,737,672 (11)
abstracting: (p10<=0)
states: 415,480,737,672 (11)
abstracting: (p3<=2)
states: 1,454,182,581,852 (12)
abstracting: (p3<=2)
states: 1,454,182,581,852 (12)
abstracting: (p2<=1)
states: 969,455,054,568 (11)
abstracting: (p1<=1)
states: 2,125,343,773,476 (12)
abstracting: (p13<=0)
states: 415,480,737,672 (11)
-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: E [[1<=p5 | ~ [[1<=p13 | [A [AF [1<=p12] U [1<=p13 & 1<=p15]] | AF [[[1<=p11 & [1<=p12 & 1<=p14]] | 1<=p5]]]]]] U AF [AX [[AX [1<=p20] & [1<=p28 | 1<=p18]]]]]
normalized: E [[1<=p5 | ~ [[1<=p13 | [~ [EG [~ [[1<=p5 | [1<=p11 & [1<=p12 & 1<=p14]]]]]] | [~ [EG [~ [[1<=p13 & 1<=p15]]]] & ~ [E [~ [[1<=p13 & 1<=p15]] U [EG [~ [1<=p12]] & ~ [[1<=p13 & 1<=p15]]]]]]]]]] U ~ [EG [EX [~ [[[1<=p28 | 1<=p18] & ~ [EX [~ [1<=p20]]]]]]]]]

abstracting: (1<=p20)
states: 2,492,884,426,032 (12)
.abstracting: (1<=p18)
states: 2,492,884,426,032 (12)
abstracting: (1<=p28)
states: 2,492,884,426,032 (12)
..
EG iterations: 1
abstracting: (1<=p15)
states: 2,492,884,426,032 (12)
abstracting: (1<=p13)
states: 2,492,884,426,032 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p15)
states: 2,492,884,426,032 (12)
abstracting: (1<=p13)
states: 2,492,884,426,032 (12)
abstracting: (1<=p15)
states: 2,492,884,426,032 (12)
abstracting: (1<=p13)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p14)
states: 1,566,042,780,456 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
abstracting: (1<=p11)
states: 2,492,884,426,032 (12)
abstracting: (1<=p5)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p13)
states: 2,492,884,426,032 (12)
abstracting: (1<=p5)
states: 2,492,884,426,032 (12)
-> the formula is TRUE

FORMULA RefineWMG-PT-005006-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.101sec

checking: EG [[[E [[1<=p17 | [AX [1<=p10] | [[[1<=p16 & [1<=p17 & 1<=p19]] | [1<=p15 & 1<=p27]] & [AF [[2<=p1 & 2<=p2]] | [1<=p10 | 1<=p8]]]]] U [[[1<=p8 & 1<=p12] | EX [1<=p23]] | [~ [E [[1<=p16 & [1<=p17 & 1<=p19]] U 1<=p20]] | [[AF [[1<=p6 & [1<=p7 & 1<=p9]]] & AX [5<=p4]] | EG [1<=p23]]]]] | p22<=0] | [EF [[1<=p6 & [1<=p7 & 1<=p9]]] | 1<=p27]]]
normalized: EG [[[1<=p27 | E [true U [1<=p6 & [1<=p7 & 1<=p9]]]] | [p22<=0 | E [[1<=p17 | [[[[1<=p10 | 1<=p8] | ~ [EG [~ [[2<=p1 & 2<=p2]]]]] & [[1<=p15 & 1<=p27] | [1<=p16 & [1<=p17 & 1<=p19]]]] | ~ [EX [~ [1<=p10]]]]] U [[[EG [1<=p23] | [~ [EX [~ [5<=p4]]] & ~ [EG [~ [[1<=p6 & [1<=p7 & 1<=p9]]]]]]] | ~ [E [[1<=p16 & [1<=p17 & 1<=p19]] U 1<=p20]]] | [EX [1<=p23] | [1<=p8 & 1<=p12]]]]]]]

abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
abstracting: (1<=p8)
states: 2,492,884,426,032 (12)
abstracting: (1<=p23)
states: 2,492,884,426,032 (12)
.abstracting: (1<=p20)
states: 2,492,884,426,032 (12)
abstracting: (1<=p19)
states: 1,566,042,780,456 (12)
abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
abstracting: (1<=p16)
states: 2,492,884,426,032 (12)
abstracting: (1<=p9)
states: 1,566,042,780,456 (12)
abstracting: (1<=p7)
states: 2,492,884,426,032 (12)
abstracting: (1<=p6)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (5<=p4)
states: 47,455,841,832 (10)
.abstracting: (1<=p23)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p10)
states: 2,492,884,426,032 (12)
.abstracting: (1<=p19)
states: 1,566,042,780,456 (12)
abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
abstracting: (1<=p16)
states: 2,492,884,426,032 (12)
abstracting: (1<=p27)
states: 2,492,884,426,032 (12)
abstracting: (1<=p15)
states: 2,492,884,426,032 (12)
abstracting: (2<=p2)
states: 1,938,910,109,136 (12)
abstracting: (2<=p1)
states: 783,021,390,228 (11)
.
EG iterations: 1
abstracting: (1<=p8)
states: 2,492,884,426,032 (12)
abstracting: (1<=p10)
states: 2,492,884,426,032 (12)
abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
abstracting: (p22<=0)
states: 415,480,737,672 (11)
abstracting: (1<=p9)
states: 1,566,042,780,456 (12)
abstracting: (1<=p7)
states: 2,492,884,426,032 (12)
abstracting: (1<=p6)
states: 2,492,884,426,032 (12)
abstracting: (1<=p27)
states: 2,492,884,426,032 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-005006-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: [EX [1<=p10] | [[E [1<=p10 U 1<=p15] & E [1<=p18 U EF [[[1<=p16 & 1<=p17] & [1<=p19 & 1<=p5]]]]] & [EX [[AG [1<=p18] & [EG [1<=p15] | [A [1<=p12 U 1<=p12] & EG [1<=p8]]]]] & E [AX [E [AF [[1<=p0 & [1<=p26 & 1<=p27]]] U 1<=p28]] U [EX [1<=p17] & [[[1<=p12 | [1<=p6 & [1<=p7 & 1<=p9]]] | [1<=p15 | [1<=p23 | ~ [[[1<=p0 & [1<=p26 & 1<=p27]] | 1<=p10]]]]] & EF [p10<=0]]]]]]]
normalized: [[[E [~ [EX [~ [E [~ [EG [~ [[1<=p0 & [1<=p26 & 1<=p27]]]]] U 1<=p28]]]] U [[E [true U p10<=0] & [[1<=p15 | [1<=p23 | ~ [[1<=p10 | [1<=p0 & [1<=p26 & 1<=p27]]]]]] | [1<=p12 | [1<=p6 & [1<=p7 & 1<=p9]]]]] & EX [1<=p17]]] & EX [[[[EG [1<=p8] & [~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [1<=p12] & ~ [1<=p12]]]]]] | EG [1<=p15]] & ~ [E [true U ~ [1<=p18]]]]]] & [E [1<=p18 U E [true U [[1<=p19 & 1<=p5] & [1<=p16 & 1<=p17]]]] & E [1<=p10 U 1<=p15]]] | EX [1<=p10]]

abstracting: (1<=p10)
states: 2,492,884,426,032 (12)
.abstracting: (1<=p15)
states: 2,492,884,426,032 (12)
abstracting: (1<=p10)
states: 2,492,884,426,032 (12)
abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
abstracting: (1<=p16)
states: 2,492,884,426,032 (12)
abstracting: (1<=p5)
states: 2,492,884,426,032 (12)
abstracting: (1<=p19)
states: 1,566,042,780,456 (12)
abstracting: (1<=p18)
states: 2,492,884,426,032 (12)
abstracting: (1<=p18)
states: 2,492,884,426,032 (12)
abstracting: (1<=p15)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
abstracting: (1<=p8)
states: 2,492,884,426,032 (12)
.
EG iterations: 1
.abstracting: (1<=p17)
states: 2,492,884,426,032 (12)
.abstracting: (1<=p9)
states: 1,566,042,780,456 (12)
abstracting: (1<=p7)
states: 2,492,884,426,032 (12)
abstracting: (1<=p6)
states: 2,492,884,426,032 (12)
abstracting: (1<=p12)
states: 2,492,884,426,032 (12)
abstracting: (1<=p27)
states: 2,492,884,426,032 (12)
abstracting: (1<=p26)
states: 2,492,884,426,032 (12)
abstracting: (1<=p0)
states: 1,566,042,780,456 (12)
abstracting: (1<=p10)
states: 2,492,884,426,032 (12)
abstracting: (1<=p23)
states: 2,492,884,426,032 (12)
abstracting: (1<=p15)
states: 2,492,884,426,032 (12)
abstracting: (p10<=0)
states: 415,480,737,672 (11)
abstracting: (1<=p28)
states: 2,492,884,426,032 (12)
abstracting: (1<=p27)
states: 2,492,884,426,032 (12)
abstracting: (1<=p26)
states: 2,492,884,426,032 (12)
abstracting: (1<=p0)
states: 1,566,042,780,456 (12)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA RefineWMG-PT-005006-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.044sec

totally nodes used: 216022 (2.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 642161 600425 1242586
used/not used/entry size/cache size: 772676 66336188 16 1024MB
basic ops cache: hits/miss/sum: 221980 216029 438009
used/not used/entry size/cache size: 431547 16345669 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: 12717 12732 25449
used/not used/entry size/cache size: 12731 8375877 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 66900083
1 206628
2 1614
3 237
4 67
5 20
6 40
7 28
8 6
9 24
>= 10 117

Total processing time: 0m 4.733sec


BK_STOP 1679169984599

--------------------
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:1830 (79), effective:681 (29)

initing FirstDep: 0m 0.000sec


iterations count:214 (9), effective:73 (3)

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

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

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

iterations count:82 (3), effective:17 (0)

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

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

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

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

iterations count:33 (1), effective:5 (0)

iterations count:163 (7), effective:58 (2)

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

iterations count:41 (1), effective:6 (0)

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

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

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

iterations count:71 (3), effective:24 (1)

iterations count:532 (23), effective:193 (8)

iterations count:162 (7), effective:53 (2)

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

iterations count:79 (3), effective:17 (0)

iterations count:130 (5), effective:41 (1)

iterations count:162 (7), effective:55 (2)

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

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

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

iterations count:29 (1), effective:6 (0)

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

iterations count:33 (1), effective:9 (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="RefineWMG-PT-005006"
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 RefineWMG-PT-005006, 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 r330-tall-167889203400554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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