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-167912708500334.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-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708500334
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 5.9K Feb 26 03:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 03:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 03:42 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.8K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 03:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 161K Feb 26 03:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 03:44 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-02-ReachabilityCardinality-00
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-01
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-02
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-03
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-04
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-05
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-06
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-07
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-08
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-09
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-10
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-11
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-12
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-13
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-14
FORMULA_NAME SwimmingPool-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679241188791

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SwimmingPool-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 15:53:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 15:53:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 15:53:10] [INFO ] Load time of PNML (sax parser for PT used): 17 ms
[2023-03-19 15:53:10] [INFO ] Transformed 9 places.
[2023-03-19 15:53:10] [INFO ] Transformed 7 transitions.
[2023-03-19 15:53:10] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 71 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10009 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 16) seen :6
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :1
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :1
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 15:53:11] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-19 15:53:11] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-19 15:53:11] [INFO ] After 166ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:4
[2023-03-19 15:53:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 15:53:11] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :0
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1337 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SwimmingPool_PT_02
(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.865sec


RS generation: 0m 2.005sec


-> reachability set: #nodes 44324 (4.4e+04) #states 3,408,031 (6)



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

checking: AG [InBath<=21]
normalized: ~ [E [true U ~ [InBath<=21]]]

abstracting: (InBath<=21)
states: 3,328,633 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.932sec

checking: EF [39<=Dressed]
normalized: E [true U 39<=Dressed]

abstracting: (39<=Dressed)
states: 0
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.050sec

checking: AG [~ [39<=Cabins]]
normalized: ~ [E [true U 39<=Cabins]]

abstracting: (39<=Cabins)
states: 0
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: AG [Entered<=Bags]
normalized: ~ [E [true U ~ [Entered<=Bags]]]

abstracting: (Entered<=Bags)
states: 2,752,893 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.149sec

checking: AG [[Undress<=InBath | 4<=Cabins]]
normalized: ~ [E [true U ~ [[Undress<=InBath | 4<=Cabins]]]]

abstracting: (4<=Cabins)
states: 1,945,704 (6)
abstracting: (Undress<=InBath)
states: 2,517,603 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.052sec

checking: AG [[Entered<=17 | [Dress<=Undress | Out<=11]]]
normalized: ~ [E [true U ~ [[Entered<=17 | [Dress<=Undress | Out<=11]]]]]

abstracting: (Out<=11)
states: 2,370,225 (6)
abstracting: (Dress<=Undress)
states: 1,872,733 (6)
abstracting: (Entered<=17)
states: 3,039,663 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.686sec

checking: AG [[~ [[~ [Dressed<=Bags] & WaitBag<=InBath]] | Undress<=16]]
normalized: ~ [E [true U ~ [[Undress<=16 | ~ [[WaitBag<=InBath & ~ [Dressed<=Bags]]]]]]]

abstracting: (Dressed<=Bags)
states: 3,233,307 (6)
abstracting: (WaitBag<=InBath)
states: 2,515,447 (6)
abstracting: (Undress<=16)
states: 3,401,003 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.616sec

checking: AG [[[Dress<=InBath | [Entered<=Dressed | [[[Undress<=Entered & [[Dress<=Out & [Entered<=Dressed | 9<=Dressed]] | 24<=Out]] & ~ [[[[13<=Dressed & 3<=WaitBag] | Entered<=InBath] | ~ [[Undress<=0 | Dressed<=25]]]]] | ~ [Entered<=27]]]] | [[Entered<=37 | [Dress<=36 & ~ [Dress<=Entered]]] | InBath<=28]]]
normalized: ~ [E [true U ~ [[[InBath<=28 | [Entered<=37 | [Dress<=36 & ~ [Dress<=Entered]]]] | [Dress<=InBath | [Entered<=Dressed | [~ [Entered<=27] | [~ [[~ [[Undress<=0 | Dressed<=25]] | [Entered<=InBath | [13<=Dressed & 3<=WaitBag]]]] & [Undress<=Entered & [24<=Out | [Dress<=Out & [Entered<=Dressed | 9<=Dressed]]]]]]]]]]]]

abstracting: (9<=Dressed)
states: 386,308 (5)
abstracting: (Entered<=Dressed)
states: 1,054,144 (6)
abstracting: (Dress<=Out)
states: 2,598,673 (6)
abstracting: (24<=Out)
states: 74,613 (4)
abstracting: (Undress<=Entered)
states: 2,598,673 (6)
abstracting: (3<=WaitBag)
states: 1,857,009 (6)
abstracting: (13<=Dressed)
states: 86,856 (4)
abstracting: (Entered<=InBath)
states: 1,713,745 (6)
abstracting: (Dressed<=25)
states: 3,408,031 (6)
abstracting: (Undress<=0)
states: 625,119 (5)
abstracting: (Entered<=27)
states: 3,389,467 (6)
abstracting: (Entered<=Dressed)
states: 1,054,144 (6)
abstracting: (Dress<=InBath)
states: 2,517,603 (6)
abstracting: (Dress<=Entered)
states: 2,598,673 (6)
abstracting: (Dress<=36)
states: 3,408,031 (6)
abstracting: (Entered<=37)
states: 3,408,003 (6)
abstracting: (InBath<=28)
states: 3,406,809 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.506sec

checking: AG [~ [[[[[[8<=Entered | [Cabins<=Entered | [InBath<=38 | [WaitBag<=Dress | Cabins<=InBath]]]] & ~ [[[[WaitBag<=28 & 16<=WaitBag] & Cabins<=8] | [Cabins<=14 | [Entered<=Undress & Dress<=20]]]]] & [[[Entered<=40 & [[16<=Bags & 5<=Entered] & Dress<=Out]] & [[Out<=Undress & Dress<=4] | ~ [WaitBag<=Bags]]] & Dress<=Out]] & Entered<=Cabins] & 21<=Entered]]]
normalized: ~ [E [true U [21<=Entered & [Entered<=Cabins & [[Dress<=Out & [[~ [WaitBag<=Bags] | [Out<=Undress & Dress<=4]] & [Entered<=40 & [Dress<=Out & [16<=Bags & 5<=Entered]]]]] & [~ [[[Cabins<=14 | [Entered<=Undress & Dress<=20]] | [Cabins<=8 & [WaitBag<=28 & 16<=WaitBag]]]] & [8<=Entered | [Cabins<=Entered | [InBath<=38 | [WaitBag<=Dress | Cabins<=InBath]]]]]]]]]]

abstracting: (Cabins<=InBath)
states: 2,338,347 (6)
abstracting: (WaitBag<=Dress)
states: 1,836,681 (6)
abstracting: (InBath<=38)
states: 3,408,031 (6)
abstracting: (Cabins<=Entered)
states: 2,421,573 (6)
abstracting: (8<=Entered)
states: 1,695,505 (6)
abstracting: (16<=WaitBag)
states: 17,430 (4)
abstracting: (WaitBag<=28)
states: 3,408,031 (6)
abstracting: (Cabins<=8)
states: 2,705,238 (6)
abstracting: (Dress<=20)
states: 3,408,031 (6)
abstracting: (Entered<=Undress)
states: 1,021,350 (6)
abstracting: (Cabins<=14)
states: 3,324,031 (6)
abstracting: (5<=Entered)
states: 2,288,398 (6)
abstracting: (16<=Bags)
states: 1,631,728 (6)
abstracting: (Dress<=Out)
states: 2,598,673 (6)
abstracting: (Entered<=40)
states: 3,408,031 (6)
abstracting: (Dress<=4)
states: 2,290,931 (6)
abstracting: (Out<=Undress)
states: 1,021,350 (6)
abstracting: (WaitBag<=Bags)
states: 3,233,307 (6)
abstracting: (Dress<=Out)
states: 2,598,673 (6)
abstracting: (Entered<=Cabins)
states: 1,198,450 (6)
abstracting: (21<=Entered)
states: 177,100 (5)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.655sec

checking: AG [~ [[~ [[[[34<=Undress | [[[Out<=Dress & Out<=12] | 30<=Cabins] | ~ [Entered<=7]]] & [[[[Out<=36 | 35<=InBath] & [Out<=Dress | Undress<=Dress]] & [[27<=Undress & Out<=Dress] | [Dress<=WaitBag | WaitBag<=5]]] & 34<=WaitBag]] & [Out<=27 | [[~ [6<=InBath] & [[Dressed<=32 | InBath<=InBath] & ~ [5<=Undress]]] | [[[WaitBag<=Undress & Bags<=18] | [10<=Cabins | Undress<=4]] | [InBath<=Dressed | [Out<=Undress | Cabins<=InBath]]]]]]] & ~ [InBath<=32]]]]
normalized: ~ [E [true U [~ [InBath<=32] & ~ [[[Out<=27 | [[[InBath<=Dressed | [Out<=Undress | Cabins<=InBath]] | [[10<=Cabins | Undress<=4] | [WaitBag<=Undress & Bags<=18]]] | [[~ [5<=Undress] & [Dressed<=32 | InBath<=InBath]] & ~ [6<=InBath]]]] & [[34<=WaitBag & [[[Dress<=WaitBag | WaitBag<=5] | [27<=Undress & Out<=Dress]] & [[Out<=Dress | Undress<=Dress] & [Out<=36 | 35<=InBath]]]] & [34<=Undress | [~ [Entered<=7] | [30<=Cabins | [Out<=Dress & Out<=12]]]]]]]]]]

abstracting: (Out<=12)
states: 2,508,363 (6)
abstracting: (Out<=Dress)
states: 1,021,350 (6)
abstracting: (30<=Cabins)
states: 0
abstracting: (Entered<=7)
states: 1,712,526 (6)
abstracting: (34<=Undress)
states: 0
abstracting: (35<=InBath)
states: 0
abstracting: (Out<=36)
states: 3,407,947 (6)
abstracting: (Undress<=Dress)
states: 1,872,733 (6)
abstracting: (Out<=Dress)
states: 1,021,350 (6)
abstracting: (Out<=Dress)
states: 1,021,350 (6)
abstracting: (27<=Undress)
states: 0
abstracting: (WaitBag<=5)
states: 2,497,702 (6)
abstracting: (Dress<=WaitBag)
states: 1,904,034 (6)
abstracting: (34<=WaitBag)
states: 0
abstracting: (6<=InBath)
states: 1,973,521 (6)
abstracting: (InBath<=InBath)
states: 3,408,031 (6)
abstracting: (Dressed<=32)
states: 3,408,031 (6)
abstracting: (5<=Undress)
states: 1,117,100 (6)
abstracting: (Bags<=18)
states: 2,306,931 (6)
abstracting: (WaitBag<=Undress)
states: 1,836,681 (6)
abstracting: (Undress<=4)
states: 2,290,931 (6)
abstracting: (10<=Cabins)
states: 539,539 (5)
abstracting: (Cabins<=InBath)
states: 2,338,347 (6)
abstracting: (Out<=Undress)
states: 1,021,350 (6)
abstracting: (InBath<=Dressed)
states: 1,115,730 (6)
abstracting: (Out<=27)
states: 3,389,467 (6)
abstracting: (InBath<=32)
states: 3,408,031 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.500sec

checking: AG [[[[~ [[[[[[Bags<=33 | WaitBag<=Dressed] | [9<=InBath & Dress<=10]] & ~ [Undress<=Entered]] | Dressed<=1] | [~ [[[WaitBag<=Bags & 40<=Bags] | 33<=Bags]] & [[Dressed<=Dressed & [3<=Dress | Out<=InBath]] & Out<=35]]]] & [[[~ [[33<=InBath & 11<=InBath]] & [32<=Dressed | ~ [Dress<=8]]] & ~ [Entered<=Dressed]] | [16<=InBath & [32<=Cabins & [[[31<=WaitBag & WaitBag<=Dress] & ~ [37<=Undress]] | Bags<=Dress]]]]] | [Bags<=Dressed | Undress<=22]] & [~ [Cabins<=Dressed] | 16<=Entered]]]
normalized: ~ [E [true U ~ [[[16<=Entered | ~ [Cabins<=Dressed]] & [[Bags<=Dressed | Undress<=22] | [[[16<=InBath & [32<=Cabins & [Bags<=Dress | [~ [37<=Undress] & [31<=WaitBag & WaitBag<=Dress]]]]] | [~ [Entered<=Dressed] & [[32<=Dressed | ~ [Dress<=8]] & ~ [[33<=InBath & 11<=InBath]]]]] & ~ [[[[Out<=35 & [Dressed<=Dressed & [3<=Dress | Out<=InBath]]] & ~ [[33<=Bags | [WaitBag<=Bags & 40<=Bags]]]] | [Dressed<=1 | [~ [Undress<=Entered] & [[9<=InBath & Dress<=10] | [Bags<=33 | WaitBag<=Dressed]]]]]]]]]]]]

abstracting: (WaitBag<=Dressed)
states: 1,863,819 (6)
abstracting: (Bags<=33)
states: 3,408,031 (6)
abstracting: (Dress<=10)
states: 3,231,569 (6)
abstracting: (9<=InBath)
states: 1,399,717 (6)
abstracting: (Undress<=Entered)
states: 2,598,673 (6)
abstracting: (Dressed<=1)
states: 1,110,835 (6)
abstracting: (40<=Bags)
states: 0
abstracting: (WaitBag<=Bags)
states: 3,233,307 (6)
abstracting: (33<=Bags)
states: 0
abstracting: (Out<=InBath)
states: 1,713,745 (6)
abstracting: (3<=Dress)
states: 1,803,396 (6)
abstracting: (Dressed<=Dressed)
states: 3,408,031 (6)
abstracting: (Out<=35)
states: 3,407,821 (6)
abstracting: (11<=InBath)
states: 1,070,311 (6)
abstracting: (33<=InBath)
states: 0
abstracting: (Dress<=8)
states: 3,051,675 (6)
abstracting: (32<=Dressed)
states: 0
abstracting: (Entered<=Dressed)
states: 1,054,144 (6)
abstracting: (WaitBag<=Dress)
states: 1,836,681 (6)
abstracting: (31<=WaitBag)
states: 0
abstracting: (37<=Undress)
states: 0
abstracting: (Bags<=Dress)
states: 409,654 (5)
abstracting: (32<=Cabins)
states: 0
abstracting: (16<=InBath)
states: 442,663 (5)
abstracting: (Undress<=22)
states: 3,408,031 (6)
abstracting: (Bags<=Dressed)
states: 250,393 (5)
abstracting: (Cabins<=Dressed)
states: 1,552,111 (6)
abstracting: (16<=Entered)
states: 549,010 (5)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.574sec

checking: EF [[Bags<=15 | [[[Cabins<=Bags | [WaitBag<=24 | [[[[Bags<=InBath & Dressed<=Undress] | Out<=16] & Undress<=18] | Cabins<=13]]] & [[Dressed<=InBath | ~ [[~ [Undress<=WaitBag] | [[Cabins<=Dressed | Dressed<=40] | 20<=Out]]]] & [~ [[8<=Entered & [~ [24<=Dress] | Undress<=11]]] & [~ [[[Bags<=32 & Cabins<=InBath] & [Cabins<=Out | 39<=Dress]]] | Bags<=Cabins]]]] & [Undress<=Entered & [[Undress<=7 & ~ [[InBath<=12 | [[Out<=Dress | Undress<=23] & Entered<=Dress]]]] | Out<=21]]]]]
normalized: E [true U [Bags<=15 | [[Undress<=Entered & [Out<=21 | [Undress<=7 & ~ [[InBath<=12 | [Entered<=Dress & [Out<=Dress | Undress<=23]]]]]]] & [[[[Bags<=Cabins | ~ [[[Cabins<=Out | 39<=Dress] & [Bags<=32 & Cabins<=InBath]]]] & ~ [[8<=Entered & [Undress<=11 | ~ [24<=Dress]]]]] & [Dressed<=InBath | ~ [[[20<=Out | [Cabins<=Dressed | Dressed<=40]] | ~ [Undress<=WaitBag]]]]] & [Cabins<=Bags | [WaitBag<=24 | [Cabins<=13 | [Undress<=18 & [Out<=16 | [Bags<=InBath & Dressed<=Undress]]]]]]]]]]

abstracting: (Dressed<=Undress)
states: 1,836,681 (6)
abstracting: (Bags<=InBath)
states: 1,023,814 (6)
abstracting: (Out<=16)
states: 2,954,655 (6)
abstracting: (Undress<=18)
states: 3,407,109 (6)
abstracting: (Cabins<=13)
states: 3,273,589 (6)
abstracting: (WaitBag<=24)
states: 3,408,031 (6)
abstracting: (Cabins<=Bags)
states: 3,067,204 (6)
abstracting: (Undress<=WaitBag)
states: 1,904,034 (6)
abstracting: (Dressed<=40)
states: 3,408,031 (6)
abstracting: (Cabins<=Dressed)
states: 1,552,111 (6)
abstracting: (20<=Out)
states: 230,230 (5)
abstracting: (Dressed<=InBath)
states: 2,515,447 (6)
abstracting: (24<=Dress)
states: 0
abstracting: (Undress<=11)
states: 3,289,495 (6)
abstracting: (8<=Entered)
states: 1,695,505 (6)
abstracting: (Cabins<=InBath)
states: 2,338,347 (6)
abstracting: (Bags<=32)
states: 3,408,031 (6)
abstracting: (39<=Dress)
states: 0
abstracting: (Cabins<=Out)
states: 2,421,573 (6)
abstracting: (Bags<=Cabins)
states: 420,224 (5)
abstracting: (Undress<=23)
states: 3,408,031 (6)
abstracting: (Out<=Dress)
states: 1,021,350 (6)
abstracting: (Entered<=Dress)
states: 1,021,350 (6)
abstracting: (InBath<=12)
states: 2,623,663 (6)
abstracting: (Undress<=7)
states: 2,920,258 (6)
abstracting: (Out<=21)
states: 3,273,435 (6)
abstracting: (Undress<=Entered)
states: 2,598,673 (6)
abstracting: (Bags<=15)
states: 1,776,303 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.814sec

checking: AG [~ [[[[Dress<=WaitBag & [~ [[[14<=Bags | WaitBag<=Undress] & [Dressed<=15 | 17<=Dressed]]] | 7<=InBath]] & [[[Bags<=20 | [~ [[34<=Entered & 12<=Out]] | [[Bags<=Undress & 16<=Bags] & 10<=Dressed]]] | Entered<=39] | [[~ [InBath<=InBath] & [~ [[WaitBag<=27 | Entered<=InBath]] | 17<=Dressed]] & [[~ [Bags<=InBath] & [~ [Dress<=33] | ~ [WaitBag<=6]]] | 7<=InBath]]]] & [[[Dress<=17 & ~ [[[[InBath<=14 & Dressed<=Cabins] | [Bags<=12 & 15<=Dressed]] & [~ [Dress<=Bags] & 34<=Dressed]]]] & 17<=Out] & [[[~ [15<=WaitBag] & [24<=Cabins | [[10<=Dress & 28<=Out] & [WaitBag<=Cabins | Out<=39]]]] | [~ [Bags<=7] | ~ [20<=Cabins]]] & ~ [InBath<=34]]]]]]
normalized: ~ [E [true U [[[~ [InBath<=34] & [[~ [20<=Cabins] | ~ [Bags<=7]] | [[24<=Cabins | [[WaitBag<=Cabins | Out<=39] & [10<=Dress & 28<=Out]]] & ~ [15<=WaitBag]]]] & [17<=Out & [Dress<=17 & ~ [[[34<=Dressed & ~ [Dress<=Bags]] & [[Bags<=12 & 15<=Dressed] | [InBath<=14 & Dressed<=Cabins]]]]]]] & [[[[7<=InBath | [[~ [WaitBag<=6] | ~ [Dress<=33]] & ~ [Bags<=InBath]]] & [[17<=Dressed | ~ [[WaitBag<=27 | Entered<=InBath]]] & ~ [InBath<=InBath]]] | [Entered<=39 | [Bags<=20 | [[10<=Dressed & [Bags<=Undress & 16<=Bags]] | ~ [[34<=Entered & 12<=Out]]]]]] & [Dress<=WaitBag & [7<=InBath | ~ [[[Dressed<=15 | 17<=Dressed] & [14<=Bags | WaitBag<=Undress]]]]]]]]]

abstracting: (WaitBag<=Undress)
states: 1,836,681 (6)
abstracting: (14<=Bags)
states: 1,979,667 (6)
abstracting: (17<=Dressed)
states: 8,554 (3)
abstracting: (Dressed<=15)
states: 3,390,601 (6)
abstracting: (7<=InBath)
states: 1,771,627 (6)
abstracting: (Dress<=WaitBag)
states: 1,904,034 (6)
abstracting: (12<=Out)
states: 1,037,806 (6)
abstracting: (34<=Entered)
states: 924
abstracting: (16<=Bags)
states: 1,631,728 (6)
abstracting: (Bags<=Undress)
states: 409,654 (5)
abstracting: (10<=Dressed)
states: 278,278 (5)
abstracting: (Bags<=20)
states: 2,636,634 (6)
abstracting: (Entered<=39)
states: 3,408,030 (6)
abstracting: (InBath<=InBath)
states: 3,408,031 (6)
abstracting: (Entered<=InBath)
states: 1,713,745 (6)
abstracting: (WaitBag<=27)
states: 3,408,031 (6)
abstracting: (17<=Dressed)
states: 8,554 (3)
abstracting: (Bags<=InBath)
states: 1,023,814 (6)
abstracting: (Dress<=33)
states: 3,408,031 (6)
abstracting: (WaitBag<=6)
states: 2,711,149 (6)
abstracting: (7<=InBath)
states: 1,771,627 (6)
abstracting: (Dressed<=Cabins)
states: 2,115,355 (6)
abstracting: (InBath<=14)
states: 2,863,504 (6)
abstracting: (15<=Dressed)
states: 31,962 (4)
abstracting: (Bags<=12)
states: 1,262,836 (6)
abstracting: (Dress<=Bags)
states: 3,074,288 (6)
abstracting: (34<=Dressed)
states: 0
abstracting: (Dress<=17)
states: 3,405,141 (6)
abstracting: (17<=Out)
states: 453,376 (5)
abstracting: (15<=WaitBag)
states: 31,962 (4)
abstracting: (28<=Out)
states: 18,564 (4)
abstracting: (10<=Dress)
states: 254,254 (5)
abstracting: (Out<=39)
states: 3,408,030 (6)
abstracting: (WaitBag<=Cabins)
states: 2,115,355 (6)
abstracting: (24<=Cabins)
states: 0
abstracting: (Bags<=7)
states: 574,410 (5)
abstracting: (20<=Cabins)
states: 806
abstracting: (InBath<=34)
states: 3,408,031 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.993sec

checking: AG [[~ [[[[[[Undress<=40 | [[Bags<=18 & 28<=Dress] | [3<=Cabins & Out<=Bags]]] & ~ [[10<=Cabins & ~ [WaitBag<=16]]]] & ~ [Cabins<=1]] & [~ [[Out<=Dress | [[Dress<=Undress | 12<=Dressed] | [Bags<=Dress | 38<=WaitBag]]]] & [[[~ [Entered<=24] | [Dressed<=13 | 14<=Out]] & [[11<=Bags & 18<=Dress] & Undress<=25]] & ~ [[Out<=16 | Undress<=Out]]]]] & [[~ [[Dress<=2 & [32<=Undress | ~ [Dress<=Out]]]] | ~ [[~ [[31<=InBath | Cabins<=Dress]] | Dress<=Cabins]]] | Entered<=Undress]]] | ~ [[Bags<=Dress & ~ [[Bags<=WaitBag | [[35<=Dressed | [WaitBag<=Entered & [Dressed<=14 & Undress<=13]]] & [~ [[22<=Dressed & WaitBag<=40]] & 22<=Undress]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[Bags<=Dress & ~ [[Bags<=WaitBag | [[22<=Undress & ~ [[22<=Dressed & WaitBag<=40]]] & [35<=Dressed | [WaitBag<=Entered & [Dressed<=14 & Undress<=13]]]]]]]] | ~ [[[Entered<=Undress | [~ [[Dress<=Cabins | ~ [[31<=InBath | Cabins<=Dress]]]] | ~ [[Dress<=2 & [32<=Undress | ~ [Dress<=Out]]]]]] & [[[~ [[Out<=16 | Undress<=Out]] & [[Undress<=25 & [11<=Bags & 18<=Dress]] & [[Dressed<=13 | 14<=Out] | ~ [Entered<=24]]]] & ~ [[Out<=Dress | [[Bags<=Dress | 38<=WaitBag] | [Dress<=Undress | 12<=Dressed]]]]] & [~ [Cabins<=1] & [~ [[10<=Cabins & ~ [WaitBag<=16]]] & [Undress<=40 | [[3<=Cabins & Out<=Bags] | [Bags<=18 & 28<=Dress]]]]]]]]]]]]

abstracting: (28<=Dress)
states: 0
abstracting: (Bags<=18)
states: 2,306,931 (6)
abstracting: (Out<=Bags)
states: 2,752,893 (6)
abstracting: (3<=Cabins)
states: 2,277,408 (6)
abstracting: (Undress<=40)
states: 3,408,031 (6)
abstracting: (WaitBag<=16)
states: 3,399,477 (6)
abstracting: (10<=Cabins)
states: 539,539 (5)
abstracting: (Cabins<=1)
states: 774,554 (5)
abstracting: (12<=Dressed)
states: 132,693 (5)
abstracting: (Dress<=Undress)
states: 1,872,733 (6)
abstracting: (38<=WaitBag)
states: 0
abstracting: (Bags<=Dress)
states: 409,654 (5)
abstracting: (Out<=Dress)
states: 1,021,350 (6)
abstracting: (Entered<=24)
states: 3,353,767 (6)
abstracting: (14<=Out)
states: 772,156 (5)
abstracting: (Dressed<=13)
states: 3,353,767 (6)
abstracting: (18<=Dress)
states: 2,890 (3)
abstracting: (11<=Bags)
states: 2,451,064 (6)
abstracting: (Undress<=25)
states: 3,408,031 (6)
abstracting: (Undress<=Out)
states: 2,598,673 (6)
abstracting: (Out<=16)
states: 2,954,655 (6)
abstracting: (Dress<=Out)
states: 2,598,673 (6)
abstracting: (32<=Undress)
states: 0
abstracting: (Dress<=2)
states: 1,604,635 (6)
abstracting: (Cabins<=Dress)
states: 1,520,810 (6)
abstracting: (31<=InBath)
states: 0
abstracting: (Dress<=Cabins)
states: 2,151,407 (6)
abstracting: (Entered<=Undress)
states: 1,021,350 (6)
abstracting: (Undress<=13)
states: 3,360,907 (6)
abstracting: (Dressed<=14)
states: 3,376,069 (6)
abstracting: (WaitBag<=Entered)
states: 2,556,120 (6)
abstracting: (35<=Dressed)
states: 0
abstracting: (WaitBag<=40)
states: 3,408,031 (6)
abstracting: (22<=Dressed)
states: 0
abstracting: (22<=Undress)
states: 0
abstracting: (Bags<=WaitBag)
states: 250,393 (5)
abstracting: (Bags<=Dress)
states: 409,654 (5)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.575sec

checking: EF [[[~ [[26<=Out & Out<=Entered]] | [[~ [[InBath<=Dress | [[Dress<=19 & [Undress<=15 | WaitBag<=17]] | [~ [Dress<=Dress] & ~ [Cabins<=InBath]]]]] & [[[[InBath<=11 & [12<=Cabins & Bags<=Bags]] | ~ [[29<=Bags | 23<=Bags]]] & [36<=InBath | [[Bags<=InBath & Dressed<=11] & [31<=Undress & Entered<=Undress]]]] | ~ [Out<=6]]] & [1<=Dress | ~ [[[[6<=Undress | 25<=InBath] & [Out<=20 | 25<=WaitBag]] & 14<=Dress]]]]] & [[[[Entered<=22 & [19<=InBath | [[~ [30<=Out] & [Dress<=Undress | WaitBag<=WaitBag]] & 13<=Dress]]] | [~ [[Out<=28 & [[33<=InBath & Dress<=2] | [Out<=Entered & Bags<=Entered]]]] | [[~ [26<=InBath] | Out<=36] & [~ [[40<=InBath & Out<=Entered]] | ~ [Undress<=Entered]]]]] & 32<=Bags] | Out<=Dressed]]]
normalized: E [true U [[Out<=Dressed | [32<=Bags & [[[[~ [Undress<=Entered] | ~ [[40<=InBath & Out<=Entered]]] & [Out<=36 | ~ [26<=InBath]]] | ~ [[Out<=28 & [[Out<=Entered & Bags<=Entered] | [33<=InBath & Dress<=2]]]]] | [Entered<=22 & [19<=InBath | [13<=Dress & [[Dress<=Undress | WaitBag<=WaitBag] & ~ [30<=Out]]]]]]]] & [[[1<=Dress | ~ [[14<=Dress & [[Out<=20 | 25<=WaitBag] & [6<=Undress | 25<=InBath]]]]] & [[~ [Out<=6] | [[36<=InBath | [[31<=Undress & Entered<=Undress] & [Bags<=InBath & Dressed<=11]]] & [~ [[29<=Bags | 23<=Bags]] | [InBath<=11 & [12<=Cabins & Bags<=Bags]]]]] & ~ [[InBath<=Dress | [[~ [Cabins<=InBath] & ~ [Dress<=Dress]] | [Dress<=19 & [Undress<=15 | WaitBag<=17]]]]]]] | ~ [[26<=Out & Out<=Entered]]]]]

abstracting: (Out<=Entered)
states: 1,762,888 (6)
abstracting: (26<=Out)
states: 38,760 (4)
abstracting: (WaitBag<=17)
states: 3,404,433 (6)
abstracting: (Undress<=15)
states: 3,393,415 (6)
abstracting: (Dress<=19)
states: 3,407,855 (6)
abstracting: (Dress<=Dress)
states: 3,408,031 (6)
abstracting: (Cabins<=InBath)
states: 2,338,347 (6)
abstracting: (InBath<=Dress)
states: 1,112,692 (6)
abstracting: (Bags<=Bags)
states: 3,408,031 (6)
abstracting: (12<=Cabins)
states: 291,390 (5)
abstracting: (InBath<=11)
states: 2,486,274 (6)
abstracting: (23<=Bags)
states: 485,100 (5)
abstracting: (29<=Bags)
states: 24,031 (4)
abstracting: (Dressed<=11)
states: 3,275,338 (6)
abstracting: (Bags<=InBath)
states: 1,023,814 (6)
abstracting: (Entered<=Undress)
states: 1,021,350 (6)
abstracting: (31<=Undress)
states: 0
abstracting: (36<=InBath)
states: 0
abstracting: (Out<=6)
states: 1,523,361 (6)
abstracting: (25<=InBath)
states: 22,232 (4)
abstracting: (6<=Undress)
states: 861,582 (5)
abstracting: (25<=WaitBag)
states: 0
abstracting: (Out<=20)
states: 3,230,931 (6)
abstracting: (14<=Dress)
states: 47,124 (4)
abstracting: (1<=Dress)
states: 2,782,912 (6)
abstracting: (30<=Out)
states: 8,008 (3)
abstracting: (WaitBag<=WaitBag)
states: 3,408,031 (6)
abstracting: (Dress<=Undress)
states: 1,872,733 (6)
abstracting: (13<=Dress)
states: 76,560 (4)
abstracting: (19<=InBath)
states: 210,067 (5)
abstracting: (Entered<=22)
states: 3,307,084 (6)
abstracting: (Dress<=2)
states: 1,604,635 (6)
abstracting: (33<=InBath)
states: 0
abstracting: (Bags<=Entered)
states: 815,815 (5)
abstracting: (Out<=Entered)
states: 1,762,888 (6)
abstracting: (Out<=28)
states: 3,395,655 (6)
abstracting: (26<=InBath)
states: 13,020 (4)
abstracting: (Out<=36)
states: 3,407,947 (6)
abstracting: (Out<=Entered)
states: 1,762,888 (6)
abstracting: (40<=InBath)
states: 0
abstracting: (Undress<=Entered)
states: 2,598,673 (6)
abstracting: (32<=Bags)
states: 0
abstracting: (Out<=Dressed)
states: 1,054,144 (6)
-> the formula is TRUE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.505sec

checking: EF [[[[[[~ [Entered<=38] | Entered<=WaitBag] | [[[[[Bags<=Dressed & Out<=Bags] | [InBath<=Cabins & Out<=10]] & [~ [Undress<=25] | ~ [InBath<=Dressed]]] & [~ [Undress<=11] | [~ [Bags<=Cabins] & [Dress<=29 & Dressed<=Undress]]]] | ~ [[[[InBath<=32 & 4<=InBath] | [14<=Dressed & Dressed<=40]] | [[Dressed<=22 | Dressed<=Undress] | [3<=Entered & Dressed<=4]]]]]] | [[Entered<=Out & Bags<=InBath] & [[[36<=Bags & ~ [[Undress<=29 & Dressed<=30]]] & ~ [[Dress<=25 | 3<=Cabins]]] | [[~ [[Cabins<=Cabins & 5<=Cabins]] & [~ [InBath<=Undress] & [Entered<=11 | 28<=Bags]]] & [11<=Cabins | [Undress<=Cabins & [26<=Cabins & Dress<=36]]]]]]] | ~ [[~ [[[~ [[WaitBag<=18 | 24<=Bags]] | [[31<=Dress | WaitBag<=20] & [Entered<=23 | 21<=Cabins]]] | ~ [[~ [Dressed<=2] & Dressed<=Out]]]] & Dress<=Out]]] & [[[~ [[Dress<=20 | ~ [23<=Out]]] & ~ [[~ [[~ [37<=InBath] | [Dressed<=2 & 15<=Out]]] & [[~ [Cabins<=InBath] & [18<=WaitBag & 14<=WaitBag]] | 15<=Dress]]]] & [[~ [26<=Out] | ~ [Dress<=39]] & ~ [[[~ [[11<=Undress | WaitBag<=Bags]] | [[Undress<=Undress & Undress<=36] & ~ [37<=Bags]]] & ~ [[Entered<=36 & ~ [Entered<=38]]]]]]] & [~ [Entered<=16] & Undress<=Cabins]]]]
normalized: E [true U [[[Undress<=Cabins & ~ [Entered<=16]] & [[~ [[~ [[Entered<=36 & ~ [Entered<=38]]] & [[~ [37<=Bags] & [Undress<=Undress & Undress<=36]] | ~ [[11<=Undress | WaitBag<=Bags]]]]] & [~ [Dress<=39] | ~ [26<=Out]]] & [~ [[[15<=Dress | [[18<=WaitBag & 14<=WaitBag] & ~ [Cabins<=InBath]]] & ~ [[[Dressed<=2 & 15<=Out] | ~ [37<=InBath]]]]] & ~ [[Dress<=20 | ~ [23<=Out]]]]]] & [~ [[Dress<=Out & ~ [[~ [[Dressed<=Out & ~ [Dressed<=2]]] | [[[Entered<=23 | 21<=Cabins] & [31<=Dress | WaitBag<=20]] | ~ [[WaitBag<=18 | 24<=Bags]]]]]]] | [[[[[11<=Cabins | [Undress<=Cabins & [26<=Cabins & Dress<=36]]] & [[[Entered<=11 | 28<=Bags] & ~ [InBath<=Undress]] & ~ [[Cabins<=Cabins & 5<=Cabins]]]] | [~ [[Dress<=25 | 3<=Cabins]] & [36<=Bags & ~ [[Undress<=29 & Dressed<=30]]]]] & [Entered<=Out & Bags<=InBath]] | [[~ [[[[3<=Entered & Dressed<=4] | [Dressed<=22 | Dressed<=Undress]] | [[14<=Dressed & Dressed<=40] | [InBath<=32 & 4<=InBath]]]] | [[[[Dress<=29 & Dressed<=Undress] & ~ [Bags<=Cabins]] | ~ [Undress<=11]] & [[~ [InBath<=Dressed] | ~ [Undress<=25]] & [[InBath<=Cabins & Out<=10] | [Bags<=Dressed & Out<=Bags]]]]] | [Entered<=WaitBag | ~ [Entered<=38]]]]]]]

abstracting: (Entered<=38)
states: 3,408,024 (6)
abstracting: (Entered<=WaitBag)
states: 1,054,144 (6)
abstracting: (Out<=Bags)
states: 2,752,893 (6)
abstracting: (Bags<=Dressed)
states: 250,393 (5)
abstracting: (Out<=10)
states: 2,221,461 (6)
abstracting: (InBath<=Cabins)
states: 1,292,830 (6)
abstracting: (Undress<=25)
states: 3,408,031 (6)
abstracting: (InBath<=Dressed)
states: 1,115,730 (6)
abstracting: (Undress<=11)
states: 3,289,495 (6)
abstracting: (Bags<=Cabins)
states: 420,224 (5)
abstracting: (Dressed<=Undress)
states: 1,836,681 (6)
abstracting: (Dress<=29)
states: 3,408,031 (6)
abstracting: (4<=InBath)
states: 2,409,187 (6)
abstracting: (InBath<=32)
states: 3,408,031 (6)
abstracting: (Dressed<=40)
states: 3,408,031 (6)
abstracting: (14<=Dressed)
states: 54,264 (4)
abstracting: (Dressed<=Undress)
states: 1,836,681 (6)
abstracting: (Dressed<=22)
states: 3,408,031 (6)
abstracting: (Dressed<=4)
states: 2,237,539 (6)
abstracting: (3<=Entered)
states: 2,720,662 (6)
abstracting: (Bags<=InBath)
states: 1,023,814 (6)
abstracting: (Entered<=Out)
states: 1,762,888 (6)
abstracting: (Dressed<=30)
states: 3,408,031 (6)
abstracting: (Undress<=29)
states: 3,408,031 (6)
abstracting: (36<=Bags)
states: 0
abstracting: (3<=Cabins)
states: 2,277,408 (6)
abstracting: (Dress<=25)
states: 3,408,031 (6)
abstracting: (5<=Cabins)
states: 1,640,360 (6)
abstracting: (Cabins<=Cabins)
states: 3,408,031 (6)
abstracting: (InBath<=Undress)
states: 1,112,692 (6)
abstracting: (28<=Bags)
states: 56,410 (4)
abstracting: (Entered<=11)
states: 2,370,225 (6)
abstracting: (Dress<=36)
states: 3,408,031 (6)
abstracting: (26<=Cabins)
states: 0
abstracting: (Undress<=Cabins)
states: 2,151,407 (6)
abstracting: (11<=Cabins)
states: 402,974 (5)
abstracting: (24<=Bags)
states: 363,888 (5)
abstracting: (WaitBag<=18)
states: 3,406,854 (6)
abstracting: (WaitBag<=20)
states: 3,408,031 (6)
abstracting: (31<=Dress)
states: 0
abstracting: (21<=Cabins)
states: 0
abstracting: (Entered<=23)
states: 3,333,418 (6)
abstracting: (Dressed<=2)
states: 1,551,022 (6)
abstracting: (Dressed<=Out)
states: 2,556,120 (6)
abstracting: (Dress<=Out)
states: 2,598,673 (6)
abstracting: (23<=Out)
states: 100,947 (5)
abstracting: (Dress<=20)
states: 3,408,031 (6)
abstracting: (37<=InBath)
states: 0
abstracting: (15<=Out)
states: 655,270 (5)
abstracting: (Dressed<=2)
states: 1,551,022 (6)
abstracting: (Cabins<=InBath)
states: 2,338,347 (6)
abstracting: (14<=WaitBag)
states: 54,264 (4)
abstracting: (18<=WaitBag)
states: 3,598 (3)
abstracting: (15<=Dress)
states: 27,300 (4)
abstracting: (26<=Out)
states: 38,760 (4)
abstracting: (Dress<=39)
states: 3,408,031 (6)
abstracting: (WaitBag<=Bags)
states: 3,233,307 (6)
abstracting: (11<=Undress)
states: 176,462 (5)
abstracting: (Undress<=36)
states: 3,408,031 (6)
abstracting: (Undress<=Undress)
states: 3,408,031 (6)
abstracting: (37<=Bags)
states: 0
abstracting: (Entered<=38)
states: 3,408,024 (6)
abstracting: (Entered<=36)
states: 3,407,947 (6)
abstracting: (Entered<=16)
states: 2,954,655 (6)
abstracting: (Undress<=Cabins)
states: 2,151,407 (6)
-> the formula is FALSE

FORMULA SwimmingPool-PT-02-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.209sec

totally nodes used: 2897456 (2.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 52279189 7785764 60064953
used/not used/entry size/cache size: 8211576 58897288 16 1024MB
basic ops cache: hits/miss/sum: 63076604 14904745 77981349
used/not used/entry size/cache size: 11043861 5733355 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: 9108164 1223696 10331860
used/not used/entry size/cache size: 1100202 7288406 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 64757027
1 2062994
2 193935
3 48937
4 20304
5 9322
6 5174
7 3306
8 1880
9 1315
>= 10 4670

Total processing time: 0m38.277sec


BK_STOP 1679241231088

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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:1007 (143), effective:240 (34)

initing FirstDep: 0m 0.000sec


iterations count:618 (88), effective:159 (22)

iterations count:276 (39), effective:66 (9)

iterations count:499 (71), effective:157 (22)

iterations count:647 (92), effective:208 (29)

iterations count:874 (124), effective:242 (34)

iterations count:457 (65), effective:115 (16)

iterations count:481 (68), effective:147 (21)

iterations count:487 (69), effective:120 (17)

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-02"
export BK_EXAMINATION="ReachabilityCardinality"
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-02, examination is ReachabilityCardinality"
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-167912708500334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SwimmingPool-PT-02.tgz
mv SwimmingPool-PT-02 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;