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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 6.0K Feb 26 03:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 03:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 03:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 03:45 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.9K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 26 03:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 03:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:18 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-04-ReachabilityCardinality-00
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-01
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-02
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-03
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-04
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-05
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-06
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-07
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-08
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-09
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-10
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-11
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-12
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-13
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-14
FORMULA_NAME SwimmingPool-PT-04-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679241660067

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


RS generation: 1m 4.325sec


-> reachability set: #nodes 325739 (3.3e+05) #states 164,385,221 (8)



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

checking: AG [Dress<=68]
normalized: ~ [E [true U ~ [Dress<=68]]]

abstracting: (Dress<=68)
states: 164,385,221 (8)
-> the formula is TRUE

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

MC time: 0m 0.559sec

checking: AG [Dress<=15]
normalized: ~ [E [true U ~ [Dress<=15]]]

abstracting: (Dress<=15)
states: 143,750,012 (8)
-> the formula is FALSE

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

MC time: 0m27.955sec

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

abstracting: (55<=Entered)
states: 736,281 (5)
-> the formula is TRUE

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

MC time: 0m 1.466sec

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

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

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

MC time: 0m 0.641sec

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

abstracting: (Entered<=43)
states: 159,139,435 (8)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [[8<=InBath | ~ [InBath<=Cabins]]]
normalized: E [true U [8<=InBath | ~ [InBath<=Cabins]]]

abstracting: (InBath<=Cabins)
states: 58,237,179 (7)
abstracting: (8<=InBath)
states: 114,971,857 (8)
-> the formula is TRUE

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

MC time: 0m27.443sec

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

abstracting: (Cabins<=Out)
states: 115,542,735 (8)
abstracting: (8<=Dressed)
states: 67,916,079 (7)
-> the formula is FALSE

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

MC time: 1m 8.585sec

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

abstracting: (Bags<=Undress)
states: 17,743,792 (7)
abstracting: (44<=Dressed)
states: 0
abstracting: (Bags<=InBath)
states: 48,073,487 (7)
-> the formula is FALSE

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

MC time: 0m47.219sec

checking: AG [[[[InBath<=Bags | [[~ [[26<=WaitBag & [52<=Dressed & ~ [Dressed<=35]]]] | [Out<=49 & [~ [InBath<=Cabins] | ~ [Entered<=24]]]] & ~ [Entered<=28]]] | 35<=Undress] | [Cabins<=34 | 69<=Dressed]]]
normalized: ~ [E [true U ~ [[[Cabins<=34 | 69<=Dressed] | [35<=Undress | [InBath<=Bags | [~ [Entered<=28] & [[Out<=49 & [~ [Entered<=24] | ~ [InBath<=Cabins]]] | ~ [[26<=WaitBag & [52<=Dressed & ~ [Dressed<=35]]]]]]]]]]]]

abstracting: (Dressed<=35)
states: 164,322,571 (8)
abstracting: (52<=Dressed)
states: 0
abstracting: (26<=WaitBag)
states: 3,013,080 (6)
abstracting: (InBath<=Cabins)
states: 58,237,179 (7)
abstracting: (Entered<=24)
states: 120,401,897 (8)
abstracting: (Out<=49)
states: 162,437,429 (8)
abstracting: (Entered<=28)
states: 132,619,487 (8)
abstracting: (InBath<=Bags)
states: 118,147,183 (8)
abstracting: (35<=Undress)
states: 92,190 (4)
abstracting: (69<=Dressed)
states: 0
abstracting: (Cabins<=34)
states: 164,028,431 (8)
-> the formula is FALSE

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

MC time: 1m11.843sec

checking: EF [[InBath<=WaitBag & [Out<=51 | [Out<=Entered & ~ [[[[Dressed<=58 & [[Entered<=14 & WaitBag<=Out] | WaitBag<=13]] | ~ [5<=Bags]] | ~ [[~ [Out<=40] & ~ [Bags<=45]]]]]]]]]
normalized: E [true U [InBath<=WaitBag & [Out<=51 | [Out<=Entered & ~ [[~ [[~ [Bags<=45] & ~ [Out<=40]]] | [~ [5<=Bags] | [Dressed<=58 & [WaitBag<=13 | [Entered<=14 & WaitBag<=Out]]]]]]]]]]

abstracting: (WaitBag<=Out)
states: 121,879,274 (8)
abstracting: (Entered<=14)
states: 80,411,114 (7)
abstracting: (WaitBag<=13)
states: 134,251,565 (8)
abstracting: (Dressed<=58)
states: 164,385,221 (8)
abstracting: (5<=Bags)
states: 158,852,764 (8)
abstracting: (Out<=40)
states: 156,240,161 (8)
abstracting: (Bags<=45)
states: 144,603,613 (8)
abstracting: (Out<=Entered)
states: 83,660,555 (7)
abstracting: (Out<=51)
states: 163,040,317 (8)
abstracting: (InBath<=WaitBag)
states: 50,092,119 (7)
-> the formula is TRUE

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

MC time: 1m 7.787sec

checking: AG [[~ [[[~ [Bags<=64] & ~ [Entered<=Bags]] | ~ [[~ [27<=Undress] | ~ [[[[57<=Entered | 19<=Out] | [Undress<=Out | InBath<=Dress]] & InBath<=Out]]]]]] | ~ [[~ [WaitBag<=Cabins] | ~ [[[Out<=28 & 64<=Cabins] & ~ [InBath<=Out]]]]]]]
normalized: ~ [E [true U ~ [[~ [[~ [[~ [InBath<=Out] & [Out<=28 & 64<=Cabins]]] | ~ [WaitBag<=Cabins]]] | ~ [[~ [[~ [[InBath<=Out & [[Undress<=Out | InBath<=Dress] | [57<=Entered | 19<=Out]]]] | ~ [27<=Undress]]] | [~ [Entered<=Bags] & ~ [Bags<=64]]]]]]]]

abstracting: (Bags<=64)
states: 164,385,221 (8)
abstracting: (Entered<=Bags)
states: 132,361,845 (8)
abstracting: (27<=Undress)
states: 2,032,044 (6)
abstracting: (19<=Out)
states: 66,381,378 (7)
abstracting: (57<=Entered)
states: 475,020 (5)
abstracting: (InBath<=Dress)
states: 49,992,448 (7)
abstracting: (Undress<=Out)
states: 123,687,795 (8)
abstracting: (InBath<=Out)
states: 86,457,217 (7)
abstracting: (WaitBag<=Cabins)
states: 98,858,529 (7)
abstracting: (64<=Cabins)
states: 0
abstracting: (Out<=28)
states: 132,619,487 (8)
abstracting: (InBath<=Out)
states: 86,457,217 (7)
-> the formula is FALSE

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

MC time: 0m54.006sec

checking: EF [~ [[[65<=InBath | [~ [[~ [[Entered<=Bags | Bags<=Bags]] & ~ [[~ [73<=Out] | Bags<=23]]]] & ~ [[~ [47<=Cabins] & [[[InBath<=78 | 73<=InBath] | [6<=InBath & 8<=Cabins]] & ~ [[WaitBag<=Out & WaitBag<=31]]]]]]] & ~ [[80<=Undress & [[[Out<=Bags | [[51<=Undress | 68<=Out] & Dress<=80]] | 71<=Dressed] | [~ [Out<=44] | ~ [35<=InBath]]]]]]]]
normalized: E [true U ~ [[~ [[80<=Undress & [[~ [35<=InBath] | ~ [Out<=44]] | [71<=Dressed | [Out<=Bags | [Dress<=80 & [51<=Undress | 68<=Out]]]]]]] & [65<=InBath | [~ [[[~ [[WaitBag<=Out & WaitBag<=31]] & [[6<=InBath & 8<=Cabins] | [InBath<=78 | 73<=InBath]]] & ~ [47<=Cabins]]] & ~ [[~ [[Bags<=23 | ~ [73<=Out]]] & ~ [[Entered<=Bags | Bags<=Bags]]]]]]]]]

abstracting: (Bags<=Bags)
states: 164,385,221 (8)
abstracting: (Entered<=Bags)
states: 132,361,845 (8)
abstracting: (73<=Out)
states: 1,716 (3)
abstracting: (Bags<=23)
states: 54,808,611 (7)
abstracting: (47<=Cabins)
states: 0
abstracting: (73<=InBath)
states: 0
abstracting: (InBath<=78)
states: 164,385,221 (8)
abstracting: (8<=Cabins)
states: 89,906,355 (7)
abstracting: (6<=InBath)
states: 126,510,692 (8)
abstracting: (WaitBag<=31)
states: 163,924,838 (8)
abstracting: (WaitBag<=Out)
states: 121,879,274 (8)
abstracting: (65<=InBath)
states: 0
abstracting: (68<=Out)
states: 18,564 (4)
abstracting: (51<=Undress)
states: 0
abstracting: (Dress<=80)
states: 164,385,221 (8)
abstracting: (Out<=Bags)
states: 132,361,845 (8)
abstracting: (71<=Dressed)
states: 0
abstracting: (Out<=44)
states: 159,888,833 (8)
abstracting: (35<=InBath)
states: 13,311,809 (7)
abstracting: (80<=Undress)
states: 0
-> the formula is TRUE

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

MC time: 3m 6.174sec

checking: EF [[~ [Dress<=46] & ~ [[[[[Undress<=InBath & ~ [Out<=Dress]] & [[[55<=Cabins | 80<=Bags] & [Dressed<=Entered | Out<=59]] & ~ [Entered<=7]]] | ~ [6<=Dressed]] & [[[[68<=Dressed | [Entered<=Undress & Cabins<=64]] & [WaitBag<=Dressed | [Cabins<=Dressed | Entered<=42]]] | [~ [[38<=Out | Cabins<=WaitBag]] | [44<=Cabins & ~ [Dress<=14]]]] & ~ [[Dressed<=Cabins | [[56<=InBath & 1<=Undress] & Entered<=36]]]]]]]]
normalized: E [true U [~ [[[~ [[Dressed<=Cabins | [Entered<=36 & [56<=InBath & 1<=Undress]]]] & [[[44<=Cabins & ~ [Dress<=14]] | ~ [[38<=Out | Cabins<=WaitBag]]] | [[WaitBag<=Dressed | [Cabins<=Dressed | Entered<=42]] & [68<=Dressed | [Entered<=Undress & Cabins<=64]]]]] & [~ [6<=Dressed] | [[~ [Entered<=7] & [[Dressed<=Entered | Out<=59] & [55<=Cabins | 80<=Bags]]] & [Undress<=InBath & ~ [Out<=Dress]]]]]] & ~ [Dress<=46]]]

abstracting: (Dress<=46)
states: 164,385,221 (8)
abstracting: (Out<=Dress)
states: 46,001,109 (7)
abstracting: (Undress<=InBath)
states: 119,940,975 (8)
abstracting: (80<=Bags)
states: 0
abstracting: (55<=Cabins)
states: 0
abstracting: (Out<=59)
states: 164,154,991 (8)
abstracting: (Dressed<=Entered)
states: 121,879,274 (8)
abstracting: (Entered<=7)
states: 45,189,620 (7)
abstracting: (6<=Dressed)
states: 86,293,592 (7)
abstracting: (Cabins<=64)
states: 164,385,221 (8)
abstracting: (Entered<=Undress)
states: 46,001,109 (7)
abstracting: (68<=Dressed)
states: 0
abstracting: (Entered<=42)
states: 158,288,767 (8)
abstracting: (Cabins<=Dressed)
states: 72,173,486 (7)
abstracting: (WaitBag<=Dressed)
states: 86,270,217 (7)
abstracting: (Cabins<=WaitBag)
states: 72,173,486 (7)
abstracting: (38<=Out)
states: 12,217,590 (7)
abstracting: (Dress<=14)
states: 140,134,078 (8)
abstracting: (44<=Cabins)
states: 0
abstracting: (1<=Undress)
states: 147,909,559 (8)
abstracting: (56<=InBath)
states: 71,330 (4)
abstracting: (Entered<=36)
states: 150,538,619 (8)
abstracting: (Dressed<=Cabins)
states: 98,858,529 (7)
-> the formula is FALSE

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

MC time: 1m39.052sec

checking: EF [~ [[Entered<=66 | [~ [[Dressed<=Bags | [[InBath<=WaitBag | Undress<=46] | ~ [WaitBag<=67]]]] | [[[~ [[~ [23<=Bags] & [Dressed<=Undress | 57<=Bags]]] & [~ [19<=InBath] & [Dress<=Bags | Out<=73]]] & ~ [[Bags<=43 & 12<=InBath]]] | [[~ [[[WaitBag<=67 | Entered<=Cabins] & [Dress<=Out & Out<=27]]] & [[[Dressed<=Bags & 68<=Out] & [WaitBag<=39 & InBath<=5]] & ~ [11<=InBath]]] | [[InBath<=76 & 43<=Undress] & ~ [Undress<=2]]]]]]]]
normalized: E [true U ~ [[Entered<=66 | [[[[~ [Undress<=2] & [InBath<=76 & 43<=Undress]] | [[~ [11<=InBath] & [[WaitBag<=39 & InBath<=5] & [Dressed<=Bags & 68<=Out]]] & ~ [[[Dress<=Out & Out<=27] & [WaitBag<=67 | Entered<=Cabins]]]]] | [~ [[Bags<=43 & 12<=InBath]] & [[[Dress<=Bags | Out<=73] & ~ [19<=InBath]] & ~ [[[Dressed<=Undress | 57<=Bags] & ~ [23<=Bags]]]]]] | ~ [[Dressed<=Bags | [~ [WaitBag<=67] | [InBath<=WaitBag | Undress<=46]]]]]]]]

abstracting: (Undress<=46)
states: 164,385,221 (8)
abstracting: (InBath<=WaitBag)
states: 50,092,119 (7)
abstracting: (WaitBag<=67)
states: 164,385,221 (8)
abstracting: (Dressed<=Bags)
states: 155,840,993 (8)
abstracting: (23<=Bags)
states: 113,360,650 (8)
abstracting: (57<=Bags)
states: 849,618 (5)
abstracting: (Dressed<=Undress)
states: 84,915,831 (7)
abstracting: (19<=InBath)
states: 61,214,461 (7)
abstracting: (Out<=73)
states: 164,384,297 (8)
abstracting: (Dress<=Bags)
states: 148,466,175 (8)
abstracting: (12<=InBath)
states: 93,523,199 (7)
abstracting: (Bags<=43)
states: 138,190,244 (8)
abstracting: (Entered<=Cabins)
states: 54,146,169 (7)
abstracting: (WaitBag<=67)
states: 164,385,221 (8)
abstracting: (Out<=27)
states: 129,768,716 (8)
abstracting: (Dress<=Out)
states: 123,687,795 (8)
abstracting: (68<=Out)
states: 18,564 (4)
abstracting: (Dressed<=Bags)
states: 155,840,993 (8)
abstracting: (InBath<=5)
states: 37,874,529 (7)
abstracting: (WaitBag<=39)
states: 164,384,360 (8)
abstracting: (11<=InBath)
states: 98,681,737 (7)
abstracting: (43<=Undress)
states: 0
abstracting: (InBath<=76)
states: 164,385,221 (8)
abstracting: (Undress<=2)
states: 45,527,719 (7)
abstracting: (Entered<=66)
states: 164,358,089 (8)
-> the formula is FALSE

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

MC time: 1m10.190sec

checking: EF [[[[~ [Dress<=Cabins] & [[29<=Cabins & [[~ [[Undress<=32 | 57<=InBath]] | 45<=WaitBag] | [[Dress<=InBath & [Dress<=30 | 17<=Out]] & WaitBag<=72]]] & [[[~ [[57<=Dressed | Entered<=WaitBag]] & WaitBag<=51] | ~ [[[Entered<=Out | Dress<=Out] | 12<=WaitBag]]] & ~ [[~ [[Bags<=Undress & 5<=Bags]] | [[Dressed<=39 | 32<=Bags] & [Out<=Bags | Undress<=10]]]]]]] & [~ [Entered<=65] & WaitBag<=InBath]] & [53<=Entered | InBath<=44]]]
normalized: E [true U [[53<=Entered | InBath<=44] & [[WaitBag<=InBath & ~ [Entered<=65]] & [[[~ [[[[Out<=Bags | Undress<=10] & [Dressed<=39 | 32<=Bags]] | ~ [[Bags<=Undress & 5<=Bags]]]] & [~ [[12<=WaitBag | [Entered<=Out | Dress<=Out]]] | [WaitBag<=51 & ~ [[57<=Dressed | Entered<=WaitBag]]]]] & [29<=Cabins & [[WaitBag<=72 & [Dress<=InBath & [Dress<=30 | 17<=Out]]] | [45<=WaitBag | ~ [[Undress<=32 | 57<=InBath]]]]]] & ~ [Dress<=Cabins]]]]]

abstracting: (Dress<=Cabins)
states: 100,425,193 (8)
abstracting: (57<=InBath)
states: 39,354 (4)
abstracting: (Undress<=32)
states: 164,133,431 (8)
abstracting: (45<=WaitBag)
states: 0
abstracting: (17<=Out)
states: 74,922,126 (7)
abstracting: (Dress<=30)
states: 163,817,654 (8)
abstracting: (Dress<=InBath)
states: 119,940,975 (8)
abstracting: (WaitBag<=72)
states: 164,385,221 (8)
abstracting: (29<=Cabins)
states: 3,428,698 (6)
abstracting: (Entered<=WaitBag)
states: 47,576,287 (7)
abstracting: (57<=Dressed)
states: 0
abstracting: (WaitBag<=51)
states: 164,385,221 (8)
abstracting: (Dress<=Out)
states: 123,687,795 (8)
abstracting: (Entered<=Out)
states: 83,660,555 (7)
abstracting: (12<=WaitBag)
states: 40,207,404 (7)
abstracting: (5<=Bags)
states: 158,852,764 (8)
abstracting: (Bags<=Undress)
states: 17,743,792 (7)
abstracting: (32<=Bags)
states: 75,868,408 (7)
abstracting: (Dressed<=39)
states: 164,384,360 (8)
abstracting: (Undress<=10)
states: 120,478,897 (8)
abstracting: (Out<=Bags)
states: 132,361,845 (8)
abstracting: (Entered<=65)
states: 164,346,461 (8)
abstracting: (WaitBag<=InBath)
states: 119,858,893 (8)
abstracting: (InBath<=44)
states: 161,950,277 (8)
abstracting: (53<=Entered)
states: 1,107,568 (6)
-> the formula is FALSE

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

MC time: 0m47.280sec

checking: EF [~ [[~ [[Bags<=Dress & [InBath<=6 & [~ [[InBath<=36 | Bags<=Cabins]] | ~ [Undress<=47]]]]] | [[[Cabins<=Entered & Out<=79] & [[[~ [80<=Dressed] & ~ [Dress<=2]] | ~ [[WaitBag<=45 | Dressed<=Bags]]] | [[~ [WaitBag<=54] & [InBath<=30 & [61<=Cabins | InBath<=Bags]]] & ~ [Dressed<=70]]]] & [[~ [39<=WaitBag] | [[Dress<=InBath | ~ [[Bags<=55 & Entered<=Cabins]]] & ~ [[Dressed<=Cabins | Entered<=Dress]]]] | ~ [[[[[21<=Cabins & Out<=64] | ~ [69<=InBath]] | [71<=InBath | [WaitBag<=6 & 53<=WaitBag]]] & [13<=Undress & [41<=Dress & [Dress<=InBath | WaitBag<=0]]]]]]]]]]
normalized: E [true U ~ [[[[~ [[[13<=Undress & [41<=Dress & [Dress<=InBath | WaitBag<=0]]] & [[71<=InBath | [WaitBag<=6 & 53<=WaitBag]] | [~ [69<=InBath] | [21<=Cabins & Out<=64]]]]] | [[~ [[Dressed<=Cabins | Entered<=Dress]] & [Dress<=InBath | ~ [[Bags<=55 & Entered<=Cabins]]]] | ~ [39<=WaitBag]]] & [[[~ [Dressed<=70] & [[InBath<=30 & [61<=Cabins | InBath<=Bags]] & ~ [WaitBag<=54]]] | [~ [[WaitBag<=45 | Dressed<=Bags]] | [~ [Dress<=2] & ~ [80<=Dressed]]]] & [Cabins<=Entered & Out<=79]]] | ~ [[Bags<=Dress & [InBath<=6 & [~ [Undress<=47] | ~ [[InBath<=36 | Bags<=Cabins]]]]]]]]]

abstracting: (Bags<=Cabins)
states: 18,085,562 (7)
abstracting: (InBath<=36)
states: 154,334,293 (8)
abstracting: (Undress<=47)
states: 164,385,221 (8)
abstracting: (InBath<=6)
states: 43,711,822 (7)
abstracting: (Bags<=Dress)
states: 17,743,792 (7)
abstracting: (Out<=79)
states: 164,385,220 (8)
abstracting: (Cabins<=Entered)
states: 115,542,735 (8)
abstracting: (80<=Dressed)
states: 0
abstracting: (Dress<=2)
states: 45,527,719 (7)
abstracting: (Dressed<=Bags)
states: 155,840,993 (8)
abstracting: (WaitBag<=45)
states: 164,385,221 (8)
abstracting: (WaitBag<=54)
states: 164,385,221 (8)
abstracting: (InBath<=Bags)
states: 118,147,183 (8)
abstracting: (61<=Cabins)
states: 0
abstracting: (InBath<=30)
states: 142,709,325 (8)
abstracting: (Dressed<=70)
states: 164,385,221 (8)
abstracting: (39<=WaitBag)
states: 4,347 (3)
abstracting: (Entered<=Cabins)
states: 54,146,169 (7)
abstracting: (Bags<=55)
states: 162,946,315 (8)
abstracting: (Dress<=InBath)
states: 119,940,975 (8)
abstracting: (Entered<=Dress)
states: 46,001,109 (7)
abstracting: (Dressed<=Cabins)
states: 98,858,529 (7)
abstracting: (Out<=64)
states: 164,330,957 (8)
abstracting: (21<=Cabins)
states: 18,698,218 (7)
abstracting: (69<=InBath)
states: 0
abstracting: (53<=WaitBag)
states: 0
abstracting: (WaitBag<=6)
states: 87,697,918 (7)
abstracting: (71<=InBath)
states: 0
abstracting: (WaitBag<=0)
states: 15,719,060 (7)
abstracting: (Dress<=InBath)
states: 119,940,975 (8)
abstracting: (41<=Dress)
states: 0
abstracting: (13<=Undress)
states: 32,950,281 (7)
-> the formula is FALSE

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

MC time: 0m58.922sec

totally nodes used: 28456761 (2.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1676903690 128864309 1805767999
used/not used/entry size/cache size: 56074755 11034109 16 1024MB
basic ops cache: hits/miss/sum: 1149427933 179326151 1328754084
used/not used/entry size/cache size: 16773620 3596 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: 178920378 14170298 193090676
used/not used/entry size/cache size: 5847534 2541074 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 47521043
1 15075187
2 3221357
3 678418
4 191758
5 84854
6 62339
7 66859
8 47564
9 32149
>= 10 127336

Total processing time: 19m30.606sec


BK_STOP 1679242834165

--------------------
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:2007 (286), effective:480 (68)

initing FirstDep: 0m 0.000sec


iterations count:375 (53), effective:112 (16)

iterations count:1052 (150), effective:330 (47)

iterations count:843 (120), effective:264 (37)

iterations count:175 (25), effective:38 (5)

iterations count:469 (67), effective:113 (16)

iterations count:708 (101), effective:180 (25)

iterations count:1327 (189), effective:374 (53)

iterations count:501 (71), effective:189 (27)

iterations count:1077 (153), effective:359 (51)

iterations count:503 (71), effective:85 (12)

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

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