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.r400-tall-171690532200368.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 itstools
Input is StigmergyElection-PT-09a, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200368
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 19:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 19:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 17M May 18 16:43 model.pnml

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

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

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1717014409325

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-29 20:26:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 20:26:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:26:51] [INFO ] Load time of PNML (sax parser for PT used): 838 ms
[2024-05-29 20:26:51] [INFO ] Transformed 128 places.
[2024-05-29 20:26:51] [INFO ] Transformed 18490 transitions.
[2024-05-29 20:26:51] [INFO ] Found NUPN structural information;
[2024-05-29 20:26:51] [INFO ] Parsed PT model containing 128 places and 18490 transitions and 329609 arcs in 1043 ms.
Ensure Unique test removed 17099 transitions
Reduce redundant transitions removed 17323 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 128/128 places, 1167/1167 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
[2024-05-29 20:26:52] [INFO ] Redundant transitions in 96 ms returned []
Running 1148 sub problems to find dead transitions.
// Phase 1: matrix 1149 rows 128 cols
[2024-05-29 20:26:52] [INFO ] Computed 10 invariants in 34 ms
[2024-05-29 20:26:52] [INFO ] State equation strengthened by 1065 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
At refinement iteration 2 (OVERLAPS) 10/128 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 10/138 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 12 places in 339 ms of which 9 ms to minimize.
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 1 ms to minimize.
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 2 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 1 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 12 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:27:17] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:27:18] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/158 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:27:19] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 12 places in 127 ms of which 2 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 3 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 0 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:27:21] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:27:22] [INFO ] Deduced a trap composed of 12 places in 175 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:27:23] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 1 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2024-05-29 20:27:24] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 13 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 12 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 20:27:29] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:27:30] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 ms to minimize.
[2024-05-29 20:27:30] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:27:30] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2024-05-29 20:27:30] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:27:30] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:27:31] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:27:33] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:27:33] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:27:33] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:27:33] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:27:33] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:27:35] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:27:35] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:27:35] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:27:35] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 20/258 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 128/1277 variables, and 258 constraints, problems are : Problem set: 0 solved, 1148 unsolved in 30034 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/128 constraints, ReadFeed: 0/1065 constraints, PredecessorRefiner: 1148/117 constraints, Known Traps: 120/120 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1148 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 118/118 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
At refinement iteration 2 (OVERLAPS) 10/128 variables, 10/128 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 10/138 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 120/258 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:27:41] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:27:41] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:27:41] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
[2024-05-29 20:27:42] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:27:42] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:27:42] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 3 ms to minimize.
[2024-05-29 20:27:42] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:27:42] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:27:42] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:27:42] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:27:42] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:27:43] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:27:43] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 13/271 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:27:48] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:27:48] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:27:48] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:27:48] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:27:48] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:27:48] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:27:48] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:27:49] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:27:49] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 9/280 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:27:54] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:27:54] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:27:55] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:27:55] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:27:55] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 5/285 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:28:00] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:28:00] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:28:00] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:28:00] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1148 unsolved
[2024-05-29 20:28:06] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 128/1277 variables, and 290 constraints, problems are : Problem set: 0 solved, 1148 unsolved in 30019 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/128 constraints, ReadFeed: 0/1065 constraints, PredecessorRefiner: 1031/117 constraints, Known Traps: 152/152 constraints]
After SMT, in 75272ms problems are : Problem set: 0 solved, 1148 unsolved
Search for dead transitions found 0 dead transitions in 75323ms
Starting structural reductions in STATESPACE mode, iteration 1 : 128/128 places, 1149/1167 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 75959 ms. Remains : 128/128 places, 1149/1167 transitions.
Final net has 128 places and 1149 transitions.
[2024-05-29 20:28:07] [INFO ] Flatten gal took : 196 ms
[2024-05-29 20:28:08] [INFO ] Applying decomposition
[2024-05-29 20:28:08] [INFO ] Flatten gal took : 84 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9872356376944013849.txt' '-o' '/tmp/graph9872356376944013849.bin' '-w' '/tmp/graph9872356376944013849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9872356376944013849.bin' '-l' '-1' '-v' '-w' '/tmp/graph9872356376944013849.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:28:08] [INFO ] Decomposing Gal with order
[2024-05-29 20:28:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:28:08] [INFO ] Removed a total of 9271 redundant transitions.
[2024-05-29 20:28:08] [INFO ] Flatten gal took : 373 ms
[2024-05-29 20:28:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 65 ms.
[2024-05-29 20:28:09] [INFO ] Time to serialize gal into /tmp/StateSpace6494992116690435053.gal : 22 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace6494992116690435053.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.23499e+06,264.745,2843132,16785,36,381727,497,1211,3.65334e+07,44,2527,0
Total reachable state count : 2234987

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 10
STATE_SPACE MAX_TOKEN_PER_MARKING 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 2234987
STATE_SPACE STATES 2234987 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 343820 ms.

BK_STOP 1717014754250

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="StigmergyElection-PT-09a"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-09a, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532200368"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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