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-171690531600123.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-04a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690531600123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 17:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 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 227K 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-04a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-04a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717229116108

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:05:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:05:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:05:17] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2024-06-01 08:05:17] [INFO ] Transformed 184 places.
[2024-06-01 08:05:17] [INFO ] Transformed 592 transitions.
[2024-06-01 08:05:17] [INFO ] Found NUPN structural information;
[2024-06-01 08:05:17] [INFO ] Parsed PT model containing 184 places and 592 transitions and 4011 arcs in 191 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 291 transitions
Reduce redundant transitions removed 291 transitions.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-04a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 301/301 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 154 transition count 268
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 154 transition count 268
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 63 place count 154 transition count 265
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 74 place count 143 transition count 251
Iterating global reduction 1 with 11 rules applied. Total rules applied 85 place count 143 transition count 251
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 86 place count 143 transition count 250
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 89 place count 140 transition count 247
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 140 transition count 247
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 139 transition count 246
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 139 transition count 246
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 138 transition count 245
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 138 transition count 245
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 97 place count 137 transition count 244
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 137 transition count 244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 137 transition count 243
Applied a total of 99 rules in 74 ms. Remains 137 /184 variables (removed 47) and now considering 243/301 (removed 58) transitions.
[2024-06-01 08:05:17] [INFO ] Flow matrix only has 234 transitions (discarded 9 similar events)
// Phase 1: matrix 234 rows 137 cols
[2024-06-01 08:05:17] [INFO ] Computed 3 invariants in 15 ms
[2024-06-01 08:05:17] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-06-01 08:05:17] [INFO ] Flow matrix only has 234 transitions (discarded 9 similar events)
[2024-06-01 08:05:17] [INFO ] Invariant cache hit.
[2024-06-01 08:05:18] [INFO ] State equation strengthened by 122 read => feed constraints.
[2024-06-01 08:05:18] [INFO ] Implicit Places using invariants and state equation in 366 ms returned [136]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 629 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/184 places, 243/301 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 128 transition count 235
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 128 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 128 transition count 233
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 125 transition count 230
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 125 transition count 230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 25 place count 124 transition count 229
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 124 transition count 229
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 27 place count 123 transition count 228
Iterating global reduction 1 with 1 rules applied. Total rules applied 28 place count 123 transition count 228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 122 transition count 227
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 122 transition count 227
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 121 transition count 226
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 121 transition count 226
Applied a total of 32 rules in 34 ms. Remains 121 /136 variables (removed 15) and now considering 226/243 (removed 17) transitions.
[2024-06-01 08:05:18] [INFO ] Flow matrix only has 217 transitions (discarded 9 similar events)
// Phase 1: matrix 217 rows 121 cols
[2024-06-01 08:05:18] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 08:05:18] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 08:05:18] [INFO ] Flow matrix only has 217 transitions (discarded 9 similar events)
[2024-06-01 08:05:18] [INFO ] Invariant cache hit.
[2024-06-01 08:05:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:05:18] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 121/184 places, 226/301 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 942 ms. Remains : 121/184 places, 226/301 transitions.
Support contains 30 out of 121 places after structural reductions.
[2024-06-01 08:05:18] [INFO ] Flatten gal took : 39 ms
[2024-06-01 08:05:18] [INFO ] Flatten gal took : 16 ms
[2024-06-01 08:05:18] [INFO ] Input system was already deterministic with 226 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (54 resets) in 1825 ms. (21 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40002 steps (9 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
[2024-06-01 08:05:19] [INFO ] Flow matrix only has 217 transitions (discarded 9 similar events)
[2024-06-01 08:05:19] [INFO ] Invariant cache hit.
[2024-06-01 08:05:19] [INFO ] State equation strengthened by 66 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/121 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/121 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 216/337 variables, 121/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/337 variables, 65/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/337 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/338 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/338 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/338 variables, and 189 constraints, problems are : Problem set: 0 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 121/121 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 89/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 6 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 17 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:05:19] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 93/338 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 1/2 constraints, State Equation: 0/121 constraints, ReadFeed: 0/66 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 634ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 10 simplifications.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 21 stabilizing places and 21 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 226/226 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 121 transition count 160
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 143 place count 55 transition count 149
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 148 place count 53 transition count 146
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 150 place count 52 transition count 145
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 150 place count 52 transition count 139
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 162 place count 46 transition count 139
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 166 place count 42 transition count 133
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 42 transition count 133
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 171 place count 42 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 171 place count 42 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 173 place count 41 transition count 131
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 175 place count 39 transition count 127
Iterating global reduction 5 with 2 rules applied. Total rules applied 177 place count 39 transition count 127
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 183 place count 39 transition count 121
Performed 20 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 6 with 40 rules applied. Total rules applied 223 place count 19 transition count 93
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 6 with 30 rules applied. Total rules applied 253 place count 19 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 7 with 36 rules applied. Total rules applied 289 place count 19 transition count 27
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 299 place count 14 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 301 place count 14 transition count 22
Applied a total of 301 rules in 37 ms. Remains 14 /121 variables (removed 107) and now considering 22/226 (removed 204) transitions.
[2024-06-01 08:05:20] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
// Phase 1: matrix 16 rows 14 cols
[2024-06-01 08:05:20] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:05:20] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:05:20] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
[2024-06-01 08:05:20] [INFO ] Invariant cache hit.
[2024-06-01 08:05:20] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 08:05:20] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 08:05:20] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 08:05:20] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
[2024-06-01 08:05:20] [INFO ] Invariant cache hit.
[2024-06-01 08:05:20] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 3 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:05:20] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 40 constraints, problems are : Problem set: 0 solved, 21 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 15/29 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 21/60 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 61 constraints, problems are : Problem set: 0 solved, 21 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 18/18 constraints]
After SMT, in 984ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 986ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/121 places, 22/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1077 ms. Remains : 14/121 places, 22/226 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 90 steps (20 resets) in 6 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 22/22 transitions.
Applied a total of 0 rules in 6 ms. Remains 14 /14 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-06-01 08:05:22] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
[2024-06-01 08:05:22] [INFO ] Invariant cache hit.
[2024-06-01 08:05:22] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 08:05:22] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
[2024-06-01 08:05:22] [INFO ] Invariant cache hit.
[2024-06-01 08:05:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 08:05:22] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-06-01 08:05:22] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 08:05:22] [INFO ] Flow matrix only has 16 transitions (discarded 6 similar events)
[2024-06-01 08:05:22] [INFO ] Invariant cache hit.
[2024-06-01 08:05:22] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2024-06-01 08:05:22] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 15/29 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 40 constraints, problems are : Problem set: 0 solved, 21 unsolved in 669 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 15/29 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 6/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 21/60 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/29 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 1/30 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/30 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 61 constraints, problems are : Problem set: 0 solved, 21 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 18/18 constraints]
After SMT, in 964ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 965ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1052 ms. Remains : 14/14 places, 22/22 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 108 steps (20 resets) in 5 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 71 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-01 finished in 3363 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((X(G(p1))||(p2 U p1))))))'
Support contains 6 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 226/226 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 104 transition count 208
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 104 transition count 208
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 104 transition count 203
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 48 place count 95 transition count 193
Iterating global reduction 1 with 9 rules applied. Total rules applied 57 place count 95 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 60 place count 95 transition count 190
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 89 transition count 184
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 89 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 89 transition count 183
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 77 place count 85 transition count 179
Iterating global reduction 3 with 4 rules applied. Total rules applied 81 place count 85 transition count 179
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 84 place count 82 transition count 176
Iterating global reduction 3 with 3 rules applied. Total rules applied 87 place count 82 transition count 176
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 89 place count 80 transition count 174
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 80 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 80 transition count 173
Applied a total of 92 rules in 12 ms. Remains 80 /121 variables (removed 41) and now considering 173/226 (removed 53) transitions.
[2024-06-01 08:05:23] [INFO ] Flow matrix only has 166 transitions (discarded 7 similar events)
// Phase 1: matrix 166 rows 80 cols
[2024-06-01 08:05:23] [INFO ] Computed 1 invariants in 4 ms
[2024-06-01 08:05:23] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 08:05:23] [INFO ] Flow matrix only has 166 transitions (discarded 7 similar events)
[2024-06-01 08:05:23] [INFO ] Invariant cache hit.
[2024-06-01 08:05:23] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:05:23] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-06-01 08:05:23] [INFO ] Flow matrix only has 166 transitions (discarded 7 similar events)
[2024-06-01 08:05:23] [INFO ] Invariant cache hit.
[2024-06-01 08:05:23] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 0 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:05:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 8 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 22 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:05:25] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:05:26] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 165/245 variables, 80/123 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 65/188 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-01 08:05:29] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/245 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 1/246 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/246 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 12 (OVERLAPS) 0/246 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 190 constraints, problems are : Problem set: 0 solved, 172 unsolved in 11313 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 43/44 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 165/245 variables, 80/124 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 65/189 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 172/361 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 1/246 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 362 constraints, problems are : Problem set: 0 solved, 172 unsolved in 12686 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 80/80 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 43/43 constraints]
After SMT, in 24180ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 24183ms
Starting structural reductions in LTL mode, iteration 1 : 80/121 places, 173/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24296 ms. Remains : 80/121 places, 173/226 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-02
Product exploration explored 100000 steps with 33333 reset in 258 ms.
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 12 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04a-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-02 finished in 25152 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 226/226 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 102 transition count 205
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 102 transition count 205
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 102 transition count 199
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 54 place count 92 transition count 187
Iterating global reduction 1 with 10 rules applied. Total rules applied 64 place count 92 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 66 place count 92 transition count 185
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 84 transition count 177
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 84 transition count 177
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 84 place count 84 transition count 175
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 80 transition count 171
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 80 transition count 171
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 77 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 77 transition count 168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 100 place count 75 transition count 166
Iterating global reduction 3 with 2 rules applied. Total rules applied 102 place count 75 transition count 166
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 75 transition count 165
Applied a total of 103 rules in 16 ms. Remains 75 /121 variables (removed 46) and now considering 165/226 (removed 61) transitions.
[2024-06-01 08:05:48] [INFO ] Flow matrix only has 159 transitions (discarded 6 similar events)
// Phase 1: matrix 159 rows 75 cols
[2024-06-01 08:05:48] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:05:48] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-06-01 08:05:48] [INFO ] Flow matrix only has 159 transitions (discarded 6 similar events)
[2024-06-01 08:05:48] [INFO ] Invariant cache hit.
[2024-06-01 08:05:49] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:05:49] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 08:05:49] [INFO ] Flow matrix only has 159 transitions (discarded 6 similar events)
[2024-06-01 08:05:49] [INFO ] Invariant cache hit.
[2024-06-01 08:05:49] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:05:50] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:05:51] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:05:52] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:05:52] [INFO ] Deduced a trap composed of 23 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:05:52] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:05:52] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:05:52] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:05:52] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 158/233 variables, 75/107 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 65/172 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:05:54] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:05:55] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 1/234 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 164 unsolved in 10980 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 158/233 variables, 75/109 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 164/338 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/234 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 339 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11412 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 33/33 constraints]
After SMT, in 22537ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 22543ms
Starting structural reductions in LTL mode, iteration 1 : 75/121 places, 165/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23305 ms. Remains : 75/121 places, 165/226 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 176 ms.
Product exploration explored 100000 steps with 0 reset in 187 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 13390 steps (21 resets) in 186 ms. (71 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 6 factoid took 179 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 165/165 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2024-06-01 08:06:13] [INFO ] Flow matrix only has 159 transitions (discarded 6 similar events)
[2024-06-01 08:06:13] [INFO ] Invariant cache hit.
[2024-06-01 08:06:13] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 08:06:13] [INFO ] Flow matrix only has 159 transitions (discarded 6 similar events)
[2024-06-01 08:06:13] [INFO ] Invariant cache hit.
[2024-06-01 08:06:13] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:06:13] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 08:06:13] [INFO ] Flow matrix only has 159 transitions (discarded 6 similar events)
[2024-06-01 08:06:13] [INFO ] Invariant cache hit.
[2024-06-01 08:06:13] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:14] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 23 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:15] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:06:16] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 158/233 variables, 75/107 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 65/172 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:17] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:19] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 1/234 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 164 unsolved in 10282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 158/233 variables, 75/109 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 164/338 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/234 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 339 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11561 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 33/33 constraints]
After SMT, in 21987ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 21990ms
Finished structural reductions in LTL mode , in 1 iterations and 22093 ms. Remains : 75/75 places, 165/165 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 11950 steps (21 resets) in 52 ms. (225 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 109 ms.
Product exploration explored 100000 steps with 0 reset in 173 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 165/165 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 75 transition count 165
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 17 place count 75 transition count 170
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 22 place count 75 transition count 170
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 67 transition count 162
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 67 transition count 162
Performed 26 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 26 rules applied. Total rules applied 64 place count 67 transition count 170
Ensure Unique test removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 109 place count 67 transition count 125
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 126 place count 50 transition count 108
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 143 place count 50 transition count 108
Deduced a syphon composed of 23 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 2 with 41 rules applied. Total rules applied 184 place count 50 transition count 67
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 5 rules applied. Total rules applied 189 place count 50 transition count 67
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 199 place count 40 transition count 57
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 209 place count 40 transition count 57
Deduced a syphon composed of 18 places in 0 ms
Applied a total of 209 rules in 30 ms. Remains 40 /75 variables (removed 35) and now considering 57/165 (removed 108) transitions.
[2024-06-01 08:06:37] [INFO ] Redundant transitions in 0 ms returned []
Running 56 sub problems to find dead transitions.
[2024-06-01 08:06:37] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
// Phase 1: matrix 52 rows 40 cols
[2024-06-01 08:06:37] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:06:37] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 1/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 4 ms to minimize.
[2024-06-01 08:06:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 08:06:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 56 unsolved
[2024-06-01 08:06:38] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:06:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 56 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 TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
At refinement iteration 7 (OVERLAPS) 51/91 variables, 40/66 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 8/74 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 0/74 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 1/92 variables, 1/75 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 0/75 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 12 (OVERLAPS) 0/92 variables, 0/75 constraints. Problems are: Problem set: 26 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 75 constraints, problems are : Problem set: 26 solved, 30 unsolved in 1896 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 26 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 19/40 variables, 1/1 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 25/26 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/26 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 51/91 variables, 40/66 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 8/74 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 30/104 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/104 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 1/92 variables, 1/105 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/105 constraints. Problems are: Problem set: 26 solved, 30 unsolved
At refinement iteration 10 (OVERLAPS) 0/92 variables, 0/105 constraints. Problems are: Problem set: 26 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 105 constraints, problems are : Problem set: 26 solved, 30 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 30/56 constraints, Known Traps: 25/25 constraints]
After SMT, in 2816ms problems are : Problem set: 26 solved, 30 unsolved
Search for dead transitions found 26 dead transitions in 2818ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/75 places, 31/165 transitions.
Graph (complete) has 96 edges and 40 vertex of which 22 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 22 /40 variables (removed 18) and now considering 31/31 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/75 places, 31/165 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2873 ms. Remains : 22/75 places, 31/165 transitions.
Support contains 5 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 165/165 transitions.
Applied a total of 0 rules in 0 ms. Remains 75 /75 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2024-06-01 08:06:39] [INFO ] Flow matrix only has 159 transitions (discarded 6 similar events)
// Phase 1: matrix 159 rows 75 cols
[2024-06-01 08:06:39] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:06:39] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 08:06:39] [INFO ] Flow matrix only has 159 transitions (discarded 6 similar events)
[2024-06-01 08:06:39] [INFO ] Invariant cache hit.
[2024-06-01 08:06:40] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:06:40] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2024-06-01 08:06:40] [INFO ] Flow matrix only has 159 transitions (discarded 6 similar events)
[2024-06-01 08:06:40] [INFO ] Invariant cache hit.
[2024-06-01 08:06:40] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:06:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-01 08:06:41] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 5/26 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 14 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:06:42] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 158/233 variables, 75/107 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/233 variables, 65/172 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:44] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 164 unsolved
[2024-06-01 08:06:46] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 12 (OVERLAPS) 1/234 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 14 (OVERLAPS) 0/234 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 234/234 variables, and 175 constraints, problems are : Problem set: 0 solved, 164 unsolved in 10735 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (OVERLAPS) 1/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 158/233 variables, 75/109 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/233 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/233 variables, 164/338 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/233 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 1/234 variables, 1/339 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/234 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 10 (OVERLAPS) 0/234 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 234/234 variables, and 339 constraints, problems are : Problem set: 0 solved, 164 unsolved in 11446 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 75/75 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 33/33 constraints]
After SMT, in 22297ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 22299ms
Finished structural reductions in LTL mode , in 1 iterations and 22396 ms. Remains : 75/75 places, 165/165 transitions.
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-03 finished in 73654 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(((p0 U p1)||F(p0))) U X(G(!p0))))'
Support contains 4 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 226/226 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 103 transition count 206
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 103 transition count 206
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 103 transition count 201
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 53 place count 91 transition count 187
Iterating global reduction 1 with 12 rules applied. Total rules applied 65 place count 91 transition count 187
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 91 transition count 185
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 81 transition count 175
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 81 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 81 transition count 173
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 76 transition count 168
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 76 transition count 168
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 102 place count 73 transition count 165
Iterating global reduction 3 with 3 rules applied. Total rules applied 105 place count 73 transition count 165
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 70 transition count 162
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 70 transition count 162
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 70 transition count 161
Applied a total of 112 rules in 6 ms. Remains 70 /121 variables (removed 51) and now considering 161/226 (removed 65) transitions.
[2024-06-01 08:07:02] [INFO ] Flow matrix only has 154 transitions (discarded 7 similar events)
// Phase 1: matrix 154 rows 70 cols
[2024-06-01 08:07:02] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:07:02] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-06-01 08:07:02] [INFO ] Flow matrix only has 154 transitions (discarded 7 similar events)
[2024-06-01 08:07:02] [INFO ] Invariant cache hit.
[2024-06-01 08:07:02] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:07:02] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Running 160 sub problems to find dead transitions.
[2024-06-01 08:07:02] [INFO ] Flow matrix only has 154 transitions (discarded 7 similar events)
[2024-06-01 08:07:02] [INFO ] Invariant cache hit.
[2024-06-01 08:07:02] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:07:03] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 7 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:07:04] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 9/31 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 153/223 variables, 70/101 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 65/166 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-01 08:07:05] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:07:06] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 3/169 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 1/224 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (OVERLAPS) 0/224 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 170 constraints, problems are : Problem set: 0 solved, 160 unsolved in 6796 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 32/32 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:07:09] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 153/223 variables, 70/106 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 65/171 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/223 variables, 160/331 constraints. Problems are: Problem set: 0 solved, 160 unsolved
[2024-06-01 08:07:12] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/223 variables, 1/332 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 10 (OVERLAPS) 1/224 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 12 (OVERLAPS) 0/224 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 333 constraints, problems are : Problem set: 0 solved, 160 unsolved in 9825 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 35/35 constraints]
After SMT, in 16783ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 16786ms
Starting structural reductions in LTL mode, iteration 1 : 70/121 places, 161/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16929 ms. Remains : 70/121 places, 161/226 transitions.
Stuttering acceptance computed with spot in 163 ms :[false, p0, (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-04
Product exploration explored 100000 steps with 24982 reset in 84 ms.
Product exploration explored 100000 steps with 25041 reset in 89 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 p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 94 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[p0, (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 40000 steps (86 resets) in 172 ms. (231 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (17 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
[2024-06-01 08:07:20] [INFO ] Flow matrix only has 154 transitions (discarded 7 similar events)
[2024-06-01 08:07:20] [INFO ] Invariant cache hit.
[2024-06-01 08:07:20] [INFO ] State equation strengthened by 66 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/223 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 65/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/224 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/224 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 70/70 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 66/70 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 13 places in 522 ms of which 32 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:07:20] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
Problem apf1 is UNSAT
After SMT solving in domain Int declared 70/224 variables, and 8 constraints, problems are : Problem set: 1 solved, 0 unsolved in 882 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/70 constraints, ReadFeed: 0/66 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 968ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[p0]
Stuttering acceptance computed with spot in 38 ms :[p0]
[2024-06-01 08:07:21] [INFO ] Flow matrix only has 154 transitions (discarded 7 similar events)
[2024-06-01 08:07:21] [INFO ] Invariant cache hit.
Proved EG p0
Knowledge obtained : [(AND p0 p1), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (G p0)]
Property proved to be false thanks to negative knowledge :(G p0)
Knowledge based reduction with 7 factoid took 224 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04a-LTLCardinality-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-04 finished in 19260 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 1 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 226/226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 120 transition count 160
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 142 place count 55 transition count 148
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 147 place count 53 transition count 145
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 4 rules applied. Total rules applied 151 place count 52 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 153 place count 50 transition count 142
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 153 place count 50 transition count 136
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 165 place count 44 transition count 136
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 169 place count 40 transition count 130
Iterating global reduction 5 with 4 rules applied. Total rules applied 173 place count 40 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 174 place count 40 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 174 place count 40 transition count 128
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 176 place count 39 transition count 128
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 178 place count 37 transition count 124
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 37 transition count 124
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 186 place count 37 transition count 118
Performed 15 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 216 place count 22 transition count 97
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 247 place count 22 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 249 place count 21 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 250 place count 21 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 9 with 36 rules applied. Total rules applied 286 place count 21 transition count 28
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 9 with 10 rules applied. Total rules applied 296 place count 16 transition count 23
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 300 place count 12 transition count 19
Applied a total of 300 rules in 17 ms. Remains 12 /121 variables (removed 109) and now considering 19/226 (removed 207) transitions.
[2024-06-01 08:07:21] [INFO ] Flow matrix only has 14 transitions (discarded 5 similar events)
// Phase 1: matrix 14 rows 12 cols
[2024-06-01 08:07:21] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:07:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 08:07:21] [INFO ] Flow matrix only has 14 transitions (discarded 5 similar events)
[2024-06-01 08:07:21] [INFO ] Invariant cache hit.
[2024-06-01 08:07:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 08:07:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-06-01 08:07:21] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 08:07:21] [INFO ] Flow matrix only has 14 transitions (discarded 5 similar events)
[2024-06-01 08:07:21] [INFO ] Invariant cache hit.
[2024-06-01 08:07:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 3 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:07:21] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 13/25 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 1/26 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/26 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 29 constraints, problems are : Problem set: 0 solved, 13 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 5/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 1 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:07:22] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/12 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 13/25 variables, 12/36 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 13/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 1/26 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/26 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 0/26 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 50 constraints, problems are : Problem set: 0 solved, 13 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 23/23 constraints]
After SMT, in 716ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 716ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/121 places, 19/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 776 ms. Remains : 12/121 places, 19/226 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-06
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-06 finished in 837 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(X((F(p0)&&G(F(p1))))))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 226/226 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 102 transition count 205
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 102 transition count 205
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 43 place count 102 transition count 200
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 56 place count 89 transition count 185
Iterating global reduction 1 with 13 rules applied. Total rules applied 69 place count 89 transition count 185
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 89 transition count 182
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 79 transition count 172
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 79 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 94 place count 79 transition count 170
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 100 place count 73 transition count 164
Iterating global reduction 3 with 6 rules applied. Total rules applied 106 place count 73 transition count 164
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 110 place count 69 transition count 160
Iterating global reduction 3 with 4 rules applied. Total rules applied 114 place count 69 transition count 160
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 117 place count 66 transition count 157
Iterating global reduction 3 with 3 rules applied. Total rules applied 120 place count 66 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 122 place count 66 transition count 155
Applied a total of 122 rules in 12 ms. Remains 66 /121 variables (removed 55) and now considering 155/226 (removed 71) transitions.
[2024-06-01 08:07:22] [INFO ] Flow matrix only has 149 transitions (discarded 6 similar events)
// Phase 1: matrix 149 rows 66 cols
[2024-06-01 08:07:22] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:07:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 08:07:22] [INFO ] Flow matrix only has 149 transitions (discarded 6 similar events)
[2024-06-01 08:07:22] [INFO ] Invariant cache hit.
[2024-06-01 08:07:22] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:07:22] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 154 sub problems to find dead transitions.
[2024-06-01 08:07:22] [INFO ] Flow matrix only has 149 transitions (discarded 6 similar events)
[2024-06-01 08:07:22] [INFO ] Invariant cache hit.
[2024-06-01 08:07:22] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 0 ms to minimize.
[2024-06-01 08:07:23] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:07:24] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:07:25] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 08:07:26] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 08:07:26] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 0 ms to minimize.
[2024-06-01 08:07:26] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 148/214 variables, 66/108 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/214 variables, 65/173 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/214 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 12 (OVERLAPS) 1/215 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 154 unsolved
[2024-06-01 08:07:29] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 15 (OVERLAPS) 0/215 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 175 constraints, problems are : Problem set: 0 solved, 154 unsolved in 10011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 1 (OVERLAPS) 1/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 42/43 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 4 (OVERLAPS) 148/214 variables, 66/109 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/214 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 154/328 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 8 (OVERLAPS) 1/215 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 329 constraints, problems are : Problem set: 0 solved, 154 unsolved in 10221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 42/42 constraints]
After SMT, in 20386ms problems are : Problem set: 0 solved, 154 unsolved
Search for dead transitions found 0 dead transitions in 20388ms
Starting structural reductions in LTL mode, iteration 1 : 66/121 places, 155/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20498 ms. Remains : 66/121 places, 155/226 transitions.
Stuttering acceptance computed with spot in 336 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-07
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-07 finished in 20851 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 226/226 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 102 transition count 205
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 102 transition count 205
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 102 transition count 199
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 55 place count 91 transition count 186
Iterating global reduction 1 with 11 rules applied. Total rules applied 66 place count 91 transition count 186
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 68 place count 91 transition count 184
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 77 place count 82 transition count 175
Iterating global reduction 2 with 9 rules applied. Total rules applied 86 place count 82 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 82 transition count 173
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 93 place count 77 transition count 168
Iterating global reduction 3 with 5 rules applied. Total rules applied 98 place count 77 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 73 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 73 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 109 place count 70 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 112 place count 70 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 114 place count 70 transition count 159
Applied a total of 114 rules in 11 ms. Remains 70 /121 variables (removed 51) and now considering 159/226 (removed 67) transitions.
[2024-06-01 08:07:43] [INFO ] Flow matrix only has 153 transitions (discarded 6 similar events)
// Phase 1: matrix 153 rows 70 cols
[2024-06-01 08:07:43] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:07:43] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 08:07:43] [INFO ] Flow matrix only has 153 transitions (discarded 6 similar events)
[2024-06-01 08:07:43] [INFO ] Invariant cache hit.
[2024-06-01 08:07:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:07:43] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-06-01 08:07:43] [INFO ] Flow matrix only has 153 transitions (discarded 6 similar events)
[2024-06-01 08:07:43] [INFO ] Invariant cache hit.
[2024-06-01 08:07:43] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 1 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:07:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:07:45] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:07:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:07:46] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 08:07:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 0 ms to minimize.
[2024-06-01 08:07:46] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:07:46] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:07:46] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 08:07:47] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 152/222 variables, 70/109 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 65/174 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:07:48] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 08:07:48] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 13 (OVERLAPS) 1/223 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 15 (OVERLAPS) 0/223 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 177 constraints, problems are : Problem set: 0 solved, 158 unsolved in 10407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (OVERLAPS) 152/222 variables, 70/111 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 65/176 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 158/334 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 1/223 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/223 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 335 constraints, problems are : Problem set: 0 solved, 158 unsolved in 11451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 40/40 constraints]
After SMT, in 21982ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 21985ms
Starting structural reductions in LTL mode, iteration 1 : 70/121 places, 159/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22145 ms. Remains : 70/121 places, 159/226 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-04a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-08 finished in 22409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 226/226 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 63 place count 120 transition count 162
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 74 rules applied. Total rules applied 137 place count 57 transition count 151
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 142 place count 55 transition count 148
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 144 place count 54 transition count 147
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 144 place count 54 transition count 140
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 158 place count 47 transition count 140
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 162 place count 43 transition count 134
Iterating global reduction 4 with 4 rules applied. Total rules applied 166 place count 43 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 167 place count 43 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 167 place count 43 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 169 place count 42 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 171 place count 40 transition count 128
Iterating global reduction 5 with 2 rules applied. Total rules applied 173 place count 40 transition count 128
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 179 place count 40 transition count 122
Performed 16 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 6 with 32 rules applied. Total rules applied 211 place count 24 transition count 97
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 240 place count 24 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 242 place count 23 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 243 place count 23 transition count 66
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 8 with 36 rules applied. Total rules applied 279 place count 23 transition count 30
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 8 with 10 rules applied. Total rules applied 289 place count 18 transition count 25
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 292 place count 15 transition count 22
Applied a total of 292 rules in 23 ms. Remains 15 /121 variables (removed 106) and now considering 22/226 (removed 204) transitions.
[2024-06-01 08:08:05] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
// Phase 1: matrix 17 rows 15 cols
[2024-06-01 08:08:05] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:08:05] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 08:08:05] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2024-06-01 08:08:05] [INFO ] Invariant cache hit.
[2024-06-01 08:08:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 08:08:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-06-01 08:08:05] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 08:08:05] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2024-06-01 08:08:05] [INFO ] Invariant cache hit.
[2024-06-01 08:08:05] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:05] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:08:05] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 08:08:05] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 16/31 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/32 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 745 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 5 ms to minimize.
[2024-06-01 08:08:06] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 16/31 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 1/32 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/32 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/32 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 66 constraints, problems are : Problem set: 0 solved, 21 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 23/23 constraints]
After SMT, in 1073ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1073ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/121 places, 22/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1162 ms. Remains : 15/121 places, 22/226 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 43 ms.
Product exploration explored 100000 steps with 0 reset in 85 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 60 steps (11 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 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 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-06-01 08:08:07] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2024-06-01 08:08:07] [INFO ] Invariant cache hit.
[2024-06-01 08:08:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 08:08:07] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2024-06-01 08:08:07] [INFO ] Invariant cache hit.
[2024-06-01 08:08:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 08:08:07] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 08:08:07] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 08:08:07] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2024-06-01 08:08:07] [INFO ] Invariant cache hit.
[2024-06-01 08:08:07] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:08:07] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 16/31 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/32 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 685 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:08:08] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 16/31 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 1/32 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/32 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/32 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 66 constraints, problems are : Problem set: 0 solved, 21 unsolved in 290 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 23/23 constraints]
After SMT, in 980ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 980ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1041 ms. Remains : 15/15 places, 22/22 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 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)]
RANDOM walk for 198 steps (38 resets) in 4 ms. (39 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 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 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 44 ms.
Product exploration explored 100000 steps with 2 reset in 40 ms.
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-06-01 08:08:09] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2024-06-01 08:08:09] [INFO ] Invariant cache hit.
[2024-06-01 08:08:09] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 08:08:09] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2024-06-01 08:08:09] [INFO ] Invariant cache hit.
[2024-06-01 08:08:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 08:08:09] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 08:08:09] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-06-01 08:08:09] [INFO ] Flow matrix only has 17 transitions (discarded 5 similar events)
[2024-06-01 08:08:09] [INFO ] Invariant cache hit.
[2024-06-01 08:08:09] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 28 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 08:08:09] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 08:08:10] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 08:08:10] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 16/31 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:10] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 1/32 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/32 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/32 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 43 constraints, problems are : Problem set: 0 solved, 21 unsolved in 934 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/15 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-06-01 08:08:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 08:08:10] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 16/31 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 5/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/31 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 1/32 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/32 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 0/32 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 66 constraints, problems are : Problem set: 0 solved, 21 unsolved in 308 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 23/23 constraints]
After SMT, in 1247ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 1248ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1308 ms. Remains : 15/15 places, 22/22 transitions.
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-11 finished in 4826 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(X(G(p0))))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 226/226 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 101 transition count 204
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 101 transition count 204
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 46 place count 101 transition count 198
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 90 transition count 186
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 90 transition count 186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 90 transition count 183
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 79 place count 82 transition count 175
Iterating global reduction 2 with 8 rules applied. Total rules applied 87 place count 82 transition count 175
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 82 transition count 173
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 94 place count 77 transition count 168
Iterating global reduction 3 with 5 rules applied. Total rules applied 99 place count 77 transition count 168
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 103 place count 73 transition count 164
Iterating global reduction 3 with 4 rules applied. Total rules applied 107 place count 73 transition count 164
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 110 place count 70 transition count 161
Iterating global reduction 3 with 3 rules applied. Total rules applied 113 place count 70 transition count 161
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 70 transition count 159
Applied a total of 115 rules in 5 ms. Remains 70 /121 variables (removed 51) and now considering 159/226 (removed 67) transitions.
[2024-06-01 08:08:10] [INFO ] Flow matrix only has 153 transitions (discarded 6 similar events)
// Phase 1: matrix 153 rows 70 cols
[2024-06-01 08:08:10] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:08:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 08:08:10] [INFO ] Flow matrix only has 153 transitions (discarded 6 similar events)
[2024-06-01 08:08:10] [INFO ] Invariant cache hit.
[2024-06-01 08:08:10] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 08:08:10] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-06-01 08:08:10] [INFO ] Flow matrix only has 153 transitions (discarded 6 similar events)
[2024-06-01 08:08:10] [INFO ] Invariant cache hit.
[2024-06-01 08:08:10] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-06-01 08:08:11] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 2 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 0 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
[2024-06-01 08:08:12] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 13/34 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-06-01 08:08:13] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 0 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-06-01 08:08:14] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:08:15] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2024-06-01 08:08:15] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (OVERLAPS) 152/222 variables, 70/121 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 65/186 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 1/223 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 13 (OVERLAPS) 0/223 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 187 constraints, problems are : Problem set: 0 solved, 158 unsolved in 9989 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (OVERLAPS) 1/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 08:08:21] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 152/222 variables, 70/122 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 65/187 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/222 variables, 158/345 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (OVERLAPS) 1/223 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 11 (OVERLAPS) 0/223 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 346 constraints, problems are : Problem set: 0 solved, 158 unsolved in 12601 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 51/51 constraints]
After SMT, in 22727ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 22739ms
Starting structural reductions in LTL mode, iteration 1 : 70/121 places, 159/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22839 ms. Remains : 70/121 places, 159/226 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-04a-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-04a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-04a-LTLCardinality-15 finished in 23040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||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' '!(G(F(p0)))'
[2024-06-01 08:08:33] [INFO ] Flatten gal took : 13 ms
[2024-06-01 08:08:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-01 08:08:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 121 places, 226 transitions and 1000 arcs took 4 ms.
Total runtime 196684 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-04a-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-04a-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717229314417

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyCommit-PT-04a-LTLCardinality-03
ltl formula formula --ltl=/tmp/2746/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 121 places, 226 transitions and 1000 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.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2746/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2746/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2746/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2746/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 123 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 122, there are 286 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~42!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 612
pnml2lts-mc( 0/ 4): unique transitions count: 2525
pnml2lts-mc( 0/ 4): - self-loop count: 354
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 994
pnml2lts-mc( 0/ 4): - claim success count: 635
pnml2lts-mc( 0/ 4): - cum. max stack depth: 187
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 641 states 2884 transitions, fanout: 4.499
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 64100, Transitions per second: 288400
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 12.8 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 226 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name StigmergyCommit-PT-04a-LTLCardinality-11
ltl formula formula --ltl=/tmp/2746/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 121 places, 226 transitions and 1000 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.020 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2746/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2746/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2746/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2746/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 123 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 122, there are 235 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~48 levels ~10000 states ~47764 transitions
pnml2lts-mc( 2/ 4): ~48 levels ~20000 states ~93840 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: 21604
pnml2lts-mc( 0/ 4): unique states count: 25770
pnml2lts-mc( 0/ 4): unique transitions count: 118419
pnml2lts-mc( 0/ 4): - self-loop count: 4420
pnml2lts-mc( 0/ 4): - claim dead count: 71915
pnml2lts-mc( 0/ 4): - claim found count: 16724
pnml2lts-mc( 0/ 4): - claim success count: 26049
pnml2lts-mc( 0/ 4): - cum. max stack depth: 203
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26068 states 120114 transitions, fanout: 4.608
pnml2lts-mc( 0/ 4): Total exploration time 0.190 sec (0.190 sec minimum, 0.190 sec on average)
pnml2lts-mc( 0/ 4): States per second: 137200, Transitions per second: 632179
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 8.4 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 226 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~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-04a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyCommit-PT-04a.tgz
mv StigmergyCommit-PT-04a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;