fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r129-smll-167819404300446
Last Updated
May 14, 2023

About the Execution of Marcie for DoubleExponent-PT-001

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5448.315 5707.00 4793.00 257.40 TTTTFFFFTTFTTFTF normal

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.r129-smll-167819404300446.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 marcie
Input is DoubleExponent-PT-001, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r129-smll-167819404300446
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 5.1K Feb 26 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 26 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 17K 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 DoubleExponent-PT-001-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-001-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1680000590562

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=marcie
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
Not applying reductions.
Model is PT
ReachabilityCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DoubleExponent_PT_001
(NrP: 57 NrTr: 48 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 3.483sec


RS generation: 0m 0.013sec


-> reachability set: #nodes 952 (9.5e+02) #states 149



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

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

abstracting: (1<=p18)
states: 4
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

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

abstracting: (1<=p6)
states: 1
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [p24<=0]
normalized: ~ [E [true U ~ [p24<=0]]]

abstracting: (p24<=0)
states: 112
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [p43<=p1]
normalized: E [true U p43<=p1]

abstracting: (p43<=p1)
states: 144
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[~ [1<=p31] | p40<=0]]
normalized: ~ [E [true U ~ [[~ [1<=p31] | p40<=0]]]]

abstracting: (p40<=0)
states: 147
abstracting: (1<=p31)
states: 10
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[p28<=p15 | [p20<=1 | [p12<=1 & 1<=p28]]]]
normalized: E [true U [[[p12<=1 & 1<=p28] | p20<=1] | p28<=p15]]

abstracting: (p28<=p15)
states: 145
abstracting: (p20<=1)
states: 149
abstracting: (1<=p28)
states: 4
abstracting: (p12<=1)
states: 137
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[p42<=0 & [p49<=p48 & ~ [[p28<=p36 & [1<=p6 | p50<=0]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[1<=p6 | p50<=0] & p28<=p36]] & p49<=p48] & p42<=0]]]]

abstracting: (p42<=0)
states: 148
abstracting: (p49<=p48)
states: 148
abstracting: (p28<=p36)
states: 145
abstracting: (p50<=0)
states: 140
abstracting: (1<=p6)
states: 1
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[~ [[~ [[[p18<=1 & ~ [[p36<=p38 | [p1<=1 & p56<=0]]]] | [~ [1<=p33] | [~ [[1<=p19 & p2<=0]] & [[p15<=0 | 1<=p34] & ~ [1<=p50]]]]]] | p39<=1]] & ~ [1<=p57]]]
normalized: ~ [E [true U ~ [[~ [1<=p57] & ~ [[~ [[[[[~ [1<=p50] & [p15<=0 | 1<=p34]] & ~ [[1<=p19 & p2<=0]]] | ~ [1<=p33]] | [~ [[[p1<=1 & p56<=0] | p36<=p38]] & p18<=1]]] | p39<=1]]]]]]

abstracting: (p39<=1)
states: 149
abstracting: (p18<=1)
states: 149
abstracting: (p36<=p38)
states: 127
abstracting: (p56<=0)
states: 13
abstracting: (p1<=1)
states: 149
abstracting: (1<=p33)
states: 6
abstracting: (p2<=0)
states: 148
abstracting: (1<=p19)
states: 4
abstracting: (1<=p34)
states: 6
abstracting: (p15<=0)
states: 147
abstracting: (1<=p50)
states: 9
abstracting: (1<=p57)
states: 135
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[~ [[[[~ [p51<=p36] | p54<=p57] | p25<=0] & 1<=p39]] & [[~ [[1<=p21 & ~ [[~ [[p12<=p23 & p51<=1]] & 1<=p38]]]] & p38<=p1] & p21<=0]]]
normalized: ~ [E [true U ~ [[[[~ [[~ [[~ [[p12<=p23 & p51<=1]] & 1<=p38]] & 1<=p21]] & p38<=p1] & p21<=0] & ~ [[[[~ [p51<=p36] | p54<=p57] | p25<=0] & 1<=p39]]]]]]

abstracting: (1<=p39)
states: 2
abstracting: (p25<=0)
states: 148
abstracting: (p54<=p57)
states: 149
abstracting: (p51<=p36)
states: 146
abstracting: (p21<=0)
states: 145
abstracting: (p38<=p1)
states: 147
abstracting: (1<=p21)
states: 4
abstracting: (1<=p38)
states: 2
abstracting: (p51<=1)
states: 149
abstracting: (p12<=p23)
states: 101
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [~ [[p50<=1 & [[[[~ [[p48<=p54 & p13<=p28]] & [~ [1<=p28] | p57<=1]] | p23<=1] & [~ [p16<=1] | [~ [1<=p17] | [[p41<=1 & p9<=p21] | p13<=p48]]]] | ~ [p28<=0]]]]]
normalized: E [true U ~ [[[~ [p28<=0] | [[[[[p41<=1 & p9<=p21] | p13<=p48] | ~ [1<=p17]] | ~ [p16<=1]] & [[[~ [1<=p28] | p57<=1] & ~ [[p48<=p54 & p13<=p28]]] | p23<=1]]] & p50<=1]]]

abstracting: (p50<=1)
states: 149
abstracting: (p23<=1)
states: 149
abstracting: (p13<=p28)
states: 15
abstracting: (p48<=p54)
states: 139
abstracting: (p57<=1)
states: 34
abstracting: (1<=p28)
states: 4
abstracting: (p16<=1)
states: 149
abstracting: (1<=p17)
states: 4
abstracting: (p13<=p48)
states: 21
abstracting: (p9<=p21)
states: 31
abstracting: (p41<=1)
states: 149
abstracting: (p28<=0)
states: 145
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[[[[[~ [p18<=1] & p1<=p47] & [~ [[[[p55<=p5 | 1<=p48] & p41<=p32] | ~ [p37<=p54]]] & p56<=0]] | [[p15<=p44 | ~ [p56<=p57]] | [[p1<=p6 & ~ [p28<=p47]] & 1<=p1]]] | [p45<=p22 | p53<=p2]] | ~ [[~ [p42<=p2] | p25<=p56]]]]
normalized: E [true U [[[[[[~ [p28<=p47] & p1<=p6] & 1<=p1] | [~ [p56<=p57] | p15<=p44]] | [[~ [[~ [p37<=p54] | [[p55<=p5 | 1<=p48] & p41<=p32]]] & p56<=0] & [~ [p18<=1] & p1<=p47]]] | [p45<=p22 | p53<=p2]] | ~ [[~ [p42<=p2] | p25<=p56]]]]

abstracting: (p25<=p56)
states: 149
abstracting: (p42<=p2)
states: 148
abstracting: (p53<=p2)
states: 146
abstracting: (p45<=p22)
states: 146
abstracting: (p1<=p47)
states: 148
abstracting: (p18<=1)
states: 149
abstracting: (p56<=0)
states: 13
abstracting: (p41<=p32)
states: 148
abstracting: (1<=p48)
states: 11
abstracting: (p55<=p5)
states: 12
abstracting: (p37<=p54)
states: 147
abstracting: (p15<=p44)
states: 147
abstracting: (p56<=p57)
states: 145
abstracting: (1<=p1)
states: 1
abstracting: (p1<=p6)
states: 148
abstracting: (p28<=p47)
states: 145
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[[p40<=p43 & [1<=p54 & [1<=p26 & [[p25<=p8 & p37<=1] | [p50<=1 | [[p1<=0 & [p45<=p39 | p2<=1]] | [[p7<=0 & 1<=p38] & [p47<=p48 | 1<=p38]]]]]]]] | ~ [[[~ [p40<=p23] | [[~ [p15<=1] | ~ [[p40<=1 & p55<=p47]]] & [~ [[p48<=p21 | 1<=p11]] | [[p13<=0 | p3<=p33] | [p44<=0 & p9<=0]]]]] | 1<=p50]]]]
normalized: E [true U [~ [[[[[[[p44<=0 & p9<=0] | [p13<=0 | p3<=p33]] | ~ [[p48<=p21 | 1<=p11]]] & [~ [[p40<=1 & p55<=p47]] | ~ [p15<=1]]] | ~ [p40<=p23]] | 1<=p50]] | [[[[[[[[p47<=p48 | 1<=p38] & [p7<=0 & 1<=p38]] | [[p45<=p39 | p2<=1] & p1<=0]] | p50<=1] | [p25<=p8 & p37<=1]] & 1<=p26] & 1<=p54] & p40<=p43]]]

abstracting: (p40<=p43)
states: 147
abstracting: (1<=p54)
states: 3
abstracting: (1<=p26)
states: 4
abstracting: (p37<=1)
states: 149
abstracting: (p25<=p8)
states: 149
abstracting: (p50<=1)
states: 149
abstracting: (p1<=0)
states: 148
abstracting: (p2<=1)
states: 149
abstracting: (p45<=p39)
states: 146
abstracting: (1<=p38)
states: 2
abstracting: (p7<=0)
states: 148
abstracting: (1<=p38)
states: 2
abstracting: (p47<=p48)
states: 146
abstracting: (1<=p50)
states: 9
abstracting: (p40<=p23)
states: 147
abstracting: (p15<=1)
states: 149
abstracting: (p55<=p47)
states: 12
abstracting: (p40<=1)
states: 149
abstracting: (1<=p11)
states: 56
abstracting: (p48<=p21)
states: 138
abstracting: (p3<=p33)
states: 148
abstracting: (p13<=0)
states: 15
abstracting: (p9<=0)
states: 29
abstracting: (p44<=0)
states: 146
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [~ [[[[[[[[1<=p44 | [1<=p51 | p14<=p17]] | [[p25<=1 | p47<=1] & [p25<=p56 & 1<=p34]]] | ~ [[p12<=1 | ~ [p36<=0]]]] | ~ [1<=p50]] & [~ [[1<=p18 | p46<=1]] & ~ [[~ [[p26<=1 & 1<=p2]] | [[p36<=p48 & p27<=1] | [p17<=p12 | p18<=0]]]]]] & [[1<=p3 | p19<=1] | [p13<=p20 & [~ [1<=p19] | [~ [[p26<=p44 | 1<=p52]] & [[p39<=p44 & 1<=p3] | [p1<=0 & p41<=p10]]]]]]] & [1<=p32 & [~ [p53<=0] & ~ [[~ [[p39<=p22 & p49<=1]] & [[[p1<=p1 & p1<=1] & ~ [1<=p23]] | p14<=0]]]]]]]]
normalized: ~ [E [true U [[[~ [[[[~ [1<=p23] & [p1<=p1 & p1<=1]] | p14<=0] & ~ [[p39<=p22 & p49<=1]]]] & ~ [p53<=0]] & 1<=p32] & [[[[[[[p1<=0 & p41<=p10] | [p39<=p44 & 1<=p3]] & ~ [[p26<=p44 | 1<=p52]]] | ~ [1<=p19]] & p13<=p20] | [1<=p3 | p19<=1]] & [[~ [[[[p17<=p12 | p18<=0] | [p36<=p48 & p27<=1]] | ~ [[p26<=1 & 1<=p2]]]] & ~ [[1<=p18 | p46<=1]]] & [~ [1<=p50] | [~ [[~ [p36<=0] | p12<=1]] | [[[p25<=p56 & 1<=p34] & [p25<=1 | p47<=1]] | [[1<=p51 | p14<=p17] | 1<=p44]]]]]]]]]

abstracting: (1<=p44)
states: 3
abstracting: (p14<=p17)
states: 147
abstracting: (1<=p51)
states: 9
abstracting: (p47<=1)
states: 149
abstracting: (p25<=1)
states: 149
abstracting: (1<=p34)
states: 6
abstracting: (p25<=p56)
states: 149
abstracting: (p12<=1)
states: 137
abstracting: (p36<=0)
states: 127
abstracting: (1<=p50)
states: 9
abstracting: (p46<=1)
states: 149
abstracting: (1<=p18)
states: 4
abstracting: (1<=p2)
states: 1
abstracting: (p26<=1)
states: 149
abstracting: (p27<=1)
states: 149
abstracting: (p36<=p48)
states: 127
abstracting: (p18<=0)
states: 145
abstracting: (p17<=p12)
states: 145
abstracting: (p19<=1)
states: 149
abstracting: (1<=p3)
states: 1
abstracting: (p13<=p20)
states: 15
abstracting: (1<=p19)
states: 4
abstracting: (1<=p52)
states: 9
abstracting: (p26<=p44)
states: 145
abstracting: (1<=p3)
states: 1
abstracting: (p39<=p44)
states: 147
abstracting: (p41<=p10)
states: 149
abstracting: (p1<=0)
states: 148
abstracting: (1<=p32)
states: 6
abstracting: (p53<=0)
states: 146
abstracting: (p49<=1)
states: 149
abstracting: (p39<=p22)
states: 147
abstracting: (p14<=0)
states: 147
abstracting: (p1<=1)
states: 149
abstracting: (p1<=p1)
states: 149
abstracting: (1<=p23)
states: 2
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[[[~ [[1<=p26 & ~ [[p13<=p40 & [[1<=p21 | 1<=p40] & [1<=p38 | 1<=p16]]]]]] & ~ [[~ [[1<=p15 | 1<=p37]] | p22<=0]]] & ~ [1<=p56]] & [[~ [[p10<=0 & ~ [p38<=p27]]] | ~ [[~ [[[~ [p31<=p52] | [1<=p48 | p2<=1]] | [p49<=p24 | p44<=1]]] | [[~ [1<=p51] | [~ [p9<=1] | [p23<=0 & 1<=p36]]] | ~ [[~ [1<=p53] & [1<=p10 | 1<=p39]]]]]]] & [[[~ [[~ [[1<=p30 | p51<=p42]] & [[p4<=p9 & 1<=p22] | p11<=1]]] | [[[p37<=1 | [p21<=1 | p50<=p42]] | [[p43<=p37 | p16<=1] & ~ [1<=p37]]] | [~ [1<=p41] & [~ [1<=p12] & [1<=p7 | 1<=p42]]]]] & [[~ [[p32<=p34 | p1<=p54]] & p39<=p43] & 1<=p26]] & 1<=p27]]]]
normalized: ~ [E [true U ~ [[[[[[[~ [[p32<=p34 | p1<=p54]] & p39<=p43] & 1<=p26] & [[[[[1<=p7 | 1<=p42] & ~ [1<=p12]] & ~ [1<=p41]] | [[~ [1<=p37] & [p43<=p37 | p16<=1]] | [[p21<=1 | p50<=p42] | p37<=1]]] | ~ [[[[p4<=p9 & 1<=p22] | p11<=1] & ~ [[1<=p30 | p51<=p42]]]]]] & 1<=p27] & [~ [[[~ [[[1<=p10 | 1<=p39] & ~ [1<=p53]]] | [[[p23<=0 & 1<=p36] | ~ [p9<=1]] | ~ [1<=p51]]] | ~ [[[p49<=p24 | p44<=1] | [[1<=p48 | p2<=1] | ~ [p31<=p52]]]]]] | ~ [[~ [p38<=p27] & p10<=0]]]] & [~ [1<=p56] & [~ [[~ [[1<=p15 | 1<=p37]] | p22<=0]] & ~ [[~ [[[[1<=p38 | 1<=p16] & [1<=p21 | 1<=p40]] & p13<=p40]] & 1<=p26]]]]]]]]

abstracting: (1<=p26)
states: 4
abstracting: (p13<=p40)
states: 15
abstracting: (1<=p40)
states: 2
abstracting: (1<=p21)
states: 4
abstracting: (1<=p16)
states: 4
abstracting: (1<=p38)
states: 2
abstracting: (p22<=0)
states: 75
abstracting: (1<=p37)
states: 2
abstracting: (1<=p15)
states: 2
abstracting: (1<=p56)
states: 136
abstracting: (p10<=0)
states: 24
abstracting: (p38<=p27)
states: 147
abstracting: (p31<=p52)
states: 139
abstracting: (p2<=1)
states: 149
abstracting: (1<=p48)
states: 11
abstracting: (p44<=1)
states: 149
abstracting: (p49<=p24)
states: 149
abstracting: (1<=p51)
states: 9
abstracting: (p9<=1)
states: 95
abstracting: (1<=p36)
states: 22
abstracting: (p23<=0)
states: 147
abstracting: (1<=p53)
states: 3
abstracting: (1<=p39)
states: 2
abstracting: (1<=p10)
states: 125
abstracting: (1<=p27)
states: 4
abstracting: (p51<=p42)
states: 140
abstracting: (1<=p30)
states: 2
abstracting: (p11<=1)
states: 133
abstracting: (1<=p22)
states: 74
abstracting: (p4<=p9)
states: 148
abstracting: (p37<=1)
states: 149
abstracting: (p50<=p42)
states: 140
abstracting: (p21<=1)
states: 149
abstracting: (p16<=1)
states: 149
abstracting: (p43<=p37)
states: 144
abstracting: (1<=p37)
states: 2
abstracting: (1<=p41)
states: 1
abstracting: (1<=p12)
states: 48
abstracting: (1<=p42)
states: 1
abstracting: (1<=p7)
states: 1
abstracting: (1<=p26)
states: 4
abstracting: (p39<=p43)
states: 147
abstracting: (p1<=p54)
states: 148
abstracting: (p32<=p34)
states: 143
-> the formula is FALSE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [[~ [[[[p7<=1 & ~ [[1<=p43 & ~ [[p20<=p8 | p35<=p52]]]]] & [[1<=p21 | [[[p5<=1 & p48<=p37] & ~ [p55<=p27]] | 1<=p18]] | [[[[p41<=p26 | p39<=0] & p25<=1] | ~ [[p21<=p16 & p36<=0]]] & [p12<=p15 & [~ [1<=p15] & ~ [p45<=0]]]]]] & [~ [[1<=p28 & [~ [[p37<=p10 | 1<=p46]] | 1<=p5]]] | [[[[~ [p38<=1] & ~ [p10<=p48]] | 1<=p30] & [p45<=1 & ~ [p57<=0]]] | [~ [p52<=0] & 1<=p52]]]]] | ~ [[~ [p26<=p23] & [p9<=0 | [[~ [[1<=p5 & 1<=p51]] & [[[1<=p53 | p39<=p38] & [p52<=p48 | p50<=0]] | [~ [1<=p9] & [p41<=p34 | 1<=p12]]]] | ~ [[[1<=p19 & p53<=p9] & 1<=p16]]]]]]]]
normalized: E [true U [~ [[[~ [[[~ [[p37<=p10 | 1<=p46]] | 1<=p5] & 1<=p28]] | [[~ [p52<=0] & 1<=p52] | [[~ [p57<=0] & p45<=1] & [[~ [p10<=p48] & ~ [p38<=1]] | 1<=p30]]]] & [[[[[~ [p45<=0] & ~ [1<=p15]] & p12<=p15] & [~ [[p21<=p16 & p36<=0]] | [[p41<=p26 | p39<=0] & p25<=1]]] | [[[~ [p55<=p27] & [p5<=1 & p48<=p37]] | 1<=p18] | 1<=p21]] & [~ [[~ [[p20<=p8 | p35<=p52]] & 1<=p43]] & p7<=1]]]] | ~ [[[[~ [[[1<=p19 & p53<=p9] & 1<=p16]] | [[[[p41<=p34 | 1<=p12] & ~ [1<=p9]] | [[p52<=p48 | p50<=0] & [1<=p53 | p39<=p38]]] & ~ [[1<=p5 & 1<=p51]]]] | p9<=0] & ~ [p26<=p23]]]]]

abstracting: (p26<=p23)
states: 145
abstracting: (p9<=0)
states: 29
abstracting: (1<=p51)
states: 9
abstracting: (1<=p5)
states: 1
abstracting: (p39<=p38)
states: 147
abstracting: (1<=p53)
states: 3
abstracting: (p50<=0)
states: 140
abstracting: (p52<=p48)
states: 143
abstracting: (1<=p9)
states: 120
abstracting: (1<=p12)
states: 48
abstracting: (p41<=p34)
states: 148
abstracting: (1<=p16)
states: 4
abstracting: (p53<=p9)
states: 148
abstracting: (1<=p19)
states: 4
abstracting: (p7<=1)
states: 149
abstracting: (1<=p43)
states: 5
abstracting: (p35<=p52)
states: 143
abstracting: (p20<=p8)
states: 147
abstracting: (1<=p21)
states: 4
abstracting: (1<=p18)
states: 4
abstracting: (p48<=p37)
states: 138
abstracting: (p5<=1)
states: 149
abstracting: (p55<=p27)
states: 13
abstracting: (p25<=1)
states: 149
abstracting: (p39<=0)
states: 147
abstracting: (p41<=p26)
states: 148
abstracting: (p36<=0)
states: 127
abstracting: (p21<=p16)
states: 145
abstracting: (p12<=p15)
states: 101
abstracting: (1<=p15)
states: 2
abstracting: (p45<=0)
states: 146
abstracting: (1<=p30)
states: 2
abstracting: (p38<=1)
states: 149
abstracting: (p10<=p48)
states: 24
abstracting: (p45<=1)
states: 149
abstracting: (p57<=0)
states: 14
abstracting: (1<=p52)
states: 9
abstracting: (p52<=0)
states: 140
abstracting: (1<=p28)
states: 4
abstracting: (1<=p5)
states: 1
abstracting: (1<=p46)
states: 3
abstracting: (p37<=p10)
states: 149
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [[[[[[~ [p5<=1] | ~ [[p6<=p38 & [[1<=p54 | p16<=0] & ~ [p14<=0]]]]] | [p52<=0 | ~ [[[[1<=p45 | p40<=0] | p57<=p36] | p13<=p30]]]] & [~ [[~ [1<=p21] & [[~ [1<=p37] | p20<=p52] & p22<=p24]]] | [[~ [p45<=1] & ~ [1<=p37]] | ~ [p55<=p13]]]] & [[~ [[1<=p14 & p35<=p22]] & [[1<=p26 | [p31<=0 & [~ [1<=p54] | [p47<=0 | p7<=0]]]] | [~ [1<=p39] | [1<=p14 | ~ [[1<=p48 | p37<=p8]]]]]] & [[[[[1<=p10 & ~ [p7<=p36]] | [[p3<=0 | p30<=p23] | ~ [p21<=0]]] | [[[p10<=p29 | p48<=0] & [p36<=0 & p49<=p55]] & [~ [p33<=1] & ~ [1<=p3]]]] | p14<=p20] | [[~ [[1<=p31 & [p40<=1 | 1<=p23]]] & ~ [[[p23<=0 & 1<=p34] & ~ [p54<=0]]]] | [p41<=p19 & 1<=p52]]]]] | [[[~ [[[p34<=p28 & ~ [p7<=0]] & p48<=p5]] | [[[[~ [1<=p7] | [p30<=p12 & p26<=p55]] & 1<=p27] | [[~ [1<=p16] | ~ [p11<=p36]] & [[p30<=p48 & p16<=p23] & [p12<=0 & p37<=1]]]] & p15<=p31]] | p56<=0] | ~ [1<=p32]]]]
normalized: ~ [E [true U ~ [[[~ [1<=p32] | [[[[[[[p12<=0 & p37<=1] & [p30<=p48 & p16<=p23]] & [~ [p11<=p36] | ~ [1<=p16]]] | [[[p30<=p12 & p26<=p55] | ~ [1<=p7]] & 1<=p27]] & p15<=p31] | ~ [[[~ [p7<=0] & p34<=p28] & p48<=p5]]] | p56<=0]] | [[[[[p41<=p19 & 1<=p52] | [~ [[~ [p54<=0] & [p23<=0 & 1<=p34]]] & ~ [[[p40<=1 | 1<=p23] & 1<=p31]]]] | [[[[~ [1<=p3] & ~ [p33<=1]] & [[p36<=0 & p49<=p55] & [p10<=p29 | p48<=0]]] | [[~ [p21<=0] | [p3<=0 | p30<=p23]] | [~ [p7<=p36] & 1<=p10]]] | p14<=p20]] & [[[[~ [[1<=p48 | p37<=p8]] | 1<=p14] | ~ [1<=p39]] | [[[[p47<=0 | p7<=0] | ~ [1<=p54]] & p31<=0] | 1<=p26]] & ~ [[1<=p14 & p35<=p22]]]] & [[[~ [p55<=p13] | [~ [1<=p37] & ~ [p45<=1]]] | ~ [[[[~ [1<=p37] | p20<=p52] & p22<=p24] & ~ [1<=p21]]]] & [[~ [[[[1<=p45 | p40<=0] | p57<=p36] | p13<=p30]] | p52<=0] | [~ [[[~ [p14<=0] & [1<=p54 | p16<=0]] & p6<=p38]] | ~ [p5<=1]]]]]]]]]

abstracting: (p5<=1)
states: 149
abstracting: (p6<=p38)
states: 148
abstracting: (p16<=0)
states: 145
abstracting: (1<=p54)
states: 3
abstracting: (p14<=0)
states: 147
abstracting: (p52<=0)
states: 140
abstracting: (p13<=p30)
states: 15
abstracting: (p57<=p36)
states: 17
abstracting: (p40<=0)
states: 147
abstracting: (1<=p45)
states: 3
abstracting: (1<=p21)
states: 4
abstracting: (p22<=p24)
states: 75
abstracting: (p20<=p52)
states: 145
abstracting: (1<=p37)
states: 2
abstracting: (p45<=1)
states: 149
abstracting: (1<=p37)
states: 2
abstracting: (p55<=p13)
states: 61
abstracting: (p35<=p22)
states: 149
abstracting: (1<=p14)
states: 2
abstracting: (1<=p26)
states: 4
abstracting: (p31<=0)
states: 139
abstracting: (1<=p54)
states: 3
abstracting: (p7<=0)
states: 148
abstracting: (p47<=0)
states: 146
abstracting: (1<=p39)
states: 2
abstracting: (1<=p14)
states: 2
abstracting: (p37<=p8)
states: 148
abstracting: (1<=p48)
states: 11
abstracting: (p14<=p20)
states: 147
abstracting: (1<=p10)
states: 125
abstracting: (p7<=p36)
states: 148
abstracting: (p30<=p23)
states: 147
abstracting: (p3<=0)
states: 148
abstracting: (p21<=0)
states: 145
abstracting: (p48<=0)
states: 138
abstracting: (p10<=p29)
states: 24
abstracting: (p49<=p55)
states: 149
abstracting: (p36<=0)
states: 127
abstracting: (p33<=1)
states: 149
abstracting: (1<=p3)
states: 1
abstracting: (1<=p31)
states: 10
abstracting: (1<=p23)
states: 2
abstracting: (p40<=1)
states: 149
abstracting: (1<=p34)
states: 6
abstracting: (p23<=0)
states: 147
abstracting: (p54<=0)
states: 146
abstracting: (1<=p52)
states: 9
abstracting: (p41<=p19)
states: 148
abstracting: (p56<=0)
states: 13
abstracting: (p48<=p5)
states: 138
abstracting: (p34<=p28)
states: 143
abstracting: (p7<=0)
states: 148
abstracting: (p15<=p31)
states: 147
abstracting: (1<=p27)
states: 4
abstracting: (1<=p7)
states: 1
abstracting: (p26<=p55)
states: 149
abstracting: (p30<=p12)
states: 147
abstracting: (1<=p16)
states: 4
abstracting: (p11<=p36)
states: 99
abstracting: (p16<=p23)
states: 145
abstracting: (p30<=p48)
states: 147
abstracting: (p37<=1)
states: 149
abstracting: (p12<=0)
states: 101
abstracting: (1<=p32)
states: 6
-> the formula is TRUE

FORMULA DoubleExponent-PT-001-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

totally nodes used: 17395 (1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 25318 103076 128394
used/not used/entry size/cache size: 110958 66997906 16 1024MB
basic ops cache: hits/miss/sum: 13932 119808 133740
used/not used/entry size/cache size: 144430 16632786 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: 1867 5128 6995
used/not used/entry size/cache size: 5128 8383480 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 67092202
1 16346
2 235
3 39
4 16
5 10
6 3
7 3
8 1
9 0
>= 10 9

Total processing time: 0m 5.355sec


BK_STOP 1680000596269

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

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:1075 (22), effective:112 (2)

initing FirstDep: 0m 0.000sec


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

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

iterations count:413 (8), effective:45 (0)

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

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

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

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

iterations count:421 (8), effective:41 (0)

iterations count:438 (9), effective:47 (0)

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

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

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

iterations count:59 (1), effective:1 (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="DoubleExponent-PT-001"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is DoubleExponent-PT-001, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r129-smll-167819404300446"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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