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

About the Execution of Marcie for SmartHome-PT-12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10135.191 1690829.00 1690070.00 0.00 TFFTFTTFFFFFFFTF 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-167912641300241.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 SmartHome-PT-12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641300241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 6.0K Feb 26 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 05:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 05:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 05:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Feb 26 05:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 05:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 05:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 90K 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 SmartHome-PT-12-CTLCardinality-00
FORMULA_NAME SmartHome-PT-12-CTLCardinality-01
FORMULA_NAME SmartHome-PT-12-CTLCardinality-02
FORMULA_NAME SmartHome-PT-12-CTLCardinality-03
FORMULA_NAME SmartHome-PT-12-CTLCardinality-04
FORMULA_NAME SmartHome-PT-12-CTLCardinality-05
FORMULA_NAME SmartHome-PT-12-CTLCardinality-06
FORMULA_NAME SmartHome-PT-12-CTLCardinality-07
FORMULA_NAME SmartHome-PT-12-CTLCardinality-08
FORMULA_NAME SmartHome-PT-12-CTLCardinality-09
FORMULA_NAME SmartHome-PT-12-CTLCardinality-10
FORMULA_NAME SmartHome-PT-12-CTLCardinality-11
FORMULA_NAME SmartHome-PT-12-CTLCardinality-12
FORMULA_NAME SmartHome-PT-12-CTLCardinality-13
FORMULA_NAME SmartHome-PT-12-CTLCardinality-14
FORMULA_NAME SmartHome-PT-12-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679191370078

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=SmartHome-PT-12
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: SmartHome_PT_12
(NrP: 376 NrTr: 399 NrArc: 909)

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

net check time: 0m 0.000sec

init dd package: 0m 3.475sec


RS generation: 1m47.284sec


-> reachability set: #nodes 366015 (3.7e+05) #states 112,986,062,757,343 (14)



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

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

abstracting: (p339<=1)
states: 112,986,062,757,343 (14)

EG iterations: 0
-> the formula is TRUE

FORMULA SmartHome-PT-12-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.249sec

checking: EF [AG [EG [1<=p17]]]
normalized: E [true U ~ [E [true U ~ [EG [1<=p17]]]]]

abstracting: (1<=p17)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m33.059sec

checking: EX [EF [1<=p94]]
normalized: EX [E [true U 1<=p94]]

abstracting: (1<=p94)
states: 2,750,652,246,326 (12)

before gc: list nodes free: 1070028

after gc: idd nodes used:770273, unused:63229727; list nodes free:285984206
.-> the formula is TRUE

FORMULA SmartHome-PT-12-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 6.186sec

checking: EG [AG [A [p95<=1 U [AF [1<=p35] | EX [p187<=1]]]]]
normalized: EG [~ [E [true U ~ [[~ [EG [~ [[EX [p187<=1] | ~ [EG [~ [1<=p35]]]]]]] & ~ [E [~ [[EX [p187<=1] | ~ [EG [~ [1<=p35]]]]] U [~ [p95<=1] & ~ [[EX [p187<=1] | ~ [EG [~ [1<=p35]]]]]]]]]]]]]

abstracting: (1<=p35)
states: 155,796 (5)
....
EG iterations: 4
abstracting: (p187<=1)
states: 112,986,062,757,343 (14)
.abstracting: (p95<=1)
states: 112,986,062,757,343 (14)
abstracting: (1<=p35)
states: 155,796 (5)
....
EG iterations: 4
abstracting: (p187<=1)
states: 112,986,062,757,343 (14)
.abstracting: (1<=p35)
states: 155,796 (5)
....
EG iterations: 4
abstracting: (p187<=1)
states: 112,986,062,757,343 (14)
..
EG iterations: 1

before gc: list nodes free: 1123816

after gc: idd nodes used:518245, unused:63481755; list nodes free:289182571
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m26.254sec

checking: EG [AX [AG [[p213<=0 | EX [p99<=p72]]]]]
normalized: EG [~ [EX [E [true U ~ [[p213<=0 | EX [p99<=p72]]]]]]]

abstracting: (p99<=p72)
states: 110,113,614,877,706 (14)
.abstracting: (p213<=0)
states: 112,986,062,757,343 (14)
.
EG iterations: 0
-> the formula is TRUE

FORMULA SmartHome-PT-12-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43.484sec

checking: AX [[p193<=0 & AX [EF [[1<=p338 & p241<=p71]]]]]
normalized: ~ [EX [~ [[p193<=0 & ~ [EX [~ [E [true U [1<=p338 & p241<=p71]]]]]]]]]

abstracting: (p241<=p71)
states: 110,276,732,360,220 (14)
abstracting: (1<=p338)
states: 0
.abstracting: (p193<=0)
states: 110,326,716,466,118 (14)
.-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.092sec

checking: E [p312<=p75 U [~ [EF [AG [E [1<=p145 U p170<=1]]]] & ~ [AG [~ [[~ [p22<=0] | ~ [1<=p333]]]]]]]
normalized: E [p312<=p75 U [E [true U [~ [1<=p333] | ~ [p22<=0]]] & ~ [E [true U ~ [E [true U ~ [E [1<=p145 U p170<=1]]]]]]]]

abstracting: (p170<=1)
states: 112,986,062,757,343 (14)
abstracting: (1<=p145)
states: 4,726,582,623,692 (12)
abstracting: (p22<=0)
states: 112,986,062,757,343 (14)
abstracting: (1<=p333)
states: 0
abstracting: (p312<=p75)
states: 112,986,062,757,343 (14)
-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.958sec

checking: AG [AX [A [EF [AG [1<=p254]] U [~ [p258<=0] | [p148<=p10 | p368<=p193]]]]]
normalized: ~ [E [true U EX [~ [[~ [EG [~ [[[p148<=p10 | p368<=p193] | ~ [p258<=0]]]]] & ~ [E [~ [[[p148<=p10 | p368<=p193] | ~ [p258<=0]]] U [~ [E [true U ~ [E [true U ~ [1<=p254]]]]] & ~ [[[p148<=p10 | p368<=p193] | ~ [p258<=0]]]]]]]]]]]

abstracting: (p258<=0)
states: 112,941,525,070,437 (14)
abstracting: (p368<=p193)
states: 102,985,692,345,444 (14)
abstracting: (p148<=p10)
states: 108,259,480,133,651 (14)
abstracting: (1<=p254)
states: 2,876,298,051,886 (12)
abstracting: (p258<=0)
states: 112,941,525,070,437 (14)
abstracting: (p368<=p193)
states: 102,985,692,345,444 (14)
abstracting: (p148<=p10)
states: 108,259,480,133,651 (14)

before gc: list nodes free: 1037416

after gc: idd nodes used:1259208, unused:62740792; list nodes free:285887524
abstracting: (p258<=0)
states: 112,941,525,070,437 (14)
abstracting: (p368<=p193)
states: 102,985,692,345,444 (14)
abstracting: (p148<=p10)
states: 108,259,480,133,651 (14)
..........
EG iterations: 10
.-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m53.101sec

checking: EF [[[~ [p287<=p231] | [p313<=p154 & E [[p239<=1 & p368<=p349] U ~ [1<=p221]]]] & ~ [EF [[1<=p191 | p375<=1]]]]]
normalized: E [true U [~ [E [true U [1<=p191 | p375<=1]]] & [[p313<=p154 & E [[p239<=1 & p368<=p349] U ~ [1<=p221]]] | ~ [p287<=p231]]]]

abstracting: (p287<=p231)
states: 112,945,844,831,770 (14)
abstracting: (1<=p221)
states: 2,864,815,204,828 (12)
abstracting: (p368<=p349)
states: 102,744,739,052,075 (14)
abstracting: (p239<=1)
states: 112,986,062,757,343 (14)
abstracting: (p313<=p154)
states: 112,986,062,757,343 (14)
abstracting: (p375<=1)
states: 112,986,062,757,343 (14)
abstracting: (1<=p191)
states: 2,659,346,291,225 (12)
-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m46.152sec

checking: AG [AF [AF [[[[p86<=0 & p230<=p11] & E [1<=p344 U p39<=0]] | [EF [p132<=1] | [p191<=p354 | p71<=p130]]]]]]
normalized: ~ [E [true U EG [EG [~ [[[[p191<=p354 | p71<=p130] | E [true U p132<=1]] | [E [1<=p344 U p39<=0] & [p86<=0 & p230<=p11]]]]]]]]

abstracting: (p230<=p11)
states: 110,109,764,705,457 (14)
abstracting: (p86<=0)
states: 106,427,901,521,772 (14)
abstracting: (p39<=0)
states: 111,579,107,171,133 (14)
abstracting: (1<=p344)
states: 0
abstracting: (p132<=1)
states: 112,986,062,757,343 (14)
abstracting: (p71<=p130)
states: 106,495,349,913,634 (14)
abstracting: (p191<=p354)
states: 110,326,716,466,118 (14)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmartHome-PT-12-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.397sec

checking: EF [~ [[AF [[p191<=p188 | E [1<=p108 U p1<=0]]] | [~ [AF [EF [1<=p169]]] | [[[E [1<=p171 U 1<=p114] | [p12<=0 | 1<=p318]] & AF [p90<=1]] & 1<=p161]]]]]
normalized: E [true U ~ [[[[1<=p161 & [~ [EG [~ [p90<=1]]] & [[p12<=0 | 1<=p318] | E [1<=p171 U 1<=p114]]]] | EG [~ [E [true U 1<=p169]]]] | ~ [EG [~ [[p191<=p188 | E [1<=p108 U p1<=0]]]]]]]]

abstracting: (p1<=0)
states: 112,986,062,757,341 (14)
abstracting: (1<=p108)
states: 4,694,742,191,054 (12)
abstracting: (p191<=p188)
states: 110,326,716,466,118 (14)
.
EG iterations: 1
abstracting: (1<=p169)
states: 2,652,590,883,261 (12)
.
EG iterations: 1
abstracting: (1<=p114)
states: 4,712,583,814,550 (12)
abstracting: (1<=p171)
states: 2,652,590,883,261 (12)
abstracting: (1<=p318)
states: 0
abstracting: (p12<=0)
states: 112,986,062,757,343 (14)
abstracting: (p90<=1)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (1<=p161)
states: 1,123,458,074,200 (12)
-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m10.938sec

checking: EX [AX [[[A [~ [1<=p174] U [1<=p30 & 1<=p130]] & p35<=p49] | E [EG [p247<=p89] U [A [p31<=p122 U p300<=p275] & ~ [p126<=1]]]]]]
normalized: EX [~ [EX [~ [[E [EG [p247<=p89] U [~ [p126<=1] & [~ [EG [~ [p300<=p275]]] & ~ [E [~ [p300<=p275] U [~ [p31<=p122] & ~ [p300<=p275]]]]]]] | [p35<=p49 & [~ [EG [~ [[1<=p30 & 1<=p130]]]] & ~ [E [~ [[1<=p30 & 1<=p130]] U [1<=p174 & ~ [[1<=p30 & 1<=p130]]]]]]]]]]]]

abstracting: (1<=p130)
states: 1,201,341,517,199 (12)
abstracting: (1<=p30)
states: 8,644,728,021,038 (12)
abstracting: (1<=p174)
states: 2,652,590,883,261 (12)
abstracting: (1<=p130)
states: 1,201,341,517,199 (12)
abstracting: (1<=p30)
states: 8,644,728,021,038 (12)

before gc: list nodes free: 4075847

after gc: idd nodes used:3232167, unused:60767833; list nodes free:276966050
abstracting: (1<=p130)
states: 1,201,341,517,199 (12)
abstracting: (1<=p30)
states: 8,644,728,021,038 (12)
.
EG iterations: 1
abstracting: (p35<=p49)
states: 112,986,062,601,547 (14)
abstracting: (p300<=p275)
states: 112,986,062,757,343 (14)
abstracting: (p31<=p122)
states: 104,340,680,831,863 (14)
abstracting: (p300<=p275)
states: 112,986,062,757,343 (14)
abstracting: (p300<=p275)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (p126<=1)
states: 112,986,062,757,343 (14)
abstracting: (p247<=p89)
states: 110,276,732,360,220 (14)
.
EG iterations: 1
..-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m34.294sec

checking: E [AF [AX [p3<=1]] U [AF [[~ [[p367<=1 | A [p239<=p64 U p37<=1]]] & EG [EX [1<=p270]]]] & EG [[[p111<=p164 & [AG [p97<=1] | ~ [p181<=0]]] | [AF [p373<=1] | 1<=p65]]]]]
normalized: E [~ [EG [EX [~ [p3<=1]]]] U [EG [[[1<=p65 | ~ [EG [~ [p373<=1]]]] | [p111<=p164 & [~ [p181<=0] | ~ [E [true U ~ [p97<=1]]]]]]] & ~ [EG [~ [[EG [EX [1<=p270]] & ~ [[p367<=1 | [~ [EG [~ [p37<=1]]] & ~ [E [~ [p37<=1] U [~ [p239<=p64] & ~ [p37<=1]]]]]]]]]]]]]

abstracting: (p37<=1)
states: 112,986,062,757,343 (14)
abstracting: (p239<=p64)
states: 110,109,764,705,457 (14)
abstracting: (p37<=1)
states: 112,986,062,757,343 (14)
abstracting: (p37<=1)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (p367<=1)
states: 112,986,062,757,343 (14)
abstracting: (1<=p270)
states: 4,902,240,838,357 (12)
.........
EG iterations: 8

EG iterations: 0
abstracting: (p97<=1)
states: 112,986,062,757,343 (14)
abstracting: (p181<=0)
states: 110,326,716,466,118 (14)
abstracting: (p111<=p164)
states: 108,401,871,712,388 (14)
abstracting: (p373<=1)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (1<=p65)
states: 4,597,342,123,885 (12)

EG iterations: 0
abstracting: (p3<=1)
states: 112,986,062,757,343 (14)
..
EG iterations: 1
-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.697sec

checking: E [p262<=p362 U ~ [[E [AG [p146<=p134] U [EF [1<=p320] & [A [1<=p196 U 1<=p7] & p155<=p148]]] & EG [A [p108<=p112 U A [p264<=1 U p357<=p254]]]]]]
normalized: E [p262<=p362 U ~ [[EG [[~ [EG [~ [[~ [EG [~ [p357<=p254]]] & ~ [E [~ [p357<=p254] U [~ [p264<=1] & ~ [p357<=p254]]]]]]]] & ~ [E [~ [[~ [EG [~ [p357<=p254]]] & ~ [E [~ [p357<=p254] U [~ [p264<=1] & ~ [p357<=p254]]]]]] U [~ [p108<=p112] & ~ [[~ [EG [~ [p357<=p254]]] & ~ [E [~ [p357<=p254] U [~ [p264<=1] & ~ [p357<=p254]]]]]]]]]]] & E [~ [E [true U ~ [p146<=p134]]] U [[p155<=p148 & [~ [EG [~ [1<=p7]]] & ~ [E [~ [1<=p7] U [~ [1<=p196] & ~ [1<=p7]]]]]] & E [true U 1<=p320]]]]]]

abstracting: (1<=p320)
states: 0
abstracting: (1<=p7)
states: 0
abstracting: (1<=p196)
states: 2,659,346,291,225 (12)
abstracting: (1<=p7)
states: 0

before gc: list nodes free: 2059817

after gc: idd nodes used:4262091, unused:59737909; list nodes free:272341316
abstracting: (1<=p7)
states: 0

EG iterations: 0
abstracting: (p155<=p148)
states: 112,986,062,757,343 (14)
abstracting: (p146<=p134)
states: 108,259,480,133,651 (14)
abstracting: (p357<=p254)
states: 112,986,062,757,343 (14)
abstracting: (p264<=1)
states: 112,986,062,757,343 (14)
abstracting: (p357<=p254)
states: 112,986,062,757,343 (14)
abstracting: (p357<=p254)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (p108<=p112)
states: 108,291,320,566,289 (14)
abstracting: (p357<=p254)
states: 112,986,062,757,343 (14)
abstracting: (p264<=1)
states: 112,986,062,757,343 (14)
abstracting: (p357<=p254)
states: 112,986,062,757,343 (14)
abstracting: (p357<=p254)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (p357<=p254)
states: 112,986,062,757,343 (14)
abstracting: (p264<=1)
states: 112,986,062,757,343 (14)
abstracting: (p357<=p254)
states: 112,986,062,757,343 (14)
abstracting: (p357<=p254)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
.
EG iterations: 1

EG iterations: 0
abstracting: (p262<=p362)
states: 109,416,328,854,270 (14)
-> the formula is TRUE

FORMULA SmartHome-PT-12-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m47.507sec

checking: [[AF [p197<=0] & [AG [p99<=1] & [AG [EF [~ [p275<=p309]]] | ~ [A [AX [1<=p368] U [AF [1<=p151] | A [1<=p102 U p293<=p371]]]]]]] | [~ [EX [[p155<=0 & p62<=1]]] & AG [[~ [AX [[1<=p216 & p83<=0]]] & p67<=1]]]]
normalized: [[~ [E [true U ~ [[p67<=1 & EX [~ [[1<=p216 & p83<=0]]]]]]] & ~ [EX [[p155<=0 & p62<=1]]]] | [[[~ [[~ [EG [~ [[[~ [EG [~ [p293<=p371]]] & ~ [E [~ [p293<=p371] U [~ [1<=p102] & ~ [p293<=p371]]]]] | ~ [EG [~ [1<=p151]]]]]]] & ~ [E [~ [[[~ [EG [~ [p293<=p371]]] & ~ [E [~ [p293<=p371] U [~ [1<=p102] & ~ [p293<=p371]]]]] | ~ [EG [~ [1<=p151]]]]] U [EX [~ [1<=p368]] & ~ [[[~ [EG [~ [p293<=p371]]] & ~ [E [~ [p293<=p371] U [~ [1<=p102] & ~ [p293<=p371]]]]] | ~ [EG [~ [1<=p151]]]]]]]]]] | ~ [E [true U ~ [E [true U ~ [p275<=p309]]]]]] & ~ [E [true U ~ [p99<=1]]]] & ~ [EG [~ [p197<=0]]]]]

abstracting: (p197<=0)
states: 110,326,716,466,118 (14)
........
EG iterations: 8
abstracting: (p99<=1)
states: 112,986,062,757,343 (14)
abstracting: (p275<=p309)
states: 108,068,912,888,134 (14)
abstracting: (1<=p151)
states: 4,726,582,623,692 (12)
.........
EG iterations: 9
abstracting: (p293<=p371)
states: 112,986,062,757,343 (14)
abstracting: (1<=p102)
states: 4,712,583,814,550 (12)
abstracting: (p293<=p371)
states: 112,986,062,757,343 (14)
abstracting: (p293<=p371)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (1<=p368)
states: 10,241,323,705,268 (13)

before gc: list nodes free: 187176

after gc: idd nodes used:4599333, unused:59400667; list nodes free:270827638
.abstracting: (1<=p151)
states: 4,726,582,623,692 (12)
.........
EG iterations: 9
abstracting: (p293<=p371)
states: 112,986,062,757,343 (14)
abstracting: (1<=p102)
states: 4,712,583,814,550 (12)
abstracting: (p293<=p371)
states: 112,986,062,757,343 (14)
abstracting: (p293<=p371)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (1<=p151)
states: 4,726,582,623,692 (12)
.........
EG iterations: 9
abstracting: (p293<=p371)
states: 112,986,062,757,343 (14)
abstracting: (1<=p102)
states: 4,712,583,814,550 (12)
abstracting: (p293<=p371)
states: 112,986,062,757,343 (14)
abstracting: (p293<=p371)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p62<=1)
states: 112,986,062,757,343 (14)
abstracting: (p155<=0)
states: 112,986,062,757,343 (14)
.abstracting: (p83<=0)
states: 106,427,901,521,772 (14)
abstracting: (1<=p216)
states: 2,864,815,204,828 (12)
.abstracting: (p67<=1)
states: 112,986,062,757,343 (14)
-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m42.656sec

checking: E [[[EG [[[EX [1<=p38] | AX [1<=p144]] & AF [1<=p206]]] | [1<=p323 | EF [A [1<=p160 U 1<=p127]]]] & E [[A [[p214<=p231 & p290<=0] U A [p352<=p345 U p147<=1]] & p217<=p350] U EX [[EG [p233<=p193] & [1<=p18 | 1<=p231]]]]] U [AG [p112<=0] & AX [~ [p133<=0]]]]
normalized: E [[E [[p217<=p350 & [~ [EG [~ [[~ [EG [~ [p147<=1]]] & ~ [E [~ [p147<=1] U [~ [p352<=p345] & ~ [p147<=1]]]]]]]] & ~ [E [~ [[~ [EG [~ [p147<=1]]] & ~ [E [~ [p147<=1] U [~ [p352<=p345] & ~ [p147<=1]]]]]] U [~ [[p214<=p231 & p290<=0]] & ~ [[~ [EG [~ [p147<=1]]] & ~ [E [~ [p147<=1] U [~ [p352<=p345] & ~ [p147<=1]]]]]]]]]]] U EX [[[1<=p18 | 1<=p231] & EG [p233<=p193]]]] & [[1<=p323 | E [true U [~ [EG [~ [1<=p127]]] & ~ [E [~ [1<=p127] U [~ [1<=p160] & ~ [1<=p127]]]]]]] | EG [[~ [EG [~ [1<=p206]]] & [~ [EX [~ [1<=p144]]] | EX [1<=p38]]]]]] U [~ [EX [p133<=0]] & ~ [E [true U ~ [p112<=0]]]]]

abstracting: (p112<=0)
states: 108,291,320,566,289 (14)
abstracting: (p133<=0)
states: 108,259,480,133,651 (14)
.abstracting: (1<=p38)
states: 53,670,925,241 (10)
.abstracting: (1<=p144)
states: 4,726,582,623,692 (12)
.abstracting: (1<=p206)
states: 2,659,346,291,225 (12)

before gc: list nodes free: 1157431

after gc: idd nodes used:5496718, unused:58503282; list nodes free:266514228
..........................
EG iterations: 26
........
EG iterations: 8
abstracting: (1<=p127)
states: 4,645,525,602,996 (12)
abstracting: (1<=p160)
states: 1,123,458,074,200 (12)
abstracting: (1<=p127)
states: 4,645,525,602,996 (12)
abstracting: (1<=p127)
states: 4,645,525,602,996 (12)

before gc: list nodes free: 382369

after gc: idd nodes used:5324954, unused:58675046; list nodes free:269453072
.
EG iterations: 1
abstracting: (1<=p323)
states: 0
abstracting: (p233<=p193)
states: 110,177,420,689,162 (14)
........
EG iterations: 8
abstracting: (1<=p231)
states: 2,876,298,051,886 (12)
abstracting: (1<=p18)
states: 0
.abstracting: (p147<=1)
states: 112,986,062,757,343 (14)
abstracting: (p352<=p345)
states: 112,986,062,757,343 (14)
abstracting: (p147<=1)
states: 112,986,062,757,343 (14)
abstracting: (p147<=1)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (p290<=0)
states: 112,821,894,467,679 (14)
abstracting: (p214<=p231)
states: 110,109,764,705,457 (14)
abstracting: (p147<=1)
states: 112,986,062,757,343 (14)
abstracting: (p352<=p345)
states: 112,986,062,757,343 (14)
abstracting: (p147<=1)
states: 112,986,062,757,343 (14)
abstracting: (p147<=1)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
abstracting: (p147<=1)
states: 112,986,062,757,343 (14)
abstracting: (p352<=p345)
states: 112,986,062,757,343 (14)
abstracting: (p147<=1)
states: 112,986,062,757,343 (14)
abstracting: (p147<=1)
states: 112,986,062,757,343 (14)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p217<=p350)
states: 110,121,247,552,515 (14)
-> the formula is FALSE

FORMULA SmartHome-PT-12-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 6m33.902sec

totally nodes used: 543174838 (5.4e+08)
number of garbage collections: 8
fire ops cache: hits/miss/sum: 760112579 2036574510 2796687089
used/not used/entry size/cache size: 64219251 2889613 16 1024MB
basic ops cache: hits/miss/sum: 88021395 236367426 324388821
used/not used/entry size/cache size: 13984838 2792378 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: 3047227 8027203 11074430
used/not used/entry size/cache size: 489871 7898737 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 29469711
1 23593812
2 10141644
3 3040636
4 704968
5 133405
6 21378
7 2886
8 372
9 44
>= 10 8

Total processing time: 28m10.725sec


BK_STOP 1679193060907

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p41
p64
p202
p282
p283
p126
p165
p157
p72
p316
p318
p292
p299
p293
p322
p296
p298
p300
p309
p310
p315
p323
p295
p324
p284
p326
p203
p63
p320
p297
p76
p134
p103
p80
p312
p78
p75
p81
p156
p62
p319
p125
p327
p308
p77
p332
p334
p335
p336
p339
p340
p341
p343
p344
p321
p345
p346
p348
p351
p352
p74
p353
p355
p357
p261
p350
p201
p347
p342
p354
p213
p155
p313
p356
p338
p311
p349
p337
p294
p124
p317
p314
p79
p360
p325
p333
p9
p19
p8
p6
p3
p10
p12
p11
p7
p22
p21
p18
p15
p20
p5
p16
p4
p17

The net has transition(s) that can never fire:
t22
t32
t129
t21
t257
t38
t283
t284
t285
t286
t287
t288
t289
t290
t291
t293
t301
t302
t303
t328
t341
t342
t343
t344
t345
t346
t347
t348
t351
t352
t353
t354
t355
t356
t357
t358
t359
t360
t370
t371
t372
t373
t374
t375
t194
t195
t196
t221
t230
t231
t232
t73
t140
t141
t142
t185
t1
t3
t5
t4
t6
t2
t7
t23
t18
t20
t17
t35
t19
t33
t0
t9
t46
t47
t48
t36
t37
t30
t31
t34

check for constant places
p311
p312
p316
p317
p320
p321
p334
p335
p338
p347
p348
found 11 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.001sec

362570
iterations count:107079 (268), effective:10310 (25)

initing FirstDep: 0m 0.001sec


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

iterations count:2635 (6), effective:185 (0)

iterations count:2741 (6), effective:247 (0)

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

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

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

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

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

iterations count:2897 (7), effective:192 (0)

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

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

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

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

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

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

iterations count:810 (2), effective:27 (0)

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

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

iterations count:874 (2), effective:31 (0)

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

iterations count:852 (2), effective:28 (0)

iterations count:783 (1), effective:29 (0)

iterations count:2739 (6), effective:246 (0)

iterations count:971 (2), effective:44 (0)

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

iterations count:1173 (2), effective:48 (0)

iterations count:1053 (2), effective:46 (0)

iterations count:399 (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="SmartHome-PT-12"
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 SmartHome-PT-12, 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-167912641300241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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