Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695800454.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800454
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 47K 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 BusinessProcesses-PT-01-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-01-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678726455672

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=BusinessProcesses-PT-01
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 16:54:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 16:54:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:54:17] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2023-03-13 16:54:17] [INFO ] Transformed 200 places.
[2023-03-13 16:54:17] [INFO ] Transformed 178 transitions.
[2023-03-13 16:54:17] [INFO ] Found NUPN structural information;
[2023-03-13 16:54:17] [INFO ] Parsed PT model containing 200 places and 178 transitions and 487 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 111 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 12) seen :9
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :1
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 177 rows 199 cols
[2023-03-13 16:54:17] [INFO ] Computed 30 place invariants in 25 ms
[2023-03-13 16:54:18] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 16:54:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 6 ms returned sat
[2023-03-13 16:54:18] [INFO ] [Nat]Absence check using 20 positive and 10 generalized place invariants in 3 ms returned sat
[2023-03-13 16:54:18] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 7 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 0 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 52 places in 45 ms of which 0 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 47 places in 43 ms of which 1 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 55 places in 40 ms of which 0 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 57 places in 40 ms of which 1 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 59 places in 43 ms of which 0 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 57 places in 37 ms of which 0 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 46 places in 40 ms of which 0 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 0 ms to minimize.
[2023-03-13 16:54:18] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 54 places in 39 ms of which 0 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 0 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 0 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 56 places in 40 ms of which 1 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 0 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 52 places in 57 ms of which 0 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 55 places in 64 ms of which 1 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 1 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 1388 ms
[2023-03-13 16:54:19] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 0 ms to minimize.
[2023-03-13 16:54:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2023-03-13 16:54:19] [INFO ] After 1592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-03-13 16:54:19] [INFO ] After 1756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 7 ms.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 177/177 transitions.
Graph (trivial) has 115 edges and 199 vertex of which 8 / 199 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 372 edges and 192 vertex of which 189 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 41 place count 189 transition count 127
Reduce places removed 39 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 150 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 88 place count 146 transition count 123
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 88 place count 146 transition count 101
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 136 place count 120 transition count 101
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 160 place count 96 transition count 77
Iterating global reduction 3 with 24 rules applied. Total rules applied 184 place count 96 transition count 77
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 184 place count 96 transition count 74
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 190 place count 93 transition count 74
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 246 place count 65 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 248 place count 64 transition count 49
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 249 place count 64 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 250 place count 63 transition count 48
Applied a total of 250 rules in 77 ms. Remains 63 /199 variables (removed 136) and now considering 48/177 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 63/199 places, 48/177 transitions.
Incomplete random walk after 10000 steps, including 583 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 243 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 10074 steps, run visited all 1 properties in 39 ms. (steps per millisecond=258 )
Probabilistic random walk after 10074 steps, saw 2733 distinct states, run finished after 39 ms. (steps per millisecond=258 ) properties seen :1
FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 2757 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: BusinessProcesses_PT_01
(NrP: 200 NrTr: 178 NrArc: 487)

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

net check time: 0m 0.000sec

init dd package: 0m 3.216sec


RS generation: 0m21.861sec


-> reachability set: #nodes 850379 (8.5e+05) #states 24,160,976,859 (10)



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

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

abstracting: (p101<=1)
states: 24,160,976,859 (10)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.733sec

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

abstracting: (p180<=1)
states: 24,160,976,859 (10)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (p100<=0)
states: 19,521,533,109 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.280sec

checking: AG [~ [[~ [p29<=0] & p148<=0]]]
normalized: ~ [E [true U [p148<=0 & ~ [p29<=0]]]]

abstracting: (p29<=0)
states: 24,014,019,031 (10)
abstracting: (p148<=0)
states: 23,826,832,347 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m42.670sec

checking: AG [~ [[~ [p11<=0] & 1<=p106]]]
normalized: ~ [E [true U [1<=p106 & ~ [p11<=0]]]]

abstracting: (p11<=0)
states: 21,294,012,315 (10)
abstracting: (1<=p106)
states: 2,606,344,974 (9)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.483sec

checking: AG [[p174<=1 | p11<=0]]
normalized: ~ [E [true U ~ [[p174<=1 | p11<=0]]]]

abstracting: (p11<=0)
states: 21,294,012,315 (10)
abstracting: (p174<=1)
states: 24,160,976,859 (10)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.079sec

checking: AG [[p31<=0 | ~ [p87<=0]]]
normalized: ~ [E [true U ~ [[p31<=0 | ~ [p87<=0]]]]]

abstracting: (p87<=0)
states: 24,158,951,589 (10)
abstracting: (p31<=0)
states: 23,053,249,659 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.694sec

checking: AG [[p127<=p14 & p99<=0]]
normalized: ~ [E [true U ~ [[p127<=p14 & p99<=0]]]]

abstracting: (p99<=0)
states: 16,364,772,597 (10)
abstracting: (p127<=p14)
states: 16,104,781,659 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.362sec

checking: EF [[[1<=p47 & [p99<=p44 & p37<=1]] | 1<=p180]]
normalized: E [true U [1<=p180 | [1<=p47 & [p99<=p44 & p37<=1]]]]

abstracting: (p37<=1)
states: 24,160,976,859 (10)
abstracting: (p99<=p44)
states: 16,462,001,109 (10)
abstracting: (1<=p47)
states: 5,479,866,816 (9)
abstracting: (1<=p180)
states: 20,981,964 (7)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.734sec

checking: AG [[[~ [[~ [p98<=p178] | [p79<=1 & p159<=p157]]] | p168<=p64] & p70<=p94]]
normalized: ~ [E [true U ~ [[p70<=p94 & [p168<=p64 | ~ [[[p79<=1 & p159<=p157] | ~ [p98<=p178]]]]]]]]

abstracting: (p98<=p178)
states: 21,873,604,251 (10)
abstracting: (p159<=p157)
states: 23,836,845,531 (10)
abstracting: (p79<=1)
states: 24,160,976,859 (10)
abstracting: (p168<=p64)
states: 23,938,614,363 (10)
abstracting: (p70<=p94)
states: 19,338,107,307 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m23.636sec

checking: EF [[~ [p26<=p32] & [p36<=p155 | [[~ [p124<=0] | ~ [[p55<=0 & ~ [[p13<=p93 & p28<=1]]]]] | p116<=p91]]]]
normalized: E [true U [[p36<=p155 | [p116<=p91 | [~ [[p55<=0 & ~ [[p13<=p93 & p28<=1]]]] | ~ [p124<=0]]]] & ~ [p26<=p32]]]

abstracting: (p26<=p32)
states: 21,351,100,051 (10)
abstracting: (p124<=0)
states: 13,025,829,831 (10)
abstracting: (p28<=1)
states: 24,160,976,859 (10)
abstracting: (p13<=p93)
states: 21,435,941,019 (10)
abstracting: (p55<=0)
states: 24,146,988,883 (10)
abstracting: (p116<=p91)
states: 23,184,650,487 (10)
abstracting: (p36<=p155)
states: 21,892,526,295 (10)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35.576sec

checking: AG [[p147<=0 | [~ [[~ [[p143<=1 & [[p111<=p87 | p76<=p55] & [p121<=1 & p192<=0]]]] | [[[[p123<=1 & 1<=p149] | ~ [p187<=0]] & ~ [[1<=p105 & 1<=p9]]] & [[[1<=p152 & p166<=p144] | p52<=1] & ~ [p42<=1]]]]] | ~ [p16<=p25]]]]
normalized: ~ [E [true U ~ [[p147<=0 | [~ [p16<=p25] | ~ [[[[~ [p42<=1] & [p52<=1 | [1<=p152 & p166<=p144]]] & [~ [[1<=p105 & 1<=p9]] & [~ [p187<=0] | [p123<=1 & 1<=p149]]]] | ~ [[p143<=1 & [[p121<=1 & p192<=0] & [p111<=p87 | p76<=p55]]]]]]]]]]]

abstracting: (p76<=p55)
states: 18,839,819,163 (10)
abstracting: (p111<=p87)
states: 18,830,320,743 (10)
abstracting: (p192<=0)
states: 24,157,342,087 (10)
abstracting: (p121<=1)
states: 24,160,976,859 (10)
abstracting: (p143<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p149)
states: 881,746,968 (8)
abstracting: (p123<=1)
states: 24,160,976,859 (10)
abstracting: (p187<=0)
states: 24,146,989,491 (10)
abstracting: (1<=p9)
states: 3,330,675,948 (9)
abstracting: (1<=p105)
states: 1,294,917,660 (9)
abstracting: (p166<=p144)
states: 23,743,835,931 (10)
abstracting: (1<=p152)
states: 1,350,196,887 (9)
abstracting: (p52<=1)
states: 24,160,976,859 (10)
abstracting: (p42<=1)
states: 24,160,976,859 (10)
abstracting: (p16<=p25)
states: 23,868,364,251 (10)
abstracting: (p147<=0)
states: 23,826,832,347 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.017sec

checking: AG [[p157<=1 & [p101<=1 | [[[[[1<=p183 | ~ [1<=p6]] | [p62<=0 | [~ [p194<=1] & [1<=p176 & p33<=0]]]] & [~ [p1<=1] | p12<=1]] & p64<=1] | [~ [[~ [p24<=p189] & ~ [[[1<=p4 & p109<=0] | ~ [p149<=0]]]]] & [~ [1<=p180] & ~ [[[[p102<=p17 & 1<=p161] | [1<=p1 & 1<=p156]] & ~ [[p149<=1 & 1<=p39]]]]]]]]]]
normalized: ~ [E [true U ~ [[p157<=1 & [p101<=1 | [[[~ [[~ [[p149<=1 & 1<=p39]] & [[1<=p1 & 1<=p156] | [p102<=p17 & 1<=p161]]]] & ~ [1<=p180]] & ~ [[~ [[~ [p149<=0] | [1<=p4 & p109<=0]]] & ~ [p24<=p189]]]] | [p64<=1 & [[p12<=1 | ~ [p1<=1]] & [[p62<=0 | [[1<=p176 & p33<=0] & ~ [p194<=1]]] | [1<=p183 | ~ [1<=p6]]]]]]]]]]]

abstracting: (1<=p6)
states: 11,524,674 (7)
abstracting: (1<=p183)
states: 13,986,000 (7)
abstracting: (p194<=1)
states: 24,160,976,859 (10)
abstracting: (p33<=0)
states: 23,640,992,283 (10)
abstracting: (1<=p176)
states: 888,923,232 (8)
abstracting: (p62<=0)
states: 24,146,989,035 (10)
abstracting: (p1<=1)
states: 24,160,976,859 (10)
abstracting: (p12<=1)
states: 24,160,976,859 (10)
abstracting: (p64<=1)
states: 24,160,976,859 (10)
abstracting: (p24<=p189)
states: 22,037,957,787 (10)
abstracting: (p109<=0)
states: 16,015,612,845 (10)
abstracting: (1<=p4)
states: 1,882,986 (6)
abstracting: (p149<=0)
states: 23,279,229,891 (10)
abstracting: (1<=p180)
states: 20,981,964 (7)
abstracting: (1<=p161)
states: 289,795,968 (8)
abstracting: (p102<=p17)
states: 21,775,706,139 (10)
abstracting: (1<=p156)
states: 144,897,984 (8)
abstracting: (1<=p1)
states: 10
abstracting: (1<=p39)
states: 9,810,424,026 (9)
abstracting: (p149<=1)
states: 24,160,976,859 (10)
abstracting: (p101<=1)
states: 24,160,976,859 (10)
abstracting: (p157<=1)
states: 24,160,976,859 (10)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.359sec

checking: AG [[[~ [[[[[[~ [p160<=p45] & [p186<=0 & p198<=1]] | [p154<=1 | p53<=p131]] | [~ [1<=p28] | ~ [[1<=p68 & p81<=p152]]]] | [p34<=0 | [[~ [p135<=0] | [p147<=0 | 1<=p190]] & [[1<=p148 | 1<=p7] & [p179<=0 | p196<=p121]]]]] & [[[[p112<=1 & [p166<=p20 | p93<=1]] & p65<=0] & [~ [p149<=p94] & p102<=1]] | [~ [p177<=0] & [[~ [1<=p68] & [1<=p199 & p45<=p52]] | ~ [1<=p155]]]]]] & p104<=p17] & p62<=0]]
normalized: ~ [E [true U ~ [[p62<=0 & [p104<=p17 & ~ [[[[[~ [1<=p155] | [[1<=p199 & p45<=p52] & ~ [1<=p68]]] & ~ [p177<=0]] | [[p102<=1 & ~ [p149<=p94]] & [p65<=0 & [p112<=1 & [p166<=p20 | p93<=1]]]]] & [[p34<=0 | [[[p179<=0 | p196<=p121] & [1<=p148 | 1<=p7]] & [[p147<=0 | 1<=p190] | ~ [p135<=0]]]] | [[~ [[1<=p68 & p81<=p152]] | ~ [1<=p28]] | [[p154<=1 | p53<=p131] | [[p186<=0 & p198<=1] & ~ [p160<=p45]]]]]]]]]]]]

abstracting: (p160<=p45)
states: 24,003,383,259 (10)
abstracting: (p198<=1)
states: 24,160,976,859 (10)
abstracting: (p186<=0)
states: 24,146,989,491 (10)
abstracting: (p53<=p131)
states: 16,179,352,347 (10)
abstracting: (p154<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p28)
states: 146,957,828 (8)
abstracting: (p81<=p152)
states: 24,103,732,239 (10)
abstracting: (1<=p68)
states: 46,625,472 (7)
abstracting: (p135<=0)
states: 24,088,943,375 (10)
abstracting: (1<=p190)
states: 27,975,648 (7)
abstracting: (p147<=0)
states: 23,826,832,347 (10)
abstracting: (1<=p7)
states: 21,826,578 (7)
abstracting: (1<=p148)

before gc: list nodes free: 1427547

after gc: idd nodes used:5632905, unused:58367095; list nodes free:252477659
states: 334,144,512 (8)
abstracting: (p196<=p121)
states: 24,133,004,859 (10)
abstracting: (p179<=0)
states: 24,139,994,895 (10)
abstracting: (p34<=0)
states: 21,351,100,051 (10)
abstracting: (p93<=1)
states: 24,160,976,859 (10)
abstracting: (p166<=p20)
states: 23,743,835,931 (10)
abstracting: (p112<=1)
states: 24,160,976,859 (10)
abstracting: (p65<=0)
states: 24,146,989,035 (10)
abstracting: (p149<=p94)
states: 23,486,107,779 (10)
abstracting: (p102<=1)
states: 24,160,976,859 (10)
abstracting: (p177<=0)
states: 24,153,982,947 (10)
abstracting: (1<=p68)
states: 46,625,472 (7)
abstracting: (p45<=p52)
states: 16,488,176,927 (10)
abstracting: (1<=p199)
states: 27,972,912 (7)
abstracting: (1<=p155)
states: 144,897,984 (8)
abstracting: (p104<=p17)
states: 21,680,771,871 (10)
abstracting: (p62<=0)
states: 24,146,989,035 (10)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m16.536sec

checking: AG [[~ [[[~ [[[[p191<=0 | 1<=p52] & [1<=p57 | p186<=p18]] & [p165<=p198 & ~ [1<=p109]]]] | [p50<=p54 | [[[~ [1<=p130] | [1<=p31 | 1<=p185]] | [[p75<=1 | 1<=p52] | ~ [1<=p17]]] & 1<=p108]]] & ~ [p11<=p127]]] | [[[[[~ [p175<=1] & [~ [p56<=p163] | 1<=p171]] | ~ [p55<=p18]] | 1<=p53] & p55<=0] & ~ [[~ [[[1<=p55 & ~ [[1<=p67 | p44<=p184]]] & ~ [p159<=p63]]] | [~ [[[p144<=p111 & ~ [p56<=p74]] & [p60<=1 & [p178<=p129 | p5<=1]]]] & [[p121<=0 & 1<=p149] | 1<=p190]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[[[1<=p190 | [p121<=0 & 1<=p149]] & ~ [[[p60<=1 & [p178<=p129 | p5<=1]] & [p144<=p111 & ~ [p56<=p74]]]]] | ~ [[~ [p159<=p63] & [1<=p55 & ~ [[1<=p67 | p44<=p184]]]]]]] & [p55<=0 & [1<=p53 | [~ [p55<=p18] | [[1<=p171 | ~ [p56<=p163]] & ~ [p175<=1]]]]]] | ~ [[~ [p11<=p127] & [[p50<=p54 | [1<=p108 & [[~ [1<=p17] | [p75<=1 | 1<=p52]] | [[1<=p31 | 1<=p185] | ~ [1<=p130]]]]] | ~ [[[p165<=p198 & ~ [1<=p109]] & [[1<=p57 | p186<=p18] & [p191<=0 | 1<=p52]]]]]]]]]]]

abstracting: (1<=p52)
states: 7,981,624,512 (9)
abstracting: (p191<=0)
states: 24,157,342,087 (10)
abstracting: (p186<=p18)
states: 24,146,989,491 (10)
abstracting: (1<=p57)
states: 4,936,339,320 (9)
abstracting: (1<=p109)
states: 8,145,364,014 (9)
abstracting: (p165<=p198)
states: 23,743,835,931 (10)
abstracting: (1<=p130)
states: 1,226,802,414 (9)
abstracting: (1<=p185)
states: 13,987,824 (7)
abstracting: (1<=p31)
states: 1,107,727,200 (9)
abstracting: (1<=p52)
states: 7,981,624,512 (9)
abstracting: (p75<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p17)
states: 15,957,688,908 (10)
abstracting: (1<=p108)
states: 5,140,348,992 (9)
abstracting: (p50<=p54)
states: 23,568,361,371 (10)
abstracting: (p11<=p127)
states: 22,387,162,395 (10)
abstracting: (p175<=1)
states: 24,160,976,859 (10)
abstracting: (p56<=p163)
states: 24,146,988,883 (10)
abstracting: (1<=p171)
states: 489,513,888 (8)
abstracting: (p55<=p18)
states: 24,146,988,883 (10)
abstracting: (1<=p53)
states: 7,981,624,512 (9)
abstracting: (p55<=0)
states: 24,146,988,883 (10)
abstracting: (p44<=p184)
states: 23,834,634,267 (10)
abstracting: (1<=p67)
states: 27,975,648 (7)
abstracting: (1<=p55)
states: 13,987,976 (7)
abstracting: (p159<=p63)
states: 23,836,845,531 (10)
abstracting: (p56<=p74)
states: 24,152,578,779 (10)
abstracting: (p144<=p111)
states: 23,079,159,270 (10)
abstracting: (p5<=1)
states: 24,160,976,859 (10)
abstracting: (p178<=p129)
states: 24,156,314,175 (10)
abstracting: (p60<=1)
states: 24,160,976,859 (10)
abstracting: (1<=p149)
states: 881,746,968 (8)
abstracting: (p121<=0)
states: 23,505,575,775 (10)
abstracting: (1<=p190)
states: 27,975,648 (7)
-> the formula is FALSE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.543sec

checking: EF [~ [[[[[[[~ [[1<=p53 | p138<=p27]] & ~ [p50<=p104]] & ~ [1<=p195]] & [p85<=0 & [[p165<=p58 & [p90<=p182 & 1<=p3]] | [[p13<=p92 | p125<=p1] & [p37<=0 & p79<=1]]]]] | ~ [[[[p135<=p150 & p56<=p109] & ~ [1<=p64]] & ~ [[p60<=p64 & p23<=p109]]]]] | [[[1<=p87 & p145<=p91] | [~ [[[p128<=1 & p92<=p81] | [1<=p113 | p179<=0]]] | [~ [[p153<=0 & p78<=p127]] | 1<=p117]]] | ~ [[[[~ [p137<=1] | p63<=p27] | ~ [[1<=p66 & p29<=p77]]] & 1<=p53]]]] | [[~ [[[~ [p165<=p114] | ~ [p45<=p54]] | ~ [1<=p70]]] | p135<=p17] & p49<=p117]]]]
normalized: E [true U ~ [[[p49<=p117 & [p135<=p17 | ~ [[~ [1<=p70] | [~ [p45<=p54] | ~ [p165<=p114]]]]]] | [[~ [[1<=p53 & [~ [[1<=p66 & p29<=p77]] | [p63<=p27 | ~ [p137<=1]]]]] | [[[1<=p117 | ~ [[p153<=0 & p78<=p127]]] | ~ [[[1<=p113 | p179<=0] | [p128<=1 & p92<=p81]]]] | [1<=p87 & p145<=p91]]] | [~ [[~ [[p60<=p64 & p23<=p109]] & [~ [1<=p64] & [p135<=p150 & p56<=p109]]]] | [[p85<=0 & [[[p37<=0 & p79<=1] & [p13<=p92 | p125<=p1]] | [p165<=p58 & [p90<=p182 & 1<=p3]]]] & [~ [1<=p195] & [~ [p50<=p104] & ~ [[1<=p53 | p138<=p27]]]]]]]]]]

abstracting: (p138<=p27)
states: 24,118,571,159 (10)
abstracting: (1<=p53)
states: 7,981,624,512 (9)
abstracting: (p50<=p104)
states: 23,744,971,035 (10)
abstracting: (1<=p195)
states: 27,972,000 (7)
abstracting: (1<=p3)
states: 1,882,986 (6)
abstracting: (p90<=p182)
states: 22,617,259,977 (10)
abstracting: (p165<=p58)
states: 23,806,821,531 (10)
abstracting: (p125<=p1)
states: 23,505,575,775 (10)
abstracting: (p13<=p92)
states: 21,435,941,019 (10)
abstracting: (p79<=1)
states: 24,160,976,859 (10)
abstracting: (p37<=0)
states: 21,877,083,159 (10)
abstracting: (p85<=0)
states: 24,160,900,461 (10)
abstracting: (p56<=p109)
states: 24,151,633,099 (10)
abstracting: (p135<=p150)
states: 24,093,812,641 (10)
abstracting: (1<=p64)
states: 499,527,912 (8)
abstracting: (p23<=p109)
states: 23,974,098,963 (10)
abstracting: (p60<=p64)
states: 23,090,072,475 (10)
abstracting: (p145<=p91)
states: 23,132,033,667 (10)
abstracting: (1<=p87)
states: 2,025,270 (6)
abstracting: (p92<=p81)
states: 24,160,976,859 (10)
abstracting: (p128<=1)
states: 24,160,976,859 (10)
abstracting: (p179<=0)
states: 24,139,994,895 (10)
abstracting: (1<=p113)
states: 2,556,992,448 (9)
abstracting: (p78<=p127)
states: 24,098,280,059 (10)
abstracting: (p153<=0)
states: 23,371,580,379 (10)
abstracting: (1<=p117)
states: 8,712,131,904 (9)
abstracting: (p137<=1)
states: 24,160,976,859 (10)
abstracting: (p63<=p27)
states: 23,720,654,835 (10)
abstracting: (p29<=p77)
states: 24,045,345,079 (10)
abstracting: (1<=p66)
states: 27,975,648 (7)
abstracting: (1<=p53)
states: 7,981,624,512 (9)
abstracting: (p165<=p114)
states: 23,882,720,475 (10)
abstracting: (p45<=p54)
states: 12,769,246,911 (10)
abstracting: (1<=p70)
states: 6,370,180,800 (9)
abstracting: (p135<=p17)
states: 24,122,686,879 (10)
abstracting: (p49<=p117)
states: 23,782,502,043 (10)
-> the formula is TRUE

FORMULA BusinessProcesses-PT-01-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.613sec

totally nodes used: 92309724 (9.2e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 81961456 471747304 553708760
used/not used/entry size/cache size: 59591576 7517288 16 1024MB
basic ops cache: hits/miss/sum: 24819301 143424078 168243379
used/not used/entry size/cache size: 16642443 134773 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: 2025128 10800813 12825941
used/not used/entry size/cache size: 3841463 4547145 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 43023706
1 16681829
2 5468722
3 1510006
4 344931
5 66597
6 11178
7 1629
8 239
9 25
>= 10 2

Total processing time: 6m 5.921sec


BK_STOP 1678726826155

--------------------
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
found
The net has a maximal unmarked siphon:
p92

The net has transition(s) that can never fire:
t90

check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:10786 (60), effective:882 (4)

initing FirstDep: 0m 0.000sec


iterations count:211 (1), effective:12 (0)

iterations count:2712 (15), effective:133 (0)

iterations count:4149 (23), effective:258 (1)

iterations count:4800 (26), effective:316 (1)

iterations count:816 (4), effective:58 (0)

iterations count:6059 (34), effective:389 (2)

iterations count:8542 (47), effective:502 (2)

iterations count:2650 (14), effective:121 (0)

iterations count:2982 (16), effective:158 (0)

iterations count:5902 (33), effective:376 (2)

iterations count:4471 (25), effective:289 (1)

iterations count:2923 (16), effective:111 (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="BusinessProcesses-PT-01"
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 BusinessProcesses-PT-01, 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 r042-tajo-167813695800454"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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