Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r542-smll-171690581300101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is TokenRing-PT-010, examination is ReachabilityDeadlock
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r542-smll-171690581300101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 125K Apr 11 19:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 687K Apr 11 19:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 900K Apr 11 19:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 11 19:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 57K Apr 23 08:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 08:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 436K Apr 23 08:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 08:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 212K Apr 11 19:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 11 19:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.3M Apr 11 19:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.6M Apr 11 19:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 23 08:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 35K Apr 23 08:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 519K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME ReachabilityDeadlock

=== Now, execution of the tool begins

BK_START 1717250801505

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityDeadlock
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=TokenRing-PT-010
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:06:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -timeout, 180, -rebuildPNML]
[2024-06-01 14:06:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:06:44] [INFO ] Load time of PNML (sax parser for PT used): 350 ms
[2024-06-01 14:06:44] [INFO ] Transformed 121 places.
[2024-06-01 14:06:44] [INFO ] Transformed 1111 transitions.
[2024-06-01 14:06:44] [INFO ] Found NUPN structural information;
[2024-06-01 14:06:44] [INFO ] Parsed PT model containing 121 places and 1111 transitions and 4444 arcs in 537 ms.
Parsed 1 properties from file /home/mcc/execution/ReachabilityDeadlock.xml in 8 ms.
Working with output stream class java.io.PrintStream
Built sparse matrix representations for Structural reductions in 7 ms.16337KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 173 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 195 ms. Remains : 121/121 places, 1111/1111 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 121/121 places, 1111/1111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 138 ms. Remains 121 /121 variables (removed 0) and now considering 1111/1111 (removed 0) transitions.
// Phase 1: matrix 1111 rows 121 cols
[2024-06-01 14:06:44] [INFO ] Computed 11 invariants in 74 ms
[2024-06-01 14:06:45] [INFO ] Implicit Places using invariants in 740 ms returned []
[2024-06-01 14:06:45] [INFO ] Invariant cache hit.
[2024-06-01 14:06:45] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2024-06-01 14:06:47] [INFO ] Implicit Places using invariants and state equation in 1777 ms returned []
Implicit Place search using SMT with State Equation took 2603 ms to find 0 implicit places.
[2024-06-01 14:06:47] [INFO ] Redundant transitions in 88 ms returned []
Running 1101 sub problems to find dead transitions.
[2024-06-01 14:06:47] [INFO ] Invariant cache hit.
[2024-06-01 14:06:47] [INFO ] State equation strengthened by 1010 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:06:55] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 23 ms to minimize.
[2024-06-01 14:06:56] [INFO ] Deduced a trap composed of 67 places in 256 ms of which 3 ms to minimize.
[2024-06-01 14:06:56] [INFO ] Deduced a trap composed of 66 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:06:56] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:06:56] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:06:56] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 2 ms to minimize.
[2024-06-01 14:06:57] [INFO ] Deduced a trap composed of 66 places in 209 ms of which 3 ms to minimize.
[2024-06-01 14:06:57] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 3 ms to minimize.
[2024-06-01 14:06:57] [INFO ] Deduced a trap composed of 65 places in 205 ms of which 3 ms to minimize.
[2024-06-01 14:06:57] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:06:57] [INFO ] Deduced a trap composed of 65 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:06:58] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 2 ms to minimize.
[2024-06-01 14:06:58] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2024-06-01 14:06:58] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:06:58] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:06:58] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 2 ms to minimize.
[2024-06-01 14:06:59] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 2 ms to minimize.
[2024-06-01 14:06:59] [INFO ] Deduced a trap composed of 63 places in 170 ms of which 2 ms to minimize.
[2024-06-01 14:06:59] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-06-01 14:06:59] [INFO ] Deduced a trap composed of 66 places in 239 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:07:00] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 2 ms to minimize.
[2024-06-01 14:07:00] [INFO ] Deduced a trap composed of 65 places in 159 ms of which 3 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 66 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:07:01] [INFO ] Deduced a trap composed of 64 places in 205 ms of which 2 ms to minimize.
[2024-06-01 14:07:02] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 3 ms to minimize.
[2024-06-01 14:07:02] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:07:02] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:07:02] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:07:02] [INFO ] Deduced a trap composed of 68 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:07:03] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:07:03] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:07:03] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:07:03] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:07:03] [INFO ] Deduced a trap composed of 65 places in 244 ms of which 3 ms to minimize.
[2024-06-01 14:07:04] [INFO ] Deduced a trap composed of 65 places in 247 ms of which 3 ms to minimize.
[2024-06-01 14:07:04] [INFO ] Deduced a trap composed of 65 places in 233 ms of which 1 ms to minimize.
[2024-06-01 14:07:04] [INFO ] Deduced a trap composed of 65 places in 249 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:07:10] [INFO ] Deduced a trap composed of 65 places in 206 ms of which 2 ms to minimize.
[2024-06-01 14:07:10] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:07:11] [INFO ] Deduced a trap composed of 68 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:07:11] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:07:11] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-06-01 14:07:11] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 2 ms to minimize.
[2024-06-01 14:07:12] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:07:12] [INFO ] Deduced a trap composed of 67 places in 251 ms of which 2 ms to minimize.
[2024-06-01 14:07:12] [INFO ] Deduced a trap composed of 67 places in 244 ms of which 2 ms to minimize.
[2024-06-01 14:07:12] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 1 ms to minimize.
[2024-06-01 14:07:12] [INFO ] Deduced a trap composed of 68 places in 202 ms of which 4 ms to minimize.
[2024-06-01 14:07:13] [INFO ] Deduced a trap composed of 67 places in 201 ms of which 2 ms to minimize.
[2024-06-01 14:07:13] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:07:13] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:07:13] [INFO ] Deduced a trap composed of 67 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:07:13] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:07:14] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 4 ms to minimize.
[2024-06-01 14:07:14] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:07:14] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 2 ms to minimize.
[2024-06-01 14:07:14] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:07:16] [INFO ] Deduced a trap composed of 68 places in 242 ms of which 2 ms to minimize.
[2024-06-01 14:07:16] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 2 ms to minimize.
[2024-06-01 14:07:16] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:07:16] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:07:17] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:07:17] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 2 ms to minimize.
[2024-06-01 14:07:17] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-06-01 14:07:17] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:07:17] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:07:18] [INFO ] Deduced a trap composed of 67 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:07:18] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:07:18] [INFO ] Deduced a trap composed of 64 places in 234 ms of which 2 ms to minimize.
[2024-06-01 14:07:18] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 121/1232 variables, and 205 constraints, problems are : Problem set: 0 solved, 1101 unsolved in 30066 ms.
Refiners :[Domain max(s): 121/121 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/121 constraints, ReadFeed: 0/1010 constraints, PredecessorRefiner: 1101/1101 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 11/132 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 73/205 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 68 places in 152 ms of which 2 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:07:21] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 2 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 2 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:07:22] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 1 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 2 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 65 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:07:23] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 2 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 64 places in 249 ms of which 2 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 67 places in 213 ms of which 2 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:07:24] [INFO ] Deduced a trap composed of 69 places in 259 ms of which 2 ms to minimize.
[2024-06-01 14:07:25] [INFO ] Deduced a trap composed of 69 places in 257 ms of which 3 ms to minimize.
[2024-06-01 14:07:25] [INFO ] Deduced a trap composed of 64 places in 220 ms of which 1 ms to minimize.
[2024-06-01 14:07:25] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/121 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 1 ms to minimize.
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 1 ms to minimize.
[2024-06-01 14:07:27] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 1 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 2 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 1 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 64 places in 255 ms of which 3 ms to minimize.
[2024-06-01 14:07:28] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 3 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 3 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:07:29] [INFO ] Deduced a trap composed of 68 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:07:30] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:07:30] [INFO ] Deduced a trap composed of 65 places in 165 ms of which 3 ms to minimize.
[2024-06-01 14:07:30] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 2 ms to minimize.
[2024-06-01 14:07:30] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:07:30] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 2 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 3 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 2 ms to minimize.
[2024-06-01 14:07:31] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 20/245 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:07:33] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:07:33] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:07:33] [INFO ] Deduced a trap composed of 63 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:07:33] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:07:34] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:07:34] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:07:34] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:07:34] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 3 ms to minimize.
[2024-06-01 14:07:34] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 3 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 63 places in 182 ms of which 2 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 2 ms to minimize.
[2024-06-01 14:07:35] [INFO ] Deduced a trap composed of 65 places in 187 ms of which 3 ms to minimize.
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 70 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 2 ms to minimize.
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 64 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:07:36] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 3 ms to minimize.
[2024-06-01 14:07:37] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 3 ms to minimize.
[2024-06-01 14:07:37] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:07:39] [INFO ] Deduced a trap composed of 67 places in 202 ms of which 3 ms to minimize.
[2024-06-01 14:07:39] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:07:39] [INFO ] Deduced a trap composed of 68 places in 190 ms of which 2 ms to minimize.
[2024-06-01 14:07:40] [INFO ] Deduced a trap composed of 68 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:07:40] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 2 ms to minimize.
[2024-06-01 14:07:40] [INFO ] Deduced a trap composed of 67 places in 226 ms of which 3 ms to minimize.
[2024-06-01 14:07:40] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 1 ms to minimize.
[2024-06-01 14:07:41] [INFO ] Deduced a trap composed of 66 places in 269 ms of which 4 ms to minimize.
[2024-06-01 14:07:41] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 2 ms to minimize.
[2024-06-01 14:07:41] [INFO ] Deduced a trap composed of 66 places in 198 ms of which 5 ms to minimize.
[2024-06-01 14:07:41] [INFO ] Deduced a trap composed of 66 places in 222 ms of which 4 ms to minimize.
[2024-06-01 14:07:42] [INFO ] Deduced a trap composed of 66 places in 202 ms of which 2 ms to minimize.
[2024-06-01 14:07:42] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:07:42] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:07:42] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:07:42] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 1 ms to minimize.
[2024-06-01 14:07:43] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 3 ms to minimize.
[2024-06-01 14:07:43] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 2 ms to minimize.
[2024-06-01 14:07:43] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 1 ms to minimize.
[2024-06-01 14:07:43] [INFO ] Deduced a trap composed of 66 places in 230 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 1101 unsolved
[2024-06-01 14:07:46] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:07:46] [INFO ] Deduced a trap composed of 66 places in 196 ms of which 2 ms to minimize.
[2024-06-01 14:07:46] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:07:46] [INFO ] Deduced a trap composed of 65 places in 140 ms of which 1 ms to minimize.
[2024-06-01 14:07:47] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:07:47] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 2 ms to minimize.
[2024-06-01 14:07:47] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 3 ms to minimize.
[2024-06-01 14:07:47] [INFO ] Deduced a trap composed of 64 places in 195 ms of which 3 ms to minimize.
[2024-06-01 14:07:47] [INFO ] Deduced a trap composed of 65 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:07:48] [INFO ] Deduced a trap composed of 65 places in 194 ms of which 3 ms to minimize.
[2024-06-01 14:07:48] [INFO ] Deduced a trap composed of 66 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:07:48] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 2 ms to minimize.
[2024-06-01 14:07:48] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 2 ms to minimize.
[2024-06-01 14:07:48] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 2 ms to minimize.
[2024-06-01 14:07:49] [INFO ] Deduced a trap composed of 65 places in 168 ms of which 2 ms to minimize.
SMT process timed out in 61717ms, After SMT, problems are : Problem set: 0 solved, 1101 unsolved
Search for dead transitions found 0 dead transitions in 61768ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 64645 ms. Remains : 121/121 places, 1111/1111 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3753 ms (no deadlock found). (steps per millisecond=333 )
Random directed walk for 1250000 steps, including 0 resets, run took 3526 ms (no deadlock found). (steps per millisecond=354 )
[2024-06-01 14:07:56] [INFO ] Invariant cache hit.
[2024-06-01 14:07:56] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned unsat
FORMULA ReachabilityDeadlock FALSE TECHNIQUES TOPOLOGICAL SAT_SMT STRUCTURAL_REDUCTION
Total runtime 73047 ms.
ITS solved all properties within timeout

BK_STOP 1717250876730

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityDeadlock -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TokenRing-PT-010"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is TokenRing-PT-010, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r542-smll-171690581300101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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