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.r001-oct2-167813588900601.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutonomousCar-PT-05b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r001-oct2-167813588900601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 12:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 25 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:34 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 159K 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 AutonomousCar-PT-05b-CTLCardinality-00
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-01
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-02
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-03
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-04
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-05
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-06
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-07
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-08
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-09
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-10
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-11
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-12
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-13
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-14
FORMULA_NAME AutonomousCar-PT-05b-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678395408001

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=AutonomousCar-PT-05b
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: AutonomousCar_PT_05b
(NrP: 255 NrTr: 490 NrArc: 2527)

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

net check time: 0m 0.000sec

init dd package: 0m 2.960sec


RS generation: 0m20.648sec


-> reachability set: #nodes 90912 (9.1e+04) #states 158,000,170,058 (11)



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

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

abstracting: (p72<=0)
states: 152,114,796,814 (11)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-05b-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.353sec

checking: EF [EX [~ [AF [E [p90<=0 U 1<=p117]]]]]
normalized: E [true U EX [EG [~ [E [p90<=0 U 1<=p117]]]]]

abstracting: (1<=p117)
states: 5,885,373,244 (9)
abstracting: (p90<=0)
states: 150,151,483,204 (11)
.................
before gc: list nodes free: 1584622

after gc: idd nodes used:539459, unused:63460541; list nodes free:289130534
............................
before gc: list nodes free: 1940253

after gc: idd nodes used:526831, unused:63473169; list nodes free:293340547
.MC time: 3m56.051sec

checking: AG [AF [[p196<=p38 | EX [~ [EF [1<=p3]]]]]]
normalized: ~ [E [true U EG [~ [[p196<=p38 | EX [~ [E [true U 1<=p3]]]]]]]]

abstracting: (1<=p3)
states: 44,547,898,250 (10)
.abstracting: (p196<=p38)
states: 157,162,885,786 (11)
...............................
EG iterations: 31
-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m48.349sec

checking: ~ [AX [~ [[AX [AX [1<=p199]] | AG [~ [EG [p247<=p176]]]]]]]
normalized: EX [[~ [E [true U EG [p247<=p176]]] | ~ [EX [EX [~ [1<=p199]]]]]]

abstracting: (1<=p199)
states: 875,342,648 (8)
..abstracting: (p247<=p176)
states: 153,282,838,589 (11)
...........
before gc: list nodes free: 7434421

after gc: idd nodes used:901715, unused:63098285; list nodes free:291729036
....MC time: 3m53.014sec

checking: ~ [AG [[AF [p116<=p177] & EX [~ [1<=p210]]]]]
normalized: E [true U ~ [[EX [~ [1<=p210]] & ~ [EG [~ [p116<=p177]]]]]]

abstracting: (p116<=p177)
states: 150,461,317,932 (11)
............
before gc: list nodes free: 9604564

after gc: idd nodes used:485380, unused:63514620; list nodes free:293576003
.................................................................
EG iterations: 77
abstracting: (1<=p210)
states: 13,862,393,490 (10)
.MC time: 3m36.005sec

checking: [~ [EX [AG [[[p38<=1 & ~ [1<=p60]] & EG [p36<=1]]]]] | AX [AX [AG [EX [p108<=1]]]]]
normalized: [~ [EX [EX [E [true U ~ [EX [p108<=1]]]]]] | ~ [EX [~ [E [true U ~ [[EG [p36<=1] & [p38<=1 & ~ [1<=p60]]]]]]]]]

abstracting: (1<=p60)
states: 153,600 (5)
abstracting: (p38<=1)
states: 158,000,170,058 (11)
abstracting: (p36<=1)
states: 158,000,170,058 (11)

EG iterations: 0

before gc: list nodes free: 9237513

after gc: idd nodes used:328445, unused:63671555; list nodes free:294245500
.abstracting: (p108<=1)
states: 158,000,170,058 (11)
...-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m10.092sec

checking: A [1<=p49 U ~ [E [EX [p134<=1] U ~ [EG [p90<=p48]]]]]
normalized: [~ [EG [E [EX [p134<=1] U ~ [EG [p90<=p48]]]]] & ~ [E [E [EX [p134<=1] U ~ [EG [p90<=p48]]] U [~ [1<=p49] & E [EX [p134<=1] U ~ [EG [p90<=p48]]]]]]]

abstracting: (p90<=p48)
states: 150,461,164,332 (11)
................................
before gc: list nodes free: 4490308

after gc: idd nodes used:734262, unused:63265738; list nodes free:292413329
.....................................
EG iterations: 69
abstracting: (p134<=1)
states: 158,000,170,058 (11)
.abstracting: (1<=p49)
states: 5,885,373,244 (9)
abstracting: (p90<=p48)
states: 150,461,164,332 (11)
.......MC time: 3m31.002sec

checking: E [p251<=p9 U [EX [AG [~ [EF [p28<=p127]]]] | AF [1<=p193]]]
normalized: E [p251<=p9 U [~ [EG [~ [1<=p193]]] | EX [~ [E [true U E [true U p28<=p127]]]]]]

abstracting: (p28<=p127)
states: 158,000,167,658 (11)
.abstracting: (1<=p193)
states: 875,342,648 (8)
.........................
before gc: list nodes free: 5556804

after gc: idd nodes used:626986, unused:63373014; list nodes free:292941975
................................................
EG iterations: 73
abstracting: (p251<=p9)
states: 158,000,170,058 (11)
-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m55.154sec

checking: EX [AG [[[AX [E [p57<=p208 U 1<=p5]] & p134<=1] | p52<=p117]]]
normalized: EX [~ [E [true U ~ [[p52<=p117 | [p134<=1 & ~ [EX [~ [E [p57<=p208 U 1<=p5]]]]]]]]]]

abstracting: (1<=p5)
states: 11,791,380,376 (10)
abstracting: (p57<=p208)
states: 152,607,987,574 (11)
.abstracting: (p134<=1)
states: 158,000,170,058 (11)
abstracting: (p52<=p117)
states: 152,573,995,212 (11)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-05b-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.508sec

checking: AF [[A [AF [E [p91<=p22 U p26<=p41]] U EX [p61<=1]] & A [p161<=1 U ~ [AF [~ [p62<=0]]]]]]
normalized: ~ [EG [~ [[[~ [EG [~ [EG [p62<=0]]]] & ~ [E [~ [EG [p62<=0]] U [~ [p161<=1] & ~ [EG [p62<=0]]]]]] & [~ [EG [~ [EX [p61<=1]]]] & ~ [E [~ [EX [p61<=1]] U [EG [~ [E [p91<=p22 U p26<=p41]]] & ~ [EX [p61<=1]]]]]]]]]]

abstracting: (p61<=1)
states: 158,000,170,058 (11)
.abstracting: (p26<=p41)
states: 158,000,169,458 (11)
abstracting: (p91<=p22)
states: 158,000,016,458 (11)
.
EG iterations: 1
abstracting: (p61<=1)
states: 158,000,170,058 (11)
.abstracting: (p61<=1)
states: 158,000,170,058 (11)
..
EG iterations: 1
abstracting: (p62<=0)
states: 158,000,016,458 (11)
...
before gc: list nodes free: 4970507

after gc: idd nodes used:465880, unused:63534120; list nodes free:293642900
.........................................
EG iterations: 44
abstracting: (p161<=1)
states: 158,000,170,058 (11)
abstracting: (p62<=0)
states: 158,000,016,458 (11)
............................................
EG iterations: 44
abstracting: (p62<=0)
states: 158,000,016,458 (11)
............................................
EG iterations: 44
................................................
EG iterations: 48
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 7.352sec

checking: E [[p93<=p56 | p8<=1] U [AX [[p222<=0 | [[A [p154<=p76 U p70<=0] | [1<=p233 & p186<=0]] | ~ [AG [p53<=1]]]]] & EX [AF [AG [p152<=1]]]]]
normalized: E [[p93<=p56 | p8<=1] U [~ [EX [~ [[p222<=0 | [[[~ [EG [~ [p70<=0]]] & ~ [E [~ [p70<=0] U [~ [p154<=p76] & ~ [p70<=0]]]]] | [1<=p233 & p186<=0]] | E [true U ~ [p53<=1]]]]]]] & EX [~ [EG [E [true U ~ [p152<=1]]]]]]]

abstracting: (p152<=1)
states: 158,000,170,058 (11)
.
EG iterations: 1
.abstracting: (p53<=1)
states: 158,000,170,058 (11)
abstracting: (p186<=0)
states: 158,000,002,658 (11)
abstracting: (1<=p233)
states: 4,897,161,171 (9)
abstracting: (p70<=0)
states: 152,114,796,814 (11)
abstracting: (p154<=p76)
states: 158,000,004,458 (11)
abstracting: (p70<=0)
states: 152,114,796,814 (11)
abstracting: (p70<=0)
states: 152,114,796,814 (11)
.........................
before gc: list nodes free: 11438202

after gc: idd nodes used:930458, unused:63069542; list nodes free:291622683
...........MC time: 3m40.009sec

checking: E [~ [[~ [AG [E [p193<=p247 U 1<=p149]]] & E [[~ [EG [p78<=1]] & AF [p212<=p74]] U [~ [p13<=p0] | AX [1<=p194]]]]] U [EG [EG [[~ [p156<=p249] | ~ [p203<=0]]]] & AX [1<=p23]]]
normalized: E [~ [[E [[~ [EG [~ [p212<=p74]]] & ~ [EG [p78<=1]]] U [~ [EX [~ [1<=p194]]] | ~ [p13<=p0]]] & E [true U ~ [E [p193<=p247 U 1<=p149]]]]] U [~ [EX [~ [1<=p23]]] & EG [EG [[~ [p203<=0] | ~ [p156<=p249]]]]]]

abstracting: (p156<=p249)
states: 152,593,611,224 (11)
abstracting: (p203<=0)
states: 157,124,827,410 (11)
..................
before gc: list nodes free: 10994024

after gc: idd nodes used:993624, unused:63006376; list nodes free:291337327
......MC time: 3m18.026sec

checking: EG [A [EX [[[AG [p56<=0] & EX [p184<=p89]] & [[p195<=p127 & p242<=p193] & AX [1<=p141]]]] U [1<=p146 | E [AG [p66<=p100] U [p228<=1 | A [p205<=0 U p113<=0]]]]]]
normalized: EG [[~ [EG [~ [[1<=p146 | E [~ [E [true U ~ [p66<=p100]]] U [p228<=1 | [~ [EG [~ [p113<=0]]] & ~ [E [~ [p113<=0] U [~ [p205<=0] & ~ [p113<=0]]]]]]]]]]] & ~ [E [~ [[1<=p146 | E [~ [E [true U ~ [p66<=p100]]] U [p228<=1 | [~ [EG [~ [p113<=0]]] & ~ [E [~ [p113<=0] U [~ [p205<=0] & ~ [p113<=0]]]]]]]]] U [~ [EX [[[~ [EX [~ [1<=p141]]] & [p195<=p127 & p242<=p193]] & [EX [p184<=p89] & ~ [E [true U ~ [p56<=0]]]]]]] & ~ [[1<=p146 | E [~ [E [true U ~ [p66<=p100]]] U [p228<=1 | [~ [EG [~ [p113<=0]]] & ~ [E [~ [p113<=0] U [~ [p205<=0] & ~ [p113<=0]]]]]]]]]]]]]]

abstracting: (p113<=0)
states: 154,751,216,048 (11)
abstracting: (p205<=0)
states: 144,137,776,568 (11)
abstracting: (p113<=0)
states: 154,751,216,048 (11)
abstracting: (p113<=0)
states: 154,751,216,048 (11)
......................................................................
EG iterations: 70
abstracting: (p228<=1)
states: 158,000,170,058 (11)
abstracting: (p66<=p100)
states: 154,711,352,438 (11)
abstracting: (1<=p146)
states: 7,848,533,254 (9)
abstracting: (p56<=0)
states: 152,114,796,814 (11)
abstracting: (p184<=p89)
states: 158,000,003,858 (11)
.abstracting: (p242<=p193)
states: 153,103,008,887 (11)
abstracting: (p195<=p127)
states: 157,124,827,410 (11)
abstracting: (1<=p141)
states: 5,885,373,244 (9)
..abstracting: (p113<=0)
states: 154,751,216,048 (11)
abstracting: (p205<=0)
states: 144,137,776,568 (11)
abstracting: (p113<=0)
states: 154,751,216,048 (11)
abstracting: (p113<=0)
states: 154,751,216,048 (11)
......................................................................
EG iterations: 70
abstracting: (p228<=1)
states: 158,000,170,058 (11)
abstracting: (p66<=p100)
states: 154,711,352,438 (11)
abstracting: (1<=p146)
states: 7,848,533,254 (9)
abstracting: (p113<=0)
states: 154,751,216,048 (11)
abstracting: (p205<=0)
states: 144,137,776,568 (11)
abstracting: (p113<=0)
states: 154,751,216,048 (11)
abstracting: (p113<=0)
states: 154,751,216,048 (11)
......................................................................
EG iterations: 70
abstracting: (p228<=1)
states: 158,000,170,058 (11)
abstracting: (p66<=p100)
states: 154,711,352,438 (11)
abstracting: (1<=p146)
states: 7,848,533,254 (9)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m38.384sec

checking: EG [[[p134<=p116 & ~ [EG [1<=p86]]] | ~ [E [[[[1<=p69 | p141<=p94] & EF [1<=p113]] | [[p200<=p253 | p203<=1] & EG [p85<=0]]] U [1<=p88 | [[p179<=p120 & 1<=p200] & [p70<=1 & p250<=1]]]]]]]
normalized: EG [[~ [E [[[EG [p85<=0] & [p200<=p253 | p203<=1]] | [E [true U 1<=p113] & [1<=p69 | p141<=p94]]] U [1<=p88 | [[p70<=1 & p250<=1] & [p179<=p120 & 1<=p200]]]]] | [p134<=p116 & ~ [EG [1<=p86]]]]]

abstracting: (1<=p86)
states: 5,885,373,244 (9)
.......
before gc: list nodes free: 10803031

after gc: idd nodes used:832076, unused:63167924; list nodes free:292031844
..........................MC time: 3m 7.014sec

checking: E [[AF [~ [p12<=0]] & [E [[[[p248<=1 | p108<=p129] | [1<=p252 | p182<=p6]] & EG [p95<=1]] U AF [[1<=p136 & 1<=p83]]] & ~ [[A [[p214<=0 | 1<=p32] U [1<=p26 | p238<=p13]] | p170<=1]]]] U EG [[p31<=0 & [[[p92<=0 & p141<=p172] | EG [1<=p62]] | A [EG [1<=p119] U E [1<=p15 U p141<=0]]]]]]
normalized: E [[[E [[[[p248<=1 | p108<=p129] | [1<=p252 | p182<=p6]] & EG [p95<=1]] U ~ [EG [~ [[1<=p136 & 1<=p83]]]]] & ~ [[p170<=1 | [~ [EG [~ [[1<=p26 | p238<=p13]]]] & ~ [E [~ [[1<=p26 | p238<=p13]] U [~ [[p214<=0 | 1<=p32]] & ~ [[1<=p26 | p238<=p13]]]]]]]]] & ~ [EG [p12<=0]]] U EG [[p31<=0 & [[~ [EG [~ [E [1<=p15 U p141<=0]]]] & ~ [E [~ [E [1<=p15 U p141<=0]] U [~ [EG [1<=p119]] & ~ [E [1<=p15 U p141<=0]]]]]] | [EG [1<=p62] | [p92<=0 & p141<=p172]]]]]]

abstracting: (p141<=p172)
states: 152,326,042,152 (11)
abstracting: (p92<=0)
states: 158,000,016,458 (11)
abstracting: (1<=p62)
states: 153,600 (5)
..................................
EG iterations: 34
abstracting: (p141<=0)
states: 152,114,796,814 (11)
abstracting: (1<=p15)
states: 27,193,632,780 (10)
abstracting: (1<=p119)
states: 5,885,373,244 (9)
.......
before gc: list nodes free: 12283002

after gc: idd nodes used:891946, unused:63108054; list nodes free:291767198
................MC time: 2m46.018sec

checking: A [EG [[[[[[p203<=p1 | p180<=p68] & EF [p210<=1]] & E [p109<=p3 U 1<=p42]] | [[[1<=p130 | p161<=p198] | [1<=p92 | p246<=0]] | EF [p0<=p160]]] & [AF [~ [p209<=1]] | [1<=p224 | [[p74<=p134 & p119<=p105] | ~ [1<=p233]]]]]] U ~ [[~ [E [[~ [1<=p145] | 1<=p4] U 1<=p65]] | A [p151<=p108 U EG [p246<=p156]]]]]
normalized: [~ [EG [[[~ [EG [~ [EG [p246<=p156]]]] & ~ [E [~ [EG [p246<=p156]] U [~ [p151<=p108] & ~ [EG [p246<=p156]]]]]] | ~ [E [[1<=p4 | ~ [1<=p145]] U 1<=p65]]]]] & ~ [E [[[~ [EG [~ [EG [p246<=p156]]]] & ~ [E [~ [EG [p246<=p156]] U [~ [p151<=p108] & ~ [EG [p246<=p156]]]]]] | ~ [E [[1<=p4 | ~ [1<=p145]] U 1<=p65]]] U [~ [EG [[[[1<=p224 | [~ [1<=p233] | [p74<=p134 & p119<=p105]]] | ~ [EG [p209<=1]]] & [[E [true U p0<=p160] | [[1<=p92 | p246<=0] | [1<=p130 | p161<=p198]]] | [E [p109<=p3 U 1<=p42] & [E [true U p210<=1] & [p203<=p1 | p180<=p68]]]]]]] & [[~ [EG [~ [EG [p246<=p156]]]] & ~ [E [~ [EG [p246<=p156]] U [~ [p151<=p108] & ~ [EG [p246<=p156]]]]]] | ~ [E [[1<=p4 | ~ [1<=p145]] U 1<=p65]]]]]]]

abstracting: (1<=p65)
states: 3,438,701,370 (9)
abstracting: (1<=p145)
states: 5,628,049,414 (9)
abstracting: (1<=p4)
states: 44,547,898,250 (10)
abstracting: (p246<=p156)
states: 153,282,838,589 (11)
.
EG iterations: 1
abstracting: (p151<=p108)
states: 152,326,042,152 (11)
abstracting: (p246<=p156)
states: 153,282,838,589 (11)
.
EG iterations: 1
abstracting: (p246<=p156)
states: 153,282,838,589 (11)
.
EG iterations: 1
..........
before gc: list nodes free: 8865846

after gc: idd nodes used:1335102, unused:62664898; list nodes free:289739329
.MC time: 2m28.012sec

checking: EF [EX [~ [AF [E [p90<=0 U 1<=p117]]]]]
normalized: E [true U EX [EG [~ [E [p90<=0 U 1<=p117]]]]]

abstracting: (1<=p117)
states: 5,885,373,244 (9)
abstracting: (p90<=0)
states: 150,151,483,204 (11)
.................
before gc: list nodes free: 5810013

after gc: idd nodes used:1662129, unused:62337871; list nodes free:288282506
....................................
before gc: list nodes free: 1653294

after gc: idd nodes used:975785, unused:63024215; list nodes free:291380084
.............
EG iterations: 66
.-> the formula is TRUE

FORMULA AutonomousCar-PT-05b-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393932 kB
MemFree: 6154508 kB
After kill :
MemTotal: 16393932 kB
MemFree: 16180940 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.002sec

74833 91003 81385 80072 93773
iterations count:581729 (1187), effective:20142 (41)

initing FirstDep: 0m 0.002sec


iterations count:82061 (167), effective:3255 (6)

iterations count:48793 (99), effective:952 (1)

net_ddint.h:600: Timeout: after 235 sec

103880
iterations count:156142 (318), effective:5913 (12)

net_ddint.h:600: Timeout: after 232 sec


sat_reach.icc:155: Timeout: after 215 sec


iterations count:534 (1), effective:16 (0)

iterations count:82061 (167), effective:3255 (6)

iterations count:7378 (15), effective:151 (0)

net_ddint.h:600: Timeout: after 210 sec


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

iterations count:490 (1), effective:0 (0)
91446
iterations count:113992 (232), effective:5142 (10)
85867
iterations count:114744 (234), effective:5346 (10)

iterations count:95920 (195), effective:3649 (7)

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

net_ddint.h:600: Timeout: after 219 sec


net_ddint.h:600: Timeout: after 197 sec


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

iterations count:91732 (187), effective:3314 (6)

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

iterations count:59311 (121), effective:1371 (2)

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

iterations count:91732 (187), effective:3314 (6)

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

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

iterations count:91732 (187), effective:3314 (6)

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

net_ddint.h:600: Timeout: after 186 sec


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

net_ddint.h:600: Timeout: after 165 sec


iterations count:81545 (166), effective:2439 (4)

iterations count:46034 (93), effective:976 (1)

net_ddint.h:600: Timeout: after 147 sec


iterations count:48793 (99), effective:952 (1)

iterations count:41271 (84), effective:1030 (2)

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="AutonomousCar-PT-05b"
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 AutonomousCar-PT-05b, 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 r001-oct2-167813588900601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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