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.r481-tall-167912692400729.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 TriangularGrid-PT-3011, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r481-tall-167912692400729
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 01:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 70K 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 TriangularGrid-PT-3011-CTLCardinality-00
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-01
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-02
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-03
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-04
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-05
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-06
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-07
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-08
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-09
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-10
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-11
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-12
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-13
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-14
FORMULA_NAME TriangularGrid-PT-3011-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679864366582

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=TriangularGrid-PT-3011
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: TriangularGrid_PT_3011
(NrP: 108 NrTr: 90 NrArc: 360)

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

net check time: 0m 0.000sec

init dd package: 0m 2.851sec


RS generation: 0m 3.985sec


-> reachability set: #nodes 6882 (6.9e+03) #states 284,675,587,524,871,889,466 (20)



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

checking: EX [AF [AX [pil1_3_5<=0]]]
normalized: EX [~ [EG [EX [~ [pil1_3_5<=0]]]]]

abstracting: (pil1_3_5<=0)
states: 88,194,772,072,553,934,344 (19)
................................................
EG iterations: 47
.-> the formula is FALSE

FORMULA TriangularGrid-PT-3011-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m50.579sec

checking: EX [EG [1<=pil2_2_1]]
normalized: EX [EG [1<=pil2_2_1]]

abstracting: (1<=pil2_2_1)
states: 196,480,815,452,233,920,142 (20)
.........................................................................
EG iterations: 73
.-> the formula is TRUE

FORMULA TriangularGrid-PT-3011-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m14.315sec

checking: AG [EF [pb3_3_5<=pbl_1_1]]
normalized: ~ [E [true U ~ [E [true U pb3_3_5<=pbl_1_1]]]]

abstracting: (pb3_3_5<=pbl_1_1)
states: 262,724,509,590,340,986,413 (20)

before gc: list nodes free: 638683

after gc: idd nodes used:86698, unused:63913302; list nodes free:351853404
MC time: 4m 8.010sec

checking: AX [EF [~ [EX [pi1_1_1<=pol1_2_3]]]]
normalized: ~ [EX [~ [E [true U ~ [EX [pi1_1_1<=pol1_2_3]]]]]]

abstracting: (pi1_1_1<=pol1_2_3)
states: 257,923,872,673,405,953,231 (20)
.
before gc: list nodes free: 5855310

after gc: idd nodes used:224585, unused:63775415; list nodes free:351102907
MC time: 3m51.015sec

checking: EG [[[1<=pb2_1_1 | 1<=pol1_1_1] | pb3_3_3<=pi2_3_3]]
normalized: EG [[pb3_3_3<=pi2_3_3 | [1<=pb2_1_1 | 1<=pol1_1_1]]]

abstracting: (1<=pol1_1_1)
states: 196,490,110,705,072,694,180 (20)
abstracting: (1<=pb2_1_1)
states: 113,282,099,913,894,443,936 (20)
abstracting: (pb3_3_3<=pi2_3_3)
states: 193,830,484,798,616,135,996 (20)
................................................
EG iterations: 48
-> the formula is TRUE

FORMULA TriangularGrid-PT-3011-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.034sec

checking: A [EF [[1<=pb1_3_1 & ~ [EF [[pil2_2_1<=1 & 1<=pi3_3_5]]]]] U AX [AX [[~ [pol2_1_1<=pb1_2_2] & pi2_3_3<=0]]]]
normalized: [~ [EG [EX [EX [~ [[pi2_3_3<=0 & ~ [pol2_1_1<=pb1_2_2]]]]]]] & ~ [E [EX [EX [~ [[pi2_3_3<=0 & ~ [pol2_1_1<=pb1_2_2]]]]] U [~ [E [true U [1<=pb1_3_1 & ~ [E [true U [pil2_2_1<=1 & 1<=pi3_3_5]]]]]] & EX [EX [~ [[pi2_3_3<=0 & ~ [pol2_1_1<=pb1_2_2]]]]]]]]]

abstracting: (pol2_1_1<=pb1_2_2)
states: 167,125,094,385,813,635,152 (20)
abstracting: (pi2_3_3<=0)
states: 196,480,815,452,233,920,142 (20)
..abstracting: (1<=pi3_3_5)
states: 88,185,476,819,799,195,286 (19)
abstracting: (pil2_2_1<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (1<=pb1_3_1)
states: 113,282,099,913,894,443,936 (20)

before gc: list nodes free: 10873744

after gc: idd nodes used:584151, unused:63415849; list nodes free:349192608
MC time: 3m49.006sec

checking: EF [[~ [[[[pol3_3_3<=pb1_3_1 & 1<=po2_3_3] | AX [1<=pi3_2_1]] & AG [~ [pbl_2_1<=pi2_3_3]]]] & AG [AG [~ [1<=pbl_2_2]]]]]
normalized: E [true U [~ [E [true U E [true U 1<=pbl_2_2]]] & ~ [[~ [E [true U pbl_2_1<=pi2_3_3]] & [~ [EX [~ [1<=pi3_2_1]]] | [pol3_3_3<=pb1_3_1 & 1<=po2_3_3]]]]]]

abstracting: (1<=po2_3_3)
states: 88,194,772,072,637,969,324 (19)
abstracting: (pol3_3_3<=pb1_3_1)
states: 167,134,389,638,452,797,935 (20)
abstracting: (1<=pi3_2_1)
states: 88,194,772,072,637,969,324 (19)
.abstracting: (pbl_2_1<=pi2_3_3)
states: 47,512,819,923,946,229,424 (19)
abstracting: (1<=pbl_2_2)
states: 252,464,607,439,428,313,488 (20)
MC time: 3m31.026sec

checking: [EG [AX [AF [~ [E [po3_2_3<=pb1_2_1 U pb3_3_5<=0]]]]] | AG [AX [[A [AF [pol3_3_1<=1] U ~ [pil2_2_1<=0]] & [A [1<=pb1_3_3 U 1<=pb2_2_2] | pol2_2_3<=pol3_2_3]]]]]
normalized: [~ [E [true U EX [~ [[[pol2_2_3<=pol3_2_3 | [~ [EG [~ [1<=pb2_2_2]]] & ~ [E [~ [1<=pb2_2_2] U [~ [1<=pb1_3_3] & ~ [1<=pb2_2_2]]]]]] & [~ [EG [pil2_2_1<=0]] & ~ [E [pil2_2_1<=0 U [pil2_2_1<=0 & EG [~ [pol3_3_1<=1]]]]]]]]]]] | EG [~ [EX [EG [E [po3_2_3<=pb1_2_1 U pb3_3_5<=0]]]]]]

abstracting: (pb3_3_5<=0)
states: 171,393,487,610,977,445,530 (20)
abstracting: (po3_2_3<=pb1_2_1)
states: 230,822,284,120,673,278,976 (20)
.
EG iterations: 1
..........
before gc: list nodes free: 4856990

after gc: idd nodes used:716661, unused:63283339; list nodes free:348376759
..................................MC time: 3m15.075sec

checking: ~ [[[AF [~ [[[[po3_1_1<=0 & pi1_2_3<=0] | AF [1<=pil1_1_1]] & AF [pi3_3_5<=0]]]] & E [EF [EF [1<=pb2_3_1]] U ~ [AX [1<=pi1_3_3]]]] | AG [E [pb1_2_3<=po1_2_1 U ~ [1<=pb3_2_3]]]]]
normalized: ~ [[~ [E [true U ~ [E [pb1_2_3<=po1_2_1 U ~ [1<=pb3_2_3]]]]] | [E [E [true U E [true U 1<=pb2_3_1]] U EX [~ [1<=pi1_3_3]]] & ~ [EG [[~ [EG [~ [pi3_3_5<=0]]] & [~ [EG [~ [1<=pil1_1_1]]] | [po3_1_1<=0 & pi1_2_3<=0]]]]]]]]

abstracting: (pi1_2_3<=0)
states: 196,480,815,452,233,920,142 (20)
abstracting: (po3_1_1<=0)
states: 196,480,815,452,317,955,122 (20)
abstracting: (1<=pil1_1_1)
states: 196,490,110,705,072,694,180 (20)
...............
before gc: list nodes free: 727591

after gc: idd nodes used:366836, unused:63633164; list nodes free:352444246
...............................
EG iterations: 46
abstracting: (pi3_3_5<=0)
states: 196,490,110,705,072,694,180 (20)
..............................................
EG iterations: 46
........MC time: 3m 0.037sec

checking: [AG [[[AG [1<=pil3_2_1] | ~ [pbl_2_1<=0]] | po1_3_3<=0]] & EF [[EX [EX [[po2_2_3<=po3_1_1 | pbl_3_3<=pol2_1_1]]] | AF [[pb2_3_2<=0 & EX [1<=pi3_2_3]]]]]]
normalized: [E [true U [~ [EG [~ [[pb2_3_2<=0 & EX [1<=pi3_2_3]]]]] | EX [EX [[po2_2_3<=po3_1_1 | pbl_3_3<=pol2_1_1]]]]] & ~ [E [true U ~ [[po1_3_3<=0 | [~ [pbl_2_1<=0] | ~ [E [true U ~ [1<=pil3_2_1]]]]]]]]]

abstracting: (1<=pil3_2_1)
states: 196,480,815,452,233,920,142 (20)
abstracting: (pbl_2_1<=0)
states: 32,210,980,085,363,047,404 (19)
abstracting: (po1_3_3<=0)
states: 196,480,815,452,233,920,142 (20)

before gc: list nodes free: 2885979

after gc: idd nodes used:289168, unused:63710832; list nodes free:352853783
abstracting: (pbl_3_3<=pol2_1_1)
states: 68,359,241,917,934,224,964 (19)
abstracting: (po2_2_3<=po3_1_1)
states: 223,234,949,892,737,817,985 (20)
..abstracting: (1<=pi3_2_3)
states: 88,194,772,072,637,969,324 (19)
.abstracting: (pb2_3_2<=0)
states: 171,397,567,111,559,139,027 (20)
...................................
EG iterations: 35
MC time: 2m46.038sec

checking: A [[pil3_2_3<=0 | [[EF [[pb3_3_3<=1 & [1<=po2_3_3 & pol3_1_1<=1]]] & AX [po2_3_1<=0]] & 1<=pol2_3_1]] U A [[A [1<=pol2_2_1 U EF [pil2_3_5<=1]] | pb1_2_2<=pol1_3_1] U ~ [pol3_2_3<=1]]]
normalized: [~ [EG [~ [[~ [EG [pol3_2_3<=1]] & ~ [E [pol3_2_3<=1 U [pol3_2_3<=1 & ~ [[pb1_2_2<=pol1_3_1 | [~ [EG [~ [E [true U pil2_3_5<=1]]]] & ~ [E [~ [E [true U pil2_3_5<=1]] U [~ [1<=pol2_2_1] & ~ [E [true U pil2_3_5<=1]]]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [pol3_2_3<=1]] & ~ [E [pol3_2_3<=1 U [pol3_2_3<=1 & ~ [[pb1_2_2<=pol1_3_1 | [~ [EG [~ [E [true U pil2_3_5<=1]]]] & ~ [E [~ [E [true U pil2_3_5<=1]] U [~ [1<=pol2_2_1] & ~ [E [true U pil2_3_5<=1]]]]]]]]]]]]] U [~ [[pil3_2_3<=0 | [1<=pol2_3_1 & [~ [EX [~ [po2_3_1<=0]]] & E [true U [pb3_3_3<=1 & [1<=po2_3_3 & pol3_1_1<=1]]]]]]] & ~ [[~ [EG [pol3_2_3<=1]] & ~ [E [pol3_2_3<=1 U [pol3_2_3<=1 & ~ [[pb1_2_2<=pol1_3_1 | [~ [EG [~ [E [true U pil2_3_5<=1]]]] & ~ [E [~ [E [true U pil2_3_5<=1]] U [~ [1<=pol2_2_1] & ~ [E [true U pil2_3_5<=1]]]]]]]]]]]]]]]]]

abstracting: (pil2_3_5<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (1<=pol2_2_1)
states: 196,480,815,452,233,920,142 (20)
abstracting: (pil2_3_5<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pil2_3_5<=1)
states: 284,675,587,524,871,889,466 (20)
.
EG iterations: 1
abstracting: (pb1_2_2<=pol1_3_1)
states: 222,166,954,815,009,249,205 (20)
abstracting: (pol3_2_3<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pol3_2_3<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pol3_2_3<=1)
states: 284,675,587,524,871,889,466 (20)

EG iterations: 0
abstracting: (pol3_1_1<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (1<=po2_3_3)
states: 88,194,772,072,637,969,324 (19)
abstracting: (pb3_3_3<=1)
states: 244,597,714,760,406,667,359 (20)
abstracting: (po2_3_1<=0)
states: 196,480,815,452,317,955,122 (20)
.abstracting: (1<=pol2_3_1)
states: 196,480,815,452,317,955,122 (20)
abstracting: (pil3_2_3<=0)
states: 88,194,772,072,637,969,324 (19)
abstracting: (pil2_3_5<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (1<=pol2_2_1)
states: 196,480,815,452,233,920,142 (20)
abstracting: (pil2_3_5<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pil2_3_5<=1)
states: 284,675,587,524,871,889,466 (20)
.
EG iterations: 1
abstracting: (pb1_2_2<=pol1_3_1)
states: 222,166,954,815,009,249,205 (20)
abstracting: (pol3_2_3<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pol3_2_3<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pol3_2_3<=1)
states: 284,675,587,524,871,889,466 (20)

EG iterations: 0
MC time: 2m33.043sec

checking: EX [A [[[[[E [pb3_3_3<=1 U pol3_2_3<=0] | EG [1<=pil3_3_5]] & [[1<=pi1_3_3 & pb2_2_3<=0] | EF [pol1_2_1<=0]]] & [AX [1<=pbl_1_1] | [[pb2_3_2<=pil3_2_3 & pol3_1_1<=1] | EX [1<=pil1_3_5]]]] | po3_2_3<=0] U ~ [[EX [AF [pi2_3_1<=0]] | EG [~ [1<=pi3_3_1]]]]]]
normalized: EX [[~ [EG [[EG [~ [1<=pi3_3_1]] | EX [~ [EG [~ [pi2_3_1<=0]]]]]]] & ~ [E [[EG [~ [1<=pi3_3_1]] | EX [~ [EG [~ [pi2_3_1<=0]]]]] U [~ [[po3_2_3<=0 | [[[EX [1<=pil1_3_5] | [pb2_3_2<=pil3_2_3 & pol3_1_1<=1]] | ~ [EX [~ [1<=pbl_1_1]]]] & [[E [true U pol1_2_1<=0] | [1<=pi1_3_3 & pb2_2_3<=0]] & [EG [1<=pil3_3_5] | E [pb3_3_3<=1 U pol3_2_3<=0]]]]]] & [EG [~ [1<=pi3_3_1]] | EX [~ [EG [~ [pi2_3_1<=0]]]]]]]]]]

abstracting: (pi2_3_1<=0)
states: 196,480,815,452,317,955,122 (20)
...........
before gc: list nodes free: 8651166

after gc: idd nodes used:590084, unused:63409916; list nodes free:351201884
..............................................................
EG iterations: 73
.abstracting: (1<=pi3_3_1)
states: 88,185,476,819,799,195,286 (19)
.....MC time: 2m21.020sec

checking: E [~ [[EF [~ [EF [1<=pb1_2_1]]] & [AF [[A [pi3_2_1<=0 U 1<=pb2_3_2] | [1<=po3_1_1 | pb1_3_1<=1]]] & EF [A [pb2_3_2<=pil1_3_5 U 1<=pb3_2_2]]]]] U [~ [EF [~ [[[pi3_3_5<=1 | pol1_1_1<=0] | EX [pb3_2_2<=1]]]]] & [EF [1<=po3_3_1] & EF [EF [E [1<=pbl_3_5 U 1<=pol3_2_1]]]]]]
normalized: E [~ [[[E [true U [~ [EG [~ [1<=pb3_2_2]]] & ~ [E [~ [1<=pb3_2_2] U [~ [pb2_3_2<=pil1_3_5] & ~ [1<=pb3_2_2]]]]]] & ~ [EG [~ [[[1<=po3_1_1 | pb1_3_1<=1] | [~ [EG [~ [1<=pb2_3_2]]] & ~ [E [~ [1<=pb2_3_2] U [~ [pi3_2_1<=0] & ~ [1<=pb2_3_2]]]]]]]]]] & E [true U ~ [E [true U 1<=pb1_2_1]]]]] U [[E [true U E [true U E [1<=pbl_3_5 U 1<=pol3_2_1]]] & E [true U 1<=po3_3_1]] & ~ [E [true U ~ [[EX [pb3_2_2<=1] | [pi3_3_5<=1 | pol1_1_1<=0]]]]]]]

abstracting: (pol1_1_1<=0)
states: 88,185,476,819,799,195,286 (19)
abstracting: (pi3_3_5<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pb3_2_2<=1)
states: 244,597,714,760,489,032,632 (20)
.abstracting: (1<=po3_3_1)
states: 88,185,476,819,799,195,286 (19)
abstracting: (1<=pol3_2_1)
states: 196,480,815,452,233,920,142 (20)
abstracting: (1<=pbl_3_5)
states: 252,476,427,408,583,154,108 (20)
abstracting: (1<=pb1_2_1)
states: 113,278,020,413,405,936,721 (20)

before gc: list nodes free: 3412970

after gc: idd nodes used:475745, unused:63524255; list nodes free:351886057
MC time: 2m16.446sec

checking: E [[pb1_3_2<=0 & A [EX [[[pb1_1_1<=pb2_3_4 & 1<=pbl_3_5] | ~ [pil2_1_1<=1]]] U 1<=pb1_2_3]] U ~ [E [A [EF [pb3_3_3<=0] U E [pi3_3_1<=pb2_3_5 U pi2_1_1<=1]] U [~ [po1_3_5<=pil2_2_1] & [~ [1<=pil2_2_3] | EG [po3_3_1<=po2_3_1]]]]]]
normalized: E [[pb1_3_2<=0 & [~ [EG [~ [1<=pb1_2_3]]] & ~ [E [~ [1<=pb1_2_3] U [~ [EX [[~ [pil2_1_1<=1] | [pb1_1_1<=pb2_3_4 & 1<=pbl_3_5]]]] & ~ [1<=pb1_2_3]]]]]] U ~ [E [[~ [EG [~ [E [pi3_3_1<=pb2_3_5 U pi2_1_1<=1]]]] & ~ [E [~ [E [pi3_3_1<=pb2_3_5 U pi2_1_1<=1]] U [~ [E [true U pb3_3_3<=0]] & ~ [E [pi3_3_1<=pb2_3_5 U pi2_1_1<=1]]]]]] U [[EG [po3_3_1<=po2_3_1] | ~ [1<=pil2_2_3]] & ~ [po1_3_5<=pil2_2_1]]]]]

abstracting: (po1_3_5<=pil2_2_1)
states: 257,921,453,084,428,062,905 (20)
abstracting: (1<=pil2_2_3)
states: 196,480,815,452,457,417,970 (20)
abstracting: (po3_3_1<=po2_3_1)
states: 223,241,825,556,454,595,435 (20)
...................................................
EG iterations: 51
abstracting: (pi2_1_1<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pi3_3_1<=pb2_3_5)
states: 230,829,527,214,629,951,323 (20)
abstracting: (pb3_3_3<=0)
states: 171,397,567,111,465,952,745 (20)
abstracting: (pi2_1_1<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pi3_3_1<=pb2_3_5)
states: 230,829,527,214,629,951,323 (20)
abstracting: (pi2_1_1<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pi3_3_1<=pb2_3_5)
states: 230,829,527,214,629,951,323 (20)
.
EG iterations: 1
MC time: 2m 0.036sec

checking: AG [AG [[[[~ [1<=pil1_1_1] | AF [po2_1_1<=pol3_1_1]] | [[pb2_2_3<=pol3_3_5 | pi2_1_1<=pi1_2_1] | E [pol3_3_1<=0 U pil2_3_5<=1]]] | [[~ [pbl_3_2<=1] & [EX [1<=po2_2_1] | pol1_3_3<=1]] & E [A [po3_2_3<=pi3_3_5 U pol3_2_3<=pol3_2_3] U pb1_2_2<=0]]]]]
normalized: ~ [E [true U E [true U ~ [[[E [[~ [EG [~ [pol3_2_3<=pol3_2_3]]] & ~ [E [~ [pol3_2_3<=pol3_2_3] U [~ [po3_2_3<=pi3_3_5] & ~ [pol3_2_3<=pol3_2_3]]]]] U pb1_2_2<=0] & [[pol1_3_3<=1 | EX [1<=po2_2_1]] & ~ [pbl_3_2<=1]]] | [[E [pol3_3_1<=0 U pil2_3_5<=1] | [pb2_2_3<=pol3_3_5 | pi2_1_1<=pi1_2_1]] | [~ [EG [~ [po2_1_1<=pol3_1_1]]] | ~ [1<=pil1_1_1]]]]]]]]

abstracting: (1<=pil1_1_1)
states: 196,490,110,705,072,694,180 (20)
abstracting: (po2_1_1<=pol3_1_1)
states: 257,923,872,673,489,988,211 (20)
.....................
before gc: list nodes free: 3038304

after gc: idd nodes used:616002, unused:63383998; list nodes free:351068035
.MC time: 1m51.139sec

checking: E [pbl_2_2<=pb1_2_1 U [[A [~ [[[1<=pil1_2_3 & pbl_3_2<=pil3_3_1] | ~ [pi3_1_1<=pb3_3_4]]] U ~ [[[1<=pb3_3_2 & pbl_2_2<=1] & [pi1_2_3<=pbl_3_3 & pol1_3_3<=1]]]] & EF [[EG [pbl_3_5<=1] & [[1<=pb1_1_1 | pi1_3_1<=pi1_3_5] | ~ [1<=pil3_2_3]]]]] | AG [pb3_2_1<=0]]]
normalized: E [pbl_2_2<=pb1_2_1 U [~ [E [true U ~ [pb3_2_1<=0]]] | [E [true U [[~ [1<=pil3_2_3] | [1<=pb1_1_1 | pi1_3_1<=pi1_3_5]] & EG [pbl_3_5<=1]]] & [~ [EG [[[pi1_2_3<=pbl_3_3 & pol1_3_3<=1] & [1<=pb3_3_2 & pbl_2_2<=1]]]] & ~ [E [[[pi1_2_3<=pbl_3_3 & pol1_3_3<=1] & [1<=pb3_3_2 & pbl_2_2<=1]] U [[~ [pi3_1_1<=pb3_3_4] | [1<=pil1_2_3 & pbl_3_2<=pil3_3_1]] & [[pi1_2_3<=pbl_3_3 & pol1_3_3<=1] & [1<=pb3_3_2 & pbl_2_2<=1]]]]]]]]]

abstracting: (pbl_2_2<=1)
states: 83,659,928,909,510,805,978 (19)
abstracting: (1<=pb3_3_2)
states: 113,278,020,413,216,045,499 (20)
abstracting: (pol1_3_3<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pi1_2_3<=pbl_3_3)
states: 275,417,367,196,942,938,111 (20)
abstracting: (pbl_3_2<=pil3_3_1)
states: 68,359,241,918,010,813,788 (19)
abstracting: (1<=pil1_2_3)
states: 196,480,815,452,233,920,142 (20)
abstracting: (pi3_1_1<=pb3_3_4)
states: 230,822,284,120,719,511,298 (20)
abstracting: (pbl_2_2<=1)
states: 83,659,928,909,510,805,978 (19)
abstracting: (1<=pb3_3_2)
states: 113,278,020,413,216,045,499 (20)
abstracting: (pol1_3_3<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pi1_2_3<=pbl_3_3)
states: 275,417,367,196,942,938,111 (20)
abstracting: (pbl_2_2<=1)
states: 83,659,928,909,510,805,978 (19)
abstracting: (1<=pb3_3_2)
states: 113,278,020,413,216,045,499 (20)
abstracting: (pol1_3_3<=1)
states: 284,675,587,524,871,889,466 (20)
abstracting: (pi1_2_3<=pbl_3_3)
states: 275,417,367,196,942,938,111 (20)
..............................MC time: 1m42.016sec

checking: AG [EF [pb3_3_5<=pbl_1_1]]
normalized: ~ [E [true U ~ [E [true U pb3_3_5<=pbl_1_1]]]]

abstracting: (pb3_3_5<=pbl_1_1)
states: 262,724,509,590,340,986,413 (20)

before gc: list nodes free: 6114971

after gc: idd nodes used:509785, unused:63490215; list nodes free:351652621

before gc: list nodes free: 4825762

after gc: idd nodes used:549274, unused:63450726; list nodes free:351463047
-> the formula is FALSE

FORMULA TriangularGrid-PT-3011-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393916 kB
MemFree: 5252200 kB
After kill :
MemTotal: 16393916 kB
MemFree: 16178632 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:79085 (878), effective:12928 (143)

initing FirstDep: 0m 0.000sec


iterations count:5584 (62), effective:955 (10)

sat_reach.icc:155: Timeout: after 247 sec


sat_reach.icc:155: Timeout: after 230 sec


iterations count:5550 (61), effective:731 (8)

sat_reach.icc:155: Timeout: after 228 sec


iterations count:10106 (112), effective:983 (10)

iterations count:623 (6), effective:58 (0)

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

sat_reach.icc:155: Timeout: after 210 sec


iterations count:2171 (24), effective:280 (3)

net_ddint.h:600: Timeout: after 194 sec


net_ddint.h:600: Timeout: after 179 sec


iterations count:3777 (41), effective:582 (6)

iterations count:16973 (188), effective:1863 (20)

sat_reach.icc:155: Timeout: after 165 sec


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

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

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

iterations count:4514 (50), effective:696 (7)

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

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

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

sat_reach.icc:155: Timeout: after 152 sec


net_ddint.h:600: Timeout: after 140 sec


iterations count:4993 (55), effective:757 (8)

iterations count:622 (6), effective:59 (0)

iterations count:541 (6), effective:51 (0)

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

iterations count:2394 (26), effective:286 (3)

sat_reach.icc:155: Timeout: after 130 sec


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

iterations count:1158 (12), effective:137 (1)

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

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

sat_reach.icc:155: Timeout: after 119 sec


net_ddint.h:600: Timeout: after 110 sec


iterations count:10229 (113), effective:1439 (15)

ctl_mc.icc:221: Timeout: after 101 sec


iterations count:5584 (62), effective:955 (10)

iterations count:97434 (1082), effective:12963 (144)

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="TriangularGrid-PT-3011"
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 TriangularGrid-PT-3011, 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 r481-tall-167912692400729"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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