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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7015.735 2633968.00 2655260.00 8610.20 TFFTTTTTFFFTFFFT 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-167814483100734.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-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-tall-167814483100734
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.3K Feb 25 19:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 19:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 19:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 19:16 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.7K Feb 25 15:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 20:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 20:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 20:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 20:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:53 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 660K 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-10a-ReachabilityCardinality-00
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-01
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-02
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-03
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-04
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-05
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-06
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-07
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-08
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-09
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-10
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-11
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-12
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-13
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-14
FORMULA_NAME DLCround-PT-10a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678462737261

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-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-10 15:38:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 15:38:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 15:38:59] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-10 15:38:59] [INFO ] Transformed 337 places.
[2023-03-10 15:38:59] [INFO ] Transformed 2605 transitions.
[2023-03-10 15:38:59] [INFO ] Found NUPN structural information;
[2023-03-10 15:38:59] [INFO ] Parsed PT model containing 337 places and 2605 transitions and 10130 arcs in 360 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 247 transitions
Reduce redundant transitions removed 247 transitions.
FORMULA DLCround-PT-10a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-10a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 394 ms. (steps per millisecond=25 ) properties (out of 10) seen :3
FORMULA DLCround-PT-10a-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10a-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DLCround-PT-10a-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) 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 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-10 15:38:59] [INFO ] Flow matrix only has 218 transitions (discarded 2140 similar events)
// Phase 1: matrix 218 rows 337 cols
[2023-03-10 15:38:59] [INFO ] Computed 213 place invariants in 23 ms
[2023-03-10 15:39:00] [INFO ] After 285ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-10 15:39:00] [INFO ] [Nat]Absence check using 213 positive place invariants in 37 ms returned sat
[2023-03-10 15:39:00] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :0
FORMULA DLCround-PT-10a-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-10a-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-10a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-10a-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-10a-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DLCround-PT-10a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1755 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_10a
(NrP: 337 NrTr: 2605 NrArc: 10130)

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

net check time: 0m 0.001sec

init dd package: 0m 2.686sec


RS generation: 8m36.884sec


-> reachability set: #nodes 925251 (9.3e+05) #states 240,100,000,000,001 (14)



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

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

abstracting: (p93<=1)
states: 240,100,000,000,001 (14)
-> the formula is FALSE

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

MC time: 0m 0.002sec

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

abstracting: (1<=p92)
states: 24,010,000,000,000 (13)
MC time: 3m26.027sec

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

abstracting: (p82<=0)
states: 216,090,000,000,001 (14)
MC time: 3m12.130sec

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

abstracting: (p221<=1)
states: 240,100,000,000,001 (14)
-> the formula is FALSE

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

MC time: 0m 0.015sec

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

abstracting: (p185<=1)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

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

MC time: 0m 0.003sec

checking: EF [~ [p99<=p163]]
normalized: E [true U ~ [p99<=p163]]

abstracting: (p99<=p163)
states: 240,100,000,000,001 (14)
-> the formula is FALSE

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

MC time: 0m 0.897sec

checking: AG [p122<=p302]
normalized: ~ [E [true U ~ [p122<=p302]]]

abstracting: (p122<=p302)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [~ [[~ [p164<=0] | ~ [1<=p192]]]]
normalized: E [true U ~ [[~ [1<=p192] | ~ [p164<=0]]]]

abstracting: (p164<=0)
states: 1
abstracting: (1<=p192)
states: 240,100,000,000,000 (14)
-> the formula is FALSE

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

MC time: 0m 0.573sec

checking: EF [~ [[~ [p204<=p298] | p35<=0]]]
normalized: E [true U ~ [[p35<=0 | ~ [p204<=p298]]]]

abstracting: (p204<=p298)
states: 240,100,000,000,001 (14)
abstracting: (p35<=0)
states: 216,090,000,000,001 (14)
MC time: 4m29.058sec

checking: AG [[[[[~ [p243<=0] & [[[~ [p150<=0] | [[p130<=1 & p286<=p7] & p334<=p86]] & 1<=p122] | [[1<=p114 | 1<=p279] & ~ [[[p62<=p166 | 1<=p278] & [1<=p24 & 1<=p41]]]]]] & 1<=p32] & ~ [p17<=p56]] | p157<=p218]]
normalized: ~ [E [true U ~ [[p157<=p218 | [~ [p17<=p56] & [1<=p32 & [[[~ [[[1<=p24 & 1<=p41] & [p62<=p166 | 1<=p278]]] & [1<=p114 | 1<=p279]] | [1<=p122 & [[p334<=p86 & [p130<=1 & p286<=p7]] | ~ [p150<=0]]]] & ~ [p243<=0]]]]]]]]

abstracting: (p243<=0)
states: 1
abstracting: (p150<=0)
states: 1
abstracting: (p286<=p7)
states: 34,300,000,000,001 (13)
abstracting: (p130<=1)
states: 240,100,000,000,001 (14)
abstracting: (p334<=p86)
states: 24,010,000,000,001 (13)
abstracting: (1<=p122)
states: 24,010,000,000,000 (13)
abstracting: (1<=p279)
states: 240,100,000,000,000 (14)
abstracting: (1<=p114)
states: 24,010,000,000,000 (13)
abstracting: (1<=p278)
states: 240,100,000,000,000 (14)
abstracting: (p62<=p166)
states: 240,100,000,000,001 (14)
abstracting: (1<=p41)
states: 24,010,000,000,000 (13)
abstracting: (1<=p24)
states: 34,300,000,000,000 (13)
abstracting: (1<=p32)
states: 24,010,000,000,000 (13)
abstracting: (p17<=p56)
states: 209,230,000,000,001 (14)
abstracting: (p157<=p218)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

FORMULA DLCround-PT-10a-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.865sec

checking: AG [[p311<=p227 & [[[~ [[~ [p39<=0] & ~ [1<=p1]]] & [~ [[[~ [1<=p189] & ~ [p86<=p86]] | [1<=p126 & ~ [1<=p15]]]] | ~ [[[[p326<=1 & p318<=p135] | [p56<=p179 & 1<=p192]] | ~ [[p273<=p211 & p319<=p261]]]]]] & p167<=1] | [p52<=1 | p113<=1]]]]
normalized: ~ [E [true U ~ [[p311<=p227 & [[p52<=1 | p113<=1] | [p167<=1 & [[~ [[~ [[p273<=p211 & p319<=p261]] | [[p56<=p179 & 1<=p192] | [p326<=1 & p318<=p135]]]] | ~ [[[1<=p126 & ~ [1<=p15]] | [~ [p86<=p86] & ~ [1<=p189]]]]] & ~ [[~ [1<=p1] & ~ [p39<=0]]]]]]]]]]

abstracting: (p39<=0)
states: 216,090,000,000,001 (14)
abstracting: (1<=p1)
states: 34,300,000,000,000 (13)
abstracting: (1<=p189)
states: 240,100,000,000,000 (14)
abstracting: (p86<=p86)
states: 240,100,000,000,001 (14)
abstracting: (1<=p15)
states: 34,300,000,000,000 (13)
abstracting: (1<=p126)
states: 24,010,000,000,000 (13)
abstracting: (p318<=p135)
states: 24,010,000,000,001 (13)
abstracting: (p326<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p192)
states: 240,100,000,000,000 (14)
abstracting: (p56<=p179)
states: 240,100,000,000,001 (14)
abstracting: (p319<=p261)
states: 240,100,000,000,001 (14)
abstracting: (p273<=p211)
states: 240,100,000,000,001 (14)
abstracting: (p167<=1)
states: 240,100,000,000,001 (14)
abstracting: (p113<=1)
states: 240,100,000,000,001 (14)
abstracting: (p52<=1)
states: 240,100,000,000,001 (14)
abstracting: (p311<=p227)
states: 240,100,000,000,001 (14)
-> the formula is TRUE

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

MC time: 0m 4.897sec

checking: EF [[[[[[[[p225<=p295 | [1<=p259 & [p120<=0 | p167<=p10]]] & [p110<=1 & [p167<=p118 | p143<=p99]]] & ~ [[[p316<=p59 | p88<=p127] & ~ [p292<=p205]]]] & [~ [[p336<=p192 | p255<=1]] | [~ [p205<=0] & ~ [[p40<=1 | p255<=0]]]]] | ~ [[~ [[p236<=1 & p299<=p269]] | ~ [[p289<=p209 & ~ [[p151<=p33 | p252<=p304]]]]]]] & p124<=p240] & 1<=p323]]
normalized: E [true U [1<=p323 & [p124<=p240 & [~ [[~ [[p289<=p209 & ~ [[p151<=p33 | p252<=p304]]]] | ~ [[p236<=1 & p299<=p269]]]] | [[[~ [[p40<=1 | p255<=0]] & ~ [p205<=0]] | ~ [[p336<=p192 | p255<=1]]] & [~ [[~ [p292<=p205] & [p316<=p59 | p88<=p127]]] & [[p110<=1 & [p167<=p118 | p143<=p99]] & [p225<=p295 | [1<=p259 & [p120<=0 | p167<=p10]]]]]]]]]]

abstracting: (p167<=p10)
states: 34,300,000,000,001 (13)
abstracting: (p120<=0)
states: 216,090,000,000,001 (14)
abstracting: (1<=p259)
states: 240,100,000,000,000 (14)
abstracting: (p225<=p295)
states: 240,100,000,000,001 (14)
abstracting: (p143<=p99)
states: 24,010,000,000,001 (13)
abstracting: (p167<=p118)
states: 24,010,000,000,001 (13)
abstracting: (p110<=1)
states: 240,100,000,000,001 (14)
abstracting: (p88<=p127)
states: 218,491,000,000,001 (14)
abstracting: (p316<=p59)
states: 24,010,000,000,001 (13)
abstracting: (p292<=p205)
states: 240,100,000,000,001 (14)
abstracting: (p255<=1)
states: 240,100,000,000,001 (14)
abstracting: (p336<=p192)
states: 240,100,000,000,001 (14)
abstracting: (p205<=0)
states: 1
abstracting: (p255<=0)
states: 1
abstracting: (p40<=1)
states: 240,100,000,000,001 (14)
abstracting: (p299<=p269)
states: 240,100,000,000,001 (14)
abstracting: (p236<=1)
states: 240,100,000,000,001 (14)
abstracting: (p252<=p304)
states: 240,100,000,000,001 (14)
abstracting: (p151<=p33)
states: 24,010,000,000,001 (13)
abstracting: (p289<=p209)
states: 240,100,000,000,001 (14)
abstracting: (p124<=p240)
states: 240,100,000,000,001 (14)
abstracting: (1<=p323)
states: 240,100,000,000,000 (14)
-> the formula is FALSE

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

MC time: 0m 4.908sec

checking: AG [[[[1<=p130 | [[[[[[p333<=p270 & 1<=p142] & p313<=1] & [~ [p237<=0] & [1<=p301 & p19<=0]]] & ~ [1<=p0]] | [~ [[1<=p42 | 1<=p151]] | p206<=1]] | [[[~ [[1<=p156 & p10<=1]] & [[1<=p11 & p280<=0] & [1<=p144 | p9<=p66]]] & p269<=p210] & ~ [[[[p169<=p206 | 1<=p282] & 1<=p275] & [1<=p216 | [1<=p277 | p105<=1]]]]]]] | [~ [[~ [[1<=p204 | p321<=p296]] & ~ [[~ [1<=p264] | ~ [1<=p172]]]]] & [~ [[[p249<=p29 | 1<=p78] & ~ [p137<=1]]] | p125<=0]]] | p52<=0]]
normalized: ~ [E [true U ~ [[p52<=0 | [[[p125<=0 | ~ [[~ [p137<=1] & [p249<=p29 | 1<=p78]]]] & ~ [[~ [[~ [1<=p172] | ~ [1<=p264]]] & ~ [[1<=p204 | p321<=p296]]]]] | [1<=p130 | [[~ [[[1<=p216 | [1<=p277 | p105<=1]] & [1<=p275 & [p169<=p206 | 1<=p282]]]] & [p269<=p210 & [[[1<=p144 | p9<=p66] & [1<=p11 & p280<=0]] & ~ [[1<=p156 & p10<=1]]]]] | [[p206<=1 | ~ [[1<=p42 | 1<=p151]]] | [~ [1<=p0] & [[[1<=p301 & p19<=0] & ~ [p237<=0]] & [p313<=1 & [p333<=p270 & 1<=p142]]]]]]]]]]]]

abstracting: (1<=p142)
states: 240,100,000,000,000 (14)
abstracting: (p333<=p270)
states: 240,100,000,000,001 (14)
abstracting: (p313<=1)
states: 240,100,000,000,001 (14)
abstracting: (p237<=0)
states: 1
abstracting: (p19<=0)
states: 205,800,000,000,001 (14)
abstracting: (1<=p301)
states: 240,100,000,000,000 (14)
abstracting: (1<=p0)
states: 1
abstracting: (1<=p151)
states: 240,100,000,000,000 (14)
abstracting: (1<=p42)
states: 24,010,000,000,000 (13)
abstracting: (p206<=1)
states: 240,100,000,000,001 (14)
abstracting: (p10<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p156)
states: 240,100,000,000,000 (14)
abstracting: (p280<=0)
states: 1
abstracting: (1<=p11)
states: 34,300,000,000,000 (13)
abstracting: (p9<=p66)
states: 209,230,000,000,001 (14)
abstracting: (1<=p144)
states: 240,100,000,000,000 (14)
abstracting: (p269<=p210)
states: 240,100,000,000,001 (14)
abstracting: (1<=p282)
states: 240,100,000,000,000 (14)
abstracting: (p169<=p206)
states: 240,100,000,000,001 (14)
abstracting: (1<=p275)
states: 240,100,000,000,000 (14)
abstracting: (p105<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p277)
states: 240,100,000,000,000 (14)
abstracting: (1<=p216)
states: 240,100,000,000,000 (14)
abstracting: (1<=p130)
states: 24,010,000,000,000 (13)
abstracting: (p321<=p296)
states: 240,100,000,000,001 (14)
abstracting: (1<=p204)
states: 240,100,000,000,000 (14)
abstracting: (1<=p264)
states: 240,100,000,000,000 (14)
abstracting: (1<=p172)
states: 240,100,000,000,000 (14)
abstracting: (1<=p78)
states: 24,010,000,000,000 (13)
abstracting: (p249<=p29)
states: 24,010,000,000,001 (13)
abstracting: (p137<=1)
states: 240,100,000,000,001 (14)
abstracting: (p125<=0)
states: 216,090,000,000,001 (14)
abstracting: (p52<=0)
states: 216,090,000,000,001 (14)
-> the formula is TRUE

FORMULA DLCround-PT-10a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.074sec

checking: AG [[1<=p233 | [[[~ [[[1<=p80 & [p45<=p82 & [1<=p212 & 1<=p71]]] & p121<=0]] & 1<=p283] | [[p294<=1 & [[[~ [p50<=0] | ~ [1<=p171]] & p293<=p174] | ~ [p70<=1]]] | [[~ [1<=p134] | [p320<=p156 & p35<=p273]] & [p70<=p1 | p44<=1]]]] | [p160<=1 & [[~ [[[[1<=p149 | 1<=p268] | [1<=p184 & 1<=p84]] | p295<=p200]] | ~ [[[[p74<=1 | p18<=p286] & [1<=p302 | p121<=p248]] & [p300<=1 & [p195<=p231 & p187<=0]]]]] & [1<=p120 | [[~ [1<=p119] & [~ [p195<=1] | [p130<=0 & p187<=1]]] | p8<=p313]]]]]]]
normalized: ~ [E [true U ~ [[1<=p233 | [[p160<=1 & [[1<=p120 | [p8<=p313 | [[[p130<=0 & p187<=1] | ~ [p195<=1]] & ~ [1<=p119]]]] & [~ [[[p300<=1 & [p195<=p231 & p187<=0]] & [[1<=p302 | p121<=p248] & [p74<=1 | p18<=p286]]]] | ~ [[p295<=p200 | [[1<=p184 & 1<=p84] | [1<=p149 | 1<=p268]]]]]]] | [[[[p70<=p1 | p44<=1] & [[p320<=p156 & p35<=p273] | ~ [1<=p134]]] | [p294<=1 & [~ [p70<=1] | [p293<=p174 & [~ [1<=p171] | ~ [p50<=0]]]]]] | [1<=p283 & ~ [[p121<=0 & [1<=p80 & [p45<=p82 & [1<=p212 & 1<=p71]]]]]]]]]]]]

abstracting: (1<=p71)
states: 24,010,000,000,000 (13)
abstracting: (1<=p212)
states: 240,100,000,000,000 (14)
abstracting: (p45<=p82)
states: 218,491,000,000,001 (14)
abstracting: (1<=p80)
states: 24,010,000,000,000 (13)
abstracting: (p121<=0)
states: 216,090,000,000,001 (14)
abstracting: (1<=p283)
states: 240,100,000,000,000 (14)
abstracting: (p50<=0)
states: 216,090,000,000,001 (14)
abstracting: (1<=p171)
states: 240,100,000,000,000 (14)
abstracting: (p293<=p174)
states: 240,100,000,000,001 (14)
abstracting: (p70<=1)
states: 240,100,000,000,001 (14)
abstracting: (p294<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p134)
states: 24,010,000,000,000 (13)
abstracting: (p35<=p273)
states: 240,100,000,000,001 (14)
abstracting: (p320<=p156)
states: 240,100,000,000,001 (14)
abstracting: (p44<=1)
states: 240,100,000,000,001 (14)
abstracting: (p70<=p1)
states: 219,520,000,000,001 (14)
abstracting: (1<=p268)
states: 240,100,000,000,000 (14)
abstracting: (1<=p149)
states: 240,100,000,000,000 (14)
abstracting: (1<=p84)
states: 24,010,000,000,000 (13)
abstracting: (1<=p184)
states: 240,100,000,000,000 (14)
abstracting: (p295<=p200)
states: 240,100,000,000,001 (14)
abstracting: (p18<=p286)
states: 240,100,000,000,001 (14)
abstracting: (p74<=1)
states: 240,100,000,000,001 (14)
abstracting: (p121<=p248)
states: 240,100,000,000,001 (14)
abstracting: (1<=p302)
states: 240,100,000,000,000 (14)
abstracting: (p187<=0)
states: 1
abstracting: (p195<=p231)
states: 240,100,000,000,001 (14)
abstracting: (p300<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p119)
states: 24,010,000,000,000 (13)
abstracting: (p195<=1)
states: 240,100,000,000,001 (14)
abstracting: (p187<=1)
states: 240,100,000,000,001 (14)
abstracting: (p130<=0)
states: 216,090,000,000,001 (14)
abstracting: (p8<=p313)
states: 240,100,000,000,001 (14)
abstracting: (1<=p120)
states: 24,010,000,000,000 (13)
abstracting: (p160<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p233)
states: 240,100,000,000,000 (14)
-> the formula is TRUE

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

MC time: 0m 7.611sec

checking: EF [[~ [[[[[[[[p172<=p179 & p3<=p176] & [p182<=0 & p125<=0]] | [p121<=p110 | [p143<=0 | p130<=p144]]] | [[p216<=p257 | p256<=1] | [1<=p220 | [p73<=p309 & 1<=p81]]]] | ~ [[[[1<=p17 & 1<=p321] | ~ [p162<=0]] | [[p64<=1 | p47<=0] | ~ [p322<=1]]]]] & ~ [[[~ [1<=p313] | [[p72<=1 & 1<=p325] | [p201<=1 & p325<=1]]] & ~ [[1<=p221 & ~ [p105<=1]]]]]] | [~ [[~ [p189<=1] | 1<=p144]] & p218<=0]]] & ~ [[[[~ [p66<=p85] | p28<=1] | ~ [[~ [1<=p34] | [[[p240<=0 | 1<=p28] & [p279<=p227 | p253<=0]] | p189<=p104]]]] | p202<=1]]]]
normalized: E [true U [~ [[p202<=1 | [~ [[[p189<=p104 | [[p279<=p227 | p253<=0] & [p240<=0 | 1<=p28]]] | ~ [1<=p34]]] | [p28<=1 | ~ [p66<=p85]]]]] & ~ [[[p218<=0 & ~ [[1<=p144 | ~ [p189<=1]]]] | [~ [[~ [[1<=p221 & ~ [p105<=1]]] & [[[p201<=1 & p325<=1] | [p72<=1 & 1<=p325]] | ~ [1<=p313]]]] & [~ [[[~ [p322<=1] | [p64<=1 | p47<=0]] | [~ [p162<=0] | [1<=p17 & 1<=p321]]]] | [[[1<=p220 | [p73<=p309 & 1<=p81]] | [p216<=p257 | p256<=1]] | [[p121<=p110 | [p143<=0 | p130<=p144]] | [[p182<=0 & p125<=0] & [p172<=p179 & p3<=p176]]]]]]]]]]

abstracting: (p3<=p176)
states: 240,100,000,000,001 (14)
abstracting: (p172<=p179)
states: 240,100,000,000,001 (14)
abstracting: (p125<=0)
states: 216,090,000,000,001 (14)
abstracting: (p182<=0)
states: 1
abstracting: (p130<=p144)
states: 240,100,000,000,001 (14)
abstracting: (p143<=0)
states: 1
abstracting: (p121<=p110)
states: 218,491,000,000,001 (14)
abstracting: (p256<=1)
states: 240,100,000,000,001 (14)
abstracting: (p216<=p257)
states: 240,100,000,000,001 (14)
abstracting: (1<=p81)
states: 24,010,000,000,000 (13)
abstracting: (p73<=p309)
states: 240,100,000,000,001 (14)
abstracting: (1<=p220)
states: 240,100,000,000,000 (14)
abstracting: (1<=p321)
states: 240,100,000,000,000 (14)
abstracting: (1<=p17)
states: 34,300,000,000,000 (13)
abstracting: (p162<=0)
states: 1
abstracting: (p47<=0)
states: 216,090,000,000,001 (14)
abstracting: (p64<=1)
states: 240,100,000,000,001 (14)
abstracting: (p322<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p313)
states: 240,100,000,000,000 (14)
abstracting: (1<=p325)
states: 240,100,000,000,000 (14)
abstracting: (p72<=1)
states: 240,100,000,000,001 (14)
abstracting: (p325<=1)
states: 240,100,000,000,001 (14)
abstracting: (p201<=1)
states: 240,100,000,000,001 (14)
abstracting: (p105<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p221)
states: 240,100,000,000,000 (14)
abstracting: (p189<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p144)
states: 240,100,000,000,000 (14)
abstracting: (p218<=0)
states: 1
abstracting: (p66<=p85)
states: 218,491,000,000,001 (14)
abstracting: (p28<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p34)
states: 24,010,000,000,000 (13)
abstracting: (1<=p28)
states: 34,300,000,000,000 (13)
abstracting: (p240<=0)
states: 1
abstracting: (p253<=0)
states: 1
abstracting: (p279<=p227)
states: 240,100,000,000,001 (14)
abstracting: (p189<=p104)
states: 24,010,000,000,001 (13)
abstracting: (p202<=1)
states: 240,100,000,000,001 (14)
-> the formula is FALSE

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

MC time: 0m 6.445sec

checking: EF [[[[[[[[[~ [p174<=p190] | 1<=p114] | ~ [p86<=p241]] & [[p213<=1 | [1<=p62 & p292<=p288]] | [[p55<=p99 & 1<=p229] | ~ [p53<=0]]]] & p260<=1] & [~ [[~ [1<=p114] | [p145<=0 | p84<=p130]]] & ~ [[[p228<=1 & 1<=p293] | p240<=p107]]]] & ~ [p170<=p171]] | [p299<=1 | [[[[[[p259<=0 | 1<=p91] | [1<=p27 & p48<=p306]] | [1<=p74 & ~ [p243<=p251]]] & p116<=1] & [~ [p53<=p315] & [[[p256<=1 | p280<=p260] & ~ [p245<=p16]] & 1<=p235]]] & p220<=p281]]] & [p149<=p251 & [[~ [[[[1<=p305 & p48<=p335] | [p124<=1 | p321<=1]] | [[p292<=p162 & 1<=p170] | [p108<=0 & p245<=1]]]] & [[~ [[~ [p122<=1] & ~ [1<=p196]]] & [[p134<=p24 | [p266<=p120 | p247<=p116]] | ~ [p101<=1]]] & [[1<=p279 & [[p216<=1 | p21<=p23] | [1<=p223 & p309<=0]]] | ~ [[1<=p101 | p189<=0]]]]] & p33<=0]]]]
normalized: E [true U [[p149<=p251 & [p33<=0 & [[[~ [[1<=p101 | p189<=0]] | [1<=p279 & [[1<=p223 & p309<=0] | [p216<=1 | p21<=p23]]]] & [[~ [p101<=1] | [p134<=p24 | [p266<=p120 | p247<=p116]]] & ~ [[~ [1<=p196] & ~ [p122<=1]]]]] & ~ [[[[p108<=0 & p245<=1] | [p292<=p162 & 1<=p170]] | [[p124<=1 | p321<=1] | [1<=p305 & p48<=p335]]]]]]] & [[p299<=1 | [p220<=p281 & [[[1<=p235 & [~ [p245<=p16] & [p256<=1 | p280<=p260]]] & ~ [p53<=p315]] & [p116<=1 & [[1<=p74 & ~ [p243<=p251]] | [[1<=p27 & p48<=p306] | [p259<=0 | 1<=p91]]]]]]] | [~ [p170<=p171] & [[~ [[p240<=p107 | [p228<=1 & 1<=p293]]] & ~ [[[p145<=0 | p84<=p130] | ~ [1<=p114]]]] & [p260<=1 & [[[~ [p53<=0] | [p55<=p99 & 1<=p229]] | [p213<=1 | [1<=p62 & p292<=p288]]] & [~ [p86<=p241] | [1<=p114 | ~ [p174<=p190]]]]]]]]]]

abstracting: (p174<=p190)
states: 240,100,000,000,001 (14)
abstracting: (1<=p114)
states: 24,010,000,000,000 (13)
abstracting: (p86<=p241)
states: 240,100,000,000,001 (14)
abstracting: (p292<=p288)
states: 240,100,000,000,001 (14)
abstracting: (1<=p62)
states: 24,010,000,000,000 (13)
abstracting: (p213<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p229)
states: 240,100,000,000,000 (14)
abstracting: (p55<=p99)
states: 218,491,000,000,001 (14)
abstracting: (p53<=0)
states: 216,090,000,000,001 (14)
abstracting: (p260<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p114)
states: 24,010,000,000,000 (13)
abstracting: (p84<=p130)
states: 218,491,000,000,001 (14)
abstracting: (p145<=0)
states: 1
abstracting: (1<=p293)
states: 240,100,000,000,000 (14)
abstracting: (p228<=1)
states: 240,100,000,000,001 (14)
abstracting: (p240<=p107)
states: 24,010,000,000,001 (13)
abstracting: (p170<=p171)
states: 240,100,000,000,001 (14)
abstracting: (1<=p91)
states: 24,010,000,000,000 (13)
abstracting: (p259<=0)
states: 1
abstracting: (p48<=p306)
states: 240,100,000,000,001 (14)
abstracting: (1<=p27)
states: 34,300,000,000,000 (13)
abstracting: (p243<=p251)
states: 240,100,000,000,001 (14)
abstracting: (1<=p74)
states: 24,010,000,000,000 (13)
abstracting: (p116<=1)
states: 240,100,000,000,001 (14)
abstracting: (p53<=p315)
states: 240,100,000,000,001 (14)
abstracting: (p280<=p260)
states: 240,100,000,000,001 (14)
abstracting: (p256<=1)
states: 240,100,000,000,001 (14)
abstracting: (p245<=p16)
states: 34,300,000,000,001 (13)
abstracting: (1<=p235)
states: 240,100,000,000,000 (14)
abstracting: (p220<=p281)
states: 240,100,000,000,001 (14)
abstracting: (p299<=1)
states: 240,100,000,000,001 (14)
abstracting: (p48<=p335)
states: 240,100,000,000,001 (14)
abstracting: (1<=p305)
states: 240,100,000,000,000 (14)
abstracting: (p321<=1)
states: 240,100,000,000,001 (14)
abstracting: (p124<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p170)
states: 240,100,000,000,000 (14)
abstracting: (p292<=p162)
states: 240,100,000,000,001 (14)
abstracting: (p245<=1)
states: 240,100,000,000,001 (14)
abstracting: (p108<=0)
states: 216,090,000,000,001 (14)
abstracting: (p122<=1)
states: 240,100,000,000,001 (14)
abstracting: (1<=p196)
states: 240,100,000,000,000 (14)
abstracting: (p247<=p116)
states: 24,010,000,000,001 (13)
abstracting: (p266<=p120)
states: 24,010,000,000,001 (13)
abstracting: (p134<=p24)
states: 219,520,000,000,001 (14)
abstracting: (p101<=1)
states: 240,100,000,000,001 (14)
abstracting: (p21<=p23)
states: 210,700,000,000,001 (14)
abstracting: (p216<=1)
states: 240,100,000,000,001 (14)
abstracting: (p309<=0)
states: 1
abstracting: (1<=p223)
states: 240,100,000,000,000 (14)
abstracting: (1<=p279)
states: 240,100,000,000,000 (14)
abstracting: (p189<=0)
states: 1
abstracting: (1<=p101)
states: 24,010,000,000,000 (13)
abstracting: (p33<=0)
states: 216,090,000,000,001 (14)
abstracting: (p149<=p251)
states: 240,100,000,000,001 (14)
-> the formula is FALSE

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

MC time: 0m 8.727sec

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

abstracting: (1<=p92)
states: 24,010,000,000,000 (13)
-> the formula is TRUE

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

MC time: 5m27.283sec

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

abstracting: (p82<=0)
states: 216,090,000,000,001 (14)
-> the formula is FALSE

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

MC time: 5m18.876sec

checking: EF [~ [[~ [p204<=p298] | p35<=0]]]
normalized: E [true U ~ [[p35<=0 | ~ [p204<=p298]]]]

abstracting: (p204<=p298)
states: 240,100,000,000,001 (14)
abstracting: (p35<=0)
states: 216,090,000,000,001 (14)
-> the formula is TRUE

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

MC time: 12m25.055sec

totally nodes used: 18475064 (1.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 690133628 575505317 1265638945
used/not used/entry size/cache size: 67108864 0 16 1024MB
basic ops cache: hits/miss/sum: 12039812 83167365 95207177
used/not used/entry size/cache size: 16756379 20837 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: 1579784 9843411 11423195
used/not used/entry size/cache size: 5771492 2617116 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 51006812
1 13949850
2 1947653
3 189305
4 14278
5 917
6 47
7 2
8 0
9 0
>= 10 0

Total processing time: 43m49.730sec


BK_STOP 1678465371229

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

924013
iterations count:112088 (43), effective:124 (0)

initing FirstDep: 0m 0.027sec


sat_reach.icc:155: Timeout: after 205 sec


sat_reach.icc:155: Timeout: after 191 sec


sat_reach.icc:155: Timeout: after 268 sec


iterations count:15996 (6), effective:10 (0)

iterations count:13580 (5), effective:10 (0)

iterations count:5638 (2), effective:10 (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-10a"
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-10a, 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-167814483100734"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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