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.r041-tajo-167813694800527.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 ltsminxred
Input is BusinessProcesses-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:50 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:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 16:52 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 131K 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-10-ReachabilityFireability-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1678642548504

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 17:35:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:35:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:35:50] [INFO ] Load time of PNML (sax parser for PT used): 64 ms
[2023-03-12 17:35:50] [INFO ] Transformed 518 places.
[2023-03-12 17:35:50] [INFO ] Transformed 471 transitions.
[2023-03-12 17:35:50] [INFO ] Found NUPN structural information;
[2023-03-12 17:35:50] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 82 resets, run finished after 511 ms. (steps per millisecond=19 ) properties (out of 16) seen :6
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 10) seen :3
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 16 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 13 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 471 rows 518 cols
[2023-03-12 17:35:51] [INFO ] Computed 85 place invariants in 40 ms
[2023-03-12 17:35:51] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 17:35:51] [INFO ] [Nat]Absence check using 48 positive place invariants in 18 ms returned sat
[2023-03-12 17:35:51] [INFO ] [Nat]Absence check using 48 positive and 37 generalized place invariants in 11 ms returned sat
[2023-03-12 17:35:52] [INFO ] After 451ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :3
[2023-03-12 17:35:52] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 6 ms to minimize.
[2023-03-12 17:35:52] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2023-03-12 17:35:52] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2023-03-12 17:35:52] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 1 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 3 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 25 places in 69 ms of which 1 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:35:53] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2023-03-12 17:35:54] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1511 ms
[2023-03-12 17:35:54] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:35:54] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2023-03-12 17:35:54] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2023-03-12 17:35:54] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2023-03-12 17:35:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 488 ms
[2023-03-12 17:35:54] [INFO ] Deduced a trap composed of 113 places in 169 ms of which 1 ms to minimize.
[2023-03-12 17:35:55] [INFO ] Deduced a trap composed of 107 places in 136 ms of which 1 ms to minimize.
[2023-03-12 17:35:55] [INFO ] Deduced a trap composed of 116 places in 138 ms of which 1 ms to minimize.
[2023-03-12 17:35:55] [INFO ] Deduced a trap composed of 113 places in 131 ms of which 1 ms to minimize.
[2023-03-12 17:35:55] [INFO ] Deduced a trap composed of 117 places in 165 ms of which 1 ms to minimize.
[2023-03-12 17:35:55] [INFO ] Deduced a trap composed of 120 places in 137 ms of which 1 ms to minimize.
[2023-03-12 17:35:56] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 0 ms to minimize.
[2023-03-12 17:35:56] [INFO ] Deduced a trap composed of 120 places in 136 ms of which 1 ms to minimize.
[2023-03-12 17:35:56] [INFO ] Deduced a trap composed of 125 places in 120 ms of which 1 ms to minimize.
[2023-03-12 17:35:56] [INFO ] Deduced a trap composed of 115 places in 155 ms of which 0 ms to minimize.
[2023-03-12 17:35:56] [INFO ] Deduced a trap composed of 120 places in 167 ms of which 0 ms to minimize.
[2023-03-12 17:35:56] [INFO ] Deduced a trap composed of 124 places in 149 ms of which 1 ms to minimize.
[2023-03-12 17:35:57] [INFO ] Deduced a trap composed of 129 places in 174 ms of which 1 ms to minimize.
[2023-03-12 17:35:57] [INFO ] Deduced a trap composed of 127 places in 107 ms of which 1 ms to minimize.
[2023-03-12 17:35:57] [INFO ] Deduced a trap composed of 112 places in 105 ms of which 0 ms to minimize.
[2023-03-12 17:35:57] [INFO ] Deduced a trap composed of 121 places in 110 ms of which 4 ms to minimize.
[2023-03-12 17:35:57] [INFO ] Deduced a trap composed of 116 places in 102 ms of which 0 ms to minimize.
[2023-03-12 17:35:57] [INFO ] Deduced a trap composed of 125 places in 143 ms of which 1 ms to minimize.
[2023-03-12 17:35:58] [INFO ] Deduced a trap composed of 114 places in 126 ms of which 1 ms to minimize.
[2023-03-12 17:35:58] [INFO ] Deduced a trap composed of 124 places in 135 ms of which 1 ms to minimize.
[2023-03-12 17:35:58] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 1 ms to minimize.
[2023-03-12 17:35:58] [INFO ] Deduced a trap composed of 30 places in 151 ms of which 1 ms to minimize.
[2023-03-12 17:35:58] [INFO ] Deduced a trap composed of 25 places in 147 ms of which 1 ms to minimize.
[2023-03-12 17:35:59] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 1 ms to minimize.
[2023-03-12 17:35:59] [INFO ] Deduced a trap composed of 24 places in 141 ms of which 2 ms to minimize.
[2023-03-12 17:35:59] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 1 ms to minimize.
[2023-03-12 17:35:59] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 1 ms to minimize.
[2023-03-12 17:35:59] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 1 ms to minimize.
[2023-03-12 17:36:00] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 0 ms to minimize.
[2023-03-12 17:36:00] [INFO ] Deduced a trap composed of 124 places in 165 ms of which 0 ms to minimize.
[2023-03-12 17:36:00] [INFO ] Deduced a trap composed of 124 places in 176 ms of which 1 ms to minimize.
[2023-03-12 17:36:00] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 3 ms to minimize.
[2023-03-12 17:36:01] [INFO ] Deduced a trap composed of 130 places in 115 ms of which 0 ms to minimize.
[2023-03-12 17:36:01] [INFO ] Deduced a trap composed of 128 places in 120 ms of which 1 ms to minimize.
[2023-03-12 17:36:01] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 0 ms to minimize.
[2023-03-12 17:36:01] [INFO ] Deduced a trap composed of 124 places in 113 ms of which 0 ms to minimize.
[2023-03-12 17:36:02] [INFO ] Deduced a trap composed of 111 places in 112 ms of which 1 ms to minimize.
[2023-03-12 17:36:02] [INFO ] Deduced a trap composed of 114 places in 121 ms of which 17 ms to minimize.
[2023-03-12 17:36:02] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 1 ms to minimize.
[2023-03-12 17:36:02] [INFO ] Deduced a trap composed of 114 places in 123 ms of which 1 ms to minimize.
[2023-03-12 17:36:03] [INFO ] Deduced a trap composed of 122 places in 137 ms of which 1 ms to minimize.
[2023-03-12 17:36:03] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 1 ms to minimize.
[2023-03-12 17:36:03] [INFO ] Deduced a trap composed of 113 places in 134 ms of which 0 ms to minimize.
[2023-03-12 17:36:03] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 1 ms to minimize.
[2023-03-12 17:36:04] [INFO ] Deduced a trap composed of 133 places in 181 ms of which 2 ms to minimize.
[2023-03-12 17:36:04] [INFO ] Deduced a trap composed of 144 places in 138 ms of which 1 ms to minimize.
[2023-03-12 17:36:04] [INFO ] Deduced a trap composed of 137 places in 134 ms of which 2 ms to minimize.
[2023-03-12 17:36:04] [INFO ] Deduced a trap composed of 137 places in 126 ms of which 0 ms to minimize.
[2023-03-12 17:36:04] [INFO ] Deduced a trap composed of 22 places in 140 ms of which 2 ms to minimize.
[2023-03-12 17:36:05] [INFO ] Deduced a trap composed of 122 places in 140 ms of which 2 ms to minimize.
[2023-03-12 17:36:05] [INFO ] Deduced a trap composed of 112 places in 138 ms of which 1 ms to minimize.
[2023-03-12 17:36:05] [INFO ] Deduced a trap composed of 111 places in 128 ms of which 0 ms to minimize.
[2023-03-12 17:36:05] [INFO ] Deduced a trap composed of 120 places in 140 ms of which 0 ms to minimize.
[2023-03-12 17:36:05] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2023-03-12 17:36:06] [INFO ] Deduced a trap composed of 27 places in 156 ms of which 1 ms to minimize.
[2023-03-12 17:36:06] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 0 ms to minimize.
[2023-03-12 17:36:06] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 1 ms to minimize.
[2023-03-12 17:36:06] [INFO ] Deduced a trap composed of 124 places in 170 ms of which 0 ms to minimize.
[2023-03-12 17:36:06] [INFO ] Deduced a trap composed of 117 places in 142 ms of which 1 ms to minimize.
[2023-03-12 17:36:07] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 0 ms to minimize.
[2023-03-12 17:36:07] [INFO ] Deduced a trap composed of 114 places in 134 ms of which 1 ms to minimize.
[2023-03-12 17:36:07] [INFO ] Deduced a trap composed of 119 places in 137 ms of which 1 ms to minimize.
[2023-03-12 17:36:07] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 1 ms to minimize.
[2023-03-12 17:36:08] [INFO ] Deduced a trap composed of 123 places in 138 ms of which 1 ms to minimize.
[2023-03-12 17:36:08] [INFO ] Deduced a trap composed of 122 places in 129 ms of which 0 ms to minimize.
[2023-03-12 17:36:08] [INFO ] Deduced a trap composed of 127 places in 126 ms of which 1 ms to minimize.
[2023-03-12 17:36:08] [INFO ] Deduced a trap composed of 127 places in 134 ms of which 1 ms to minimize.
[2023-03-12 17:36:09] [INFO ] Deduced a trap composed of 118 places in 98 ms of which 1 ms to minimize.
[2023-03-12 17:36:09] [INFO ] Deduced a trap composed of 117 places in 129 ms of which 1 ms to minimize.
[2023-03-12 17:36:09] [INFO ] Deduced a trap composed of 110 places in 112 ms of which 0 ms to minimize.
[2023-03-12 17:36:09] [INFO ] Deduced a trap composed of 117 places in 127 ms of which 1 ms to minimize.
[2023-03-12 17:36:09] [INFO ] Deduced a trap composed of 120 places in 113 ms of which 1 ms to minimize.
[2023-03-12 17:36:09] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 0 ms to minimize.
[2023-03-12 17:36:10] [INFO ] Deduced a trap composed of 130 places in 118 ms of which 1 ms to minimize.
[2023-03-12 17:36:10] [INFO ] Deduced a trap composed of 117 places in 138 ms of which 1 ms to minimize.
[2023-03-12 17:36:10] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 1 ms to minimize.
[2023-03-12 17:36:10] [INFO ] Deduced a trap composed of 120 places in 121 ms of which 0 ms to minimize.
[2023-03-12 17:36:11] [INFO ] Deduced a trap composed of 119 places in 190 ms of which 1 ms to minimize.
[2023-03-12 17:36:12] [INFO ] Deduced a trap composed of 118 places in 147 ms of which 0 ms to minimize.
[2023-03-12 17:36:12] [INFO ] Deduced a trap composed of 121 places in 128 ms of which 0 ms to minimize.
[2023-03-12 17:36:12] [INFO ] Deduced a trap composed of 117 places in 160 ms of which 0 ms to minimize.
[2023-03-12 17:36:12] [INFO ] Deduced a trap composed of 120 places in 153 ms of which 1 ms to minimize.
[2023-03-12 17:36:13] [INFO ] Deduced a trap composed of 109 places in 101 ms of which 0 ms to minimize.
[2023-03-12 17:36:13] [INFO ] Deduced a trap composed of 106 places in 140 ms of which 1 ms to minimize.
[2023-03-12 17:36:14] [INFO ] Deduced a trap composed of 125 places in 109 ms of which 1 ms to minimize.
[2023-03-12 17:36:14] [INFO ] Deduced a trap composed of 131 places in 117 ms of which 0 ms to minimize.
[2023-03-12 17:36:16] [INFO ] Trap strengthening (SAT) tested/added 86/86 trap constraints in 22081 ms
[2023-03-12 17:36:16] [INFO ] After 24795ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-12 17:36:16] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 85 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 517 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 517 transition count 426
Reduce places removed 45 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 59 rules applied. Total rules applied 105 place count 472 transition count 412
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 119 place count 458 transition count 412
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 119 place count 458 transition count 329
Deduced a syphon composed of 83 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 295 place count 365 transition count 329
Discarding 45 places :
Symmetric choice reduction at 3 with 45 rule applications. Total rules 340 place count 320 transition count 284
Iterating global reduction 3 with 45 rules applied. Total rules applied 385 place count 320 transition count 284
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 517 place count 254 transition count 218
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 518 place count 254 transition count 217
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 523 place count 254 transition count 217
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 524 place count 253 transition count 216
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 252 transition count 216
Applied a total of 525 rules in 191 ms. Remains 252 /518 variables (removed 266) and now considering 216/471 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 252/518 places, 216/471 transitions.
Incomplete random walk after 10000 steps, including 202 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1058185 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :{1=1}
Probabilistic random walk after 1058185 steps, saw 151674 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 216 rows 252 cols
[2023-03-12 17:36:20] [INFO ] Computed 73 place invariants in 13 ms
[2023-03-12 17:36:20] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 17:36:20] [INFO ] [Nat]Absence check using 45 positive place invariants in 6 ms returned sat
[2023-03-12 17:36:20] [INFO ] [Nat]Absence check using 45 positive and 28 generalized place invariants in 8 ms returned sat
[2023-03-12 17:36:20] [INFO ] After 108ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 17:36:20] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 208 ms
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 1 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 0 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 43 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 47 places in 67 ms of which 0 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2023-03-12 17:36:21] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 46 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 0 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 0 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 0 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 0 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 0 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 0 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 47 places in 88 ms of which 0 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 0 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 1 ms to minimize.
[2023-03-12 17:36:22] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2023-03-12 17:36:23] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 0 ms to minimize.
[2023-03-12 17:36:23] [INFO ] Deduced a trap composed of 47 places in 58 ms of which 0 ms to minimize.
[2023-03-12 17:36:23] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 0 ms to minimize.
[2023-03-12 17:36:23] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2023-03-12 17:36:23] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2106 ms
[2023-03-12 17:36:23] [INFO ] After 2480ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-12 17:36:23] [INFO ] After 2629ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 27 ms.
Support contains 42 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 216/216 transitions.
Graph (trivial) has 45 edges and 252 vertex of which 2 / 252 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 251 transition count 203
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 240 transition count 202
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 239 transition count 202
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 25 place count 239 transition count 194
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 42 place count 230 transition count 194
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 44 place count 228 transition count 192
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 228 transition count 192
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 89 place count 206 transition count 171
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 204 transition count 172
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 204 transition count 170
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 97 place count 202 transition count 170
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 201 transition count 169
Applied a total of 98 rules in 62 ms. Remains 201 /252 variables (removed 51) and now considering 169/216 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 201/252 places, 169/216 transitions.
Incomplete random walk after 10000 steps, including 172 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 169 rows 201 cols
[2023-03-12 17:36:23] [INFO ] Computed 71 place invariants in 5 ms
[2023-03-12 17:36:23] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 17:36:23] [INFO ] [Nat]Absence check using 43 positive place invariants in 11 ms returned sat
[2023-03-12 17:36:23] [INFO ] [Nat]Absence check using 43 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-12 17:36:23] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 17:36:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-12 17:36:23] [INFO ] After 18ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 17:36:23] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2023-03-12 17:36:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2023-03-12 17:36:23] [INFO ] After 129ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-12 17:36:23] [INFO ] After 348ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 12 out of 201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 201/201 places, 169/169 transitions.
Graph (complete) has 645 edges and 201 vertex of which 200 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 200 transition count 163
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 195 transition count 163
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 11 place count 195 transition count 156
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 27 place count 186 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 185 transition count 154
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 185 transition count 154
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 67 place count 166 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 69 place count 165 transition count 152
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 165 transition count 152
Applied a total of 70 rules in 44 ms. Remains 165 /201 variables (removed 36) and now considering 152/169 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 165/201 places, 152/169 transitions.
Incomplete random walk after 10000 steps, including 444 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Finished Best-First random walk after 2152 steps, including 26 resets, run visited all 1 properties in 6 ms. (steps per millisecond=358 )
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 33922 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/890/inv_0_ --invariant=/tmp/890/inv_1_ --invariant=/tmp/890/inv_2_ --invariant=/tmp/890/inv_3_ --invariant=/tmp/890/inv_4_ --invariant=/tmp/890/inv_5_ --invariant=/tmp/890/inv_6_ --invariant=/tmp/890/inv_7_ --invariant=/tmp/890/inv_8_ --invariant=/tmp/890/inv_9_ --invariant=/tmp/890/inv_10_ --invariant=/tmp/890/inv_11_ --invariant=/tmp/890/inv_12_ --invariant=/tmp/890/inv_13_ --invariant=/tmp/890/inv_14_ --invariant=/tmp/890/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393356 kB
MemFree: 11882036 kB
After kill :
MemTotal: 16393356 kB
MemFree: 16103080 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:
++ 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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023

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-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-10, 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 r041-tajo-167813694800527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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