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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 5.6K Feb 26 03:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 26 03:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 03:42 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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 16K Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Feb 26 03:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 03:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 03:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K 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-03-ReachabilityCardinality-00
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-01
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-02
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-03
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-04
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-05
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-06
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-07
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-08
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-09
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-10
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-11
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-12
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-13
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-14
FORMULA_NAME SwimmingPool-PT-03-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679241305866

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-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 15:55:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 15:55:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 15:55:07] [INFO ] Load time of PNML (sax parser for PT used): 16 ms
[2023-03-19 15:55:07] [INFO ] Transformed 9 places.
[2023-03-19 15:55:07] [INFO ] Transformed 7 transitions.
[2023-03-19 15:55:07] [INFO ] Parsed PT model containing 9 places and 7 transitions and 20 arcs in 77 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10009 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 16) seen :11
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :1
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 7 rows 9 cols
[2023-03-19 15:55:07] [INFO ] Computed 3 place invariants in 4 ms
[2023-03-19 15:55:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-19 15:55:08] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA SwimmingPool-PT-03-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 859 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_03
(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.723sec


RS generation: 0m14.933sec


-> reachability set: #nodes 141394 (1.4e+05) #states 32,209,356 (7)



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

checking: AG [Dressed<=56]
normalized: ~ [E [true U ~ [Dressed<=56]]]

abstracting: (Dressed<=56)
states: 32,209,356 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.187sec

checking: AG [~ [19<=Dressed]]
normalized: ~ [E [true U 19<=Dressed]]

abstracting: (19<=Dressed)
states: 778,141 (5)
-> the formula is FALSE

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

MC time: 0m13.974sec

checking: EF [42<=Entered]
normalized: E [true U 42<=Entered]

abstracting: (42<=Entered)
states: 134,596 (5)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.534sec

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

abstracting: (39<=InBath)
states: 90,174 (4)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.938sec

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

abstracting: (Dressed<=Cabins)
states: 19,586,652 (7)
-> the formula is FALSE

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

MC time: 0m11.132sec

checking: EF [Bags<=WaitBag]
normalized: E [true U Bags<=WaitBag]

abstracting: (Bags<=WaitBag)
states: 2,139,144 (6)
-> the formula is TRUE

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

MC time: 0m 1.916sec

checking: EF [~ [[Bags<=26 | Dress<=24]]]
normalized: E [true U ~ [[Bags<=26 | Dress<=24]]]

abstracting: (Dress<=24)
states: 32,154,336 (7)
abstracting: (Bags<=26)
states: 20,594,599 (7)
-> the formula is FALSE

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

MC time: 0m 0.375sec

checking: EF [[~ [InBath<=36] & WaitBag<=Dress]]
normalized: E [true U [WaitBag<=Dress & ~ [InBath<=36]]]

abstracting: (InBath<=36)
states: 32,015,448 (7)
abstracting: (WaitBag<=Dress)
states: 16,886,916 (7)
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.363sec

checking: AG [[InBath<=WaitBag | ~ [Cabins<=10]]]
normalized: ~ [E [true U ~ [[InBath<=WaitBag | ~ [Cabins<=10]]]]]

abstracting: (Cabins<=10)
states: 23,021,009 (7)
abstracting: (InBath<=WaitBag)
states: 10,063,592 (7)
-> the formula is FALSE

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

MC time: 0m16.993sec

checking: AG [~ [[~ [[~ [[[[WaitBag<=55 & Bags<=Dressed] & InBath<=Out] & [[InBath<=40 & 19<=Bags] | Undress<=Cabins]]] | WaitBag<=Dress]] | [Dressed<=9 & 40<=InBath]]]]
normalized: ~ [E [true U [[Dressed<=9 & 40<=InBath] | ~ [[WaitBag<=Dress | ~ [[[Undress<=Cabins | [InBath<=40 & 19<=Bags]] & [InBath<=Out & [WaitBag<=55 & Bags<=Dressed]]]]]]]]]

abstracting: (Bags<=Dressed)
states: 2,139,144 (6)
abstracting: (WaitBag<=55)
states: 32,209,356 (7)
abstracting: (InBath<=Out)
states: 17,060,928 (7)
abstracting: (19<=Bags)
states: 20,559,231 (7)
abstracting: (InBath<=40)
states: 32,175,056 (7)
abstracting: (Undress<=Cabins)
states: 19,905,168 (7)
abstracting: (WaitBag<=Dress)
states: 16,886,916 (7)
abstracting: (40<=InBath)
states: 57,442 (4)
abstracting: (Dressed<=9)
states: 25,458,038 (7)
-> the formula is FALSE

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

MC time: 0m 8.263sec

checking: EF [[[Bags<=Entered & ~ [[~ [[~ [56<=Dress] | [[Dressed<=49 | [Bags<=7 | Dress<=InBath]] | [~ [Cabins<=Entered] | ~ [WaitBag<=45]]]]] | ~ [[InBath<=39 | [[WaitBag<=60 | [WaitBag<=InBath | 51<=Undress]] | [~ [Bags<=6] & ~ [Bags<=50]]]]]]]] & Cabins<=16]]
normalized: E [true U [Cabins<=16 & [Bags<=Entered & ~ [[~ [[InBath<=39 | [[~ [Bags<=50] & ~ [Bags<=6]] | [WaitBag<=60 | [WaitBag<=InBath | 51<=Undress]]]]] | ~ [[[[~ [WaitBag<=45] | ~ [Cabins<=Entered]] | [Dressed<=49 | [Bags<=7 | Dress<=InBath]]] | ~ [56<=Dress]]]]]]]]

abstracting: (56<=Dress)
states: 0
abstracting: (Dress<=InBath)
states: 23,600,892 (7)
abstracting: (Bags<=7)
states: 2,985,294 (6)
abstracting: (Dressed<=49)
states: 32,209,356 (7)
abstracting: (Cabins<=Entered)
states: 22,723,424 (7)
abstracting: (WaitBag<=45)
states: 32,209,356 (7)
abstracting: (51<=Undress)
states: 0
abstracting: (WaitBag<=InBath)
states: 23,583,420 (7)
abstracting: (WaitBag<=60)
states: 32,209,356 (7)
abstracting: (Bags<=6)
states: 2,469,404 (6)
abstracting: (Bags<=50)
states: 32,209,356 (7)
abstracting: (InBath<=39)
states: 32,151,914 (7)
abstracting: (Bags<=Entered)
states: 7,276,272 (6)
abstracting: (Cabins<=16)
states: 29,231,976 (7)
-> the formula is TRUE

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

MC time: 0m 6.964sec

checking: EF [~ [[[~ [[[[[52<=Cabins & Entered<=Dressed] | [Bags<=InBath & Undress<=Bags]] | 30<=Bags] & [47<=Dressed | [~ [56<=Entered] | 43<=InBath]]]] | [~ [[~ [19<=Undress] & ~ [[Dressed<=21 & Cabins<=Dress]]]] & 49<=Out]] | [[26<=Bags | [[[[9<=Undress & 29<=InBath] & 58<=Dress] | ~ [[Cabins<=38 | Undress<=28]]] & InBath<=57]] & ~ [[~ [[[28<=Cabins & Entered<=35] | ~ [InBath<=Undress]]] & [~ [Dressed<=Dress] & 46<=InBath]]]]]]]
normalized: E [true U ~ [[[~ [[[46<=InBath & ~ [Dressed<=Dress]] & ~ [[~ [InBath<=Undress] | [28<=Cabins & Entered<=35]]]]] & [26<=Bags | [InBath<=57 & [~ [[Cabins<=38 | Undress<=28]] | [58<=Dress & [9<=Undress & 29<=InBath]]]]]] | [[49<=Out & ~ [[~ [[Dressed<=21 & Cabins<=Dress]] & ~ [19<=Undress]]]] | ~ [[[47<=Dressed | [43<=InBath | ~ [56<=Entered]]] & [30<=Bags | [[Bags<=InBath & Undress<=Bags] | [52<=Cabins & Entered<=Dressed]]]]]]]]]

abstracting: (Entered<=Dressed)
states: 9,540,770 (6)
abstracting: (52<=Cabins)
states: 0
abstracting: (Undress<=Bags)
states: 29,077,132 (7)
abstracting: (Bags<=InBath)
states: 9,504,768 (6)
abstracting: (30<=Bags)
states: 8,318,508 (6)
abstracting: (56<=Entered)
states: 210
abstracting: (43<=InBath)
states: 8,943 (3)
abstracting: (47<=Dressed)
states: 0
abstracting: (19<=Undress)
states: 689,416 (5)
abstracting: (Cabins<=Dress)
states: 14,034,660 (7)
abstracting: (Dressed<=21)
states: 31,937,568 (7)
abstracting: (49<=Out)
states: 12,376 (4)
abstracting: (29<=InBath)
states: 1,616,904 (6)
abstracting: (9<=Undress)
states: 7,698,780 (6)
abstracting: (58<=Dress)
states: 0
abstracting: (Undress<=28)
states: 32,207,414 (7)
abstracting: (Cabins<=38)
states: 32,209,356 (7)
abstracting: (InBath<=57)
states: 32,209,356 (7)
abstracting: (26<=Bags)
states: 12,756,359 (7)
abstracting: (Entered<=35)
states: 31,615,581 (7)
abstracting: (28<=Cabins)
states: 25,288 (4)
abstracting: (InBath<=Undress)
states: 10,041,086 (7)
abstracting: (Dressed<=Dress)
states: 16,886,916 (7)
abstracting: (46<=InBath)
states: 0
-> the formula is TRUE

FORMULA SwimmingPool-PT-03-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.837sec

checking: EF [[[~ [[Undress<=4 | [~ [Bags<=46] | ~ [[~ [34<=Dressed] & [~ [Out<=Out] & ~ [49<=Dress]]]]]]] & [[[[[~ [[Dress<=Entered & Dress<=Dress]] | WaitBag<=InBath] | ~ [Bags<=Entered]] & ~ [[~ [[Entered<=Dress & InBath<=20]] & [[10<=InBath & InBath<=11] | Undress<=Dress]]]] & 47<=Cabins] & [[~ [Dressed<=24] & ~ [[[~ [Dressed<=Bags] & InBath<=2] | ~ [[Out<=21 & 46<=Undress]]]]] & ~ [[[~ [5<=InBath] & ~ [[Out<=22 & 41<=Dressed]]] | ~ [[[Cabins<=Undress & Cabins<=22] & [Dress<=WaitBag | Entered<=59]]]]]]]] | 34<=Dressed]]
normalized: E [true U [34<=Dressed | [[[~ [[~ [[[Cabins<=Undress & Cabins<=22] & [Dress<=WaitBag | Entered<=59]]] | [~ [[Out<=22 & 41<=Dressed]] & ~ [5<=InBath]]]] & [~ [[~ [[Out<=21 & 46<=Undress]] | [InBath<=2 & ~ [Dressed<=Bags]]]] & ~ [Dressed<=24]]] & [47<=Cabins & [~ [[[Undress<=Dress | [10<=InBath & InBath<=11]] & ~ [[Entered<=Dress & InBath<=20]]]] & [~ [Bags<=Entered] | [WaitBag<=InBath | ~ [[Dress<=Entered & Dress<=Dress]]]]]]] & ~ [[Undress<=4 | [~ [[[~ [49<=Dress] & ~ [Out<=Out]] & ~ [34<=Dressed]]] | ~ [Bags<=46]]]]]]]

abstracting: (Bags<=46)
states: 32,209,356 (7)
abstracting: (34<=Dressed)
states: 0
abstracting: (Out<=Out)
states: 32,209,356 (7)
abstracting: (49<=Dress)
states: 0
abstracting: (Undress<=4)
states: 16,837,896 (7)
abstracting: (Dress<=Dress)
states: 32,209,356 (7)
abstracting: (Dress<=Entered)
states: 24,346,584 (7)
abstracting: (WaitBag<=InBath)
states: 23,583,420 (7)
abstracting: (Bags<=Entered)
states: 7,276,272 (6)
abstracting: (InBath<=20)
states: 26,269,950 (7)
abstracting: (Entered<=Dress)
states: 9,231,272 (6)
abstracting: (InBath<=11)
states: 17,530,128 (7)
abstracting: (10<=InBath)
states: 17,137,156 (7)
abstracting: (Undress<=Dress)
states: 17,205,432 (7)
abstracting: (47<=Cabins)
states: 0
abstracting: (Dressed<=24)
states: 32,142,744 (7)
abstracting: (Dressed<=Bags)
states: 30,542,540 (7)
abstracting: (InBath<=2)
states: 5,008,608 (6)
abstracting: (46<=Undress)
states: 0
abstracting: (Out<=21)
states: 25,994,972 (7)
abstracting: (5<=InBath)
states: 24,093,556 (7)
abstracting: (41<=Dressed)
states: 0
abstracting: (Out<=22)
states: 26,690,612 (7)
abstracting: (Entered<=59)
states: 32,209,355 (7)
abstracting: (Dress<=WaitBag)
states: 17,494,428 (7)
abstracting: (Cabins<=22)
states: 31,720,560 (7)
abstracting: (Cabins<=Undress)
states: 14,034,660 (7)
abstracting: (34<=Dressed)
states: 0
-> the formula is FALSE

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

MC time: 0m24.017sec

checking: EF [[[Dress<=57 | ~ [[[~ [[~ [Dressed<=Entered] & [4<=InBath & 29<=Entered]]] & [[[Cabins<=17 & 34<=Dress] | 13<=Dress] | [[Cabins<=13 & Dressed<=15] & Bags<=28]]] | Bags<=47]]] & [[[[[WaitBag<=15 | [[[35<=Dress | Dressed<=Bags] & [InBath<=34 & 8<=Dressed]] | [[WaitBag<=Out & Dressed<=Dressed] | InBath<=Entered]]] | [~ [[Out<=49 | 37<=Cabins]] | ~ [30<=Bags]]] | Out<=Undress] & Cabins<=44] & [~ [[~ [26<=Dressed] | [[~ [30<=Dressed] | ~ [Entered<=9]] & ~ [6<=Undress]]]] & ~ [[[[Cabins<=29 & Out<=Cabins] | [Undress<=InBath & InBath<=15]] | [Dressed<=0 | [Undress<=Dressed & 1<=Cabins]]]]]]]]
normalized: E [true U [[[~ [[[Dressed<=0 | [Undress<=Dressed & 1<=Cabins]] | [[Undress<=InBath & InBath<=15] | [Cabins<=29 & Out<=Cabins]]]] & ~ [[[~ [6<=Undress] & [~ [Entered<=9] | ~ [30<=Dressed]]] | ~ [26<=Dressed]]]] & [Cabins<=44 & [Out<=Undress | [[~ [30<=Bags] | ~ [[Out<=49 | 37<=Cabins]]] | [WaitBag<=15 | [[InBath<=Entered | [WaitBag<=Out & Dressed<=Dressed]] | [[InBath<=34 & 8<=Dressed] & [35<=Dress | Dressed<=Bags]]]]]]]] & [Dress<=57 | ~ [[Bags<=47 | [[[Bags<=28 & [Cabins<=13 & Dressed<=15]] | [13<=Dress | [Cabins<=17 & 34<=Dress]]] & ~ [[[4<=InBath & 29<=Entered] & ~ [Dressed<=Entered]]]]]]]]]

abstracting: (Dressed<=Entered)
states: 23,975,868 (7)
abstracting: (29<=Entered)
states: 2,318,800 (6)
abstracting: (4<=InBath)
states: 25,623,964 (7)
abstracting: (34<=Dress)
states: 0
abstracting: (Cabins<=17)
states: 29,864,832 (7)
abstracting: (13<=Dress)
states: 3,403,488 (6)
abstracting: (Dressed<=15)
states: 30,398,856 (7)
abstracting: (Cabins<=13)
states: 26,675,397 (7)
abstracting: (Bags<=28)
states: 22,821,684 (7)
abstracting: (Bags<=47)
states: 32,209,356 (7)
abstracting: (Dress<=57)
states: 32,209,356 (7)
abstracting: (Dressed<=Bags)
states: 30,542,540 (7)
abstracting: (35<=Dress)
states: 0
abstracting: (8<=Dressed)
states: 9,703,392 (6)
abstracting: (InBath<=34)
states: 31,841,703 (7)
abstracting: (Dressed<=Dressed)
states: 32,209,356 (7)
abstracting: (WaitBag<=Out)
states: 23,975,868 (7)
abstracting: (InBath<=Entered)
states: 17,060,928 (7)
abstracting: (WaitBag<=15)
states: 30,398,856 (7)
abstracting: (37<=Cabins)
states: 0
abstracting: (Out<=49)
states: 32,201,348 (7)
abstracting: (30<=Bags)
states: 8,318,508 (6)
abstracting: (Out<=Undress)
states: 9,231,272 (6)
abstracting: (Cabins<=44)
states: 32,209,356 (7)
abstracting: (26<=Dressed)
states: 36,540 (4)
abstracting: (30<=Dressed)
states: 496
abstracting: (Entered<=9)
states: 14,061,296 (7)
abstracting: (6<=Undress)
states: 13,055,508 (7)
abstracting: (Out<=Cabins)
states: 10,854,432 (7)
abstracting: (Cabins<=29)
states: 32,207,585 (7)
abstracting: (InBath<=15)
states: 21,889,472 (7)
abstracting: (Undress<=InBath)
states: 23,600,892 (7)
abstracting: (1<=Cabins)
states: 29,580,904 (7)
abstracting: (Undress<=Dressed)
states: 17,494,428 (7)
abstracting: (Dressed<=0)
states: 3,983,264 (6)
-> the formula is TRUE

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

MC time: 0m42.123sec

checking: EF [~ [[[[[[[~ [47<=Undress] & WaitBag<=14] & [~ [[Dressed<=48 & WaitBag<=Dress]] & [~ [Dress<=51] & ~ [Dressed<=Entered]]]] & [~ [[[Entered<=WaitBag | 39<=InBath] & Cabins<=15]] & Bags<=Undress]] & [[WaitBag<=2 | WaitBag<=35] | ~ [[Bags<=Undress & [[39<=Dressed | 30<=WaitBag] & ~ [Dressed<=InBath]]]]]] | ~ [[[~ [[[Dressed<=InBath & Cabins<=Out] & [InBath<=5 & Entered<=Undress]]] | [~ [Undress<=1] & Bags<=InBath]] & [[~ [Entered<=51] & WaitBag<=WaitBag] & [[[InBath<=Entered & Dress<=48] & ~ [51<=WaitBag]] | ~ [[Dress<=Dressed | Bags<=59]]]]]]] | [~ [Entered<=Bags] | Cabins<=33]]]]
normalized: E [true U ~ [[[Cabins<=33 | ~ [Entered<=Bags]] | [~ [[[[~ [[Dress<=Dressed | Bags<=59]] | [~ [51<=WaitBag] & [InBath<=Entered & Dress<=48]]] & [WaitBag<=WaitBag & ~ [Entered<=51]]] & [[Bags<=InBath & ~ [Undress<=1]] | ~ [[[InBath<=5 & Entered<=Undress] & [Dressed<=InBath & Cabins<=Out]]]]]] | [[~ [[Bags<=Undress & [~ [Dressed<=InBath] & [39<=Dressed | 30<=WaitBag]]]] | [WaitBag<=2 | WaitBag<=35]] & [[Bags<=Undress & ~ [[Cabins<=15 & [Entered<=WaitBag | 39<=InBath]]]] & [[[~ [Dressed<=Entered] & ~ [Dress<=51]] & ~ [[Dressed<=48 & WaitBag<=Dress]]] & [WaitBag<=14 & ~ [47<=Undress]]]]]]]]]

abstracting: (47<=Undress)
states: 0
abstracting: (WaitBag<=14)
states: 29,887,632 (7)
abstracting: (WaitBag<=Dress)
states: 16,886,916 (7)
abstracting: (Dressed<=48)
states: 32,209,356 (7)
abstracting: (Dress<=51)
states: 32,209,356 (7)
abstracting: (Dressed<=Entered)
states: 23,975,868 (7)
abstracting: (39<=InBath)
states: 90,174 (4)
abstracting: (Entered<=WaitBag)
states: 9,540,770 (6)
abstracting: (Cabins<=15)
states: 28,493,700 (7)
abstracting: (Bags<=Undress)
states: 3,609,280 (6)
abstracting: (WaitBag<=35)
states: 32,209,356 (7)
abstracting: (WaitBag<=2)
states: 10,830,320 (7)
abstracting: (30<=WaitBag)
states: 496
abstracting: (39<=Dressed)
states: 0
abstracting: (Dressed<=InBath)
states: 23,583,420 (7)
abstracting: (Bags<=Undress)
states: 3,609,280 (6)
abstracting: (Cabins<=Out)
states: 22,723,424 (7)
abstracting: (Dressed<=InBath)
states: 23,583,420 (7)
abstracting: (Entered<=Undress)
states: 9,231,272 (6)
abstracting: (InBath<=5)
states: 9,599,832 (6)
abstracting: (Undress<=1)
states: 7,912,820 (6)
abstracting: (Bags<=InBath)
states: 9,504,768 (6)
abstracting: (Entered<=51)
states: 32,206,353 (7)
abstracting: (WaitBag<=WaitBag)
states: 32,209,356 (7)
abstracting: (Dress<=48)
states: 32,209,356 (7)
abstracting: (InBath<=Entered)
states: 17,060,928 (7)
abstracting: (51<=WaitBag)
states: 0
abstracting: (Bags<=59)
states: 32,209,356 (7)
abstracting: (Dress<=Dressed)
states: 17,494,428 (7)
abstracting: (Entered<=Bags)
states: 25,961,924 (7)
abstracting: (Cabins<=33)
states: 32,209,356 (7)
-> the formula is FALSE

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

MC time: 0m 7.861sec

checking: EF [[[[[[[[26<=Bags & Entered<=2] | [[54<=Undress | [Out<=2 & Bags<=13]] & ~ [[5<=Dressed & 16<=Out]]]] & ~ [[[~ [WaitBag<=58] | ~ [27<=Entered]] & Bags<=Dressed]]] & 52<=Undress] & [[[[[[Bags<=14 & Undress<=60] | Dress<=Bags] | [56<=InBath | [36<=Undress & Dress<=28]]] & ~ [[Dress<=6 | [49<=InBath & InBath<=14]]]] | [Dressed<=2 | [~ [22<=Bags] | ~ [Dressed<=12]]]] & [[~ [Undress<=50] | ~ [[~ [WaitBag<=WaitBag] & [Entered<=39 | Entered<=14]]]] & [[[[Dress<=54 | Cabins<=Dressed] | [Out<=Out & 58<=Dress]] | ~ [[Out<=WaitBag & Dressed<=Dress]]] | Dressed<=WaitBag]]]] | Cabins<=Dress] & ~ [15<=Out]]]
normalized: E [true U [~ [15<=Out] & [Cabins<=Dress | [[[[Dressed<=WaitBag | [~ [[Out<=WaitBag & Dressed<=Dress]] | [[Out<=Out & 58<=Dress] | [Dress<=54 | Cabins<=Dressed]]]] & [~ [[[Entered<=39 | Entered<=14] & ~ [WaitBag<=WaitBag]]] | ~ [Undress<=50]]] & [[Dressed<=2 | [~ [Dressed<=12] | ~ [22<=Bags]]] | [~ [[Dress<=6 | [49<=InBath & InBath<=14]]] & [[56<=InBath | [36<=Undress & Dress<=28]] | [Dress<=Bags | [Bags<=14 & Undress<=60]]]]]] & [52<=Undress & [~ [[Bags<=Dressed & [~ [27<=Entered] | ~ [WaitBag<=58]]]] & [[~ [[5<=Dressed & 16<=Out]] & [54<=Undress | [Out<=2 & Bags<=13]]] | [26<=Bags & Entered<=2]]]]]]]]

abstracting: (Entered<=2)
states: 4,472,241 (6)
abstracting: (26<=Bags)
states: 12,756,359 (7)
abstracting: (Bags<=13)
states: 7,027,188 (6)
abstracting: (Out<=2)
states: 4,472,241 (6)
abstracting: (54<=Undress)
states: 0
abstracting: (16<=Out)
states: 11,362,120 (7)
abstracting: (5<=Dressed)
states: 15,866,487 (7)
abstracting: (WaitBag<=58)
states: 32,209,356 (7)
abstracting: (27<=Entered)
states: 3,199,944 (6)
abstracting: (Bags<=Dressed)
states: 2,139,144 (6)
abstracting: (52<=Undress)
states: 0
abstracting: (Undress<=60)
states: 32,209,356 (7)
abstracting: (Bags<=14)
states: 7,861,956 (6)
abstracting: (Dress<=Bags)
states: 29,077,132 (7)
abstracting: (Dress<=28)
states: 32,207,414 (7)
abstracting: (36<=Undress)
states: 0
abstracting: (56<=InBath)
states: 0
abstracting: (InBath<=14)
states: 20,869,200 (7)
abstracting: (49<=InBath)
states: 0
abstracting: (Dress<=6)
states: 21,187,614 (7)
abstracting: (22<=Bags)
states: 17,325,490 (7)
abstracting: (Dressed<=12)
states: 28,536,183 (7)
abstracting: (Dressed<=2)
states: 10,830,320 (7)
abstracting: (Undress<=50)
states: 32,209,356 (7)
abstracting: (WaitBag<=WaitBag)
states: 32,209,356 (7)
abstracting: (Entered<=14)
states: 19,826,964 (7)
abstracting: (Entered<=39)
states: 31,979,126 (7)
abstracting: (Cabins<=Dressed)
states: 14,323,656 (7)
abstracting: (Dress<=54)
states: 32,209,356 (7)
abstracting: (58<=Dress)
states: 0
abstracting: (Out<=Out)
states: 32,209,356 (7)
abstracting: (Dressed<=Dress)
states: 16,886,916 (7)
abstracting: (Out<=WaitBag)
states: 9,540,770 (6)
abstracting: (Dressed<=WaitBag)
states: 17,149,668 (7)
abstracting: (Cabins<=Dress)
states: 14,034,660 (7)
abstracting: (15<=Out)
states: 12,382,392 (7)
-> the formula is TRUE

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

MC time: 0m26.774sec

totally nodes used: 13546190 (1.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 431425655 43559995 474985650
used/not used/entry size/cache size: 33066049 34042815 16 1024MB
basic ops cache: hits/miss/sum: 365932707 64482416 430415123
used/not used/entry size/cache size: 16375463 401753 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: 50333660 4843187 55176847
used/not used/entry size/cache size: 3253378 5135230 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 57227186
1 7915660
2 1331257
3 357307
4 115147
5 54903
6 28207
7 17018
8 11110
9 8864
>= 10 42205

Total processing time: 3m48.243sec


BK_STOP 1679241537190

--------------------
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:1507 (215), effective:360 (51)

initing FirstDep: 0m 0.000sec


iterations count:521 (74), effective:129 (18)

iterations count:805 (115), effective:252 (36)

iterations count:1087 (155), effective:284 (40)

iterations count:453 (64), effective:121 (17)

iterations count:802 (114), effective:195 (27)

iterations count:1090 (155), effective:297 (42)

iterations count:418 (59), effective:95 (13)

iterations count:1123 (160), effective:302 (43)

iterations count:592 (84), effective:132 (18)

iterations count:562 (80), effective:144 (20)

iterations count:1396 (199), effective:382 (54)

iterations count:508 (72), effective:106 (15)

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-03"
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-03, 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-167912708500342"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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