fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r536-tall-171690532200378
Last Updated
July 7, 2024

About the Execution of LTSMin+red for StigmergyElection-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2399.623 115538.00 165818.00 451.70 ?????F?????????? normal

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.r536-tall-171690532200378.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 StigmergyElection-PT-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532200378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 19:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 19:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 19:27 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 50M 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

here is the order used to build the result vector(from text file)
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-00
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-01
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-02
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-03
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-04
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-05
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-06
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-07
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-08
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-09
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-10
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2024-11
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2023-12
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2023-13
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2023-14
FORMULA_NAME StigmergyElection-PT-10a-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717251317378

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:15:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:15:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:15:20] [INFO ] Load time of PNML (sax parser for PT used): 1933 ms
[2024-06-01 14:15:20] [INFO ] Transformed 142 places.
[2024-06-01 14:15:20] [INFO ] Transformed 50162 transitions.
[2024-06-01 14:15:20] [INFO ] Found NUPN structural information;
[2024-06-01 14:15:20] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 2397 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Support contains 13 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 123 transition count 2209
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 123 transition count 2209
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 113 transition count 2189
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 113 transition count 2189
Applied a total of 58 rules in 85 ms. Remains 113 /142 variables (removed 29) and now considering 2189/2238 (removed 49) transitions.
[2024-06-01 14:15:21] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-06-01 14:15:21] [INFO ] Computed 2 invariants in 34 ms
[2024-06-01 14:15:21] [INFO ] Implicit Places using invariants in 267 ms returned []
[2024-06-01 14:15:21] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-06-01 14:15:21] [INFO ] Invariant cache hit.
[2024-06-01 14:15:22] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-06-01 14:15:22] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1588 ms to find 0 implicit places.
Running 2188 sub problems to find dead transitions.
[2024-06-01 14:15:23] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-06-01 14:15:23] [INFO ] Invariant cache hit.
[2024-06-01 14:15:23] [INFO ] State equation strengthened by 2095 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-06-01 14:16:06] [INFO ] Deduced a trap composed of 10 places in 440 ms of which 10 ms to minimize.
[2024-06-01 14:16:06] [INFO ] Deduced a trap composed of 13 places in 423 ms of which 2 ms to minimize.
[2024-06-01 14:16:07] [INFO ] Deduced a trap composed of 12 places in 396 ms of which 1 ms to minimize.
[2024-06-01 14:16:07] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 1 ms to minimize.
[2024-06-01 14:16:08] [INFO ] Deduced a trap composed of 14 places in 439 ms of which 1 ms to minimize.
[2024-06-01 14:16:08] [INFO ] Deduced a trap composed of 10 places in 404 ms of which 1 ms to minimize.
[2024-06-01 14:16:08] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 1 ms to minimize.
[2024-06-01 14:16:09] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 1 ms to minimize.
[2024-06-01 14:16:09] [INFO ] Deduced a trap composed of 12 places in 361 ms of which 1 ms to minimize.
[2024-06-01 14:16:09] [INFO ] Deduced a trap composed of 12 places in 340 ms of which 1 ms to minimize.
[2024-06-01 14:16:10] [INFO ] Deduced a trap composed of 12 places in 400 ms of which 1 ms to minimize.
[2024-06-01 14:16:10] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 1 ms to minimize.
[2024-06-01 14:16:10] [INFO ] Deduced a trap composed of 13 places in 332 ms of which 1 ms to minimize.
[2024-06-01 14:16:11] [INFO ] Deduced a trap composed of 13 places in 397 ms of which 1 ms to minimize.
[2024-06-01 14:16:11] [INFO ] Deduced a trap composed of 10 places in 391 ms of which 1 ms to minimize.
[2024-06-01 14:16:12] [INFO ] Deduced a trap composed of 10 places in 331 ms of which 2 ms to minimize.
[2024-06-01 14:16:12] [INFO ] Deduced a trap composed of 10 places in 239 ms of which 1 ms to minimize.
[2024-06-01 14:16:12] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 0 ms to minimize.
[2024-06-01 14:16:12] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2024-06-01 14:16:13] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-06-01 14:16:13] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2024-06-01 14:16:13] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2024-06-01 14:16:14] [INFO ] Deduced a trap composed of 10 places in 211 ms of which 1 ms to minimize.
[2024-06-01 14:16:14] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 2 ms to minimize.
[2024-06-01 14:16:14] [INFO ] Deduced a trap composed of 12 places in 210 ms of which 1 ms to minimize.
[2024-06-01 14:16:14] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2024-06-01 14:16:14] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 1 ms to minimize.
[2024-06-01 14:16:15] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2024-06-01 14:16:15] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 0 ms to minimize.
[2024-06-01 14:16:15] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2024-06-01 14:16:15] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2024-06-01 14:16:16] [INFO ] Deduced a trap composed of 13 places in 364 ms of which 0 ms to minimize.
[2024-06-01 14:16:16] [INFO ] Deduced a trap composed of 13 places in 358 ms of which 1 ms to minimize.
[2024-06-01 14:16:16] [INFO ] Deduced a trap composed of 13 places in 296 ms of which 1 ms to minimize.
[2024-06-01 14:16:17] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 2 ms to minimize.
[2024-06-01 14:16:17] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 1 ms to minimize.
[2024-06-01 14:16:17] [INFO ] Deduced a trap composed of 13 places in 419 ms of which 1 ms to minimize.
[2024-06-01 14:16:18] [INFO ] Deduced a trap composed of 10 places in 425 ms of which 1 ms to minimize.
[2024-06-01 14:16:18] [INFO ] Deduced a trap composed of 12 places in 412 ms of which 1 ms to minimize.
[2024-06-01 14:16:19] [INFO ] Deduced a trap composed of 13 places in 413 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 113/2291 variables, and 42 constraints, problems are : Problem set: 0 solved, 2188 unsolved in 30066 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/113 constraints, ReadFeed: 0/2095 constraints, PredecessorRefiner: 2188/131 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2188 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
At refinement iteration 1 (OVERLAPS) 1/113 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 40/42 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-06-01 14:16:31] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 1 ms to minimize.
[2024-06-01 14:16:31] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 1 ms to minimize.
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 12 places in 370 ms of which 1 ms to minimize.
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 10 places in 368 ms of which 0 ms to minimize.
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 12 places in 366 ms of which 1 ms to minimize.
[2024-06-01 14:16:33] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 1 ms to minimize.
[2024-06-01 14:16:33] [INFO ] Deduced a trap composed of 10 places in 258 ms of which 1 ms to minimize.
[2024-06-01 14:16:33] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 1 ms to minimize.
[2024-06-01 14:16:34] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 1 ms to minimize.
[2024-06-01 14:16:34] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2024-06-01 14:16:34] [INFO ] Deduced a trap composed of 12 places in 254 ms of which 1 ms to minimize.
[2024-06-01 14:16:34] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 1 ms to minimize.
[2024-06-01 14:16:35] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2024-06-01 14:16:35] [INFO ] Deduced a trap composed of 10 places in 172 ms of which 1 ms to minimize.
[2024-06-01 14:16:35] [INFO ] Deduced a trap composed of 12 places in 255 ms of which 1 ms to minimize.
[2024-06-01 14:16:35] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
[2024-06-01 14:16:36] [INFO ] Deduced a trap composed of 10 places in 368 ms of which 4 ms to minimize.
[2024-06-01 14:16:36] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 0 ms to minimize.
[2024-06-01 14:16:36] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 1 ms to minimize.
[2024-06-01 14:16:36] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-06-01 14:16:37] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2024-06-01 14:16:37] [INFO ] Deduced a trap composed of 13 places in 260 ms of which 1 ms to minimize.
[2024-06-01 14:16:38] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-06-01 14:16:38] [INFO ] Deduced a trap composed of 10 places in 208 ms of which 1 ms to minimize.
[2024-06-01 14:16:38] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 1 ms to minimize.
[2024-06-01 14:16:38] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2024-06-01 14:16:39] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 1 ms to minimize.
[2024-06-01 14:16:39] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
[2024-06-01 14:16:39] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2024-06-01 14:16:39] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2024-06-01 14:16:39] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:16:39] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2024-06-01 14:16:40] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2024-06-01 14:16:40] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 0 ms to minimize.
[2024-06-01 14:16:40] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 0 ms to minimize.
[2024-06-01 14:16:40] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2024-06-01 14:16:40] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2024-06-01 14:16:41] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2024-06-01 14:16:41] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 1 ms to minimize.
[2024-06-01 14:16:41] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-06-01 14:16:42] [INFO ] Deduced a trap composed of 10 places in 204 ms of which 1 ms to minimize.
[2024-06-01 14:16:42] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2024-06-01 14:16:42] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-06-01 14:16:43] [INFO ] Deduced a trap composed of 10 places in 201 ms of which 1 ms to minimize.
[2024-06-01 14:16:43] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 1 ms to minimize.
[2024-06-01 14:16:43] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-06-01 14:16:43] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-06-01 14:16:43] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 0 ms to minimize.
[2024-06-01 14:16:44] [INFO ] Deduced a trap composed of 12 places in 351 ms of which 0 ms to minimize.
[2024-06-01 14:16:44] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:16:44] [INFO ] Deduced a trap composed of 10 places in 317 ms of which 1 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 0 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 10 places in 200 ms of which 1 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 1 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 1 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 0 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 0 ms to minimize.
[2024-06-01 14:16:46] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2024-06-01 14:16:46] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-06-01 14:16:47] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:16:48] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2024-06-01 14:16:48] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-06-01 14:16:48] [INFO ] Deduced a trap composed of 10 places in 165 ms of which 0 ms to minimize.
[2024-06-01 14:16:48] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-06-01 14:16:48] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-06-01 14:16:48] [INFO ] Deduced a trap composed of 10 places in 256 ms of which 1 ms to minimize.
[2024-06-01 14:16:49] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 1 ms to minimize.
[2024-06-01 14:16:49] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 1 ms to minimize.
[2024-06-01 14:16:49] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-06-01 14:16:49] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 1 ms to minimize.
[2024-06-01 14:16:49] [INFO ] Deduced a trap composed of 12 places in 161 ms of which 1 ms to minimize.
[2024-06-01 14:16:50] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2024-06-01 14:16:50] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:16:50] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-06-01 14:16:50] [INFO ] Deduced a trap composed of 13 places in 363 ms of which 0 ms to minimize.
[2024-06-01 14:16:51] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2024-06-01 14:16:51] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 1 ms to minimize.
[2024-06-01 14:16:51] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 0 ms to minimize.
[2024-06-01 14:16:51] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 2188 unsolved
[2024-06-01 14:16:53] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 0 ms to minimize.
[2024-06-01 14:16:53] [INFO ] Deduced a trap composed of 14 places in 257 ms of which 1 ms to minimize.
[2024-06-01 14:16:53] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 1 ms to minimize.
SMT process timed out in 90947ms, After SMT, problems are : Problem set: 0 solved, 2188 unsolved
Search for dead transitions found 0 dead transitions in 91020ms
Starting structural reductions in LTL mode, iteration 1 : 113/142 places, 2189/2238 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92758 ms. Remains : 113/142 places, 2189/2238 transitions.
Support contains 13 out of 113 places after structural reductions.
[2024-06-01 14:16:54] [INFO ] Flatten gal took : 335 ms
[2024-06-01 14:16:54] [INFO ] Flatten gal took : 172 ms
[2024-06-01 14:16:55] [INFO ] Input system was already deterministic with 2189 transitions.
Reduction of identical properties reduced properties to check from 17 to 9
RANDOM walk for 40000 steps (9 resets) in 5827 ms. (6 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 439 ms. (90 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
[2024-06-01 14:16:57] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-06-01 14:16:57] [INFO ] Invariant cache hit.
[2024-06-01 14:16:57] [INFO ] State equation strengthened by 2095 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp15 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 101/113 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2177/2290 variables, 113/115 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2290 variables, 2094/2209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2290 variables, 0/2209 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/2291 variables, 1/2210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2291 variables, 0/2210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/2291 variables, 0/2210 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2291/2291 variables, and 2210 constraints, problems are : Problem set: 3 solved, 2 unsolved in 772 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 2095/2095 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 1 (OVERLAPS) 101/113 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 14:16:58] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-06-01 14:16:58] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:16:58] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/113 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/113 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2177/2290 variables, 113/118 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2290 variables, 2094/2212 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2290 variables, 1/2213 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 14:16:59] [INFO ] Deduced a trap composed of 13 places in 385 ms of which 1 ms to minimize.
[2024-06-01 14:16:59] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 1 ms to minimize.
[2024-06-01 14:17:00] [INFO ] Deduced a trap composed of 10 places in 274 ms of which 1 ms to minimize.
[2024-06-01 14:17:00] [INFO ] Deduced a trap composed of 13 places in 273 ms of which 0 ms to minimize.
[2024-06-01 14:17:00] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2024-06-01 14:17:01] [INFO ] Deduced a trap composed of 11 places in 251 ms of which 0 ms to minimize.
[2024-06-01 14:17:01] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 1 ms to minimize.
[2024-06-01 14:17:01] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 0 ms to minimize.
[2024-06-01 14:17:01] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 0 ms to minimize.
[2024-06-01 14:17:01] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/2290 variables, 10/2223 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2290 variables, 0/2223 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/2291 variables, 1/2224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2291 variables, 0/2224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/2291 variables, 0/2224 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2291/2291 variables, and 2224 constraints, problems are : Problem set: 4 solved, 1 unsolved in 3950 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 2095/2095 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 5076ms problems are : Problem set: 4 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 7 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-06-01 14:17:02] [INFO ] Flatten gal took : 145 ms
[2024-06-01 14:17:02] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-10a-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:17:02] [INFO ] Flatten gal took : 181 ms
[2024-06-01 14:17:02] [INFO ] Input system was already deterministic with 2189 transitions.
Computed a total of 22 stabilizing places and 21 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 10 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-06-01 14:17:03] [INFO ] Flatten gal took : 127 ms
[2024-06-01 14:17:03] [INFO ] Flatten gal took : 128 ms
[2024-06-01 14:17:03] [INFO ] Input system was already deterministic with 2189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 10 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-06-01 14:17:03] [INFO ] Flatten gal took : 119 ms
[2024-06-01 14:17:03] [INFO ] Flatten gal took : 125 ms
[2024-06-01 14:17:04] [INFO ] Input system was already deterministic with 2189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 14 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-06-01 14:17:04] [INFO ] Flatten gal took : 117 ms
[2024-06-01 14:17:04] [INFO ] Flatten gal took : 126 ms
[2024-06-01 14:17:04] [INFO ] Input system was already deterministic with 2189 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 757 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 757 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-06-01 14:17:05] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:17:05] [INFO ] Flatten gal took : 59 ms
[2024-06-01 14:17:05] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 451 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 452 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-06-01 14:17:06] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:17:06] [INFO ] Flatten gal took : 59 ms
[2024-06-01 14:17:06] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-06-01 14:17:06] [INFO ] Flatten gal took : 112 ms
[2024-06-01 14:17:06] [INFO ] Flatten gal took : 122 ms
[2024-06-01 14:17:06] [INFO ] Input system was already deterministic with 2189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-06-01 14:17:06] [INFO ] Flatten gal took : 134 ms
[2024-06-01 14:17:07] [INFO ] Flatten gal took : 120 ms
[2024-06-01 14:17:07] [INFO ] Input system was already deterministic with 2189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 5 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-06-01 14:17:07] [INFO ] Flatten gal took : 115 ms
[2024-06-01 14:17:07] [INFO ] Flatten gal took : 124 ms
[2024-06-01 14:17:07] [INFO ] Input system was already deterministic with 2189 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 425 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 425 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-06-01 14:17:08] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:17:08] [INFO ] Flatten gal took : 60 ms
[2024-06-01 14:17:08] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 483 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 484 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-06-01 14:17:09] [INFO ] Flatten gal took : 59 ms
[2024-06-01 14:17:09] [INFO ] Flatten gal took : 66 ms
[2024-06-01 14:17:09] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-06-01 14:17:09] [INFO ] Flatten gal took : 113 ms
[2024-06-01 14:17:09] [INFO ] Flatten gal took : 122 ms
[2024-06-01 14:17:09] [INFO ] Input system was already deterministic with 2189 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-06-01 14:17:09] [INFO ] Flatten gal took : 111 ms
[2024-06-01 14:17:10] [INFO ] Flatten gal took : 138 ms
[2024-06-01 14:17:10] [INFO ] Input system was already deterministic with 2189 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 420 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 422 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-06-01 14:17:10] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:17:10] [INFO ] Flatten gal took : 60 ms
[2024-06-01 14:17:10] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 111 transition count 2168
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 41 place count 91 transition count 2168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 41 place count 91 transition count 2158
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 61 place count 81 transition count 2158
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 81 place count 61 transition count 2138
Iterating global reduction 2 with 20 rules applied. Total rules applied 101 place count 61 transition count 2138
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 2 with 1023 rules applied. Total rules applied 1124 place count 61 transition count 1115
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1124 place count 61 transition count 1105
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1144 place count 51 transition count 1105
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1154 place count 51 transition count 1095
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1174 place count 41 transition count 1085
Applied a total of 1174 rules in 419 ms. Remains 41 /113 variables (removed 72) and now considering 1085/2189 (removed 1104) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 419 ms. Remains : 41/113 places, 1085/2189 transitions.
[2024-06-01 14:17:11] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:17:11] [INFO ] Flatten gal took : 60 ms
[2024-06-01 14:17:11] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 2189/2189 transitions.
Applied a total of 0 rules in 6 ms. Remains 113 /113 variables (removed 0) and now considering 2189/2189 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 113/113 places, 2189/2189 transitions.
[2024-06-01 14:17:11] [INFO ] Flatten gal took : 111 ms
[2024-06-01 14:17:11] [INFO ] Flatten gal took : 120 ms
[2024-06-01 14:17:12] [INFO ] Input system was already deterministic with 2189 transitions.
[2024-06-01 14:17:12] [INFO ] Flatten gal took : 120 ms
[2024-06-01 14:17:12] [INFO ] Flatten gal took : 122 ms
[2024-06-01 14:17:12] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 8 ms.
[2024-06-01 14:17:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 113 places, 2189 transitions and 41494 arcs took 34 ms.
Total runtime 113973 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-00
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-01
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-02
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-03
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-04
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-06
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-07
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-08
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-09
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-10
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2024-11
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2023-12
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2023-13
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2023-14
Could not compute solution for formula : StigmergyElection-PT-10a-CTLFireability-2023-15

BK_STOP 1717251432916

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/947/ctl_0_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/947/ctl_1_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/947/ctl_2_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/947/ctl_3_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/947/ctl_4_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/947/ctl_5_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/947/ctl_6_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/947/ctl_7_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/947/ctl_8_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/947/ctl_9_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/947/ctl_10_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/947/ctl_11_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/947/ctl_12_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/947/ctl_13_
ctl formula name StigmergyElection-PT-10a-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/947/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-10a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is StigmergyElection-PT-10a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690532200378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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