About the Execution of GreatSPN+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 |
| 3574.796 | 1651701.00 | 1847164.00 | 4297.20 | 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.r399-tall-171690530300396.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 greatspnxred
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 r399-tall-171690530300396
=====================================================================
--------------------
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 1717020946960
Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 22:15:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 22:15:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 22:15:52] [INFO ] Load time of PNML (sax parser for PT used): 4898 ms
[2024-05-29 22:15:53] [INFO ] Transformed 156 places.
[2024-05-29 22:15:53] [INFO ] Transformed 136650 transitions.
[2024-05-29 22:15:53] [INFO ] Found NUPN structural information;
[2024-05-29 22:15:53] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 5745 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 85 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 83 ms. Remains 124 /156 variables (removed 32) and now considering 4251/4305 (removed 54) transitions.
[2024-05-29 22:15:54] [INFO ] Flow matrix only has 4239 transitions (discarded 12 similar events)
// Phase 1: matrix 4239 rows 124 cols
[2024-05-29 22:15:54] [INFO ] Computed 2 invariants in 69 ms
[2024-05-29 22:15:55] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-29 22:15:55] [INFO ] Flow matrix only has 4239 transitions (discarded 12 similar events)
[2024-05-29 22:15:55] [INFO ] Invariant cache hit.
[2024-05-29 22:15:56] [INFO ] State equation strengthened by 4148 read => feed constraints.
[2024-05-29 22:15:57] [INFO ] Implicit Places using invariants and state equation in 2441 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2751 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 52 ms. Remains 90 /123 variables (removed 33) and now considering 4218/4251 (removed 33) transitions.
[2024-05-29 22:15:57] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:15:57] [INFO ] Computed 1 invariants in 29 ms
[2024-05-29 22:15:57] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 22:15:57] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:15:57] [INFO ] Invariant cache hit.
[2024-05-29 22:15:58] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:15:58] [INFO ] Implicit Places using invariants and state equation in 1409 ms returned []
Implicit Place search using SMT with State Equation took 1466 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 4374 ms. Remains : 90/156 places, 4218/4305 transitions.
Support contains 11 out of 90 places after structural reductions.
[2024-05-29 22:15:59] [INFO ] Flatten gal took : 543 ms
[2024-05-29 22:16:00] [INFO ] Flatten gal took : 366 ms
[2024-05-29 22:16:00] [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 (9 resets) in 12060 ms. (3 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
[2024-05-29 22:16:04] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:16:04] [INFO ] Invariant cache hit.
[2024-05-29 22:16:04] [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 22 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 646ms 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 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 1874 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:16:06] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 22:16:06] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 22:16:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 22:16:06] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:16:06] [INFO ] Invariant cache hit.
[2024-05-29 22:16:07] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:16:07] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2024-05-29 22:16:08] [INFO ] Redundant transitions in 284 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:16:08] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:16:08] [INFO ] Invariant cache hit.
[2024-05-29 22:16: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-05-29 22:16:46] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 7 ms to minimize.
[2024-05-29 22:16:46] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 1 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:16:47] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:16:48] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 22:16:48] [INFO ] Deduced a trap composed of 4 places in 617 ms of which 1 ms to minimize.
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 2 ms to minimize.
[2024-05-29 22:16:49] [INFO ] Deduced a trap composed of 4 places in 593 ms of which 1 ms to minimize.
[2024-05-29 22:16:50] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 1 ms to minimize.
[2024-05-29 22:16:51] [INFO ] Deduced a trap composed of 4 places in 589 ms of which 0 ms to minimize.
[2024-05-29 22:16:51] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 1 ms to minimize.
[2024-05-29 22:16:52] [INFO ] Deduced a trap composed of 4 places in 522 ms of which 2 ms to minimize.
[2024-05-29 22:16:52] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 1 ms to minimize.
[2024-05-29 22:16:53] [INFO ] Deduced a trap composed of 4 places in 398 ms of which 1 ms to minimize.
[2024-05-29 22:16:53] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 4 places in 501 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-05-29 22:16:54] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:16:54] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 4 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:16:55] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 4 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 1 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:16:56] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
[2024-05-29 22:17:00] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2024-05-29 22:17:01] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2024-05-29 22:17:01] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 1 ms to minimize.
[2024-05-29 22:17:01] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2024-05-29 22:17:01] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:17:01] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 22:17:02] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 22:17:02] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 22:17:02] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 22:17:02] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 22:17:02] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 22:17:03] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 2 ms to minimize.
[2024-05-29 22:17:03] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:17:03] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:17:03] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 4 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 30047 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
At refinement iteration 6 (INCLUDED_ONLY) 0/2125 variables, 1/2159 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 92558ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92584ms
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 95560 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 205 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 95825 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 18 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:17:40] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:17:40] [INFO ] Computed 1 invariants in 18 ms
[2024-05-29 22:17:40] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 22:17:40] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:17:40] [INFO ] Invariant cache hit.
[2024-05-29 22:17:42] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:17:42] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1550 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:17:42] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:17:42] [INFO ] Invariant cache hit.
[2024-05-29 22:17:42] [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-05-29 22:19:17] [INFO ] Deduced a trap composed of 9 places in 1308 ms of which 1 ms to minimize.
[2024-05-29 22:19:19] [INFO ] Deduced a trap composed of 9 places in 1347 ms of which 2 ms to minimize.
[2024-05-29 22:19:20] [INFO ] Deduced a trap composed of 9 places in 1308 ms of which 1 ms to minimize.
SMT process timed out in 97910ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 97960ms
Finished structural reductions in LTL mode , in 1 iterations and 99549 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 120 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 99707 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 1786 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:19:22] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 22:19:22] [INFO ] Computed 1 invariants in 13 ms
[2024-05-29 22:19:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 22:19:22] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:19:22] [INFO ] Invariant cache hit.
[2024-05-29 22:19:22] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:19:23] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2024-05-29 22:19:23] [INFO ] Redundant transitions in 290 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:19:23] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:19:23] [INFO ] Invariant cache hit.
[2024-05-29 22:19:23] [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-05-29 22:20:01] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 22:20:01] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:20:01] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:20:01] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 22:20:02] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 22:20:03] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 1 ms to minimize.
[2024-05-29 22:20:04] [INFO ] Deduced a trap composed of 4 places in 612 ms of which 1 ms to minimize.
[2024-05-29 22:20:04] [INFO ] Deduced a trap composed of 4 places in 609 ms of which 1 ms to minimize.
[2024-05-29 22:20:05] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 1 ms to minimize.
[2024-05-29 22:20:06] [INFO ] Deduced a trap composed of 4 places in 601 ms of which 1 ms to minimize.
[2024-05-29 22:20:06] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 0 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 1 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 0 ms to minimize.
[2024-05-29 22:20:07] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2024-05-29 22:20:08] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 0 ms to minimize.
[2024-05-29 22:20:08] [INFO ] Deduced a trap composed of 4 places in 494 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-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 22:20:09] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:20:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:20:10] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 1 ms to minimize.
[2024-05-29 22:20:10] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 22:20:10] [INFO ] Deduced a trap composed of 4 places in 283 ms of which 0 ms to minimize.
[2024-05-29 22:20:10] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 22:20:11] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:20:11] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-29 22:20:11] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 22:20:11] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 22:20:11] [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-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 0 ms to minimize.
[2024-05-29 22:20:15] [INFO ] Deduced a trap composed of 4 places in 303 ms of which 1 ms to minimize.
[2024-05-29 22:20:16] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-29 22:20:16] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 0 ms to minimize.
[2024-05-29 22:20:16] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2024-05-29 22:20:16] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:20:17] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:20:18] [INFO ] Deduced a trap composed of 4 places in 148 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 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 92183ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92206ms
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 94972 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 149 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 3 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-02 finished in 95156 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 15 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:20:55] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:20:55] [INFO ] Computed 1 invariants in 23 ms
[2024-05-29 22:20:55] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-29 22:20:55] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:20:55] [INFO ] Invariant cache hit.
[2024-05-29 22:20:56] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:20:57] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:20:57] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:20:57] [INFO ] Invariant cache hit.
[2024-05-29 22:20:57] [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-05-29 22:22:30] [INFO ] Deduced a trap composed of 9 places in 1278 ms of which 1 ms to minimize.
[2024-05-29 22:22:32] [INFO ] Deduced a trap composed of 9 places in 1293 ms of which 0 ms to minimize.
[2024-05-29 22:22:33] [INFO ] Deduced a trap composed of 9 places in 1302 ms of which 1 ms to minimize.
SMT process timed out in 96304ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 96345ms
Finished structural reductions in LTL mode , in 1 iterations and 97704 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 166 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 4 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-03 finished in 97904 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 12 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:22:33] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:22:33] [INFO ] Invariant cache hit.
[2024-05-29 22:22:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 22:22:33] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:22:33] [INFO ] Invariant cache hit.
[2024-05-29 22:22:34] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:22:34] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:22:35] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:22:35] [INFO ] Invariant cache hit.
[2024-05-29 22:22:35] [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-05-29 22:24:09] [INFO ] Deduced a trap composed of 9 places in 1293 ms of which 1 ms to minimize.
[2024-05-29 22:24:10] [INFO ] Deduced a trap composed of 9 places in 1300 ms of which 0 ms to minimize.
[2024-05-29 22:24:11] [INFO ] Deduced a trap composed of 9 places in 1303 ms of which 1 ms to minimize.
SMT process timed out in 96797ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 96839ms
Finished structural reductions in LTL mode , in 1 iterations and 98230 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 190 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 2 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-05 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(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 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 1849 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:24:13] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 22:24:13] [INFO ] Computed 1 invariants in 12 ms
[2024-05-29 22:24:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 22:24:13] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:24:13] [INFO ] Invariant cache hit.
[2024-05-29 22:24:14] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:24:14] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
[2024-05-29 22:24:14] [INFO ] Redundant transitions in 301 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:24:14] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:24:14] [INFO ] Invariant cache hit.
[2024-05-29 22:24:15] [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-05-29 22:24:53] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 22:24:53] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-05-29 22:24:53] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:24:53] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 22:24:53] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 22:24:53] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 22:24:54] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:24:54] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:24:54] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:24:55] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2024-05-29 22:24:55] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 1 ms to minimize.
[2024-05-29 22:24:56] [INFO ] Deduced a trap composed of 4 places in 629 ms of which 0 ms to minimize.
[2024-05-29 22:24:57] [INFO ] Deduced a trap composed of 4 places in 626 ms of which 0 ms to minimize.
[2024-05-29 22:24:57] [INFO ] Deduced a trap composed of 4 places in 609 ms of which 1 ms to minimize.
[2024-05-29 22:24:58] [INFO ] Deduced a trap composed of 4 places in 615 ms of which 0 ms to minimize.
[2024-05-29 22:24:58] [INFO ] Deduced a trap composed of 4 places in 520 ms of which 1 ms to minimize.
[2024-05-29 22:24:59] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 2 ms to minimize.
[2024-05-29 22:24:59] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 0 ms to minimize.
[2024-05-29 22:24:59] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 1 ms to minimize.
[2024-05-29 22:25:00] [INFO ] Deduced a trap composed of 4 places in 514 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-05-29 22:25:00] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 22:25:00] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 22:25:01] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-29 22:25:02] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-29 22:25:03] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 22:25:03] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:25:03] [INFO ] Deduced a trap composed of 4 places in 66 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-05-29 22:25:07] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 0 ms to minimize.
[2024-05-29 22:25:07] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
[2024-05-29 22:25:07] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-05-29 22:25:08] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 22:25:08] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 22:25:08] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 22:25:08] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 1 ms to minimize.
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 1 ms to minimize.
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 1 ms to minimize.
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:25:09] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:25:10] [INFO ] Deduced a trap composed of 4 places in 145 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 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 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 92253ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92274ms
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 95101 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 40 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 1 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-06 finished in 95165 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 15 ms. Remains 90 /90 variables (removed 0) and now considering 4218/4218 (removed 0) transitions.
[2024-05-29 22:25:47] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
// Phase 1: matrix 4206 rows 90 cols
[2024-05-29 22:25:47] [INFO ] Computed 1 invariants in 21 ms
[2024-05-29 22:25:47] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 22:25:47] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:25:47] [INFO ] Invariant cache hit.
[2024-05-29 22:25:48] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 22:25:48] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1363 ms to find 0 implicit places.
Running 4217 sub problems to find dead transitions.
[2024-05-29 22:25:48] [INFO ] Flow matrix only has 4206 transitions (discarded 12 similar events)
[2024-05-29 22:25:48] [INFO ] Invariant cache hit.
[2024-05-29 22:25:48] [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-05-29 22:27:23] [INFO ] Deduced a trap composed of 9 places in 1300 ms of which 1 ms to minimize.
[2024-05-29 22:27:24] [INFO ] Deduced a trap composed of 9 places in 1312 ms of which 1 ms to minimize.
[2024-05-29 22:27:25] [INFO ] Deduced a trap composed of 9 places in 1294 ms of which 1 ms to minimize.
SMT process timed out in 96988ms, After SMT, problems are : Problem set: 0 solved, 4217 unsolved
Search for dead transitions found 0 dead transitions in 97029ms
Finished structural reductions in LTL mode , in 1 iterations and 98427 ms. Remains : 90/90 places, 4218/4218 transitions.
Stuttering acceptance computed with spot in 103 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 2 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-08 finished in 98557 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 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 1732 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:27:27] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
// Phase 1: matrix 2092 rows 34 cols
[2024-05-29 22:27:27] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 22:27:27] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 22:27:27] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:27:27] [INFO ] Invariant cache hit.
[2024-05-29 22:27:27] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:27:28] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-29 22:27:28] [INFO ] Redundant transitions in 295 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:27:28] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:27:28] [INFO ] Invariant cache hit.
[2024-05-29 22:27:28] [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-05-29 22:28:06] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 22:28:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:28:06] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 22:28:06] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:28:07] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 22:28:07] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-29 22:28:07] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 22:28:07] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:28:07] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 22:28:08] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 1 ms to minimize.
[2024-05-29 22:28:09] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 1 ms to minimize.
[2024-05-29 22:28:09] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 0 ms to minimize.
[2024-05-29 22:28:10] [INFO ] Deduced a trap composed of 4 places in 613 ms of which 1 ms to minimize.
[2024-05-29 22:28:11] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 1 ms to minimize.
[2024-05-29 22:28:11] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 0 ms to minimize.
[2024-05-29 22:28:12] [INFO ] Deduced a trap composed of 4 places in 521 ms of which 0 ms to minimize.
[2024-05-29 22:28:12] [INFO ] Deduced a trap composed of 4 places in 463 ms of which 0 ms to minimize.
[2024-05-29 22:28:13] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 0 ms to minimize.
[2024-05-29 22:28:13] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 1 ms to minimize.
[2024-05-29 22:28:13] [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-05-29 22:28:14] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 22:28:14] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:28:14] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:28:14] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:28:14] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:28:14] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:28:14] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:28:14] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:28:15] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 22:28:15] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:28:15] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:28:15] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 22:28:15] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 22:28:15] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-05-29 22:28:15] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 22:28:16] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-29 22:28:16] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:28:16] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 22:28:16] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:28:16] [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-05-29 22:28:20] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2024-05-29 22:28:20] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2024-05-29 22:28:20] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 1 ms to minimize.
[2024-05-29 22:28:21] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-29 22:28:21] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 22:28:21] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:28:21] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-05-29 22:28:22] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 22:28:22] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:28:22] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 1 ms to minimize.
[2024-05-29 22:28:22] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 22:28:22] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 22:28:22] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 22:28:22] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 22:28:23] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 15/56 constraints. Problems are: Problem set: 0 solved, 2093 unsolved
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 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 92301ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92322ms
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 95035 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-09
Product exploration explored 100000 steps with 8333 reset in 4964 ms.
Product exploration explored 100000 steps with 8333 reset in 4905 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 74 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 27 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 102 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
[2024-05-29 22:29:11] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:29:11] [INFO ] Invariant cache hit.
[2024-05-29 22:29:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:29:12] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2024-05-29 22:29:13] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:29:13] [INFO ] [Real]Added 2069 Read/Feed constraints in 223 ms returned sat
[2024-05-29 22:29:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:29:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:29:15] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2024-05-29 22:29:15] [INFO ] [Nat]Added 2069 Read/Feed constraints in 263 ms returned sat
[2024-05-29 22:29:16] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 536 ms.
[2024-05-29 22:29:16] [INFO ] Added : 0 causal constraints over 0 iterations in 722 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 697 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-29 22:29:16] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:29:16] [INFO ] Invariant cache hit.
[2024-05-29 22:29:16] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 22:29:16] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:29:16] [INFO ] Invariant cache hit.
[2024-05-29 22:29:17] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:29:17] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2024-05-29 22:29:17] [INFO ] Redundant transitions in 285 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:29:17] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:29:17] [INFO ] Invariant cache hit.
[2024-05-29 22:29:17] [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-05-29 22:29:56] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 22:29:56] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:29:56] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-05-29 22:29:56] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:29:56] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-29 22:29:57] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:29:57] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 22:29:57] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:29:57] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 22:29:58] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 0 ms to minimize.
[2024-05-29 22:29:58] [INFO ] Deduced a trap composed of 4 places in 634 ms of which 1 ms to minimize.
[2024-05-29 22:29:59] [INFO ] Deduced a trap composed of 4 places in 639 ms of which 1 ms to minimize.
[2024-05-29 22:30:00] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 1 ms to minimize.
[2024-05-29 22:30:00] [INFO ] Deduced a trap composed of 4 places in 618 ms of which 1 ms to minimize.
[2024-05-29 22:30:01] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 0 ms to minimize.
[2024-05-29 22:30:01] [INFO ] Deduced a trap composed of 4 places in 515 ms of which 1 ms to minimize.
[2024-05-29 22:30:02] [INFO ] Deduced a trap composed of 4 places in 447 ms of which 1 ms to minimize.
[2024-05-29 22:30:02] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2024-05-29 22:30:03] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 0 ms to minimize.
[2024-05-29 22:30:03] [INFO ] Deduced a trap composed of 4 places in 510 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-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 2 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:30:04] [INFO ] Deduced a trap composed of 4 places in 93 ms of which 0 ms to minimize.
[2024-05-29 22:30:05] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:30:05] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-05-29 22:30:05] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 1 ms to minimize.
[2024-05-29 22:30:05] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 22:30:06] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-29 22:30:06] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 22:30:06] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 1 ms to minimize.
[2024-05-29 22:30:06] [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-05-29 22:30:10] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2024-05-29 22:30:10] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2024-05-29 22:30:10] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 0 ms to minimize.
[2024-05-29 22:30:10] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2024-05-29 22:30:11] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:30:11] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 1 ms to minimize.
[2024-05-29 22:30:11] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-29 22:30:11] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 22:30:11] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2024-05-29 22:30:12] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 22:30:12] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:30:12] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 22:30:12] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:30:12] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 22:30:12] [INFO ] Deduced a trap composed of 4 places in 151 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 30033 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 92304ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92329ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 93990 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 83 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 102 ms :[(NOT p0)]
RANDOM walk for 44 steps (0 resets) in 11 ms. (3 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 111 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-29 22:30:50] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:30:50] [INFO ] Invariant cache hit.
[2024-05-29 22:30:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 22:30:52] [INFO ] [Real]Absence check using state equation in 349 ms returned sat
[2024-05-29 22:30:52] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:30:52] [INFO ] [Real]Added 2069 Read/Feed constraints in 211 ms returned sat
[2024-05-29 22:30:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:30:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:30:53] [INFO ] [Nat]Absence check using state equation in 352 ms returned sat
[2024-05-29 22:30:54] [INFO ] [Nat]Added 2069 Read/Feed constraints in 255 ms returned sat
[2024-05-29 22:30:54] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 389 ms.
[2024-05-29 22:30:54] [INFO ] Added : 0 causal constraints over 0 iterations in 536 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4820 ms.
Product exploration explored 100000 steps with 8333 reset in 4852 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 686 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-29 22:31:05] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:31:05] [INFO ] Invariant cache hit.
[2024-05-29 22:31:05] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 22:31:05] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:31:05] [INFO ] Invariant cache hit.
[2024-05-29 22:31:05] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:31:05] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2024-05-29 22:31:06] [INFO ] Redundant transitions in 285 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:31:06] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:31:06] [INFO ] Invariant cache hit.
[2024-05-29 22:31:06] [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-05-29 22:31:44] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 22:31:44] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:31:45] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:31:45] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 22:31:45] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 22:31:45] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 22:31:45] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 22:31:45] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:31:46] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-29 22:31:46] [INFO ] Deduced a trap composed of 4 places in 642 ms of which 1 ms to minimize.
[2024-05-29 22:31:47] [INFO ] Deduced a trap composed of 4 places in 641 ms of which 0 ms to minimize.
[2024-05-29 22:31:47] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 1 ms to minimize.
[2024-05-29 22:31:48] [INFO ] Deduced a trap composed of 4 places in 624 ms of which 1 ms to minimize.
[2024-05-29 22:31:49] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 1 ms to minimize.
[2024-05-29 22:31:49] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 0 ms to minimize.
[2024-05-29 22:31:50] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 0 ms to minimize.
[2024-05-29 22:31:50] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 1 ms to minimize.
[2024-05-29 22:31:51] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 1 ms to minimize.
[2024-05-29 22:31:51] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 0 ms to minimize.
[2024-05-29 22:31:52] [INFO ] Deduced a trap composed of 4 places in 514 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-05-29 22:31:52] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 22:31:52] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 22:31:52] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 22:31:52] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:31:52] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 22:31:52] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:31:53] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 22:31:53] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 22:31:53] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:31:53] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:31:53] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 22:31:53] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:31:53] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:31:53] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-29 22:31:54] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-29 22:31:54] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 22:31:54] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-29 22:31:54] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 0 ms to minimize.
[2024-05-29 22:31:54] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:31:54] [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-05-29 22:31:58] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2024-05-29 22:31:59] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 0 ms to minimize.
[2024-05-29 22:31:59] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 1 ms to minimize.
[2024-05-29 22:31:59] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-29 22:31:59] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-29 22:31:59] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 22:32:00] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-29 22:32:00] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:32:00] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:32:00] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 22:32:00] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 22:32:01] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 22:32:01] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:32:01] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:32:01] [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 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 30045 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 92472ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92492ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 94121 ms. Remains : 34/34 places, 2104/2104 transitions.
Treatment of property StigmergyElection-PT-11a-LTLFireability-09 finished in 313619 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 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 1745 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:32:41] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:32:41] [INFO ] Invariant cache hit.
[2024-05-29 22:32:41] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 22:32:41] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:32:41] [INFO ] Invariant cache hit.
[2024-05-29 22:32:41] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:32:41] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-29 22:32:42] [INFO ] Redundant transitions in 296 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:32:42] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:32:42] [INFO ] Invariant cache hit.
[2024-05-29 22:32:42] [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-05-29 22:33:20] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-05-29 22:33:21] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:33:21] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 22:33:21] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 22:33:21] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 1 ms to minimize.
[2024-05-29 22:33:21] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-29 22:33:21] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 1 ms to minimize.
[2024-05-29 22:33:21] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 22:33:22] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 22:33:22] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 1 ms to minimize.
[2024-05-29 22:33:23] [INFO ] Deduced a trap composed of 4 places in 612 ms of which 0 ms to minimize.
[2024-05-29 22:33:23] [INFO ] Deduced a trap composed of 4 places in 597 ms of which 1 ms to minimize.
[2024-05-29 22:33:24] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 0 ms to minimize.
[2024-05-29 22:33:25] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 1 ms to minimize.
[2024-05-29 22:33:25] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 0 ms to minimize.
[2024-05-29 22:33:26] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 1 ms to minimize.
[2024-05-29 22:33:26] [INFO ] Deduced a trap composed of 4 places in 437 ms of which 1 ms to minimize.
[2024-05-29 22:33:27] [INFO ] Deduced a trap composed of 4 places in 381 ms of which 1 ms to minimize.
[2024-05-29 22:33:27] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 1 ms to minimize.
[2024-05-29 22:33:28] [INFO ] Deduced a trap composed of 4 places in 493 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-05-29 22:33:28] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 22:33:28] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:33:28] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 22:33:28] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:33:28] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 22:33:28] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 22:33:28] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:33:29] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:33:29] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 22:33:29] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:33:29] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:33:29] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:33:29] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 22:33:29] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-29 22:33:30] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 22:33:30] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 1 ms to minimize.
[2024-05-29 22:33:30] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 22:33:30] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 22:33:30] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:33:30] [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-05-29 22:33:34] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-05-29 22:33:35] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2024-05-29 22:33:35] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2024-05-29 22:33:35] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 22:33:35] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:33:35] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 22:33:36] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-29 22:33:36] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-29 22:33:36] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:33:36] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 22:33:36] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:33:37] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 22:33:37] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:33:37] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:33:37] [INFO ] Deduced a trap composed of 4 places in 142 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 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 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 92483ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92504ms
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 95224 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 2 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-11 finished in 95345 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 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 1737 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:34:16] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:34:16] [INFO ] Invariant cache hit.
[2024-05-29 22:34:16] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 22:34:16] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:34:16] [INFO ] Invariant cache hit.
[2024-05-29 22:34:16] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:34:17] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-05-29 22:34:17] [INFO ] Redundant transitions in 298 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:34:17] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:34:17] [INFO ] Invariant cache hit.
[2024-05-29 22:34:17] [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-05-29 22:34:56] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 22:34:56] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:34:56] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:34:56] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:34:56] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:34:56] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:34:56] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:34:57] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 1 ms to minimize.
[2024-05-29 22:34:57] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-29 22:34:57] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 1 ms to minimize.
[2024-05-29 22:34:58] [INFO ] Deduced a trap composed of 4 places in 613 ms of which 1 ms to minimize.
[2024-05-29 22:34:59] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2024-05-29 22:34:59] [INFO ] Deduced a trap composed of 4 places in 607 ms of which 0 ms to minimize.
[2024-05-29 22:35:00] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 0 ms to minimize.
[2024-05-29 22:35:00] [INFO ] Deduced a trap composed of 4 places in 620 ms of which 0 ms to minimize.
[2024-05-29 22:35:01] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 1 ms to minimize.
[2024-05-29 22:35:01] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2024-05-29 22:35:02] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 0 ms to minimize.
[2024-05-29 22:35:02] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 0 ms to minimize.
[2024-05-29 22:35:03] [INFO ] Deduced a trap composed of 4 places in 506 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-05-29 22:35:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:35:03] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 22:35:03] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:35:03] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 1 ms to minimize.
[2024-05-29 22:35:03] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:35:04] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:35:04] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 22:35:04] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-05-29 22:35:04] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:35:04] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 22:35:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-05-29 22:35:04] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 22:35:04] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:35:04] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-29 22:35:05] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-29 22:35:05] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2024-05-29 22:35:05] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-29 22:35:05] [INFO ] Deduced a trap composed of 4 places in 160 ms of which 1 ms to minimize.
[2024-05-29 22:35:05] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 22:35:05] [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-05-29 22:35:09] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 0 ms to minimize.
[2024-05-29 22:35:10] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 0 ms to minimize.
[2024-05-29 22:35:10] [INFO ] Deduced a trap composed of 4 places in 304 ms of which 0 ms to minimize.
[2024-05-29 22:35:10] [INFO ] Deduced a trap composed of 4 places in 238 ms of which 0 ms to minimize.
[2024-05-29 22:35:10] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:35:11] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 22:35:11] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 0 ms to minimize.
[2024-05-29 22:35:11] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 0 ms to minimize.
[2024-05-29 22:35:11] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-29 22:35:11] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 22:35:12] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-29 22:35:12] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:35:12] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:35:12] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 22:35:12] [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 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 30035 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 92507ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92528ms
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 95242 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-12
Product exploration explored 100000 steps with 8333 reset in 4820 ms.
Product exploration explored 100000 steps with 8333 reset in 4823 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 87 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 11 ms. (3 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 112 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 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-29 22:36:00] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:36:00] [INFO ] Invariant cache hit.
[2024-05-29 22:36:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:36:01] [INFO ] [Real]Absence check using state equation in 351 ms returned sat
[2024-05-29 22:36:01] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:36:02] [INFO ] [Real]Added 2069 Read/Feed constraints in 213 ms returned sat
[2024-05-29 22:36:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:36:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:36:03] [INFO ] [Nat]Absence check using state equation in 341 ms returned sat
[2024-05-29 22:36:03] [INFO ] [Nat]Added 2069 Read/Feed constraints in 259 ms returned sat
[2024-05-29 22:36:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 246 ms.
[2024-05-29 22:36:04] [INFO ] Added : 0 causal constraints over 0 iterations in 394 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 682 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-29 22:36:04] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:36:04] [INFO ] Invariant cache hit.
[2024-05-29 22:36:04] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 22:36:04] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:36:04] [INFO ] Invariant cache hit.
[2024-05-29 22:36:05] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:36:05] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 670 ms to find 0 implicit places.
[2024-05-29 22:36:05] [INFO ] Redundant transitions in 283 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:36:05] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:36:05] [INFO ] Invariant cache hit.
[2024-05-29 22:36: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-05-29 22:36:44] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:36:44] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:36:44] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 22:36:44] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:36:44] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 1 ms to minimize.
[2024-05-29 22:36:45] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:36:45] [INFO ] Deduced a trap composed of 4 places in 189 ms of which 0 ms to minimize.
[2024-05-29 22:36:45] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:36:45] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 22:36:46] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2024-05-29 22:36:46] [INFO ] Deduced a trap composed of 4 places in 625 ms of which 0 ms to minimize.
[2024-05-29 22:36:47] [INFO ] Deduced a trap composed of 4 places in 633 ms of which 1 ms to minimize.
[2024-05-29 22:36:48] [INFO ] Deduced a trap composed of 4 places in 606 ms of which 0 ms to minimize.
[2024-05-29 22:36:48] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 0 ms to minimize.
[2024-05-29 22:36:49] [INFO ] Deduced a trap composed of 4 places in 612 ms of which 0 ms to minimize.
[2024-05-29 22:36:49] [INFO ] Deduced a trap composed of 4 places in 519 ms of which 1 ms to minimize.
[2024-05-29 22:36:50] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 1 ms to minimize.
[2024-05-29 22:36:50] [INFO ] Deduced a trap composed of 4 places in 389 ms of which 0 ms to minimize.
[2024-05-29 22:36:51] [INFO ] Deduced a trap composed of 4 places in 325 ms of which 0 ms to minimize.
[2024-05-29 22:36:51] [INFO ] Deduced a trap composed of 4 places in 500 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-05-29 22:36:51] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 22:36:51] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 0 ms to minimize.
[2024-05-29 22:36:52] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:36:53] [INFO ] Deduced a trap composed of 4 places in 288 ms of which 0 ms to minimize.
[2024-05-29 22:36:53] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 1 ms to minimize.
[2024-05-29 22:36:53] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 22:36:53] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-29 22:36:54] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 22:36:54] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 22:36:54] [INFO ] Deduced a trap composed of 4 places in 56 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-05-29 22:36:58] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 0 ms to minimize.
[2024-05-29 22:36:58] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2024-05-29 22:36:58] [INFO ] Deduced a trap composed of 4 places in 289 ms of which 1 ms to minimize.
[2024-05-29 22:36:59] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 0 ms to minimize.
[2024-05-29 22:36:59] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 0 ms to minimize.
[2024-05-29 22:36:59] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 22:36:59] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 22:36:59] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 0 ms to minimize.
[2024-05-29 22:37:00] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 22:37:00] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:37:00] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 22:37:00] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 1 ms to minimize.
[2024-05-29 22:37:00] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 22:37:00] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 22:37:00] [INFO ] Deduced a trap composed of 4 places in 151 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 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 92265ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92285ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 93931 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 74 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 38 ms :[(NOT p0)]
RANDOM walk for 44 steps (0 resets) in 5 ms. (7 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 97 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 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2024-05-29 22:37:38] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:37:38] [INFO ] Invariant cache hit.
[2024-05-29 22:37:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 22:37:40] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2024-05-29 22:37:40] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:37:40] [INFO ] [Real]Added 2069 Read/Feed constraints in 209 ms returned sat
[2024-05-29 22:37:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 22:37:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-29 22:37:41] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2024-05-29 22:37:42] [INFO ] [Nat]Added 2069 Read/Feed constraints in 260 ms returned sat
[2024-05-29 22:37:42] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 2081 transitions) in 246 ms.
[2024-05-29 22:37:42] [INFO ] Added : 0 causal constraints over 0 iterations in 387 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8333 reset in 4827 ms.
Product exploration explored 100000 steps with 8333 reset in 4827 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 684 ms. Remains 34 /34 variables (removed 0) and now considering 2104/2104 (removed 0) transitions.
[2024-05-29 22:37:52] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:37:52] [INFO ] Invariant cache hit.
[2024-05-29 22:37:52] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 22:37:52] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:37:52] [INFO ] Invariant cache hit.
[2024-05-29 22:37:53] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:37:53] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
[2024-05-29 22:37:53] [INFO ] Redundant transitions in 285 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:37:53] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:37:53] [INFO ] Invariant cache hit.
[2024-05-29 22:37:53] [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-05-29 22:38:32] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:38:32] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:38:32] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-29 22:38:32] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:38:32] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 4 ms to minimize.
[2024-05-29 22:38:32] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-29 22:38:33] [INFO ] Deduced a trap composed of 4 places in 187 ms of which 0 ms to minimize.
[2024-05-29 22:38:33] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 22:38:33] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 22:38:34] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 0 ms to minimize.
[2024-05-29 22:38:34] [INFO ] Deduced a trap composed of 4 places in 609 ms of which 0 ms to minimize.
[2024-05-29 22:38:35] [INFO ] Deduced a trap composed of 4 places in 610 ms of which 0 ms to minimize.
[2024-05-29 22:38:35] [INFO ] Deduced a trap composed of 4 places in 595 ms of which 1 ms to minimize.
[2024-05-29 22:38:36] [INFO ] Deduced a trap composed of 4 places in 589 ms of which 1 ms to minimize.
[2024-05-29 22:38:37] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 1 ms to minimize.
[2024-05-29 22:38:37] [INFO ] Deduced a trap composed of 4 places in 514 ms of which 1 ms to minimize.
[2024-05-29 22:38:38] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 0 ms to minimize.
[2024-05-29 22:38:38] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 1 ms to minimize.
[2024-05-29 22:38:38] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2024-05-29 22:38:39] [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-05-29 22:38:39] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 22:38:39] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:38:39] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 22:38:39] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 1 ms to minimize.
[2024-05-29 22:38:40] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 22:38:40] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:38:40] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 0 ms to minimize.
[2024-05-29 22:38:40] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 22:38:40] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-05-29 22:38:40] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:38:40] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:38:40] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 22:38:40] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:38:41] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 0 ms to minimize.
[2024-05-29 22:38:41] [INFO ] Deduced a trap composed of 4 places in 235 ms of which 1 ms to minimize.
[2024-05-29 22:38:41] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 22:38:41] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 22:38:41] [INFO ] Deduced a trap composed of 4 places in 143 ms of which 1 ms to minimize.
[2024-05-29 22:38:41] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:38:42] [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-05-29 22:38:45] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 1 ms to minimize.
[2024-05-29 22:38:46] [INFO ] Deduced a trap composed of 4 places in 341 ms of which 0 ms to minimize.
[2024-05-29 22:38:46] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 1 ms to minimize.
[2024-05-29 22:38:46] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-29 22:38:47] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 1 ms to minimize.
[2024-05-29 22:38:47] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 22:38:47] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 22:38:47] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-29 22:38:47] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:38:47] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:38:48] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 22:38:48] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:38:48] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2024-05-29 22:38:48] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:38:48] [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 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 30033 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 92213ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92234ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 93866 ms. Remains : 34/34 places, 2104/2104 transitions.
Treatment of property StigmergyElection-PT-11a-LTLFireability-12 finished in 311771 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 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 1730 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:39:28] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:39:28] [INFO ] Invariant cache hit.
[2024-05-29 22:39:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 22:39:28] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:39:28] [INFO ] Invariant cache hit.
[2024-05-29 22:39:28] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:39:28] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 652 ms to find 0 implicit places.
[2024-05-29 22:39:29] [INFO ] Redundant transitions in 294 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:39:29] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:39:29] [INFO ] Invariant cache hit.
[2024-05-29 22:39:29] [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-05-29 22:40:08] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 22:40:08] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:40:08] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 22:40:08] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:40:08] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
[2024-05-29 22:40:08] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 22:40:08] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 22:40:08] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 22:40:09] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-29 22:40:09] [INFO ] Deduced a trap composed of 4 places in 628 ms of which 1 ms to minimize.
[2024-05-29 22:40:10] [INFO ] Deduced a trap composed of 4 places in 630 ms of which 1 ms to minimize.
[2024-05-29 22:40:11] [INFO ] Deduced a trap composed of 4 places in 628 ms of which 0 ms to minimize.
[2024-05-29 22:40:11] [INFO ] Deduced a trap composed of 4 places in 610 ms of which 0 ms to minimize.
[2024-05-29 22:40:12] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 0 ms to minimize.
[2024-05-29 22:40:12] [INFO ] Deduced a trap composed of 4 places in 621 ms of which 1 ms to minimize.
[2024-05-29 22:40:13] [INFO ] Deduced a trap composed of 4 places in 510 ms of which 1 ms to minimize.
[2024-05-29 22:40:13] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 0 ms to minimize.
[2024-05-29 22:40:14] [INFO ] Deduced a trap composed of 4 places in 394 ms of which 1 ms to minimize.
[2024-05-29 22:40:14] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2024-05-29 22:40:15] [INFO ] Deduced a trap composed of 4 places in 501 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-05-29 22:40:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-05-29 22:40:15] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:40:15] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:40:15] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2024-05-29 22:40:15] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:40:15] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:40:16] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 22:40:16] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:40:16] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:40:16] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:40:16] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:40:16] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2024-05-29 22:40:16] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:40:16] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2024-05-29 22:40:17] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-29 22:40:17] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:40:17] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 22:40:17] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 22:40:17] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 22:40:17] [INFO ] Deduced a trap composed of 4 places in 63 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-05-29 22:40:21] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 0 ms to minimize.
[2024-05-29 22:40:22] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2024-05-29 22:40:22] [INFO ] Deduced a trap composed of 4 places in 285 ms of which 0 ms to minimize.
[2024-05-29 22:40:22] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 1 ms to minimize.
[2024-05-29 22:40:22] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:40:22] [INFO ] Deduced a trap composed of 4 places in 149 ms of which 0 ms to minimize.
[2024-05-29 22:40:23] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 1 ms to minimize.
[2024-05-29 22:40:23] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:40:23] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 22:40:23] [INFO ] Deduced a trap composed of 4 places in 144 ms of which 0 ms to minimize.
[2024-05-29 22:40:23] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 1 ms to minimize.
[2024-05-29 22:40:24] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 22:40:24] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:40:24] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:40:24] [INFO ] Deduced a trap composed of 4 places in 156 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 30030 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 92432ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92452ms
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 95145 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 123 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 2 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-14 finished in 95294 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 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 1742 ms. Remains 34 /90 variables (removed 56) and now considering 2104/4218 (removed 2114) transitions.
[2024-05-29 22:41:03] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:41:03] [INFO ] Invariant cache hit.
[2024-05-29 22:41:03] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-29 22:41:03] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:41:03] [INFO ] Invariant cache hit.
[2024-05-29 22:41:04] [INFO ] State equation strengthened by 2069 read => feed constraints.
[2024-05-29 22:41:04] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 649 ms to find 0 implicit places.
[2024-05-29 22:41:04] [INFO ] Redundant transitions in 290 ms returned []
Running 2093 sub problems to find dead transitions.
[2024-05-29 22:41:04] [INFO ] Flow matrix only has 2092 transitions (discarded 12 similar events)
[2024-05-29 22:41:04] [INFO ] Invariant cache hit.
[2024-05-29 22:41:04] [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-05-29 22:41:43] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-29 22:41:43] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-05-29 22:41:43] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 22:41:43] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-05-29 22:41:43] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 0 ms to minimize.
[2024-05-29 22:41:43] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 1 ms to minimize.
[2024-05-29 22:41:43] [INFO ] Deduced a trap composed of 4 places in 192 ms of which 1 ms to minimize.
[2024-05-29 22:41:43] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 1 ms to minimize.
[2024-05-29 22:41:44] [INFO ] Deduced a trap composed of 4 places in 142 ms of which 0 ms to minimize.
[2024-05-29 22:41:44] [INFO ] Deduced a trap composed of 4 places in 604 ms of which 0 ms to minimize.
[2024-05-29 22:41:45] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 1 ms to minimize.
[2024-05-29 22:41:46] [INFO ] Deduced a trap composed of 4 places in 605 ms of which 1 ms to minimize.
[2024-05-29 22:41:46] [INFO ] Deduced a trap composed of 4 places in 608 ms of which 0 ms to minimize.
[2024-05-29 22:41:47] [INFO ] Deduced a trap composed of 4 places in 602 ms of which 0 ms to minimize.
[2024-05-29 22:41:47] [INFO ] Deduced a trap composed of 4 places in 619 ms of which 0 ms to minimize.
[2024-05-29 22:41:48] [INFO ] Deduced a trap composed of 4 places in 512 ms of which 1 ms to minimize.
[2024-05-29 22:41:48] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 0 ms to minimize.
[2024-05-29 22:41:49] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 1 ms to minimize.
[2024-05-29 22:41:49] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 0 ms to minimize.
[2024-05-29 22:41:50] [INFO ] Deduced a trap composed of 4 places in 504 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-05-29 22:41:50] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 22:41:50] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:41:50] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 22:41:50] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 22:41:50] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 1 ms to minimize.
[2024-05-29 22:41:50] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 22:41:51] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 1 ms to minimize.
[2024-05-29 22:41:51] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 22:41:51] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:41:51] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 22:41:51] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 22:41:51] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
[2024-05-29 22:41:51] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
[2024-05-29 22:41:51] [INFO ] Deduced a trap composed of 4 places in 299 ms of which 0 ms to minimize.
[2024-05-29 22:41:52] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 0 ms to minimize.
[2024-05-29 22:41:52] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 22:41:52] [INFO ] Deduced a trap composed of 4 places in 191 ms of which 0 ms to minimize.
[2024-05-29 22:41:52] [INFO ] Deduced a trap composed of 4 places in 148 ms of which 0 ms to minimize.
[2024-05-29 22:41:52] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:41:52] [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-05-29 22:41:56] [INFO ] Deduced a trap composed of 4 places in 352 ms of which 1 ms to minimize.
[2024-05-29 22:41:57] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2024-05-29 22:41:57] [INFO ] Deduced a trap composed of 4 places in 287 ms of which 1 ms to minimize.
[2024-05-29 22:41:57] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-29 22:41:57] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 22:41:58] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 22:41:58] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-05-29 22:41:58] [INFO ] Deduced a trap composed of 4 places in 199 ms of which 0 ms to minimize.
[2024-05-29 22:41:58] [INFO ] Deduced a trap composed of 4 places in 195 ms of which 1 ms to minimize.
[2024-05-29 22:41:58] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 22:41:59] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 22:41:59] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 22:41:59] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 22:41:59] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 22:41:59] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 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 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 92369ms problems are : Problem set: 0 solved, 2093 unsolved
Search for dead transitions found 0 dead transitions in 92389ms
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 95081 ms. Remains : 34/90 places, 2104/4218 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-11a-LTLFireability-15
Stuttering criterion allowed to conclude after 8424 steps with 701 reset in 423 ms.
FORMULA StigmergyElection-PT-11a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-11a-LTLFireability-15 finished in 95612 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-05-29 22:42:38] [INFO ] Flatten gal took : 297 ms
[2024-05-29 22:42:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-29 22:42:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 90 places, 4218 transitions and 90566 arcs took 53 ms.
Total runtime 1610122 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running StigmergyElection-PT-11a
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/408/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 90
TRANSITIONS: 4218
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.405s, Sys 0.010s]
SAVING FILE /home/mcc/execution/408/model (.net / .def) ...
EXPORT TIME: [User 0.031s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 3219
MODEL NAME: /home/mcc/execution/408/model
90 places, 4218 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyElection-PT-11a-LTLFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyElection-PT-11a-LTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1717022598661
--------------------
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
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="greatspnxred"
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 greatspnxred"
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 r399-tall-171690530300396"
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 ;