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.r490-tall-167912708500322.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 SwimmingPool-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708500322
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.5K Feb 26 03:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 03:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 03:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 26 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.9K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679241054051

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=SwimmingPool-PT-01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 15:50:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 15:50:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 15:50:55] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-19 15:50:55] [INFO ] Transformed 9 places.
[2023-03-19 15:50:55] [INFO ] Transformed 7 transitions.
[2023-03-19 15:50:55] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 8 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 15:50:55] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-19 15:50:56] [INFO ] Implicit Places using invariants in 328 ms returned []
[2023-03-19 15:50:56] [INFO ] Invariant cache hit.
[2023-03-19 15:50:56] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-19 15:50:56] [INFO ] Invariant cache hit.
[2023-03-19 15:50:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 424 ms. Remains : 9/9 places, 7/7 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 14 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 4 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Finished random walk after 136 steps, including 0 resets, run visited all 21 properties in 11 ms. (steps per millisecond=12 )
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 2 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 2 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 9 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 7 transition count 5
Applied a total of 4 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 5/7 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 7/9 places, 5/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 7/7 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 7/7 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 7/7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 0 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 1 ms
[2023-03-19 15:50:56] [INFO ] Flatten gal took : 2 ms
[2023-03-19 15:50:56] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-19 15:50:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 7 transitions and 20 arcs took 0 ms.
Total runtime 961 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: 7 NrArc: 20)

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

net check time: 0m 0.000sec

init dd package: 0m 2.766sec


RS generation: 0m 0.095sec


-> reachability set: #nodes 6529 (6.5e+03) #states 89,621 (4)



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

checking: EX [AF [1<=p4]]
normalized: EX [~ [EG [~ [1<=p4]]]]

abstracting: (1<=p4)
states: 61,536 (4)
..................................................................................
EG iterations: 82
.-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.255sec

checking: [EX [1<=p4] | AG [EF [1<=p4]]]
normalized: [~ [E [true U ~ [E [true U 1<=p4]]]] | EX [1<=p4]]

abstracting: (1<=p4)
states: 61,536 (4)
.abstracting: (1<=p4)
states: 61,536 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: AX [EF [EG [[p1<=0 | p8<=0]]]]
normalized: ~ [EX [~ [E [true U EG [[p1<=0 | p8<=0]]]]]]

abstracting: (p8<=0)
states: 2,324 (3)
abstracting: (p1<=0)
states: 26,797 (4)
.............................................................................
EG iterations: 77
.-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.111sec

checking: EG [EF [[1<=p0 & [1<=p7 & AG [[1<=p3 & 1<=p7]]]]]]
normalized: EG [E [true U [1<=p0 & [1<=p7 & ~ [E [true U ~ [[1<=p3 & 1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.070sec

checking: AX [~ [A [AF [E [1<=p4 U [1<=p0 & 1<=p7]]] U 1<=p4]]]
normalized: ~ [EX [[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [EG [~ [E [1<=p4 U [1<=p0 & 1<=p7]]]] & ~ [1<=p4]]]]]]]

abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p4)
states: 61,536 (4)
......................
EG iterations: 22
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p4)
states: 61,536 (4)
..................................................................................
EG iterations: 82
.-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.083sec

checking: [AX [[p3<=0 | p7<=0]] & [EX [[p0<=0 | p7<=0]] | AF [1<=p4]]]
normalized: [[~ [EG [~ [1<=p4]]] | EX [[p0<=0 | p7<=0]]] & ~ [EX [~ [[p3<=0 | p7<=0]]]]]

abstracting: (p7<=0)
states: 18,218 (4)
abstracting: (p3<=0)
states: 13,013 (4)
.abstracting: (p7<=0)
states: 18,218 (4)
abstracting: (p0<=0)
states: 11,410 (4)
.abstracting: (1<=p4)
states: 61,536 (4)
..................................................................................
EG iterations: 82
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

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

abstracting: (1<=p6)
states: 78,211 (4)
abstracting: (1<=p5)
states: 62,824 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (p6<=0)
states: 11,410 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (p6<=0)
states: 11,410 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (p6<=0)
states: 11,410 (4)
.
EG iterations: 1
abstracting: (1<=p2)
states: 61,536 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.118sec

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

abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p6)
states: 78,211 (4)
.abstracting: (1<=p4)
states: 61,536 (4)
.abstracting: (1<=p5)
states: 62,824 (4)
abstracting: (1<=p4)
states: 61,536 (4)
.abstracting: (1<=p4)
states: 61,536 (4)
..
EG iterations: 1
.-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.105sec

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

abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p4)
states: 61,536 (4)
.abstracting: (p1<=0)
states: 26,797 (4)
abstracting: (p8<=0)
states: 2,324 (3)
abstracting: (p1<=0)
states: 26,797 (4)
abstracting: (p5<=0)
states: 26,797 (4)
abstracting: (p8<=0)
states: 2,324 (3)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

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

abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
..............................................................
EG iterations: 62
.
EG iterations: 0
abstracting: (1<=p6)
states: 78,211 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (p2<=0)
states: 28,085 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p2)
states: 61,536 (4)
.abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p5)
states: 62,824 (4)
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.384sec

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

abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p8)
states: 87,297 (4)
.abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
.abstracting: (1<=p6)
states: 78,211 (4)
.abstracting: (1<=p5)
states: 62,824 (4)

EG iterations: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

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

abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p6)
states: 78,211 (4)
..abstracting: (1<=p2)
states: 61,536 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
.............................................................................
EG iterations: 77
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
..................................................................................
EG iterations: 82
.abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (p4<=0)
states: 28,085 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
.............................................................................
EG iterations: 77
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p6)
states: 78,211 (4)
..abstracting: (1<=p2)
states: 61,536 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
.............................................................................
EG iterations: 77
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
..................................................................................
EG iterations: 82
.abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p6)
states: 78,211 (4)
..abstracting: (1<=p2)
states: 61,536 (4)
.
EG iterations: 1
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
.............................................................................
EG iterations: 77
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
..................................................................................
EG iterations: 82
...
EG iterations: 2
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.304sec

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

abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p2)
states: 61,536 (4)
.abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p5)
states: 62,824 (4)
.
EG iterations: 1
.............................................................................
EG iterations: 77
abstracting: (1<=p2)
states: 61,536 (4)
.abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p5)
states: 62,824 (4)
.abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p6)
states: 78,211 (4)
abstracting: (p5<=0)
states: 26,797 (4)
abstracting: (1<=p4)
states: 61,536 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.378sec

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

abstracting: (p7<=0)
states: 18,218 (4)
abstracting: (p0<=0)
states: 11,410 (4)
.
EG iterations: 1
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
..............................................................
EG iterations: 62
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p6)
states: 78,211 (4)
abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p5)
states: 62,824 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (p7<=0)
states: 18,218 (4)
abstracting: (p3<=0)
states: 13,013 (4)
abstracting: (p4<=0)
states: 28,085 (4)
abstracting: (p4<=0)
states: 28,085 (4)
...
EG iterations: 1
-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.084sec

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

abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p5)
states: 62,824 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p5)
states: 62,824 (4)
abstracting: (1<=p5)
states: 62,824 (4)
..abstracting: (1<=p6)
states: 78,211 (4)
.
EG iterations: 1
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
..............................................................
EG iterations: 62
abstracting: (1<=p6)
states: 78,211 (4)
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p4)
states: 61,536 (4)
..................................................................................
EG iterations: 82
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p5)
states: 62,824 (4)
.abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
.............................................................................
EG iterations: 77
-> the formula is FALSE

FORMULA SwimmingPool-PT-01-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.238sec

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

abstracting: (1<=p2)
states: 61,536 (4)
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p5)
states: 62,824 (4)
.............................................................................
EG iterations: 77
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
abstracting: (1<=p5)
states: 62,824 (4)
abstracting: (p2<=0)
states: 28,085 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p8)
states: 87,297 (4)
abstracting: (1<=p1)
states: 62,824 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
..................................................................................
EG iterations: 82
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p3)
states: 76,608 (4)
.........................................................
EG iterations: 57
abstracting: (p7<=0)
states: 18,218 (4)
abstracting: (p0<=0)
states: 11,410 (4)
abstracting: (p5<=0)
states: 26,797 (4)
abstracting: (1<=p4)
states: 61,536 (4)
abstracting: (1<=p6)
states: 78,211 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p6)
states: 78,211 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
abstracting: (1<=p7)
states: 71,403 (4)
abstracting: (1<=p0)
states: 78,211 (4)
..................................................................................
EG iterations: 82
abstracting: (p6<=0)
states: 11,410 (4)
.-> the formula is TRUE

FORMULA SwimmingPool-PT-01-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.195sec

totally nodes used: 611754 (6.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6624640 2133013 8757653
used/not used/entry size/cache size: 2346168 64762696 16 1024MB
basic ops cache: hits/miss/sum: 2259965 733055 2993020
used/not used/entry size/cache size: 1308695 15468521 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: 126863 37227 164090
used/not used/entry size/cache size: 37200 8351408 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 66636546
1 395804
2 49220
3 13151
4 5273
5 4964
6 1703
7 626
8 680
9 243
>= 10 654

Total processing time: 0m 7.068sec


BK_STOP 1679241064463

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:507 (72), effective:120 (17)

initing FirstDep: 0m 0.000sec


iterations count:30 (4), effective:7 (1)

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

iterations count:37 (5), effective:10 (1)

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

iterations count:137 (19), effective:24 (3)

iterations count:36 (5), effective:8 (1)

iterations count:37 (5), effective:10 (1)

iterations count:287 (41), effective:75 (10)

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

iterations count:36 (5), effective:8 (1)

iterations count:37 (5), effective:10 (1)

iterations count:38 (5), effective:11 (1)

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

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

iterations count:30 (4), effective:7 (1)

iterations count:137 (19), effective:30 (4)

iterations count:32 (4), effective:7 (1)

iterations count:47 (6), effective:10 (1)

iterations count:47 (6), effective:10 (1)

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

iterations count:32 (4), effective:7 (1)

iterations count:47 (6), effective:10 (1)

iterations count:47 (6), effective:10 (1)

iterations count:60 (8), effective:16 (2)

iterations count:32 (4), effective:7 (1)

iterations count:47 (6), effective:10 (1)

iterations count:47 (6), effective:10 (1)

iterations count:35 (5), effective:8 (1)

iterations count:35 (5), effective:8 (1)

iterations count:30 (4), effective:7 (1)

iterations count:37 (5), effective:10 (1)

iterations count:35 (5), effective:9 (1)

iterations count:35 (5), effective:8 (1)

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

iterations count:305 (43), effective:66 (9)

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

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

iterations count:157 (22), effective:30 (4)

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

iterations count:32 (4), effective:6 (0)

iterations count:37 (5), effective:10 (1)

iterations count:32 (4), effective:6 (0)

iterations count:61 (8), effective:14 (2)

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

iterations count:37 (5), effective:10 (1)

iterations count:257 (36), effective:40 (5)

iterations count:35 (5), effective:8 (1)

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

iterations count:37 (5), effective:10 (1)

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

iterations count:247 (35), effective:100 (14)

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="SwimmingPool-PT-01"
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 SwimmingPool-PT-01, 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 r490-tall-167912708500322"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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