About the Execution of Marcie+red for PGCD-PT-D02N005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.823 | 8082.00 | 10759.00 | 314.80 | FFTFTFFFFFTFFTFF | normal |
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-167987247400434.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-D02N005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247400434
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.2K Mar 23 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 23 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 23 15:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 23 15:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K 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 19K Mar 23 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 220K Mar 23 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 23 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Mar 23 15:26 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-D02N005-CTLFireability-00
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-01
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-02
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-03
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-04
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-05
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-06
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-07
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-08
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-09
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-10
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-11
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-12
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-13
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-14
FORMULA_NAME PGCD-PT-D02N005-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680818087701
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-D02N005
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 21:54:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 21:54:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:54:49] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2023-04-06 21:54:49] [INFO ] Transformed 9 places.
[2023-04-06 21:54:49] [INFO ] Transformed 9 transitions.
[2023-04-06 21:54:49] [INFO ] Parsed PT model containing 9 places and 9 transitions and 42 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PGCD-PT-D02N005-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N005-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N005-CTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-PT-D02N005-CTLFireability-13 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 7 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:54:49] [INFO ] Computed 4 invariants in 6 ms
[2023-04-06 21:54:49] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
[2023-04-06 21:54:49] [INFO ] Invariant cache hit.
[2023-04-06 21:54:49] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-06 21:54:49] [INFO ] Invariant cache hit.
[2023-04-06 21:54:49] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 21:54:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-04-06 21:54:49] [INFO ] Invariant cache hit.
[2023-04-06 21:54:49] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-06 21:54:49] [INFO ] Flatten gal took : 13 ms
[2023-04-06 21:54:49] [INFO ] Flatten gal took : 4 ms
[2023-04-06 21:54:49] [INFO ] Input system was already deterministic with 9 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 35) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-06 21:54:49] [INFO ] Invariant cache hit.
[2023-04-06 21:54:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-06 21:54:49] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 21:54:49] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-04-06 21:54:49] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:54:49] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:54:49] [INFO ] Input system was already deterministic with 9 transitions.
Computed a total of 0 stabilizing places and 0 stable 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:54:49] [INFO ] Invariant cache hit.
[2023-04-06 21:54:49] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:49] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:54:49] [INFO ] Flatten gal took : 3 ms
[2023-04-06 21:54:49] [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:54:49] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [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:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [INFO ] Dead Transitions using invariants and state equation in 20 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:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [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:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [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:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [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:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [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:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [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:54:50] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:54:50] [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:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [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:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [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:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [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:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [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:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 0 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 0 ms
[2023-04-06 21:54:50] [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 4 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 21:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [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:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [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:54:50] [INFO ] Invariant cache hit.
[2023-04-06 21:54:50] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Input system was already deterministic with 9 transitions.
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 1 ms
[2023-04-06 21:54:50] [INFO ] Flatten gal took : 2 ms
[2023-04-06 21:54:50] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-04-06 21:54:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 0 ms.
Total runtime 1286 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.688sec
RS generation: 0m 0.004sec
-> reachability set: #nodes 377 (3.8e+02) #states 8,484 (3)
starting MCC model checker
--------------------------
checking: EG [[1<=p1 & 1<=p4]]
normalized: EG [[1<=p1 & 1<=p4]]
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
..
EG iterations: 2
-> the formula is TRUE
FORMULA PGCD-PT-D02N005-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[p2<=0 | [p5<=0 | [[AX [[3<=p1 & 1<=p7]] & 1<=p1] & [1<=p4 & 1<=p7]]]]]
normalized: ~ [E [true U ~ [[[[[1<=p4 & 1<=p7] & [~ [EX [~ [[3<=p1 & 1<=p7]]]] & 1<=p1]] | p5<=0] | p2<=0]]]]
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
.abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
-> the formula is FALSE
FORMULA PGCD-PT-D02N005-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [AX [[1<=p0 & 1<=p3]] & E [[1<=p0 & 1<=p3] U ~ [[1<=p2 & [1<=p5 & 1<=p8]]]]]
normalized: [E [[1<=p0 & 1<=p3] U ~ [[[1<=p5 & 1<=p8] & 1<=p2]]] & ~ [EX [~ [[1<=p0 & 1<=p3]]]]]
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
.abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
-> the formula is FALSE
FORMULA PGCD-PT-D02N005-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EG [E [[~ [[3<=p2 & 1<=p8]] | [1<=p0 & [1<=p3 & [EX [[1<=p1 & 1<=p4]] | ~ [[1<=p2 & [1<=p5 & 1<=p8]]]]]]] U AX [EX [AG [[1<=p0 & [1<=p3 & 1<=p6]]]]]]]
normalized: EG [E [[[[[~ [[[1<=p5 & 1<=p8] & 1<=p2]] | EX [[1<=p1 & 1<=p4]]] & 1<=p3] & 1<=p0] | ~ [[3<=p2 & 1<=p8]]] U ~ [EX [~ [EX [~ [E [true U ~ [[[1<=p3 & 1<=p6] & 1<=p0]]]]]]]]]]
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
..abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
.abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA PGCD-PT-D02N005-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AF [[EX [[3<=p2 & 1<=p8]] & [AX [[3<=p1 & 1<=p7]] | [[3<=p2 & 1<=p8] | [A [[1<=p0 & 1<=p3] U [1<=p2 & 1<=p5]] & [1<=p2 & 1<=p5]]]]]]
normalized: ~ [EG [~ [[[[[[1<=p2 & 1<=p5] & [~ [EG [~ [[1<=p2 & 1<=p5]]]] & ~ [E [~ [[1<=p2 & 1<=p5]] U [~ [[1<=p0 & 1<=p3]] & ~ [[1<=p2 & 1<=p5]]]]]]] | [3<=p2 & 1<=p8]] | ~ [EX [~ [[3<=p1 & 1<=p7]]]]] & EX [[3<=p2 & 1<=p8]]]]]]
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
.abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
....
EG iterations: 4
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
...
EG iterations: 3
-> the formula is FALSE
FORMULA PGCD-PT-D02N005-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [E [A [[~ [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & 1<=p3]]] & ~ [EG [[3<=p1 & 1<=p7]]]] U [~ [[3<=p0 & 1<=p6]] & [A [[1<=p0 & 1<=p3] U [1<=p2 & 1<=p5]] | [1<=p1 & 1<=p4]]]] U EF [~ [AX [[3<=p1 & 1<=p7]]]]]]
normalized: ~ [E [true U ~ [E [[~ [EG [~ [[[[1<=p1 & 1<=p4] | [~ [EG [~ [[1<=p2 & 1<=p5]]]] & ~ [E [~ [[1<=p2 & 1<=p5]] U [~ [[1<=p0 & 1<=p3]] & ~ [[1<=p2 & 1<=p5]]]]]]] & ~ [[3<=p0 & 1<=p6]]]]]] & ~ [E [~ [[[[1<=p1 & 1<=p4] | [~ [EG [~ [[1<=p2 & 1<=p5]]]] & ~ [E [~ [[1<=p2 & 1<=p5]] U [~ [[1<=p0 & 1<=p3]] & ~ [[1<=p2 & 1<=p5]]]]]]] & ~ [[3<=p0 & 1<=p6]]]] U [~ [[~ [EG [[3<=p1 & 1<=p7]]] & ~ [[[1<=p0 & 1<=p3] | [[1<=p4 & 1<=p7] & 1<=p1]]]]] & ~ [[[[1<=p1 & 1<=p4] | [~ [EG [~ [[1<=p2 & 1<=p5]]]] & ~ [E [~ [[1<=p2 & 1<=p5]] U [~ [[1<=p0 & 1<=p3]] & ~ [[1<=p2 & 1<=p5]]]]]]] & ~ [[3<=p0 & 1<=p6]]]]]]]] U E [true U EX [~ [[3<=p1 & 1<=p7]]]]]]]]
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
.abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
....
EG iterations: 4
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
.
EG iterations: 1
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
....
EG iterations: 4
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
....
EG iterations: 4
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
...
EG iterations: 3
-> the formula is FALSE
FORMULA PGCD-PT-D02N005-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: E [[E [AG [[[1<=p0 & [1<=p3 & 1<=p6]] | [[1<=p1 & 1<=p4] | [1<=p2 & [1<=p5 & 1<=p8]]]]] U EG [[~ [[3<=p1 & 1<=p7]] & ~ [[1<=p2 & 1<=p5]]]]] & E [EF [[1<=p0 & [1<=p3 & 1<=p6]]] U [[EG [[1<=p1 & 1<=p4]] & 1<=p2] & [1<=p5 & 1<=p8]]]] U [EG [~ [EG [EX [[1<=p2 & 1<=p5]]]]] & [3<=p1 & 1<=p7]]]
normalized: E [[E [E [true U [[1<=p3 & 1<=p6] & 1<=p0]] U [[1<=p5 & 1<=p8] & [EG [[1<=p1 & 1<=p4]] & 1<=p2]]] & E [~ [E [true U ~ [[[[[1<=p5 & 1<=p8] & 1<=p2] | [1<=p1 & 1<=p4]] | [[1<=p3 & 1<=p6] & 1<=p0]]]]] U EG [[~ [[1<=p2 & 1<=p5]] & ~ [[3<=p1 & 1<=p7]]]]]] U [[3<=p1 & 1<=p7] & EG [~ [EG [EX [[1<=p2 & 1<=p5]]]]]]]
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
..
EG iterations: 1
...
EG iterations: 3
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
....
EG iterations: 4
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
..
EG iterations: 2
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
-> the formula is FALSE
FORMULA PGCD-PT-D02N005-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EX [[EF [AG [[1<=p0 & [1<=p3 & 1<=p6]]]] | [[EX [[[[3<=p2 & 1<=p8] | [p0<=0 | p3<=0]] & [EG [[1<=p0 & 1<=p3]] | [[1<=p1 & 1<=p4] & [1<=p2 & 1<=p5]]]]] & ~ [E [[1<=p0 & 1<=p3] U [1<=p1 & 1<=p4]]]] & [~ [A [[3<=p2 & 1<=p8] U [1<=p0 & 1<=p3]]] & [EX [[[1<=p2 & 1<=p5] | [3<=p1 & 1<=p7]]] | [[EX [[3<=p1 & 1<=p7]] & 3<=p0] & [1<=p6 & [1<=p1 & 1<=p4]]]]]]]]
normalized: EX [[[[[[[[1<=p1 & 1<=p4] & 1<=p6] & [EX [[3<=p1 & 1<=p7]] & 3<=p0]] | EX [[[3<=p1 & 1<=p7] | [1<=p2 & 1<=p5]]]] & ~ [[~ [EG [~ [[1<=p0 & 1<=p3]]]] & ~ [E [~ [[1<=p0 & 1<=p3]] U [~ [[3<=p2 & 1<=p8]] & ~ [[1<=p0 & 1<=p3]]]]]]]] & [~ [E [[1<=p0 & 1<=p3] U [1<=p1 & 1<=p4]]] & EX [[[[[1<=p2 & 1<=p5] & [1<=p1 & 1<=p4]] | EG [[1<=p0 & 1<=p3]]] & [[p0<=0 | p3<=0] | [3<=p2 & 1<=p8]]]]]] | E [true U ~ [E [true U ~ [[[1<=p3 & 1<=p6] & 1<=p0]]]]]]]
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
..
EG iterations: 2
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
.abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
....
EG iterations: 4
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
.abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
.abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
.-> the formula is FALSE
FORMULA PGCD-PT-D02N005-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: A [[[3<=p0 & 1<=p6] | [~ [A [~ [[[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]] U AG [[1<=p0 & 1<=p3]]]] & AG [E [[1<=p0 & [1<=p3 & 1<=p6]] U [1<=p0 & 1<=p3]]]]] U [AG [[[EG [AX [[3<=p1 & 1<=p7]]] & EF [[3<=p2 & 1<=p8]]] & [3<=p0 & 1<=p6]]] | [EF [~ [EF [[1<=p1 & 1<=p4]]]] & [[AF [~ [[1<=p3 & 1<=p0]]] | [EX [[1<=p0 & 1<=p3]] | EF [~ [[1<=p1 & 1<=p4]]]]] | [~ [[3<=p2 & 1<=p8]] | [[AG [[1<=p1 & 1<=p4]] & [3<=p2 & 1<=p8]] | [[1<=p1 & 1<=p4] & [1<=p7 & [1<=p0 & 1<=p3]]]]]]]]]
normalized: [~ [EG [~ [[[[[[[~ [E [true U ~ [[1<=p1 & 1<=p4]]]] & [3<=p2 & 1<=p8]] | [[[1<=p0 & 1<=p3] & 1<=p7] & [1<=p1 & 1<=p4]]] | ~ [[3<=p2 & 1<=p8]]] | [[E [true U ~ [[1<=p1 & 1<=p4]]] | EX [[1<=p0 & 1<=p3]]] | ~ [EG [[1<=p3 & 1<=p0]]]]] & E [true U ~ [E [true U [1<=p1 & 1<=p4]]]]] | ~ [E [true U ~ [[[3<=p0 & 1<=p6] & [E [true U [3<=p2 & 1<=p8]] & EG [~ [EX [~ [[3<=p1 & 1<=p7]]]]]]]]]]]]]] & ~ [E [~ [[[[[[[~ [E [true U ~ [[1<=p1 & 1<=p4]]]] & [3<=p2 & 1<=p8]] | [[[1<=p0 & 1<=p3] & 1<=p7] & [1<=p1 & 1<=p4]]] | ~ [[3<=p2 & 1<=p8]]] | [[E [true U ~ [[1<=p1 & 1<=p4]]] | EX [[1<=p0 & 1<=p3]]] | ~ [EG [[1<=p3 & 1<=p0]]]]] & E [true U ~ [E [true U [1<=p1 & 1<=p4]]]]] | ~ [E [true U ~ [[[3<=p0 & 1<=p6] & [E [true U [3<=p2 & 1<=p8]] & EG [~ [EX [~ [[3<=p1 & 1<=p7]]]]]]]]]]]] U [~ [[[[[[[~ [E [true U ~ [[1<=p1 & 1<=p4]]]] & [3<=p2 & 1<=p8]] | [[[1<=p0 & 1<=p3] & 1<=p7] & [1<=p1 & 1<=p4]]] | ~ [[3<=p2 & 1<=p8]]] | [[E [true U ~ [[1<=p1 & 1<=p4]]] | EX [[1<=p0 & 1<=p3]]] | ~ [EG [[1<=p3 & 1<=p0]]]]] & E [true U ~ [E [true U [1<=p1 & 1<=p4]]]]] | ~ [E [true U ~ [[[3<=p0 & 1<=p6] & [E [true U [3<=p2 & 1<=p8]] & EG [~ [EX [~ [[3<=p1 & 1<=p7]]]]]]]]]]]] & ~ [[[~ [E [true U ~ [E [[[1<=p3 & 1<=p6] & 1<=p0] U [1<=p0 & 1<=p3]]]]] & ~ [[~ [EG [E [true U ~ [[1<=p0 & 1<=p3]]]]] & ~ [E [E [true U ~ [[1<=p0 & 1<=p3]]] U [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] & E [true U ~ [[1<=p0 & 1<=p3]]]]]]]]] | [3<=p0 & 1<=p6]]]]]]]
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
EG iterations: 0
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
...
EG iterations: 2
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
..
EG iterations: 2
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
.abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
...
EG iterations: 2
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
..
EG iterations: 2
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
.abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
...
EG iterations: 2
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
..
EG iterations: 2
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
.abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA PGCD-PT-D02N005-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: E [AF [[A [[EG [[3<=p2 & 1<=p8]] & ~ [[1<=p2 & 1<=p5]]] U [1<=p2 & 1<=p5]] & AG [EF [[1<=p1 & [1<=p4 & 1<=p7]]]]]] U [~ [[~ [[1<=p0 & 1<=p3]] & [EX [[1<=p0 & [1<=p3 & 1<=p6]]] & AF [[1<=p2 & 1<=p5]]]]] & [~ [[1<=p2 & [1<=p5 & 1<=p8]]] & [[1<=p1 & 1<=p4] | [~ [[[E [[3<=p1 & 1<=p7] U [3<=p2 & 1<=p8]] & [[3<=p0 & 1<=p6] | [3<=p1 & 1<=p7]]] & [~ [[1<=p2 & 1<=p5]] & ~ [[1<=p0 & [1<=p3 & 1<=p6]]]]]] & ~ [[EF [[1<=p1 & 1<=p4]] & ~ [A [[1<=p2 & [1<=p5 & 1<=p8]] U [1<=p1 & 1<=p4]]]]]]]]]]
normalized: E [~ [EG [~ [[~ [E [true U ~ [E [true U [[1<=p4 & 1<=p7] & 1<=p1]]]]] & [~ [EG [~ [[1<=p2 & 1<=p5]]]] & ~ [E [~ [[1<=p2 & 1<=p5]] U [~ [[~ [[1<=p2 & 1<=p5]] & EG [[3<=p2 & 1<=p8]]]] & ~ [[1<=p2 & 1<=p5]]]]]]]]]] U [[[[~ [[~ [[~ [EG [~ [[1<=p1 & 1<=p4]]]] & ~ [E [~ [[1<=p1 & 1<=p4]] U [~ [[[1<=p5 & 1<=p8] & 1<=p2]] & ~ [[1<=p1 & 1<=p4]]]]]]] & E [true U [1<=p1 & 1<=p4]]]] & ~ [[[~ [[[1<=p3 & 1<=p6] & 1<=p0]] & ~ [[1<=p2 & 1<=p5]]] & [[[3<=p1 & 1<=p7] | [3<=p0 & 1<=p6]] & E [[3<=p1 & 1<=p7] U [3<=p2 & 1<=p8]]]]]] | [1<=p1 & 1<=p4]] & ~ [[[1<=p5 & 1<=p8] & 1<=p2]]] & ~ [[[~ [EG [~ [[1<=p2 & 1<=p5]]]] & EX [[[1<=p3 & 1<=p6] & 1<=p0]]] & ~ [[1<=p0 & 1<=p3]]]]]]
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
.abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
....
EG iterations: 4
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
....
EG iterations: 4
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.
EG iterations: 1
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
....
EG iterations: 4
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA PGCD-PT-D02N005-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: [~ [E [[[~ [[[1<=p7 & 1<=p4] & 1<=p1]] | [1<=p1 & 1<=p4]] & [3<=p1 & 1<=p7]] U [A [[3<=p2 & 1<=p8] U [[1<=p1 & [1<=p4 & 1<=p7]] | [3<=p2 & 1<=p8]]] | [[3<=p2 & 1<=p8] | [~ [[1<=p1 & 1<=p4]] & ~ [[1<=p0 & 1<=p3]]]]]]] | [EF [[[AF [[EF [[1<=p2 & 1<=p5]] & AG [[3<=p1 & 1<=p7]]]] & EX [[p1<=2 | p7<=0]]] & [[p2<=0 | p5<=0] & [EX [[1<=p2 & [1<=p5 & 1<=p8]]] | [[[[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p2 & 1<=p5]] & [p1<=2 | p7<=0]] | [[1<=p0 & [1<=p3 & 1<=p6]] & [1<=p0 & [1<=p3 & 1<=p6]]]]]]]] | AF [[~ [E [AG [[3<=p2 & 1<=p8]] U [1<=p2 & [1<=p5 & 1<=p8]]]] & AX [EX [[p1<=2 | p7<=0]]]]]]]
normalized: [[~ [EG [~ [[~ [EX [~ [EX [[p1<=2 | p7<=0]]]]] & ~ [E [~ [E [true U ~ [[3<=p2 & 1<=p8]]]] U [[1<=p5 & 1<=p8] & 1<=p2]]]]]]] | E [true U [[[[[[[1<=p3 & 1<=p6] & 1<=p0] & [[1<=p3 & 1<=p6] & 1<=p0]] | [[p1<=2 | p7<=0] & [[1<=p2 & 1<=p5] | [[1<=p3 & 1<=p6] & 1<=p0]]]] | EX [[[1<=p5 & 1<=p8] & 1<=p2]]] & [p2<=0 | p5<=0]] & [EX [[p1<=2 | p7<=0]] & ~ [EG [~ [[~ [E [true U ~ [[3<=p1 & 1<=p7]]]] & E [true U [1<=p2 & 1<=p5]]]]]]]]]] | ~ [E [[[3<=p1 & 1<=p7] & [[1<=p1 & 1<=p4] | ~ [[[1<=p7 & 1<=p4] & 1<=p1]]]] U [[[~ [[1<=p0 & 1<=p3]] & ~ [[1<=p1 & 1<=p4]]] | [3<=p2 & 1<=p8]] | [~ [EG [~ [[[3<=p2 & 1<=p8] | [[1<=p4 & 1<=p7] & 1<=p1]]]]] & ~ [E [~ [[[3<=p2 & 1<=p8] | [[1<=p4 & 1<=p7] & 1<=p1]]] U [~ [[3<=p2 & 1<=p8]] & ~ [[[3<=p2 & 1<=p8] | [[1<=p4 & 1<=p7] & 1<=p1]]]]]]]]]]]
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
....
EG iterations: 4
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
EG iterations: 0
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p1<=2)
states: 4,548 (3)
.abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
.abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p1<=2)
states: 4,548 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p1<=2)
states: 4,548 (3)
.....
EG iterations: 3
-> the formula is FALSE
FORMULA PGCD-PT-D02N005-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [[[EG [A [[3<=p0 & 1<=p6] U [1<=p2 & 1<=p5]]] | AF [[3<=p2 & 1<=p8]]] | [AG [AX [EF [[1<=p1 & 1<=p4]]]] | [[EF [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p1 & 1<=p4]] | [[3<=p2 & 1<=p8] | [3<=p0 & 1<=p6]]]] & [[[A [[1<=p2 & [1<=p5 & 1<=p8]] U [1<=p0 & [1<=p3 & 1<=p6]]] | [p2<=0 | p5<=0]] | [[p8<=0 | p0<=2] | [p6<=0 | [[p0<=0 | p3<=0] & [[p2<=2 | p8<=0] & [[1<=p2 & [1<=p5 & 1<=p8]] | [1<=p1 & 1<=p4]]]]]]] & [[1<=p2 & [1<=p5 & 1<=p8]] | [AG [[p2<=0 | [p5<=0 | p8<=0]]] & [AG [[p1<=0 | p4<=0]] | AF [[p1<=2 | p7<=0]]]]]]] | [1<=p0 & [1<=p3 & [EG [[1<=p1 & [1<=p4 & 1<=p7]]] | [EF [[1<=p0 & [1<=p3 & 1<=p6]]] & EF [[1<=p0 & 1<=p3]]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[E [true U [[1<=p3 & 1<=p6] & 1<=p0]] & E [true U [1<=p0 & 1<=p3]]] | EG [[[1<=p4 & 1<=p7] & 1<=p1]]] & 1<=p3] & 1<=p0] | [[[[[~ [EG [~ [[p1<=2 | p7<=0]]]] | ~ [E [true U ~ [[p1<=0 | p4<=0]]]]] & ~ [E [true U ~ [[[p5<=0 | p8<=0] | p2<=0]]]]] | [[1<=p5 & 1<=p8] & 1<=p2]] & [[[[[[[1<=p1 & 1<=p4] | [[1<=p5 & 1<=p8] & 1<=p2]] & [p2<=2 | p8<=0]] & [p0<=0 | p3<=0]] | p6<=0] | [p8<=0 | p0<=2]] | [[p2<=0 | p5<=0] | [~ [EG [~ [[[1<=p3 & 1<=p6] & 1<=p0]]]] & ~ [E [~ [[[1<=p3 & 1<=p6] & 1<=p0]] U [~ [[[1<=p5 & 1<=p8] & 1<=p2]] & ~ [[[1<=p3 & 1<=p6] & 1<=p0]]]]]]]]] & E [true U [[[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]] | [[1<=p1 & 1<=p4] | [[1<=p4 & 1<=p7] & 1<=p1]]]]]] | ~ [E [true U EX [~ [E [true U [1<=p1 & 1<=p4]]]]]]] | [~ [EG [~ [[3<=p2 & 1<=p8]]]] | EG [[~ [EG [~ [[1<=p2 & 1<=p5]]]] & ~ [E [~ [[1<=p2 & 1<=p5]] U [~ [[3<=p0 & 1<=p6]] & ~ [[1<=p2 & 1<=p5]]]]]]]]]]]]
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
....
EG iterations: 4
..
EG iterations: 2
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.
EG iterations: 1
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
.abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
....
EG iterations: 4
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p0<=2)
states: 4,548 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p2<=2)
states: 4,548 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p1<=2)
states: 4,548 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
..
EG iterations: 2
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
-> the formula is FALSE
FORMULA PGCD-PT-D02N005-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
totally nodes used: 25858 (2.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 159039 65799 224838
used/not used/entry size/cache size: 85601 67023263 16 1024MB
basic ops cache: hits/miss/sum: 68938 35244 104182
used/not used/entry size/cache size: 65375 16711841 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: 4641 1953 6594
used/not used/entry size/cache size: 1953 8386655 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 67086032
1 21139
2 1160
3 240
4 96
5 89
6 42
7 19
8 17
9 14
>= 10 16
Total processing time: 0m 4.310sec
BK_STOP 1680818095783
--------------------
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:486 (54), effective:159 (17)
initing FirstDep: 0m 0.000sec
iterations count:59 (6), effective:11 (1)
iterations count:33 (3), effective:8 (0)
iterations count:25 (2), effective:16 (1)
iterations count:402 (44), effective:129 (14)
iterations count:25 (2), effective:16 (1)
iterations count:76 (8), effective:15 (1)
iterations count:25 (2), effective:16 (1)
iterations count:25 (2), effective:16 (1)
iterations count:11 (1), effective:1 (0)
iterations count:25 (2), effective:16 (1)
iterations count:9 (1), effective:0 (0)
iterations count:348 (38), effective:104 (11)
iterations count:97 (10), effective:34 (3)
iterations count:9 (1), effective:0 (0)
iterations count:26 (2), effective:5 (0)
iterations count:63 (7), effective:16 (1)
iterations count:9 (1), effective:0 (0)
iterations count:25 (2), effective:16 (1)
iterations count:15 (1), effective:1 (0)
iterations count:57 (6), effective:16 (1)
iterations count:25 (2), effective:16 (1)
iterations count:25 (2), effective:16 (1)
iterations count:24 (2), effective:4 (0)
iterations count:25 (2), effective:16 (1)
iterations count:9 (1), effective:0 (0)
iterations count:25 (2), effective:16 (1)
iterations count:58 (6), effective:14 (1)
iterations count:33 (3), effective:12 (1)
iterations count:27 (3), effective:5 (0)
iterations count:348 (38), effective:104 (11)
iterations count:54 (6), effective:9 (1)
iterations count:54 (6), effective:9 (1)
iterations count:58 (6), effective:14 (1)
iterations count:33 (3), effective:12 (1)
iterations count:27 (3), effective:5 (0)
iterations count:348 (38), effective:104 (11)
iterations count:54 (6), effective:9 (1)
iterations count:54 (6), effective:9 (1)
iterations count:58 (6), effective:14 (1)
iterations count:33 (3), effective:12 (1)
iterations count:27 (3), effective:5 (0)
iterations count:348 (38), effective:104 (11)
iterations count:54 (6), effective:9 (1)
iterations count:54 (6), effective:9 (1)
iterations count:63 (7), effective:16 (1)
iterations count:27 (3), effective:5 (0)
iterations count:36 (4), effective:9 (1)
iterations count:9 (1), effective:0 (0)
iterations count:27 (3), effective:5 (0)
iterations count:348 (38), effective:104 (11)
iterations count:9 (1), effective:0 (0)
iterations count:9 (1), effective:0 (0)
iterations count:22 (2), effective:13 (1)
iterations count:29 (3), effective:5 (0)
iterations count:81 (9), effective:16 (1)
iterations count:57 (6), effective:16 (1)
iterations count:9 (1), effective:0 (0)
iterations count:41 (4), effective:16 (1)
iterations count:27 (3), effective:5 (0)
iterations count:380 (42), effective:116 (12)
iterations count:32 (3), effective:8 (0)
iterations count:41 (4), effective:16 (1)
iterations count:29 (3), effective:5 (0)
iterations count:27 (3), effective:5 (0)
iterations count:26 (2), effective:5 (0)
iterations count:26 (2), effective:5 (0)
iterations count:84 (9), effective:35 (3)
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-D02N005"
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-D02N005, 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-167987247400434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-PT-D02N005.tgz
mv PGCD-PT-D02N005 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 '
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 ;