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.r522-tall-167987247400450.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 PGCD-PT-D02N100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247400450
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Mar 23 15:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 23 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 15K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Mar 23 15:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 5.6K Mar 31 16:48 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 PGCD-PT-D02N100-CTLFireability-00
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-01
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-02
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-03
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-04
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-05
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-06
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-07
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-08
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-09
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-10
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-11
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-12
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-13
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-14
FORMULA_NAME PGCD-PT-D02N100-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680818241769

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=PGCD-PT-D02N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 21:57:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 21:57:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:57:23] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-04-06 21:57:23] [INFO ] Transformed 9 places.
[2023-04-06 21:57:23] [INFO ] Transformed 9 transitions.
[2023-04-06 21:57:23] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Initial state reduction rules removed 3 formulas.
FORMULA PGCD-PT-D02N100-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N100-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N100-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-06 21:57:23] [INFO ] Computed 4 invariants in 8 ms
[2023-04-06 21:57:23] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
[2023-04-06 21:57:23] [INFO ] Invariant cache hit.
[2023-04-06 21:57:23] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-04-06 21:57:23] [INFO ] Invariant cache hit.
[2023-04-06 21:57:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 21:57:23] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-04-06 21:57:23] [INFO ] Invariant cache hit.
[2023-04-06 21:57:23] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 13 ms
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 4 ms
[2023-04-06 21:57:23] [INFO ] Input system was already deterministic with 9 transitions.
Incomplete random walk after 10096 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=438 ) properties (out of 19) seen :18
Finished Best-First random walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:57:23] [INFO ] Input system was already deterministic with 9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:23] [INFO ] Invariant cache hit.
[2023-04-06 21:57:23] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:23] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:23] [INFO ] Invariant cache hit.
[2023-04-06 21:57:23] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:23] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:23] [INFO ] Invariant cache hit.
[2023-04-06 21:57:23] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:57:23] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:23] [INFO ] Invariant cache hit.
[2023-04-06 21:57:23] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:23] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:23] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:23] [INFO ] Invariant cache hit.
[2023-04-06 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:24] [INFO ] Invariant cache hit.
[2023-04-06 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:24] [INFO ] Invariant cache hit.
[2023-04-06 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:24] [INFO ] Invariant cache hit.
[2023-04-06 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 0 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:24] [INFO ] Invariant cache hit.
[2023-04-06 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 0 ms
[2023-04-06 21:57:24] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:24] [INFO ] Invariant cache hit.
[2023-04-06 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:24] [INFO ] Invariant cache hit.
[2023-04-06 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:24] [INFO ] Invariant cache hit.
[2023-04-06 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:57:24] [INFO ] Invariant cache hit.
[2023-04-06 21:57:24] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Input system was already deterministic with 9 transitions.
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:57:24] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-06 21:57:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 1 ms.
Total runtime 1082 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: 9 NrTr: 9 NrArc: 42)

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

net check time: 0m 0.000sec

init dd package: 0m 2.729sec


RS generation: 0m11.399sec


-> reachability set: #nodes 49631 (5.0e+04) #states 5,588,167,526 (9)



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

checking: E [~ [[1<=p1 & 1<=p4]] U ~ [EF [AG [[3<=p1 & 1<=p7]]]]]
normalized: E [~ [[1<=p1 & 1<=p4]] U ~ [E [true U ~ [E [true U ~ [[3<=p1 & 1<=p7]]]]]]]

abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
-> the formula is TRUE

FORMULA PGCD-PT-D02N100-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.823sec

checking: EF [AG [~ [A [EX [[1<=p2 & [1<=p5 & 1<=p8]]] U ~ [[3<=p0 & 1<=p6]]]]]]
normalized: E [true U ~ [E [true U [~ [EG [[3<=p0 & 1<=p6]]] & ~ [E [[3<=p0 & 1<=p6] U [~ [EX [[1<=p2 & [1<=p5 & 1<=p8]]]] & [3<=p0 & 1<=p6]]]]]]]]

abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D02N100-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m30.525sec

checking: EX [EF [[EF [[p1<=0 | [p4<=0 | p7<=0]]] | AF [[p2<=2 | p8<=0]]]]]
normalized: EX [E [true U [~ [EG [~ [[p2<=2 | p8<=0]]]] | E [true U [p1<=0 | [p4<=0 | p7<=0]]]]]]

abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p2<=2)
states: 268,008,838 (8)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA PGCD-PT-D02N100-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.205sec

checking: AX [[AX [[1<=p2 & [1<=p5 & 1<=p8]]] | AF [[3<=p2 & 1<=p8]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[3<=p2 & 1<=p8]]]] | ~ [EX [~ [[1<=p2 & [1<=p5 & 1<=p8]]]]]]]]]

abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA PGCD-PT-D02N100-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.179sec

checking: EF [[AG [[[3<=p0 & 1<=p6] | [p0<=0 | p3<=0]]] & AF [[1<=p1 & 1<=p4]]]]
normalized: E [true U [~ [EG [~ [[1<=p1 & 1<=p4]]]] & ~ [E [true U ~ [[[p0<=0 | p3<=0] | [3<=p0 & 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
..
EG iterations: 2
-> the formula is FALSE

FORMULA PGCD-PT-D02N100-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.451sec

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

abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
.
EG iterations: 1
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA PGCD-PT-D02N100-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.143sec

checking: A [~ [[[3<=p2 & 1<=p8] & [3<=p1 & 1<=p7]]] U EF [[EX [[3<=p1 & 1<=p7]] & EX [[1<=p2 & [1<=p5 & 1<=p8]]]]]]
normalized: [~ [EG [~ [E [true U [EX [[1<=p2 & [1<=p5 & 1<=p8]]] & EX [[3<=p1 & 1<=p7]]]]]]] & ~ [E [~ [E [true U [EX [[1<=p2 & [1<=p5 & 1<=p8]]] & EX [[3<=p1 & 1<=p7]]]]] U [[[3<=p1 & 1<=p7] & [3<=p2 & 1<=p8]] & ~ [E [true U [EX [[1<=p2 & [1<=p5 & 1<=p8]]] & EX [[3<=p1 & 1<=p7]]]]]]]]]

abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
.abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
.abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
.abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
..
EG iterations: 1
-> the formula is TRUE

FORMULA PGCD-PT-D02N100-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.778sec

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

abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
.abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
.abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
..
EG iterations: 2
.-> the formula is TRUE

FORMULA PGCD-PT-D02N100-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.201sec

checking: AF [AG [[EF [[[[1<=p1 & 1<=p4] & [3<=p2 & 1<=p8]] | EF [[3<=p2 & 1<=p8]]]] | EX [[[AX [[1<=p1 & 1<=p4]] & 1<=p1] & [1<=p4 & 1<=p7]]]]]]
normalized: ~ [EG [E [true U ~ [[EX [[[1<=p4 & 1<=p7] & [1<=p1 & ~ [EX [~ [[1<=p1 & 1<=p4]]]]]]] | E [true U [E [true U [3<=p2 & 1<=p8]] | [[3<=p2 & 1<=p8] & [1<=p1 & 1<=p4]]]]]]]]]

abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
.abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
..
EG iterations: 1
-> the formula is TRUE

FORMULA PGCD-PT-D02N100-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.422sec

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

abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
.-> the formula is TRUE

FORMULA PGCD-PT-D02N100-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.939sec

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

abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p1<=2)
states: 268,008,838 (8)
.abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
..
EG iterations: 2
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.
EG iterations: 1
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
.-> the formula is FALSE

FORMULA PGCD-PT-D02N100-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.391sec

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

abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
..
EG iterations: 2
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
.
EG iterations: 1
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)

EG iterations: 0
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
.
EG iterations: 1
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)

EG iterations: 0
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
.
EG iterations: 1
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)

EG iterations: 0
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-PT-D02N100-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.370sec

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

abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (p7<=0)
states: 90,097,171 (7)

EG iterations: 0
-> the formula is TRUE

FORMULA PGCD-PT-D02N100-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.938sec

totally nodes used: 11454128 (1.1e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 270802028 27546054 298348082
used/not used/entry size/cache size: 29221592 37887272 16 1024MB
basic ops cache: hits/miss/sum: 96733466 12438289 109171755
used/not used/entry size/cache size: 10005862 6771354 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: 1372080 206612 1578692
used/not used/entry size/cache size: 203150 8185458 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 57802121
1 7433393
2 1677124
3 169376
4 22467
5 2518
6 296
7 286
8 399
9 238
>= 10 646

Total processing time: 1m52.118sec


BK_STOP 1680818357528

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:9204 (1022), effective:3130 (347)

initing FirstDep: 0m 0.000sec


iterations count:1354 (150), effective:299 (33)

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

iterations count:1648 (183), effective:447 (49)

iterations count:607 (67), effective:299 (33)

iterations count:759 (84), effective:150 (16)

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

iterations count:622 (69), effective:303 (33)

iterations count:41 (4), effective:9 (1)

iterations count:41 (4), effective:9 (1)

iterations count:41 (4), effective:9 (1)

iterations count:607 (67), effective:299 (33)

iterations count:92 (10), effective:26 (2)

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

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

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

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

iterations count:771 (85), effective:154 (17)

iterations count:84 (9), effective:22 (2)

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

iterations count:607 (67), effective:299 (33)

iterations count:96 (10), effective:27 (3)

iterations count:459 (51), effective:150 (16)

iterations count:459 (51), effective:150 (16)

iterations count:459 (51), effective:150 (16)

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

iterations count:459 (51), effective:150 (16)

iterations count:459 (51), effective:150 (16)

iterations count:459 (51), effective:150 (16)

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

iterations count:459 (51), effective:150 (16)

iterations count:459 (51), effective:150 (16)

iterations count:459 (51), effective:150 (16)

iterations count:459 (51), effective:150 (16)

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

iterations count:459 (51), effective:150 (16)

iterations count:27 (3), effective:5 (0)

iterations count:30 (3), effective:6 (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="PGCD-PT-D02N100"
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 PGCD-PT-D02N100, 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 r522-tall-167987247400450"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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