MCC'2024- Execution of r536-tall-171690532100331

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

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
4915.104	637809.00	760021.00	1733.00	FFTFTFFFFTFFTFFF	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-171690532100331.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-07a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532100331
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.3M
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K 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 14K Apr 11 19:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K Apr 11 19:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Apr 11 18:57 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 1.8M 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-07a-LTLCardinality-00
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-01
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-02
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-03
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-04
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-05
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-06
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-07
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-08
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-09
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-10
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-11
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-12
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-13
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-14
FORMULA_NAME StigmergyElection-PT-07a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717247151067

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:05:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 13:05:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:05:52] [INFO ] Load time of PNML (sax parser for PT used): 390 ms
[2024-06-01 13:05:52] [INFO ] Transformed 100 places.
[2024-06-01 13:05:52] [INFO ] Transformed 2618 transitions.
[2024-06-01 13:05:52] [INFO ] Found NUPN structural information;
[2024-06-01 13:05:52] [INFO ] Parsed PT model containing 100 places and 2618 transitions and 34799 arcs in 625 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyElection-PT-07a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-07a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 389/389 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 91 transition count 374
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 91 transition count 374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 88 transition count 368
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 88 transition count 368
Applied a total of 24 rules in 53 ms. Remains 88 /100 variables (removed 12) and now considering 368/389 (removed 21) transitions.
[2024-06-01 13:05:53] [INFO ] Flow matrix only has 356 transitions (discarded 12 similar events)
// Phase 1: matrix 356 rows 88 cols
[2024-06-01 13:05:53] [INFO ] Computed 5 invariants in 8 ms
[2024-06-01 13:05:53] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 13:05:53] [INFO ] Flow matrix only has 356 transitions (discarded 12 similar events)
[2024-06-01 13:05:53] [INFO ] Invariant cache hit.
[2024-06-01 13:05:53] [INFO ] State equation strengthened by 288 read => feed constraints.
[2024-06-01 13:05:53] [INFO ] Implicit Places using invariants and state equation in 433 ms returned [87]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 740 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/100 places, 368/389 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 84 transition count 365
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 84 transition count 365
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 82 transition count 363
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 82 transition count 363
Applied a total of 10 rules in 12 ms. Remains 82 /87 variables (removed 5) and now considering 363/368 (removed 5) transitions.
[2024-06-01 13:05:53] [INFO ] Flow matrix only has 351 transitions (discarded 12 similar events)
// Phase 1: matrix 351 rows 82 cols
[2024-06-01 13:05:53] [INFO ] Computed 4 invariants in 19 ms
[2024-06-01 13:05:54] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 13:05:54] [INFO ] Flow matrix only has 351 transitions (discarded 12 similar events)
[2024-06-01 13:05:54] [INFO ] Invariant cache hit.
[2024-06-01 13:05:54] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:05:54] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/100 places, 363/389 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1459 ms. Remains : 82/100 places, 363/389 transitions.
Support contains 26 out of 82 places after structural reductions.
[2024-06-01 13:05:54] [INFO ] Flatten gal took : 120 ms
[2024-06-01 13:05:55] [INFO ] Flatten gal took : 62 ms
[2024-06-01 13:05:55] [INFO ] Input system was already deterministic with 363 transitions.
Support contains 22 out of 82 places (down from 26) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 33920 steps (34 resets) in 2963 ms. (11 steps per ms) remains 0/16 properties
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((p0 U p1)))&&(p2||(p1 U X(p0))))))'
Support contains 4 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 69 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 69 transition count 346
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 33 place count 62 transition count 338
Iterating global reduction 0 with 7 rules applied. Total rules applied 40 place count 62 transition count 338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 61 transition count 337
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 61 transition count 337
Applied a total of 42 rules in 13 ms. Remains 61 /82 variables (removed 21) and now considering 337/363 (removed 26) transitions.
[2024-06-01 13:05:56] [INFO ] Flow matrix only has 328 transitions (discarded 9 similar events)
// Phase 1: matrix 328 rows 61 cols
[2024-06-01 13:05:56] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 13:05:56] [INFO ] Implicit Places using invariants in 141 ms returned []
[2024-06-01 13:05:56] [INFO ] Flow matrix only has 328 transitions (discarded 9 similar events)
[2024-06-01 13:05:56] [INFO ] Invariant cache hit.
[2024-06-01 13:05:56] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:05:56] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-01 13:05:56] [INFO ] Flow matrix only has 328 transitions (discarded 9 similar events)
[2024-06-01 13:05:56] [INFO ] Invariant cache hit.
[2024-06-01 13:05:56] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:06:00] [INFO ] Deduced a trap composed of 9 places in 233 ms of which 16 ms to minimize.
[2024-06-01 13:06:00] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 13:06:00] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:06:00] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 23 ms to minimize.
[2024-06-01 13:06:00] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:06:00] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 223 ms of which 1 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:06:01] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:06:02] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:06:03] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:06:03] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2024-06-01 13:06:03] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:06:03] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:06:03] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:06:03] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:06:03] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:06:04] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:06:05] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:06:05] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 3 ms to minimize.
[2024-06-01 13:06:05] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:06:05] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:06:05] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 14/56 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:06:05] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:06:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:06:06] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 2 ms to minimize.
[2024-06-01 13:06:06] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:06:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (OVERLAPS) 327/388 variables, 61/122 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 259/381 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:06:11] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 12 (OVERLAPS) 1/389 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/389 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 14 (OVERLAPS) 0/389 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 389/389 variables, and 383 constraints, problems are : Problem set: 0 solved, 336 unsolved in 26712 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 60/62 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:06:26] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:06:26] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:06:26] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:06:26] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:06:26] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:06:26] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 6/68 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:06:27] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:06:28] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (OVERLAPS) 327/388 variables, 61/131 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/388 variables, 259/390 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/388 variables, 336/726 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/388 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (OVERLAPS) 1/389 variables, 1/727 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 389/389 variables, and 727 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 61/61 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 68/68 constraints]
After SMT, in 58668ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 58695ms
Starting structural reductions in LTL mode, iteration 1 : 61/82 places, 337/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59042 ms. Remains : 61/82 places, 337/363 transitions.
Stuttering acceptance computed with spot in 495 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-00
Stuttering criterion allowed to conclude after 28 steps with 2 reset in 3 ms.
FORMULA StigmergyElection-PT-07a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLCardinality-00 finished in 59611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 68 transition count 345
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 68 transition count 345
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 60 transition count 336
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 60 transition count 336
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 59 transition count 335
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 59 transition count 335
Applied a total of 46 rules in 11 ms. Remains 59 /82 variables (removed 23) and now considering 335/363 (removed 28) transitions.
[2024-06-01 13:06:55] [INFO ] Flow matrix only has 327 transitions (discarded 8 similar events)
// Phase 1: matrix 327 rows 59 cols
[2024-06-01 13:06:55] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 13:06:56] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-06-01 13:06:56] [INFO ] Flow matrix only has 327 transitions (discarded 8 similar events)
[2024-06-01 13:06:56] [INFO ] Invariant cache hit.
[2024-06-01 13:06:56] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:06:56] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Running 334 sub problems to find dead transitions.
[2024-06-01 13:06:56] [INFO ] Flow matrix only has 327 transitions (discarded 8 similar events)
[2024-06-01 13:06:56] [INFO ] Invariant cache hit.
[2024-06-01 13:06:56] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 13:06:58] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:06:58] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:06:59] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:07:00] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:07:01] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:07:01] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:07:01] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:07:01] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:07:01] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:07:01] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:07:01] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 13:07:01] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:07:01] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:07:02] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:07:03] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:07:04] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 13:07:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:07:04] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:07:04] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:07:04] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:07:04] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
[2024-06-01 13:07:04] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:07:05] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 7/78 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (OVERLAPS) 326/385 variables, 59/137 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/385 variables, 259/396 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 13:07:09] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/385 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 13:07:13] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/385 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 13:07:16] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/385 variables, 1/399 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/385 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 14 (OVERLAPS) 1/386 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 334 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/386 variables, and 400 constraints, problems are : Problem set: 0 solved, 334 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 59/59 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 334/334 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 334 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 80/81 constraints. Problems are: Problem set: 0 solved, 334 unsolved
[2024-06-01 13:07:29] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 5 (OVERLAPS) 326/385 variables, 59/141 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/385 variables, 259/400 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/385 variables, 334/734 constraints. Problems are: Problem set: 0 solved, 334 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/385 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 334 unsolved
SMT process timed out in 61610ms, After SMT, problems are : Problem set: 0 solved, 334 unsolved
Search for dead transitions found 0 dead transitions in 61618ms
Starting structural reductions in LTL mode, iteration 1 : 59/82 places, 335/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61877 ms. Remains : 59/82 places, 335/363 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07a-LTLCardinality-02 finished in 62351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)&&X(X((G(!p1)||(!p1&&F(!p2)))))))))'
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 73 transition count 351
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 73 transition count 351
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 66 transition count 343
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 66 transition count 343
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 65 transition count 342
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 65 transition count 342
Applied a total of 34 rules in 7 ms. Remains 65 /82 variables (removed 17) and now considering 342/363 (removed 21) transitions.
[2024-06-01 13:07:58] [INFO ] Flow matrix only has 332 transitions (discarded 10 similar events)
// Phase 1: matrix 332 rows 65 cols
[2024-06-01 13:07:58] [INFO ] Computed 3 invariants in 2 ms
[2024-06-01 13:07:58] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-06-01 13:07:58] [INFO ] Flow matrix only has 332 transitions (discarded 10 similar events)
[2024-06-01 13:07:58] [INFO ] Invariant cache hit.
[2024-06-01 13:07:58] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:07:59] [INFO ] Implicit Places using invariants and state equation in 576 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2024-06-01 13:07:59] [INFO ] Flow matrix only has 332 transitions (discarded 10 similar events)
[2024-06-01 13:07:59] [INFO ] Invariant cache hit.
[2024-06-01 13:07:59] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 0 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 0 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:08:02] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 1 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:08:03] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 0 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:08:04] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:08:05] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 13:08:05] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 0 ms to minimize.
[2024-06-01 13:08:05] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2024-06-01 13:08:05] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 13:08:05] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:08:05] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-06-01 13:08:06] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:08:07] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:08:07] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:08:07] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 18/61 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 13:08:07] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:08:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:08:08] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 1 ms to minimize.
[2024-06-01 13:08:08] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 1 ms to minimize.
[2024-06-01 13:08:08] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:08:08] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:08:08] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 331/396 variables, 65/133 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 259/392 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 13:08:11] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-06-01 13:08:11] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:08:11] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:08:11] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:08:11] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:08:11] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:08:11] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 7/399 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 11 (OVERLAPS) 1/397 variables, 1/400 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 13:08:19] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/397 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/397 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 14 (OVERLAPS) 0/397 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 341 unsolved
No progress, stopping.
After SMT solving in domain Real declared 397/397 variables, and 401 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 73/73 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 73/76 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 13:08:32] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:08:32] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:08:32] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (OVERLAPS) 331/396 variables, 65/144 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/396 variables, 259/403 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/396 variables, 341/744 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 13:08:51] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/396 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 341 unsolved
[2024-06-01 13:08:56] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:08:56] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 396/397 variables, and 747 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 79/79 constraints]
After SMT, in 61863ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 61867ms
Starting structural reductions in LTL mode, iteration 1 : 65/82 places, 342/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62589 ms. Remains : 65/82 places, 342/363 transitions.
Stuttering acceptance computed with spot in 318 ms :[true, (OR (NOT p0) p2), (OR (NOT p0) p1), (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-07a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLCardinality-05 finished in 62955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X(G((F(p2)&&p1)))||p0)))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 68 transition count 345
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 68 transition count 345
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 62 transition count 338
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 62 transition count 338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 61 transition count 337
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 61 transition count 337
Applied a total of 42 rules in 7 ms. Remains 61 /82 variables (removed 21) and now considering 337/363 (removed 26) transitions.
[2024-06-01 13:09:01] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
// Phase 1: matrix 329 rows 61 cols
[2024-06-01 13:09:01] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 13:09:01] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 13:09:01] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
[2024-06-01 13:09:01] [INFO ] Invariant cache hit.
[2024-06-01 13:09:01] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:09:01] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-01 13:09:01] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
[2024-06-01 13:09:01] [INFO ] Invariant cache hit.
[2024-06-01 13:09:01] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:09:03] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:09:04] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:09:05] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 3 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:09:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 1 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:09:07] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:09:08] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:09:09] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:09:09] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:09:09] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:09:09] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:09:09] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:09:09] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:09:10] [INFO ] Deduced a trap composed of 10 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (OVERLAPS) 328/389 variables, 61/128 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 259/387 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 388 constraints, problems are : Problem set: 0 solved, 336 unsolved in 25946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:09:29] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:09:29] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:09:30] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:09:30] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:09:30] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 328/389 variables, 61/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 259/392 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 336/728 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 729 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 71/71 constraints]
After SMT, in 57298ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 57302ms
Starting structural reductions in LTL mode, iteration 1 : 61/82 places, 337/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57589 ms. Remains : 61/82 places, 337/363 transitions.
Stuttering acceptance computed with spot in 212 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 200 ms.
Product exploration explored 100000 steps with 1 reset in 141 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 211 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 178 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Support contains 2 out of 61 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 61/61 places, 337/337 transitions.
Applied a total of 0 rules in 4 ms. Remains 61 /61 variables (removed 0) and now considering 337/337 (removed 0) transitions.
[2024-06-01 13:10:00] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
[2024-06-01 13:10:00] [INFO ] Invariant cache hit.
[2024-06-01 13:10:00] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 13:10:00] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
[2024-06-01 13:10:00] [INFO ] Invariant cache hit.
[2024-06-01 13:10:00] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:10:00] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 336 sub problems to find dead transitions.
[2024-06-01 13:10:00] [INFO ] Flow matrix only has 329 transitions (discarded 8 similar events)
[2024-06-01 13:10:00] [INFO ] Invariant cache hit.
[2024-06-01 13:10:00] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:10:03] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:10:03] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:10:03] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 1 ms to minimize.
[2024-06-01 13:10:03] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:10:03] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:10:03] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:10:03] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:10:03] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:10:04] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 10 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:10:05] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:10:06] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:10:07] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:10:08] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:10:08] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:10:08] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:10:08] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:10:08] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:10:08] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (OVERLAPS) 328/389 variables, 61/128 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 259/387 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/389 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (OVERLAPS) 1/390 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 12 (OVERLAPS) 0/390 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 388 constraints, problems are : Problem set: 0 solved, 336 unsolved in 25619 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 66/67 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 13:10:28] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:10:29] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 328/389 variables, 61/133 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/389 variables, 259/392 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/389 variables, 336/728 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/389 variables, 0/728 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 1/390 variables, 1/729 constraints. Problems are: Problem set: 0 solved, 336 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 390/390 variables, and 729 constraints, problems are : Problem set: 0 solved, 336 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 71/71 constraints]
After SMT, in 57333ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 57336ms
Finished structural reductions in LTL mode , in 1 iterations and 57556 ms. Remains : 61/61 places, 337/337 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR (NOT p1) p2)))]
Knowledge based reduction with 1 factoid took 210 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 183 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 53 ms.
Entered a terminal (fully accepting) state of product in 24 steps with 2 reset in 1 ms.
FORMULA StigmergyElection-PT-07a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLCardinality-06 finished in 117858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 81 transition count 343
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 62 transition count 342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 61 transition count 342
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 40 place count 61 transition count 333
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 58 place count 52 transition count 333
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 68 place count 42 transition count 319
Iterating global reduction 3 with 10 rules applied. Total rules applied 78 place count 42 transition count 319
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 109 place count 42 transition count 288
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 109 place count 42 transition count 286
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 113 place count 40 transition count 286
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 114 place count 39 transition count 284
Iterating global reduction 4 with 1 rules applied. Total rules applied 115 place count 39 transition count 284
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 147 place count 39 transition count 252
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 165 place count 30 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 169 place count 30 transition count 239
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 173 place count 28 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 175 place count 28 transition count 235
Drop transitions (Redundant composition of simpler transitions.) removed 191 transitions
Redundant transition composition rules discarded 191 transitions
Iterating global reduction 7 with 191 rules applied. Total rules applied 366 place count 28 transition count 44
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 380 place count 21 transition count 37
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 384 place count 17 transition count 33
Applied a total of 384 rules in 118 ms. Remains 17 /82 variables (removed 65) and now considering 33/363 (removed 330) transitions.
[2024-06-01 13:10:59] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
// Phase 1: matrix 26 rows 17 cols
[2024-06-01 13:10:59] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:10:59] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 13:10:59] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 13:10:59] [INFO ] Invariant cache hit.
[2024-06-01 13:10:59] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 13:10:59] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-01 13:10:59] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 13:10:59] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 13:10:59] [INFO ] Invariant cache hit.
[2024-06-01 13:10:59] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:10:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 25/42 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:00] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 1/43 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/43 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/43 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 71 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:11:01] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:11:01] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:11:01] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:01] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:11:01] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:01] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:11:01] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:11:01] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 25/42 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 1/43 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 0/43 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 112 constraints, problems are : Problem set: 0 solved, 32 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 51/51 constraints]
After SMT, in 2754ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2755ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/82 places, 33/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2999 ms. Remains : 17/82 places, 33/363 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 96 ms.
Product exploration explored 100000 steps with 0 reset in 75 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 38 steps (2 resets) in 4 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 17 /17 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-06-01 13:11:02] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 13:11:02] [INFO ] Invariant cache hit.
[2024-06-01 13:11:02] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 13:11:02] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 13:11:02] [INFO ] Invariant cache hit.
[2024-06-01 13:11:02] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 13:11:03] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2024-06-01 13:11:03] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 13:11:03] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 13:11:03] [INFO ] Invariant cache hit.
[2024-06-01 13:11:03] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:11:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 25/42 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 1/43 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/43 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/43 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 71 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:11:04] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:11:05] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:11:05] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:11:05] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:11:05] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:11:05] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:11:05] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 25/42 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 1/43 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 0/43 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 112 constraints, problems are : Problem set: 0 solved, 32 unsolved in 911 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 51/51 constraints]
After SMT, in 2702ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2703ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2801 ms. Remains : 17/17 places, 33/33 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 115 steps (13 resets) in 7 ms. (14 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Support contains 2 out of 17 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17/17 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 17 /17 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2024-06-01 13:11:06] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 13:11:06] [INFO ] Invariant cache hit.
[2024-06-01 13:11:06] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 13:11:06] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 13:11:06] [INFO ] Invariant cache hit.
[2024-06-01 13:11:06] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 13:11:06] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-06-01 13:11:06] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2024-06-01 13:11:06] [INFO ] Flow matrix only has 26 transitions (discarded 7 similar events)
[2024-06-01 13:11:06] [INFO ] Invariant cache hit.
[2024-06-01 13:11:06] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 1/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 26 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 13:11:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 11 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 15 ms to minimize.
[2024-06-01 13:11:07] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 25/42 variables, 17/59 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 10/69 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (OVERLAPS) 1/43 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/43 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 14 (OVERLAPS) 0/43 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 71 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1901 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 6/49 constraints. Problems are: Problem set: 0 solved, 32 unsolved
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:11:08] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/17 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/17 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 25/42 variables, 17/69 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 11 (OVERLAPS) 1/43 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 13 (OVERLAPS) 0/43 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 112 constraints, problems are : Problem set: 0 solved, 32 unsolved in 941 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 17/17 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 51/51 constraints]
After SMT, in 2863ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2864ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2965 ms. Remains : 17/17 places, 33/33 transitions.
Treatment of property StigmergyElection-PT-07a-LTLCardinality-07 finished in 10323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (p1 U p2)))'
Support contains 5 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 81 transition count 345
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 19 rules applied. Total rules applied 36 place count 64 transition count 343
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 38 place count 62 transition count 343
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 38 place count 62 transition count 336
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 52 place count 55 transition count 336
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 60 place count 47 transition count 325
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 47 transition count 325
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 75 place count 47 transition count 318
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 75 place count 47 transition count 316
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 79 place count 45 transition count 316
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 80 place count 44 transition count 314
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 44 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 89 place count 44 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 105 place count 36 transition count 298
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 109 place count 36 transition count 294
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 113 place count 34 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 115 place count 34 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 230 transitions
Redundant transition composition rules discarded 230 transitions
Iterating global reduction 7 with 230 rules applied. Total rules applied 345 place count 34 transition count 60
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 359 place count 27 transition count 53
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 363 place count 23 transition count 49
Applied a total of 363 rules in 85 ms. Remains 23 /82 variables (removed 59) and now considering 49/363 (removed 314) transitions.
[2024-06-01 13:11:09] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
// Phase 1: matrix 42 rows 23 cols
[2024-06-01 13:11:09] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:11:09] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-01 13:11:09] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
[2024-06-01 13:11:09] [INFO ] Invariant cache hit.
[2024-06-01 13:11:10] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 13:11:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2024-06-01 13:11:10] [INFO ] Redundant transitions in 0 ms returned []
Running 48 sub problems to find dead transitions.
[2024-06-01 13:11:10] [INFO ] Flow matrix only has 42 transitions (discarded 7 similar events)
[2024-06-01 13:11:10] [INFO ] Invariant cache hit.
[2024-06-01 13:11:10] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:11:10] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 11/32 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 41/64 variables, 23/61 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 13:11:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/65 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 69 constraints, problems are : Problem set: 0 solved, 48 unsolved in 2045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 13:11:12] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:11:12] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:11:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:11:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 41/64 variables, 23/66 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 6/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/64 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 1/65 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/65 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 12 (OVERLAPS) 0/65 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 121 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 42/42 constraints]
After SMT, in 3262ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 3262ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/82 places, 49/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3862 ms. Remains : 23/82 places, 49/363 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p2), (NOT p2)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 63 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/23 stabilizing places and 2/49 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X p0), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p1), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X p1)), (X (X (AND (NOT p2) p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 120 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-07a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-07a-LTLCardinality-09 finished in 4226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 68 transition count 345
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 68 transition count 345
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 61 transition count 337
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 61 transition count 337
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 60 transition count 336
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 60 transition count 336
Applied a total of 44 rules in 4 ms. Remains 60 /82 variables (removed 22) and now considering 336/363 (removed 27) transitions.
[2024-06-01 13:11:13] [INFO ] Flow matrix only has 328 transitions (discarded 8 similar events)
// Phase 1: matrix 328 rows 60 cols
[2024-06-01 13:11:13] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:11:13] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 13:11:13] [INFO ] Flow matrix only has 328 transitions (discarded 8 similar events)
[2024-06-01 13:11:13] [INFO ] Invariant cache hit.
[2024-06-01 13:11:13] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:11:13] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-01 13:11:13] [INFO ] Flow matrix only has 328 transitions (discarded 8 similar events)
[2024-06-01 13:11:13] [INFO ] Invariant cache hit.
[2024-06-01 13:11:13] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:11:16] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:11:16] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:11:16] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:11:16] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-06-01 13:11:16] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:11:16] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:11:17] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:11:18] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:11:19] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:11:19] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:11:19] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:11:19] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:11:19] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:11:19] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:11:19] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:11:19] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 0 ms to minimize.
[2024-06-01 13:11:20] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:11:20] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:11:20] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:11:20] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:11:20] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:11:20] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:11:20] [INFO ] Deduced a trap composed of 10 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:11:20] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:11:20] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:11:21] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:11:21] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:11:21] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:11:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:11:21] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-06-01 13:11:21] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:11:22] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:11:22] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:11:22] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:11:22] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:11:22] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:11:22] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:11:22] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2024-06-01 13:11:22] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:11:23] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:11:23] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 327/387 variables, 60/129 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 259/388 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:11:27] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:11:30] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 13 (OVERLAPS) 1/388 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/388 variables, and 391 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 70/71 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:11:46] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:11:47] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:11:48] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 327/387 variables, 60/138 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 259/397 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 335/732 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:05] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/388 variables, and 733 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 78/78 constraints]
After SMT, in 61569ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 61572ms
Starting structural reductions in LTL mode, iteration 1 : 60/82 places, 336/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61829 ms. Remains : 60/82 places, 336/363 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-12
Product exploration explored 100000 steps with 25000 reset in 95 ms.
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 10830 steps (12 resets) in 104 ms. (103 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 336/336 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 336/336 (removed 0) transitions.
[2024-06-01 13:12:16] [INFO ] Flow matrix only has 328 transitions (discarded 8 similar events)
[2024-06-01 13:12:16] [INFO ] Invariant cache hit.
[2024-06-01 13:12:16] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 13:12:16] [INFO ] Flow matrix only has 328 transitions (discarded 8 similar events)
[2024-06-01 13:12:16] [INFO ] Invariant cache hit.
[2024-06-01 13:12:16] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:12:16] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-01 13:12:16] [INFO ] Flow matrix only has 328 transitions (discarded 8 similar events)
[2024-06-01 13:12:16] [INFO ] Invariant cache hit.
[2024-06-01 13:12:16] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 0 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:12:19] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:12:20] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 0 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:12:21] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:12:22] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-06-01 13:12:22] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:12:22] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:12:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:12:22] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:12:22] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:22] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:12:22] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:12:23] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:12:23] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:12:23] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-06-01 13:12:23] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:12:23] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:12:23] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 0 ms to minimize.
[2024-06-01 13:12:23] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:12:23] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:12:23] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:12:24] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:12:25] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:12:25] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:25] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:12:25] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:12:25] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:12:25] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:12:25] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2024-06-01 13:12:25] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:12:26] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-06-01 13:12:26] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 327/387 variables, 60/129 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 259/388 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:30] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:34] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 13 (OVERLAPS) 1/388 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/388 variables, and 391 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 70/71 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:49] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:12:49] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:12:49] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:12:49] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:12:49] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:12:50] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:12:51] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 327/387 variables, 60/138 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 259/397 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 335/732 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:09] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/388 variables, and 733 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 78/78 constraints]
After SMT, in 61409ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 61412ms
Finished structural reductions in LTL mode , in 1 iterations and 61666 ms. Remains : 60/60 places, 336/336 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 199 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 13823 steps (15 resets) in 138 ms. (99 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 25000 reset in 109 ms.
Product exploration explored 100000 steps with 25000 reset in 102 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 336/336 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 60 transition count 336
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 7 place count 60 transition count 343
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 14 place count 60 transition count 343
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 35 place count 60 transition count 350
Ensure Unique test removed 133 transitions
Reduce isomorphic transitions removed 133 transitions.
Iterating post reduction 1 with 133 rules applied. Total rules applied 168 place count 60 transition count 217
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 175 place count 53 transition count 210
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 182 place count 53 transition count 210
Deduced a syphon composed of 28 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 141 transitions
Redundant transition composition rules discarded 141 transitions
Iterating global reduction 2 with 141 rules applied. Total rules applied 323 place count 53 transition count 69
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 330 place count 53 transition count 69
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 344 place count 39 transition count 55
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 358 place count 39 transition count 55
Deduced a syphon composed of 21 places in 0 ms
Applied a total of 358 rules in 37 ms. Remains 39 /60 variables (removed 21) and now considering 55/336 (removed 281) transitions.
[2024-06-01 13:13:19] [INFO ] Redundant transitions in 1 ms returned []
Running 54 sub problems to find dead transitions.
[2024-06-01 13:13:19] [INFO ] Flow matrix only has 48 transitions (discarded 7 similar events)
// Phase 1: matrix 48 rows 39 cols
[2024-06-01 13:13:19] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:13:19] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 13:13:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:13:19] [INFO ] Deduced a trap composed of 4 places in 11 ms of which 0 ms to minimize.
[2024-06-01 13:13:19] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:13:19] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:13:19] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:13:19] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 13:13:19] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 54 unsolved
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:13:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 5 (OVERLAPS) 47/86 variables, 39/68 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 8/76 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/76 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/87 variables, 1/77 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/87 variables, 0/77 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 0/87 variables, 0/77 constraints. Problems are: Problem set: 28 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 77 constraints, problems are : Problem set: 28 solved, 26 unsolved in 1608 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 28 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 22/39 variables, 1/1 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 28/29 constraints. Problems are: Problem set: 28 solved, 26 unsolved
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:13:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 11/40 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/40 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 47/86 variables, 39/79 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 8/87 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 26/113 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/113 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 9 (OVERLAPS) 1/87 variables, 1/114 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/87 variables, 0/114 constraints. Problems are: Problem set: 28 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/87 variables, 0/114 constraints. Problems are: Problem set: 28 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 114 constraints, problems are : Problem set: 28 solved, 26 unsolved in 1251 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 26/54 constraints, Known Traps: 39/39 constraints]
After SMT, in 2880ms problems are : Problem set: 28 solved, 26 unsolved
Search for dead transitions found 28 dead transitions in 2882ms
Found 28 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 28 transitions
Dead transitions reduction (with SMT) removed 28 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 39/60 places, 27/336 transitions.
Graph (complete) has 136 edges and 39 vertex of which 18 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 18 /39 variables (removed 21) and now considering 27/27 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/60 places, 27/336 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2940 ms. Remains : 18/60 places, 27/336 transitions.
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 336/336 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 336/336 (removed 0) transitions.
[2024-06-01 13:13:22] [INFO ] Flow matrix only has 328 transitions (discarded 8 similar events)
// Phase 1: matrix 328 rows 60 cols
[2024-06-01 13:13:22] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:13:22] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-06-01 13:13:22] [INFO ] Flow matrix only has 328 transitions (discarded 8 similar events)
[2024-06-01 13:13:22] [INFO ] Invariant cache hit.
[2024-06-01 13:13:22] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:13:22] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Running 335 sub problems to find dead transitions.
[2024-06-01 13:13:22] [INFO ] Flow matrix only has 328 transitions (discarded 8 similar events)
[2024-06-01 13:13:22] [INFO ] Invariant cache hit.
[2024-06-01 13:13:23] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:25] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-06-01 13:13:25] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-06-01 13:13:25] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:13:25] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-06-01 13:13:25] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:13:25] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:13:25] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:13:25] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 0 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:13:26] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 0 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:13:27] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-06-01 13:13:28] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:13:28] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-06-01 13:13:28] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:13:28] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:13:28] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:13:28] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:13:28] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:28] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-06-01 13:13:29] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:13:29] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:13:29] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-06-01 13:13:29] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:13:29] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 13:13:29] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:13:29] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:13:29] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:13:30] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:13:30] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:13:30] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:13:30] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:13:30] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:30] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:13:30] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 6/61 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-06-01 13:13:31] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 12 places in 116 ms of which 0 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2024-06-01 13:13:32] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (OVERLAPS) 327/387 variables, 60/129 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 259/388 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:37] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:40] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/387 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 13 (OVERLAPS) 1/388 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/388 variables, and 391 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 335 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 70/71 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:55] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:13:55] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:13:55] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:13:55] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
[2024-06-01 13:13:55] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:13:56] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:13:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 6 (OVERLAPS) 327/387 variables, 60/138 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 259/397 constraints. Problems are: Problem set: 0 solved, 335 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 335/732 constraints. Problems are: Problem set: 0 solved, 335 unsolved
[2024-06-01 13:14:14] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/733 constraints. Problems are: Problem set: 0 solved, 335 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/388 variables, and 733 constraints, problems are : Problem set: 0 solved, 335 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 60/60 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 335/335 constraints, Known Traps: 78/78 constraints]
After SMT, in 61261ms problems are : Problem set: 0 solved, 335 unsolved
Search for dead transitions found 0 dead transitions in 61266ms
Finished structural reductions in LTL mode , in 1 iterations and 61690 ms. Remains : 60/60 places, 336/336 transitions.
Treatment of property StigmergyElection-PT-07a-LTLCardinality-12 finished in 190655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 69 transition count 346
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 69 transition count 346
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 63 transition count 339
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 63 transition count 339
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 62 transition count 338
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 62 transition count 338
Applied a total of 40 rules in 4 ms. Remains 62 /82 variables (removed 20) and now considering 338/363 (removed 25) transitions.
[2024-06-01 13:14:24] [INFO ] Flow matrix only has 330 transitions (discarded 8 similar events)
// Phase 1: matrix 330 rows 62 cols
[2024-06-01 13:14:24] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:14:24] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 13:14:24] [INFO ] Flow matrix only has 330 transitions (discarded 8 similar events)
[2024-06-01 13:14:24] [INFO ] Invariant cache hit.
[2024-06-01 13:14:24] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:14:24] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 337 sub problems to find dead transitions.
[2024-06-01 13:14:24] [INFO ] Flow matrix only has 330 transitions (discarded 8 similar events)
[2024-06-01 13:14:24] [INFO ] Invariant cache hit.
[2024-06-01 13:14:24] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:14:27] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:14:28] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:14:29] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 0 ms to minimize.
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 9 ms to minimize.
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:14:30] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 9 places in 368 ms of which 0 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 10 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 11 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 12/53 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:14:31] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:14:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:14:32] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:14:32] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:14:32] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2024-06-01 13:14:32] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 0 ms to minimize.
[2024-06-01 13:14:32] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:14:32] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:14:32] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 10/63 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:33] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:14:33] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:34] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 0 ms to minimize.
[2024-06-01 13:14:34] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:35] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 10 (OVERLAPS) 329/391 variables, 62/130 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/391 variables, 259/389 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:38] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/391 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/391 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 14 (OVERLAPS) 1/392 variables, 1/391 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/392 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 392/392 variables, and 391 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 337 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:56] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 337 unsolved
[2024-06-01 13:14:57] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:14:58] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 6 (OVERLAPS) 329/391 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 259/393 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 337/730 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/730 constraints. Problems are: Problem set: 0 solved, 337 unsolved
At refinement iteration 10 (OVERLAPS) 1/392 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 337 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/392 variables, and 731 constraints, problems are : Problem set: 0 solved, 337 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 337/337 constraints, Known Traps: 71/71 constraints]
After SMT, in 61316ms problems are : Problem set: 0 solved, 337 unsolved
Search for dead transitions found 0 dead transitions in 61319ms
Starting structural reductions in LTL mode, iteration 1 : 62/82 places, 338/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61694 ms. Remains : 62/82 places, 338/363 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-07a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLCardinality-13 finished in 61853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 67 transition count 344
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 67 transition count 344
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 38 place count 59 transition count 335
Iterating global reduction 0 with 8 rules applied. Total rules applied 46 place count 59 transition count 335
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 58 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 58 transition count 334
Applied a total of 48 rules in 5 ms. Remains 58 /82 variables (removed 24) and now considering 334/363 (removed 29) transitions.
[2024-06-01 13:15:26] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
// Phase 1: matrix 326 rows 58 cols
[2024-06-01 13:15:26] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 13:15:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 13:15:26] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-06-01 13:15:26] [INFO ] Invariant cache hit.
[2024-06-01 13:15:26] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-06-01 13:15:26] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
Running 333 sub problems to find dead transitions.
[2024-06-01 13:15:26] [INFO ] Flow matrix only has 326 transitions (discarded 8 similar events)
[2024-06-01 13:15:26] [INFO ] Invariant cache hit.
[2024-06-01 13:15:26] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-01 13:15:28] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-06-01 13:15:28] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-06-01 13:15:28] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-06-01 13:15:28] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:15:28] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 0 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-06-01 13:15:29] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 60 ms of which 1 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-06-01 13:15:30] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 0 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:15:31] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 0 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2024-06-01 13:15:32] [INFO ] Deduced a trap composed of 10 places in 21 ms of which 0 ms to minimize.
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 11/46 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 0 ms to minimize.
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 0 ms to minimize.
[2024-06-01 13:15:33] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2024-06-01 13:15:34] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-01 13:15:35] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-06-01 13:15:35] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:15:35] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 0 ms to minimize.
[2024-06-01 13:15:36] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-01 13:15:36] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
[2024-06-01 13:15:36] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
[2024-06-01 13:15:36] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-06-01 13:15:36] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 0 ms to minimize.
[2024-06-01 13:15:36] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-06-01 13:15:36] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:15:36] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-06-01 13:15:37] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-06-01 13:15:37] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2024-06-01 13:15:37] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 10/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 10 (OVERLAPS) 325/383 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/383 variables, 259/388 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/383 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 13 (OVERLAPS) 1/384 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/384 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 15 (OVERLAPS) 0/384 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 333 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 389 constraints, problems are : Problem set: 0 solved, 333 unsolved in 27244 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 333 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 70/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 4 (OVERLAPS) 325/383 variables, 58/129 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 259/388 constraints. Problems are: Problem set: 0 solved, 333 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 333/721 constraints. Problems are: Problem set: 0 solved, 333 unsolved
[2024-06-01 13:16:07] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 13:16:07] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-06-01 13:16:07] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:16:13] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-06-01 13:16:13] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-06-01 13:16:13] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-06-01 13:16:13] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 7/728 constraints. Problems are: Problem set: 0 solved, 333 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/384 variables, and 728 constraints, problems are : Problem set: 0 solved, 333 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 58/58 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 333/333 constraints, Known Traps: 77/77 constraints]
After SMT, in 58467ms problems are : Problem set: 0 solved, 333 unsolved
Search for dead transitions found 0 dead transitions in 58471ms
Starting structural reductions in LTL mode, iteration 1 : 58/82 places, 334/363 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58765 ms. Remains : 58/82 places, 334/363 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-07a-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLCardinality-14 finished in 58857 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (p1 U p0)))'
Support contains 1 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 363/363 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 81 transition count 341
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 60 transition count 341
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 42 place count 60 transition count 333
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 58 place count 52 transition count 333
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 67 place count 43 transition count 321
Iterating global reduction 2 with 9 rules applied. Total rules applied 76 place count 43 transition count 321
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 139 place count 43 transition count 258
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 139 place count 43 transition count 255
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 145 place count 40 transition count 255
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 161 place count 32 transition count 247
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 166 place count 32 transition count 242
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 30 transition count 240
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 172 place count 30 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 187 transitions
Redundant transition composition rules discarded 187 transitions
Iterating global reduction 5 with 187 rules applied. Total rules applied 359 place count 30 transition count 51
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 373 place count 23 transition count 44
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 377 place count 19 transition count 40
Applied a total of 377 rules in 26 ms. Remains 19 /82 variables (removed 63) and now considering 40/363 (removed 323) transitions.
[2024-06-01 13:16:25] [INFO ] Flow matrix only has 32 transitions (discarded 8 similar events)
// Phase 1: matrix 32 rows 19 cols
[2024-06-01 13:16:25] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 13:16:25] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 13:16:25] [INFO ] Flow matrix only has 32 transitions (discarded 8 similar events)
[2024-06-01 13:16:25] [INFO ] Invariant cache hit.
[2024-06-01 13:16:25] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 13:16:25] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2024-06-01 13:16:25] [INFO ] Redundant transitions in 1 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 13:16:25] [INFO ] Flow matrix only has 32 transitions (discarded 8 similar events)
[2024-06-01 13:16:25] [INFO ] Invariant cache hit.
[2024-06-01 13:16:25] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 13:16:25] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 13:16:26] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 31/50 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/50 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 1/51 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/51 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/51 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 67 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/19 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 31/50 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 39/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/51 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/51 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 106 constraints, problems are : Problem set: 0 solved, 39 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 40/40 constraints]
After SMT, in 2647ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2648ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/82 places, 40/363 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2992 ms. Remains : 19/82 places, 40/363 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-07a-LTLCardinality-15
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA StigmergyElection-PT-07a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-07a-LTLCardinality-15 finished in 3027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
[2024-06-01 13:16:28] [INFO ] Flatten gal took : 31 ms
[2024-06-01 13:16:28] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 13:16:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 82 places, 363 transitions and 3876 arcs took 18 ms.
Total runtime 636068 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-07a-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-07a-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717247788876

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyElection-PT-07a-LTLCardinality-07
ltl formula formula --ltl=/tmp/4538/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 82 places, 363 transitions and 3876 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4538/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4538/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4538/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4538/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 84 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 83, there are 372 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~23!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 69
pnml2lts-mc( 0/ 4): unique transitions count: 550
pnml2lts-mc( 0/ 4): - self-loop count: 23
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 14
pnml2lts-mc( 0/ 4): - claim success count: 78
pnml2lts-mc( 0/ 4): - cum. max stack depth: 70
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 78 states 1108 transitions, fanout: 14.205
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 14.2 B/state, compr.: 4.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 366 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-07a-LTLCardinality-12
ltl formula formula --ltl=/tmp/4538/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 82 places, 363 transitions and 3876 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/4538/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/4538/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.110 real 0.040 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/4538/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/4538/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 84 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 83, there are 369 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 37
pnml2lts-mc( 0/ 4): unique states count: 37
pnml2lts-mc( 0/ 4): unique transitions count: 57
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 29
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 45
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 45 states 78 transitions, fanout: 1.733
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 30.5 B/state, compr.: 9.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 366 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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="LTLCardinality"
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-07a, examination is LTLCardinality"
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-171690532100331"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;