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

About the Execution of LTSMin+red for BusinessProcesses-PT-16

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9858.031 3600000.00 14314373.00 94.00 TTFTTTFTTFFFFFFF normal

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-167813694900574.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-16, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694900574
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.8K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 4.2K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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 159K 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-16-ReachabilityCardinality-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678647202880

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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:53:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:53:24] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-12 18:53:24] [INFO ] Transformed 638 places.
[2023-03-12 18:53:24] [INFO ] Transformed 578 transitions.
[2023-03-12 18:53:24] [INFO ] Found NUPN structural information;
[2023-03-12 18:53:24] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 67 resets, run finished after 486 ms. (steps per millisecond=20 ) properties (out of 13) seen :5
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 12 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 13 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 570 rows 630 cols
[2023-03-12 18:53:25] [INFO ] Computed 100 place invariants in 33 ms
[2023-03-12 18:53:26] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-12 18:53:26] [INFO ] [Nat]Absence check using 62 positive place invariants in 25 ms returned sat
[2023-03-12 18:53:26] [INFO ] [Nat]Absence check using 62 positive and 38 generalized place invariants in 13 ms returned sat
[2023-03-12 18:53:26] [INFO ] After 446ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :7
[2023-03-12 18:53:27] [INFO ] Deduced a trap composed of 130 places in 174 ms of which 7 ms to minimize.
[2023-03-12 18:53:27] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 1 ms to minimize.
[2023-03-12 18:53:27] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 1 ms to minimize.
[2023-03-12 18:53:27] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:53:27] [INFO ] Deduced a trap composed of 28 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:53:28] [INFO ] Deduced a trap composed of 37 places in 138 ms of which 0 ms to minimize.
[2023-03-12 18:53:28] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 0 ms to minimize.
[2023-03-12 18:53:28] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 1 ms to minimize.
[2023-03-12 18:53:28] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:53:28] [INFO ] Deduced a trap composed of 51 places in 136 ms of which 1 ms to minimize.
[2023-03-12 18:53:28] [INFO ] Deduced a trap composed of 134 places in 127 ms of which 0 ms to minimize.
[2023-03-12 18:53:28] [INFO ] Deduced a trap composed of 144 places in 127 ms of which 0 ms to minimize.
[2023-03-12 18:53:29] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 1 ms to minimize.
[2023-03-12 18:53:29] [INFO ] Deduced a trap composed of 62 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:53:29] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 0 ms to minimize.
[2023-03-12 18:53:29] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 0 ms to minimize.
[2023-03-12 18:53:29] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 0 ms to minimize.
[2023-03-12 18:53:29] [INFO ] Deduced a trap composed of 28 places in 126 ms of which 0 ms to minimize.
[2023-03-12 18:53:29] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 3021 ms
[2023-03-12 18:53:30] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
[2023-03-12 18:53:30] [INFO ] Deduced a trap composed of 31 places in 154 ms of which 1 ms to minimize.
[2023-03-12 18:53:30] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 1 ms to minimize.
[2023-03-12 18:53:30] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2023-03-12 18:53:30] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 0 ms to minimize.
[2023-03-12 18:53:31] [INFO ] Deduced a trap composed of 130 places in 155 ms of which 1 ms to minimize.
[2023-03-12 18:53:31] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 0 ms to minimize.
[2023-03-12 18:53:31] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 0 ms to minimize.
[2023-03-12 18:53:31] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2023-03-12 18:53:31] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 1 ms to minimize.
[2023-03-12 18:53:31] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 0 ms to minimize.
[2023-03-12 18:53:31] [INFO ] Deduced a trap composed of 38 places in 84 ms of which 1 ms to minimize.
[2023-03-12 18:53:31] [INFO ] Deduced a trap composed of 33 places in 80 ms of which 0 ms to minimize.
[2023-03-12 18:53:31] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 0 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 1 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 0 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 0 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 32 places in 81 ms of which 1 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 0 ms to minimize.
[2023-03-12 18:53:32] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 0 ms to minimize.
[2023-03-12 18:53:33] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:53:33] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 1 ms to minimize.
[2023-03-12 18:53:33] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2023-03-12 18:53:33] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 0 ms to minimize.
[2023-03-12 18:53:33] [INFO ] Deduced a trap composed of 36 places in 68 ms of which 1 ms to minimize.
[2023-03-12 18:53:33] [INFO ] Deduced a trap composed of 47 places in 76 ms of which 1 ms to minimize.
[2023-03-12 18:53:33] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 1 ms to minimize.
[2023-03-12 18:53:33] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 0 ms to minimize.
[2023-03-12 18:53:33] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 1 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 1 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 1 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 1 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 1 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-12 18:53:34] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 1 ms to minimize.
[2023-03-12 18:53:35] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 0 ms to minimize.
[2023-03-12 18:53:35] [INFO ] Deduced a trap composed of 53 places in 91 ms of which 0 ms to minimize.
[2023-03-12 18:53:35] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:53:35] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 1 ms to minimize.
[2023-03-12 18:53:35] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 2 ms to minimize.
[2023-03-12 18:53:35] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 0 ms to minimize.
[2023-03-12 18:53:35] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2023-03-12 18:53:35] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 5 ms to minimize.
[2023-03-12 18:53:36] [INFO ] Deduced a trap composed of 65 places in 112 ms of which 1 ms to minimize.
[2023-03-12 18:53:36] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2023-03-12 18:53:36] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 0 ms to minimize.
[2023-03-12 18:53:36] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 0 ms to minimize.
[2023-03-12 18:53:36] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2023-03-12 18:53:36] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2023-03-12 18:53:36] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 0 ms to minimize.
[2023-03-12 18:53:36] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 0 ms to minimize.
[2023-03-12 18:53:37] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 0 ms to minimize.
[2023-03-12 18:53:37] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 0 ms to minimize.
[2023-03-12 18:53:37] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 0 ms to minimize.
[2023-03-12 18:53:37] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 0 ms to minimize.
[2023-03-12 18:53:37] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:53:37] [INFO ] Deduced a trap composed of 43 places in 87 ms of which 1 ms to minimize.
[2023-03-12 18:53:37] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2023-03-12 18:53:37] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2023-03-12 18:53:37] [INFO ] Deduced a trap composed of 55 places in 89 ms of which 0 ms to minimize.
[2023-03-12 18:53:38] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 0 ms to minimize.
[2023-03-12 18:53:38] [INFO ] Deduced a trap composed of 39 places in 92 ms of which 1 ms to minimize.
[2023-03-12 18:53:38] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
[2023-03-12 18:53:38] [INFO ] Deduced a trap composed of 56 places in 90 ms of which 1 ms to minimize.
[2023-03-12 18:53:38] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 0 ms to minimize.
[2023-03-12 18:53:38] [INFO ] Deduced a trap composed of 43 places in 95 ms of which 0 ms to minimize.
[2023-03-12 18:53:38] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 0 ms to minimize.
[2023-03-12 18:53:38] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 1 ms to minimize.
[2023-03-12 18:53:39] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 0 ms to minimize.
[2023-03-12 18:53:39] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 1 ms to minimize.
[2023-03-12 18:53:39] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 0 ms to minimize.
[2023-03-12 18:53:39] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 0 ms to minimize.
[2023-03-12 18:53:39] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2023-03-12 18:53:39] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 0 ms to minimize.
[2023-03-12 18:53:39] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 1 ms to minimize.
[2023-03-12 18:53:39] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2023-03-12 18:53:39] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 0 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 56 places in 85 ms of which 1 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 53 places in 87 ms of which 1 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 1 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 0 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 33 places in 78 ms of which 0 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 0 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 76 places in 75 ms of which 0 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 0 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 39 places in 64 ms of which 1 ms to minimize.
[2023-03-12 18:53:40] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 1 ms to minimize.
[2023-03-12 18:53:41] [INFO ] Deduced a trap composed of 55 places in 61 ms of which 1 ms to minimize.
[2023-03-12 18:53:41] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2023-03-12 18:53:41] [INFO ] Deduced a trap composed of 51 places in 71 ms of which 0 ms to minimize.
[2023-03-12 18:53:41] [INFO ] Deduced a trap composed of 128 places in 141 ms of which 0 ms to minimize.
[2023-03-12 18:53:41] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 0 ms to minimize.
[2023-03-12 18:53:41] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 1 ms to minimize.
[2023-03-12 18:53:42] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:53:42] [INFO ] Deduced a trap composed of 133 places in 174 ms of which 1 ms to minimize.
[2023-03-12 18:53:42] [INFO ] Deduced a trap composed of 51 places in 154 ms of which 0 ms to minimize.
[2023-03-12 18:53:42] [INFO ] Deduced a trap composed of 57 places in 149 ms of which 1 ms to minimize.
[2023-03-12 18:53:42] [INFO ] Deduced a trap composed of 55 places in 152 ms of which 1 ms to minimize.
[2023-03-12 18:53:42] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 0 ms to minimize.
[2023-03-12 18:53:43] [INFO ] Deduced a trap composed of 61 places in 166 ms of which 1 ms to minimize.
[2023-03-12 18:53:43] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2023-03-12 18:53:43] [INFO ] Deduced a trap composed of 163 places in 134 ms of which 1 ms to minimize.
[2023-03-12 18:53:43] [INFO ] Deduced a trap composed of 122 places in 161 ms of which 1 ms to minimize.
[2023-03-12 18:53:43] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 0 ms to minimize.
[2023-03-12 18:53:43] [INFO ] Deduced a trap composed of 22 places in 136 ms of which 1 ms to minimize.
[2023-03-12 18:53:44] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:53:44] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 0 ms to minimize.
[2023-03-12 18:53:44] [INFO ] Deduced a trap composed of 137 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:53:44] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 0 ms to minimize.
[2023-03-12 18:53:44] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 1 ms to minimize.
[2023-03-12 18:53:44] [INFO ] Deduced a trap composed of 50 places in 145 ms of which 0 ms to minimize.
[2023-03-12 18:53:44] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 0 ms to minimize.
[2023-03-12 18:53:45] [INFO ] Deduced a trap composed of 132 places in 148 ms of which 0 ms to minimize.
[2023-03-12 18:53:45] [INFO ] Deduced a trap composed of 122 places in 131 ms of which 0 ms to minimize.
[2023-03-12 18:53:45] [INFO ] Deduced a trap composed of 131 places in 132 ms of which 1 ms to minimize.
[2023-03-12 18:53:45] [INFO ] Deduced a trap composed of 42 places in 144 ms of which 0 ms to minimize.
[2023-03-12 18:53:45] [INFO ] Deduced a trap composed of 132 places in 131 ms of which 2 ms to minimize.
[2023-03-12 18:53:45] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 1 ms to minimize.
[2023-03-12 18:53:46] [INFO ] Deduced a trap composed of 121 places in 143 ms of which 1 ms to minimize.
[2023-03-12 18:53:46] [INFO ] Deduced a trap composed of 124 places in 147 ms of which 1 ms to minimize.
[2023-03-12 18:53:46] [INFO ] Deduced a trap composed of 150 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:53:46] [INFO ] Deduced a trap composed of 131 places in 139 ms of which 1 ms to minimize.
[2023-03-12 18:53:46] [INFO ] Deduced a trap composed of 130 places in 175 ms of which 0 ms to minimize.
[2023-03-12 18:53:47] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 0 ms to minimize.
[2023-03-12 18:53:47] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2023-03-12 18:53:47] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 1 ms to minimize.
[2023-03-12 18:53:47] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 0 ms to minimize.
[2023-03-12 18:53:47] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 0 ms to minimize.
[2023-03-12 18:53:47] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 1 ms to minimize.
[2023-03-12 18:53:48] [INFO ] Deduced a trap composed of 38 places in 150 ms of which 0 ms to minimize.
[2023-03-12 18:53:48] [INFO ] Deduced a trap composed of 125 places in 154 ms of which 1 ms to minimize.
[2023-03-12 18:53:48] [INFO ] Deduced a trap composed of 123 places in 144 ms of which 0 ms to minimize.
[2023-03-12 18:53:48] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 0 ms to minimize.
[2023-03-12 18:53:48] [INFO ] Deduced a trap composed of 55 places in 136 ms of which 0 ms to minimize.
[2023-03-12 18:53:49] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 1 ms to minimize.
[2023-03-12 18:53:49] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 1 ms to minimize.
[2023-03-12 18:53:49] [INFO ] Deduced a trap composed of 23 places in 169 ms of which 1 ms to minimize.
[2023-03-12 18:53:49] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 1 ms to minimize.
[2023-03-12 18:53:49] [INFO ] Deduced a trap composed of 129 places in 155 ms of which 0 ms to minimize.
[2023-03-12 18:53:49] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 1 ms to minimize.
[2023-03-12 18:53:50] [INFO ] Deduced a trap composed of 126 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:53:50] [INFO ] Deduced a trap composed of 159 places in 136 ms of which 0 ms to minimize.
[2023-03-12 18:53:50] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:53:50] [INFO ] Deduced a trap composed of 128 places in 133 ms of which 1 ms to minimize.
[2023-03-12 18:53:50] [INFO ] Deduced a trap composed of 139 places in 136 ms of which 0 ms to minimize.
[2023-03-12 18:53:50] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 0 ms to minimize.
[2023-03-12 18:53:51] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 0 ms to minimize.
[2023-03-12 18:53:51] [INFO ] Deduced a trap composed of 41 places in 154 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:902)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-12 18:53:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-12 18:53:51] [INFO ] After 25120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:8
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 120 ms.
Support contains 45 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (trivial) has 324 edges and 630 vertex of which 7 / 630 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1283 edges and 624 vertex of which 618 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 122 place count 618 transition count 441
Reduce places removed 120 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 128 rules applied. Total rules applied 250 place count 498 transition count 433
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 258 place count 490 transition count 433
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 85 Pre rules applied. Total rules applied 258 place count 490 transition count 348
Deduced a syphon composed of 85 places in 2 ms
Ensure Unique test removed 12 places
Reduce places removed 97 places and 0 transitions.
Iterating global reduction 3 with 182 rules applied. Total rules applied 440 place count 393 transition count 348
Discarding 76 places :
Symmetric choice reduction at 3 with 76 rule applications. Total rules 516 place count 317 transition count 272
Iterating global reduction 3 with 76 rules applied. Total rules applied 592 place count 317 transition count 272
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 592 place count 317 transition count 266
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 605 place count 310 transition count 266
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 769 place count 227 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 771 place count 226 transition count 189
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 773 place count 226 transition count 187
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 775 place count 224 transition count 187
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 776 place count 224 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 777 place count 223 transition count 186
Applied a total of 777 rules in 167 ms. Remains 223 /630 variables (removed 407) and now considering 186/570 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 168 ms. Remains : 223/630 places, 186/570 transitions.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 7) seen :6
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 641 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=213 )
FORMULA BusinessProcesses-PT-16-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 27145 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/993/inv_0_ --invariant=/tmp/993/inv_1_ --invariant=/tmp/993/inv_2_ --invariant=/tmp/993/inv_3_ --invariant=/tmp/993/inv_4_ --invariant=/tmp/993/inv_5_ --invariant=/tmp/993/inv_6_ --invariant=/tmp/993/inv_7_ --invariant=/tmp/993/inv_8_ --invariant=/tmp/993/inv_9_ --invariant=/tmp/993/inv_10_ --invariant=/tmp/993/inv_11_ --invariant=/tmp/993/inv_12_ --invariant=/tmp/993/inv_13_ --invariant=/tmp/993/inv_14_ --invariant=/tmp/993/inv_15_ --inv-par
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 6289788 kB
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 16100224 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101272 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 ReachabilityCardinality -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-16"
export BK_EXAMINATION="ReachabilityCardinality"
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-16, 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 r041-tajo-167813694900574"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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