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-167813697000535.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-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-tajo-167813697000535
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 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 141K 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-11-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678791899350

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-14 11:05:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 11:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 11:05:01] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-14 11:05:01] [INFO ] Transformed 567 places.
[2023-03-14 11:05:01] [INFO ] Transformed 508 transitions.
[2023-03-14 11:05:01] [INFO ] Found NUPN structural information;
[2023-03-14 11:05:01] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 7 transitions.
Incomplete random walk after 10000 steps, including 73 resets, run finished after 323 ms. (steps per millisecond=30 ) properties (out of 16) seen :5
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 501 rows 560 cols
[2023-03-14 11:05:02] [INFO ] Computed 95 place invariants in 21 ms
[2023-03-14 11:05:03] [INFO ] After 479ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-14 11:05:03] [INFO ] [Nat]Absence check using 53 positive place invariants in 22 ms returned sat
[2023-03-14 11:05:03] [INFO ] [Nat]Absence check using 53 positive and 42 generalized place invariants in 15 ms returned sat
[2023-03-14 11:05:04] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :7
[2023-03-14 11:05:04] [INFO ] Deduced a trap composed of 12 places in 484 ms of which 7 ms to minimize.
[2023-03-14 11:05:04] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2023-03-14 11:05:04] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2023-03-14 11:05:04] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 2 ms to minimize.
[2023-03-14 11:05:05] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2023-03-14 11:05:05] [INFO ] Deduced a trap composed of 22 places in 138 ms of which 1 ms to minimize.
[2023-03-14 11:05:05] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 0 ms to minimize.
[2023-03-14 11:05:05] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 1 ms to minimize.
[2023-03-14 11:05:05] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-03-14 11:05:05] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2023-03-14 11:05:06] [INFO ] Deduced a trap composed of 26 places in 211 ms of which 3 ms to minimize.
[2023-03-14 11:05:06] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 1 ms to minimize.
[2023-03-14 11:05:06] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 1 ms to minimize.
[2023-03-14 11:05:06] [INFO ] Deduced a trap composed of 31 places in 156 ms of which 1 ms to minimize.
[2023-03-14 11:05:06] [INFO ] Deduced a trap composed of 25 places in 155 ms of which 1 ms to minimize.
[2023-03-14 11:05:07] [INFO ] Deduced a trap composed of 42 places in 145 ms of which 4 ms to minimize.
[2023-03-14 11:05:07] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 1 ms to minimize.
[2023-03-14 11:05:07] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 1 ms to minimize.
[2023-03-14 11:05:07] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2023-03-14 11:05:07] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2023-03-14 11:05:07] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 0 ms to minimize.
[2023-03-14 11:05:07] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 3632 ms
[2023-03-14 11:05:08] [INFO ] Deduced a trap composed of 26 places in 219 ms of which 14 ms to minimize.
[2023-03-14 11:05:08] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 0 ms to minimize.
[2023-03-14 11:05:08] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 0 ms to minimize.
[2023-03-14 11:05:08] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2023-03-14 11:05:08] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2023-03-14 11:05:08] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2023-03-14 11:05:08] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1000 ms
[2023-03-14 11:05:09] [INFO ] Deduced a trap composed of 20 places in 115 ms of which 1 ms to minimize.
[2023-03-14 11:05:09] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 0 ms to minimize.
[2023-03-14 11:05:09] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2023-03-14 11:05:09] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2023-03-14 11:05:09] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2023-03-14 11:05:10] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2023-03-14 11:05:10] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 5 ms to minimize.
[2023-03-14 11:05:10] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 5 ms to minimize.
[2023-03-14 11:05:10] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 1 ms to minimize.
[2023-03-14 11:05:10] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 0 ms to minimize.
[2023-03-14 11:05:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1470 ms
[2023-03-14 11:05:11] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 0 ms to minimize.
[2023-03-14 11:05:11] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 1 ms to minimize.
[2023-03-14 11:05:11] [INFO ] Deduced a trap composed of 32 places in 146 ms of which 1 ms to minimize.
[2023-03-14 11:05:11] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 1 ms to minimize.
[2023-03-14 11:05:11] [INFO ] Deduced a trap composed of 40 places in 156 ms of which 0 ms to minimize.
[2023-03-14 11:05:11] [INFO ] Deduced a trap composed of 114 places in 137 ms of which 1 ms to minimize.
[2023-03-14 11:05:12] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:05:12] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 0 ms to minimize.
[2023-03-14 11:05:12] [INFO ] Deduced a trap composed of 54 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:05:12] [INFO ] Deduced a trap composed of 100 places in 134 ms of which 0 ms to minimize.
[2023-03-14 11:05:12] [INFO ] Deduced a trap composed of 111 places in 126 ms of which 0 ms to minimize.
[2023-03-14 11:05:12] [INFO ] Deduced a trap composed of 119 places in 126 ms of which 0 ms to minimize.
[2023-03-14 11:05:12] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 0 ms to minimize.
[2023-03-14 11:05:13] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 1 ms to minimize.
[2023-03-14 11:05:13] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 0 ms to minimize.
[2023-03-14 11:05:13] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 1 ms to minimize.
[2023-03-14 11:05:13] [INFO ] Deduced a trap composed of 53 places in 125 ms of which 1 ms to minimize.
[2023-03-14 11:05:13] [INFO ] Deduced a trap composed of 111 places in 127 ms of which 0 ms to minimize.
[2023-03-14 11:05:13] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 15 ms to minimize.
[2023-03-14 11:05:14] [INFO ] Deduced a trap composed of 107 places in 126 ms of which 1 ms to minimize.
[2023-03-14 11:05:14] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 1 ms to minimize.
[2023-03-14 11:05:14] [INFO ] Deduced a trap composed of 86 places in 134 ms of which 1 ms to minimize.
[2023-03-14 11:05:14] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 0 ms to minimize.
[2023-03-14 11:05:14] [INFO ] Deduced a trap composed of 106 places in 118 ms of which 0 ms to minimize.
[2023-03-14 11:05:14] [INFO ] Deduced a trap composed of 126 places in 118 ms of which 1 ms to minimize.
[2023-03-14 11:05:14] [INFO ] Deduced a trap composed of 104 places in 109 ms of which 0 ms to minimize.
[2023-03-14 11:05:14] [INFO ] Deduced a trap composed of 115 places in 118 ms of which 1 ms to minimize.
[2023-03-14 11:05:15] [INFO ] Deduced a trap composed of 59 places in 149 ms of which 1 ms to minimize.
[2023-03-14 11:05:15] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 4312 ms
[2023-03-14 11:05:15] [INFO ] After 11789ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :7
Attempting to minimize the solution found.
Minimization took 956 ms.
[2023-03-14 11:05:16] [INFO ] After 13049ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :7
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 128 ms.
Support contains 81 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (complete) has 1140 edges and 560 vertex of which 555 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 555 transition count 446
Reduce places removed 54 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 64 rules applied. Total rules applied 119 place count 501 transition count 436
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 129 place count 491 transition count 436
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 129 place count 491 transition count 340
Deduced a syphon composed of 96 places in 3 ms
Ensure Unique test removed 12 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 204 rules applied. Total rules applied 333 place count 383 transition count 340
Discarding 50 places :
Symmetric choice reduction at 3 with 50 rule applications. Total rules 383 place count 333 transition count 290
Iterating global reduction 3 with 50 rules applied. Total rules applied 433 place count 333 transition count 290
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 2 ms
Ensure Unique test removed 3 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 576 place count 260 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 577 place count 260 transition count 219
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 579 place count 259 transition count 223
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 583 place count 259 transition count 223
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 584 place count 258 transition count 222
Applied a total of 584 rules in 111 ms. Remains 258 /560 variables (removed 302) and now considering 222/501 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 258/560 places, 222/501 transitions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Finished probabilistic random walk after 110195 steps, run visited all 7 properties in 234 ms. (steps per millisecond=470 )
Probabilistic random walk after 110195 steps, saw 17440 distinct states, run finished after 235 ms. (steps per millisecond=468 ) properties seen :7
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 15881 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running BusinessProcesses (PT), instance 11
Examination ReachabilityFireability
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Fireability.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 567 places, 508 transitions, 1512 arcs.
Final Score: 24747.447
Took : 19 seconds
Reachability Fireability file is: ReachabilityFireability.xml
READY TO PARSE. BS
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 14272708 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16108512 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:
++ 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
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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-11"
export BK_EXAMINATION="ReachabilityFireability"
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-11, examination is ReachabilityFireability"
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-167813697000535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-11.tgz
mv BusinessProcesses-PT-11 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;