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.r043-tajo-167813696900462.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 smartxred
Input is BusinessProcesses-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813696900462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.7K Feb 25 16:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 16:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 16:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:43 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.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 25 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 16:44 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 59K 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-02-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-02-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678789874041

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=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 10:31:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 10:31:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 10:31:15] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-14 10:31:15] [INFO ] Transformed 262 places.
[2023-03-14 10:31:15] [INFO ] Transformed 219 transitions.
[2023-03-14 10:31:15] [INFO ] Found NUPN structural information;
[2023-03-14 10:31:15] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 131 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 13) seen :5
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 29 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 204 rows 245 cols
[2023-03-14 10:31:16] [INFO ] Computed 43 place invariants in 23 ms
[2023-03-14 10:31:17] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-14 10:31:17] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2023-03-14 10:31:17] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-14 10:31:17] [INFO ] After 178ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-14 10:31:17] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 7 ms to minimize.
[2023-03-14 10:31:17] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2023-03-14 10:31:17] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2023-03-14 10:31:17] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 2 ms to minimize.
[2023-03-14 10:31:17] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2023-03-14 10:31:17] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 0 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 59 places in 69 ms of which 1 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 0 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 62 places in 54 ms of which 1 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 0 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 60 places in 55 ms of which 2 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 57 places in 49 ms of which 1 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1015 ms
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 33 places in 67 ms of which 0 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2023-03-14 10:31:18] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2023-03-14 10:31:19] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 0 ms to minimize.
[2023-03-14 10:31:19] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2023-03-14 10:31:19] [INFO ] Deduced a trap composed of 35 places in 46 ms of which 1 ms to minimize.
[2023-03-14 10:31:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 489 ms
[2023-03-14 10:31:19] [INFO ] After 1967ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 177 ms.
[2023-03-14 10:31:19] [INFO ] After 2315ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 92 ms.
Support contains 46 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (complete) has 446 edges and 245 vertex of which 235 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 235 transition count 178
Reduce places removed 21 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 26 rules applied. Total rules applied 49 place count 214 transition count 173
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 54 place count 209 transition count 173
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 54 place count 209 transition count 135
Deduced a syphon composed of 38 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 77 rules applied. Total rules applied 131 place count 170 transition count 135
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 154 place count 147 transition count 112
Iterating global reduction 3 with 23 rules applied. Total rules applied 177 place count 147 transition count 112
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 219 place count 126 transition count 91
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 220 place count 126 transition count 90
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 222 place count 126 transition count 90
Applied a total of 222 rules in 101 ms. Remains 126 /245 variables (removed 119) and now considering 90/204 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 126/245 places, 90/204 transitions.
Incomplete random walk after 10000 steps, including 280 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 7) seen :6
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 2738 steps, including 14 resets, run visited all 1 properties in 13 ms. (steps per millisecond=210 )
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 4224 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 02
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 262 places, 219 transitions, 576 arcs.
Final Score: 4520.362
Took : 7 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-00 (reachable &!potential( ( ( ( ( ( ( ( ( ( 1 ) <= (tk(P193)) ) & ( (tk(P20)) <= (tk(P71)) ) ) & (! ( ( ( (tk(P187)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P190)) ) ) & ( (tk(P135)) <= ( 0 ) ) )) ) | ( (tk(P216)) <= ( 1 ) ) ) & ( (tk(P64)) <= (tk(P72)) ) ) | ( ( (tk(P32)) <= ( 1 ) ) & ( (tk(P1)) <= ( 0 ) ) ) ) | ( ( (tk(P27)) <= ( 1 ) ) | ( ( ( ( ( ( ( 1 ) <= (tk(P257)) ) & (! ( (tk(P246)) <= ( 1 ) )) ) & ( ( ( (tk(P64)) <= (tk(P90)) ) | ( (tk(P8)) <= ( 1 ) ) ) & ( ( (tk(P19)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P218)) ) ) ) ) | ( (! ( ( 1 ) <= (tk(P200)) )) | (! ( (tk(P88)) <= (tk(P42)) )) ) ) & ( (tk(P35)) <= ( 0 ) ) ) & ( (tk(P222)) <= ( 1 ) ) ) ) ) | (! ( ( ( ( (tk(P180)) <= ( 0 ) ) & ( ( (! ( ( (tk(P130)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P200)) ) )) | ( (! ( (tk(P92)) <= (tk(P176)) )) | ( ( (tk(P234)) <= (tk(P52)) ) | ( (tk(P111)) <= ( 1 ) ) ) ) ) | (! ( (tk(P139)) <= (tk(P135)) )) ) ) & ( (! ( (tk(P247)) <= ( 0 ) )) | ( (tk(P118)) <= (tk(P6)) ) ) ) | ( (! ( ( ( (tk(P224)) <= ( 0 ) ) & ( (tk(P105)) <= ( 1 ) ) ) & (! ( ( 1 ) <= (tk(P191)) )) )) & ( (tk(P19)) <= (tk(P7)) ) ) )) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-01 (reachable &!potential( ( (tk(P83)) <= (tk(P78)) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-02 (reachable & potential(( ( ( (! ( ( ( (tk(P145)) <= (tk(P242)) ) | ( ( 1 ) <= (tk(P177)) ) ) & (! ( (tk(P40)) <= ( 0 ) )) )) | (! ( (tk(P249)) <= ( 1 ) )) ) | ( (! ( ( (tk(P229)) <= (tk(P157)) ) | ( ( ( ( ( (tk(P26)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P64)) ) ) & ( ( ( 1 ) <= (tk(P99)) ) & ( (tk(P207)) <= (tk(P87)) ) ) ) & ( (! ( (tk(P222)) <= ( 0 ) )) | (! ( (tk(P145)) <= ( 1 ) )) ) ) & (! ( ( ( (tk(P199)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P31)) ) ) | ( (tk(P119)) <= (tk(P61)) ) )) ) )) & ( ( ( ( (tk(P74)) <= ( 1 ) ) & ( ( ( ( (tk(P155)) <= (tk(P255)) ) & ( (tk(P135)) <= (tk(P159)) ) ) | (! ( (tk(P160)) <= (tk(P109)) )) ) | ( ( (tk(P255)) <= (tk(P193)) ) & (! ( (tk(P236)) <= ( 0 ) )) ) ) ) & (! ( ( (tk(P221)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P137)) ) )) ) | ( ( ( 1 ) <= (tk(P128)) ) | (! ( (! ( (tk(P104)) <= ( 1 ) )) & ( (tk(P70)) <= (tk(P163)) ) )) ) ) ) ) & ( ( ( ( 1 ) <= (tk(P161)) ) | ( ( (tk(P192)) <= (tk(P169)) ) | ( ( (tk(P222)) <= ( 1 ) ) & ( ( (! ( ( (tk(P197)) <= (tk(P187)) ) & ( (tk(P92)) <= (tk(P49)) ) )) | ( ( (tk(P174)) <= (tk(P206)) ) & ( ( (tk(P117)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P123)) ) ) ) ) | ( ( 1 ) <= (tk(P45)) ) ) ) ) ) & (! ( ( (tk(P179)) <= ( 1 ) ) | (! ( ( ( (tk(P43)) <= ( 1 ) ) & ( ( (tk(P130)) <= (tk(P247)) ) | (! ( (tk(P76)) <= ( 1 ) )) ) ) & ( ( ( ( (tk(P51)) <= (tk(P155)) ) & ( (tk(P24)) <= ( 1 ) ) ) & (! ( ( 1 ) <= (tk(P247)) )) ) & ( ( ( ( 1 ) <= (tk(P227)) ) | ( (tk(P190)) <= ( 1 ) ) ) | (! ( (tk(P90)) <= (tk(P115)) )) ) ) )) )) ) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-03 (reachable & potential(( ( 1 ) <= (tk(P76)) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-04 (reachable &!potential( ( ( ( (tk(P221)) <= (tk(P254)) ) & ( (tk(P236)) <= ( 1 ) ) ) & ( ( ( (tk(P54)) <= ( 1 ) ) & ( ( (tk(P117)) <= (tk(P56)) ) & ( ( (! ( (tk(P13)) <= ( 0 ) )) & (! ( (! ( (tk(P238)) <= (tk(P113)) )) & (! ( ( 1 ) <= (tk(P191)) )) )) ) & ( ( (tk(P174)) <= ( 1 ) ) | ( ( ( (tk(P256)) <= (tk(P22)) ) | ( ( ( 1 ) <= (tk(P132)) ) & ( (tk(P223)) <= (tk(P84)) ) ) ) & ( (tk(P155)) <= (tk(P89)) ) ) ) ) ) ) | ( ( ( ( ( ( ( ( (tk(P1)) <= (tk(P253)) ) & ( ( 1 ) <= (tk(P243)) ) ) & (! ( (tk(P213)) <= (tk(P20)) )) ) | ( ( ( (tk(P197)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P243)) ) ) | ( ( (tk(P258)) <= (tk(P61)) ) & ( (tk(P117)) <= ( 1 ) ) ) ) ) & ( ( (! ( ( 1 ) <= (tk(P158)) )) | (! ( (tk(P174)) <= (tk(P40)) )) ) & ( ( ( (tk(P185)) <= (tk(P192)) ) | ( (tk(P38)) <= (tk(P252)) ) ) | ( ( (tk(P170)) <= ( 1 ) ) & ( (tk(P31)) <= (tk(P234)) ) ) ) ) ) & (! ( ( (tk(P104)) <= ( 0 ) ) & ( ( (tk(P257)) <= ( 0 ) ) & (! ( (tk(P221)) <= ( 1 ) )) ) )) ) | ( ( (tk(P221)) <= (tk(P233)) ) | ( ( ( ( 1 ) <= (tk(P201)) ) | ( (! ( ( 1 ) <= (tk(P71)) )) & ( (tk(P161)) <= (tk(P1)) ) ) ) & ( (! ( ( (tk(P137)) <= ( 1 ) ) | ( ( 1 ) <= (tk(P76)) ) )) | ( ( ( 1 ) <= (tk(P61)) ) | ( ( ( 1 ) <= (tk(P182)) ) | ( (tk(P92)) <= ( 0 ) ) ) ) ) ) ) ) | (! ( (tk(P179)) <= (tk(P138)) )) ) ) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-05 (reachable &!potential( ( (tk(P40)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-06 (reachable &!potential( ( (! ( ( ( 1 ) <= (tk(P97)) ) | ( ( ( ( (! ( (tk(P138)) <= (tk(P220)) )) & ( (tk(P126)) <= (tk(P58)) ) ) & ( (tk(P248)) <= (tk(P96)) ) ) | ( ( ( ( ( (tk(P162)) <= ( 1 ) ) | ( (tk(P179)) <= ( 0 ) ) ) | ( (tk(P117)) <= ( 0 ) ) ) & ( ( (tk(P241)) <= (tk(P205)) ) & (! ( ( 1 ) <= (tk(P233)) )) ) ) | ( ( ( ( 1 ) <= (tk(P45)) ) & ( ( ( 1 ) <= (tk(P61)) ) | ( (tk(P9)) <= (tk(P207)) ) ) ) & ( ( ( (tk(P255)) <= ( 0 ) ) & ( (tk(P1)) <= (tk(P223)) ) ) & ( ( (tk(P85)) <= ( 0 ) ) | ( (tk(P126)) <= (tk(P98)) ) ) ) ) ) ) & ( ( ( ( (! ( (tk(P5)) <= (tk(P223)) )) & (! ( ( 1 ) <= (tk(P142)) )) ) & ( ( 1 ) <= (tk(P98)) ) ) | ( (! ( ( (tk(P172)) <= ( 1 ) ) | ( (tk(P31)) <= (tk(P235)) ) )) & (! ( (tk(P96)) <= ( 1 ) )) ) ) & ( ( ( (tk(P114)) <= ( 0 ) ) & (! ( (tk(P87)) <= ( 1 ) )) ) | ( (tk(P90)) <= (tk(P50)) ) ) ) ) )) | ( ( ( (tk(P62)) <= (tk(P227)) ) | (! ( (! ( (tk(P13)) <= ( 0 ) )) & ( ( ( 1 ) <= (tk(P116)) ) & ( ( (tk(P54)) <= ( 1 ) ) & ( ( ( 1 ) <= (tk(P106)) ) & ( (tk(P146)) <= (tk(P216)) ) ) ) ) )) ) | ( (! ( (! ( (tk(P204)) <= (tk(P61)) )) | (! ( ( ( 1 ) <= (tk(P16)) ) | ( ( 1 ) <= (tk(P146)) ) )) )) & ( ( ( (tk(P11)) <= ( 0 ) ) | ( ( (tk(P123)) <= ( 0 ) ) & ( (! ( (tk(P144)) <= (tk(P101)) )) | ( (! ( (tk(P20)) <= (tk(P66)) )) | ( ( (tk(P97)) <= (tk(P157)) ) | ( (tk(P33)) <= (tk(P77)) ) ) ) ) ) ) | ( (! ( (! ( (tk(P185)) <= ( 1 ) )) | ( ( (tk(P208)) <= (tk(P34)) ) & ( (tk(P132)) <= ( 0 ) ) ) )) | ( (tk(P161)) <= (tk(P249)) ) ) ) ) ) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-07 (reachable &!potential( ( (tk(P240)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-08 (reachable & potential((! ( (tk(P106)) <= ( 1 ) ))))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-09 (reachable & potential((! ( (tk(P155)) <= (tk(P51)) ))))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-10 (reachable &!potential( ( (tk(P248)) <= ( 0 ) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-11 (reachable &!potential( ( ( ( 1 ) <= (tk(P247)) ) | ( (tk(P184)) <= ( 0 ) ) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-12 (reachable & potential(( ( 1 ) <= (tk(P216)) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-13 (reachable & potential(( ( 1 ) <= (tk(P32)) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-14 (reachable &!potential( ( ( ( ( ( (! ( ( (! ( ( 1 ) <= (tk(P245)) )) & ( (tk(P251)) <= ( 1 ) ) ) & (! ( (tk(P217)) <= (tk(P170)) )) )) | ( (tk(P73)) <= (tk(P65)) ) ) & ( ( 1 ) <= (tk(P147)) ) ) | ( ( 1 ) <= (tk(P148)) ) ) & (! ( ( ( (tk(P156)) <= ( 0 ) ) | (! ( ( ( (tk(P142)) <= (tk(P80)) ) & ( (tk(P90)) <= ( 0 ) ) ) | ( ( 1 ) <= (tk(P104)) ) )) ) & ( (tk(P141)) <= (tk(P66)) ) )) ) | ( ( ( ( ( (tk(P10)) <= ( 0 ) ) | ( ( (! ( (tk(P186)) <= ( 1 ) )) | (! ( ( 1 ) <= (tk(P185)) )) ) & ( ( (tk(P66)) <= ( 0 ) ) & ( ( ( (tk(P107)) <= (tk(P98)) ) | ( (tk(P261)) <= ( 1 ) ) ) | ( ( (tk(P230)) <= (tk(P170)) ) & ( (tk(P230)) <= ( 1 ) ) ) ) ) ) ) & ( (! ( (! ( ( 1 ) <= (tk(P31)) )) & (! ( ( 1 ) <= (tk(P171)) )) )) & ( (tk(P8)) <= (tk(P84)) ) ) ) | ( ( ( ( ( ( (tk(P86)) <= (tk(P161)) ) | ( ( 1 ) <= (tk(P96)) ) ) | ( ( (tk(P84)) <= ( 1 ) ) | ( (tk(P23)) <= (tk(P215)) ) ) ) | ( ( ( (tk(P123)) <= (tk(P152)) ) | ( ( (tk(P166)) <= (tk(P103)) ) & ( (tk(P144)) <= ( 0 ) ) ) ) | ( ( 1 ) <= (tk(P74)) ) ) ) | ( ( ( (! ( (tk(P38)) <= ( 1 ) )) | ( ( 1 ) <= (tk(P111)) ) ) | ( (! ( (tk(P82)) <= ( 0 ) )) & ( ( (tk(P246)) <= (tk(P261)) ) & ( ( 1 ) <= (tk(P137)) ) ) ) ) | ( ( (! ( ( 1 ) <= (tk(P186)) )) | ( ( (tk(P98)) <= ( 1 ) ) | ( (tk(P109)) <= (tk(P78)) ) ) ) & ( (! ( (tk(P235)) <= (tk(P232)) )) & ( ( ( 1 ) <= (tk(P258)) ) & ( (tk(P87)) <= ( 1 ) ) ) ) ) ) ) & (! ( (tk(P93)) <= (tk(P75)) )) ) ) | ( (tk(P112)) <= (tk(P240)) ) ) )))
PROPERTY: BusinessProcesses-PT-02-ReachabilityCardinality-15 (reachable & potential(( ( ( ( ( ( 1 ) <= (tk(P220)) ) | ( ( 1 ) <= (tk(P241)) ) ) | (! ( ( ( ( ( (tk(P10)) <= (tk(P8)) ) | ( (tk(P222)) <= (tk(P194)) ) ) | ( ( (tk(P27)) <= (tk(P78)) ) | ( (tk(P36)) <= (tk(P8)) ) ) ) | ( ( ( (tk(P256)) <= ( 0 ) ) | ( ( 1 ) <= (tk(P56)) ) ) & ( (tk(P220)) <= (tk(P38)) ) ) ) & ( ( (tk(P94)) <= (tk(P175)) ) & ( (tk(P92)) <= (tk(P260)) ) ) )) ) & ( (! ( (tk(P35)) <= ( 0 ) )) & ( (tk(P47)) <= ( 1 ) ) ) ) & ( (tk(P33)) <= (tk(P224)) ) )))
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678789912424

--------------------
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

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-02"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
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 smartxred"
echo " Input is BusinessProcesses-PT-02, 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 r043-tajo-167813696900462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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