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

About the Execution of Marcie for StigmergyElection-PT-03b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10151.840 544497.00 544060.00 0.00 TTTTFTTTFTFFTFTT 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.r449-smll-167912641700577.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 StigmergyElection-PT-03b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641700577
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K Feb 26 16:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 16:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 16:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 16:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 16:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 117K 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 StigmergyElection-PT-03b-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-03b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679387659714

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-03b
Not applying reductions.
Model is PT
CTLCardinality 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: StigmergyElection_PT_03b
(NrP: 427 NrTr: 518 NrArc: 1323)

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

net check time: 0m 0.000sec

init dd package: 0m 3.370sec


RS generation: 0m18.159sec


-> reachability set: #nodes 15321 (1.5e+04) #states 18,282,252 (7)



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

checking: EG [p7<=1]
normalized: EG [p7<=1]

abstracting: (p7<=1)
states: 18,282,252 (7)

EG iterations: 0
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EG [p362<=p248]
normalized: EG [p362<=p248]

abstracting: (p362<=p248)
states: 18,066,447 (7)
.......................................................................
EG iterations: 71
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.794sec

checking: EX [AF [[1<=p399 | EX [EG [p52<=0]]]]]
normalized: EX [~ [EG [~ [[1<=p399 | EX [EG [p52<=0]]]]]]]

abstracting: (p52<=0)
states: 18,065,149 (7)
....................................................................
EG iterations: 68
.abstracting: (1<=p399)
states: 75,466 (4)
..............................................................
EG iterations: 62
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.887sec

checking: ~ [AX [AG [AG [p83<=p261]]]]
normalized: EX [E [true U E [true U ~ [p83<=p261]]]]

abstracting: (p83<=p261)
states: 18,066,251 (7)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.879sec

checking: EG [p101<=p310]
normalized: EG [p101<=p310]

abstracting: (p101<=p310)
states: 18,192,512 (7)
................................................
EG iterations: 48
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.338sec

checking: EF [EG [AG [[p156<=0 & [~ [p284<=0] & p7<=p404]]]]]
normalized: E [true U EG [~ [E [true U ~ [[p156<=0 & [p7<=p404 & ~ [p284<=0]]]]]]]]

abstracting: (p284<=0)
states: 18,193,317 (7)
abstracting: (p7<=p404)
states: 18,193,317 (7)
abstracting: (p156<=0)
states: 18,193,317 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.380sec

checking: A [p196<=1 U ~ [[~ [p336<=1] | AF [[1<=p127 | A [p155<=0 U p415<=1]]]]]]
normalized: [~ [EG [[~ [EG [~ [[1<=p127 | [~ [EG [~ [p415<=1]]] & ~ [E [~ [p415<=1] U [~ [p155<=0] & ~ [p415<=1]]]]]]]]] | ~ [p336<=1]]]] & ~ [E [[~ [EG [~ [[1<=p127 | [~ [EG [~ [p415<=1]]] & ~ [E [~ [p415<=1] U [~ [p155<=0] & ~ [p415<=1]]]]]]]]] | ~ [p336<=1]] U [~ [p196<=1] & [~ [EG [~ [[1<=p127 | [~ [EG [~ [p415<=1]]] & ~ [E [~ [p415<=1] U [~ [p155<=0] & ~ [p415<=1]]]]]]]]] | ~ [p336<=1]]]]]]

abstracting: (p336<=1)
states: 18,282,252 (7)
abstracting: (p415<=1)
states: 18,282,252 (7)
abstracting: (p155<=0)
states: 18,193,317 (7)
abstracting: (p415<=1)
states: 18,282,252 (7)
abstracting: (p415<=1)
states: 18,282,252 (7)
.
EG iterations: 1
abstracting: (1<=p127)
states: 75,452 (4)
.
EG iterations: 1
abstracting: (p196<=1)
states: 18,282,252 (7)
abstracting: (p336<=1)
states: 18,282,252 (7)
abstracting: (p415<=1)
states: 18,282,252 (7)
abstracting: (p155<=0)
states: 18,193,317 (7)
abstracting: (p415<=1)
states: 18,282,252 (7)
abstracting: (p415<=1)
states: 18,282,252 (7)
.
EG iterations: 1
abstracting: (1<=p127)
states: 75,452 (4)
.
EG iterations: 1
abstracting: (p336<=1)
states: 18,282,252 (7)
abstracting: (p415<=1)
states: 18,282,252 (7)
abstracting: (p155<=0)
states: 18,193,317 (7)
abstracting: (p415<=1)
states: 18,282,252 (7)
abstracting: (p415<=1)
states: 18,282,252 (7)
.
EG iterations: 1
abstracting: (1<=p127)
states: 75,452 (4)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: AX [A [~ [[~ [p90<=p173] & 1<=p386]] U ~ [p26<=p250]]]
normalized: ~ [EX [~ [[~ [EG [p26<=p250]] & ~ [E [p26<=p250 U [p26<=p250 & [1<=p386 & ~ [p90<=p173]]]]]]]]]

abstracting: (p90<=p173)
states: 18,067,470 (7)
abstracting: (1<=p386)
states: 91,054 (4)
abstracting: (p26<=p250)
states: 18,066,463 (7)
abstracting: (p26<=p250)
states: 18,066,463 (7)
abstracting: (p26<=p250)
states: 18,066,463 (7)
.............................................................................
EG iterations: 77
.-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m34.705sec

checking: [~ [E [AF [A [p150<=1 U 1<=p184]] U p0<=p228]] & ~ [EF [~ [[AG [E [p205<=p154 U p113<=0]] | AX [p311<=0]]]]]]
normalized: [~ [E [true U ~ [[~ [EX [~ [p311<=0]]] | ~ [E [true U ~ [E [p205<=p154 U p113<=0]]]]]]]] & ~ [E [~ [EG [~ [[~ [EG [~ [1<=p184]]] & ~ [E [~ [1<=p184] U [~ [p150<=1] & ~ [1<=p184]]]]]]]] U p0<=p228]]]

abstracting: (p0<=p228)
states: 18,282,251 (7)
abstracting: (1<=p184)
states: 101,479 (5)
abstracting: (p150<=1)
states: 18,282,252 (7)
abstracting: (1<=p184)
states: 101,479 (5)
abstracting: (1<=p184)
states: 101,479 (5)
...................................................
before gc: list nodes free: 1105912

after gc: idd nodes used:79067, unused:63920933; list nodes free:299524977
......
EG iterations: 57
.
EG iterations: 1
abstracting: (p113<=0)
states: 18,191,198 (7)
abstracting: (p205<=p154)
states: 18,200,112 (7)
abstracting: (p311<=0)
states: 18,065,133 (7)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.788sec

checking: E [AG [EX [EF [1<=p347]]] U [EF [[[1<=p223 & [[p142<=1 | 1<=p82] | [1<=p192 & p364<=p214]]] | ~ [[~ [1<=p250] | [p22<=0 & 1<=p224]]]]] | 1<=p365]]
normalized: E [~ [E [true U ~ [EX [E [true U 1<=p347]]]]] U [1<=p365 | E [true U [~ [[[p22<=0 & 1<=p224] | ~ [1<=p250]]] | [1<=p223 & [[1<=p192 & p364<=p214] | [p142<=1 | 1<=p82]]]]]]]

abstracting: (1<=p82)
states: 217,103 (5)
abstracting: (p142<=1)
states: 18,282,252 (7)
abstracting: (p364<=p214)
states: 18,067,454 (7)
abstracting: (1<=p192)
states: 82,140 (4)
abstracting: (1<=p223)
states: 217,103 (5)
abstracting: (1<=p250)
states: 91,054 (4)
abstracting: (1<=p224)
states: 217,103 (5)
abstracting: (p22<=0)
states: 18,193,317 (7)
abstracting: (1<=p365)
states: 217,119 (5)
abstracting: (1<=p347)
states: 217,119 (5)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.341sec

checking: ~ [A [[[1<=p110 | p349<=0] | EG [[[AF [p131<=1] | [1<=p290 | 1<=p379]] & ~ [[p407<=1 & 1<=p399]]]]] U [[1<=p7 & EF [EF [p10<=0]]] & EF [~ [EF [p278<=p168]]]]]]
normalized: ~ [[~ [EG [~ [[E [true U ~ [E [true U p278<=p168]]] & [1<=p7 & E [true U E [true U p10<=0]]]]]]] & ~ [E [~ [[E [true U ~ [E [true U p278<=p168]]] & [1<=p7 & E [true U E [true U p10<=0]]]]] U [~ [[EG [[~ [[p407<=1 & 1<=p399]] & [[1<=p290 | 1<=p379] | ~ [EG [~ [p131<=1]]]]]] | [1<=p110 | p349<=0]]] & ~ [[E [true U ~ [E [true U p278<=p168]]] & [1<=p7 & E [true U E [true U p10<=0]]]]]]]]]]

abstracting: (p10<=0)
states: 18,193,317 (7)
abstracting: (1<=p7)
states: 88,935 (4)
abstracting: (p278<=p168)
states: 18,194,472 (7)
abstracting: (p349<=0)
states: 18,065,133 (7)
abstracting: (1<=p110)
states: 70,574 (4)
abstracting: (p131<=1)
states: 18,282,252 (7)
.
EG iterations: 1
abstracting: (1<=p379)
states: 70,574 (4)
abstracting: (1<=p290)
states: 88,935 (4)
abstracting: (1<=p399)
states: 75,466 (4)
abstracting: (p407<=1)
states: 18,282,252 (7)
.....................................................................
EG iterations: 69
abstracting: (p10<=0)
states: 18,193,317 (7)
abstracting: (1<=p7)
states: 88,935 (4)
abstracting: (p278<=p168)
states: 18,194,472 (7)
abstracting: (p10<=0)
states: 18,193,317 (7)
abstracting: (1<=p7)
states: 88,935 (4)
abstracting: (p278<=p168)
states: 18,194,472 (7)

EG iterations: 0
-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.655sec

checking: ~ [[[AX [E [1<=p215 U [AG [p236<=1] | AF [p51<=p68]]]] & AG [AX [[EX [1<=p170] & [1<=p318 & p330<=1]]]]] | EX [AX [[[~ [p288<=p353] & AG [p327<=1]] | AF [1<=p159]]]]]]
normalized: ~ [[EX [~ [EX [~ [[~ [EG [~ [1<=p159]]] | [~ [E [true U ~ [p327<=1]]] & ~ [p288<=p353]]]]]]] | [~ [E [true U EX [~ [[[1<=p318 & p330<=1] & EX [1<=p170]]]]]] & ~ [EX [~ [E [1<=p215 U [~ [EG [~ [p51<=p68]]] | ~ [E [true U ~ [p236<=1]]]]]]]]]]]

abstracting: (p236<=1)
states: 18,282,252 (7)
abstracting: (p51<=p68)
states: 18,065,149 (7)
..............................
EG iterations: 30
abstracting: (1<=p215)
states: 217,103 (5)
.abstracting: (1<=p170)
states: 217,103 (5)
.abstracting: (p330<=1)
states: 18,282,252 (7)
abstracting: (1<=p318)
states: 217,119 (5)
.abstracting: (p288<=p353)
states: 18,193,317 (7)
abstracting: (p327<=1)
states: 18,282,252 (7)
abstracting: (1<=p159)
states: 88,935 (4)
.................................................................
EG iterations: 65
..-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.482sec

checking: [AX [[p99<=1 | E [[~ [[p393<=p3 & 1<=p79]] | p282<=0] U ~ [[AX [p180<=0] & A [p228<=1 U p68<=0]]]]]] & AF [~ [[p105<=p149 & AG [AF [1<=p67]]]]]]
normalized: [~ [EX [~ [[p99<=1 | E [[p282<=0 | ~ [[p393<=p3 & 1<=p79]]] U ~ [[[~ [EG [~ [p68<=0]]] & ~ [E [~ [p68<=0] U [~ [p228<=1] & ~ [p68<=0]]]]] & ~ [EX [~ [p180<=0]]]]]]]]]] & ~ [EG [[p105<=p149 & ~ [E [true U EG [~ [1<=p67]]]]]]]]

abstracting: (1<=p67)
states: 82,140 (4)
.............................................
EG iterations: 45
abstracting: (p105<=p149)
states: 18,211,678 (7)
.
EG iterations: 1
abstracting: (p180<=0)
states: 18,065,149 (7)
.abstracting: (p68<=0)
states: 18,200,112 (7)
abstracting: (p228<=1)
states: 18,282,252 (7)
abstracting: (p68<=0)
states: 18,200,112 (7)
abstracting: (p68<=0)
states: 18,200,112 (7)
........................................
EG iterations: 40
abstracting: (1<=p79)
states: 217,103 (5)
abstracting: (p393<=p3)
states: 18,207,858 (7)
abstracting: (p282<=0)
states: 18,193,317 (7)
abstracting: (p99<=1)
states: 18,282,252 (7)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.699sec

checking: AX [E [E [AX [EF [p362<=p424]] U [~ [[1<=p363 & p266<=1]] & p231<=p31]] U E [[EX [p212<=p48] & 1<=p267] U E [EF [p221<=p125] U [1<=p94 & p407<=1]]]]]
normalized: ~ [EX [~ [E [E [~ [EX [~ [E [true U p362<=p424]]]] U [p231<=p31 & ~ [[1<=p363 & p266<=1]]]] U E [[1<=p267 & EX [p212<=p48]] U E [E [true U p221<=p125] U [1<=p94 & p407<=1]]]]]]]

abstracting: (p407<=1)
states: 18,282,252 (7)
abstracting: (1<=p94)
states: 217,103 (5)
abstracting: (p221<=p125)
states: 18,066,251 (7)
abstracting: (p212<=p48)
states: 18,067,470 (7)
.abstracting: (1<=p267)
states: 75,452 (4)
abstracting: (p266<=1)
states: 18,282,252 (7)
abstracting: (1<=p363)
states: 217,119 (5)
abstracting: (p231<=p31)
states: 18,188,902 (7)
abstracting: (p362<=p424)
states: 18,073,096 (7)
..-> the formula is TRUE

FORMULA StigmergyElection-PT-03b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.638sec

checking: A [[[[~ [EF [~ [1<=p153]]] | p120<=1] & EG [~ [[A [1<=p76 U 1<=p260] | [p24<=0 | 1<=p213]]]]] & AG [EG [[EX [1<=p236] | A [1<=p333 U p174<=p269]]]]] U EX [AG [~ [[A [p335<=p229 U 1<=p177] | ~ [p90<=p41]]]]]]
normalized: [~ [EG [~ [EX [~ [E [true U [~ [p90<=p41] | [~ [EG [~ [1<=p177]]] & ~ [E [~ [1<=p177] U [~ [p335<=p229] & ~ [1<=p177]]]]]]]]]]]] & ~ [E [~ [EX [~ [E [true U [~ [p90<=p41] | [~ [EG [~ [1<=p177]]] & ~ [E [~ [1<=p177] U [~ [p335<=p229] & ~ [1<=p177]]]]]]]]]] U [~ [[~ [E [true U ~ [EG [[[~ [EG [~ [p174<=p269]]] & ~ [E [~ [p174<=p269] U [~ [1<=p333] & ~ [p174<=p269]]]]] | EX [1<=p236]]]]]] & [EG [~ [[[p24<=0 | 1<=p213] | [~ [EG [~ [1<=p260]]] & ~ [E [~ [1<=p260] U [~ [1<=p76] & ~ [1<=p260]]]]]]]] & [p120<=1 | ~ [E [true U ~ [1<=p153]]]]]]] & ~ [EX [~ [E [true U [~ [p90<=p41] | [~ [EG [~ [1<=p177]]] & ~ [E [~ [1<=p177] U [~ [p335<=p229] & ~ [1<=p177]]]]]]]]]]]]]]

abstracting: (1<=p177)
states: 217,103 (5)
abstracting: (p335<=p229)
states: 18,201,222 (7)
abstracting: (1<=p177)
states: 217,103 (5)
abstracting: (1<=p177)
states: 217,103 (5)
.........................................................................
EG iterations: 73
abstracting: (p90<=p41)
states: 18,065,149 (7)
.abstracting: (1<=p153)
states: 88,935 (4)
abstracting: (p120<=1)
states: 18,282,252 (7)
abstracting: (1<=p260)
states: 75,452 (4)
abstracting: (1<=p76)
states: 217,103 (5)
abstracting: (1<=p260)
states: 75,452 (4)
abstracting: (1<=p260)
states: 75,452 (4)
......
before gc: list nodes free: 788417

after gc: idd nodes used:172808, unused:63827192; list nodes free:301168935
..................................................................
EG iterations: 72
abstracting: (1<=p213)
states: 217,103 (5)
abstracting: (p24<=0)
states: 18,193,317 (7)
......................................
EG iterations: 38
abstracting: (1<=p236)
states: 91,054 (4)
.abstracting: (p174<=p269)
states: 18,065,149 (7)
abstracting: (1<=p333)
states: 82,140 (4)
abstracting: (p174<=p269)
states: 18,065,149 (7)
abstracting: (p174<=p269)
states: 18,065,149 (7)
....................................................................
EG iterations: 68
............................................................................
EG iterations: 76
abstracting: (1<=p177)
states: 217,103 (5)
abstracting: (p335<=p229)
states: 18,201,222 (7)
abstracting: (1<=p177)
states: 217,103 (5)
abstracting: (1<=p177)
states: 217,103 (5)
.........................................................................
EG iterations: 73
abstracting: (p90<=p41)
states: 18,065,149 (7)
.abstracting: (1<=p177)
states: 217,103 (5)
abstracting: (p335<=p229)
states: 18,201,222 (7)
abstracting: (1<=p177)
states: 217,103 (5)
abstracting: (1<=p177)
states: 217,103 (5)
.........................................................................
EG iterations: 73
abstracting: (p90<=p41)
states: 18,065,149 (7)
............
before gc: list nodes free: 374789

after gc: idd nodes used:371689, unused:63628311; list nodes free:300293084
...............................................
EG iterations: 58
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m18.192sec

checking: A [1<=p67 U [EF [~ [E [[1<=p376 | p220<=p69] U E [p359<=1 U p130<=p406]]]] & [[[~ [AX [p402<=0]] | EF [E [p319<=1 U p186<=p269]]] & ~ [[~ [1<=p290] & [1<=p138 & p257<=p125]]]] | ~ [[~ [EG [1<=p100]] & EG [[1<=p65 & p191<=1]]]]]]]
normalized: [~ [EG [~ [[[~ [[EG [[1<=p65 & p191<=1]] & ~ [EG [1<=p100]]]] | [~ [[[1<=p138 & p257<=p125] & ~ [1<=p290]]] & [E [true U E [p319<=1 U p186<=p269]] | EX [~ [p402<=0]]]]] & E [true U ~ [E [[1<=p376 | p220<=p69] U E [p359<=1 U p130<=p406]]]]]]]] & ~ [E [~ [[[~ [[EG [[1<=p65 & p191<=1]] & ~ [EG [1<=p100]]]] | [~ [[[1<=p138 & p257<=p125] & ~ [1<=p290]]] & [E [true U E [p319<=1 U p186<=p269]] | EX [~ [p402<=0]]]]] & E [true U ~ [E [[1<=p376 | p220<=p69] U E [p359<=1 U p130<=p406]]]]]] U [~ [1<=p67] & ~ [[[~ [[EG [[1<=p65 & p191<=1]] & ~ [EG [1<=p100]]]] | [~ [[[1<=p138 & p257<=p125] & ~ [1<=p290]]] & [E [true U E [p319<=1 U p186<=p269]] | EX [~ [p402<=0]]]]] & E [true U ~ [E [[1<=p376 | p220<=p69] U E [p359<=1 U p130<=p406]]]]]]]]]]

abstracting: (p130<=p406)
states: 18,207,872 (7)
abstracting: (p359<=1)
states: 18,282,252 (7)
abstracting: (p220<=p69)
states: 18,066,259 (7)
abstracting: (1<=p376)
states: 70,574 (4)
abstracting: (p402<=0)
states: 18,206,786 (7)
.abstracting: (p186<=p269)
states: 18,065,149 (7)
abstracting: (p319<=1)
states: 18,282,252 (7)
abstracting: (1<=p290)
states: 88,935 (4)
abstracting: (p257<=p125)
states: 18,207,452 (7)
abstracting: (1<=p138)
states: 75,452 (4)
abstracting: (1<=p100)
states: 217,103 (5)
....................................................................
EG iterations: 68
abstracting: (p191<=1)
states: 18,282,252 (7)
abstracting: (1<=p65)
states: 82,140 (4)
........................................
EG iterations: 40
abstracting: (1<=p67)
states: 82,140 (4)
abstracting: (p130<=p406)
states: 18,207,872 (7)
abstracting: (p359<=1)
states: 18,282,252 (7)
abstracting: (p220<=p69)
states: 18,066,259 (7)
abstracting: (1<=p376)
states: 70,574 (4)
abstracting: (p402<=0)
states: 18,206,786 (7)
.abstracting: (p186<=p269)
states: 18,065,149 (7)
abstracting: (p319<=1)
states: 18,282,252 (7)
abstracting: (1<=p290)
states: 88,935 (4)
abstracting: (p257<=p125)
states: 18,207,452 (7)
abstracting: (1<=p138)
states: 75,452 (4)
abstracting: (1<=p100)
states: 217,103 (5)
....................................................................
EG iterations: 68
abstracting: (p191<=1)
states: 18,282,252 (7)
abstracting: (1<=p65)
states: 82,140 (4)
........................................
EG iterations: 40
abstracting: (p130<=p406)
states: 18,207,872 (7)
abstracting: (p359<=1)
states: 18,282,252 (7)
abstracting: (p220<=p69)
states: 18,066,259 (7)
abstracting: (1<=p376)
states: 70,574 (4)
abstracting: (p402<=0)
states: 18,206,786 (7)
.abstracting: (p186<=p269)
states: 18,065,149 (7)
abstracting: (p319<=1)
states: 18,282,252 (7)
abstracting: (1<=p290)
states: 88,935 (4)
abstracting: (p257<=p125)
states: 18,207,452 (7)
abstracting: (1<=p138)
states: 75,452 (4)
abstracting: (1<=p100)
states: 217,103 (5)
....................................................................
EG iterations: 68
abstracting: (p191<=1)
states: 18,282,252 (7)
abstracting: (1<=p65)
states: 82,140 (4)
........................................
EG iterations: 40

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyElection-PT-03b-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m19.522sec

totally nodes used: 230233565 (2.3e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 411397002 1037936622 1449333624
used/not used/entry size/cache size: 62940824 4168040 16 1024MB
basic ops cache: hits/miss/sum: 19803741 46113564 65917305
used/not used/entry size/cache size: 5357400 11419816 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: 74023 195596 269619
used/not used/entry size/cache size: 31341 8357267 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 38701264
1 20220614
2 6335541
3 1504982
4 290776
5 47880
6 6799
7 891
8 102
9 14
>= 10 1

Total processing time: 9m 4.388sec


BK_STOP 1679388204211

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

12387 14814 15602 18423
iterations count:441039 (851), effective:12673 (24)

initing FirstDep: 0m 0.002sec

25940
iterations count:180647 (348), effective:5917 (11)

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

iterations count:725 (1), effective:23 (0)
23318 23464
iterations count:234109 (451), effective:7304 (14)

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

iterations count:520 (1), effective:1 (0)
23092
iterations count:183783 (354), effective:5974 (11)
24117
iterations count:183219 (353), effective:5875 (11)

iterations count:45862 (88), effective:1801 (3)

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:655 (1), effective:11 (0)
27781
iterations count:180356 (348), effective:5862 (11)

iterations count:717 (1), effective:14 (0)
26002
iterations count:180631 (348), effective:5908 (11)

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

iterations count:1273 (2), effective:59 (0)

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

iterations count:518 (1), effective:0 (0)
22478 24005
iterations count:235998 (455), effective:7570 (14)
25579
iterations count:112402 (216), effective:3850 (7)

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

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

iterations count:524 (1), effective:1 (0)
26017
iterations count:182177 (351), effective:5918 (11)
22478 24005
iterations count:235998 (455), effective:7570 (14)
25579
iterations count:112402 (216), effective:3850 (7)

iterations count:522 (1), effective:1 (0)
22478 24005
iterations count:235998 (455), effective:7570 (14)
25579
iterations count:112402 (216), effective:3850 (7)

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

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

iterations count:26131 (50), effective:827 (1)

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

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

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

iterations count:26131 (50), effective:827 (1)

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

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

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

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

iterations count:26131 (50), effective:827 (1)

iterations count:518 (1), effective:0 (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="StigmergyElection-PT-03b"
export BK_EXAMINATION="CTLCardinality"
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 StigmergyElection-PT-03b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r449-smll-167912641700577"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03b.tgz
mv StigmergyElection-PT-03b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;