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

About the Execution of Marcie+red for DLCround-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5457.279 10553.00 14791.00 345.20 TTFTTFTFTTFTTFFT 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.r106-tall-167814483000638.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 marciexred
Input is DLCround-PT-04a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483000638
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 704K
-rw-r--r-- 1 mcc users 8.2K Feb 25 18:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 18:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 18:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 18:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 18:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 18:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:52 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 200K 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 DLCround-PT-04a-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-04a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678448673997

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DLCround-PT-04a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 11:44:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 11:44:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 11:44:35] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-10 11:44:35] [INFO ] Transformed 139 places.
[2023-03-10 11:44:35] [INFO ] Transformed 823 transitions.
[2023-03-10 11:44:35] [INFO ] Found NUPN structural information;
[2023-03-10 11:44:35] [INFO ] Parsed PT model containing 139 places and 823 transitions and 3074 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 91 transitions
Reduce redundant transitions removed 91 transitions.
FORMULA DLCround-PT-04a-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-04a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 10) seen :1
FORMULA DLCround-PT-04a-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-10 11:44:36] [INFO ] Flow matrix only has 122 transitions (discarded 610 similar events)
// Phase 1: matrix 122 rows 139 cols
[2023-03-10 11:44:36] [INFO ] Computed 69 place invariants in 15 ms
[2023-03-10 11:44:36] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-10 11:44:37] [INFO ] [Nat]Absence check using 69 positive place invariants in 28 ms returned sat
[2023-03-10 11:44:37] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
FORMULA DLCround-PT-04a-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04a-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04a-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04a-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04a-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04a-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04a-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-04a-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1644 ms.
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//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DLCround_PT_04a
(NrP: 139 NrTr: 823 NrArc: 3074)

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

net check time: 0m 0.000sec

init dd package: 0m 2.749sec


RS generation: 0m 0.670sec


-> reachability set: #nodes 11497 (1.1e+04) #states 240,100,001 (8)



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

checking: EF [~ [p84<=1]]
normalized: E [true U ~ [p84<=1]]

abstracting: (p84<=1)
states: 240,100,001 (8)
-> the formula is FALSE

FORMULA DLCround-PT-04a-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p121<=1)
states: 240,100,001 (8)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (p66<=1)
states: 240,100,001 (8)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [p138<=p106] | p10<=p87]]
normalized: ~ [E [true U ~ [[~ [p138<=p106] | p10<=p87]]]]

abstracting: (p10<=p87)
states: 240,100,001 (8)
abstracting: (p138<=p106)
states: 240,100,001 (8)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[1<=p2 | [1<=p130 | [[~ [[1<=p70 | ~ [1<=p48]]] & p124<=0] | [p48<=p87 & p76<=p82]]]]]
normalized: ~ [E [true U ~ [[1<=p2 | [1<=p130 | [[p48<=p87 & p76<=p82] | [~ [[~ [1<=p48] | 1<=p70]] & p124<=0]]]]]]]

abstracting: (p124<=0)
states: 1
abstracting: (1<=p70)
states: 24,010,000 (7)
abstracting: (1<=p48)
states: 24,010,000 (7)
abstracting: (p76<=p82)
states: 240,100,001 (8)
abstracting: (p48<=p87)
states: 240,100,001 (8)
abstracting: (1<=p130)
states: 240,100,000 (8)
abstracting: (1<=p2)
states: 34,300,000 (7)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.027sec

checking: EF [[[[~ [1<=p1] & ~ [p100<=0]] & [[1<=p128 & ~ [p48<=0]] & ~ [[1<=p96 | [p80<=p17 | p92<=1]]]]] & [1<=p115 | 1<=p58]]]
normalized: E [true U [[1<=p115 | 1<=p58] & [[~ [[1<=p96 | [p80<=p17 | p92<=1]]] & [1<=p128 & ~ [p48<=0]]] & [~ [p100<=0] & ~ [1<=p1]]]]]

abstracting: (1<=p1)
states: 34,300,000 (7)
abstracting: (p100<=0)
states: 1
abstracting: (p48<=0)
states: 216,090,001 (8)
abstracting: (1<=p128)
states: 240,100,000 (8)
abstracting: (p92<=1)
states: 240,100,001 (8)
abstracting: (p80<=p17)
states: 34,300,001 (7)
abstracting: (1<=p96)
states: 240,100,000 (8)
abstracting: (1<=p58)
states: 24,010,000 (7)
abstracting: (1<=p115)
states: 240,100,000 (8)
-> the formula is FALSE

FORMULA DLCround-PT-04a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.037sec

checking: EF [~ [[[[1<=p0 & p69<=p6] | 1<=p2] | ~ [[[~ [p118<=p111] & p1<=p110] & [[[[p56<=0 | p112<=1] | 1<=p54] | 1<=p95] & [~ [[p39<=p50 | 1<=p69]] & ~ [1<=p23]]]]]]]]
normalized: E [true U ~ [[~ [[[[~ [1<=p23] & ~ [[p39<=p50 | 1<=p69]]] & [1<=p95 | [1<=p54 | [p56<=0 | p112<=1]]]] & [p1<=p110 & ~ [p118<=p111]]]] | [1<=p2 | [1<=p0 & p69<=p6]]]]]

abstracting: (p69<=p6)
states: 219,520,001 (8)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p2)
states: 34,300,000 (7)
abstracting: (p118<=p111)
states: 240,100,001 (8)
abstracting: (p1<=p110)
states: 240,100,001 (8)
abstracting: (p112<=1)
states: 240,100,001 (8)
abstracting: (p56<=0)
states: 216,090,001 (8)
abstracting: (1<=p54)
states: 24,010,000 (7)
abstracting: (1<=p95)
states: 240,100,000 (8)
abstracting: (1<=p69)
states: 24,010,000 (7)
abstracting: (p39<=p50)
states: 218,491,001 (8)
abstracting: (1<=p23)
states: 34,300,000 (7)
-> the formula is FALSE

FORMULA DLCround-PT-04a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: AG [[1<=p118 | [[[p44<=p137 & ~ [[~ [[p6<=p136 & p137<=p74]] & p116<=p137]]] & [[[p12<=1 & 1<=p15] | ~ [1<=p43]] | ~ [[p102<=p4 & p4<=p79]]]] | 1<=p98]]]
normalized: ~ [E [true U ~ [[1<=p118 | [1<=p98 | [[~ [[p102<=p4 & p4<=p79]] | [~ [1<=p43] | [p12<=1 & 1<=p15]]] & [p44<=p137 & ~ [[p116<=p137 & ~ [[p6<=p136 & p137<=p74]]]]]]]]]]]

abstracting: (p137<=p74)
states: 24,010,001 (7)
abstracting: (p6<=p136)
states: 240,100,001 (8)
abstracting: (p116<=p137)
states: 240,100,001 (8)
abstracting: (p44<=p137)
states: 240,100,001 (8)
abstracting: (1<=p15)
states: 34,300,000 (7)
abstracting: (p12<=1)
states: 240,100,001 (8)
abstracting: (1<=p43)
states: 24,010,000 (7)
abstracting: (p4<=p79)
states: 240,100,001 (8)
abstracting: (p102<=p4)
states: 34,300,001 (7)
abstracting: (1<=p98)
states: 240,100,000 (8)
abstracting: (1<=p118)
states: 240,100,000 (8)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EF [~ [[p58<=1 | [p91<=p31 | [[~ [[[p91<=1 | [p100<=p107 | p119<=1]] & p77<=0]] | [1<=p63 | p85<=p20]] | [[1<=p106 & 1<=p82] & [[1<=p123 | [p67<=p35 | p11<=0]] | 1<=p16]]]]]]]
normalized: E [true U ~ [[p58<=1 | [p91<=p31 | [[[1<=p16 | [1<=p123 | [p67<=p35 | p11<=0]]] & [1<=p106 & 1<=p82]] | [[1<=p63 | p85<=p20] | ~ [[p77<=0 & [p91<=1 | [p100<=p107 | p119<=1]]]]]]]]]]

abstracting: (p119<=1)
states: 240,100,001 (8)
abstracting: (p100<=p107)
states: 240,100,001 (8)
abstracting: (p91<=1)
states: 240,100,001 (8)
abstracting: (p77<=0)
states: 216,090,001 (8)
abstracting: (p85<=p20)
states: 34,300,001 (7)
abstracting: (1<=p63)
states: 24,010,000 (7)
abstracting: (1<=p82)
states: 240,100,000 (8)
abstracting: (1<=p106)
states: 240,100,000 (8)
abstracting: (p11<=0)
states: 205,800,001 (8)
abstracting: (p67<=p35)
states: 218,491,001 (8)
abstracting: (1<=p123)
states: 240,100,000 (8)
abstracting: (1<=p16)
states: 34,300,000 (7)
abstracting: (p91<=p31)
states: 24,010,001 (7)
abstracting: (p58<=1)
states: 240,100,001 (8)
-> the formula is FALSE

FORMULA DLCround-PT-04a-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.024sec

checking: AG [~ [[p27<=p2 & ~ [[[~ [[~ [p20<=p118] & p111<=1]] & [[[p73<=p1 | 1<=p137] & p87<=1] | ~ [1<=p92]]] | [[p112<=p66 & [~ [p67<=1] | [p117<=p52 | 1<=p85]]] & [~ [[p79<=p24 | p35<=p84]] | ~ [1<=p73]]]]]]]]
normalized: ~ [E [true U [p27<=p2 & ~ [[[[~ [1<=p73] | ~ [[p79<=p24 | p35<=p84]]] & [p112<=p66 & [[p117<=p52 | 1<=p85] | ~ [p67<=1]]]] | [[~ [1<=p92] | [p87<=1 & [p73<=p1 | 1<=p137]]] & ~ [[p111<=1 & ~ [p20<=p118]]]]]]]]]

abstracting: (p20<=p118)
states: 240,100,001 (8)
abstracting: (p111<=1)
states: 240,100,001 (8)
abstracting: (1<=p137)
states: 240,100,000 (8)
abstracting: (p73<=p1)
states: 219,520,001 (8)
abstracting: (p87<=1)
states: 240,100,001 (8)
abstracting: (1<=p92)
states: 240,100,000 (8)
abstracting: (p67<=1)
states: 240,100,001 (8)
abstracting: (1<=p85)
states: 240,100,000 (8)
abstracting: (p117<=p52)
states: 24,010,001 (7)
abstracting: (p112<=p66)
states: 24,010,001 (7)
abstracting: (p35<=p84)
states: 240,100,001 (8)
abstracting: (p79<=p24)
states: 34,300,001 (7)
abstracting: (1<=p73)
states: 24,010,000 (7)
abstracting: (p27<=p2)
states: 210,700,001 (8)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: AG [[~ [[~ [[p70<=p12 & [[[1<=p80 | [p129<=p85 | p19<=0]] | [[1<=p117 | 1<=p118] & p129<=0]] | [1<=p52 & ~ [1<=p38]]]]] & [[p33<=1 | 1<=p93] | [[p28<=p33 | p60<=0] | [[~ [1<=p91] | [p81<=0 & ~ [1<=p67]]] & [~ [p86<=p26] & p83<=p79]]]]]] | p23<=0]]
normalized: ~ [E [true U ~ [[p23<=0 | ~ [[[[[[p83<=p79 & ~ [p86<=p26]] & [[p81<=0 & ~ [1<=p67]] | ~ [1<=p91]]] | [p28<=p33 | p60<=0]] | [p33<=1 | 1<=p93]] & ~ [[p70<=p12 & [[1<=p52 & ~ [1<=p38]] | [[p129<=0 & [1<=p117 | 1<=p118]] | [1<=p80 | [p129<=p85 | p19<=0]]]]]]]]]]]]

abstracting: (p19<=0)
states: 205,800,001 (8)
abstracting: (p129<=p85)
states: 240,100,001 (8)
abstracting: (1<=p80)
states: 240,100,000 (8)
abstracting: (1<=p118)
states: 240,100,000 (8)
abstracting: (1<=p117)
states: 240,100,000 (8)
abstracting: (p129<=0)
states: 1
abstracting: (1<=p38)
states: 24,010,000 (7)
abstracting: (1<=p52)
states: 24,010,000 (7)
abstracting: (p70<=p12)
states: 219,520,001 (8)
abstracting: (1<=p93)
states: 240,100,000 (8)
abstracting: (p33<=1)
states: 240,100,001 (8)
abstracting: (p60<=0)
states: 216,090,001 (8)
abstracting: (p28<=p33)
states: 209,230,001 (8)
abstracting: (1<=p91)
states: 240,100,000 (8)
abstracting: (1<=p67)
states: 24,010,000 (7)
abstracting: (p81<=0)
states: 1
abstracting: (p86<=p26)
states: 34,300,001 (7)
abstracting: (p83<=p79)
states: 240,100,001 (8)
abstracting: (p23<=0)
states: 205,800,001 (8)
-> the formula is FALSE

FORMULA DLCround-PT-04a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.723sec

checking: AG [[[p4<=p113 | [~ [1<=p43] | [p11<=1 & ~ [p87<=1]]]] | [[~ [1<=p80] & [[[~ [[p17<=1 & 1<=p94]] & [[p102<=p21 | ~ [1<=p34]] | [[p2<=p58 | 1<=p76] | ~ [1<=p106]]]] | 1<=p74] & ~ [[1<=p20 & [[~ [p4<=p134] & [1<=p11 & p46<=p10]] & ~ [p10<=0]]]]]] & [p50<=1 & [[p52<=1 & ~ [p29<=p136]] & [[[~ [p95<=1] & p4<=1] | p38<=1] | p8<=1]]]]]]
normalized: ~ [E [true U ~ [[[[p50<=1 & [[p8<=1 | [p38<=1 | [p4<=1 & ~ [p95<=1]]]] & [p52<=1 & ~ [p29<=p136]]]] & [[~ [[1<=p20 & [~ [p10<=0] & [[1<=p11 & p46<=p10] & ~ [p4<=p134]]]]] & [1<=p74 | [[[~ [1<=p106] | [p2<=p58 | 1<=p76]] | [p102<=p21 | ~ [1<=p34]]] & ~ [[p17<=1 & 1<=p94]]]]] & ~ [1<=p80]]] | [p4<=p113 | [[p11<=1 & ~ [p87<=1]] | ~ [1<=p43]]]]]]]

abstracting: (1<=p43)
states: 24,010,000 (7)
abstracting: (p87<=1)
states: 240,100,001 (8)
abstracting: (p11<=1)
states: 240,100,001 (8)
abstracting: (p4<=p113)
states: 240,100,001 (8)
abstracting: (1<=p80)
states: 240,100,000 (8)
abstracting: (1<=p94)
states: 240,100,000 (8)
abstracting: (p17<=1)
states: 240,100,001 (8)
abstracting: (1<=p34)
states: 24,010,000 (7)
abstracting: (p102<=p21)
states: 34,300,001 (7)
abstracting: (1<=p76)
states: 24,010,000 (7)
abstracting: (p2<=p58)
states: 209,230,001 (8)
abstracting: (1<=p106)
states: 240,100,000 (8)
abstracting: (1<=p74)
states: 24,010,000 (7)
abstracting: (p4<=p134)
states: 240,100,001 (8)
abstracting: (p46<=p10)
states: 219,520,001 (8)
abstracting: (1<=p11)
states: 34,300,000 (7)
abstracting: (p10<=0)
states: 205,800,001 (8)
abstracting: (1<=p20)
states: 34,300,000 (7)
abstracting: (p29<=p136)
states: 240,100,001 (8)
abstracting: (p52<=1)
states: 240,100,001 (8)
abstracting: (p95<=1)
states: 240,100,001 (8)
abstracting: (p4<=1)
states: 240,100,001 (8)
abstracting: (p38<=1)
states: 240,100,001 (8)
abstracting: (p8<=1)
states: 240,100,001 (8)
abstracting: (p50<=1)
states: 240,100,001 (8)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: AG [[p41<=p105 & ~ [[[~ [[[~ [[p110<=p18 | 1<=p3]] & ~ [[1<=p123 | p14<=p126]]] | [p127<=p131 & p51<=1]]] & [[[~ [[1<=p134 | 1<=p4]] | [[p102<=p73 & p39<=0] & [p109<=1 | p88<=0]]] & [~ [p82<=p67] & [1<=p77 | [1<=p118 & p72<=p102]]]] & 1<=p89]] | [[~ [p54<=p32] | [[[[1<=p14 & p33<=p32] & 1<=p113] | ~ [[p50<=1 & 1<=p119]]] | p44<=0]] & [~ [[~ [1<=p132] | [1<=p44 | p72<=p100]]] | [~ [p123<=p106] & p57<=1]]]]]]]
normalized: ~ [E [true U ~ [[p41<=p105 & ~ [[[[[p57<=1 & ~ [p123<=p106]] | ~ [[[1<=p44 | p72<=p100] | ~ [1<=p132]]]] & [[p44<=0 | [~ [[p50<=1 & 1<=p119]] | [1<=p113 & [1<=p14 & p33<=p32]]]] | ~ [p54<=p32]]] | [[1<=p89 & [[[1<=p77 | [1<=p118 & p72<=p102]] & ~ [p82<=p67]] & [[[p109<=1 | p88<=0] & [p102<=p73 & p39<=0]] | ~ [[1<=p134 | 1<=p4]]]]] & ~ [[[p127<=p131 & p51<=1] | [~ [[1<=p123 | p14<=p126]] & ~ [[p110<=p18 | 1<=p3]]]]]]]]]]]]

abstracting: (1<=p3)
states: 34,300,000 (7)
abstracting: (p110<=p18)
states: 34,300,001 (7)
abstracting: (p14<=p126)
states: 240,100,001 (8)
abstracting: (1<=p123)
states: 240,100,000 (8)
abstracting: (p51<=1)
states: 240,100,001 (8)
abstracting: (p127<=p131)
states: 240,100,001 (8)
abstracting: (1<=p4)
states: 34,300,000 (7)
abstracting: (1<=p134)
states: 240,100,000 (8)
abstracting: (p39<=0)
states: 216,090,001 (8)
abstracting: (p102<=p73)
states: 24,010,001 (7)
abstracting: (p88<=0)
states: 1
abstracting: (p109<=1)
states: 240,100,001 (8)
abstracting: (p82<=p67)
states: 24,010,001 (7)
abstracting: (p72<=p102)
states: 240,100,001 (8)
abstracting: (1<=p118)
states: 240,100,000 (8)
abstracting: (1<=p77)
states: 24,010,000 (7)
abstracting: (1<=p89)
states: 240,100,000 (8)
abstracting: (p54<=p32)
states: 218,491,001 (8)
abstracting: (p33<=p32)
states: 216,090,001 (8)
abstracting: (1<=p14)
states: 34,300,000 (7)
abstracting: (1<=p113)
states: 240,100,000 (8)
abstracting: (1<=p119)
states: 240,100,000 (8)
abstracting: (p50<=1)
states: 240,100,001 (8)
abstracting: (p44<=0)
states: 216,090,001 (8)
abstracting: (1<=p132)
states: 240,100,000 (8)
abstracting: (p72<=p100)
states: 240,100,001 (8)
abstracting: (1<=p44)
states: 24,010,000 (7)
abstracting: (p123<=p106)
states: 240,100,001 (8)
abstracting: (p57<=1)
states: 240,100,001 (8)
abstracting: (p41<=p105)
states: 240,100,001 (8)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: AG [[[[[~ [[1<=p12 | [[[p38<=p74 & p10<=1] & p99<=1] | 1<=p93]]] & [[p13<=1 & [[[p35<=p73 & p29<=p36] | [p77<=p87 | p65<=1]] & p97<=1]] & ~ [[[1<=p128 | ~ [p89<=p90]] | [1<=p77 & ~ [p78<=p129]]]]]] | ~ [1<=p138]] & ~ [[[p78<=p100 & [~ [p115<=p0] & ~ [[p16<=p25 | p101<=p97]]]] | [~ [p43<=p21] & [~ [[p29<=p5 | p41<=1]] | [p44<=p115 | [p77<=p39 & 1<=p60]]]]]]] | [p105<=0 | p19<=p129]]]
normalized: ~ [E [true U ~ [[[p105<=0 | p19<=p129] | [~ [[[[[p44<=p115 | [p77<=p39 & 1<=p60]] | ~ [[p29<=p5 | p41<=1]]] & ~ [p43<=p21]] | [p78<=p100 & [~ [[p16<=p25 | p101<=p97]] & ~ [p115<=p0]]]]] & [~ [1<=p138] | [[~ [[[1<=p77 & ~ [p78<=p129]] | [1<=p128 | ~ [p89<=p90]]]] & [p13<=1 & [p97<=1 & [[p77<=p87 | p65<=1] | [p35<=p73 & p29<=p36]]]]] & ~ [[1<=p12 | [1<=p93 | [p99<=1 & [p38<=p74 & p10<=1]]]]]]]]]]]]

abstracting: (p10<=1)
states: 240,100,001 (8)
abstracting: (p38<=p74)
states: 218,491,001 (8)
abstracting: (p99<=1)
states: 240,100,001 (8)
abstracting: (1<=p93)
states: 240,100,000 (8)
abstracting: (1<=p12)
states: 34,300,000 (7)
abstracting: (p29<=p36)
states: 216,090,001 (8)
abstracting: (p35<=p73)
states: 218,491,001 (8)
abstracting: (p65<=1)
states: 240,100,001 (8)
abstracting: (p77<=p87)
states: 240,100,001 (8)
abstracting: (p97<=1)
states: 240,100,001 (8)
abstracting: (p13<=1)
states: 240,100,001 (8)
abstracting: (p89<=p90)
states: 240,100,001 (8)
abstracting: (1<=p128)
states: 240,100,000 (8)
abstracting: (p78<=p129)
states: 240,100,001 (8)
abstracting: (1<=p77)
states: 24,010,000 (7)
abstracting: (1<=p138)
states: 240,100,000 (8)
abstracting: (p115<=p0)
states: 1
abstracting: (p101<=p97)
states: 240,100,001 (8)
abstracting: (p16<=p25)
states: 210,700,001 (8)
abstracting: (p78<=p100)
states: 240,100,001 (8)
abstracting: (p43<=p21)
states: 219,520,001 (8)
abstracting: (p41<=1)
states: 240,100,001 (8)
abstracting: (p29<=p5)
states: 219,520,001 (8)
abstracting: (1<=p60)
states: 24,010,000 (7)
abstracting: (p77<=p39)
states: 218,491,001 (8)
abstracting: (p44<=p115)
states: 240,100,001 (8)
abstracting: (p19<=p129)
states: 240,100,001 (8)
abstracting: (p105<=0)
states: 1
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.059sec

checking: EF [[~ [[~ [1<=p132] & [[~ [1<=p50] & ~ [[~ [[1<=p83 | 1<=p74]] | [p91<=0 | [p83<=p118 | 1<=p97]]]]] | ~ [1<=p116]]]] & [[[p58<=p59 & [[[[~ [1<=p39] | ~ [p58<=p15]] & [~ [p24<=1] | [p29<=p43 | p24<=p65]]] & ~ [[1<=p126 | p75<=0]]] | [[[[1<=p116 | p88<=p131] | [1<=p104 | p125<=0]] & [p2<=1 & [p110<=1 & p22<=p79]]] & [~ [1<=p95] | ~ [[p43<=p37 | p32<=1]]]]]] & 1<=p30] & [[1<=p121 & 1<=p138] | [[[[[[p76<=p5 & p42<=0] & p36<=p42] & p34<=p1] & [p4<=p6 | p62<=p79]] & ~ [[p28<=0 | [1<=p30 | p135<=p80]]]] | ~ [1<=p77]]]]]]
normalized: E [true U [[[[~ [1<=p77] | [~ [[p28<=0 | [1<=p30 | p135<=p80]]] & [[p4<=p6 | p62<=p79] & [p34<=p1 & [p36<=p42 & [p76<=p5 & p42<=0]]]]]] | [1<=p121 & 1<=p138]] & [1<=p30 & [p58<=p59 & [[[~ [[p43<=p37 | p32<=1]] | ~ [1<=p95]] & [[p2<=1 & [p110<=1 & p22<=p79]] & [[1<=p104 | p125<=0] | [1<=p116 | p88<=p131]]]] | [~ [[1<=p126 | p75<=0]] & [[[p29<=p43 | p24<=p65] | ~ [p24<=1]] & [~ [p58<=p15] | ~ [1<=p39]]]]]]]] & ~ [[[~ [1<=p116] | [~ [[[p91<=0 | [p83<=p118 | 1<=p97]] | ~ [[1<=p83 | 1<=p74]]]] & ~ [1<=p50]]] & ~ [1<=p132]]]]]

abstracting: (1<=p132)
states: 240,100,000 (8)
abstracting: (1<=p50)
states: 24,010,000 (7)
abstracting: (1<=p74)
states: 24,010,000 (7)
abstracting: (1<=p83)
states: 240,100,000 (8)
abstracting: (1<=p97)
states: 240,100,000 (8)
abstracting: (p83<=p118)
states: 240,100,001 (8)
abstracting: (p91<=0)
states: 1
abstracting: (1<=p116)
states: 240,100,000 (8)
abstracting: (1<=p39)
states: 24,010,000 (7)
abstracting: (p58<=p15)
states: 219,520,001 (8)
abstracting: (p24<=1)
states: 240,100,001 (8)
abstracting: (p24<=p65)
states: 209,230,001 (8)
abstracting: (p29<=p43)
states: 218,491,001 (8)
abstracting: (p75<=0)
states: 216,090,001 (8)
abstracting: (1<=p126)
states: 240,100,000 (8)
abstracting: (p88<=p131)
states: 240,100,001 (8)
abstracting: (1<=p116)
states: 240,100,000 (8)
abstracting: (p125<=0)
states: 1
abstracting: (1<=p104)
states: 240,100,000 (8)
abstracting: (p22<=p79)
states: 240,100,001 (8)
abstracting: (p110<=1)
states: 240,100,001 (8)
abstracting: (p2<=1)
states: 240,100,001 (8)
abstracting: (1<=p95)
states: 240,100,000 (8)
abstracting: (p32<=1)
states: 240,100,001 (8)
abstracting: (p43<=p37)
states: 218,491,001 (8)
abstracting: (p58<=p59)
states: 218,491,001 (8)
abstracting: (1<=p30)
states: 24,010,000 (7)
abstracting: (1<=p138)
states: 240,100,000 (8)
abstracting: (1<=p121)
states: 240,100,000 (8)
abstracting: (p42<=0)
states: 216,090,001 (8)
abstracting: (p76<=p5)
states: 219,520,001 (8)
abstracting: (p36<=p42)
states: 218,491,001 (8)
abstracting: (p34<=p1)
states: 219,520,001 (8)
abstracting: (p62<=p79)
states: 240,100,001 (8)
abstracting: (p4<=p6)
states: 205,800,001 (8)
abstracting: (p135<=p80)
states: 240,100,001 (8)
abstracting: (1<=p30)
states: 24,010,000 (7)
abstracting: (p28<=0)
states: 205,800,001 (8)
abstracting: (1<=p77)
states: 24,010,000 (7)
-> the formula is FALSE

FORMULA DLCround-PT-04a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.068sec

checking: AG [[[[[[~ [[[[p34<=1 & p86<=0] | [p20<=0 | p41<=0]] & [[p38<=p49 | p127<=1] | [p22<=p11 & p113<=p82]]]] | ~ [[~ [p28<=p26] | [~ [p133<=1] | p39<=0]]]] | [[p80<=0 | 1<=p23] | [[~ [[1<=p6 | p50<=p112]] & 1<=p45] | [p44<=p68 & [[1<=p103 & 1<=p11] & [p22<=1 | 1<=p24]]]]]] | [~ [p8<=p25] | p56<=p137]] | [~ [p26<=0] & [[[[1<=p98 | [1<=p93 & [1<=p80 & p91<=p106]]] | [[[p138<=p126 & p43<=p78] & [p122<=p23 | 1<=p106]] | [[p48<=0 & p23<=0] | [p99<=p51 & p4<=1]]]] | [p66<=p25 | [~ [[p136<=0 & p90<=p106]] & [p123<=1 | [p16<=1 & p39<=1]]]]] & p9<=p23]]] | p0<=1]]
normalized: ~ [E [true U ~ [[p0<=1 | [[[p9<=p23 & [[p66<=p25 | [[p123<=1 | [p16<=1 & p39<=1]] & ~ [[p136<=0 & p90<=p106]]]] | [[[[p99<=p51 & p4<=1] | [p48<=0 & p23<=0]] | [[p122<=p23 | 1<=p106] & [p138<=p126 & p43<=p78]]] | [1<=p98 | [1<=p93 & [1<=p80 & p91<=p106]]]]]] & ~ [p26<=0]] | [[p56<=p137 | ~ [p8<=p25]] | [[[[p44<=p68 & [[p22<=1 | 1<=p24] & [1<=p103 & 1<=p11]]] | [1<=p45 & ~ [[1<=p6 | p50<=p112]]]] | [p80<=0 | 1<=p23]] | [~ [[[p39<=0 | ~ [p133<=1]] | ~ [p28<=p26]]] | ~ [[[[p22<=p11 & p113<=p82] | [p38<=p49 | p127<=1]] & [[p20<=0 | p41<=0] | [p34<=1 & p86<=0]]]]]]]]]]]]

abstracting: (p86<=0)
states: 1
abstracting: (p34<=1)
states: 240,100,001 (8)
abstracting: (p41<=0)
states: 216,090,001 (8)
abstracting: (p20<=0)
states: 205,800,001 (8)
abstracting: (p127<=1)
states: 240,100,001 (8)
abstracting: (p38<=p49)
states: 218,491,001 (8)
abstracting: (p113<=p82)
states: 240,100,001 (8)
abstracting: (p22<=p11)
states: 210,700,001 (8)
abstracting: (p28<=p26)
states: 205,800,001 (8)
abstracting: (p133<=1)
states: 240,100,001 (8)
abstracting: (p39<=0)
states: 216,090,001 (8)
abstracting: (1<=p23)
states: 34,300,000 (7)
abstracting: (p80<=0)
states: 1
abstracting: (p50<=p112)
states: 240,100,001 (8)
abstracting: (1<=p6)
states: 34,300,000 (7)
abstracting: (1<=p45)
states: 24,010,000 (7)
abstracting: (1<=p11)
states: 34,300,000 (7)
abstracting: (1<=p103)
states: 240,100,000 (8)
abstracting: (1<=p24)
states: 34,300,000 (7)
abstracting: (p22<=1)
states: 240,100,001 (8)
abstracting: (p44<=p68)
states: 218,491,001 (8)
abstracting: (p8<=p25)
states: 210,700,001 (8)
abstracting: (p56<=p137)
states: 240,100,001 (8)
abstracting: (p26<=0)
states: 205,800,001 (8)
abstracting: (p91<=p106)
states: 240,100,001 (8)
abstracting: (1<=p80)
states: 240,100,000 (8)
abstracting: (1<=p93)
states: 240,100,000 (8)
abstracting: (1<=p98)
states: 240,100,000 (8)
abstracting: (p43<=p78)
states: 218,491,001 (8)
abstracting: (p138<=p126)
states: 240,100,001 (8)
abstracting: (1<=p106)
states: 240,100,000 (8)
abstracting: (p122<=p23)
states: 34,300,001 (7)
abstracting: (p23<=0)
states: 205,800,001 (8)
abstracting: (p48<=0)
states: 216,090,001 (8)
abstracting: (p4<=1)
states: 240,100,001 (8)
abstracting: (p99<=p51)
states: 24,010,001 (7)
abstracting: (p90<=p106)
states: 240,100,001 (8)
abstracting: (p136<=0)
states: 1
abstracting: (p39<=1)
states: 240,100,001 (8)
abstracting: (p16<=1)
states: 240,100,001 (8)
abstracting: (p123<=1)
states: 240,100,001 (8)
abstracting: (p66<=p25)
states: 219,520,001 (8)
abstracting: (p9<=p23)
states: 210,700,001 (8)
abstracting: (p0<=1)
states: 240,100,001 (8)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.086sec

totally nodes used: 275949 (2.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1074030 5527920 6601950
used/not used/entry size/cache size: 5167127 61941737 16 1024MB
basic ops cache: hits/miss/sum: 279550 1246582 1526132
used/not used/entry size/cache size: 1705923 15071293 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: 49812 196791 246603
used/not used/entry size/cache size: 195372 8193236 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 66836075
1 269715
2 2991
3 80
4 3
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.342sec


BK_STOP 1678448684550

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
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


iterations count:17669 (21), effective:70 (0)

initing FirstDep: 0m 0.002sec


iterations count:6467 (7), effective:17 (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="DLCround-PT-04a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is DLCround-PT-04a, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-tall-167814483000638"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-04a.tgz
mv DLCround-PT-04a execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;