Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690531700172.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is StigmergyCommit-PT-07a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531700172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 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 5.4M 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 StigmergyCommit-PT-07a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-07a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717232377167

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:59:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:59:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:59:38] [INFO ] Load time of PNML (sax parser for PT used): 435 ms
[2024-06-01 08:59:38] [INFO ] Transformed 292 places.
[2024-06-01 08:59:38] [INFO ] Transformed 7108 transitions.
[2024-06-01 08:59:38] [INFO ] Found NUPN structural information;
[2024-06-01 08:59:38] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 591 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyCommit-PT-07a-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 890/890 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 229 transition count 819
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 229 transition count 819
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 134 place count 229 transition count 811
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 167 place count 196 transition count 770
Iterating global reduction 1 with 33 rules applied. Total rules applied 200 place count 196 transition count 770
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 208 place count 196 transition count 762
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 216 place count 188 transition count 754
Iterating global reduction 2 with 8 rules applied. Total rules applied 224 place count 188 transition count 754
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 232 place count 180 transition count 746
Iterating global reduction 2 with 8 rules applied. Total rules applied 240 place count 180 transition count 746
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 248 place count 172 transition count 738
Iterating global reduction 2 with 8 rules applied. Total rules applied 256 place count 172 transition count 738
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 264 place count 164 transition count 730
Iterating global reduction 2 with 8 rules applied. Total rules applied 272 place count 164 transition count 730
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 280 place count 164 transition count 722
Applied a total of 280 rules in 88 ms. Remains 164 /292 variables (removed 128) and now considering 722/890 (removed 168) transitions.
[2024-06-01 08:59:39] [INFO ] Flow matrix only has 712 transitions (discarded 10 similar events)
// Phase 1: matrix 712 rows 164 cols
[2024-06-01 08:59:39] [INFO ] Computed 3 invariants in 24 ms
[2024-06-01 08:59:39] [INFO ] Implicit Places using invariants in 241 ms returned []
[2024-06-01 08:59:39] [INFO ] Flow matrix only has 712 transitions (discarded 10 similar events)
[2024-06-01 08:59:39] [INFO ] Invariant cache hit.
[2024-06-01 08:59:39] [INFO ] State equation strengthened by 581 read => feed constraints.
[2024-06-01 08:59:40] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned [163]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1489 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/292 places, 722/890 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 140 transition count 699
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 140 transition count 699
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 140 transition count 691
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 62 place count 132 transition count 683
Iterating global reduction 1 with 8 rules applied. Total rules applied 70 place count 132 transition count 683
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 78 place count 124 transition count 675
Iterating global reduction 1 with 8 rules applied. Total rules applied 86 place count 124 transition count 675
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 94 place count 116 transition count 667
Iterating global reduction 1 with 8 rules applied. Total rules applied 102 place count 116 transition count 667
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 110 place count 108 transition count 659
Iterating global reduction 1 with 8 rules applied. Total rules applied 118 place count 108 transition count 659
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 125 place count 101 transition count 652
Iterating global reduction 1 with 7 rules applied. Total rules applied 132 place count 101 transition count 652
Applied a total of 132 rules in 28 ms. Remains 101 /163 variables (removed 62) and now considering 652/722 (removed 70) transitions.
[2024-06-01 08:59:40] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
// Phase 1: matrix 642 rows 101 cols
[2024-06-01 08:59:40] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 08:59:40] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 08:59:40] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2024-06-01 08:59:40] [INFO ] Invariant cache hit.
[2024-06-01 08:59:41] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 08:59:41] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 101/292 places, 652/890 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1907 ms. Remains : 101/292 places, 652/890 transitions.
Support contains 9 out of 101 places after structural reductions.
[2024-06-01 08:59:41] [INFO ] Flatten gal took : 122 ms
[2024-06-01 08:59:41] [INFO ] Flatten gal took : 77 ms
[2024-06-01 08:59:41] [INFO ] Input system was already deterministic with 652 transitions.
Reduction of identical properties reduced properties to check from 5 to 3
RANDOM walk for 204 steps (0 resets) in 22 ms. (8 steps per ms) remains 0/3 properties
FORMULA StigmergyCommit-PT-07a-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 3 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(F((G(F(p1))&&p0))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 7 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-06-01 08:59:41] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-06-01 08:59:41] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 08:59:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 08:59:42] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 08:59:42] [INFO ] Invariant cache hit.
[2024-06-01 08:59:42] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 08:59:42] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-01 08:59:42] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 08:59:42] [INFO ] Invariant cache hit.
[2024-06-01 08:59:42] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 17 places in 184 ms of which 9 ms to minimize.
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 18 places in 177 ms of which 2 ms to minimize.
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-06-01 08:59:52] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 15 places in 119 ms of which 0 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:59:53] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 15 places in 136 ms of which 2 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 2 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:00:01] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:00:02] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:00:03] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:00:03] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:00:03] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:00:03] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:00:03] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-06-01 09:00:03] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:00:03] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:00:04] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:00:04] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:00:24] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 68029ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 68060ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68318 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 341 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-00
Product exploration explored 100000 steps with 1923 reset in 471 ms.
Product exploration explored 100000 steps with 1923 reset in 340 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 204 steps (0 resets) in 23 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 5 factoid took 148 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
[2024-06-01 09:00:52] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:00:52] [INFO ] Invariant cache hit.
[2024-06-01 09:00:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:00:52] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-06-01 09:00:52] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:00:52] [INFO ] [Real]Added 517 Read/Feed constraints in 44 ms returned sat
[2024-06-01 09:00:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:00:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:00:53] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-06-01 09:00:53] [INFO ] [Nat]Added 517 Read/Feed constraints in 56 ms returned sat
[2024-06-01 09:00:53] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 92 ms.
[2024-06-01 09:00:53] [INFO ] Added : 82 causal constraints over 17 iterations in 823 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 09:00:53] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:00:53] [INFO ] Invariant cache hit.
[2024-06-01 09:00:54] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:00:54] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-01 09:00:54] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:00:54] [INFO ] [Real]Added 517 Read/Feed constraints in 49 ms returned sat
[2024-06-01 09:00:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:00:54] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:00:54] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-06-01 09:00:54] [INFO ] [Nat]Added 517 Read/Feed constraints in 50 ms returned sat
[2024-06-01 09:00:54] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 50 ms.
[2024-06-01 09:00:55] [INFO ] Added : 82 causal constraints over 17 iterations in 746 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 4 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2024-06-01 09:00:55] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:00:55] [INFO ] Invariant cache hit.
[2024-06-01 09:00:55] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 09:00:55] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:00:55] [INFO ] Invariant cache hit.
[2024-06-01 09:00:55] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:00:55] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-01 09:00:55] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:00:55] [INFO ] Invariant cache hit.
[2024-06-01 09:00:55] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 1 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-06-01 09:01:05] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 0 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 0 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:01:06] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:01:07] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-06-01 09:01:07] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 1 ms to minimize.
[2024-06-01 09:01:07] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-06-01 09:01:07] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:01:07] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2024-06-01 09:01:07] [INFO ] Deduced a trap composed of 13 places in 217 ms of which 1 ms to minimize.
[2024-06-01 09:01:07] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 0 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:01:08] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:01:09] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:01:10] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:01:11] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-06-01 09:01:12] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:01:12] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-06-01 09:01:12] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:01:13] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:01:13] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:01:13] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:01:14] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:01:15] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:01:15] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:01:15] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:01:15] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:01:15] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-06-01 09:01:15] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:01:16] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:01:18] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:01:37] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30775 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 67393ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 67402ms
Finished structural reductions in LTL mode , in 1 iterations and 67632 ms. Remains : 100/100 places, 651/651 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Reduction of identical properties reduced properties to check from 2 to 1
RANDOM walk for 204 steps (0 resets) in 35 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
[2024-06-01 09:02:03] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:02:03] [INFO ] Invariant cache hit.
[2024-06-01 09:02:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:02:04] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-06-01 09:02:04] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:02:04] [INFO ] [Real]Added 517 Read/Feed constraints in 49 ms returned sat
[2024-06-01 09:02:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:02:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:02:04] [INFO ] [Nat]Absence check using state equation in 104 ms returned sat
[2024-06-01 09:02:04] [INFO ] [Nat]Added 517 Read/Feed constraints in 57 ms returned sat
[2024-06-01 09:02:04] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 66 ms.
[2024-06-01 09:02:05] [INFO ] Added : 82 causal constraints over 17 iterations in 771 ms. Result :sat
Could not prove EG (NOT p1)
[2024-06-01 09:02:05] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:02:05] [INFO ] Invariant cache hit.
[2024-06-01 09:02:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:02:05] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2024-06-01 09:02:05] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:02:05] [INFO ] [Real]Added 517 Read/Feed constraints in 48 ms returned sat
[2024-06-01 09:02:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:02:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:02:06] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-06-01 09:02:06] [INFO ] [Nat]Added 517 Read/Feed constraints in 54 ms returned sat
[2024-06-01 09:02:06] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 51 ms.
[2024-06-01 09:02:06] [INFO ] Added : 82 causal constraints over 17 iterations in 765 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 293 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1923 reset in 416 ms.
Product exploration explored 100000 steps with 1923 reset in 297 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 651
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 25 place count 100 transition count 659
Deduced a syphon composed of 33 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 100 transition count 659
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 49 place count 84 transition count 643
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 65 place count 84 transition count 643
Performed 33 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 98 place count 84 transition count 651
Ensure Unique test removed 271 transitions
Reduce isomorphic transitions removed 271 transitions.
Iterating post reduction 1 with 271 rules applied. Total rules applied 369 place count 84 transition count 380
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 387 place count 66 transition count 362
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 405 place count 66 transition count 362
Deduced a syphon composed of 32 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 2 with 16 rules applied. Total rules applied 421 place count 66 transition count 346
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 429 place count 66 transition count 346
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 445 place count 50 transition count 330
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 461 place count 50 transition count 330
Deduced a syphon composed of 24 places in 1 ms
Applied a total of 461 rules in 177 ms. Remains 50 /100 variables (removed 50) and now considering 330/651 (removed 321) transitions.
[2024-06-01 09:02:08] [INFO ] Redundant transitions in 25 ms returned []
Running 329 sub problems to find dead transitions.
[2024-06-01 09:02:08] [INFO ] Flow matrix only has 321 transitions (discarded 9 similar events)
// Phase 1: matrix 321 rows 50 cols
[2024-06-01 09:02:08] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 09:02:08] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 0 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:02:11] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:02:12] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:02:13] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:02:13] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:02:13] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:02:13] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:02:13] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 09:02:13] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:02:14] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:02:15] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:02:15] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:02:15] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 09:02:15] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:02:15] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 329 unsolved
[2024-06-01 09:02:16] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:02:16] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:02:16] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:02:16] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:02:17] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 5/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
At refinement iteration 9 (OVERLAPS) 320/370 variables, 50/112 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 270/382 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-06-01 09:02:20] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:02:20] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:02:20] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:02:20] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:02:20] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/370 variables, 5/387 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-06-01 09:02:23] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:02:23] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/370 variables, 2/389 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/370 variables, 0/389 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 1/371 variables, 1/390 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/371 variables, 0/390 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 16 (OVERLAPS) 0/371 variables, 0/390 constraints. Problems are: Problem set: 32 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 371/371 variables, and 390 constraints, problems are : Problem set: 32 solved, 297 unsolved in 28039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 32 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 1 (OVERLAPS) 25/50 variables, 1/1 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 68/69 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-06-01 09:02:38] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:02:38] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:02:38] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:02:39] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:02:39] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/74 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-06-01 09:02:39] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:02:39] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/76 constraints. Problems are: Problem set: 32 solved, 297 unsolved
[2024-06-01 09:02:40] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:02:40] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:02:40] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:02:40] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 4/80 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/80 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 320/370 variables, 50/130 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/370 variables, 270/400 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/370 variables, 297/697 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/370 variables, 0/697 constraints. Problems are: Problem set: 32 solved, 297 unsolved
At refinement iteration 11 (OVERLAPS) 1/371 variables, 1/698 constraints. Problems are: Problem set: 32 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 371/371 variables, and 698 constraints, problems are : Problem set: 32 solved, 297 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 297/329 constraints, Known Traps: 79/79 constraints]
After SMT, in 59570ms problems are : Problem set: 32 solved, 297 unsolved
Search for dead transitions found 32 dead transitions in 59574ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 50/100 places, 298/651 transitions.
Graph (complete) has 233 edges and 50 vertex of which 26 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 22 ms. Remains 26 /50 variables (removed 24) and now considering 298/298 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/100 places, 298/651 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 59807 ms. Remains : 26/100 places, 298/651 transitions.
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 651/651 (removed 0) transitions.
[2024-06-01 09:03:08] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-06-01 09:03:08] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 09:03:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 09:03:08] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:03:08] [INFO ] Invariant cache hit.
[2024-06-01 09:03:08] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:03:08] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-01 09:03:08] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:03:08] [INFO ] Invariant cache hit.
[2024-06-01 09:03:08] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:03:17] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 0 ms to minimize.
[2024-06-01 09:03:17] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 1 ms to minimize.
[2024-06-01 09:03:17] [INFO ] Deduced a trap composed of 13 places in 143 ms of which 1 ms to minimize.
[2024-06-01 09:03:18] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 0 ms to minimize.
[2024-06-01 09:03:18] [INFO ] Deduced a trap composed of 14 places in 157 ms of which 1 ms to minimize.
[2024-06-01 09:03:18] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:03:18] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-06-01 09:03:18] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-06-01 09:03:18] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-06-01 09:03:18] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 2 ms to minimize.
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2024-06-01 09:03:19] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:03:20] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:03:21] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:03:21] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-06-01 09:03:21] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:03:21] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:03:21] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:03:21] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:03:21] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:03:21] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:03:21] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:03:23] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:03:24] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:03:24] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:03:24] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:03:24] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:03:24] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:03:24] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:03:24] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:03:26] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 0 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:03:27] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:03:28] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:03:28] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:03:28] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:03:28] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:03:28] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:03:28] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:03:28] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:03:29] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:03:29] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:03:29] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:03:30] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-06-01 09:03:30] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:03:30] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:03:30] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:03:49] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30756 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 67223ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 67231ms
Finished structural reductions in LTL mode , in 1 iterations and 67447 ms. Remains : 100/100 places, 651/651 transitions.
Treatment of property StigmergyCommit-PT-07a-LTLFireability-00 finished in 273820 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 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 95 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-06-01 09:04:15] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 09:04:15] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 09:04:15] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 09:04:15] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:04:15] [INFO ] Invariant cache hit.
[2024-06-01 09:04:15] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:04:15] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-06-01 09:04:16] [INFO ] Redundant transitions in 9 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:04:16] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:04:16] [INFO ] Invariant cache hit.
[2024-06-01 09:04:16] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:04:19] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:04:20] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:04:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:04:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:04:20] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:04:20] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:04:20] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:04:20] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:04:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:04:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:04:21] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:04:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17911 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49501ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49505ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49744 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-01 finished in 49815 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(X((G(F(X(G(p1))))&&X(p1)&&F(p1)&&p0))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 9 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-06-01 09:05:05] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-06-01 09:05:05] [INFO ] Computed 1 invariants in 7 ms
[2024-06-01 09:05:05] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 09:05:05] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:05:05] [INFO ] Invariant cache hit.
[2024-06-01 09:05:05] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:05:05] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-01 09:05:05] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:05:05] [INFO ] Invariant cache hit.
[2024-06-01 09:05:05] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:05:15] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 0 ms to minimize.
[2024-06-01 09:05:15] [INFO ] Deduced a trap composed of 18 places in 144 ms of which 0 ms to minimize.
[2024-06-01 09:05:15] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2024-06-01 09:05:16] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2024-06-01 09:05:16] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-06-01 09:05:16] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-06-01 09:05:16] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:05:16] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:05:16] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 1 ms to minimize.
[2024-06-01 09:05:16] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2024-06-01 09:05:16] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-06-01 09:05:17] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 1 ms to minimize.
[2024-06-01 09:05:17] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 1 ms to minimize.
[2024-06-01 09:05:17] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-06-01 09:05:17] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:05:17] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-06-01 09:05:17] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:05:17] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 0 ms to minimize.
[2024-06-01 09:05:17] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:05:18] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:05:19] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:05:19] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:05:19] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:05:19] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:05:19] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:05:19] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:05:19] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:05:19] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:05:21] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:05:22] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:05:22] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 1 ms to minimize.
[2024-06-01 09:05:22] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:05:22] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:05:22] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:05:24] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:05:25] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:05:26] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:05:26] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:05:26] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:05:26] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:05:26] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:05:26] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:05:26] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:05:27] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:05:28] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:05:28] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:05:28] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:05:28] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:05:47] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30769 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 67503ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 67511ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67740 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 151 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-03 finished in 67912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 5 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-06-01 09:06:13] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:06:13] [INFO ] Invariant cache hit.
[2024-06-01 09:06:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 09:06:13] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:06:13] [INFO ] Invariant cache hit.
[2024-06-01 09:06:13] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:06:13] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-01 09:06:13] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:06:13] [INFO ] Invariant cache hit.
[2024-06-01 09:06:13] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:06:22] [INFO ] Deduced a trap composed of 17 places in 153 ms of which 0 ms to minimize.
[2024-06-01 09:06:22] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 1 ms to minimize.
[2024-06-01 09:06:22] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 1 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 1 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 0 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 0 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:06:23] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 0 ms to minimize.
[2024-06-01 09:06:24] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-06-01 09:06:24] [INFO ] Deduced a trap composed of 14 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:06:24] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:06:24] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 0 ms to minimize.
[2024-06-01 09:06:24] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:06:24] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:06:24] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:06:25] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:06:26] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:06:28] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2024-06-01 09:06:28] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:06:28] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:06:28] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:06:28] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:06:28] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:06:28] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:06:28] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:06:28] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:06:29] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:06:31] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:06:31] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:06:31] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:06:31] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:06:31] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:06:31] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:06:31] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:06:32] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:06:33] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:06:33] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:06:33] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:06:33] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:06:33] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:06:33] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:06:33] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:06:34] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:06:34] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:06:34] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:06:34] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:06:34] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:06:36] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:06:36] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:06:36] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:06:36] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:06:54] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30863 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66993ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 67001ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67236 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 3 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-04 finished in 67444 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||X(p0)))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 5 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-06-01 09:07:20] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:07:20] [INFO ] Invariant cache hit.
[2024-06-01 09:07:20] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 09:07:20] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:07:20] [INFO ] Invariant cache hit.
[2024-06-01 09:07:21] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:07:21] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-01 09:07:21] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:07:21] [INFO ] Invariant cache hit.
[2024-06-01 09:07:21] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:07:30] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 0 ms to minimize.
[2024-06-01 09:07:30] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2024-06-01 09:07:30] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-06-01 09:07:30] [INFO ] Deduced a trap composed of 14 places in 153 ms of which 1 ms to minimize.
[2024-06-01 09:07:30] [INFO ] Deduced a trap composed of 14 places in 149 ms of which 1 ms to minimize.
[2024-06-01 09:07:30] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 0 ms to minimize.
[2024-06-01 09:07:30] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:07:31] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:07:31] [INFO ] Deduced a trap composed of 15 places in 140 ms of which 1 ms to minimize.
[2024-06-01 09:07:31] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:07:31] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 0 ms to minimize.
[2024-06-01 09:07:31] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 0 ms to minimize.
[2024-06-01 09:07:31] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 1 ms to minimize.
[2024-06-01 09:07:31] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-06-01 09:07:31] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:07:32] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-06-01 09:07:32] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-06-01 09:07:32] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 0 ms to minimize.
[2024-06-01 09:07:32] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2024-06-01 09:07:32] [INFO ] Deduced a trap composed of 14 places in 119 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:07:32] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-06-01 09:07:32] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:07:33] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:07:34] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:07:34] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:07:34] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:07:34] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:07:35] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-06-01 09:07:35] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:07:35] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 2 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:07:36] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:07:37] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-06-01 09:07:37] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:07:37] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:07:38] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:07:38] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:07:39] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:07:40] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:07:40] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:07:40] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:07:40] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:07:40] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:07:40] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:07:41] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:07:41] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:07:41] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:07:41] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:07:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:07:41] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:07:41] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:07:41] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:07:43] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:07:43] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:07:43] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:07:43] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:08:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30746 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66976ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66983ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67193 ms. Remains : 100/101 places, 651/652 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 146 ms :[true, false, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-05
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-05 TRUE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-05 finished in 67357 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 4 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-06-01 09:08:28] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:08:28] [INFO ] Invariant cache hit.
[2024-06-01 09:08:28] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 09:08:28] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:08:28] [INFO ] Invariant cache hit.
[2024-06-01 09:08:28] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:08:28] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-01 09:08:28] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:08:28] [INFO ] Invariant cache hit.
[2024-06-01 09:08:28] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:08:37] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 1 ms to minimize.
[2024-06-01 09:08:37] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 1 ms to minimize.
[2024-06-01 09:08:37] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 0 ms to minimize.
[2024-06-01 09:08:38] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 0 ms to minimize.
[2024-06-01 09:08:38] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2024-06-01 09:08:38] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 1 ms to minimize.
[2024-06-01 09:08:38] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 1 ms to minimize.
[2024-06-01 09:08:38] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 0 ms to minimize.
[2024-06-01 09:08:38] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2024-06-01 09:08:38] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-06-01 09:08:39] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-06-01 09:08:39] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2024-06-01 09:08:39] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
[2024-06-01 09:08:39] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-06-01 09:08:39] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:08:39] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:08:39] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-06-01 09:08:39] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-06-01 09:08:39] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 0 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:08:40] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:08:41] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:08:43] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:08:44] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:08:44] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-06-01 09:08:44] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:08:44] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:08:44] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:08:44] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:08:44] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:08:46] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:08:46] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:08:46] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2024-06-01 09:08:46] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:08:46] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:08:46] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:08:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:08:46] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:08:47] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:08:48] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:08:48] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:08:48] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:08:48] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:08:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:08:48] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:08:49] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:08:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:08:49] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:08:49] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:08:49] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:08:51] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 0 ms to minimize.
[2024-06-01 09:08:51] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:08:51] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:08:51] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:09:09] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30588 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66767ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66774ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67034 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-06
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-06 finished in 67240 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 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 5 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-06-01 09:09:35] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:09:35] [INFO ] Invariant cache hit.
[2024-06-01 09:09:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 09:09:35] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:09:35] [INFO ] Invariant cache hit.
[2024-06-01 09:09:35] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:09:35] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-01 09:09:35] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:09:35] [INFO ] Invariant cache hit.
[2024-06-01 09:09:35] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:09:44] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:09:44] [INFO ] Deduced a trap composed of 18 places in 147 ms of which 1 ms to minimize.
[2024-06-01 09:09:44] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-06-01 09:09:45] [INFO ] Deduced a trap composed of 14 places in 307 ms of which 1 ms to minimize.
[2024-06-01 09:09:45] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 0 ms to minimize.
[2024-06-01 09:09:45] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-06-01 09:09:45] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-06-01 09:09:45] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:09:45] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 0 ms to minimize.
[2024-06-01 09:09:45] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-06-01 09:09:46] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-06-01 09:09:46] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-06-01 09:09:46] [INFO ] Deduced a trap composed of 14 places in 101 ms of which 1 ms to minimize.
[2024-06-01 09:09:46] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:09:46] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:09:46] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:09:46] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 1 ms to minimize.
[2024-06-01 09:09:46] [INFO ] Deduced a trap composed of 15 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:09:46] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:09:47] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:09:48] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:09:48] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:09:48] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:09:48] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:09:48] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:09:48] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:09:48] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:09:48] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:09:48] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:09:51] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 0 ms to minimize.
[2024-06-01 09:09:51] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:09:51] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:09:51] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:09:51] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:09:51] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 16 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:09:53] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:09:54] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:09:55] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:09:56] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:09:56] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:09:57] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:09:57] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:09:57] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:09:57] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 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/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:10:16] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30667 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 66637ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 66645ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66861 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-08
Product exploration explored 100000 steps with 1923 reset in 355 ms.
Product exploration explored 100000 steps with 1923 reset in 315 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(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 72 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 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 204 steps (0 resets) in 9 ms. (20 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 128 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
[2024-06-01 09:10:43] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:10:43] [INFO ] Invariant cache hit.
[2024-06-01 09:10:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:10:43] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2024-06-01 09:10:43] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:10:44] [INFO ] [Real]Added 517 Read/Feed constraints in 45 ms returned sat
[2024-06-01 09:10:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:10:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:10:44] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-06-01 09:10:44] [INFO ] [Nat]Added 517 Read/Feed constraints in 53 ms returned sat
[2024-06-01 09:10:44] [INFO ] Computed and/alt/rep : 106/130/106 causal constraints (skipped 535 transitions) in 48 ms.
[2024-06-01 09:10:45] [INFO ] Added : 82 causal constraints over 17 iterations in 733 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 651/651 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 99 transition count 625
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 74 transition count 625
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 74 transition count 617
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 116 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 371 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 385 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 392 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 400 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 416 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 25 transition count 297
Applied a total of 417 rules in 78 ms. Remains 25 /100 variables (removed 75) and now considering 297/651 (removed 354) transitions.
[2024-06-01 09:10:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 09:10:45] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 09:10:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 09:10:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:10:45] [INFO ] Invariant cache hit.
[2024-06-01 09:10:45] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:10:45] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-06-01 09:10:45] [INFO ] Redundant transitions in 8 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:10:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:10:45] [INFO ] Invariant cache hit.
[2024-06-01 09:10:45] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:10:47] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:10:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:10:49] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:10:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:10:50] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17166 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48636ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48639ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/100 places, 297/651 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 48848 ms. Remains : 25/100 places, 297/651 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 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 94 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 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 122 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 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
[2024-06-01 09:11:34] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:11:34] [INFO ] Invariant cache hit.
[2024-06-01 09:11:34] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:11:34] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2024-06-01 09:11:34] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:11:34] [INFO ] [Real]Added 271 Read/Feed constraints in 32 ms returned sat
[2024-06-01 09:11:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:11:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:11:34] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-01 09:11:34] [INFO ] [Nat]Added 271 Read/Feed constraints in 40 ms returned sat
[2024-06-01 09:11:34] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 25 ms.
[2024-06-01 09:11:34] [INFO ] Added : 0 causal constraints over 0 iterations in 56 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 677 ms.
Product exploration explored 100000 steps with 11111 reset in 689 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 15 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 09:11:36] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:11:36] [INFO ] Invariant cache hit.
[2024-06-01 09:11:36] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 09:11:36] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:11:36] [INFO ] Invariant cache hit.
[2024-06-01 09:11:36] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:11:36] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-06-01 09:11:36] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:11:36] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:11:36] [INFO ] Invariant cache hit.
[2024-06-01 09:11:36] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:11:38] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:11:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:11:40] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:11:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:11:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:11:41] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:11:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48935ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48938ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49085 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyCommit-PT-07a-LTLFireability-08 finished in 170064 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 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 92 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-06-01 09:12:25] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:12:25] [INFO ] Invariant cache hit.
[2024-06-01 09:12:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 09:12:25] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:12:25] [INFO ] Invariant cache hit.
[2024-06-01 09:12:25] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:12:25] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-06-01 09:12:25] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:12:25] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:12:25] [INFO ] Invariant cache hit.
[2024-06-01 09:12:25] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:12:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:12:27] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:12:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:12:27] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:12:27] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:12:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:12:30] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:12:30] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:12:30] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:12:30] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:12:30] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:12:30] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48876ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48899ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49129 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-09
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-09 finished in 49192 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 G(p0)))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 76 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-06-01 09:13:14] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:13:14] [INFO ] Invariant cache hit.
[2024-06-01 09:13:14] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 09:13:14] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:13:14] [INFO ] Invariant cache hit.
[2024-06-01 09:13:14] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:13:14] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-06-01 09:13:14] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:13:15] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:13:15] [INFO ] Invariant cache hit.
[2024-06-01 09:13:15] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:13:18] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:13:19] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:13:20] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:13:20] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17412 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48958ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48961ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49166 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), true, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-10
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-10 finished in 49307 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(p1))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 87 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-06-01 09:14:04] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:14:04] [INFO ] Invariant cache hit.
[2024-06-01 09:14:04] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 09:14:04] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:14:04] [INFO ] Invariant cache hit.
[2024-06-01 09:14:04] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:14:04] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2024-06-01 09:14:04] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:14:04] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:14:04] [INFO ] Invariant cache hit.
[2024-06-01 09:14:04] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 4 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:14:08] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:14:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:14:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17548 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48957ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48960ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49181 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-11
Product exploration explored 100000 steps with 11111 reset in 666 ms.
Product exploration explored 100000 steps with 11111 reset in 673 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 (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 107 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 32 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X p0))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 7 factoid took 113 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 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p1), (NOT p1)]
[2024-06-01 09:14:55] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:14:55] [INFO ] Invariant cache hit.
[2024-06-01 09:14:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:14:55] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 09:14:55] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:14:55] [INFO ] [Real]Added 271 Read/Feed constraints in 29 ms returned sat
[2024-06-01 09:14:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:14:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:14:55] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-06-01 09:14:55] [INFO ] [Nat]Added 271 Read/Feed constraints in 32 ms returned sat
[2024-06-01 09:14:55] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 22 ms.
[2024-06-01 09:14:55] [INFO ] Added : 0 causal constraints over 0 iterations in 48 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 14 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 09:14:55] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:14:55] [INFO ] Invariant cache hit.
[2024-06-01 09:14:55] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 09:14:55] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:14:55] [INFO ] Invariant cache hit.
[2024-06-01 09:14:55] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:14:55] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-06-01 09:14:55] [INFO ] Redundant transitions in 6 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:14:55] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:14:55] [INFO ] Invariant cache hit.
[2024-06-01 09:14:55] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:14:57] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:14:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:14:58] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:14:59] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:15:00] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:15:00] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:15:00] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:15:00] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:15:00] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:15:00] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:15:01] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:15:01] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17753 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49355ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49359ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49510 ms. Remains : 25/25 places, 297/297 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 p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 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 58 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 75 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 56 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
[2024-06-01 09:15:45] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:15:45] [INFO ] Invariant cache hit.
[2024-06-01 09:15:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:15:45] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2024-06-01 09:15:45] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:15:45] [INFO ] [Real]Added 271 Read/Feed constraints in 41 ms returned sat
[2024-06-01 09:15:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:15:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:15:45] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-01 09:15:45] [INFO ] [Nat]Added 271 Read/Feed constraints in 32 ms returned sat
[2024-06-01 09:15:46] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 23 ms.
[2024-06-01 09:15:46] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 11111 reset in 647 ms.
Product exploration explored 100000 steps with 11111 reset in 652 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 24 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 09:15:47] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:15:47] [INFO ] Invariant cache hit.
[2024-06-01 09:15:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 09:15:47] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:15:47] [INFO ] Invariant cache hit.
[2024-06-01 09:15:47] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:15:47] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2024-06-01 09:15:47] [INFO ] Redundant transitions in 6 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:15:47] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:15:47] [INFO ] Invariant cache hit.
[2024-06-01 09:15:47] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:15:49] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:15:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:15:49] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:15:49] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:15:49] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:15:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:15:51] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:15:52] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:15:53] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17732 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49407ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49411ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49566 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyCommit-PT-07a-LTLFireability-11 finished in 152951 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)||G(p1))))'
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Applied a total of 0 rules in 3 ms. Remains 101 /101 variables (removed 0) and now considering 652/652 (removed 0) transitions.
[2024-06-01 09:16:37] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
// Phase 1: matrix 642 rows 101 cols
[2024-06-01 09:16:37] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 09:16:37] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 09:16:37] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2024-06-01 09:16:37] [INFO ] Invariant cache hit.
[2024-06-01 09:16:37] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:16:37] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 651 sub problems to find dead transitions.
[2024-06-01 09:16:37] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2024-06-01 09:16:37] [INFO ] Invariant cache hit.
[2024-06-01 09:16:37] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-01 09:16:45] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:16:45] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 1 ms to minimize.
[2024-06-01 09:16:46] [INFO ] Deduced a trap composed of 13 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:16:46] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2024-06-01 09:16:46] [INFO ] Deduced a trap composed of 18 places in 148 ms of which 1 ms to minimize.
[2024-06-01 09:16:46] [INFO ] Deduced a trap composed of 14 places in 150 ms of which 1 ms to minimize.
[2024-06-01 09:16:46] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-06-01 09:16:47] [INFO ] Deduced a trap composed of 13 places in 307 ms of which 0 ms to minimize.
[2024-06-01 09:16:47] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:16:47] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-06-01 09:16:47] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-06-01 09:16:47] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:16:47] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-06-01 09:16:47] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-06-01 09:16:47] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:16:47] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-06-01 09:16:48] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 1 ms to minimize.
[2024-06-01 09:16:48] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:16:48] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2024-06-01 09:16:48] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-01 09:16:48] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-06-01 09:16:48] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:16:48] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:16:48] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:16:48] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 0 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 1 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:16:49] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:16:50] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:16:50] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-06-01 09:16:50] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 1 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:16:52] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:16:53] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:16:53] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:16:53] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:16:53] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:16:54] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:16:54] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:16:54] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:16:54] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-01 09:16:55] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:16:55] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:16:55] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:16:55] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 0 ms to minimize.
[2024-06-01 09:16:55] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:16:55] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:16:55] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:16:55] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:16:56] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-06-01 09:16:56] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:16:56] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:16:56] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:16:57] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 13/74 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-01 09:16:58] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:16:58] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:16:58] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:16:58] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:16:58] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:16:58] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:16:59] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:16:59] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:16:59] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:16:59] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-01 09:17:02] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:17:03] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:17:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:17:06] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:17:06] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:17:06] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:17:06] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:17:06] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:17:06] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 18/104 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 10 (OVERLAPS) 641/742 variables, 101/205 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/742 variables, 516/721 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 742/743 variables, and 721 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 651 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-06-01 09:17:16] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:17:16] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 5 (OVERLAPS) 641/742 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/742 variables, 516/723 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/742 variables, 651/1374 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 742/743 variables, and 1374 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 101/101 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 104/104 constraints]
After SMT, in 65897ms problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 65904ms
Finished structural reductions in LTL mode , in 1 iterations and 66134 ms. Remains : 101/101 places, 652/652 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-12
Product exploration explored 100000 steps with 1923 reset in 324 ms.
Product exploration explored 100000 steps with 1923 reset in 334 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (15 resets) in 1068 ms. (37 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (10 resets) in 176 ms. (226 steps per ms) remains 1/1 properties
[2024-06-01 09:17:44] [INFO ] Flow matrix only has 642 transitions (discarded 10 similar events)
[2024-06-01 09:17:44] [INFO ] Invariant cache hit.
[2024-06-01 09:17:44] [INFO ] State equation strengthened by 517 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 9/743 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 0/2 constraints, State Equation: 0/101 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 259 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Support contains 9 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Performed 24 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 114 place count 43 transition count 586
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 2 with 256 rules applied. Total rules applied 370 place count 43 transition count 330
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 36 transition count 323
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 36 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 399 place count 36 transition count 308
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 415 place count 28 transition count 300
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 416 place count 28 transition count 300
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 417 place count 27 transition count 299
Applied a total of 417 rules in 93 ms. Remains 27 /101 variables (removed 74) and now considering 299/652 (removed 353) transitions.
[2024-06-01 09:17:45] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
// Phase 1: matrix 289 rows 27 cols
[2024-06-01 09:17:45] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 09:17:45] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-06-01 09:17:45] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
[2024-06-01 09:17:45] [INFO ] Invariant cache hit.
[2024-06-01 09:17:45] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:17:45] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-06-01 09:17:45] [INFO ] Redundant transitions in 3 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-01 09:17:45] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
[2024-06-01 09:17:45] [INFO ] Invariant cache hit.
[2024-06-01 09:17:45] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:17:47] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:17:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:17:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:17:47] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:17:48] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:17:49] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:17:49] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:17:49] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:17:49] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 288/315 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 270/330 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/316 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/316 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 331 constraints, problems are : Problem set: 0 solved, 291 unsolved in 14569 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:18:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:18:03] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:18:04] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 288/315 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 270/359 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 291/650 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 1/316 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 651 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 60/60 constraints]
After SMT, in 46112ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 46115ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/101 places, 299/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 46362 ms. Remains : 27/101 places, 299/652 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 100 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
RANDOM walk for 6382 steps (45 resets) in 163 ms. (38 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1))), (F p0), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 220 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 208 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 213 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Product exploration explored 100000 steps with 11111 reset in 691 ms.
Product exploration explored 100000 steps with 11111 reset in 714 ms.
Support contains 9 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 299/299 transitions.
Applied a total of 0 rules in 14 ms. Remains 27 /27 variables (removed 0) and now considering 299/299 (removed 0) transitions.
[2024-06-01 09:18:34] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
[2024-06-01 09:18:34] [INFO ] Invariant cache hit.
[2024-06-01 09:18:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 09:18:34] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
[2024-06-01 09:18:34] [INFO ] Invariant cache hit.
[2024-06-01 09:18:34] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:18:34] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-01 09:18:34] [INFO ] Redundant transitions in 3 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-01 09:18:34] [INFO ] Flow matrix only has 289 transitions (discarded 10 similar events)
[2024-06-01 09:18:34] [INFO ] Invariant cache hit.
[2024-06-01 09:18:34] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:18:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:18:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 09:18:38] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 288/315 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/315 variables, 270/330 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (OVERLAPS) 1/316 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 0/316 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 331 constraints, problems are : Problem set: 0 solved, 291 unsolved in 14345 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 8/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 31/33 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:18:51] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:18:52] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:18:53] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 288/315 variables, 27/89 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/315 variables, 270/359 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 291/650 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 1/316 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/316 variables, and 651 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 60/60 constraints]
After SMT, in 46096ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 46098ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46253 ms. Remains : 27/27 places, 299/299 transitions.
Treatment of property StigmergyCommit-PT-07a-LTLFireability-12 finished in 163749 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 402 place count 34 transition count 306
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 418 place count 26 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 419 place count 25 transition count 297
Applied a total of 419 rules in 67 ms. Remains 25 /101 variables (removed 76) and now considering 297/652 (removed 355) transitions.
[2024-06-01 09:19:20] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 09:19:20] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 09:19:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 09:19:20] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:19:20] [INFO ] Invariant cache hit.
[2024-06-01 09:19:20] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:19:21] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-06-01 09:19:21] [INFO ] Redundant transitions in 3 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:19:21] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:19:21] [INFO ] Invariant cache hit.
[2024-06-01 09:19:21] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:19:23] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:19:24] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:19:25] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:19:25] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:19:25] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:19:25] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:19:25] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:19:25] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:19:26] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:19:26] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17400 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 48908ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 48911ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/101 places, 297/652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49111 ms. Remains : 25/101 places, 297/652 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-14
Product exploration explored 100000 steps with 11111 reset in 675 ms.
Product exploration explored 100000 steps with 11111 reset in 667 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 153 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 25 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 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 87 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
[2024-06-01 09:20:11] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:20:11] [INFO ] Invariant cache hit.
[2024-06-01 09:20:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:20:11] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2024-06-01 09:20:11] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:20:11] [INFO ] [Real]Added 271 Read/Feed constraints in 28 ms returned sat
[2024-06-01 09:20:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:20:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:20:12] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2024-06-01 09:20:12] [INFO ] [Nat]Added 271 Read/Feed constraints in 30 ms returned sat
[2024-06-01 09:20:12] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 21 ms.
[2024-06-01 09:20:12] [INFO ] Added : 0 causal constraints over 0 iterations in 44 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 14 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 09:20:12] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:20:12] [INFO ] Invariant cache hit.
[2024-06-01 09:20:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 09:20:12] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:20:12] [INFO ] Invariant cache hit.
[2024-06-01 09:20:12] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:20:12] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-06-01 09:20:12] [INFO ] Redundant transitions in 3 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:20:12] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:20:12] [INFO ] Invariant cache hit.
[2024-06-01 09:20:12] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 87 ms of which 0 ms to minimize.
[2024-06-01 09:20:15] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:20:16] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:20:17] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:20:18] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:20:19] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 18206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 50352ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 50355ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50588 ms. Remains : 25/25 places, 297/297 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
RANDOM walk for 32 steps (0 resets) in 4 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 83 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2024-06-01 09:21:03] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:21:03] [INFO ] Invariant cache hit.
[2024-06-01 09:21:03] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:21:03] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2024-06-01 09:21:03] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:21:03] [INFO ] [Real]Added 271 Read/Feed constraints in 27 ms returned sat
[2024-06-01 09:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:21:03] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:21:03] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-06-01 09:21:03] [INFO ] [Nat]Added 271 Read/Feed constraints in 30 ms returned sat
[2024-06-01 09:21:03] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 19 ms.
[2024-06-01 09:21:03] [INFO ] Added : 0 causal constraints over 0 iterations in 44 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 659 ms.
Product exploration explored 100000 steps with 11111 reset in 675 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 17 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 09:21:04] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:21:04] [INFO ] Invariant cache hit.
[2024-06-01 09:21:04] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 09:21:04] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:21:04] [INFO ] Invariant cache hit.
[2024-06-01 09:21:05] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:21:05] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-06-01 09:21:05] [INFO ] Redundant transitions in 5 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:21:05] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:21:05] [INFO ] Invariant cache hit.
[2024-06-01 09:21:05] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:21:07] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 2 ms to minimize.
[2024-06-01 09:21:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 09:21:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:21:07] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:21:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:21:07] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:21:07] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:21:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:21:07] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:21:08] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:21:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:21:10] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 09:21:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:21:10] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:21:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17391 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49384ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49388ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49538 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyCommit-PT-07a-LTLFireability-14 finished in 153707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(!p0)) U p0)))))'
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 651
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 651
Applied a total of 2 rules in 6 ms. Remains 100 /101 variables (removed 1) and now considering 651/652 (removed 1) transitions.
[2024-06-01 09:21:54] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-06-01 09:21:54] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 09:21:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 09:21:54] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:21:54] [INFO ] Invariant cache hit.
[2024-06-01 09:21:54] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-06-01 09:21:54] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-06-01 09:21:54] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-06-01 09:21:54] [INFO ] Invariant cache hit.
[2024-06-01 09:21:54] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 18 places in 145 ms of which 0 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 0 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 1 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-06-01 09:22:05] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 0 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:22:06] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 0 ms to minimize.
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 1 ms to minimize.
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:22:07] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:22:08] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-06-01 09:22:09] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:22:10] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-06-01 09:22:10] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:22:10] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:22:10] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:22:10] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:22:10] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:22:11] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:22:12] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:22:13] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:22:13] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:22:13] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2024-06-01 09:22:13] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:22:13] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-06-01 09:22:14] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:22:15] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:22:15] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:22:15] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:22:15] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:22:15] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:22:15] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:22:16] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:22:16] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:22:16] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:22:16] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:22:16] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:22:16] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:22:16] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:22:18] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-06-01 09:22:18] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:22:18] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-06-01 09:22:18] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-06-01 09:22:37] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30808 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 68415ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 68421ms
Starting structural reductions in LTL mode, iteration 1 : 100/101 places, 651/652 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68657 ms. Remains : 100/101 places, 651/652 transitions.
Stuttering acceptance computed with spot in 340 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), p0, p0]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-15
Stuttering criterion allowed to conclude after 51 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLFireability-15 finished in 69023 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((G(F(p1))&&p0))))'
Found a Shortening insensitive property : StigmergyCommit-PT-07a-LTLFireability-00
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 33 transition count 313
Applied a total of 395 rules in 74 ms. Remains 33 /101 variables (removed 68) and now considering 313/652 (removed 339) transitions.
[2024-06-01 09:23:03] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
// Phase 1: matrix 304 rows 33 cols
[2024-06-01 09:23:03] [INFO ] Computed 1 invariants in 4 ms
[2024-06-01 09:23:03] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 09:23:03] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-06-01 09:23:03] [INFO ] Invariant cache hit.
[2024-06-01 09:23:04] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:23:04] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-01 09:23:04] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-06-01 09:23:04] [INFO ] Invariant cache hit.
[2024-06-01 09:23:04] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:23:06] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 0 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 0 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 1 ms to minimize.
[2024-06-01 09:23:07] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:23:08] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 303/336 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 270/338 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:13] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:23:13] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (OVERLAPS) 0/337 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 341 constraints, problems are : Problem set: 0 solved, 305 unsolved in 14403 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:20] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:23:20] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:23:20] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:23:20] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:23:20] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:21] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:23:21] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:23:21] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:21] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-06-01 09:23:21] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:23:21] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:23:21] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:23:22] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:23:22] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:22] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:23:22] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:23:22] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:23:22] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:23:22] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:23] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-06-01 09:23:23] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 303/336 variables, 33/91 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 270/361 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 305/666 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 13 (OVERLAPS) 1/337 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 667 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 57/57 constraints]
After SMT, in 46108ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 46112ms
Starting structural reductions in LI_LTL mode, iteration 1 : 33/101 places, 313/652 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 46321 ms. Remains : 33/101 places, 313/652 transitions.
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-00
Stuttering criterion allowed to conclude after 1496 steps with 165 reset in 10 ms.
Treatment of property StigmergyCommit-PT-07a-LTLFireability-00 finished in 46652 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
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)))'
Found a Shortening insensitive property : StigmergyCommit-PT-07a-LTLFireability-08
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 8 out of 101 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 101/101 places, 652/652 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 100 transition count 626
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 75 transition count 626
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 50 place count 75 transition count 618
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 66 place count 67 transition count 618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 66 transition count 617
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 66 transition count 617
Performed 25 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 118 place count 41 transition count 583
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Iterating post reduction 2 with 255 rules applied. Total rules applied 373 place count 41 transition count 328
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 387 place count 34 transition count 321
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 394 place count 34 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 33 transition count 313
Applied a total of 395 rules in 36 ms. Remains 33 /101 variables (removed 68) and now considering 313/652 (removed 339) transitions.
[2024-06-01 09:23:50] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-06-01 09:23:50] [INFO ] Invariant cache hit.
[2024-06-01 09:23:50] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 09:23:50] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-06-01 09:23:50] [INFO ] Invariant cache hit.
[2024-06-01 09:23:50] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:23:50] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-06-01 09:23:50] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-06-01 09:23:50] [INFO ] Invariant cache hit.
[2024-06-01 09:23:50] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:52] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 09:23:52] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:23:52] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 09:23:53] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 0 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-01 09:23:54] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 14/35 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 303/336 variables, 33/68 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 270/338 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:23:59] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:23:59] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/337 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (OVERLAPS) 0/337 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 341 constraints, problems are : Problem set: 0 solved, 305 unsolved in 14406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 8/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 36/37 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:24:07] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:24:08] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 0 ms to minimize.
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-06-01 09:24:09] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:24:10] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/33 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (OVERLAPS) 303/336 variables, 33/91 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 270/361 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/336 variables, 305/666 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/336 variables, 0/666 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 13 (OVERLAPS) 1/337 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 337/337 variables, and 667 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 33/33 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 57/57 constraints]
After SMT, in 46191ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 46195ms
Starting structural reductions in LI_LTL mode, iteration 1 : 33/101 places, 313/652 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 46351 ms. Remains : 33/101 places, 313/652 transitions.
Running random walk in product with property : StigmergyCommit-PT-07a-LTLFireability-08
Product exploration explored 100000 steps with 11111 reset in 646 ms.
Product exploration explored 100000 steps with 11111 reset in 657 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 sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 85 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 87 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
[2024-06-01 09:24:38] [INFO ] Flow matrix only has 304 transitions (discarded 9 similar events)
[2024-06-01 09:24:38] [INFO ] Invariant cache hit.
[2024-06-01 09:24:38] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:24:38] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-06-01 09:24:38] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:24:38] [INFO ] [Real]Added 271 Read/Feed constraints in 25 ms returned sat
[2024-06-01 09:24:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:24:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:24:38] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2024-06-01 09:24:38] [INFO ] [Nat]Added 271 Read/Feed constraints in 29 ms returned sat
[2024-06-01 09:24:38] [INFO ] Computed and/alt/rep : 8/8/8 causal constraints (skipped 288 transitions) in 24 ms.
[2024-06-01 09:24:38] [INFO ] Added : 0 causal constraints over 0 iterations in 52 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 8 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 313/313 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 33 transition count 305
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 25 transition count 297
Applied a total of 24 rules in 35 ms. Remains 25 /33 variables (removed 8) and now considering 297/313 (removed 16) transitions.
[2024-06-01 09:24:39] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
// Phase 1: matrix 288 rows 25 cols
[2024-06-01 09:24:39] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 09:24:39] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 09:24:39] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:24:39] [INFO ] Invariant cache hit.
[2024-06-01 09:24:39] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:24:39] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-06-01 09:24:39] [INFO ] Redundant transitions in 3 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:24:39] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:24:39] [INFO ] Invariant cache hit.
[2024-06-01 09:24:39] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:24:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:24:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:24:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:24:41] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:24:41] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:24:41] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:24:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:24:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:24:41] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 09:24:42] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:24:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:24:44] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 09:24:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:24:44] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:24:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17866 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49679ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49682ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/33 places, 297/313 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 49927 ms. Remains : 25/33 places, 297/313 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 67 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 80 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 32 steps (0 resets) in 5 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 119 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 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2024-06-01 09:25:29] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:25:29] [INFO ] Invariant cache hit.
[2024-06-01 09:25:29] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 09:25:29] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-06-01 09:25:29] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:25:29] [INFO ] [Real]Added 271 Read/Feed constraints in 35 ms returned sat
[2024-06-01 09:25:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 09:25:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 09:25:29] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 09:25:29] [INFO ] [Nat]Added 271 Read/Feed constraints in 32 ms returned sat
[2024-06-01 09:25:29] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 280 transitions) in 23 ms.
[2024-06-01 09:25:29] [INFO ] Added : 0 causal constraints over 0 iterations in 50 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11111 reset in 652 ms.
Product exploration explored 100000 steps with 11111 reset in 654 ms.
Support contains 8 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 297/297 transitions.
Applied a total of 0 rules in 14 ms. Remains 25 /25 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-06-01 09:25:31] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:25:31] [INFO ] Invariant cache hit.
[2024-06-01 09:25:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 09:25:31] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:25:31] [INFO ] Invariant cache hit.
[2024-06-01 09:25:31] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-06-01 09:25:31] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2024-06-01 09:25:31] [INFO ] Redundant transitions in 4 ms returned []
Running 289 sub problems to find dead transitions.
[2024-06-01 09:25:31] [INFO ] Flow matrix only has 288 transitions (discarded 9 similar events)
[2024-06-01 09:25:31] [INFO ] Invariant cache hit.
[2024-06-01 09:25:31] [INFO ] State equation strengthened by 271 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:25:33] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:25:33] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 09:25:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:25:33] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:25:33] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2024-06-01 09:25:33] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 0 ms to minimize.
[2024-06-01 09:25:33] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2024-06-01 09:25:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 0 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 105 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 09:25:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:25:35] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-06-01 09:25:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:25:36] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 09:25:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:25:36] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 09:25:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-06-01 09:25:36] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 09:25:36] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/312 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 1/313 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (OVERLAPS) 0/313 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 345 constraints, problems are : Problem set: 0 solved, 289 unsolved in 17645 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 8/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 48/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 287/312 variables, 25/74 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 270/344 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 289/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/313 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 289 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 634 constraints, problems are : Problem set: 0 solved, 289 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 271/271 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 48/48 constraints]
After SMT, in 49363ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 49366ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49514 ms. Remains : 25/25 places, 297/297 transitions.
Treatment of property StigmergyCommit-PT-07a-LTLFireability-08 finished in 150631 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(p1))))'
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)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2024-06-01 09:26:21] [INFO ] Flatten gal took : 57 ms
[2024-06-01 09:26:21] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 09:26:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 101 places, 652 transitions and 8577 arcs took 13 ms.
Total runtime 1602845 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-07a-LTLFireability-00 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-07a-LTLFireability-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : StigmergyCommit-PT-07a-LTLFireability-11
Could not compute solution for formula : StigmergyCommit-PT-07a-LTLFireability-12
FORMULA StigmergyCommit-PT-07a-LTLFireability-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717234204325

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyCommit-PT-07a-LTLFireability-00
ltl formula formula --ltl=/tmp/7716/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 101 places, 652 transitions and 8577 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.040 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7716/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7716/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7716/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7716/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 103 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 102, there are 735 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~51 levels ~10000 states ~222936 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~20000 states ~500408 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~40000 states ~1152436 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~80000 states ~2662956 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~160000 states ~5612816 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~320000 states ~11868980 transitions
pnml2lts-mc( 1/ 4): ~50 levels ~640000 states ~21967184 transitions
pnml2lts-mc( 2/ 4): ~52 levels ~1280000 states ~49953148 transitions
pnml2lts-mc( 0/ 4): ~51 levels ~2560000 states ~114248964 transitions
pnml2lts-mc( 3/ 4): ~51 levels ~5120000 states ~238903024 transitions
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~58!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7193597
pnml2lts-mc( 0/ 4): unique states count: 7193707
pnml2lts-mc( 0/ 4): unique transitions count: 347032550
pnml2lts-mc( 0/ 4): - self-loop count: 7
pnml2lts-mc( 0/ 4): - claim dead count: 339834846
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7193765
pnml2lts-mc( 0/ 4): - cum. max stack depth: 211
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7193765 states 347035608 transitions, fanout: 48.241
pnml2lts-mc( 0/ 4): Total exploration time 73.480 sec (73.470 sec minimum, 73.473 sec on average)
pnml2lts-mc( 0/ 4): States per second: 97901, Transitions per second: 4722858
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 55.2MB, 8.0 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 664 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 55.2MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-07a-LTLFireability-08
ltl formula formula --ltl=/tmp/7716/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 101 places, 652 transitions and 8577 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.040 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7716/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7716/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7716/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7716/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 103 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 102, there are 669 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~51 levels ~10000 states ~193496 transitions
pnml2lts-mc( 2/ 4): ~52 levels ~20000 states ~426212 transitions
pnml2lts-mc( 2/ 4): ~52 levels ~40000 states ~894664 transitions
pnml2lts-mc( 2/ 4): ~52 levels ~80000 states ~2179372 transitions
pnml2lts-mc( 2/ 4): ~52 levels ~160000 states ~4726896 transitions
pnml2lts-mc( 2/ 4): ~52 levels ~320000 states ~9948952 transitions
pnml2lts-mc( 2/ 4): ~52 levels ~640000 states ~22050872 transitions
pnml2lts-mc( 2/ 4): ~52 levels ~1280000 states ~48849828 transitions
pnml2lts-mc( 3/ 4): ~52 levels ~2560000 states ~96843196 transitions
pnml2lts-mc( 1/ 4): ~51 levels ~5120000 states ~240484012 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7411888
pnml2lts-mc( 0/ 4): unique states count: 7411888
pnml2lts-mc( 0/ 4): unique transitions count: 358829451
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 351437774
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7412703
pnml2lts-mc( 0/ 4): - cum. max stack depth: 206
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7412703 states 358878626 transitions, fanout: 48.414
pnml2lts-mc( 0/ 4): Total exploration time 70.710 sec (70.710 sec minimum, 70.710 sec on average)
pnml2lts-mc( 0/ 4): States per second: 104832, Transitions per second: 5075359
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 56.8MB, 8.0 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 664 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 56.8MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-07a-LTLFireability-11
ltl formula formula --ltl=/tmp/7716/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 101 places, 652 transitions and 8577 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.040 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7716/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7716/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7716/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7716/ltl_2_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name StigmergyCommit-PT-07a-LTLFireability-12
ltl formula formula --ltl=/tmp/7716/ltl_3_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 101 places, 652 transitions and 8577 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7716/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7716/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7716/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7716/ltl_3_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
double free or corruption (fasttop)
ltl formula name StigmergyCommit-PT-07a-LTLFireability-14
ltl formula formula --ltl=/tmp/7716/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 101 places, 652 transitions and 8577 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.020 user 0.030 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/7716/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/7716/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/7716/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/7716/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 1 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 103 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 102, there are 668 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~52 levels ~10000 states ~187688 transitions
pnml2lts-mc( 3/ 4): ~51 levels ~20000 states ~500336 transitions
pnml2lts-mc( 3/ 4): ~51 levels ~40000 states ~1118832 transitions
pnml2lts-mc( 0/ 4): ~52 levels ~80000 states ~1901352 transitions
pnml2lts-mc( 0/ 4): ~52 levels ~160000 states ~4187588 transitions
pnml2lts-mc( 0/ 4): ~52 levels ~320000 states ~9824352 transitions
pnml2lts-mc( 0/ 4): ~52 levels ~640000 states ~21152604 transitions
pnml2lts-mc( 3/ 4): ~51 levels ~1280000 states ~55753016 transitions
pnml2lts-mc( 3/ 4): ~51 levels ~2560000 states ~115383300 transitions
pnml2lts-mc( 3/ 4): ~51 levels ~5120000 states ~244563500 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 7411888
pnml2lts-mc( 0/ 4): unique states count: 7411888
pnml2lts-mc( 0/ 4): unique transitions count: 358829458
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 351425017
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7412260
pnml2lts-mc( 0/ 4): - cum. max stack depth: 205
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7412260 states 358851099 transitions, fanout: 48.413
pnml2lts-mc( 0/ 4): Total exploration time 76.510 sec (76.510 sec minimum, 76.510 sec on average)
pnml2lts-mc( 0/ 4): States per second: 96880, Transitions per second: 4690251
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 56.8MB, 8.0 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 664 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 56.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-07a.tgz
mv StigmergyCommit-PT-07a 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 ;