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.r234-tall-167856419900150.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 JoinFreeModules-PT-0004, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419900150
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 8.6K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 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 JoinFreeModules-PT-0004-ReachabilityCardinality-00
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-01
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-02
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-03
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-04
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-05
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-06
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-07
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-08
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-09
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-10
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-11
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-12
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-13
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-14
FORMULA_NAME JoinFreeModules-PT-0004-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679452023597

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=JoinFreeModules-PT-0004
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:27:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:27:05] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-22 02:27:05] [INFO ] Transformed 21 places.
[2023-03-22 02:27:05] [INFO ] Transformed 33 transitions.
[2023-03-22 02:27:05] [INFO ] Parsed PT model containing 21 places and 33 transitions and 94 arcs in 102 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 9 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 314 steps, including 2 resets, run visited all 6 properties in 17 ms. (steps per millisecond=18 )
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 185 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: JoinFreeModules_PT_0004
(NrP: 21 NrTr: 33 NrArc: 94)

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

net check time: 0m 0.000sec

init dd package: 0m 2.704sec


RS generation: 0m 0.001sec


-> reachability set: #nodes 217 (2.2e+02) #states 14,776,336 (7)



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

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

abstracting: (2<=p8)
states: 4,528,232 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [4<=p11]
normalized: ~ [E [true U ~ [4<=p11]]]

abstracting: (4<=p11)
states: 2,859,936 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [4<=p16]]
normalized: E [true U ~ [4<=p16]]

abstracting: (4<=p16)
states: 2,859,936 (6)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p14)
states: 8,818,136 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [p19<=p19]
normalized: E [true U p19<=p19]

abstracting: (p19<=p19)
states: 14,776,336 (7)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [4<=p5] & 4<=p18] | p5<=p11]]
normalized: ~ [E [true U ~ [[[~ [4<=p5] & 4<=p18] | p5<=p11]]]]

abstracting: (p5<=p11)
states: 11,601,192 (7)
abstracting: (4<=p18)
states: 714,984 (5)
abstracting: (4<=p5)
states: 2,144,952 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AG [~ [[p17<=p11 & p15<=p3]]]
normalized: ~ [E [true U [p17<=p11 & p15<=p3]]]

abstracting: (p15<=p3)
states: 10,717,072 (7)
abstracting: (p17<=p11)
states: 10,786,264 (7)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AG [~ [[~ [p16<=p17] | ~ [[~ [1<=p9] | p20<=p1]]]]]
normalized: ~ [E [true U [~ [[~ [1<=p9] | p20<=p1]] | ~ [p16<=p17]]]]

abstracting: (p16<=p17)
states: 7,388,168 (6)
abstracting: (p20<=p1)
states: 11,601,192 (7)
abstracting: (1<=p9)
states: 8,818,136 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [~ [[[~ [3<=p9] & [[~ [p20<=p13] | 3<=p19] | p7<=p2]] & ~ [p13<=p2]]]]
normalized: E [true U ~ [[~ [p13<=p2] & [[[~ [p20<=p13] | 3<=p19] | p7<=p2] & ~ [3<=p9]]]]]

abstracting: (3<=p9)
states: 5,481,544 (6)
abstracting: (p7<=p2)
states: 9,333,232 (6)
abstracting: (3<=p19)
states: 5,481,544 (6)
abstracting: (p20<=p13)
states: 10,717,072 (7)
abstracting: (p13<=p2)
states: 9,852,172 (6)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.019sec

checking: AG [~ [[p11<=0 & ~ [[p5<=4 & [[~ [1<=p] | [[p12<=p5 & 4<=p19] & ~ [p20<=4]]] | [p19<=p8 | ~ [4<=p2]]]]]]]]
normalized: ~ [E [true U [~ [[[[~ [4<=p2] | p19<=p8] | [[~ [p20<=4] & [p12<=p5 & 4<=p19]] | ~ [1<=p]]] & p5<=4]] & p11<=0]]]

abstracting: (p11<=0)
states: 4,051,576 (6)
abstracting: (p5<=4)
states: 13,108,040 (7)
abstracting: (1<=p)
states: 14,776,336 (7)
abstracting: (4<=p19)
states: 2,144,952 (6)
abstracting: (p12<=p5)
states: 8,060,868 (6)
abstracting: (p20<=4)
states: 13,108,040 (7)
abstracting: (p19<=p8)
states: 8,172,344 (6)
abstracting: (4<=p2)
states: 953,312 (5)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[[p1<=3 | [p5<=4 | ~ [[3<=p20 | ~ [[4<=p10 & [p7<=p15 & p20<=2]]]]]]] & ~ [[p8<=p2 & [3<=p14 | p<=3]]]]]
normalized: ~ [E [true U ~ [[~ [[[3<=p14 | p<=3] & p8<=p2]] & [[~ [[~ [[[p7<=p15 & p20<=2] & 4<=p10]] | 3<=p20]] | p5<=4] | p1<=3]]]]]

abstracting: (p1<=3)
states: 11,916,400 (7)
abstracting: (p5<=4)
states: 13,108,040 (7)
abstracting: (3<=p20)
states: 2,144,952 (6)
abstracting: (4<=p10)
states: 2,144,952 (6)
abstracting: (p20<=2)
states: 12,631,384 (7)
abstracting: (p7<=p15)
states: 8,060,868 (6)
abstracting: (p8<=p2)
states: 9,852,172 (6)
abstracting: (p<=3)
states: 14,776,336 (7)
abstracting: (3<=p14)
states: 5,481,544 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[[[3<=p & [p6<=1 | [2<=p20 | [[[[p14<=p14 | p6<=3] & p5<=1] | [~ [p14<=p8] & [p8<=p10 & 1<=p6]]] & ~ [p18<=2]]]]] & [p14<=1 | p6<=p19]] | ~ [[[~ [3<=p] & p1<=p18] | [~ [[[~ [p10<=p6] | ~ [p14<=p2]] & ~ [p16<=p2]]] | [[~ [[p16<=1 | 3<=p15]] & p15<=p5] | 3<=p]]]]]]
normalized: ~ [E [true U ~ [[~ [[[[[~ [[p16<=1 | 3<=p15]] & p15<=p5] | 3<=p] | ~ [[~ [p16<=p2] & [~ [p14<=p2] | ~ [p10<=p6]]]]] | [~ [3<=p] & p1<=p18]]] | [[p14<=1 | p6<=p19] & [[[[~ [p18<=2] & [[[p8<=p10 & 1<=p6] & ~ [p14<=p8]] | [[p14<=p14 | p6<=3] & p5<=1]]] | 2<=p20] | p6<=1] & 3<=p]]]]]]

abstracting: (3<=p)
states: 0
abstracting: (p6<=1)
states: 5,958,200 (6)
abstracting: (2<=p20)
states: 2,859,936 (6)
abstracting: (p5<=1)
states: 11,916,400 (7)
abstracting: (p6<=3)
states: 11,916,400 (7)
abstracting: (p14<=p14)
states: 14,776,336 (7)
abstracting: (p14<=p8)
states: 8,172,344 (6)
abstracting: (1<=p6)
states: 10,724,760 (7)
abstracting: (p8<=p10)
states: 8,103,152 (6)
abstracting: (p18<=2)
states: 12,869,712 (7)
abstracting: (p6<=p19)
states: 7,884,044 (6)
abstracting: (p14<=1)
states: 8,341,480 (6)
abstracting: (p1<=p18)
states: 6,619,368 (6)
abstracting: (3<=p)
states: 0
abstracting: (p10<=p6)
states: 11,678,072 (7)
abstracting: (p14<=p2)
states: 8,452,956 (6)
abstracting: (p16<=p2)
states: 6,942,264 (6)
abstracting: (3<=p)
states: 0
abstracting: (p15<=p5)
states: 10,271,168 (7)
abstracting: (3<=p15)
states: 2,144,952 (6)
abstracting: (p16<=1)
states: 5,958,200 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [[[~ [[[[[~ [p20<=p] & p<=p15] | [~ [[3<=p5 & 1<=p11]] | ~ [3<=p5]]] | p4<=p] & [~ [3<=p16] & [p16<=3 & [~ [p17<=1] | [3<=p & ~ [1<=p14]]]]]]] | [~ [[p16<=3 & [[~ [3<=p4] & p14<=p14] | [[~ [p7<=1] | [p6<=4 & p3<=p19]] | ~ [[p17<=2 & p3<=3]]]]]] | ~ [[[~ [[p<=p15 | p11<=1]] & ~ [[p<=3 | [1<=p7 & p15<=4]]]] & [p17<=4 & [p20<=2 & p6<=0]]]]]] & p12<=p4]]
normalized: ~ [E [true U ~ [[p12<=p4 & [[~ [[[p17<=4 & [p20<=2 & p6<=0]] & [~ [[p<=3 | [1<=p7 & p15<=4]]] & ~ [[p<=p15 | p11<=1]]]]] | ~ [[p16<=3 & [[~ [[p17<=2 & p3<=3]] | [[p6<=4 & p3<=p19] | ~ [p7<=1]]] | [p14<=p14 & ~ [3<=p4]]]]]] | ~ [[[[p16<=3 & [[3<=p & ~ [1<=p14]] | ~ [p17<=1]]] & ~ [3<=p16]] & [p4<=p | [[~ [3<=p5] | ~ [[3<=p5 & 1<=p11]]] | [p<=p15 & ~ [p20<=p]]]]]]]]]]]

abstracting: (p20<=p)
states: 11,916,400 (7)
abstracting: (p<=p15)
states: 6,434,856 (6)
abstracting: (1<=p11)
states: 10,724,760 (7)
abstracting: (3<=p5)
states: 2,144,952 (6)
abstracting: (3<=p5)
states: 2,144,952 (6)
abstracting: (p4<=p)
states: 8,341,480 (6)
abstracting: (3<=p16)
states: 5,481,544 (6)
abstracting: (p17<=1)
states: 9,771,448 (6)
abstracting: (1<=p14)
states: 8,818,136 (6)
abstracting: (3<=p)
states: 0
abstracting: (p16<=3)
states: 11,916,400 (7)
abstracting: (3<=p4)
states: 5,481,544 (6)
abstracting: (p14<=p14)
states: 14,776,336 (7)
abstracting: (p7<=1)
states: 9,771,448 (6)
abstracting: (p3<=p19)
states: 10,205,820 (7)
abstracting: (p6<=4)
states: 13,346,368 (7)
abstracting: (p3<=3)
states: 14,061,352 (7)
abstracting: (p17<=2)
states: 12,393,056 (7)
abstracting: (p16<=3)
states: 11,916,400 (7)
abstracting: (p11<=1)
states: 5,958,200 (6)
abstracting: (p<=p15)
states: 6,434,856 (6)
abstracting: (p15<=4)
states: 13,108,040 (7)
abstracting: (1<=p7)
states: 9,533,120 (6)
abstracting: (p<=3)
states: 14,776,336 (7)
abstracting: (p6<=0)
states: 4,051,576 (6)
abstracting: (p20<=2)
states: 12,631,384 (7)
abstracting: (p17<=4)
states: 14,538,008 (7)
abstracting: (p12<=p4)
states: 9,733,008 (6)
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EF [[[[[~ [[[p2<=p12 | 2<=p5] & ~ [[p<=0 & p12<=2]]]] | p15<=1] | [[[2<=p & [[~ [p20<=4] | p13<=3] | [[p11<=p | p12<=p17] & [p8<=p9 & p9<=1]]]] & [4<=p2 & [p9<=p6 & 2<=p12]]] | [[[[[p4<=p19 | p3<=1] & p8<=3] & ~ [[3<=p4 | 4<=p4]]] | p12<=4] | [[~ [[3<=p14 | p20<=4]] & ~ [p9<=2]] & [[[p1<=0 & 1<=p9] | [p16<=3 | 4<=p7]] | [p2<=p15 | [4<=p19 | p3<=p10]]]]]]] & p11<=3] & [p12<=p11 & p5<=p13]]]
normalized: E [true U [[p12<=p11 & p5<=p13] & [p11<=3 & [[[[[[p2<=p15 | [4<=p19 | p3<=p10]] | [[p16<=3 | 4<=p7] | [p1<=0 & 1<=p9]]] & [~ [p9<=2] & ~ [[3<=p14 | p20<=4]]]] | [p12<=4 | [~ [[3<=p4 | 4<=p4]] & [p8<=3 & [p4<=p19 | p3<=1]]]]] | [[4<=p2 & [p9<=p6 & 2<=p12]] & [2<=p & [[[p8<=p9 & p9<=1] & [p11<=p | p12<=p17]] | [p13<=3 | ~ [p20<=4]]]]]] | [p15<=1 | ~ [[~ [[p<=0 & p12<=2]] & [p2<=p12 | 2<=p5]]]]]]]]

abstracting: (2<=p5)
states: 2,859,936 (6)
abstracting: (p2<=p12)
states: 9,333,232 (6)
abstracting: (p12<=2)
states: 12,393,056 (7)
abstracting: (p<=0)
states: 0
abstracting: (p15<=1)
states: 11,916,400 (7)
abstracting: (p20<=4)
states: 13,108,040 (7)
abstracting: (p13<=3)
states: 14,061,352 (7)
abstracting: (p12<=p17)
states: 9,333,232 (6)
abstracting: (p11<=p)
states: 5,958,200 (6)
abstracting: (p9<=1)
states: 8,341,480 (6)
abstracting: (p8<=p9)
states: 10,009,776 (7)
abstracting: (2<=p)
states: 0
abstracting: (2<=p12)
states: 5,004,888 (6)
abstracting: (p9<=p6)
states: 9,056,464 (6)
abstracting: (4<=p2)
states: 953,312 (5)
abstracting: (p3<=1)
states: 10,248,104 (7)
abstracting: (p4<=p19)
states: 9,267,884 (6)
abstracting: (p8<=3)
states: 14,061,352 (7)
abstracting: (4<=p4)
states: 2,144,952 (6)
abstracting: (3<=p4)
states: 5,481,544 (6)
abstracting: (p12<=4)
states: 14,538,008 (7)
abstracting: (p20<=4)
states: 13,108,040 (7)
abstracting: (3<=p14)
states: 5,481,544 (6)
abstracting: (p9<=2)
states: 9,294,792 (6)
abstracting: (1<=p9)
states: 8,818,136 (6)
abstracting: (p1<=0)
states: 4,051,576 (6)
abstracting: (4<=p7)
states: 953,312 (5)
abstracting: (p16<=3)
states: 11,916,400 (7)
abstracting: (p3<=p10)
states: 8,610,560 (6)
abstracting: (4<=p19)
states: 2,144,952 (6)
abstracting: (p2<=p15)
states: 8,060,868 (6)
abstracting: (p11<=3)
states: 11,916,400 (7)
abstracting: (p5<=p13)
states: 10,717,072 (7)
abstracting: (p12<=p11)
states: 10,724,760 (7)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [[[[p5<=p20 | [~ [[~ [[p5<=1 & 1<=p9]] | p1<=0]] | [[~ [[[p17<=p9 | 4<=p12] & [p17<=p2 | p10<=p16]]] & ~ [[[p3<=p16 & 4<=p20] | [p9<=2 | 3<=p4]]]] | [[~ [p13<=p8] & 2<=p10] | [~ [[p10<=p10 & p16<=1]] & ~ [p10<=p4]]]]]] | ~ [3<=p7]] & [[~ [[[~ [p15<=p] | ~ [2<=p13]] & p10<=1]] & [p7<=p17 & [[~ [[[3<=p7 & 1<=p6] | p16<=p14]] & 4<=p19] | [[[~ [p5<=p9] | p19<=0] | p11<=p1] | ~ [p5<=4]]]]] & [[p9<=4 & ~ [p10<=0]] | [[p14<=p11 | [~ [[p5<=p1 & 3<=p5]] & [[~ [p20<=3] & p2<=2] | p20<=p10]]] & p14<=p10]]]]]
normalized: E [true U [[[[p7<=p17 & [[4<=p19 & ~ [[p16<=p14 | [3<=p7 & 1<=p6]]]] | [~ [p5<=4] | [p11<=p1 | [p19<=0 | ~ [p5<=p9]]]]]] & ~ [[p10<=1 & [~ [2<=p13] | ~ [p15<=p]]]]] & [[p14<=p10 & [p14<=p11 | [[p20<=p10 | [p2<=2 & ~ [p20<=3]]] & ~ [[p5<=p1 & 3<=p5]]]]] | [p9<=4 & ~ [p10<=0]]]] & [~ [3<=p7] | [p5<=p20 | [[[[~ [[p10<=p10 & p16<=1]] & ~ [p10<=p4]] | [~ [p13<=p8] & 2<=p10]] | [~ [[[p9<=2 | 3<=p4] | [p3<=p16 & 4<=p20]]] & ~ [[[p17<=p2 | p10<=p16] & [p17<=p9 | 4<=p12]]]]] | ~ [[p1<=0 | ~ [[p5<=1 & 1<=p9]]]]]]]]]

abstracting: (1<=p9)
states: 8,818,136 (6)
abstracting: (p5<=1)
states: 11,916,400 (7)
abstracting: (p1<=0)
states: 4,051,576 (6)
abstracting: (4<=p12)
states: 953,312 (5)
abstracting: (p17<=p9)
states: 9,733,008 (6)
abstracting: (p10<=p16)
states: 11,601,192 (7)
abstracting: (p17<=p2)
states: 9,333,232 (6)
abstracting: (4<=p20)
states: 2,144,952 (6)
abstracting: (p3<=p16)
states: 11,216,792 (7)
abstracting: (3<=p4)
states: 5,481,544 (6)
abstracting: (p9<=2)
states: 9,294,792 (6)
abstracting: (2<=p10)
states: 2,859,936 (6)
abstracting: (p13<=p8)
states: 9,510,056 (6)
abstracting: (p10<=p4)
states: 10,932,336 (7)
abstracting: (p16<=1)
states: 5,958,200 (6)
abstracting: (p10<=p10)
states: 14,776,336 (7)
abstracting: (p5<=p20)
states: 10,271,168 (7)
abstracting: (3<=p7)
states: 2,383,280 (6)
abstracting: (p10<=0)
states: 8,341,480 (6)
abstracting: (p9<=4)
states: 14,061,352 (7)
abstracting: (3<=p5)
states: 2,144,952 (6)
abstracting: (p5<=p1)
states: 11,678,072 (7)
abstracting: (p20<=3)
states: 12,631,384 (7)
abstracting: (p2<=2)
states: 12,393,056 (7)
abstracting: (p20<=p10)
states: 10,271,168 (7)
abstracting: (p14<=p11)
states: 9,056,464 (6)
abstracting: (p14<=p10)
states: 7,907,108 (6)
abstracting: (p15<=p)
states: 11,916,400 (7)
abstracting: (2<=p13)
states: 4,528,232 (6)
abstracting: (p10<=1)
states: 11,916,400 (7)
abstracting: (p5<=p9)
states: 10,932,336 (7)
abstracting: (p19<=0)
states: 5,958,200 (6)
abstracting: (p11<=p1)
states: 8,783,540 (6)
abstracting: (p5<=4)
states: 13,108,040 (7)
abstracting: (1<=p6)
states: 10,724,760 (7)
abstracting: (3<=p7)
states: 2,383,280 (6)
abstracting: (p16<=p14)
states: 7,884,044 (6)
abstracting: (4<=p19)
states: 2,144,952 (6)
abstracting: (p7<=p17)
states: 9,333,232 (6)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.092sec

checking: EF [[[[2<=p12 | [[~ [[~ [[p3<=p13 | p<=p4]] & [[p4<=p7 | p17<=p20] | p<=p18]]] | [4<=p13 | p10<=p13]] | [~ [[p6<=2 & 2<=p11]] & ~ [p9<=2]]]] & [[[[~ [[~ [3<=p9] & [4<=p2 & p8<=p10]]] | ~ [[~ [p10<=3] | [p<=p2 & 2<=p13]]]] & 1<=p4] | p9<=2] & [4<=p10 & ~ [[~ [[3<=p16 | [p19<=p3 & p16<=0]]] & [~ [[p3<=p3 & p16<=2]] | ~ [[4<=p8 & 3<=p17]]]]]]]] | [[~ [[[~ [p17<=4] | [~ [p14<=p20] & ~ [1<=p16]]] | ~ [p10<=1]]] & [p7<=4 & [[[~ [p1<=p18] | 3<=p6] & [~ [2<=p13] | 3<=p4]] | [~ [[[p1<=p | p11<=0] | p8<=4]] | [[p3<=3 | [p8<=p13 | 2<=p9]] | [4<=p20 | [p3<=p | p14<=p]]]]]]] | ~ [[~ [[~ [[[p10<=p18 & p1<=p] & [p19<=0 | p8<=p5]]] | p15<=0]] & [[p19<=4 | [[1<=p7 & [3<=p17 & p11<=p18]] | [p6<=3 | [p8<=1 & p8<=p8]]]] & ~ [[[p3<=p10 | ~ [p4<=4]] | ~ [[p18<=p14 | 2<=p17]]]]]]]]]]
normalized: E [true U [[~ [[[~ [[~ [[p18<=p14 | 2<=p17]] | [p3<=p10 | ~ [p4<=4]]]] & [p19<=4 | [[p6<=3 | [p8<=1 & p8<=p8]] | [1<=p7 & [3<=p17 & p11<=p18]]]]] & ~ [[p15<=0 | ~ [[[p19<=0 | p8<=p5] & [p10<=p18 & p1<=p]]]]]]] | [[p7<=4 & [[[[4<=p20 | [p3<=p | p14<=p]] | [p3<=3 | [p8<=p13 | 2<=p9]]] | ~ [[p8<=4 | [p1<=p | p11<=0]]]] | [[3<=p4 | ~ [2<=p13]] & [3<=p6 | ~ [p1<=p18]]]]] & ~ [[~ [p10<=1] | [[~ [1<=p16] & ~ [p14<=p20]] | ~ [p17<=4]]]]]] | [[[4<=p10 & ~ [[[~ [[4<=p8 & 3<=p17]] | ~ [[p3<=p3 & p16<=2]]] & ~ [[3<=p16 | [p19<=p3 & p16<=0]]]]]] & [p9<=2 | [1<=p4 & [~ [[[p<=p2 & 2<=p13] | ~ [p10<=3]]] | ~ [[[4<=p2 & p8<=p10] & ~ [3<=p9]]]]]]] & [2<=p12 | [[~ [p9<=2] & ~ [[p6<=2 & 2<=p11]]] | [[4<=p13 | p10<=p13] | ~ [[[p<=p18 | [p4<=p7 | p17<=p20]] & ~ [[p3<=p13 | p<=p4]]]]]]]]]]

abstracting: (p<=p4)
states: 8,818,136 (6)
abstracting: (p3<=p13)
states: 9,510,056 (6)
abstracting: (p17<=p20)
states: 7,626,496 (6)
abstracting: (p4<=p7)
states: 8,452,956 (6)
abstracting: (p<=p18)
states: 8,818,136 (6)
abstracting: (p10<=p13)
states: 10,717,072 (7)
abstracting: (4<=p13)
states: 714,984 (5)
abstracting: (2<=p11)
states: 8,818,136 (6)
abstracting: (p6<=2)
states: 9,294,792 (6)
abstracting: (p9<=2)
states: 9,294,792 (6)
abstracting: (2<=p12)
states: 5,004,888 (6)
abstracting: (3<=p9)
states: 5,481,544 (6)
abstracting: (p8<=p10)
states: 8,103,152 (6)
abstracting: (4<=p2)
states: 953,312 (5)
abstracting: (p10<=3)
states: 12,631,384 (7)
abstracting: (2<=p13)
states: 4,528,232 (6)
abstracting: (p<=p2)
states: 9,533,120 (6)
abstracting: (1<=p4)
states: 8,818,136 (6)
abstracting: (p9<=2)
states: 9,294,792 (6)
abstracting: (p16<=0)
states: 4,051,576 (6)
abstracting: (p19<=p3)
states: 8,172,344 (6)
abstracting: (3<=p16)
states: 5,481,544 (6)
abstracting: (p16<=2)
states: 9,294,792 (6)
abstracting: (p3<=p3)
states: 14,776,336 (7)
abstracting: (3<=p17)
states: 2,383,280 (6)
abstracting: (4<=p8)
states: 714,984 (5)
abstracting: (4<=p10)
states: 2,144,952 (6)
abstracting: (p17<=4)
states: 14,538,008 (7)
abstracting: (p14<=p20)
states: 7,907,108 (6)
abstracting: (1<=p16)
states: 10,724,760 (7)
abstracting: (p10<=1)
states: 11,916,400 (7)
abstracting: (p1<=p18)
states: 6,619,368 (6)
abstracting: (3<=p6)
states: 5,481,544 (6)
abstracting: (2<=p13)
states: 4,528,232 (6)
abstracting: (3<=p4)
states: 5,481,544 (6)
abstracting: (p11<=0)
states: 4,051,576 (6)
abstracting: (p1<=p)
states: 5,958,200 (6)
abstracting: (p8<=4)
states: 14,776,336 (7)
abstracting: (2<=p9)
states: 6,434,856 (6)
abstracting: (p8<=p13)
states: 9,510,056 (6)
abstracting: (p3<=3)
states: 14,061,352 (7)
abstracting: (p14<=p)
states: 8,341,480 (6)
abstracting: (p3<=p)
states: 10,248,104 (7)
abstracting: (4<=p20)
states: 2,144,952 (6)
abstracting: (p7<=4)
states: 14,538,008 (7)
abstracting: (p1<=p)
states: 5,958,200 (6)
abstracting: (p10<=p18)
states: 10,717,072 (7)
abstracting: (p8<=p5)
states: 8,610,560 (6)
abstracting: (p19<=0)
states: 5,958,200 (6)
abstracting: (p15<=0)
states: 8,341,480 (6)
abstracting: (p11<=p18)
states: 6,619,368 (6)
abstracting: (3<=p17)
states: 2,383,280 (6)
abstracting: (1<=p7)
states: 9,533,120 (6)
abstracting: (p8<=p8)
states: 14,776,336 (7)
abstracting: (p8<=1)
states: 10,248,104 (7)
abstracting: (p6<=3)
states: 11,916,400 (7)
abstracting: (p19<=4)
states: 14,061,352 (7)
abstracting: (p4<=4)
states: 14,061,352 (7)
abstracting: (p3<=p10)
states: 8,610,560 (6)
abstracting: (2<=p17)
states: 5,004,888 (6)
abstracting: (p18<=p14)
states: 10,205,820 (7)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0004-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

totally nodes used: 313815 (3.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 427781 312289 740070
used/not used/entry size/cache size: 522761 66586103 16 1024MB
basic ops cache: hits/miss/sum: 427284 322802 750086
used/not used/entry size/cache size: 676554 16100662 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: 26661 18229 44890
used/not used/entry size/cache size: 18218 8370390 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 66825293
1 268512
2 11208
3 1607
4 760
5 350
6 269
7 168
8 139
9 79
>= 10 479

Total processing time: 0m 4.602sec


BK_STOP 1679452031030

--------------------
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
p
found 1 constant places
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:337 (10), effective:68 (2)

initing FirstDep: 0m 0.000sec


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

iterations count:47 (1), effective:5 (0)

iterations count:71 (2), effective:5 (0)

iterations count:57 (1), effective:5 (0)

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

iterations count:219 (6), effective:60 (1)

iterations count:257 (7), effective:55 (1)

iterations count:143 (4), effective:29 (0)

iterations count:115 (3), effective:31 (0)

iterations count:131 (3), effective:36 (1)

iterations count:88 (2), effective:21 (0)

iterations count:190 (5), effective:44 (1)

iterations count:99 (3), effective:18 (0)

iterations count:182 (5), effective:41 (1)

iterations count:293 (8), effective:84 (2)

iterations count:37 (1), effective:4 (0)

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="JoinFreeModules-PT-0004"
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 JoinFreeModules-PT-0004, 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 r234-tall-167856419900150"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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