fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r226-smll-174903491000248
Last Updated
June 24, 2025

About the Execution of ITS-Tools for StigmergyElection-PT-07a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 77429.00 0.00 0.00 96723 ? 1 8 normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r226-smll-174903491000248.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is StigmergyElection-PT-07a, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r226-smll-174903491000248
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 14:33 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 1749156446895

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-07a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202505121319
[2025-06-05 20:47:29] [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]
[2025-06-05 20:47:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 20:47:30] [INFO ] Load time of PNML (sax parser for PT used): 654 ms
[2025-06-05 20:47:30] [INFO ] Transformed 100 places.
[2025-06-05 20:47:30] [INFO ] Transformed 2618 transitions.
[2025-06-05 20:47:30] [INFO ] Found NUPN structural information;
[2025-06-05 20:47:30] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 987 ms.
Ensure Unique test removed 2147 transitions
Reduce redundant transitions removed 2251 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 100/100 places, 367/367 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 20:47:30] [INFO ] Redundant transitions in 30 ms returned []
Running 352 sub problems to find dead transitions.
// Phase 1: matrix 353 rows 100 cols
[2025-06-05 20:47:30] [INFO ] Computed 8 invariants in 21 ms
[2025-06-05 20:47:31] [INFO ] State equation strengthened by 287 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (OVERLAPS) 8/100 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:39] [INFO ] Deduced a trap composed of 12 places in 358 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:39] [INFO ] Deduced a trap composed of 12 places in 228 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:40] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:40] [INFO ] Deduced a trap composed of 12 places in 147 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:40] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:40] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:40] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:40] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:40] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:41] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:41] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:41] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:41] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:41] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:41] [INFO ] Deduced a trap composed of 12 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:41] [INFO ] Deduced a trap composed of 12 places in 108 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:41] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:42] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:43] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:43] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:43] [INFO ] Deduced a trap composed of 12 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:43] [INFO ] Deduced a trap composed of 12 places in 171 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:43] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:43] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:44] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:45] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:45] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:45] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:45] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:45] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:45] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:46] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:46] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:46] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:46] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:46] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:46] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:46] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:46] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:47] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:47] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:47] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:47] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:47] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:47] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:49] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:49] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:50] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:50] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:50] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:50] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:50] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:50] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:50] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:50] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:51] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:51] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 12/180 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:53] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:53] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:54] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:54] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:54] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:54] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:54] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:57] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:47:57] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 2/189 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:01] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:01] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 100/453 variables, and 191 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30038 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/100 constraints, ReadFeed: 0/287 constraints, PredecessorRefiner: 352/91 constraints, Known Traps: 83/83 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 92/92 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 2 (OVERLAPS) 8/100 variables, 8/100 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 83/191 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:05] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:05] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 7 (OVERLAPS) 353/453 variables, 100/293 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/453 variables, 287/580 constraints. Problems are: Problem set: 0 solved, 352 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 91/671 constraints. Problems are: Problem set: 0 solved, 352 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:29] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 20:48:29] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/453 variables, and 673 constraints, problems are : Problem set: 0 solved, 352 unsolved in 30026 ms.
Refiners :[Domain max(s): 100/100 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 100/100 constraints, ReadFeed: 287/287 constraints, PredecessorRefiner: 352/91 constraints, Known Traps: 87/87 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61535ms problems are : Problem set: 0 solved, 352 unsolved
Search for dead transitions found 0 dead transitions in 61571ms
Starting structural reductions in STATESPACE mode, iteration 1 : 100/100 places, 353/367 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 61835 ms. Remains : 100/100 places, 353/367 transitions.
Final net has 100 places and 353 transitions.
[2025-06-05 20:48:32] [INFO ] Flatten gal took : 161 ms
[2025-06-05 20:48:33] [INFO ] Applying decomposition
[2025-06-05 20:48:33] [INFO ] Flatten gal took : 58 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16677435718051236059.txt' '-o' '/tmp/graph16677435718051236059.bin' '-w' '/tmp/graph16677435718051236059.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16677435718051236059.bin' '-l' '-1' '-v' '-w' '/tmp/graph16677435718051236059.weights' '-q' '0' '-e' '0.001'
[2025-06-05 20:48:33] [INFO ] Decomposing Gal with order
[2025-06-05 20:48:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 20:48:33] [INFO ] Removed a total of 1821 redundant transitions.
[2025-06-05 20:48:33] [INFO ] Flatten gal took : 189 ms
[2025-06-05 20:48:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 41 ms.
[2025-06-05 20:48:33] [INFO ] Time to serialize gal into /tmp/StateSpace4572896102328944415.gal : 12 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace4572896102328944415.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/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,96723,10.4207,175864,3261,31,71153,364,606,1.89896e+06,41,1634,0
Total reachable state count : 96723

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

BK_STOP 1749156524324

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-07a"
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-5832"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-07a, 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 r226-smll-174903491000248"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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