About the Execution of LTSMin+red for StigmergyElection-PT-11a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4108.987 | 1648956.00 | 1859157.00 | 3749.60 | FFFFFFFTFTFFTFFF | 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-171690532200396.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-11a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690532200396
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 154M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K 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 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 21:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 21:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 11 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 20:30 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 153M 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-11a-LTLFireability-00
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-01
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-02
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-03
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-04
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-05
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-06
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-07
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-08
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-09
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-10
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-11
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-12
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-13
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-14
FORMULA_NAME StigmergyElection-PT-11a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717254504824
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-11a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:08:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:08:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:08:31] [INFO ] Load time of PNML (sax parser for PT used): 5116 ms
[2024-06-01 15:08:31] [INFO ] Transformed 156 places.
[2024-06-01 15:08:32] [INFO ] Transformed 136650 transitions.
[2024-06-01 15:08:32] [INFO ] Found NUPN structural information;
[2024-06-01 15:08:32] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 6436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 51 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyElection-PT-11a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 4305/4305 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 135 transition count 4273
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 135 transition count 4273
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 53 place count 124 transition count 4251
Iterating global reduction 0 with 11 rules applied. Total rules applied 64 place count 124 transition count 4251
Applied a total of 64 rules in 88 ms. Remains 124 /156 variables (removed 32) and now considering 4251/4305 (removed 54) transitions.
[2024-06-01 15:08:33] [INFO ] Flow matrix only has 4239 transitions (discarded 12 similar events)
// Phase 1: matrix 4239 rows 124 cols
[2024-06-01 15:08:33] [INFO ] Computed 2 invariants in 74 ms
[2024-06-01 15:08:33] [INFO ] Implicit Places using invariants in 296 ms returned []
[2024-06-01 15:08:33] [INFO ] Flow matrix only has 4239 transitions (discarded 12 similar events)
[2024-06-01 15:08:33] [INFO ] Invariant cache hit.
[2024-06-01 15:08:35] [INFO ] State equation strengthened by 4148 read => feed constraints.
[2024-06-01 15:08:37] [INFO ] Implicit Places using invariants and state equation in 3738 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4078 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/156 places, 4251/4305 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 101 transition count 4229
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 101 transition count 4229
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 55 place count 90 transition count 4218
Iterating global reduction 0 with 11 rules applied. Total rules applied 66 place count 90 transition count 4218
Applied a total of 66 rules in 57 ms. Remains 90 /123 variables (removed 33) and now considering 4218/4251 (removed 33) transitions.
[2024-06-01 15:08:37] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-06-01 15:08:37] [INFO ] Computed 1 invariants in 26 ms
[2024-06-01 15:08:37] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-01 15:08:37] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:08:37] [INFO ] Invariant cache hit.
[2024-06-01 15:08:38] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 15:08:39] [INFO ] Implicit Places using invariants and state equation in 1609 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 90/156 places, 4218/4305 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5923 ms. Remains : 90/156 places, 4218/4305 transitions.
Support contains 11 out of 90 places after structural reductions.
[2024-06-01 15:08:40] [INFO ] Flatten gal took : 559 ms
[2024-06-01 15:08:40] [INFO ] Flatten gal took : 346 ms
[2024-06-01 15:08:41] [INFO ] Input system was already deterministic with 4218 transitions.
Reduction of identical properties reduced properties to check from 8 to 3
RANDOM walk for 40000 steps (8 resets) in 11651 ms. (3 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 314 ms. (126 steps per ms) remains 1/1 properties
[2024-06-01 15:08:44] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:08:44] [INFO ] Invariant cache hit.
[2024-06-01 15:08:45] [INFO ] State equation strengthened by 4104 read => feed constraints.
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Real declared 11/4296 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/90 constraints, ReadFeed: 0/4104 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 981ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA StigmergyElection-PT-11a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 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((F(p1)&&p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1975 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-06-01 15:08:47] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-06-01 15:08:47] [INFO ] Computed 1 invariants in 9 ms
[2024-06-01 15:08:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 15:08:47] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:08:47] [INFO ] Invariant cache hit.
[2024-06-01 15:08:48] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:08:48] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2024-06-01 15:08:48] [INFO ] Redundant transitions in 285 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:08:48] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:08:48] [INFO ] Invariant cache hit.
[2024-06-01 15:08:48] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:09:28] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 10 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 32 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 2 ms to minimize.
[2024-06-01 15:09:29] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 2 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 2 ms to minimize.
[2024-06-01 15:09:30] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-06-01 15:09:31] [INFO ] Deduced a trap composed of 4 places in 758 ms of which 1 ms to minimize.
[2024-06-01 15:09:31] [INFO ] Deduced a trap composed of 4 places in 764 ms of which 1 ms to minimize.
[2024-06-01 15:09:32] [INFO ] Deduced a trap composed of 4 places in 728 ms of which 1 ms to minimize.
[2024-06-01 15:09:33] [INFO ] Deduced a trap composed of 4 places in 742 ms of which 0 ms to minimize.
[2024-06-01 15:09:34] [INFO ] Deduced a trap composed of 4 places in 731 ms of which 1 ms to minimize.
[2024-06-01 15:09:34] [INFO ] Deduced a trap composed of 4 places in 753 ms of which 2 ms to minimize.
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 0 ms to minimize.
[2024-06-01 15:09:35] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 1 ms to minimize.
[2024-06-01 15:09:36] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2024-06-01 15:09:36] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 4 places in 517 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:09:37] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-06-01 15:09:38] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 15:09:38] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:09:38] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 15:09:38] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:09:38] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-06-01 15:09:38] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 15:09:38] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:09:38] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 3 ms to minimize.
[2024-06-01 15:09:39] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2024-06-01 15:09:39] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-06-01 15:09:39] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-06-01 15:09:39] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-06-01 15:09:39] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 6 ms to minimize.
[2024-06-01 15:09:39] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:09:40] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:09:44] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 0 ms to minimize.
[2024-06-01 15:09:44] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2024-06-01 15:09:44] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2024-06-01 15:09:44] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-06-01 15:09:45] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-06-01 15:09:45] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-06-01 15:09:45] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2024-06-01 15:09:45] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-06-01 15:09:45] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:09:46] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-06-01 15:09:46] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 1 ms to minimize.
[2024-06-01 15:09:46] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-06-01 15:09:46] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-06-01 15:09:46] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-06-01 15:09:46] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93746ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93781ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96810 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-00
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 5 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-00 finished in 97085 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||(p0 U X(p0))))))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 13 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-06-01 15:10:22] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-06-01 15:10:22] [INFO ] Computed 1 invariants in 15 ms
[2024-06-01 15:10:22] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 15:10:22] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:10:22] [INFO ] Invariant cache hit.
[2024-06-01 15:10:24] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 15:10:24] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 1680 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-06-01 15:10:24] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:10:24] [INFO ] Invariant cache hit.
[2024-06-01 15:10:24] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-06-01 15:12:00] [INFO ] Deduced a trap composed of 9 places in 1303 ms of which 3 ms to minimize.
[2024-06-01 15:12:01] [INFO ] Deduced a trap composed of 9 places in 1345 ms of which 3 ms to minimize.
[2024-06-01 15:12:02] [INFO ] Deduced a trap composed of 9 places in 1303 ms of which 1 ms to minimize.
SMT process timed out in 98340ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 98401ms
Finished structural reductions in LTL mode , in 1 iterations and 100116 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-01 finished in 100253 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' '!(F(G((X(((p1||X(G(p1))) U (!p1&&(p1||X(G(p1))))))||p0))))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1651 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-06-01 15:12:04] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-06-01 15:12:04] [INFO ] Computed 1 invariants in 11 ms
[2024-06-01 15:12:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 15:12:04] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:12:04] [INFO ] Invariant cache hit.
[2024-06-01 15:12:05] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:12:05] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 672 ms to find 0 implicit places.
[2024-06-01 15:12:05] [INFO ] Redundant transitions in 255 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:12:05] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:12:05] [INFO ] Invariant cache hit.
[2024-06-01 15:12:05] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 3 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:12:44] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 2 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-06-01 15:12:45] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-06-01 15:12:46] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 1 ms to minimize.
[2024-06-01 15:12:46] [INFO ] Deduced a trap composed of 4 places in 678 ms of which 1 ms to minimize.
[2024-06-01 15:12:47] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2024-06-01 15:12:48] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 0 ms to minimize.
[2024-06-01 15:12:48] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 1 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 4 places in 613 ms of which 0 ms to minimize.
[2024-06-01 15:12:49] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 0 ms to minimize.
[2024-06-01 15:12:50] [INFO ] Deduced a trap composed of 4 places in 439 ms of which 0 ms to minimize.
[2024-06-01 15:12:50] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 1 ms to minimize.
[2024-06-01 15:12:51] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-06-01 15:12:51] [INFO ] Deduced a trap composed of 4 places in 516 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-06-01 15:12:52] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:12:53] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 15:12:53] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-06-01 15:12:53] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2024-06-01 15:12:53] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-06-01 15:12:53] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-06-01 15:12:54] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-06-01 15:12:54] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-06-01 15:12:54] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-06-01 15:12:54] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:12:58] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 0 ms to minimize.
[2024-06-01 15:12:58] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-06-01 15:12:58] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-06-01 15:12:59] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-06-01 15:12:59] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-06-01 15:12:59] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-06-01 15:12:59] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-06-01 15:12:59] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-06-01 15:13:00] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-06-01 15:13:00] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-06-01 15:13:00] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-06-01 15:13:00] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-06-01 15:13:00] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-06-01 15:13:00] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:13:01] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92703ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92726ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95320 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-02
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-02 finished in 95503 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)||G(!p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-06-01 15:13:38] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-06-01 15:13:38] [INFO ] Computed 1 invariants in 20 ms
[2024-06-01 15:13:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 15:13:38] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:13:38] [INFO ] Invariant cache hit.
[2024-06-01 15:13:39] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 15:13:39] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1367 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-06-01 15:13:39] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:13:39] [INFO ] Invariant cache hit.
[2024-06-01 15:13:40] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-06-01 15:15:16] [INFO ] Deduced a trap composed of 9 places in 1303 ms of which 1 ms to minimize.
[2024-06-01 15:15:17] [INFO ] Deduced a trap composed of 9 places in 1296 ms of which 1 ms to minimize.
[2024-06-01 15:15:18] [INFO ] Deduced a trap composed of 9 places in 1296 ms of which 1 ms to minimize.
SMT process timed out in 98782ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 98826ms
Finished structural reductions in LTL mode , in 1 iterations and 100229 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, (NOT p0), false, false, p0]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-03 finished in 100431 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' '!(F((G((X(G(!p2))||p1))&&p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 15 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-06-01 15:15:18] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:15:18] [INFO ] Invariant cache hit.
[2024-06-01 15:15:18] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 15:15:18] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:15:18] [INFO ] Invariant cache hit.
[2024-06-01 15:15:19] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 15:15:20] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-06-01 15:15:20] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:15:20] [INFO ] Invariant cache hit.
[2024-06-01 15:15:20] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
SMT process timed out in 99077ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 99120ms
Finished structural reductions in LTL mode , in 1 iterations and 100562 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-05
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 4 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-05 finished in 100802 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' '!(F(G(p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1793 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-06-01 15:17:01] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-06-01 15:17:01] [INFO ] Computed 1 invariants in 9 ms
[2024-06-01 15:17:01] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-06-01 15:17:01] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:17:01] [INFO ] Invariant cache hit.
[2024-06-01 15:17:02] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:17:02] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2024-06-01 15:17:02] [INFO ] Redundant transitions in 295 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:17:02] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:17:02] [INFO ] Invariant cache hit.
[2024-06-01 15:17:02] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-06-01 15:17:44] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-06-01 15:17:45] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-06-01 15:17:45] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2024-06-01 15:17:45] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-06-01 15:17:46] [INFO ] Deduced a trap composed of 4 places in 747 ms of which 1 ms to minimize.
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 4 places in 655 ms of which 0 ms to minimize.
[2024-06-01 15:17:47] [INFO ] Deduced a trap composed of 4 places in 628 ms of which 1 ms to minimize.
[2024-06-01 15:17:48] [INFO ] Deduced a trap composed of 4 places in 742 ms of which 1 ms to minimize.
[2024-06-01 15:17:49] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2024-06-01 15:17:49] [INFO ] Deduced a trap composed of 4 places in 747 ms of which 1 ms to minimize.
[2024-06-01 15:17:50] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 1 ms to minimize.
[2024-06-01 15:17:51] [INFO ] Deduced a trap composed of 4 places in 536 ms of which 0 ms to minimize.
[2024-06-01 15:17:51] [INFO ] Deduced a trap composed of 4 places in 470 ms of which 1 ms to minimize.
[2024-06-01 15:17:51] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2024-06-01 15:17:52] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:17:52] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 4 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 15:17:53] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
[2024-06-01 15:17:54] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-06-01 15:17:54] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-06-01 15:17:54] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2024-06-01 15:17:54] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-06-01 15:17:55] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-06-01 15:17:55] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2024-06-01 15:17:55] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-06-01 15:17:55] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 1 ms to minimize.
[2024-06-01 15:17:55] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:17:59] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 1 ms to minimize.
[2024-06-01 15:18:00] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 0 ms to minimize.
[2024-06-01 15:18:00] [INFO ] Deduced a trap composed of 4 places in 371 ms of which 0 ms to minimize.
[2024-06-01 15:18:00] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-06-01 15:18:00] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-06-01 15:18:01] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-06-01 15:18:01] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-06-01 15:18:01] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-06-01 15:18:01] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-06-01 15:18:01] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-06-01 15:18:02] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-06-01 15:18:02] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-06-01 15:18:02] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-06-01 15:18:02] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:18:02] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 95368ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 95395ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98271 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-06
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 2 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-06 finished in 98339 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 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Applied a total of 0 rules in 24 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-06-01 15:18:38] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-06-01 15:18:38] [INFO ] Computed 1 invariants in 20 ms
[2024-06-01 15:18:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 15:18:38] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:18:38] [INFO ] Invariant cache hit.
[2024-06-01 15:18:39] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 15:18:39] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-06-01 15:18:39] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-06-01 15:18:39] [INFO ] Invariant cache hit.
[2024-06-01 15:18:39] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4217 unsolved
[2024-06-01 15:20:15] [INFO ] Deduced a trap composed of 9 places in 1278 ms of which 1 ms to minimize.
[2024-06-01 15:20:16] [INFO ] Deduced a trap composed of 9 places in 1318 ms of which 1 ms to minimize.
SMT process timed out in 97050ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 97093ms
Finished structural reductions in LTL mode , in 1 iterations and 98508 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-08 finished in 98622 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' '!(F(p0))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1624 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-06-01 15:20:18] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-06-01 15:20:18] [INFO ] Computed 1 invariants in 7 ms
[2024-06-01 15:20:18] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-01 15:20:18] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:20:18] [INFO ] Invariant cache hit.
[2024-06-01 15:20:18] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:20:18] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
[2024-06-01 15:20:19] [INFO ] Redundant transitions in 278 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:20:19] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:20:19] [INFO ] Invariant cache hit.
[2024-06-01 15:20:19] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:20:58] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 15:20:58] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 15:20:58] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:20:58] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:20:58] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-06-01 15:20:59] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:20:59] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-06-01 15:20:59] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2024-06-01 15:20:59] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 0 ms to minimize.
[2024-06-01 15:21:00] [INFO ] Deduced a trap composed of 4 places in 610 ms of which 0 ms to minimize.
[2024-06-01 15:21:01] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 1 ms to minimize.
[2024-06-01 15:21:02] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 1 ms to minimize.
[2024-06-01 15:21:02] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 1 ms to minimize.
[2024-06-01 15:21:03] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 0 ms to minimize.
[2024-06-01 15:21:03] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 1 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 0 ms to minimize.
[2024-06-01 15:21:04] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 0 ms to minimize.
[2024-06-01 15:21:05] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-06-01 15:21:05] [INFO ] Deduced a trap composed of 4 places in 511 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-06-01 15:21:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:21:07] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:21:07] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:21:07] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2024-06-01 15:21:07] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 4 places in 178 ms of which 0 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-06-01 15:21:08] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:21:12] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2024-06-01 15:21:12] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
[2024-06-01 15:21:12] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 0 ms to minimize.
[2024-06-01 15:21:13] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2024-06-01 15:21:13] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-06-01 15:21:13] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-06-01 15:21:13] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 0 ms to minimize.
[2024-06-01 15:21:14] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-06-01 15:21:14] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-06-01 15:21:14] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-06-01 15:21:14] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 1 ms to minimize.
[2024-06-01 15:21:14] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:21:14] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 15:21:14] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:21:15] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92752ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92773ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95348 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-09
Product exploration explored 100000 steps with 8333 reset in 4823 ms.
Product exploration explored 100000 steps with 8333 reset in 4753 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 44 steps (0 resets) in 10 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
[2024-06-01 15:22:01] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:22:01] [INFO ] Invariant cache hit.
[2024-06-01 15:22:03] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 15:22:03] [INFO ] [Real]Absence check using state equation in 344 ms returned sat
[2024-06-01 15:22:04] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:22:04] [INFO ] [Real]Added 2069 Read/Feed constraints in 213 ms returned sat
[2024-06-01 15:22:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:22:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 15:22:05] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2024-06-01 15:22:06] [INFO ] [Nat]Added 2069 Read/Feed constraints in 262 ms returned sat
[2024-06-01 15:22:06] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 654 ms.
[2024-06-01 15:22:07] [INFO ] Added : 0 causal constraints over 0 iterations in 803 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 2104/2104 transitions.
Applied a total of 0 rules in 641 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 15:22:07] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:22:07] [INFO ] Invariant cache hit.
[2024-06-01 15:22:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 15:22:07] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:22:07] [INFO ] Invariant cache hit.
[2024-06-01 15:22:08] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:22:08] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-06-01 15:22:08] [INFO ] Redundant transitions in 260 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:22:08] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:22:08] [INFO ] Invariant cache hit.
[2024-06-01 15:22:08] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:22:47] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-06-01 15:22:48] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 1 ms to minimize.
[2024-06-01 15:22:49] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 1 ms to minimize.
[2024-06-01 15:22:50] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 1 ms to minimize.
[2024-06-01 15:22:50] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 0 ms to minimize.
[2024-06-01 15:22:51] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2024-06-01 15:22:52] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 0 ms to minimize.
[2024-06-01 15:22:52] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 0 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 4 places in 527 ms of which 0 ms to minimize.
[2024-06-01 15:22:53] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 1 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 1 ms to minimize.
[2024-06-01 15:22:54] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 2 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:22:55] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 1 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 4 places in 114 ms of which 3 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-06-01 15:22:56] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-06-01 15:22:57] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 0 ms to minimize.
[2024-06-01 15:22:57] [INFO ] Deduced a trap composed of 4 places in 295 ms of which 0 ms to minimize.
[2024-06-01 15:22:57] [INFO ] Deduced a trap composed of 4 places in 232 ms of which 0 ms to minimize.
[2024-06-01 15:22:57] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2024-06-01 15:22:58] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-06-01 15:22:58] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-06-01 15:22:58] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:23:02] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 0 ms to minimize.
[2024-06-01 15:23:02] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 1 ms to minimize.
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-06-01 15:23:03] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 1 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 1 ms to minimize.
[2024-06-01 15:23:04] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-06-01 15:23:05] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 15:23:05] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 15:23:05] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92995ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93020ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94587 ms. Remains : 34/34 places, 2104/2104 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 44 steps (0 resets) in 8 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
[2024-06-01 15:23:41] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:23:41] [INFO ] Invariant cache hit.
[2024-06-01 15:23:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 15:23:43] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-06-01 15:23:43] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:23:43] [INFO ] [Real]Added 2069 Read/Feed constraints in 210 ms returned sat
[2024-06-01 15:23:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:23:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 15:23:45] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2024-06-01 15:23:45] [INFO ] [Nat]Added 2069 Read/Feed constraints in 262 ms returned sat
[2024-06-01 15:23:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 1143 ms.
[2024-06-01 15:23:47] [INFO ] Added : 0 causal constraints over 0 iterations in 1305 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4744 ms.
Product exploration explored 100000 steps with 8333 reset in 4795 ms.
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 2104/2104 transitions.
Applied a total of 0 rules in 640 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 15:23:57] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:23:57] [INFO ] Invariant cache hit.
[2024-06-01 15:23:57] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 15:23:57] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:23:57] [INFO ] Invariant cache hit.
[2024-06-01 15:23:57] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:23:57] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 662 ms to find 0 implicit places.
[2024-06-01 15:23:58] [INFO ] Redundant transitions in 268 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:23:58] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:23:58] [INFO ] Invariant cache hit.
[2024-06-01 15:23:58] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:24:37] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 15:24:37] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:24:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:24:37] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:24:37] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-06-01 15:24:38] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-06-01 15:24:38] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-06-01 15:24:38] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-06-01 15:24:38] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-06-01 15:24:39] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 1 ms to minimize.
[2024-06-01 15:24:39] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 1 ms to minimize.
[2024-06-01 15:24:40] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 0 ms to minimize.
[2024-06-01 15:24:41] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2024-06-01 15:24:41] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 1 ms to minimize.
[2024-06-01 15:24:42] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 0 ms to minimize.
[2024-06-01 15:24:42] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 0 ms to minimize.
[2024-06-01 15:24:43] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 0 ms to minimize.
[2024-06-01 15:24:43] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 1 ms to minimize.
[2024-06-01 15:24:44] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 1 ms to minimize.
[2024-06-01 15:24:44] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 15:24:45] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:24:46] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:24:46] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 15:24:46] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-06-01 15:24:46] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-06-01 15:24:46] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-06-01 15:24:47] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-06-01 15:24:47] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-06-01 15:24:47] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 15:24:47] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 1 ms to minimize.
[2024-06-01 15:24:51] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-06-01 15:24:52] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-06-01 15:24:53] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:24:54] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93155ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93176ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94762 ms. Remains : 34/34 places, 2104/2104 transitions.
Treatment of property StigmergyElection-PT-11a-LTLFireability-09 finished in 315483 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' '!(F(G(p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1653 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-06-01 15:25:33] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:25:33] [INFO ] Invariant cache hit.
[2024-06-01 15:25:33] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 15:25:33] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:25:33] [INFO ] Invariant cache hit.
[2024-06-01 15:25:34] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:25:34] [INFO ] Implicit Places using invariants and state equation in 713 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2024-06-01 15:25:34] [INFO ] Redundant transitions in 280 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:25:34] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:25:34] [INFO ] Invariant cache hit.
[2024-06-01 15:25:34] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:26:14] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 15:26:14] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:26:14] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:26:14] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:26:14] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-06-01 15:26:14] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-06-01 15:26:15] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-06-01 15:26:15] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-06-01 15:26:15] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-06-01 15:26:16] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2024-06-01 15:26:16] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 1 ms to minimize.
[2024-06-01 15:26:17] [INFO ] Deduced a trap composed of 4 places in 639 ms of which 1 ms to minimize.
[2024-06-01 15:26:18] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2024-06-01 15:26:18] [INFO ] Deduced a trap composed of 4 places in 626 ms of which 1 ms to minimize.
[2024-06-01 15:26:19] [INFO ] Deduced a trap composed of 4 places in 748 ms of which 1 ms to minimize.
[2024-06-01 15:26:19] [INFO ] Deduced a trap composed of 4 places in 517 ms of which 0 ms to minimize.
[2024-06-01 15:26:20] [INFO ] Deduced a trap composed of 4 places in 575 ms of which 0 ms to minimize.
[2024-06-01 15:26:20] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 0 ms to minimize.
[2024-06-01 15:26:21] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 0 ms to minimize.
[2024-06-01 15:26:21] [INFO ] Deduced a trap composed of 4 places in 510 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 15:26:22] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:26:23] [INFO ] Deduced a trap composed of 4 places in 358 ms of which 1 ms to minimize.
[2024-06-01 15:26:24] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-06-01 15:26:24] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-06-01 15:26:24] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-06-01 15:26:24] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-06-01 15:26:24] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-06-01 15:26:24] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:26:28] [INFO ] Deduced a trap composed of 4 places in 362 ms of which 0 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 4 places in 420 ms of which 0 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 0 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 1 ms to minimize.
[2024-06-01 15:26:29] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 1 ms to minimize.
[2024-06-01 15:26:30] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 0 ms to minimize.
[2024-06-01 15:26:30] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 0 ms to minimize.
[2024-06-01 15:26:30] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 1 ms to minimize.
[2024-06-01 15:26:30] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-06-01 15:26:31] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-06-01 15:26:31] [INFO ] Deduced a trap composed of 4 places in 173 ms of which 0 ms to minimize.
[2024-06-01 15:26:31] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-06-01 15:26:31] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-06-01 15:26:31] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-06-01 15:26:31] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 92927ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92948ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95652 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-11
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-11 finished in 95729 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' '!(F(p0))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1615 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-06-01 15:27:09] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:27:09] [INFO ] Invariant cache hit.
[2024-06-01 15:27:09] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 15:27:09] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:27:09] [INFO ] Invariant cache hit.
[2024-06-01 15:27:09] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:27:10] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-06-01 15:27:10] [INFO ] Redundant transitions in 280 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:27:10] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:27:10] [INFO ] Invariant cache hit.
[2024-06-01 15:27:10] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:27:49] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:27:49] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:27:49] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 15:27:49] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:27:50] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-06-01 15:27:50] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-06-01 15:27:50] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-06-01 15:27:50] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-06-01 15:27:50] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-06-01 15:27:51] [INFO ] Deduced a trap composed of 4 places in 644 ms of which 1 ms to minimize.
[2024-06-01 15:27:52] [INFO ] Deduced a trap composed of 4 places in 647 ms of which 1 ms to minimize.
[2024-06-01 15:27:52] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 0 ms to minimize.
[2024-06-01 15:27:53] [INFO ] Deduced a trap composed of 4 places in 631 ms of which 0 ms to minimize.
[2024-06-01 15:27:54] [INFO ] Deduced a trap composed of 4 places in 591 ms of which 1 ms to minimize.
[2024-06-01 15:27:54] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2024-06-01 15:27:55] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 1 ms to minimize.
[2024-06-01 15:27:55] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 0 ms to minimize.
[2024-06-01 15:27:56] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
[2024-06-01 15:27:56] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2024-06-01 15:27:56] [INFO ] Deduced a trap composed of 4 places in 509 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-06-01 15:27:57] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-06-01 15:27:58] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:27:58] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 15:27:58] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 15:27:58] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-06-01 15:27:58] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-06-01 15:27:58] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-06-01 15:27:58] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-06-01 15:27:59] [INFO ] Deduced a trap composed of 4 places in 205 ms of which 0 ms to minimize.
[2024-06-01 15:27:59] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-06-01 15:27:59] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-06-01 15:27:59] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-06-01 15:27:59] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:28:03] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 0 ms to minimize.
[2024-06-01 15:28:03] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2024-06-01 15:28:04] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2024-06-01 15:28:04] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-06-01 15:28:04] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-06-01 15:28:04] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-06-01 15:28:05] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-06-01 15:28:06] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-06-01 15:28:06] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-06-01 15:28:06] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93100ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95676 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-12
Product exploration explored 100000 steps with 8333 reset in 4808 ms.
Product exploration explored 100000 steps with 8333 reset in 4807 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
RANDOM walk for 44 steps (0 resets) in 9 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 15:28:53] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:28:53] [INFO ] Invariant cache hit.
[2024-06-01 15:28:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 15:28:55] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-06-01 15:28:55] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:28:55] [INFO ] [Real]Added 2069 Read/Feed constraints in 213 ms returned sat
[2024-06-01 15:28:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:28:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 15:28:57] [INFO ] [Nat]Absence check using state equation in 339 ms returned sat
[2024-06-01 15:28:57] [INFO ] [Nat]Added 2069 Read/Feed constraints in 272 ms returned sat
[2024-06-01 15:28:57] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 257 ms.
[2024-06-01 15:28:57] [INFO ] Added : 0 causal constraints over 0 iterations in 410 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 2104/2104 transitions.
Applied a total of 0 rules in 663 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 15:28:58] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:28:58] [INFO ] Invariant cache hit.
[2024-06-01 15:28:58] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 15:28:58] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:28:58] [INFO ] Invariant cache hit.
[2024-06-01 15:28:58] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:28:59] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2024-06-01 15:28:59] [INFO ] Redundant transitions in 262 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:28:59] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:28:59] [INFO ] Invariant cache hit.
[2024-06-01 15:28:59] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:29:38] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-06-01 15:29:39] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-06-01 15:29:40] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 1 ms to minimize.
[2024-06-01 15:29:41] [INFO ] Deduced a trap composed of 4 places in 627 ms of which 1 ms to minimize.
[2024-06-01 15:29:41] [INFO ] Deduced a trap composed of 4 places in 638 ms of which 1 ms to minimize.
[2024-06-01 15:29:42] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 0 ms to minimize.
[2024-06-01 15:29:42] [INFO ] Deduced a trap composed of 4 places in 598 ms of which 0 ms to minimize.
[2024-06-01 15:29:43] [INFO ] Deduced a trap composed of 4 places in 613 ms of which 0 ms to minimize.
[2024-06-01 15:29:44] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 0 ms to minimize.
[2024-06-01 15:29:44] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 0 ms to minimize.
[2024-06-01 15:29:44] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2024-06-01 15:29:45] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-06-01 15:29:45] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-06-01 15:29:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:29:47] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-06-01 15:29:47] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-06-01 15:29:47] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2024-06-01 15:29:47] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-06-01 15:29:47] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:29:48] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-06-01 15:29:48] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-06-01 15:29:48] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-06-01 15:29:48] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:29:52] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2024-06-01 15:29:52] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 1 ms to minimize.
[2024-06-01 15:29:52] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-06-01 15:29:53] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-06-01 15:29:53] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-06-01 15:29:53] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-06-01 15:29:53] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-06-01 15:29:53] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-06-01 15:29:54] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-06-01 15:29:54] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-06-01 15:29:54] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-06-01 15:29:54] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:29:54] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 15:29:54] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-06-01 15:29:54] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93088ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93110ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94706 ms. Remains : 34/34 places, 2104/2104 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 44 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2024-06-01 15:30:32] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:30:32] [INFO ] Invariant cache hit.
[2024-06-01 15:30:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 15:30:34] [INFO ] [Real]Absence check using state equation in 348 ms returned sat
[2024-06-01 15:30:34] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:30:34] [INFO ] [Real]Added 2069 Read/Feed constraints in 209 ms returned sat
[2024-06-01 15:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 15:30:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 15:30:36] [INFO ] [Nat]Absence check using state equation in 314 ms returned sat
[2024-06-01 15:30:36] [INFO ] [Nat]Added 2069 Read/Feed constraints in 264 ms returned sat
[2024-06-01 15:30:36] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 265 ms.
[2024-06-01 15:30:36] [INFO ] Added : 0 causal constraints over 0 iterations in 407 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4775 ms.
Product exploration explored 100000 steps with 8333 reset in 4787 ms.
Support contains 11 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 2104/2104 transitions.
Applied a total of 0 rules in 644 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-06-01 15:30:47] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:30:47] [INFO ] Invariant cache hit.
[2024-06-01 15:30:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 15:30:47] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:30:47] [INFO ] Invariant cache hit.
[2024-06-01 15:30:47] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:30:47] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
[2024-06-01 15:30:48] [INFO ] Redundant transitions in 266 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:30:48] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:30:48] [INFO ] Invariant cache hit.
[2024-06-01 15:30:48] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:31:27] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:31:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:31:27] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 15:31:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:31:27] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-06-01 15:31:27] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-06-01 15:31:27] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-06-01 15:31:28] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-06-01 15:31:28] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 14 ms to minimize.
[2024-06-01 15:31:28] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 1 ms to minimize.
[2024-06-01 15:31:29] [INFO ] Deduced a trap composed of 4 places in 628 ms of which 1 ms to minimize.
[2024-06-01 15:31:30] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 0 ms to minimize.
[2024-06-01 15:31:30] [INFO ] Deduced a trap composed of 4 places in 607 ms of which 1 ms to minimize.
[2024-06-01 15:31:31] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 1 ms to minimize.
[2024-06-01 15:31:32] [INFO ] Deduced a trap composed of 4 places in 612 ms of which 0 ms to minimize.
[2024-06-01 15:31:32] [INFO ] Deduced a trap composed of 4 places in 519 ms of which 0 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 0 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 0 ms to minimize.
[2024-06-01 15:31:33] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2024-06-01 15:31:34] [INFO ] Deduced a trap composed of 4 places in 502 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:31:34] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:31:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:31:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:31:34] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-06-01 15:31:34] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-06-01 15:31:35] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-06-01 15:31:36] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2024-06-01 15:31:36] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-06-01 15:31:36] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-06-01 15:31:36] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-06-01 15:31:36] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-06-01 15:31:36] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-06-01 15:31:37] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:31:40] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 0 ms to minimize.
[2024-06-01 15:31:41] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2024-06-01 15:31:41] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-06-01 15:31:41] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-06-01 15:31:41] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-06-01 15:31:41] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-06-01 15:31:42] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-06-01 15:31:42] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-06-01 15:31:42] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-06-01 15:31:42] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-06-01 15:31:42] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-06-01 15:31:43] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-06-01 15:31:43] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-06-01 15:31:43] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 15:31:43] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93016ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93037ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94631 ms. Remains : 34/34 places, 2104/2104 transitions.
Treatment of property StigmergyElection-PT-11a-LTLFireability-12 finished in 313611 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' '!(F(((p1 U G(!p1))&&p0)))'
Support contains 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1631 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-06-01 15:32:23] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:32:23] [INFO ] Invariant cache hit.
[2024-06-01 15:32:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 15:32:23] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:32:23] [INFO ] Invariant cache hit.
[2024-06-01 15:32:23] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:32:23] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2024-06-01 15:32:24] [INFO ] Redundant transitions in 264 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:32:24] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:32:24] [INFO ] Invariant cache hit.
[2024-06-01 15:32:24] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:33:03] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-06-01 15:33:03] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 15:33:03] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:33:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 15:33:03] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-06-01 15:33:04] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-06-01 15:33:04] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-06-01 15:33:04] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-06-01 15:33:04] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-06-01 15:33:05] [INFO ] Deduced a trap composed of 4 places in 634 ms of which 0 ms to minimize.
[2024-06-01 15:33:06] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 0 ms to minimize.
[2024-06-01 15:33:06] [INFO ] Deduced a trap composed of 4 places in 622 ms of which 1 ms to minimize.
[2024-06-01 15:33:07] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 0 ms to minimize.
[2024-06-01 15:33:07] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 0 ms to minimize.
[2024-06-01 15:33:08] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 0 ms to minimize.
[2024-06-01 15:33:09] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 1 ms to minimize.
[2024-06-01 15:33:09] [INFO ] Deduced a trap composed of 4 places in 446 ms of which 0 ms to minimize.
[2024-06-01 15:33:09] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 1 ms to minimize.
[2024-06-01 15:33:10] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 0 ms to minimize.
[2024-06-01 15:33:10] [INFO ] Deduced a trap composed of 4 places in 505 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-06-01 15:33:11] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 15:33:12] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:33:12] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-06-01 15:33:12] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 1 ms to minimize.
[2024-06-01 15:33:12] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-06-01 15:33:12] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-06-01 15:33:13] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-06-01 15:33:13] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-06-01 15:33:13] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 15:33:13] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 0 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2024-06-01 15:33:17] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-06-01 15:33:18] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-06-01 15:33:19] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93153ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93174ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95751 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) p1), p1, p1]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-14
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-14 finished in 95895 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 11 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 4218/4218 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 22 Pre rules applied. Total rules applied 0 place count 89 transition count 4195
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 44 place count 67 transition count 4195
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 45 transition count 4173
Ensure Unique test removed 2047 transitions
Reduce isomorphic transitions removed 2047 transitions.
Iterating post reduction 0 with 2047 rules applied. Total rules applied 2135 place count 45 transition count 2126
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 1 with 11 rules applied. Total rules applied 2146 place count 45 transition count 2115
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 1 with 22 rules applied. Total rules applied 2168 place count 34 transition count 2104
Applied a total of 2168 rules in 1647 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-06-01 15:33:59] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:33:59] [INFO ] Invariant cache hit.
[2024-06-01 15:33:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 15:33:59] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:33:59] [INFO ] Invariant cache hit.
[2024-06-01 15:33:59] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-06-01 15:33:59] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-06-01 15:33:59] [INFO ] Redundant transitions in 277 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-06-01 15:33:59] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-06-01 15:33:59] [INFO ] Invariant cache hit.
[2024-06-01 15:34:00] [INFO ] State equation strengthened by 2069 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 15:34:39] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-06-01 15:34:40] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-06-01 15:34:41] [INFO ] Deduced a trap composed of 4 places in 654 ms of which 0 ms to minimize.
[2024-06-01 15:34:42] [INFO ] Deduced a trap composed of 4 places in 622 ms of which 1 ms to minimize.
[2024-06-01 15:34:42] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 0 ms to minimize.
[2024-06-01 15:34:43] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 1 ms to minimize.
[2024-06-01 15:34:43] [INFO ] Deduced a trap composed of 4 places in 600 ms of which 1 ms to minimize.
[2024-06-01 15:34:44] [INFO ] Deduced a trap composed of 4 places in 626 ms of which 1 ms to minimize.
[2024-06-01 15:34:45] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 0 ms to minimize.
[2024-06-01 15:34:45] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 0 ms to minimize.
[2024-06-01 15:34:45] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 1 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2024-06-01 15:34:46] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:34:47] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-06-01 15:34:48] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-06-01 15:34:49] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-06-01 15:34:49] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-06-01 15:34:49] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-06-01 15:34:49] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-06-01 15:34:53] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 0 ms to minimize.
[2024-06-01 15:34:53] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 0 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 0 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 1 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-06-01 15:34:54] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-06-01 15:34:55] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-06-01 15:34:56] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-06-01 15:34:56] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 34/2126 variables, and 56 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/34 constraints, ReadFeed: 0/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2093 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 1 (OVERLAPS) 11/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 4 (OVERLAPS) 2091/2125 variables, 34/90 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2125 variables, 2068/2158 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2125/2126 variables, and 2159 constraints, problems are : Problem set: 0 solved, 2093 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 2068/2069 constraints, PredecessorRefiner: 2093/1 constraints, Known Traps: 55/55 constraints]
After SMT, in 93168ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 93189ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 2104/4218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95787 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-15
Stuttering criterion allowed to conclude after 52188 steps with 4348 reset in 2505 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-15 finished in 98460 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' '!(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' '!(F(p0))'
[2024-06-01 15:35:36] [INFO ] Flatten gal took : 286 ms
[2024-06-01 15:35:36] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 15:35:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 4218 transitions and 90566 arcs took 55 ms.
Total runtime 1630527 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyElection-PT-11a-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyElection-PT-11a-LTLFireability-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717256153780
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyElection-PT-11a-LTLFireability-09
ltl formula formula --ltl=/tmp/3195/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 90 places, 4218 transitions and 90566 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.880 real 0.250 user 0.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3195/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3195/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3195/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3195/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 92 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 91, there are 4240 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): ~24 levels ~10000 states ~277100 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~20000 states ~647748 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~40000 states ~1532884 transitions
pnml2lts-mc( 1/ 4): ~24 levels ~80000 states ~3856072 transitions
pnml2lts-mc( 0/ 4): ~24 levels ~160000 states ~8259104 transitions
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: 177148
pnml2lts-mc( 0/ 4): unique states count: 177148
pnml2lts-mc( 0/ 4): unique transitions count: 9959609
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9783709
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 177238
pnml2lts-mc( 0/ 4): - cum. max stack depth: 94
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 177238 states 9966985 transitions, fanout: 56.235
pnml2lts-mc( 0/ 4): Total exploration time 7.240 sec (7.220 sec minimum, 7.235 sec on average)
pnml2lts-mc( 0/ 4): States per second: 24480, Transitions per second: 1376655
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 8.1 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4337 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~256.0MB paged-in)
ltl formula name StigmergyElection-PT-11a-LTLFireability-12
ltl formula formula --ltl=/tmp/3195/ltl_1_
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 90 places, 4218 transitions and 90566 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.240 user 0.160 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3195/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3195/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3195/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3195/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 92 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 91, there are 4240 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( 3/ 4): ~23 levels ~10000 states ~302316 transitions
pnml2lts-mc( 3/ 4): ~23 levels ~20000 states ~695632 transitions
pnml2lts-mc( 3/ 4): ~23 levels ~40000 states ~1624576 transitions
pnml2lts-mc( 3/ 4): ~23 levels ~80000 states ~3582520 transitions
pnml2lts-mc( 3/ 4): ~23 levels ~160000 states ~8454520 transitions
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: 177148
pnml2lts-mc( 0/ 4): unique states count: 177148
pnml2lts-mc( 0/ 4): unique transitions count: 9959609
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 9784007
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 177267
pnml2lts-mc( 0/ 4): - cum. max stack depth: 92
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 177267 states 9969705 transitions, fanout: 56.241
pnml2lts-mc( 0/ 4): Total exploration time 6.980 sec (6.980 sec minimum, 6.980 sec on average)
pnml2lts-mc( 0/ 4): States per second: 25396, Transitions per second: 1428324
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 8.1 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 4337 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~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-11a"
export BK_EXAMINATION="LTLFireability"
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-11a, examination is LTLFireability"
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-171690532200396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-11a.tgz
mv StigmergyElection-PT-11a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;