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.r400-tall-171690532200380.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 itstools
Input is StigmergyElection-PT-10a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 51M
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 19:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 19:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 19:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 11 19:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 50M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717016656550

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-10a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-29 21:04:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 21:04:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:04:19] [INFO ] Load time of PNML (sax parser for PT used): 1848 ms
[2024-05-29 21:04:19] [INFO ] Transformed 142 places.
[2024-05-29 21:04:19] [INFO ] Transformed 50162 transitions.
[2024-05-29 21:04:19] [INFO ] Found NUPN structural information;
[2024-05-29 21:04:19] [INFO ] Parsed PT model containing 142 places and 50162 transitions and 999212 arcs in 2291 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 47924 transitions
Reduce redundant transitions removed 47924 transitions.
Support contains 10 out of 142 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 142/142 places, 2238/2238 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 123 transition count 2209
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 123 transition count 2209
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 113 transition count 2189
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 113 transition count 2189
Applied a total of 58 rules in 54 ms. Remains 113 /142 variables (removed 29) and now considering 2189/2238 (removed 49) transitions.
[2024-05-29 21:04:20] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
// Phase 1: matrix 2178 rows 113 cols
[2024-05-29 21:04:20] [INFO ] Computed 2 invariants in 48 ms
[2024-05-29 21:04:20] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-29 21:04:20] [INFO ] Flow matrix only has 2178 transitions (discarded 11 similar events)
[2024-05-29 21:04:20] [INFO ] Invariant cache hit.
[2024-05-29 21:04:21] [INFO ] State equation strengthened by 2095 read => feed constraints.
[2024-05-29 21:04:22] [INFO ] Implicit Places using invariants and state equation in 1298 ms returned [112]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1555 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 112/142 places, 2189/2238 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 92 transition count 2169
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 92 transition count 2169
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 50 place count 82 transition count 2159
Iterating global reduction 0 with 10 rules applied. Total rules applied 60 place count 82 transition count 2159
Applied a total of 60 rules in 31 ms. Remains 82 /112 variables (removed 30) and now considering 2159/2189 (removed 30) transitions.
[2024-05-29 21:04:22] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:04:22] [INFO ] Computed 1 invariants in 19 ms
[2024-05-29 21:04:22] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 21:04:22] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:04:22] [INFO ] Invariant cache hit.
[2024-05-29 21:04:23] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:04:23] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned []
Implicit Place search using SMT with State Equation took 1347 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 82/142 places, 2159/2238 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3004 ms. Remains : 82/142 places, 2159/2238 transitions.
Support contains 10 out of 82 places after structural reductions.
[2024-05-29 21:04:23] [INFO ] Flatten gal took : 314 ms
[2024-05-29 21:04:24] [INFO ] Flatten gal took : 197 ms
[2024-05-29 21:04:24] [INFO ] Input system was already deterministic with 2159 transitions.
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (11 resets) in 5041 ms. (7 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
[2024-05-29 21:04:26] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:04:26] [INFO ] Invariant cache hit.
[2024-05-29 21:04:26] [INFO ] State equation strengthened by 2055 read => feed constraints.
Problem AtomicPropp4 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/82 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2147/2229 variables, 82/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2229 variables, 2054/2137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2229 variables, 0/2137 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/2230 variables, 1/2138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2230 variables, 0/2138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2230 variables, 0/2138 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2230/2230 variables, and 2138 constraints, problems are : Problem set: 1 solved, 1 unsolved in 739 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 82/82 constraints, ReadFeed: 2055/2055 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Int declared 82/2230 variables, and 1 constraints, problems are : Problem set: 2 solved, 0 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/82 constraints, ReadFeed: 0/2055 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 1175ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyElection-PT-10a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-10a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA StigmergyElection-PT-10a-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
FORMULA StigmergyElection-PT-10a-LTLFireability-03 TRUE 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' '!((X(p0)&&F(p1)&&(G(p0)||G(p1))))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:04:27] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:04:27] [INFO ] Invariant cache hit.
[2024-05-29 21:04:27] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 21:04:27] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:04:27] [INFO ] Invariant cache hit.
[2024-05-29 21:04:28] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:04:28] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 883 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:04:28] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:04:28] [INFO ] Invariant cache hit.
[2024-05-29 21:04:28] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:05:10] [INFO ] Deduced a trap composed of 9 places in 519 ms of which 8 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 9 places in 511 ms of which 1 ms to minimize.
[2024-05-29 21:05:11] [INFO ] Deduced a trap composed of 10 places in 489 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 11 places in 513 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 9 places in 433 ms of which 1 ms to minimize.
[2024-05-29 21:05:12] [INFO ] Deduced a trap composed of 9 places in 420 ms of which 1 ms to minimize.
[2024-05-29 21:05:13] [INFO ] Deduced a trap composed of 10 places in 439 ms of which 1 ms to minimize.
[2024-05-29 21:05:13] [INFO ] Deduced a trap composed of 13 places in 409 ms of which 2 ms to minimize.
[2024-05-29 21:05:14] [INFO ] Deduced a trap composed of 9 places in 491 ms of which 1 ms to minimize.
[2024-05-29 21:05:14] [INFO ] Deduced a trap composed of 9 places in 424 ms of which 1 ms to minimize.
[2024-05-29 21:05:15] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 1 ms to minimize.
[2024-05-29 21:05:15] [INFO ] Deduced a trap composed of 9 places in 413 ms of which 1 ms to minimize.
[2024-05-29 21:05:15] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 1 ms to minimize.
[2024-05-29 21:05:16] [INFO ] Deduced a trap composed of 9 places in 403 ms of which 0 ms to minimize.
[2024-05-29 21:05:16] [INFO ] Deduced a trap composed of 9 places in 404 ms of which 1 ms to minimize.
[2024-05-29 21:05:17] [INFO ] Deduced a trap composed of 9 places in 402 ms of which 0 ms to minimize.
[2024-05-29 21:05:17] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 0 ms to minimize.
[2024-05-29 21:05:17] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 0 ms to minimize.
[2024-05-29 21:05:18] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 0 ms to minimize.
[2024-05-29 21:05:18] [INFO ] Deduced a trap composed of 9 places in 254 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:05:19] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 0 ms to minimize.
[2024-05-29 21:05:19] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 1 ms to minimize.
[2024-05-29 21:05:19] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2024-05-29 21:05:20] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 1 ms to minimize.
[2024-05-29 21:05:20] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2024-05-29 21:05:20] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 2 ms to minimize.
[2024-05-29 21:05:20] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2024-05-29 21:05:21] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2024-05-29 21:05:21] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 1 ms to minimize.
[2024-05-29 21:05:21] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 3 ms to minimize.
[2024-05-29 21:05:21] [INFO ] Deduced a trap composed of 10 places in 300 ms of which 1 ms to minimize.
[2024-05-29 21:05:22] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 3 ms to minimize.
[2024-05-29 21:05:22] [INFO ] Deduced a trap composed of 10 places in 345 ms of which 1 ms to minimize.
[2024-05-29 21:05:22] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 1 ms to minimize.
[2024-05-29 21:05:23] [INFO ] Deduced a trap composed of 9 places in 358 ms of which 1 ms to minimize.
[2024-05-29 21:05:23] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 1 ms to minimize.
[2024-05-29 21:05:23] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 1 ms to minimize.
[2024-05-29 21:05:24] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 1 ms to minimize.
[2024-05-29 21:05:24] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
[2024-05-29 21:05:24] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:05:30] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 0 ms to minimize.
[2024-05-29 21:05:30] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
SMT process timed out in 61994ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 62031ms
Finished structural reductions in LTL mode , in 1 iterations and 62938 ms. Remains : 82/82 places, 2159/2159 transitions.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-00
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 6 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-00 finished in 63426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(!p0)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:05:30] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:05:30] [INFO ] Invariant cache hit.
[2024-05-29 21:05:30] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 21:05:30] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:05:30] [INFO ] Invariant cache hit.
[2024-05-29 21:05:31] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:05:31] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:05:31] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:05:31] [INFO ] Invariant cache hit.
[2024-05-29 21:05:31] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:06:12] [INFO ] Deduced a trap composed of 9 places in 480 ms of which 1 ms to minimize.
[2024-05-29 21:06:12] [INFO ] Deduced a trap composed of 9 places in 476 ms of which 1 ms to minimize.
[2024-05-29 21:06:13] [INFO ] Deduced a trap composed of 10 places in 489 ms of which 0 ms to minimize.
[2024-05-29 21:06:13] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 1 ms to minimize.
[2024-05-29 21:06:14] [INFO ] Deduced a trap composed of 9 places in 408 ms of which 1 ms to minimize.
[2024-05-29 21:06:14] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 1 ms to minimize.
[2024-05-29 21:06:15] [INFO ] Deduced a trap composed of 10 places in 405 ms of which 0 ms to minimize.
[2024-05-29 21:06:15] [INFO ] Deduced a trap composed of 13 places in 440 ms of which 0 ms to minimize.
[2024-05-29 21:06:16] [INFO ] Deduced a trap composed of 9 places in 490 ms of which 2 ms to minimize.
[2024-05-29 21:06:16] [INFO ] Deduced a trap composed of 9 places in 416 ms of which 1 ms to minimize.
[2024-05-29 21:06:16] [INFO ] Deduced a trap composed of 9 places in 415 ms of which 0 ms to minimize.
[2024-05-29 21:06:17] [INFO ] Deduced a trap composed of 9 places in 412 ms of which 0 ms to minimize.
[2024-05-29 21:06:17] [INFO ] Deduced a trap composed of 9 places in 366 ms of which 1 ms to minimize.
[2024-05-29 21:06:18] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 0 ms to minimize.
[2024-05-29 21:06:18] [INFO ] Deduced a trap composed of 9 places in 413 ms of which 1 ms to minimize.
[2024-05-29 21:06:19] [INFO ] Deduced a trap composed of 9 places in 408 ms of which 0 ms to minimize.
[2024-05-29 21:06:19] [INFO ] Deduced a trap composed of 9 places in 392 ms of which 1 ms to minimize.
[2024-05-29 21:06:19] [INFO ] Deduced a trap composed of 9 places in 343 ms of which 1 ms to minimize.
[2024-05-29 21:06:20] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 1 ms to minimize.
[2024-05-29 21:06:20] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:06:21] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 1 ms to minimize.
[2024-05-29 21:06:21] [INFO ] Deduced a trap composed of 9 places in 672 ms of which 1 ms to minimize.
[2024-05-29 21:06:22] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2024-05-29 21:06:22] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 0 ms to minimize.
[2024-05-29 21:06:22] [INFO ] Deduced a trap composed of 9 places in 269 ms of which 1 ms to minimize.
[2024-05-29 21:06:22] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 1 ms to minimize.
[2024-05-29 21:06:23] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 0 ms to minimize.
[2024-05-29 21:06:23] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2024-05-29 21:06:23] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 1 ms to minimize.
[2024-05-29 21:06:23] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 0 ms to minimize.
[2024-05-29 21:06:24] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 0 ms to minimize.
[2024-05-29 21:06:24] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 0 ms to minimize.
[2024-05-29 21:06:24] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 1 ms to minimize.
[2024-05-29 21:06:25] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 1 ms to minimize.
[2024-05-29 21:06:25] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 1 ms to minimize.
[2024-05-29 21:06:25] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 0 ms to minimize.
[2024-05-29 21:06:26] [INFO ] Deduced a trap composed of 9 places in 343 ms of which 1 ms to minimize.
[2024-05-29 21:06:26] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 1 ms to minimize.
[2024-05-29 21:06:26] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 0 ms to minimize.
[2024-05-29 21:06:26] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:06:32] [INFO ] Deduced a trap composed of 9 places in 249 ms of which 0 ms to minimize.
[2024-05-29 21:06:32] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
SMT process timed out in 61063ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 61086ms
Finished structural reductions in LTL mode , in 1 iterations and 61719 ms. Remains : 82/82 places, 2159/2159 transitions.
Stuttering acceptance computed with spot in 186 ms :[p0, true, p0, p0]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-01
Product exploration explored 100000 steps with 50000 reset in 245 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyElection-PT-10a-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyElection-PT-10a-LTLFireability-01 finished in 62442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0&&X(p0))))))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:06:33] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:06:33] [INFO ] Invariant cache hit.
[2024-05-29 21:06:33] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 21:06:33] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:06:33] [INFO ] Invariant cache hit.
[2024-05-29 21:06:33] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:06:33] [INFO ] Implicit Places using invariants and state equation in 584 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:06:33] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:06:34] [INFO ] Invariant cache hit.
[2024-05-29 21:06:34] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:07:15] [INFO ] Deduced a trap composed of 9 places in 482 ms of which 1 ms to minimize.
[2024-05-29 21:07:15] [INFO ] Deduced a trap composed of 9 places in 489 ms of which 1 ms to minimize.
[2024-05-29 21:07:16] [INFO ] Deduced a trap composed of 10 places in 493 ms of which 1 ms to minimize.
[2024-05-29 21:07:16] [INFO ] Deduced a trap composed of 11 places in 482 ms of which 1 ms to minimize.
[2024-05-29 21:07:17] [INFO ] Deduced a trap composed of 9 places in 410 ms of which 0 ms to minimize.
[2024-05-29 21:07:17] [INFO ] Deduced a trap composed of 9 places in 416 ms of which 1 ms to minimize.
[2024-05-29 21:07:18] [INFO ] Deduced a trap composed of 10 places in 426 ms of which 0 ms to minimize.
[2024-05-29 21:07:18] [INFO ] Deduced a trap composed of 13 places in 421 ms of which 1 ms to minimize.
[2024-05-29 21:07:19] [INFO ] Deduced a trap composed of 9 places in 485 ms of which 1 ms to minimize.
[2024-05-29 21:07:19] [INFO ] Deduced a trap composed of 9 places in 423 ms of which 1 ms to minimize.
[2024-05-29 21:07:19] [INFO ] Deduced a trap composed of 9 places in 404 ms of which 1 ms to minimize.
[2024-05-29 21:07:20] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 0 ms to minimize.
[2024-05-29 21:07:20] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 0 ms to minimize.
[2024-05-29 21:07:21] [INFO ] Deduced a trap composed of 9 places in 392 ms of which 1 ms to minimize.
[2024-05-29 21:07:21] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 1 ms to minimize.
[2024-05-29 21:07:21] [INFO ] Deduced a trap composed of 9 places in 405 ms of which 0 ms to minimize.
[2024-05-29 21:07:22] [INFO ] Deduced a trap composed of 9 places in 389 ms of which 0 ms to minimize.
[2024-05-29 21:07:22] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 1 ms to minimize.
[2024-05-29 21:07:22] [INFO ] Deduced a trap composed of 9 places in 303 ms of which 1 ms to minimize.
[2024-05-29 21:07:23] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:07:23] [INFO ] Deduced a trap composed of 10 places in 358 ms of which 1 ms to minimize.
[2024-05-29 21:07:24] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 0 ms to minimize.
[2024-05-29 21:07:24] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 1 ms to minimize.
[2024-05-29 21:07:24] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 0 ms to minimize.
[2024-05-29 21:07:25] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
[2024-05-29 21:07:25] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 0 ms to minimize.
[2024-05-29 21:07:25] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
[2024-05-29 21:07:25] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
[2024-05-29 21:07:25] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2024-05-29 21:07:26] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 0 ms to minimize.
[2024-05-29 21:07:26] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 0 ms to minimize.
[2024-05-29 21:07:26] [INFO ] Deduced a trap composed of 10 places in 252 ms of which 0 ms to minimize.
[2024-05-29 21:07:27] [INFO ] Deduced a trap composed of 10 places in 359 ms of which 0 ms to minimize.
[2024-05-29 21:07:27] [INFO ] Deduced a trap composed of 10 places in 304 ms of which 0 ms to minimize.
[2024-05-29 21:07:27] [INFO ] Deduced a trap composed of 9 places in 344 ms of which 1 ms to minimize.
[2024-05-29 21:07:28] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 1 ms to minimize.
[2024-05-29 21:07:28] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 0 ms to minimize.
[2024-05-29 21:07:28] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2024-05-29 21:07:29] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2024-05-29 21:07:29] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2024-05-29 21:07:34] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:07:35] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
SMT process timed out in 61292ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 61314ms
Finished structural reductions in LTL mode , in 1 iterations and 61939 ms. Remains : 82/82 places, 2159/2159 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-02
Product exploration explored 100000 steps with 25000 reset in 244 ms.
Product exploration explored 100000 steps with 25000 reset in 237 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 84 steps (0 resets) in 7 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 9 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:07:36] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:07:36] [INFO ] Invariant cache hit.
[2024-05-29 21:07:36] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 21:07:36] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:07:36] [INFO ] Invariant cache hit.
[2024-05-29 21:07:37] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:07:37] [INFO ] Implicit Places using invariants and state equation in 600 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:07:37] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:07:37] [INFO ] Invariant cache hit.
[2024-05-29 21:07:37] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:08:18] [INFO ] Deduced a trap composed of 9 places in 485 ms of which 0 ms to minimize.
[2024-05-29 21:08:19] [INFO ] Deduced a trap composed of 9 places in 504 ms of which 1 ms to minimize.
[2024-05-29 21:08:19] [INFO ] Deduced a trap composed of 10 places in 482 ms of which 1 ms to minimize.
[2024-05-29 21:08:20] [INFO ] Deduced a trap composed of 11 places in 484 ms of which 0 ms to minimize.
[2024-05-29 21:08:20] [INFO ] Deduced a trap composed of 9 places in 436 ms of which 1 ms to minimize.
[2024-05-29 21:08:20] [INFO ] Deduced a trap composed of 9 places in 424 ms of which 1 ms to minimize.
[2024-05-29 21:08:21] [INFO ] Deduced a trap composed of 10 places in 414 ms of which 0 ms to minimize.
[2024-05-29 21:08:21] [INFO ] Deduced a trap composed of 13 places in 417 ms of which 1 ms to minimize.
[2024-05-29 21:08:22] [INFO ] Deduced a trap composed of 9 places in 480 ms of which 1 ms to minimize.
[2024-05-29 21:08:22] [INFO ] Deduced a trap composed of 9 places in 412 ms of which 1 ms to minimize.
[2024-05-29 21:08:23] [INFO ] Deduced a trap composed of 9 places in 440 ms of which 1 ms to minimize.
[2024-05-29 21:08:23] [INFO ] Deduced a trap composed of 9 places in 411 ms of which 0 ms to minimize.
[2024-05-29 21:08:23] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 1 ms to minimize.
[2024-05-29 21:08:24] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 0 ms to minimize.
[2024-05-29 21:08:24] [INFO ] Deduced a trap composed of 9 places in 400 ms of which 2 ms to minimize.
[2024-05-29 21:08:25] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 0 ms to minimize.
[2024-05-29 21:08:25] [INFO ] Deduced a trap composed of 9 places in 396 ms of which 1 ms to minimize.
[2024-05-29 21:08:25] [INFO ] Deduced a trap composed of 9 places in 339 ms of which 1 ms to minimize.
[2024-05-29 21:08:26] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 1 ms to minimize.
[2024-05-29 21:08:26] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:08:27] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 0 ms to minimize.
[2024-05-29 21:08:27] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 1 ms to minimize.
[2024-05-29 21:08:27] [INFO ] Deduced a trap composed of 9 places in 307 ms of which 0 ms to minimize.
[2024-05-29 21:08:28] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 1 ms to minimize.
[2024-05-29 21:08:28] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2024-05-29 21:08:28] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 0 ms to minimize.
[2024-05-29 21:08:28] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 0 ms to minimize.
[2024-05-29 21:08:29] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 0 ms to minimize.
[2024-05-29 21:08:29] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2024-05-29 21:08:29] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 1 ms to minimize.
[2024-05-29 21:08:29] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 0 ms to minimize.
[2024-05-29 21:08:30] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 1 ms to minimize.
[2024-05-29 21:08:30] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 1 ms to minimize.
[2024-05-29 21:08:30] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 0 ms to minimize.
[2024-05-29 21:08:31] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 1 ms to minimize.
[2024-05-29 21:08:31] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 1 ms to minimize.
[2024-05-29 21:08:31] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 0 ms to minimize.
[2024-05-29 21:08:32] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 0 ms to minimize.
[2024-05-29 21:08:32] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2024-05-29 21:08:32] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:08:38] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2024-05-29 21:08:38] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
SMT process timed out in 61129ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 61153ms
Finished structural reductions in LTL mode , in 1 iterations and 61811 ms. Remains : 82/82 places, 2159/2159 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 84 steps (0 resets) in 9 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 226 ms.
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Built C files in :
/tmp/ltsmin5467904186841259984
[2024-05-29 21:08:39] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5467904186841259984
Running compilation step : cd /tmp/ltsmin5467904186841259984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5467904186841259984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5467904186841259984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 12 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:08:43] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:08:43] [INFO ] Invariant cache hit.
[2024-05-29 21:08:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 21:08:43] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:08:43] [INFO ] Invariant cache hit.
[2024-05-29 21:08:43] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:08:43] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:08:43] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:08:43] [INFO ] Invariant cache hit.
[2024-05-29 21:08:43] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:09:24] [INFO ] Deduced a trap composed of 9 places in 478 ms of which 0 ms to minimize.
[2024-05-29 21:09:25] [INFO ] Deduced a trap composed of 9 places in 490 ms of which 1 ms to minimize.
[2024-05-29 21:09:25] [INFO ] Deduced a trap composed of 10 places in 488 ms of which 0 ms to minimize.
[2024-05-29 21:09:26] [INFO ] Deduced a trap composed of 11 places in 488 ms of which 1 ms to minimize.
[2024-05-29 21:09:26] [INFO ] Deduced a trap composed of 9 places in 412 ms of which 0 ms to minimize.
[2024-05-29 21:09:27] [INFO ] Deduced a trap composed of 9 places in 415 ms of which 0 ms to minimize.
[2024-05-29 21:09:27] [INFO ] Deduced a trap composed of 10 places in 416 ms of which 0 ms to minimize.
[2024-05-29 21:09:27] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2024-05-29 21:09:28] [INFO ] Deduced a trap composed of 9 places in 495 ms of which 1 ms to minimize.
[2024-05-29 21:09:28] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 1 ms to minimize.
[2024-05-29 21:09:29] [INFO ] Deduced a trap composed of 9 places in 403 ms of which 1 ms to minimize.
[2024-05-29 21:09:29] [INFO ] Deduced a trap composed of 9 places in 403 ms of which 0 ms to minimize.
[2024-05-29 21:09:30] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 1 ms to minimize.
[2024-05-29 21:09:30] [INFO ] Deduced a trap composed of 9 places in 406 ms of which 1 ms to minimize.
[2024-05-29 21:09:30] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 1 ms to minimize.
[2024-05-29 21:09:31] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 1 ms to minimize.
[2024-05-29 21:09:31] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 1 ms to minimize.
[2024-05-29 21:09:32] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 0 ms to minimize.
[2024-05-29 21:09:32] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 0 ms to minimize.
[2024-05-29 21:09:32] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:09:33] [INFO ] Deduced a trap composed of 10 places in 349 ms of which 0 ms to minimize.
[2024-05-29 21:09:33] [INFO ] Deduced a trap composed of 9 places in 356 ms of which 1 ms to minimize.
[2024-05-29 21:09:34] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 0 ms to minimize.
[2024-05-29 21:09:34] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 1 ms to minimize.
[2024-05-29 21:09:34] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 0 ms to minimize.
[2024-05-29 21:09:34] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 0 ms to minimize.
[2024-05-29 21:09:35] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 1 ms to minimize.
[2024-05-29 21:09:35] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 0 ms to minimize.
[2024-05-29 21:09:35] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2024-05-29 21:09:35] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 1 ms to minimize.
[2024-05-29 21:09:35] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 0 ms to minimize.
[2024-05-29 21:09:36] [INFO ] Deduced a trap composed of 10 places in 247 ms of which 1 ms to minimize.
[2024-05-29 21:09:36] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 0 ms to minimize.
[2024-05-29 21:09:36] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 0 ms to minimize.
[2024-05-29 21:09:37] [INFO ] Deduced a trap composed of 9 places in 355 ms of which 1 ms to minimize.
[2024-05-29 21:09:37] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 0 ms to minimize.
[2024-05-29 21:09:38] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 0 ms to minimize.
[2024-05-29 21:09:38] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 1 ms to minimize.
[2024-05-29 21:09:38] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 0 ms to minimize.
[2024-05-29 21:09:38] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:09:44] [INFO ] Deduced a trap composed of 9 places in 253 ms of which 0 ms to minimize.
[2024-05-29 21:09:44] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
[2024-05-29 21:09:44] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 1 ms to minimize.
SMT process timed out in 61074ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 61096ms
Finished structural reductions in LTL mode , in 1 iterations and 61728 ms. Remains : 82/82 places, 2159/2159 transitions.
Built C files in :
/tmp/ltsmin18434972403617306284
[2024-05-29 21:09:44] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18434972403617306284
Running compilation step : cd /tmp/ltsmin18434972403617306284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18434972403617306284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18434972403617306284;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 21:09:48] [INFO ] Flatten gal took : 160 ms
[2024-05-29 21:09:48] [INFO ] Flatten gal took : 138 ms
[2024-05-29 21:09:48] [INFO ] Time to serialize gal into /tmp/LTL8934100818416063316.gal : 47 ms
[2024-05-29 21:09:48] [INFO ] Time to serialize properties into /tmp/LTL10981191702459552017.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8934100818416063316.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4707541772839982661.hoa' '-atoms' '/tmp/LTL10981191702459552017.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10981191702459552017.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4707541772839982661.hoa
Detected timeout of ITS tools.
[2024-05-29 21:10:03] [INFO ] Flatten gal took : 134 ms
[2024-05-29 21:10:03] [INFO ] Flatten gal took : 132 ms
[2024-05-29 21:10:03] [INFO ] Time to serialize gal into /tmp/LTL15112895499358561195.gal : 26 ms
[2024-05-29 21:10:03] [INFO ] Time to serialize properties into /tmp/LTL14561542889057062528.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15112895499358561195.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14561542889057062528.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X("(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||((p124==0)||(p138==0)))")...286
Formula 0 simplified : XXG(!"(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||((p124==0)||(p138==0)))" | X!"...276
Detected timeout of ITS tools.
[2024-05-29 21:10:19] [INFO ] Flatten gal took : 125 ms
[2024-05-29 21:10:19] [INFO ] Applying decomposition
[2024-05-29 21:10:19] [INFO ] Flatten gal took : 143 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13511816593454545039.txt' '-o' '/tmp/graph13511816593454545039.bin' '-w' '/tmp/graph13511816593454545039.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13511816593454545039.bin' '-l' '-1' '-v' '-w' '/tmp/graph13511816593454545039.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:10:19] [INFO ] Decomposing Gal with order
[2024-05-29 21:10:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:10:20] [INFO ] Removed a total of 20533 redundant transitions.
[2024-05-29 21:10:20] [INFO ] Flatten gal took : 599 ms
[2024-05-29 21:10:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 201 ms.
[2024-05-29 21:10:20] [INFO ] Time to serialize gal into /tmp/LTL14240308105680352044.gal : 20 ms
[2024-05-29 21:10:20] [INFO ] Time to serialize properties into /tmp/LTL488052297121483867.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14240308105680352044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL488052297121483867.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X("(((((i3.i0.u12.p12==0)||(i3.i0.u21.p26==0))||((u5.p40==0)||(i2.i1.u16.p54==0)))||(((i4.u24.p68==0)||(i4.u14.p82==0))||((i...450
Formula 0 simplified : XXG(!"(((((i3.i0.u12.p12==0)||(i3.i0.u21.p26==0))||((u5.p40==0)||(i2.i1.u16.p54==0)))||(((i4.u24.p68==0)||(i4.u14.p82==0))||((i2.i0....440
Reverse transition relation is NOT exact ! Due to transitions t2139, t2141, t2143, t2145, t2147, t2149, t2151, t2153, t2155, t2157, u5.t38, u5.t39, i0.t41,...573
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
138 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.57076,84120,1,0,159809,347,20189,240529,237,1195,342741
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-10a-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property StigmergyElection-PT-10a-LTLFireability-02 finished in 229285 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&F(p1))))))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 10 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:10:22] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:10:22] [INFO ] Invariant cache hit.
[2024-05-29 21:10:22] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 21:10:22] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:10:22] [INFO ] Invariant cache hit.
[2024-05-29 21:10:23] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:10:23] [INFO ] Implicit Places using invariants and state equation in 607 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:10:23] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:10:23] [INFO ] Invariant cache hit.
[2024-05-29 21:10:23] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:11:04] [INFO ] Deduced a trap composed of 9 places in 497 ms of which 2 ms to minimize.
[2024-05-29 21:11:05] [INFO ] Deduced a trap composed of 9 places in 491 ms of which 4 ms to minimize.
[2024-05-29 21:11:05] [INFO ] Deduced a trap composed of 10 places in 467 ms of which 0 ms to minimize.
[2024-05-29 21:11:06] [INFO ] Deduced a trap composed of 11 places in 480 ms of which 1 ms to minimize.
[2024-05-29 21:11:06] [INFO ] Deduced a trap composed of 9 places in 406 ms of which 1 ms to minimize.
[2024-05-29 21:11:07] [INFO ] Deduced a trap composed of 9 places in 429 ms of which 1 ms to minimize.
[2024-05-29 21:11:07] [INFO ] Deduced a trap composed of 10 places in 424 ms of which 0 ms to minimize.
[2024-05-29 21:11:08] [INFO ] Deduced a trap composed of 13 places in 415 ms of which 1 ms to minimize.
[2024-05-29 21:11:08] [INFO ] Deduced a trap composed of 9 places in 490 ms of which 1 ms to minimize.
[2024-05-29 21:11:08] [INFO ] Deduced a trap composed of 9 places in 414 ms of which 0 ms to minimize.
[2024-05-29 21:11:09] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 1 ms to minimize.
[2024-05-29 21:11:09] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 1 ms to minimize.
[2024-05-29 21:11:10] [INFO ] Deduced a trap composed of 9 places in 356 ms of which 1 ms to minimize.
[2024-05-29 21:11:10] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 0 ms to minimize.
[2024-05-29 21:11:10] [INFO ] Deduced a trap composed of 9 places in 393 ms of which 0 ms to minimize.
[2024-05-29 21:11:11] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 1 ms to minimize.
[2024-05-29 21:11:11] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 1 ms to minimize.
[2024-05-29 21:11:12] [INFO ] Deduced a trap composed of 9 places in 337 ms of which 1 ms to minimize.
[2024-05-29 21:11:12] [INFO ] Deduced a trap composed of 9 places in 289 ms of which 0 ms to minimize.
[2024-05-29 21:11:12] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:11:13] [INFO ] Deduced a trap composed of 10 places in 348 ms of which 1 ms to minimize.
[2024-05-29 21:11:13] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 1 ms to minimize.
[2024-05-29 21:11:14] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2024-05-29 21:11:14] [INFO ] Deduced a trap composed of 9 places in 291 ms of which 0 ms to minimize.
[2024-05-29 21:11:14] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2024-05-29 21:11:14] [INFO ] Deduced a trap composed of 10 places in 195 ms of which 0 ms to minimize.
[2024-05-29 21:11:15] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:11:15] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 0 ms to minimize.
[2024-05-29 21:11:15] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
[2024-05-29 21:11:15] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 0 ms to minimize.
[2024-05-29 21:11:16] [INFO ] Deduced a trap composed of 10 places in 291 ms of which 0 ms to minimize.
[2024-05-29 21:11:16] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 0 ms to minimize.
[2024-05-29 21:11:16] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 1 ms to minimize.
[2024-05-29 21:11:16] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 1 ms to minimize.
[2024-05-29 21:11:17] [INFO ] Deduced a trap composed of 9 places in 339 ms of which 1 ms to minimize.
[2024-05-29 21:11:17] [INFO ] Deduced a trap composed of 9 places in 348 ms of which 0 ms to minimize.
[2024-05-29 21:11:18] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 1 ms to minimize.
[2024-05-29 21:11:18] [INFO ] Deduced a trap composed of 9 places in 298 ms of which 1 ms to minimize.
[2024-05-29 21:11:18] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 1 ms to minimize.
[2024-05-29 21:11:18] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:11:24] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2024-05-29 21:11:24] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 0 ms to minimize.
SMT process timed out in 61347ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 61368ms
Finished structural reductions in LTL mode , in 1 iterations and 62038 ms. Remains : 82/82 places, 2159/2159 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 231 ms.
Product exploration explored 100000 steps with 25000 reset in 248 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 84 steps (0 resets) in 9 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 184 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 12 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:11:26] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:11:26] [INFO ] Invariant cache hit.
[2024-05-29 21:11:26] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 21:11:26] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:11:26] [INFO ] Invariant cache hit.
[2024-05-29 21:11:26] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:11:26] [INFO ] Implicit Places using invariants and state equation in 593 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:11:26] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:11:26] [INFO ] Invariant cache hit.
[2024-05-29 21:11:27] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:12:08] [INFO ] Deduced a trap composed of 9 places in 481 ms of which 3 ms to minimize.
[2024-05-29 21:12:08] [INFO ] Deduced a trap composed of 9 places in 479 ms of which 0 ms to minimize.
[2024-05-29 21:12:09] [INFO ] Deduced a trap composed of 10 places in 486 ms of which 1 ms to minimize.
[2024-05-29 21:12:09] [INFO ] Deduced a trap composed of 11 places in 478 ms of which 1 ms to minimize.
[2024-05-29 21:12:10] [INFO ] Deduced a trap composed of 9 places in 412 ms of which 0 ms to minimize.
[2024-05-29 21:12:10] [INFO ] Deduced a trap composed of 9 places in 419 ms of which 0 ms to minimize.
[2024-05-29 21:12:10] [INFO ] Deduced a trap composed of 10 places in 412 ms of which 1 ms to minimize.
[2024-05-29 21:12:11] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 1 ms to minimize.
[2024-05-29 21:12:11] [INFO ] Deduced a trap composed of 9 places in 479 ms of which 1 ms to minimize.
[2024-05-29 21:12:12] [INFO ] Deduced a trap composed of 9 places in 408 ms of which 1 ms to minimize.
[2024-05-29 21:12:12] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 1 ms to minimize.
[2024-05-29 21:12:13] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 0 ms to minimize.
[2024-05-29 21:12:13] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 1 ms to minimize.
[2024-05-29 21:12:13] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 1 ms to minimize.
[2024-05-29 21:12:14] [INFO ] Deduced a trap composed of 9 places in 400 ms of which 1 ms to minimize.
[2024-05-29 21:12:14] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 0 ms to minimize.
[2024-05-29 21:12:15] [INFO ] Deduced a trap composed of 9 places in 395 ms of which 0 ms to minimize.
[2024-05-29 21:12:15] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 1 ms to minimize.
[2024-05-29 21:12:15] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2024-05-29 21:12:15] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:12:16] [INFO ] Deduced a trap composed of 10 places in 344 ms of which 1 ms to minimize.
[2024-05-29 21:12:17] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 1 ms to minimize.
[2024-05-29 21:12:17] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 0 ms to minimize.
[2024-05-29 21:12:17] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 0 ms to minimize.
[2024-05-29 21:12:18] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 0 ms to minimize.
[2024-05-29 21:12:18] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 0 ms to minimize.
[2024-05-29 21:12:18] [INFO ] Deduced a trap composed of 10 places in 157 ms of which 0 ms to minimize.
[2024-05-29 21:12:18] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 0 ms to minimize.
[2024-05-29 21:12:18] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2024-05-29 21:12:19] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2024-05-29 21:12:19] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 1 ms to minimize.
[2024-05-29 21:12:19] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 1 ms to minimize.
[2024-05-29 21:12:19] [INFO ] Deduced a trap composed of 10 places in 356 ms of which 1 ms to minimize.
[2024-05-29 21:12:20] [INFO ] Deduced a trap composed of 10 places in 304 ms of which 1 ms to minimize.
[2024-05-29 21:12:20] [INFO ] Deduced a trap composed of 9 places in 350 ms of which 1 ms to minimize.
[2024-05-29 21:12:21] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 1 ms to minimize.
[2024-05-29 21:12:21] [INFO ] Deduced a trap composed of 9 places in 334 ms of which 1 ms to minimize.
[2024-05-29 21:12:21] [INFO ] Deduced a trap composed of 9 places in 292 ms of which 0 ms to minimize.
[2024-05-29 21:12:21] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 0 ms to minimize.
[2024-05-29 21:12:22] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:12:27] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 0 ms to minimize.
[2024-05-29 21:12:27] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 0 ms to minimize.
SMT process timed out in 60982ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 61004ms
Finished structural reductions in LTL mode , in 1 iterations and 61659 ms. Remains : 82/82 places, 2159/2159 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 100 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 84 steps (0 resets) in 10 ms. (7 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 229 ms.
Product exploration explored 100000 steps with 25000 reset in 233 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 82 transition count 2169
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 82 transition count 2169
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 82 transition count 2179
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1063 place count 82 transition count 1156
Deduced a syphon composed of 40 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 20 transitions
Redundant transition composition rules discarded 20 transitions
Iterating global reduction 1 with 20 rules applied. Total rules applied 1083 place count 82 transition count 1136
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 1093 place count 82 transition count 1136
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 1113 place count 62 transition count 1116
Deduced a syphon composed of 30 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 62 transition count 1116
Deduced a syphon composed of 30 places in 0 ms
Applied a total of 1133 rules in 663 ms. Remains 62 /82 variables (removed 20) and now considering 1116/2159 (removed 1043) transitions.
[2024-05-29 21:12:30] [INFO ] Redundant transitions in 96 ms returned []
Running 1115 sub problems to find dead transitions.
[2024-05-29 21:12:30] [INFO ] Flow matrix only has 1105 transitions (discarded 11 similar events)
// Phase 1: matrix 1105 rows 62 cols
[2024-05-29 21:12:30] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 21:12:30] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:12:50] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 0 ms to minimize.
[2024-05-29 21:12:51] [INFO ] Deduced a trap composed of 5 places in 302 ms of which 1 ms to minimize.
[2024-05-29 21:12:51] [INFO ] Deduced a trap composed of 5 places in 300 ms of which 1 ms to minimize.
[2024-05-29 21:12:51] [INFO ] Deduced a trap composed of 5 places in 253 ms of which 1 ms to minimize.
[2024-05-29 21:12:51] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 1 ms to minimize.
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 5 places in 217 ms of which 1 ms to minimize.
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 1 ms to minimize.
[2024-05-29 21:12:52] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:12:53] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 1 ms to minimize.
[2024-05-29 21:12:54] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2024-05-29 21:12:54] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 1 ms to minimize.
[2024-05-29 21:12:54] [INFO ] Deduced a trap composed of 5 places in 161 ms of which 1 ms to minimize.
[2024-05-29 21:12:54] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2024-05-29 21:12:54] [INFO ] Deduced a trap composed of 5 places in 172 ms of which 1 ms to minimize.
[2024-05-29 21:12:54] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 0 ms to minimize.
[2024-05-29 21:12:55] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 0 ms to minimize.
[2024-05-29 21:12:55] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2024-05-29 21:12:55] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-29 21:12:55] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:12:55] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:12:55] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 1 ms to minimize.
[2024-05-29 21:12:55] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
[2024-05-29 21:12:56] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2024-05-29 21:12:56] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 21:12:58] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 21:12:58] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 21:12:58] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:12:58] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:12:58] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:12:58] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 1 ms to minimize.
[2024-05-29 21:12:59] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2024-05-29 21:12:59] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:12:59] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 21:13:02] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-05-29 21:13:02] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 21:13:02] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
[2024-05-29 21:13:05] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 21:13:05] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:13:05] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2024-05-29 21:13:05] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 1 ms to minimize.
[2024-05-29 21:13:05] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 21:13:05] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:13:06] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:13:06] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 0 ms to minimize.
[2024-05-29 21:13:06] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:13:06] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 21:13:06] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:13:06] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-29 21:13:06] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:13:06] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 14/67 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1115 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 8 (OVERLAPS) 1104/1166 variables, 62/129 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1166 variables, 1042/1171 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1166/1167 variables, and 1171 constraints, problems are : Problem set: 40 solved, 1075 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1115/71 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 40 solved, 1075 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 31/62 variables, 1/1 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 66/67 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 21:13:18] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 1/68 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 21:13:20] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/69 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 21:13:23] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 21:13:23] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-05-29 21:13:23] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:13:23] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:13:24] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2024-05-29 21:13:24] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2024-05-29 21:13:24] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2024-05-29 21:13:24] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2024-05-29 21:13:24] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2024-05-29 21:13:24] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2024-05-29 21:13:24] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 21:13:25] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:13:25] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 13/82 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 21:13:28] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 0 ms to minimize.
[2024-05-29 21:13:28] [INFO ] Deduced a trap composed of 5 places in 140 ms of which 0 ms to minimize.
[2024-05-29 21:13:28] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2024-05-29 21:13:28] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-29 21:13:28] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-29 21:13:29] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2024-05-29 21:13:29] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:13:29] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2024-05-29 21:13:29] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2024-05-29 21:13:29] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2024-05-29 21:13:29] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 21:13:29] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:13:30] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 21:13:30] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:13:30] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 15/97 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 21:13:33] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 1 ms to minimize.
[2024-05-29 21:13:33] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:13:34] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 21:13:34] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:13:34] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 21:13:34] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 21:13:34] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:13:34] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 8/105 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 21:13:38] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2024-05-29 21:13:38] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 1 ms to minimize.
[2024-05-29 21:13:38] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
[2024-05-29 21:13:38] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 21:13:38] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 5/110 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
[2024-05-29 21:13:42] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2024-05-29 21:13:42] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 21:13:42] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:13:42] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 21:13:43] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 5/115 constraints. Problems are: Problem set: 40 solved, 1075 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 62/1167 variables, and 115 constraints, problems are : Problem set: 40 solved, 1075 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/62 constraints, ReadFeed: 0/1043 constraints, PredecessorRefiner: 1044/71 constraints, Known Traps: 114/114 constraints]
After SMT, in 75754ms problems are : Problem set: 40 solved, 1075 unsolved
Search for dead transitions found 40 dead transitions in 75765ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/82 places, 1076/2159 transitions.
Graph (complete) has 351 edges and 62 vertex of which 32 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.3 ms
Discarding 30 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 175 ms. Remains 32 /62 variables (removed 30) and now considering 1076/1076 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 32/82 places, 1076/2159 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76709 ms. Remains : 32/82 places, 1076/2159 transitions.
Built C files in :
/tmp/ltsmin5718985488905010107
[2024-05-29 21:13:46] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5718985488905010107
Running compilation step : cd /tmp/ltsmin5718985488905010107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5718985488905010107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5718985488905010107;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 12 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:13:49] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:13:49] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 21:13:49] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-29 21:13:49] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:13:49] [INFO ] Invariant cache hit.
[2024-05-29 21:13:50] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:13:50] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:13:50] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:13:50] [INFO ] Invariant cache hit.
[2024-05-29 21:13:50] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:14:31] [INFO ] Deduced a trap composed of 9 places in 479 ms of which 1 ms to minimize.
[2024-05-29 21:14:31] [INFO ] Deduced a trap composed of 9 places in 479 ms of which 0 ms to minimize.
[2024-05-29 21:14:31] [INFO ] Deduced a trap composed of 10 places in 476 ms of which 0 ms to minimize.
[2024-05-29 21:14:32] [INFO ] Deduced a trap composed of 11 places in 473 ms of which 1 ms to minimize.
[2024-05-29 21:14:32] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 1 ms to minimize.
[2024-05-29 21:14:33] [INFO ] Deduced a trap composed of 9 places in 405 ms of which 0 ms to minimize.
[2024-05-29 21:14:33] [INFO ] Deduced a trap composed of 10 places in 416 ms of which 1 ms to minimize.
[2024-05-29 21:14:34] [INFO ] Deduced a trap composed of 13 places in 414 ms of which 1 ms to minimize.
[2024-05-29 21:14:34] [INFO ] Deduced a trap composed of 9 places in 489 ms of which 0 ms to minimize.
[2024-05-29 21:14:35] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 0 ms to minimize.
[2024-05-29 21:14:35] [INFO ] Deduced a trap composed of 9 places in 414 ms of which 0 ms to minimize.
[2024-05-29 21:14:35] [INFO ] Deduced a trap composed of 9 places in 413 ms of which 1 ms to minimize.
[2024-05-29 21:14:36] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 1 ms to minimize.
[2024-05-29 21:14:36] [INFO ] Deduced a trap composed of 9 places in 408 ms of which 0 ms to minimize.
[2024-05-29 21:14:37] [INFO ] Deduced a trap composed of 9 places in 403 ms of which 0 ms to minimize.
[2024-05-29 21:14:37] [INFO ] Deduced a trap composed of 9 places in 403 ms of which 1 ms to minimize.
[2024-05-29 21:14:37] [INFO ] Deduced a trap composed of 9 places in 397 ms of which 0 ms to minimize.
[2024-05-29 21:14:38] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 1 ms to minimize.
[2024-05-29 21:14:38] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2024-05-29 21:14:38] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:14:39] [INFO ] Deduced a trap composed of 10 places in 350 ms of which 0 ms to minimize.
[2024-05-29 21:14:39] [INFO ] Deduced a trap composed of 9 places in 343 ms of which 1 ms to minimize.
[2024-05-29 21:14:40] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 1 ms to minimize.
[2024-05-29 21:14:40] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2024-05-29 21:14:40] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2024-05-29 21:14:40] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2024-05-29 21:14:41] [INFO ] Deduced a trap composed of 10 places in 155 ms of which 0 ms to minimize.
[2024-05-29 21:14:41] [INFO ] Deduced a trap composed of 9 places in 205 ms of which 0 ms to minimize.
[2024-05-29 21:14:41] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 0 ms to minimize.
[2024-05-29 21:14:41] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 1 ms to minimize.
[2024-05-29 21:14:42] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 0 ms to minimize.
[2024-05-29 21:14:42] [INFO ] Deduced a trap composed of 10 places in 248 ms of which 1 ms to minimize.
[2024-05-29 21:14:42] [INFO ] Deduced a trap composed of 10 places in 360 ms of which 1 ms to minimize.
[2024-05-29 21:14:43] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 0 ms to minimize.
[2024-05-29 21:14:43] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 0 ms to minimize.
[2024-05-29 21:14:43] [INFO ] Deduced a trap composed of 9 places in 339 ms of which 1 ms to minimize.
[2024-05-29 21:14:44] [INFO ] Deduced a trap composed of 9 places in 336 ms of which 0 ms to minimize.
[2024-05-29 21:14:44] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 0 ms to minimize.
[2024-05-29 21:14:44] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 0 ms to minimize.
[2024-05-29 21:14:44] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:14:50] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 0 ms to minimize.
[2024-05-29 21:14:50] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 1 ms to minimize.
[2024-05-29 21:14:50] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:14:50] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 1 ms to minimize.
[2024-05-29 21:14:51] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2024-05-29 21:14:51] [INFO ] Deduced a trap composed of 9 places in 342 ms of which 1 ms to minimize.
SMT process timed out in 61250ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 61272ms
Finished structural reductions in LTL mode , in 1 iterations and 61957 ms. Remains : 82/82 places, 2159/2159 transitions.
Built C files in :
/tmp/ltsmin12877032151456657411
[2024-05-29 21:14:51] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12877032151456657411
Running compilation step : cd /tmp/ltsmin12877032151456657411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12877032151456657411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12877032151456657411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 21:14:54] [INFO ] Flatten gal took : 122 ms
[2024-05-29 21:14:54] [INFO ] Flatten gal took : 123 ms
[2024-05-29 21:14:54] [INFO ] Time to serialize gal into /tmp/LTL2446025542219917507.gal : 24 ms
[2024-05-29 21:14:54] [INFO ] Time to serialize properties into /tmp/LTL11665821111737648833.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2446025542219917507.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5277023864983889327.hoa' '-atoms' '/tmp/LTL11665821111737648833.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11665821111737648833.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5277023864983889327.hoa
Detected timeout of ITS tools.
[2024-05-29 21:15:10] [INFO ] Flatten gal took : 119 ms
[2024-05-29 21:15:10] [INFO ] Flatten gal took : 120 ms
[2024-05-29 21:15:10] [INFO ] Time to serialize gal into /tmp/LTL14824447851991894969.gal : 26 ms
[2024-05-29 21:15:10] [INFO ] Time to serialize properties into /tmp/LTL3274678177106957519.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14824447851991894969.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3274678177106957519.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X("(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||((p124==0)||(p138==0)))")...412
Formula 0 simplified : XXG(X!"(((((p12==0)||(p26==0))||((p40==0)||(p54==0)))||(((p68==0)||(p82==0))||((p96==0)||(p110==0))))||((p124==0)||(p138==0)))" | G!...400
Detected timeout of ITS tools.
[2024-05-29 21:15:25] [INFO ] Flatten gal took : 132 ms
[2024-05-29 21:15:25] [INFO ] Applying decomposition
[2024-05-29 21:15:25] [INFO ] Flatten gal took : 122 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17592727900686800063.txt' '-o' '/tmp/graph17592727900686800063.bin' '-w' '/tmp/graph17592727900686800063.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17592727900686800063.bin' '-l' '-1' '-v' '-w' '/tmp/graph17592727900686800063.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:15:26] [INFO ] Decomposing Gal with order
[2024-05-29 21:15:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:15:26] [INFO ] Removed a total of 20530 redundant transitions.
[2024-05-29 21:15:26] [INFO ] Flatten gal took : 328 ms
[2024-05-29 21:15:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 105 ms.
[2024-05-29 21:15:26] [INFO ] Time to serialize gal into /tmp/LTL14931996629682757858.gal : 15 ms
[2024-05-29 21:15:26] [INFO ] Time to serialize properties into /tmp/LTL17034029690636471409.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14931996629682757858.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17034029690636471409.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F((X("(((((i4.u0.p12==0)||(i2.u5.p26==0))||((i2.u9.p40==0)||(i2.u7.p54==0)))||(((i2.u2.p68==0)||(i2.u14.p82==0))||((i2.u24.p96=...607
Formula 0 simplified : XXG(X!"(((((i4.u0.p12==0)||(i2.u5.p26==0))||((i2.u9.p40==0)||(i2.u7.p54==0)))||(((i2.u2.p68==0)||(i2.u14.p82==0))||((i2.u24.p96==0)|...595
Detected timeout of ITS tools.
Treatment of property StigmergyElection-PT-10a-LTLFireability-04 finished in 319100 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(G(p0))&&F(p1))))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 441 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2024-05-29 21:15:42] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2024-05-29 21:15:42] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 21:15:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-29 21:15:42] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:15:42] [INFO ] Invariant cache hit.
[2024-05-29 21:15:42] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:15:42] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2024-05-29 21:15:42] [INFO ] Redundant transitions in 117 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:15:42] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:15:42] [INFO ] Invariant cache hit.
[2024-05-29 21:15:42] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:16:00] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 21:16:00] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:16:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:16:00] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:16:00] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:16:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:16:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:16:01] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:16:01] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 1 ms to minimize.
[2024-05-29 21:16:01] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-29 21:16:01] [INFO ] Deduced a trap composed of 4 places in 179 ms of which 0 ms to minimize.
[2024-05-29 21:16:01] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 0 ms to minimize.
[2024-05-29 21:16:01] [INFO ] Deduced a trap composed of 4 places in 122 ms of which 0 ms to minimize.
[2024-05-29 21:16:02] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:16:02] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 0 ms to minimize.
[2024-05-29 21:16:02] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 21:16:02] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:16:02] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:16:02] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:16:04] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:16:08] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 1 ms to minimize.
[2024-05-29 21:16:08] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 0 ms to minimize.
[2024-05-29 21:16:08] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 1 ms to minimize.
[2024-05-29 21:16:08] [INFO ] Deduced a trap composed of 4 places in 246 ms of which 1 ms to minimize.
[2024-05-29 21:16:09] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-29 21:16:09] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 21:16:09] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 0 ms to minimize.
[2024-05-29 21:16:09] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 1 ms to minimize.
[2024-05-29 21:16:09] [INFO ] Deduced a trap composed of 4 places in 151 ms of which 0 ms to minimize.
[2024-05-29 21:16:09] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:16:10] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 21:16:10] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 0 ms to minimize.
[2024-05-29 21:16:10] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 21:16:10] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 21:16:10] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 21:16:10] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 21:16:10] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 1 ms to minimize.
[2024-05-29 21:16:10] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:16:11] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:16:11] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:16:30] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:16:30] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (OVERLAPS) 1/1095 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1138 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 42/42 constraints]
After SMT, in 75708ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75718ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76634 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-06
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 3 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-06 finished in 76783 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 429 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2024-05-29 21:16:58] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:16:58] [INFO ] Invariant cache hit.
[2024-05-29 21:16:58] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-29 21:16:58] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:16:58] [INFO ] Invariant cache hit.
[2024-05-29 21:16:59] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:16:59] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-29 21:16:59] [INFO ] Redundant transitions in 63 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:16:59] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:16:59] [INFO ] Invariant cache hit.
[2024-05-29 21:16:59] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:17:17] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 21:17:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:17:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:17:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:17:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:17:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:17:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 21:17:17] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:17:18] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 0 ms to minimize.
[2024-05-29 21:17:18] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 0 ms to minimize.
[2024-05-29 21:17:18] [INFO ] Deduced a trap composed of 4 places in 174 ms of which 1 ms to minimize.
[2024-05-29 21:17:18] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 21:17:18] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 2 ms to minimize.
[2024-05-29 21:17:18] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:17:19] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 21:17:19] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 21:17:19] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:17:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:17:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:17:21] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:17:25] [INFO ] Deduced a trap composed of 4 places in 264 ms of which 0 ms to minimize.
[2024-05-29 21:17:25] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-29 21:17:25] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-05-29 21:17:26] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 0 ms to minimize.
[2024-05-29 21:17:26] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2024-05-29 21:17:26] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2024-05-29 21:17:26] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-29 21:17:26] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 21:17:27] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 0 ms to minimize.
[2024-05-29 21:17:27] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 21:17:27] [INFO ] Deduced a trap composed of 4 places in 161 ms of which 0 ms to minimize.
[2024-05-29 21:17:27] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-29 21:17:27] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:17:27] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:17:27] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-29 21:17:28] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:17:28] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 1 ms to minimize.
[2024-05-29 21:17:28] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-29 21:17:28] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:17:28] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:17:46] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-29 21:17:47] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (OVERLAPS) 1/1095 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1138 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 42/42 constraints]
After SMT, in 75835ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75854ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76677 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-07
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 4 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-07 finished in 76738 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 13 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:18:15] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:18:15] [INFO ] Computed 1 invariants in 15 ms
[2024-05-29 21:18:15] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 21:18:15] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:18:15] [INFO ] Invariant cache hit.
[2024-05-29 21:18:15] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:18:15] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 643 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:18:15] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:18:15] [INFO ] Invariant cache hit.
[2024-05-29 21:18:16] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:18:57] [INFO ] Deduced a trap composed of 9 places in 478 ms of which 0 ms to minimize.
[2024-05-29 21:18:58] [INFO ] Deduced a trap composed of 9 places in 471 ms of which 1 ms to minimize.
[2024-05-29 21:18:58] [INFO ] Deduced a trap composed of 10 places in 473 ms of which 1 ms to minimize.
[2024-05-29 21:18:59] [INFO ] Deduced a trap composed of 11 places in 491 ms of which 0 ms to minimize.
[2024-05-29 21:18:59] [INFO ] Deduced a trap composed of 9 places in 407 ms of which 0 ms to minimize.
[2024-05-29 21:18:59] [INFO ] Deduced a trap composed of 9 places in 401 ms of which 1 ms to minimize.
[2024-05-29 21:19:00] [INFO ] Deduced a trap composed of 10 places in 406 ms of which 1 ms to minimize.
[2024-05-29 21:19:00] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 1 ms to minimize.
[2024-05-29 21:19:01] [INFO ] Deduced a trap composed of 9 places in 474 ms of which 1 ms to minimize.
[2024-05-29 21:19:01] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 1 ms to minimize.
[2024-05-29 21:19:02] [INFO ] Deduced a trap composed of 9 places in 405 ms of which 0 ms to minimize.
[2024-05-29 21:19:02] [INFO ] Deduced a trap composed of 9 places in 399 ms of which 1 ms to minimize.
[2024-05-29 21:19:02] [INFO ] Deduced a trap composed of 9 places in 346 ms of which 1 ms to minimize.
[2024-05-29 21:19:03] [INFO ] Deduced a trap composed of 9 places in 385 ms of which 0 ms to minimize.
[2024-05-29 21:19:03] [INFO ] Deduced a trap composed of 9 places in 392 ms of which 1 ms to minimize.
[2024-05-29 21:19:03] [INFO ] Deduced a trap composed of 9 places in 387 ms of which 1 ms to minimize.
[2024-05-29 21:19:04] [INFO ] Deduced a trap composed of 9 places in 380 ms of which 1 ms to minimize.
[2024-05-29 21:19:04] [INFO ] Deduced a trap composed of 9 places in 321 ms of which 1 ms to minimize.
[2024-05-29 21:19:04] [INFO ] Deduced a trap composed of 9 places in 278 ms of which 1 ms to minimize.
[2024-05-29 21:19:05] [INFO ] Deduced a trap composed of 9 places in 236 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:19:05] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 1 ms to minimize.
[2024-05-29 21:19:06] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 0 ms to minimize.
[2024-05-29 21:19:06] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 0 ms to minimize.
[2024-05-29 21:19:06] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2024-05-29 21:19:07] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 0 ms to minimize.
[2024-05-29 21:19:07] [INFO ] Deduced a trap composed of 10 places in 192 ms of which 1 ms to minimize.
[2024-05-29 21:19:07] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 0 ms to minimize.
[2024-05-29 21:19:07] [INFO ] Deduced a trap composed of 9 places in 200 ms of which 0 ms to minimize.
[2024-05-29 21:19:07] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2024-05-29 21:19:08] [INFO ] Deduced a trap composed of 10 places in 249 ms of which 0 ms to minimize.
[2024-05-29 21:19:08] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 1 ms to minimize.
[2024-05-29 21:19:08] [INFO ] Deduced a trap composed of 10 places in 245 ms of which 1 ms to minimize.
[2024-05-29 21:19:09] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 1 ms to minimize.
[2024-05-29 21:19:09] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 0 ms to minimize.
[2024-05-29 21:19:09] [INFO ] Deduced a trap composed of 9 places in 343 ms of which 0 ms to minimize.
[2024-05-29 21:19:10] [INFO ] Deduced a trap composed of 9 places in 340 ms of which 0 ms to minimize.
[2024-05-29 21:19:10] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 1 ms to minimize.
[2024-05-29 21:19:10] [INFO ] Deduced a trap composed of 9 places in 287 ms of which 1 ms to minimize.
[2024-05-29 21:19:11] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 1 ms to minimize.
[2024-05-29 21:19:11] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:19:16] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 0 ms to minimize.
[2024-05-29 21:19:17] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2024-05-29 21:19:17] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:19:17] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
SMT process timed out in 61454ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 61474ms
Finished structural reductions in LTL mode , in 1 iterations and 62141 ms. Remains : 82/82 places, 2159/2159 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-08
Product exploration explored 100000 steps with 4545 reset in 2639 ms.
Product exploration explored 100000 steps with 4545 reset in 2578 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 84 steps (0 resets) in 12 ms. (6 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 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-05-29 21:19:23] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:19:23] [INFO ] Invariant cache hit.
[2024-05-29 21:19:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 21:19:24] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2024-05-29 21:19:25] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:19:25] [INFO ] [Real]Added 2055 Read/Feed constraints in 177 ms returned sat
[2024-05-29 21:19:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:19:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 21:19:26] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2024-05-29 21:19:26] [INFO ] [Nat]Added 2055 Read/Feed constraints in 210 ms returned sat
[2024-05-29 21:19:27] [INFO ] Computed and/alt/rep : 70/80/70 causal constraints (skipped 2077 transitions) in 429 ms.
[2024-05-29 21:19:28] [INFO ] Added : 40 causal constraints over 8 iterations in 1275 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 434 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2024-05-29 21:19:28] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2024-05-29 21:19:28] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 21:19:28] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 21:19:28] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:19:28] [INFO ] Invariant cache hit.
[2024-05-29 21:19:28] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:19:28] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2024-05-29 21:19:29] [INFO ] Redundant transitions in 56 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:19:29] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:19:29] [INFO ] Invariant cache hit.
[2024-05-29 21:19:29] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:19:47] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 0 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 4 places in 168 ms of which 1 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 4 places in 145 ms of which 0 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 0 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:19:48] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 21:19:49] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:19:51] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:19:54] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-29 21:19:55] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2024-05-29 21:19:55] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-05-29 21:19:55] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 0 ms to minimize.
[2024-05-29 21:19:55] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-29 21:19:56] [INFO ] Deduced a trap composed of 4 places in 209 ms of which 0 ms to minimize.
[2024-05-29 21:19:56] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-29 21:19:56] [INFO ] Deduced a trap composed of 4 places in 185 ms of which 0 ms to minimize.
[2024-05-29 21:19:56] [INFO ] Deduced a trap composed of 4 places in 167 ms of which 0 ms to minimize.
[2024-05-29 21:19:56] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 21:19:56] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 21:19:57] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 21:19:57] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 21:19:57] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
[2024-05-29 21:19:57] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 21:19:57] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 21:19:57] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:19:57] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 21:19:57] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-29 21:19:58] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:20:16] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:20:16] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (OVERLAPS) 1/1095 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1138 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 42/42 constraints]
After SMT, in 75922ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75934ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76761 ms. Remains : 31/82 places, 1075/2159 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 65 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-29 21:20:45] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:20:45] [INFO ] Invariant cache hit.
[2024-05-29 21:20:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 21:20:46] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2024-05-29 21:20:46] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:20:46] [INFO ] [Real]Added 1043 Read/Feed constraints in 99 ms returned sat
[2024-05-29 21:20:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:20:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 21:20:46] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-29 21:20:46] [INFO ] [Nat]Added 1043 Read/Feed constraints in 106 ms returned sat
[2024-05-29 21:20:47] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 137 ms.
[2024-05-29 21:20:47] [INFO ] Added : 0 causal constraints over 0 iterations in 217 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 2576 ms.
Product exploration explored 100000 steps with 9090 reset in 2623 ms.
Built C files in :
/tmp/ltsmin16734810049192356533
[2024-05-29 21:20:52] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 21:20:52] [INFO ] Computation of Complete disable matrix. took 405 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:20:53] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 21:20:53] [INFO ] Computation of Complete enable matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:20:53] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 21:20:53] [INFO ] Computation of Completed DNA matrix. took 85 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:20:53] [INFO ] Built C files in 1013ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16734810049192356533
Running compilation step : cd /tmp/ltsmin16734810049192356533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16734810049192356533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16734810049192356533;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 163 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-05-29 21:20:56] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:20:56] [INFO ] Invariant cache hit.
[2024-05-29 21:20:56] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-29 21:20:56] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:20:56] [INFO ] Invariant cache hit.
[2024-05-29 21:20:56] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:20:57] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-29 21:20:57] [INFO ] Redundant transitions in 53 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:20:57] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:20:57] [INFO ] Invariant cache hit.
[2024-05-29 21:20:57] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:21:15] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 21:21:15] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:21:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:21:15] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 21:21:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:21:15] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 21:21:15] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:21:15] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:21:15] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 0 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 0 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:21:16] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:21:19] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:21:22] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2024-05-29 21:21:22] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-29 21:21:23] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-29 21:21:23] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-29 21:21:23] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 0 ms to minimize.
[2024-05-29 21:21:23] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 0 ms to minimize.
[2024-05-29 21:21:24] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-29 21:21:24] [INFO ] Deduced a trap composed of 4 places in 184 ms of which 0 ms to minimize.
[2024-05-29 21:21:24] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 0 ms to minimize.
[2024-05-29 21:21:24] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:21:24] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 21:21:24] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 0 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 1 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-29 21:21:25] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:21:44] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:21:44] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (OVERLAPS) 1/1095 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1138 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 42/42 constraints]
After SMT, in 75906ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75916ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76484 ms. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin15176346412011551116
[2024-05-29 21:22:13] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 21:22:13] [INFO ] Computation of Complete disable matrix. took 392 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:22:13] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 21:22:13] [INFO ] Computation of Complete enable matrix. took 58 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:22:13] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 21:22:13] [INFO ] Computation of Completed DNA matrix. took 80 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:22:14] [INFO ] Built C files in 996ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15176346412011551116
Running compilation step : cd /tmp/ltsmin15176346412011551116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15176346412011551116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15176346412011551116;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 21:22:17] [INFO ] Flatten gal took : 60 ms
[2024-05-29 21:22:17] [INFO ] Flatten gal took : 58 ms
[2024-05-29 21:22:17] [INFO ] Time to serialize gal into /tmp/LTL824775646898490445.gal : 11 ms
[2024-05-29 21:22:17] [INFO ] Time to serialize properties into /tmp/LTL15093875561507672561.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL824775646898490445.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6714036837431809920.hoa' '-atoms' '/tmp/LTL15093875561507672561.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL15093875561507672561.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6714036837431809920.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t66.t2157, t65.t2155, t67.t2153, t64.t2151, t...322
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
559 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.97119,138464,1,0,1158,44492,2167,45,43064,28377,2243
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-10a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyElection-PT-10a-LTLFireability-08 finished in 248048 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Applied a total of 0 rules in 6 ms. Remains 82 /82 variables (removed 0) and now considering 2159/2159 (removed 0) transitions.
[2024-05-29 21:22:23] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
// Phase 1: matrix 2148 rows 82 cols
[2024-05-29 21:22:23] [INFO ] Computed 1 invariants in 11 ms
[2024-05-29 21:22:23] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 21:22:23] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:22:23] [INFO ] Invariant cache hit.
[2024-05-29 21:22:23] [INFO ] State equation strengthened by 2055 read => feed constraints.
[2024-05-29 21:22:23] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
Running 2158 sub problems to find dead transitions.
[2024-05-29 21:22:23] [INFO ] Flow matrix only has 2148 transitions (discarded 11 similar events)
[2024-05-29 21:22:23] [INFO ] Invariant cache hit.
[2024-05-29 21:22:24] [INFO ] State equation strengthened by 2055 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:23:05] [INFO ] Deduced a trap composed of 9 places in 480 ms of which 1 ms to minimize.
[2024-05-29 21:23:06] [INFO ] Deduced a trap composed of 9 places in 486 ms of which 1 ms to minimize.
[2024-05-29 21:23:06] [INFO ] Deduced a trap composed of 10 places in 478 ms of which 1 ms to minimize.
[2024-05-29 21:23:07] [INFO ] Deduced a trap composed of 11 places in 475 ms of which 0 ms to minimize.
[2024-05-29 21:23:07] [INFO ] Deduced a trap composed of 9 places in 415 ms of which 1 ms to minimize.
[2024-05-29 21:23:07] [INFO ] Deduced a trap composed of 9 places in 411 ms of which 1 ms to minimize.
[2024-05-29 21:23:08] [INFO ] Deduced a trap composed of 10 places in 417 ms of which 1 ms to minimize.
[2024-05-29 21:23:08] [INFO ] Deduced a trap composed of 13 places in 416 ms of which 1 ms to minimize.
[2024-05-29 21:23:09] [INFO ] Deduced a trap composed of 9 places in 482 ms of which 0 ms to minimize.
[2024-05-29 21:23:09] [INFO ] Deduced a trap composed of 9 places in 420 ms of which 1 ms to minimize.
[2024-05-29 21:23:10] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 0 ms to minimize.
[2024-05-29 21:23:10] [INFO ] Deduced a trap composed of 9 places in 409 ms of which 1 ms to minimize.
[2024-05-29 21:23:10] [INFO ] Deduced a trap composed of 9 places in 349 ms of which 0 ms to minimize.
[2024-05-29 21:23:11] [INFO ] Deduced a trap composed of 9 places in 415 ms of which 0 ms to minimize.
[2024-05-29 21:23:11] [INFO ] Deduced a trap composed of 9 places in 398 ms of which 0 ms to minimize.
[2024-05-29 21:23:12] [INFO ] Deduced a trap composed of 9 places in 400 ms of which 0 ms to minimize.
[2024-05-29 21:23:12] [INFO ] Deduced a trap composed of 9 places in 400 ms of which 1 ms to minimize.
[2024-05-29 21:23:12] [INFO ] Deduced a trap composed of 9 places in 338 ms of which 1 ms to minimize.
[2024-05-29 21:23:13] [INFO ] Deduced a trap composed of 9 places in 283 ms of which 0 ms to minimize.
[2024-05-29 21:23:13] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:23:14] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 1 ms to minimize.
[2024-05-29 21:23:14] [INFO ] Deduced a trap composed of 9 places in 359 ms of which 0 ms to minimize.
[2024-05-29 21:23:14] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 1 ms to minimize.
[2024-05-29 21:23:15] [INFO ] Deduced a trap composed of 9 places in 295 ms of which 1 ms to minimize.
[2024-05-29 21:23:15] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 0 ms to minimize.
[2024-05-29 21:23:15] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 0 ms to minimize.
[2024-05-29 21:23:15] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2024-05-29 21:23:15] [INFO ] Deduced a trap composed of 9 places in 208 ms of which 0 ms to minimize.
[2024-05-29 21:23:16] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2024-05-29 21:23:16] [INFO ] Deduced a trap composed of 10 places in 250 ms of which 1 ms to minimize.
[2024-05-29 21:23:16] [INFO ] Deduced a trap composed of 10 places in 297 ms of which 0 ms to minimize.
[2024-05-29 21:23:16] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 0 ms to minimize.
[2024-05-29 21:23:17] [INFO ] Deduced a trap composed of 10 places in 361 ms of which 0 ms to minimize.
[2024-05-29 21:23:17] [INFO ] Deduced a trap composed of 10 places in 302 ms of which 0 ms to minimize.
[2024-05-29 21:23:18] [INFO ] Deduced a trap composed of 9 places in 345 ms of which 1 ms to minimize.
[2024-05-29 21:23:18] [INFO ] Deduced a trap composed of 9 places in 341 ms of which 0 ms to minimize.
[2024-05-29 21:23:18] [INFO ] Deduced a trap composed of 9 places in 347 ms of which 0 ms to minimize.
[2024-05-29 21:23:19] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2024-05-29 21:23:19] [INFO ] Deduced a trap composed of 9 places in 243 ms of which 0 ms to minimize.
[2024-05-29 21:23:19] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 2158 unsolved
[2024-05-29 21:23:25] [INFO ] Deduced a trap composed of 9 places in 248 ms of which 0 ms to minimize.
[2024-05-29 21:23:25] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 0 ms to minimize.
SMT process timed out in 61334ms, After SMT, problems are : Problem set: 0 solved, 2158 unsolved
Search for dead transitions found 0 dead transitions in 61356ms
Finished structural reductions in LTL mode , in 1 iterations and 62009 ms. Remains : 82/82 places, 2159/2159 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 21 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-09 finished in 62114 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||(F(p0)&&F(p1)))))'
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 447 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2024-05-29 21:23:25] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
// Phase 1: matrix 1064 rows 31 cols
[2024-05-29 21:23:25] [INFO ] Computed 1 invariants in 7 ms
[2024-05-29 21:23:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 21:23:25] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:23:25] [INFO ] Invariant cache hit.
[2024-05-29 21:23:26] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:23:26] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-29 21:23:26] [INFO ] Redundant transitions in 61 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:23:26] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:23:26] [INFO ] Invariant cache hit.
[2024-05-29 21:23:26] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:23:44] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-05-29 21:23:44] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:23:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:23:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:23:44] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:23:44] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:23:44] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:23:44] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:23:45] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-29 21:23:45] [INFO ] Deduced a trap composed of 4 places in 204 ms of which 0 ms to minimize.
[2024-05-29 21:23:45] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-29 21:23:45] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 21:23:45] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 21:23:45] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 21:23:45] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:23:46] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 21:23:46] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 21:23:46] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-05-29 21:23:46] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:23:48] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:23:51] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 0 ms to minimize.
[2024-05-29 21:23:52] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-05-29 21:23:52] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 0 ms to minimize.
[2024-05-29 21:23:52] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2024-05-29 21:23:52] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 0 ms to minimize.
[2024-05-29 21:23:53] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 1 ms to minimize.
[2024-05-29 21:23:53] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-29 21:23:53] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-29 21:23:53] [INFO ] Deduced a trap composed of 4 places in 165 ms of which 0 ms to minimize.
[2024-05-29 21:23:53] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:23:54] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:23:55] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 1 ms to minimize.
[2024-05-29 21:23:55] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:24:14] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-29 21:24:14] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (OVERLAPS) 1/1095 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1138 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 42/42 constraints]
After SMT, in 75972ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75983ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76842 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-10
Product exploration explored 100000 steps with 9090 reset in 2572 ms.
Product exploration explored 100000 steps with 9090 reset in 2582 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 82 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 43 ms :[(NOT p0)]
RANDOM walk for 40 steps (0 resets) in 10 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 103 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 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-05-29 21:24:47] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:24:47] [INFO ] Invariant cache hit.
[2024-05-29 21:24:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 21:24:48] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-29 21:24:48] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:24:48] [INFO ] [Real]Added 1043 Read/Feed constraints in 102 ms returned sat
[2024-05-29 21:24:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:24:49] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 21:24:49] [INFO ] [Nat]Absence check using state equation in 155 ms returned sat
[2024-05-29 21:24:49] [INFO ] [Nat]Added 1043 Read/Feed constraints in 107 ms returned sat
[2024-05-29 21:24:49] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 98 ms.
[2024-05-29 21:24:49] [INFO ] Added : 0 causal constraints over 0 iterations in 171 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 167 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-05-29 21:24:49] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:24:49] [INFO ] Invariant cache hit.
[2024-05-29 21:24:49] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 21:24:49] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:24:49] [INFO ] Invariant cache hit.
[2024-05-29 21:24:49] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:24:50] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-05-29 21:24:50] [INFO ] Redundant transitions in 56 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:24:50] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:24:50] [INFO ] Invariant cache hit.
[2024-05-29 21:24:50] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:25:08] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 21:25:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:25:08] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:25:08] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:25:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:25:08] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:25:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:25:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 21:25:08] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 203 ms of which 0 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 0 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 75 ms of which 1 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:25:09] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:25:12] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:25:15] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2024-05-29 21:25:15] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-29 21:25:16] [INFO ] Deduced a trap composed of 4 places in 251 ms of which 1 ms to minimize.
[2024-05-29 21:25:16] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2024-05-29 21:25:16] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-05-29 21:25:16] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-05-29 21:25:17] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-29 21:25:17] [INFO ] Deduced a trap composed of 4 places in 186 ms of which 0 ms to minimize.
[2024-05-29 21:25:17] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-29 21:25:17] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-29 21:25:17] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-29 21:25:17] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:25:18] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 21:25:18] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 21:25:18] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 21:25:18] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2024-05-29 21:25:18] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2024-05-29 21:25:18] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 0 ms to minimize.
[2024-05-29 21:25:18] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 21:25:18] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:25:37] [INFO ] Deduced a trap composed of 4 places in 136 ms of which 1 ms to minimize.
[2024-05-29 21:25:37] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (OVERLAPS) 1/1095 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1138 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 42/42 constraints]
After SMT, in 75869ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75880ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76437 ms. Remains : 31/31 places, 1075/1075 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 78 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 26 ms :[(NOT p0)]
RANDOM walk for 40 steps (0 resets) in 7 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2024-05-29 21:26:06] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:26:06] [INFO ] Invariant cache hit.
[2024-05-29 21:26:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 21:26:06] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2024-05-29 21:26:07] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:26:07] [INFO ] [Real]Added 1043 Read/Feed constraints in 101 ms returned sat
[2024-05-29 21:26:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 21:26:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-29 21:26:07] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-29 21:26:07] [INFO ] [Nat]Added 1043 Read/Feed constraints in 103 ms returned sat
[2024-05-29 21:26:07] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 1054 transitions) in 95 ms.
[2024-05-29 21:26:08] [INFO ] Added : 0 causal constraints over 0 iterations in 169 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9090 reset in 2515 ms.
Product exploration explored 100000 steps with 9090 reset in 2565 ms.
Built C files in :
/tmp/ltsmin6612210289159019395
[2024-05-29 21:26:13] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 21:26:13] [INFO ] Computation of Complete disable matrix. took 391 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:26:13] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 21:26:13] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:26:13] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 21:26:13] [INFO ] Computation of Completed DNA matrix. took 74 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:26:14] [INFO ] Built C files in 925ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6612210289159019395
Running compilation step : cd /tmp/ltsmin6612210289159019395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6612210289159019395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6612210289159019395;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 1075/1075 transitions.
Applied a total of 0 rules in 174 ms. Remains 31 /31 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-05-29 21:26:17] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:26:17] [INFO ] Invariant cache hit.
[2024-05-29 21:26:17] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 21:26:17] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:26:17] [INFO ] Invariant cache hit.
[2024-05-29 21:26:17] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:26:17] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-29 21:26:17] [INFO ] Redundant transitions in 58 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:26:17] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:26:17] [INFO ] Invariant cache hit.
[2024-05-29 21:26:17] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 1 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 0 ms to minimize.
[2024-05-29 21:26:36] [INFO ] Deduced a trap composed of 4 places in 172 ms of which 1 ms to minimize.
[2024-05-29 21:26:37] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 1 ms to minimize.
[2024-05-29 21:26:37] [INFO ] Deduced a trap composed of 4 places in 126 ms of which 0 ms to minimize.
[2024-05-29 21:26:37] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:26:37] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-05-29 21:26:37] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:26:37] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:26:37] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:26:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:26:39] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:26:43] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2024-05-29 21:26:43] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-05-29 21:26:43] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 0 ms to minimize.
[2024-05-29 21:26:44] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2024-05-29 21:26:44] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-29 21:26:44] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2024-05-29 21:26:44] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 0 ms to minimize.
[2024-05-29 21:26:45] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-29 21:26:45] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 1 ms to minimize.
[2024-05-29 21:26:45] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 21:26:45] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 0 ms to minimize.
[2024-05-29 21:26:45] [INFO ] Deduced a trap composed of 4 places in 150 ms of which 0 ms to minimize.
[2024-05-29 21:26:45] [INFO ] Deduced a trap composed of 4 places in 132 ms of which 0 ms to minimize.
[2024-05-29 21:26:45] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 0 ms to minimize.
[2024-05-29 21:26:45] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 0 ms to minimize.
[2024-05-29 21:26:46] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:26:46] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:26:46] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 1 ms to minimize.
[2024-05-29 21:26:46] [INFO ] Deduced a trap composed of 4 places in 124 ms of which 0 ms to minimize.
[2024-05-29 21:26:46] [INFO ] Deduced a trap composed of 4 places in 101 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:27:05] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 0 ms to minimize.
[2024-05-29 21:27:05] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (OVERLAPS) 1/1095 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1138 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 42/42 constraints]
After SMT, in 75880ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75890ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 76471 ms. Remains : 31/31 places, 1075/1075 transitions.
Built C files in :
/tmp/ltsmin9257793174969598877
[2024-05-29 21:27:33] [INFO ] Computing symmetric may disable matrix : 1075 transitions.
[2024-05-29 21:27:34] [INFO ] Computation of Complete disable matrix. took 389 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:27:34] [INFO ] Computing symmetric may enable matrix : 1075 transitions.
[2024-05-29 21:27:34] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:27:34] [INFO ] Computing Do-Not-Accords matrix : 1075 transitions.
[2024-05-29 21:27:34] [INFO ] Computation of Completed DNA matrix. took 73 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 21:27:34] [INFO ] Built C files in 920ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9257793174969598877
Running compilation step : cd /tmp/ltsmin9257793174969598877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9257793174969598877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9257793174969598877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 21:27:37] [INFO ] Flatten gal took : 59 ms
[2024-05-29 21:27:37] [INFO ] Flatten gal took : 59 ms
[2024-05-29 21:27:37] [INFO ] Time to serialize gal into /tmp/LTL9398290026934952048.gal : 11 ms
[2024-05-29 21:27:37] [INFO ] Time to serialize properties into /tmp/LTL16020744693865567736.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9398290026934952048.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10387024362177824448.hoa' '-atoms' '/tmp/LTL16020744693865567736.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16020744693865567736.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10387024362177824448.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t66.t2157, t65.t2155, t67.t2153, t64.t2151, t...322
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
568 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,6.0748,138216,1,0,1161,44534,2161,46,43161,27848,2245
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA StigmergyElection-PT-10a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property StigmergyElection-PT-10a-LTLFireability-10 finished in 258525 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 420 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2024-05-29 21:27:44] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:27:44] [INFO ] Invariant cache hit.
[2024-05-29 21:27:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-29 21:27:44] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:27:44] [INFO ] Invariant cache hit.
[2024-05-29 21:27:44] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:27:44] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2024-05-29 21:27:44] [INFO ] Redundant transitions in 53 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:27:44] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:27:44] [INFO ] Invariant cache hit.
[2024-05-29 21:27:44] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 0 ms to minimize.
[2024-05-29 21:28:03] [INFO ] Deduced a trap composed of 4 places in 196 ms of which 0 ms to minimize.
[2024-05-29 21:28:04] [INFO ] Deduced a trap composed of 4 places in 171 ms of which 1 ms to minimize.
[2024-05-29 21:28:04] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
[2024-05-29 21:28:04] [INFO ] Deduced a trap composed of 4 places in 120 ms of which 0 ms to minimize.
[2024-05-29 21:28:04] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 0 ms to minimize.
[2024-05-29 21:28:04] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-05-29 21:28:04] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:28:04] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:28:04] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:28:04] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:28:07] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:28:10] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-29 21:28:10] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 0 ms to minimize.
[2024-05-29 21:28:11] [INFO ] Deduced a trap composed of 4 places in 245 ms of which 1 ms to minimize.
[2024-05-29 21:28:11] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 0 ms to minimize.
[2024-05-29 21:28:11] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 1 ms to minimize.
[2024-05-29 21:28:11] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 0 ms to minimize.
[2024-05-29 21:28:11] [INFO ] Deduced a trap composed of 4 places in 213 ms of which 0 ms to minimize.
[2024-05-29 21:28:12] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 0 ms to minimize.
[2024-05-29 21:28:12] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-29 21:28:12] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 21:28:12] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 0 ms to minimize.
[2024-05-29 21:28:12] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 21:28:12] [INFO ] Deduced a trap composed of 4 places in 127 ms of which 0 ms to minimize.
[2024-05-29 21:28:13] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:28:13] [INFO ] Deduced a trap composed of 4 places in 137 ms of which 1 ms to minimize.
[2024-05-29 21:28:13] [INFO ] Deduced a trap composed of 4 places in 111 ms of which 0 ms to minimize.
[2024-05-29 21:28:13] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:28:13] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 21:28:13] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 21:28:13] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:28:32] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-29 21:28:32] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (OVERLAPS) 1/1095 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1138 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 42/42 constraints]
After SMT, in 76004ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 76014ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76842 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, p0]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-11
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-11 finished in 76949 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 420 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2024-05-29 21:29:01] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:29:01] [INFO ] Invariant cache hit.
[2024-05-29 21:29:01] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-29 21:29:01] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:29:01] [INFO ] Invariant cache hit.
[2024-05-29 21:29:01] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:29:01] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2024-05-29 21:29:01] [INFO ] Redundant transitions in 56 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:29:01] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:29:01] [INFO ] Invariant cache hit.
[2024-05-29 21:29:01] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 240 ms of which 3 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-29 21:29:20] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 0 ms to minimize.
[2024-05-29 21:29:21] [INFO ] Deduced a trap composed of 4 places in 157 ms of which 0 ms to minimize.
[2024-05-29 21:29:21] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:29:21] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 1 ms to minimize.
[2024-05-29 21:29:21] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:29:21] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:29:21] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:29:21] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-05-29 21:29:21] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:29:23] [INFO ] Deduced a trap composed of 4 places in 86 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:29:27] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-05-29 21:29:27] [INFO ] Deduced a trap composed of 4 places in 224 ms of which 0 ms to minimize.
[2024-05-29 21:29:27] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 1 ms to minimize.
[2024-05-29 21:29:28] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-29 21:29:28] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 0 ms to minimize.
[2024-05-29 21:29:28] [INFO ] Deduced a trap composed of 4 places in 221 ms of which 0 ms to minimize.
[2024-05-29 21:29:28] [INFO ] Deduced a trap composed of 4 places in 214 ms of which 1 ms to minimize.
[2024-05-29 21:29:29] [INFO ] Deduced a trap composed of 4 places in 188 ms of which 0 ms to minimize.
[2024-05-29 21:29:29] [INFO ] Deduced a trap composed of 4 places in 152 ms of which 1 ms to minimize.
[2024-05-29 21:29:29] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 21:29:29] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-05-29 21:29:29] [INFO ] Deduced a trap composed of 4 places in 155 ms of which 0 ms to minimize.
[2024-05-29 21:29:29] [INFO ] Deduced a trap composed of 4 places in 125 ms of which 0 ms to minimize.
[2024-05-29 21:29:29] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
[2024-05-29 21:29:30] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2024-05-29 21:29:30] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:29:30] [INFO ] Deduced a trap composed of 4 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:29:30] [INFO ] Deduced a trap composed of 4 places in 128 ms of which 1 ms to minimize.
[2024-05-29 21:29:30] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 1 ms to minimize.
[2024-05-29 21:29:30] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:29:49] [INFO ] Deduced a trap composed of 4 places in 134 ms of which 1 ms to minimize.
[2024-05-29 21:29:49] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 9 (OVERLAPS) 1/1095 variables, 1/1138 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1095/1095 variables, and 1138 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 42/42 constraints]
After SMT, in 75963ms problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75974ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76786 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-14
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-14 finished in 76896 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 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 1113 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 1133 place count 31 transition count 1075
Applied a total of 1133 rules in 422 ms. Remains 31 /82 variables (removed 51) and now considering 1075/2159 (removed 1084) transitions.
[2024-05-29 21:30:18] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:30:18] [INFO ] Invariant cache hit.
[2024-05-29 21:30:18] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 21:30:18] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:30:18] [INFO ] Invariant cache hit.
[2024-05-29 21:30:18] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:30:18] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2024-05-29 21:30:18] [INFO ] Redundant transitions in 54 ms returned []
Running 1065 sub problems to find dead transitions.
[2024-05-29 21:30:18] [INFO ] Flow matrix only has 1064 transitions (discarded 11 similar events)
[2024-05-29 21:30:18] [INFO ] Invariant cache hit.
[2024-05-29 21:30:18] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:30:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 1 ms to minimize.
[2024-05-29 21:30:37] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-05-29 21:30:38] [INFO ] Deduced a trap composed of 4 places in 146 ms of which 0 ms to minimize.
[2024-05-29 21:30:38] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:30:38] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 21:30:38] [INFO ] Deduced a trap composed of 4 places in 85 ms of which 1 ms to minimize.
[2024-05-29 21:30:38] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:30:38] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:30:38] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-05-29 21:30:38] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:30:40] [INFO ] Deduced a trap composed of 4 places in 91 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:30:44] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 0 ms to minimize.
[2024-05-29 21:30:44] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 0 ms to minimize.
[2024-05-29 21:30:45] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-05-29 21:30:45] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 1 ms to minimize.
[2024-05-29 21:30:45] [INFO ] Deduced a trap composed of 4 places in 250 ms of which 1 ms to minimize.
[2024-05-29 21:30:45] [INFO ] Deduced a trap composed of 4 places in 212 ms of which 0 ms to minimize.
[2024-05-29 21:30:46] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-29 21:30:46] [INFO ] Deduced a trap composed of 4 places in 182 ms of which 1 ms to minimize.
[2024-05-29 21:30:46] [INFO ] Deduced a trap composed of 4 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:30:46] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 21:30:46] [INFO ] Deduced a trap composed of 4 places in 156 ms of which 0 ms to minimize.
[2024-05-29 21:30:46] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2024-05-29 21:30:46] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 21:30:47] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:30:47] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:30:47] [INFO ] Deduced a trap composed of 4 places in 108 ms of which 0 ms to minimize.
[2024-05-29 21:30:47] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:30:47] [INFO ] Deduced a trap composed of 4 places in 133 ms of which 0 ms to minimize.
[2024-05-29 21:30:47] [INFO ] Deduced a trap composed of 4 places in 130 ms of which 0 ms to minimize.
[2024-05-29 21:30:47] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (OVERLAPS) 1063/1094 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 1042/1114 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1094/1095 variables, and 1114 constraints, problems are : Problem set: 0 solved, 1065 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1065/21 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
[2024-05-29 21:31:06] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 0 ms to minimize.
[2024-05-29 21:31:06] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 5 (OVERLAPS) 1063/1094 variables, 31/74 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 1042/1116 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 21/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1094 variables, 0/1137 constraints. Problems are: Problem set: 0 solved, 1065 unsolved
SMT process timed out in 75982ms, After SMT, problems are : Problem set: 0 solved, 1065 unsolved
Search for dead transitions found 0 dead transitions in 75993ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/82 places, 1075/2159 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 76823 ms. Remains : 31/82 places, 1075/2159 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, p0]
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-15
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyElection-PT-10a-LTLFireability-15 finished in 76936 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(p0)&&F(p1))))))'
Found a Shortening insensitive property : StigmergyElection-PT-10a-LTLFireability-04
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 10 out of 82 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 82/82 places, 2159/2159 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 81 transition count 2138
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 61 transition count 2138
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 41 transition count 2118
Ensure Unique test removed 1023 transitions
Reduce isomorphic transitions removed 1023 transitions.
Iterating post reduction 0 with 1023 rules applied. Total rules applied 1103 place count 41 transition count 1095
Applied a total of 1103 rules in 99 ms. Remains 41 /82 variables (removed 41) and now considering 1095/2159 (removed 1064) transitions.
[2024-05-29 21:31:35] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
// Phase 1: matrix 1084 rows 41 cols
[2024-05-29 21:31:35] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 21:31:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 21:31:35] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 21:31:35] [INFO ] Invariant cache hit.
[2024-05-29 21:31:35] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:31:35] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-05-29 21:31:35] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 21:31:35] [INFO ] Invariant cache hit.
[2024-05-29 21:31:35] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:31:54] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:31:54] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 21:31:54] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-05-29 21:31:54] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:31:54] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:31:54] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2024-05-29 21:31:54] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2024-05-29 21:31:54] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-29 21:31:54] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:31:55] [INFO ] Deduced a trap composed of 5 places in 249 ms of which 1 ms to minimize.
[2024-05-29 21:31:55] [INFO ] Deduced a trap composed of 5 places in 219 ms of which 1 ms to minimize.
[2024-05-29 21:31:55] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 0 ms to minimize.
[2024-05-29 21:31:55] [INFO ] Deduced a trap composed of 5 places in 187 ms of which 0 ms to minimize.
[2024-05-29 21:31:55] [INFO ] Deduced a trap composed of 5 places in 189 ms of which 1 ms to minimize.
[2024-05-29 21:31:55] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2024-05-29 21:31:56] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2024-05-29 21:31:56] [INFO ] Deduced a trap composed of 5 places in 207 ms of which 0 ms to minimize.
[2024-05-29 21:31:56] [INFO ] Deduced a trap composed of 5 places in 174 ms of which 0 ms to minimize.
[2024-05-29 21:31:56] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 0 ms to minimize.
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 146 ms of which 1 ms to minimize.
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 154 ms of which 1 ms to minimize.
[2024-05-29 21:31:57] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2024-05-29 21:31:58] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
[2024-05-29 21:31:58] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2024-05-29 21:31:58] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 1 ms to minimize.
[2024-05-29 21:31:58] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2024-05-29 21:31:58] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 21:31:58] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 21:31:58] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 1 ms to minimize.
[2024-05-29 21:31:59] [INFO ] Deduced a trap composed of 5 places in 125 ms of which 0 ms to minimize.
[2024-05-29 21:31:59] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 21:31:59] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2024-05-29 21:31:59] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:32:01] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 21:32:01] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:32:01] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-05-29 21:32:01] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 21:32:01] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:32:01] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:32:01] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:32:01] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 0 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-29 21:32:04] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
[2024-05-29 21:32:05] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:32:07] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 0 ms to minimize.
[2024-05-29 21:32:07] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-05-29 21:32:07] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 0 ms to minimize.
[2024-05-29 21:32:08] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 1 ms to minimize.
[2024-05-29 21:32:08] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1146 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:32:23] [INFO ] Deduced a trap composed of 5 places in 91 ms of which 0 ms to minimize.
[2024-05-29 21:32:23] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:32:23] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:32:26] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 0 ms to minimize.
[2024-05-29 21:32:26] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:32:26] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:32:26] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:32:26] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 21:32:26] [INFO ] Deduced a trap composed of 5 places in 137 ms of which 0 ms to minimize.
[2024-05-29 21:32:26] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:32:29] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-05-29 21:32:29] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:32:32] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2024-05-29 21:32:32] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:32:32] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 21:32:32] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:32:32] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:32:32] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:32:32] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:32:32] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 21:32:32] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2024-05-29 21:32:33] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 1 ms to minimize.
[2024-05-29 21:32:33] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 21:32:33] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 0 ms to minimize.
[2024-05-29 21:32:33] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 0 ms to minimize.
[2024-05-29 21:32:33] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1172 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 41/1213 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 88/88 constraints]
After SMT, in 75993ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 76005ms
Starting structural reductions in LI_LTL mode, iteration 1 : 41/82 places, 1095/2159 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 76434 ms. Remains : 41/82 places, 1095/2159 transitions.
Running random walk in product with property : StigmergyElection-PT-10a-LTLFireability-04
Product exploration explored 100000 steps with 25000 reset in 1502 ms.
Product exploration explored 100000 steps with 25000 reset in 1504 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 : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 40 steps (0 resets) in 6 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 1095/1095 transitions.
Applied a total of 0 rules in 4 ms. Remains 41 /41 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
[2024-05-29 21:32:55] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 21:32:55] [INFO ] Invariant cache hit.
[2024-05-29 21:32:55] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 21:32:55] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 21:32:55] [INFO ] Invariant cache hit.
[2024-05-29 21:32:55] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:32:55] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-05-29 21:32:55] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 21:32:55] [INFO ] Invariant cache hit.
[2024-05-29 21:32:55] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:33:14] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 21:33:14] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:33:14] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:33:14] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:33:14] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:33:14] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 21:33:14] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:33:14] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 21:33:14] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 0 ms to minimize.
[2024-05-29 21:33:15] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 0 ms to minimize.
[2024-05-29 21:33:15] [INFO ] Deduced a trap composed of 5 places in 211 ms of which 0 ms to minimize.
[2024-05-29 21:33:15] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2024-05-29 21:33:15] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 0 ms to minimize.
[2024-05-29 21:33:15] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2024-05-29 21:33:15] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 1 ms to minimize.
[2024-05-29 21:33:16] [INFO ] Deduced a trap composed of 5 places in 186 ms of which 1 ms to minimize.
[2024-05-29 21:33:16] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2024-05-29 21:33:16] [INFO ] Deduced a trap composed of 5 places in 181 ms of which 0 ms to minimize.
[2024-05-29 21:33:16] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 0 ms to minimize.
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 246 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 139 ms of which 1 ms to minimize.
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 0 ms to minimize.
[2024-05-29 21:33:17] [INFO ] Deduced a trap composed of 5 places in 183 ms of which 0 ms to minimize.
[2024-05-29 21:33:18] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 0 ms to minimize.
[2024-05-29 21:33:18] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 0 ms to minimize.
[2024-05-29 21:33:18] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2024-05-29 21:33:18] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 1 ms to minimize.
[2024-05-29 21:33:18] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 1 ms to minimize.
[2024-05-29 21:33:18] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 0 ms to minimize.
[2024-05-29 21:33:18] [INFO ] Deduced a trap composed of 5 places in 160 ms of which 0 ms to minimize.
[2024-05-29 21:33:19] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 0 ms to minimize.
[2024-05-29 21:33:19] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
[2024-05-29 21:33:19] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:33:19] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:33:20] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 1 ms to minimize.
[2024-05-29 21:33:21] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 21:33:21] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-05-29 21:33:21] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2024-05-29 21:33:21] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:33:21] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 21:33:21] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:33:21] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:33:24] [INFO ] Deduced a trap composed of 5 places in 143 ms of which 0 ms to minimize.
[2024-05-29 21:33:24] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
[2024-05-29 21:33:24] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 0 ms to minimize.
[2024-05-29 21:33:24] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 21:33:24] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:33:24] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
[2024-05-29 21:33:24] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
[2024-05-29 21:33:24] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 0 ms to minimize.
[2024-05-29 21:33:25] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:33:27] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 1 ms to minimize.
[2024-05-29 21:33:27] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-05-29 21:33:27] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2024-05-29 21:33:28] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 0 ms to minimize.
[2024-05-29 21:33:28] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1146 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:33:43] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:33:43] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:33:43] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:33:46] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-05-29 21:33:46] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 21:33:46] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 21:33:46] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:33:46] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:33:46] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-05-29 21:33:46] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:33:49] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 0 ms to minimize.
[2024-05-29 21:33:49] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:33:51] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 131 ms of which 0 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 0 ms to minimize.
[2024-05-29 21:33:52] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 1 ms to minimize.
[2024-05-29 21:33:53] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 1 ms to minimize.
[2024-05-29 21:33:53] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:33:53] [INFO ] Deduced a trap composed of 5 places in 162 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1172 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 41/1213 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 88/88 constraints]
After SMT, in 75895ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 75908ms
Finished structural reductions in LTL mode , in 1 iterations and 76244 ms. Remains : 41/41 places, 1095/1095 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 : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 85 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Reduction of identical properties reduced properties to check from 3 to 1
RANDOM walk for 40 steps (0 resets) in 9 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 143 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 1486 ms.
Product exploration explored 100000 steps with 25000 reset in 1483 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 1095/1095 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 41 transition count 1085
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 41 transition count 1085
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 20 rules in 357 ms. Remains 41 /41 variables (removed 0) and now considering 1085/1095 (removed 10) transitions.
[2024-05-29 21:34:16] [INFO ] Redundant transitions in 53 ms returned []
Running 1075 sub problems to find dead transitions.
[2024-05-29 21:34:16] [INFO ] Flow matrix only has 1074 transitions (discarded 11 similar events)
// Phase 1: matrix 1074 rows 41 cols
[2024-05-29 21:34:16] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 21:34:16] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:34:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:34:34] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:34:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:34:34] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:34:35] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:34:35] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-05-29 21:34:35] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 21:34:35] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-05-29 21:34:35] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-05-29 21:34:35] [INFO ] Deduced a trap composed of 4 places in 260 ms of which 1 ms to minimize.
[2024-05-29 21:34:35] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2024-05-29 21:34:36] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 1 ms to minimize.
[2024-05-29 21:34:36] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-29 21:34:36] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-29 21:34:36] [INFO ] Deduced a trap composed of 4 places in 207 ms of which 1 ms to minimize.
[2024-05-29 21:34:36] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 21:34:37] [INFO ] Deduced a trap composed of 4 places in 181 ms of which 1 ms to minimize.
[2024-05-29 21:34:37] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 0 ms to minimize.
[2024-05-29 21:34:37] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 21:34:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:34:37] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 21:34:37] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:34:37] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:34:37] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-05-29 21:34:37] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-29 21:34:38] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 1 ms to minimize.
[2024-05-29 21:34:38] [INFO ] Deduced a trap composed of 4 places in 190 ms of which 1 ms to minimize.
[2024-05-29 21:34:38] [INFO ] Deduced a trap composed of 4 places in 159 ms of which 1 ms to minimize.
[2024-05-29 21:34:38] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 0 ms to minimize.
[2024-05-29 21:34:38] [INFO ] Deduced a trap composed of 4 places in 140 ms of which 0 ms to minimize.
[2024-05-29 21:34:38] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 21:34:39] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 1 ms to minimize.
[2024-05-29 21:34:39] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 0 ms to minimize.
[2024-05-29 21:34:39] [INFO ] Deduced a trap composed of 4 places in 138 ms of which 0 ms to minimize.
[2024-05-29 21:34:39] [INFO ] Deduced a trap composed of 4 places in 119 ms of which 1 ms to minimize.
[2024-05-29 21:34:39] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 0 ms to minimize.
[2024-05-29 21:34:39] [INFO ] Deduced a trap composed of 4 places in 90 ms of which 0 ms to minimize.
[2024-05-29 21:34:39] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-29 21:34:39] [INFO ] Deduced a trap composed of 4 places in 109 ms of which 0 ms to minimize.
[2024-05-29 21:34:39] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:34:41] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
[2024-05-29 21:34:44] [INFO ] Deduced a trap composed of 4 places in 112 ms of which 0 ms to minimize.
[2024-05-29 21:34:44] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-29 21:34:44] [INFO ] Deduced a trap composed of 4 places in 88 ms of which 1 ms to minimize.
[2024-05-29 21:34:44] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 0 ms to minimize.
[2024-05-29 21:34:44] [INFO ] Deduced a trap composed of 4 places in 92 ms of which 0 ms to minimize.
[2024-05-29 21:34:44] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-05-29 21:34:44] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1075 unsolved
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 7 (OVERLAPS) 1073/1114 variables, 41/90 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1114 variables, 1042/1132 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1114/1115 variables, and 1132 constraints, problems are : Problem set: 10 solved, 1065 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1075/31 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1065 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 1 (OVERLAPS) 20/41 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 48/49 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/49 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 4 (OVERLAPS) 1073/1114 variables, 41/90 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1114 variables, 1042/1132 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1114 variables, 21/1153 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1114 variables, 0/1153 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
At refinement iteration 8 (OVERLAPS) 1/1115 variables, 1/1154 constraints. Problems are: Problem set: 10 solved, 1065 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1115/1115 variables, and 1154 constraints, problems are : Problem set: 10 solved, 1065 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1043/1043 constraints, PredecessorRefiner: 1065/31 constraints, Known Traps: 48/48 constraints]
After SMT, in 75827ms problems are : Problem set: 10 solved, 1065 unsolved
Search for dead transitions found 10 dead transitions in 75838ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 41/41 places, 1075/1095 transitions.
Graph (complete) has 341 edges and 41 vertex of which 31 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 169 ms. Remains 31 /41 variables (removed 10) and now considering 1075/1075 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 31/41 places, 1075/1095 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76429 ms. Remains : 31/41 places, 1075/1095 transitions.
Built C files in :
/tmp/ltsmin6874569604713907607
[2024-05-29 21:35:32] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6874569604713907607
Running compilation step : cd /tmp/ltsmin6874569604713907607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6874569604713907607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6874569604713907607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 1095/1095 transitions.
Applied a total of 0 rules in 8 ms. Remains 41 /41 variables (removed 0) and now considering 1095/1095 (removed 0) transitions.
[2024-05-29 21:35:35] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
// Phase 1: matrix 1084 rows 41 cols
[2024-05-29 21:35:35] [INFO ] Computed 1 invariants in 8 ms
[2024-05-29 21:35:35] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 21:35:35] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 21:35:35] [INFO ] Invariant cache hit.
[2024-05-29 21:35:35] [INFO ] State equation strengthened by 1043 read => feed constraints.
[2024-05-29 21:35:35] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
Running 1085 sub problems to find dead transitions.
[2024-05-29 21:35:35] [INFO ] Flow matrix only has 1084 transitions (discarded 11 similar events)
[2024-05-29 21:35:35] [INFO ] Invariant cache hit.
[2024-05-29 21:35:35] [INFO ] State equation strengthened by 1043 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:35:54] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-29 21:35:54] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-29 21:35:54] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:35:54] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:35:54] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:35:54] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:35:54] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-29 21:35:54] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:35:55] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 1 ms to minimize.
[2024-05-29 21:35:55] [INFO ] Deduced a trap composed of 5 places in 247 ms of which 1 ms to minimize.
[2024-05-29 21:35:55] [INFO ] Deduced a trap composed of 5 places in 216 ms of which 0 ms to minimize.
[2024-05-29 21:35:55] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 0 ms to minimize.
[2024-05-29 21:35:55] [INFO ] Deduced a trap composed of 5 places in 175 ms of which 0 ms to minimize.
[2024-05-29 21:35:56] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 1 ms to minimize.
[2024-05-29 21:35:56] [INFO ] Deduced a trap composed of 5 places in 157 ms of which 1 ms to minimize.
[2024-05-29 21:35:56] [INFO ] Deduced a trap composed of 5 places in 180 ms of which 0 ms to minimize.
[2024-05-29 21:35:56] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2024-05-29 21:35:56] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2024-05-29 21:35:56] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 0 ms to minimize.
[2024-05-29 21:35:57] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:35:57] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-05-29 21:35:57] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:35:57] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:35:57] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:35:57] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-29 21:35:57] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-29 21:35:57] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 21:35:58] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-29 21:35:58] [INFO ] Deduced a trap composed of 5 places in 176 ms of which 0 ms to minimize.
[2024-05-29 21:35:58] [INFO ] Deduced a trap composed of 5 places in 150 ms of which 1 ms to minimize.
[2024-05-29 21:35:58] [INFO ] Deduced a trap composed of 5 places in 151 ms of which 1 ms to minimize.
[2024-05-29 21:35:58] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2024-05-29 21:35:58] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 1 ms to minimize.
[2024-05-29 21:35:58] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 0 ms to minimize.
[2024-05-29 21:35:58] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 1 ms to minimize.
[2024-05-29 21:35:59] [INFO ] Deduced a trap composed of 5 places in 156 ms of which 1 ms to minimize.
[2024-05-29 21:35:59] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2024-05-29 21:35:59] [INFO ] Deduced a trap composed of 5 places in 101 ms of which 1 ms to minimize.
[2024-05-29 21:35:59] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 21:35:59] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:36:01] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 1 ms to minimize.
[2024-05-29 21:36:01] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-29 21:36:01] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 1 ms to minimize.
[2024-05-29 21:36:01] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2024-05-29 21:36:01] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 1 ms to minimize.
[2024-05-29 21:36:01] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 0 ms to minimize.
[2024-05-29 21:36:01] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:36:01] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 8/49 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:36:04] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2024-05-29 21:36:04] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 0 ms to minimize.
[2024-05-29 21:36:04] [INFO ] Deduced a trap composed of 6 places in 102 ms of which 0 ms to minimize.
[2024-05-29 21:36:04] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:36:04] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-05-29 21:36:04] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-05-29 21:36:05] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 0 ms to minimize.
[2024-05-29 21:36:05] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 21:36:05] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:36:07] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2024-05-29 21:36:07] [INFO ] Deduced a trap composed of 5 places in 122 ms of which 0 ms to minimize.
[2024-05-29 21:36:08] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 0 ms to minimize.
[2024-05-29 21:36:08] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 0 ms to minimize.
[2024-05-29 21:36:08] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/104 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1146 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1124/1125 variables, and 1146 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 62/62 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1085 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 1 (OVERLAPS) 10/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:36:23] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2024-05-29 21:36:23] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-29 21:36:23] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:36:26] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-29 21:36:26] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-05-29 21:36:26] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-29 21:36:26] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:36:26] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-05-29 21:36:26] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 21:36:27] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 7/73 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:36:29] [INFO ] Deduced a trap composed of 5 places in 134 ms of which 0 ms to minimize.
[2024-05-29 21:36:29] [INFO ] Deduced a trap composed of 5 places in 106 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
[2024-05-29 21:36:32] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 0 ms to minimize.
[2024-05-29 21:36:32] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 0 ms to minimize.
[2024-05-29 21:36:32] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:36:32] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-29 21:36:32] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-05-29 21:36:32] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 0 ms to minimize.
[2024-05-29 21:36:32] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-05-29 21:36:32] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2024-05-29 21:36:33] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2024-05-29 21:36:33] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-29 21:36:33] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 0 ms to minimize.
[2024-05-29 21:36:33] [INFO ] Deduced a trap composed of 5 places in 109 ms of which 1 ms to minimize.
[2024-05-29 21:36:33] [INFO ] Deduced a trap composed of 5 places in 80 ms of which 0 ms to minimize.
[2024-05-29 21:36:33] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 8 (OVERLAPS) 1083/1124 variables, 41/130 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1124 variables, 1042/1172 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1124 variables, 41/1213 constraints. Problems are: Problem set: 0 solved, 1085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1124/1125 variables, and 1213 constraints, problems are : Problem set: 0 solved, 1085 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 41/41 constraints, ReadFeed: 1042/1043 constraints, PredecessorRefiner: 1085/41 constraints, Known Traps: 88/88 constraints]
After SMT, in 76154ms problems are : Problem set: 0 solved, 1085 unsolved
Search for dead transitions found 0 dead transitions in 76168ms
Finished structural reductions in LTL mode , in 1 iterations and 76525 ms. Remains : 41/41 places, 1095/1095 transitions.
Built C files in :
/tmp/ltsmin17447508077558764169
[2024-05-29 21:36:51] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17447508077558764169
Running compilation step : cd /tmp/ltsmin17447508077558764169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17447508077558764169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17447508077558764169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-29 21:36:55] [INFO ] Flatten gal took : 58 ms
[2024-05-29 21:36:55] [INFO ] Flatten gal took : 59 ms
[2024-05-29 21:36:55] [INFO ] Time to serialize gal into /tmp/LTL8171184272095266114.gal : 11 ms
[2024-05-29 21:36:55] [INFO ] Time to serialize properties into /tmp/LTL10904254564847833599.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8171184272095266114.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8969262184304875585.hoa' '-atoms' '/tmp/LTL10904254564847833599.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL10904254564847833599.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8969262184304875585.hoa
Reverse transition relation is NOT exact ! Due to transitions t3, t8, t13, t18, t23, t28, t33, t38, t43, t48, t50.t49, t66.t2157, t45.t44, t65.t2155, t40.t...409
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
359 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.9783,93364,1,0,1158,77521,2203,55,43540,45071,2198
no accepting run found
Formula 0 is TRUE no accepting run found.
Treatment of property StigmergyElection-PT-10a-LTLFireability-04 finished in 324466 ms.
FORMULA StigmergyElection-PT-10a-LTLFireability-04 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-29 21:36:59] [INFO ] Flatten gal took : 118 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 1961724 ms.

BK_STOP 1717018619400

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-10a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-10a, 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 r400-tall-171690532200380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-10a.tgz
mv StigmergyElection-PT-10a execution
cd execution
if [ "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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;