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.r330-tall-167889203400534.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 RefineWMG-PT-002002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203400534
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 6.6K Feb 26 15:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 15:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 15:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 15:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 15:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 15:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 15:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.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 RefineWMG-PT-002002-ReachabilityCardinality-00
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-01
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-02
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-03
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-04
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-05
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-06
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-07
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-08
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-09
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-10
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-11
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-12
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-13
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-14
FORMULA_NAME RefineWMG-PT-002002-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679169828649

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=RefineWMG-PT-002002
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 20:03:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 20:03:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 20:03:50] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-18 20:03:50] [INFO ] Transformed 14 places.
[2023-03-18 20:03:50] [INFO ] Transformed 11 transitions.
[2023-03-18 20:03:50] [INFO ] Parsed PT model containing 14 places and 11 transitions and 32 arcs in 75 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 2 resets, run finished after 346 ms. (steps per millisecond=28 ) properties (out of 14) seen :5
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 11 rows 14 cols
[2023-03-18 20:03:51] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-18 20:03:51] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 20:03:51] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:6
[2023-03-18 20:03:51] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-18 20:03:51] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA RefineWMG-PT-002002-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
All properties solved without resorting to model-checking.
Total runtime 1276 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: RefineWMG_PT_002002
(NrP: 14 NrTr: 11 NrArc: 32)

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

net check time: 0m 0.000sec

init dd package: 0m 2.790sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 104 (1.0e+02) #states 58,320 (4)



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

checking: AG [p8<=2]
normalized: ~ [E [true U ~ [p8<=2]]]

abstracting: (p8<=2)
states: 58,320 (4)
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [3<=p2]]
normalized: ~ [E [true U 3<=p2]]

abstracting: (3<=p2)
states: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [5<=p1]]
normalized: ~ [E [true U 5<=p1]]

abstracting: (5<=p1)
states: 4,860 (3)
-> the formula is FALSE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [7<=psecond]
normalized: E [true U 7<=psecond]

abstracting: (7<=psecond)
states: 0
-> the formula is FALSE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=pprime]
normalized: E [true U 2<=pprime]

abstracting: (2<=pprime)
states: 27,216 (4)
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p5<=1]
normalized: ~ [E [true U ~ [p5<=1]]]

abstracting: (p5<=1)
states: 38,880 (4)
-> the formula is FALSE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [p<=7] & 3<=pterce]]
normalized: E [true U [~ [p<=7] & 3<=pterce]]

abstracting: (3<=pterce)
states: 29,160 (4)
abstracting: (p<=7)
states: 58,320 (4)
-> the formula is FALSE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[p3<=4 | 7<=p7] | 3<=p5]]
normalized: ~ [E [true U ~ [[[p3<=4 | 7<=p7] | 3<=p5]]]]

abstracting: (3<=p5)
states: 0
abstracting: (7<=p7)
states: 0
abstracting: (p3<=4)
states: 58,320 (4)
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[p2<=3 & [~ [pterce<=0] & [5<=p10 & [4<=p10 & [~ [[p9<=7 & p3<=2]] & ~ [p3<=2]]]]]]]]
normalized: ~ [E [true U [[[[[~ [[p9<=7 & p3<=2]] & ~ [p3<=2]] & 4<=p10] & 5<=p10] & ~ [pterce<=0]] & p2<=3]]]

abstracting: (p2<=3)
states: 58,320 (4)
abstracting: (pterce<=0)
states: 9,720 (3)
abstracting: (5<=p10)
states: 0
abstracting: (4<=p10)
states: 0
abstracting: (p3<=2)
states: 58,320 (4)
abstracting: (p3<=2)
states: 58,320 (4)
abstracting: (p9<=7)
states: 58,320 (4)
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[p4<=6 | [p8<=1 & [[[[~ [p10<=6] & pterce<=p5] & p5<=p10] | [5<=p7 & 6<=p4]] | p8<=p8]]]]
normalized: ~ [E [true U ~ [[[[[[5<=p7 & 6<=p4] | [[~ [p10<=6] & pterce<=p5] & p5<=p10]] | p8<=p8] & p8<=1] | p4<=6]]]]

abstracting: (p4<=6)
states: 58,320 (4)
abstracting: (p8<=1)
states: 38,880 (4)
abstracting: (p8<=p8)
states: 58,320 (4)
abstracting: (p5<=p10)
states: 38,880 (4)
abstracting: (pterce<=p5)
states: 19,440 (4)
abstracting: (p10<=6)
states: 58,320 (4)
abstracting: (6<=p4)
states: 0
abstracting: (5<=p7)
states: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[p8<=2 & ~ [[~ [[[6<=p1 | ~ [[2<=p & pterce<=psecond]]] & ~ [[~ [p10<=0] & [1<=p9 & 4<=p1]]]]] & psecond<=p2]]] | 2<=pprime]]
normalized: E [true U [[~ [[~ [[~ [[[1<=p9 & 4<=p1] & ~ [p10<=0]]] & [~ [[2<=p & pterce<=psecond]] | 6<=p1]]] & psecond<=p2]] & p8<=2] | 2<=pprime]]

abstracting: (2<=pprime)
states: 27,216 (4)
abstracting: (p8<=2)
states: 58,320 (4)
abstracting: (psecond<=p2)
states: 19,440 (4)
abstracting: (6<=p1)
states: 1,944 (3)
abstracting: (pterce<=psecond)
states: 29,160 (4)
abstracting: (2<=p)
states: 27,216 (4)
abstracting: (p10<=0)
states: 19,440 (4)
abstracting: (4<=p1)
states: 9,720 (3)
abstracting: (1<=p9)
states: 38,880 (4)
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[[~ [[~ [[2<=p5 | p7<=p8]] | p9<=p2]] & p6<=5] | [7<=p4 | [5<=pprime & [p<=p2 & p4<=p4]]]]] | p8<=6]]
normalized: ~ [E [true U ~ [[~ [[[[[p<=p2 & p4<=p4] & 5<=pprime] | 7<=p4] | [~ [[~ [[2<=p5 | p7<=p8]] | p9<=p2]] & p6<=5]]] | p8<=6]]]]

abstracting: (p8<=6)
states: 58,320 (4)
abstracting: (p6<=5)
states: 56,376 (4)
abstracting: (p9<=p2)
states: 38,880 (4)
abstracting: (p7<=p8)
states: 38,880 (4)
abstracting: (2<=p5)
states: 19,440 (4)
abstracting: (7<=p4)
states: 0
abstracting: (5<=pprime)
states: 4,860 (3)
abstracting: (p4<=p4)
states: 58,320 (4)
abstracting: (p<=p2)
states: 29,970 (4)
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [[~ [[pterce<=p9 | p<=p2]] & [[pterce<=p3 & ~ [p3<=3]] | [p7<=p9 | [[~ [pterce<=1] | ~ [p5<=psecond]] | ~ [[p<=0 & 5<=p4]]]]]]] | [pprime<=4 | [[pterce<=2 | p10<=5] & p4<=p3]]]]
normalized: ~ [E [true U ~ [[[[[pterce<=2 | p10<=5] & p4<=p3] | pprime<=4] | ~ [[[[[~ [[p<=0 & 5<=p4]] | [~ [p5<=psecond] | ~ [pterce<=1]]] | p7<=p9] | [~ [p3<=3] & pterce<=p3]] & ~ [[pterce<=p9 | p<=p2]]]]]]]]

abstracting: (p<=p2)
states: 29,970 (4)
abstracting: (pterce<=p9)
states: 19,440 (4)
abstracting: (pterce<=p3)
states: 19,440 (4)
abstracting: (p3<=3)
states: 58,320 (4)
abstracting: (p7<=p9)
states: 38,880 (4)
abstracting: (pterce<=1)
states: 19,440 (4)
abstracting: (p5<=psecond)
states: 48,600 (4)
abstracting: (5<=p4)
states: 0
abstracting: (p<=0)
states: 17,496 (4)
abstracting: (pprime<=4)
states: 53,460 (4)
abstracting: (p4<=p3)
states: 38,880 (4)
abstracting: (p10<=5)
states: 58,320 (4)
abstracting: (pterce<=2)
states: 29,160 (4)
-> the formula is FALSE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[~ [[[[~ [[[2<=p3 | p4<=p7] | [p5<=2 | 3<=pterce]]] & ~ [[[p8<=p6 & 7<=p2] & p2<=6]]] & ~ [[3<=psecond & pterce<=p5]]] | [[[3<=p8 & [~ [2<=p2] | p8<=4]] & [~ [[p1<=7 & 5<=p]] & ~ [[[4<=p5 | p3<=0] | p5<=2]]]] | p3<=pterce]]] | p10<=5]]
normalized: ~ [E [true U ~ [[~ [[[[[~ [[[4<=p5 | p3<=0] | p5<=2]] & ~ [[p1<=7 & 5<=p]]] & [[~ [2<=p2] | p8<=4] & 3<=p8]] | p3<=pterce] | [~ [[3<=psecond & pterce<=p5]] & [~ [[[p8<=p6 & 7<=p2] & p2<=6]] & ~ [[[p5<=2 | 3<=pterce] | [2<=p3 | p4<=p7]]]]]]] | p10<=5]]]]

abstracting: (p10<=5)
states: 58,320 (4)
abstracting: (p4<=p7)
states: 38,880 (4)
abstracting: (2<=p3)
states: 19,440 (4)
abstracting: (3<=pterce)
states: 29,160 (4)
abstracting: (p5<=2)
states: 58,320 (4)
abstracting: (p2<=6)
states: 58,320 (4)
abstracting: (7<=p2)
states: 0
abstracting: (p8<=p6)
states: 42,120 (4)
abstracting: (pterce<=p5)
states: 19,440 (4)
abstracting: (3<=psecond)
states: 29,160 (4)
abstracting: (p3<=pterce)
states: 48,600 (4)
abstracting: (3<=p8)
states: 0
abstracting: (p8<=4)
states: 58,320 (4)
abstracting: (2<=p2)
states: 19,440 (4)
abstracting: (5<=p)
states: 4,860 (3)
abstracting: (p1<=7)
states: 58,320 (4)
abstracting: (p5<=2)
states: 58,320 (4)
abstracting: (p3<=0)
states: 19,440 (4)
abstracting: (4<=p5)
states: 0
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[pprime<=p10 | ~ [[~ [[p9<=2 | p9<=p4]] & p1<=p2]]] | [[[2<=p6 | [p2<=p5 & [[[p8<=p2 | p3<=p10] & ~ [p<=1]] & ~ [3<=pterce]]]] | [[~ [[[p<=7 & p8<=p9] | [6<=psecond | psecond<=1]]] & 7<=p2] | p9<=0]] | p7<=p6]] & [p5<=psecond | p4<=p10]]]
normalized: ~ [E [true U ~ [[[p5<=psecond | p4<=p10] & [[[[[~ [[[6<=psecond | psecond<=1] | [p<=7 & p8<=p9]]] & 7<=p2] | p9<=0] | [[[~ [3<=pterce] & [~ [p<=1] & [p8<=p2 | p3<=p10]]] & p2<=p5] | 2<=p6]] | p7<=p6] | [~ [[~ [[p9<=2 | p9<=p4]] & p1<=p2]] | pprime<=p10]]]]]]

abstracting: (pprime<=p10)
states: 29,970 (4)
abstracting: (p1<=p2)
states: 29,970 (4)
abstracting: (p9<=p4)
states: 38,880 (4)
abstracting: (p9<=2)
states: 58,320 (4)
abstracting: (p7<=p6)
states: 42,120 (4)
abstracting: (2<=p6)
states: 27,216 (4)
abstracting: (p2<=p5)
states: 38,880 (4)
abstracting: (p3<=p10)
states: 38,880 (4)
abstracting: (p8<=p2)
states: 38,880 (4)
abstracting: (p<=1)
states: 31,104 (4)
abstracting: (3<=pterce)
states: 29,160 (4)
abstracting: (p9<=0)
states: 19,440 (4)
abstracting: (7<=p2)
states: 0
abstracting: (p8<=p9)
states: 38,880 (4)
abstracting: (p<=7)
states: 58,320 (4)
abstracting: (psecond<=1)
states: 19,440 (4)
abstracting: (6<=psecond)
states: 0
abstracting: (p4<=p10)
states: 38,880 (4)
abstracting: (p5<=psecond)
states: 48,600 (4)
-> the formula is FALSE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[[p4<=2 & [4<=p4 | [~ [[[p9<=4 & p6<=p7] & ~ [p4<=pprime]]] | [[~ [pterce<=3] | [5<=p7 | p9<=7]] & [[2<=p6 & p3<=5] | pprime<=p6]]]]] | ~ [[[[~ [p4<=4] | ~ [[5<=p10 & 4<=p5]]] | [psecond<=6 & [~ [p8<=3] & [5<=p1 & 4<=p1]]]] & ~ [[[7<=p5 | [p5<=p3 | p2<=p7]] & [[p4<=1 | p1<=3] | ~ [p7<=6]]]]]]]]]
normalized: E [true U ~ [[~ [[~ [[[~ [p7<=6] | [p4<=1 | p1<=3]] & [[p5<=p3 | p2<=p7] | 7<=p5]]] & [[[[5<=p1 & 4<=p1] & ~ [p8<=3]] & psecond<=6] | [~ [[5<=p10 & 4<=p5]] | ~ [p4<=4]]]]] | [[[[[[2<=p6 & p3<=5] | pprime<=p6] & [[5<=p7 | p9<=7] | ~ [pterce<=3]]] | ~ [[~ [p4<=pprime] & [p9<=4 & p6<=p7]]]] | 4<=p4] & p4<=2]]]]

abstracting: (p4<=2)
states: 58,320 (4)
abstracting: (4<=p4)
states: 0
abstracting: (p6<=p7)
states: 29,970 (4)
abstracting: (p9<=4)
states: 58,320 (4)
abstracting: (p4<=pprime)
states: 42,120 (4)
abstracting: (pterce<=3)
states: 38,880 (4)
abstracting: (p9<=7)
states: 58,320 (4)
abstracting: (5<=p7)
states: 0
abstracting: (pprime<=p6)
states: 34,020 (4)
abstracting: (p3<=5)
states: 58,320 (4)
abstracting: (2<=p6)
states: 27,216 (4)
abstracting: (p4<=4)
states: 58,320 (4)
abstracting: (4<=p5)
states: 0
abstracting: (5<=p10)
states: 0
abstracting: (psecond<=6)
states: 58,320 (4)
abstracting: (p8<=3)
states: 58,320 (4)
abstracting: (4<=p1)
states: 9,720 (3)
abstracting: (5<=p1)
states: 4,860 (3)
abstracting: (7<=p5)
states: 0
abstracting: (p2<=p7)
states: 38,880 (4)
abstracting: (p5<=p3)
states: 38,880 (4)
abstracting: (p1<=3)
states: 48,600 (4)
abstracting: (p4<=1)
states: 38,880 (4)
abstracting: (p7<=6)
states: 58,320 (4)
-> the formula is TRUE

FORMULA RefineWMG-PT-002002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 8967 (9.0e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 20752 13212 33964
used/not used/entry size/cache size: 17495 67091369 16 1024MB
basic ops cache: hits/miss/sum: 18641 19424 38065
used/not used/entry size/cache size: 32725 16744491 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: 2725 2286 5011
used/not used/entry size/cache size: 2286 8386322 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 67100933
1 7646
2 181
3 42
4 4
5 7
6 8
7 4
8 10
9 3
>= 10 26

Total processing time: 0m 4.389sec


BK_STOP 1679169836937

--------------------
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.008sec


iterations count:577 (52), effective:244 (22)

initing FirstDep: 0m 0.000sec


iterations count:92 (8), effective:36 (3)

iterations count:82 (7), effective:31 (2)

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

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

iterations count:406 (36), effective:173 (15)

iterations count:314 (28), effective:133 (12)

iterations count:248 (22), effective:105 (9)

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="RefineWMG-PT-002002"
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 RefineWMG-PT-002002, 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 r330-tall-167889203400534"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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