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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 76K 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.3K Apr 23 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 17:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Apr 11 17:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 11 17:46 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 98K 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-03a-LTLFireability-00
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-01
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-02
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-03
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-04
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-05
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-06
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-07
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-08
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-09
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-10
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-11
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-12
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-13
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-14
FORMULA_NAME StigmergyCommit-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717228408162

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-03a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:53:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:53:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:53:29] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2024-06-01 07:53:29] [INFO ] Transformed 148 places.
[2024-06-01 07:53:29] [INFO ] Transformed 332 transitions.
[2024-06-01 07:53:29] [INFO ] Found NUPN structural information;
[2024-06-01 07:53:29] [INFO ] Parsed PT model containing 148 places and 332 transitions and 1538 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 110 transitions
Reduce redundant transitions removed 110 transitions.
FORMULA StigmergyCommit-PT-03a-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-03a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 148 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 148/148 places, 222/222 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 123 transition count 195
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 123 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 54 place count 123 transition count 191
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 66 place count 111 transition count 177
Iterating global reduction 1 with 12 rules applied. Total rules applied 78 place count 111 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 81 place count 111 transition count 174
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 84 place count 108 transition count 171
Iterating global reduction 2 with 3 rules applied. Total rules applied 87 place count 108 transition count 171
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 106 transition count 169
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 106 transition count 169
Applied a total of 91 rules in 57 ms. Remains 106 /148 variables (removed 42) and now considering 169/222 (removed 53) transitions.
[2024-06-01 07:53:29] [INFO ] Flow matrix only has 161 transitions (discarded 8 similar events)
// Phase 1: matrix 161 rows 106 cols
[2024-06-01 07:53:29] [INFO ] Computed 3 invariants in 13 ms
[2024-06-01 07:53:29] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 07:53:29] [INFO ] Flow matrix only has 161 transitions (discarded 8 similar events)
[2024-06-01 07:53:30] [INFO ] Invariant cache hit.
[2024-06-01 07:53:30] [INFO ] State equation strengthened by 73 read => feed constraints.
[2024-06-01 07:53:30] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
Running 168 sub problems to find dead transitions.
[2024-06-01 07:53:30] [INFO ] Flow matrix only has 161 transitions (discarded 8 similar events)
[2024-06-01 07:53:30] [INFO ] Invariant cache hit.
[2024-06-01 07:53:30] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 40 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 1 ms to minimize.
[2024-06-01 07:53:31] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 7 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 0 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:53:32] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:53:33] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:53:33] [INFO ] Deduced a trap composed of 29 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:53:33] [INFO ] Deduced a trap composed of 25 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:53:33] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 7/30 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:53:33] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:53:33] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:53:34] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 160/266 variables, 106/139 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 72/211 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 1/267 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/267 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 212 constraints, problems are : Problem set: 0 solved, 168 unsolved in 9146 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 30/33 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:53:40] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-06-01 07:53:40] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/106 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 160/266 variables, 106/141 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 72/213 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 168/381 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 1/267 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 12 (OVERLAPS) 0/267 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 382 constraints, problems are : Problem set: 0 solved, 168 unsolved in 7437 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 32/32 constraints]
After SMT, in 16748ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 16770ms
Starting structural reductions in LTL mode, iteration 1 : 106/148 places, 169/222 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17200 ms. Remains : 106/148 places, 169/222 transitions.
Support contains 24 out of 106 places after structural reductions.
[2024-06-01 07:53:47] [INFO ] Flatten gal took : 33 ms
[2024-06-01 07:53:47] [INFO ] Flatten gal took : 14 ms
[2024-06-01 07:53:47] [INFO ] Input system was already deterministic with 169 transitions.
Reduction of identical properties reduced properties to check from 25 to 24
RANDOM walk for 40000 steps (109 resets) in 1363 ms. (29 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40004 steps (13 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
[2024-06-01 07:53:47] [INFO ] Flow matrix only has 161 transitions (discarded 8 similar events)
[2024-06-01 07:53:47] [INFO ] Invariant cache hit.
[2024-06-01 07:53:47] [INFO ] State equation strengthened by 73 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 103/105 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 07:53:47] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:53:47] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-06-01 07:53:47] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 3 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
Problem AtomicPropp14 is UNSAT
After SMT solving in domain Real declared 105/267 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/106 constraints, ReadFeed: 0/73 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 276ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 27 stabilizing places and 26 stable transitions
FORMULA StigmergyCommit-PT-03a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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)&&F(p1))))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 104 transition count 114
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 62 rules applied. Total rules applied 117 place count 50 transition count 106
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 126 place count 47 transition count 100
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 with 7 rules applied. Total rules applied 133 place count 44 transition count 96
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 4 with 7 rules applied. Total rules applied 140 place count 42 transition count 91
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 145 place count 39 transition count 89
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 148 place count 38 transition count 87
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 150 place count 37 transition count 86
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 4 Pre rules applied. Total rules applied 150 place count 37 transition count 82
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 158 place count 33 transition count 82
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 163 place count 28 transition count 75
Iterating global reduction 8 with 5 rules applied. Total rules applied 168 place count 28 transition count 75
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 171 place count 28 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 2 Pre rules applied. Total rules applied 171 place count 28 transition count 70
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 175 place count 26 transition count 70
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 177 place count 24 transition count 66
Iterating global reduction 9 with 2 rules applied. Total rules applied 179 place count 24 transition count 66
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 9 with 12 rules applied. Total rules applied 191 place count 24 transition count 54
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 10 with 8 rules applied. Total rules applied 199 place count 20 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 203 place count 20 transition count 46
Performed 4 Post agglomeration using F-continuation condition with reduction of 34 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 211 place count 16 transition count 53
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 11 with 15 rules applied. Total rules applied 226 place count 16 transition count 38
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 12 with 8 rules applied. Total rules applied 234 place count 16 transition count 30
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 238 place count 12 transition count 26
Applied a total of 238 rules in 35 ms. Remains 12 /106 variables (removed 94) and now considering 26/169 (removed 143) transitions.
[2024-06-01 07:53:48] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
// Phase 1: matrix 21 rows 12 cols
[2024-06-01 07:53:48] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:53:48] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 07:53:48] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2024-06-01 07:53:48] [INFO ] Invariant cache hit.
[2024-06-01 07:53:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 07:53:48] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
[2024-06-01 07:53:48] [INFO ] Flow matrix only has 21 transitions (discarded 5 similar events)
[2024-06-01 07:53:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 1/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) 20/32 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:53:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/33 variables, and 27 constraints, problems are : Problem set: 0 solved, 13 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 4/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 20/32 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/33 variables, and 42 constraints, problems are : Problem set: 0 solved, 13 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 16/16 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 588ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/106 places, 26/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 676 ms. Remains : 12/106 places, 26/169 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-00 finished in 977 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||G(p0))))'
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 104 transition count 116
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 62 rules applied. Total rules applied 115 place count 52 transition count 106
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 126 place count 48 transition count 99
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 132 place count 45 transition count 96
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 132 place count 45 transition count 89
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 146 place count 38 transition count 89
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 158 place count 26 transition count 75
Iterating global reduction 4 with 12 rules applied. Total rules applied 170 place count 26 transition count 75
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 177 place count 26 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 177 place count 26 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 181 place count 24 transition count 66
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 183 place count 22 transition count 62
Iterating global reduction 5 with 2 rules applied. Total rules applied 185 place count 22 transition count 62
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 197 place count 22 transition count 50
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 205 place count 18 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 209 place count 18 transition count 42
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 217 place count 14 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 218 place count 13 transition count 37
Applied a total of 218 rules in 30 ms. Remains 13 /106 variables (removed 93) and now considering 37/169 (removed 132) transitions.
[2024-06-01 07:53:49] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
// Phase 1: matrix 32 rows 13 cols
[2024-06-01 07:53:49] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:53:49] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 07:53:49] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-06-01 07:53:49] [INFO ] Invariant cache hit.
[2024-06-01 07:53:49] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 07:53:49] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 07:53:49] [INFO ] Redundant transitions in 1 ms returned []
Running 33 sub problems to find dead transitions.
[2024-06-01 07:53:49] [INFO ] Flow matrix only has 32 transitions (discarded 5 similar events)
[2024-06-01 07:53:49] [INFO ] Invariant cache hit.
[2024-06-01 07:53:49] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 4/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 8 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:53:49] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 31/44 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 22/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/45 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/45 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/45 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 45/45 variables, and 47 constraints, problems are : Problem set: 0 solved, 33 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 4/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 07:53:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:53:50] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 07:53:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 31/44 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/44 variables, 22/49 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/44 variables, 33/82 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 1/45 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (OVERLAPS) 0/45 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 45/45 variables, and 83 constraints, problems are : Problem set: 0 solved, 33 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 13/13 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 13/13 constraints]
After SMT, in 1182ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 1183ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/106 places, 37/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1262 ms. Remains : 13/106 places, 37/169 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, false, (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-01 finished in 1359 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 U p1)&&G(p2)) U X(!X(F(X(p0)))))))'
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 90 transition count 150
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 90 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 90 transition count 147
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 88 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 88 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 88 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 87 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 87 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 86 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 86 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 85 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 85 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 85 transition count 140
Applied a total of 47 rules in 26 ms. Remains 85 /106 variables (removed 21) and now considering 140/169 (removed 29) transitions.
[2024-06-01 07:53:50] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
// Phase 1: matrix 135 rows 85 cols
[2024-06-01 07:53:50] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:53:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 07:53:50] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
[2024-06-01 07:53:50] [INFO ] Invariant cache hit.
[2024-06-01 07:53:50] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-01 07:53:50] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/106 places, 140/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 75 transition count 131
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 75 transition count 131
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 75 transition count 128
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 25 place count 71 transition count 124
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 71 transition count 124
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 33 place count 67 transition count 120
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 67 transition count 120
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 63 transition count 116
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 63 transition count 116
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 59 transition count 112
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 59 transition count 112
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 56 transition count 109
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 56 transition count 109
Applied a total of 59 rules in 8 ms. Remains 56 /84 variables (removed 28) and now considering 109/140 (removed 31) transitions.
[2024-06-01 07:53:50] [INFO ] Flow matrix only has 104 transitions (discarded 5 similar events)
// Phase 1: matrix 104 rows 56 cols
[2024-06-01 07:53:50] [INFO ] Computed 1 invariants in 3 ms
[2024-06-01 07:53:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 07:53:51] [INFO ] Flow matrix only has 104 transitions (discarded 5 similar events)
[2024-06-01 07:53:51] [INFO ] Invariant cache hit.
[2024-06-01 07:53:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:53:51] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 56/106 places, 109/169 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 258 ms. Remains : 56/106 places, 109/169 transitions.
Stuttering acceptance computed with spot in 435 ms :[p0, (AND p2 p0), (AND p2 p1 p0), (AND p2 p0), (AND p2 p1 p0), p0, (AND p2 p0), (AND p2 p1 p0), p2, (AND p2 p1 (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-02
Stuttering criterion allowed to conclude after 104 steps with 0 reset in 4 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-02 finished in 723 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 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 104 transition count 120
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 55 rules applied. Total rules applied 104 place count 56 transition count 113
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 8 rules applied. Total rules applied 112 place count 53 transition count 108
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 120 place count 51 transition count 102
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 7 rules applied. Total rules applied 127 place count 47 transition count 99
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 130 place count 46 transition count 97
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 132 place count 45 transition count 96
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 7 Pre rules applied. Total rules applied 132 place count 45 transition count 89
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 146 place count 38 transition count 89
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 158 place count 26 transition count 75
Iterating global reduction 7 with 12 rules applied. Total rules applied 170 place count 26 transition count 75
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 177 place count 26 transition count 68
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 2 Pre rules applied. Total rules applied 177 place count 26 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 181 place count 24 transition count 66
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 183 place count 22 transition count 62
Iterating global reduction 8 with 2 rules applied. Total rules applied 185 place count 22 transition count 62
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 197 place count 22 transition count 50
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 9 with 6 rules applied. Total rules applied 203 place count 19 transition count 47
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 207 place count 19 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 215 place count 15 transition count 39
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 216 place count 14 transition count 38
Applied a total of 216 rules in 28 ms. Remains 14 /106 variables (removed 92) and now considering 38/169 (removed 131) transitions.
[2024-06-01 07:53:51] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
// Phase 1: matrix 33 rows 14 cols
[2024-06-01 07:53:51] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:53:51] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 07:53:51] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
[2024-06-01 07:53:51] [INFO ] Invariant cache hit.
[2024-06-01 07:53:51] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-06-01 07:53:51] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 07:53:51] [INFO ] Redundant transitions in 0 ms returned []
Running 34 sub problems to find dead transitions.
[2024-06-01 07:53:51] [INFO ] Flow matrix only has 33 transitions (discarded 5 similar events)
[2024-06-01 07:53:51] [INFO ] Invariant cache hit.
[2024-06-01 07:53:51] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 4/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 5 places in 13 ms of which 1 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:53:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:53:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 07:53:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 34 unsolved
[2024-06-01 07:53:52] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:53:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 32/46 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 1/47 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 11 (OVERLAPS) 0/47 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 55 constraints, problems are : Problem set: 0 solved, 34 unsolved in 829 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 4/14 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 32/46 variables, 14/33 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 21/54 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 34/88 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 1/47 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/47 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 89 constraints, problems are : Problem set: 0 solved, 34 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 14/14 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 18/18 constraints]
After SMT, in 1316ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1317ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/106 places, 38/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1398 ms. Remains : 14/106 places, 38/169 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-03
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-03 finished in 1461 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((F(G(p1))&&p0))) U G(p2))))'
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 157
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 88 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 88 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 88 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 86 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 86 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 86 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 85 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 85 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 84 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 84 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 83 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 83 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 83 transition count 137
Applied a total of 51 rules in 7 ms. Remains 83 /106 variables (removed 23) and now considering 137/169 (removed 32) transitions.
[2024-06-01 07:53:52] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 83 cols
[2024-06-01 07:53:52] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 07:53:53] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 07:53:53] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-06-01 07:53:53] [INFO ] Invariant cache hit.
[2024-06-01 07:53:53] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-01 07:53:53] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-06-01 07:53:53] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-06-01 07:53:53] [INFO ] Invariant cache hit.
[2024-06-01 07:53:53] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:53:53] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 0 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 22 places in 29 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 22 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:53:54] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:53:55] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 131/214 variables, 83/116 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 64/180 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:53:56] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:53:57] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 1/215 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 12 (OVERLAPS) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 183 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8155 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:54:01] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:54:01] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 131/214 variables, 83/120 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 64/184 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 136/320 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 1/215 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 321 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5328 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 35/35 constraints]
After SMT, in 13547ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 13550ms
Starting structural reductions in LTL mode, iteration 1 : 83/106 places, 137/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13679 ms. Remains : 83/106 places, 137/169 transitions.
Stuttering acceptance computed with spot in 363 ms :[(NOT p2), (NOT p2), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-04 finished in 14071 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(p0)||F(p1))))'
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 90 transition count 149
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 90 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 90 transition count 146
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 89 transition count 145
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 89 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 88 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 88 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 87 transition count 143
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 87 transition count 143
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 86 transition count 142
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 86 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 86 transition count 141
Applied a total of 44 rules in 15 ms. Remains 86 /106 variables (removed 20) and now considering 141/169 (removed 28) transitions.
[2024-06-01 07:54:07] [INFO ] Flow matrix only has 136 transitions (discarded 5 similar events)
// Phase 1: matrix 136 rows 86 cols
[2024-06-01 07:54:07] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 07:54:07] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 07:54:07] [INFO ] Flow matrix only has 136 transitions (discarded 5 similar events)
[2024-06-01 07:54:07] [INFO ] Invariant cache hit.
[2024-06-01 07:54:07] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-06-01 07:54:07] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 140 sub problems to find dead transitions.
[2024-06-01 07:54:07] [INFO ] Flow matrix only has 136 transitions (discarded 5 similar events)
[2024-06-01 07:54:07] [INFO ] Invariant cache hit.
[2024-06-01 07:54:07] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 22 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:54:07] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:54:08] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 8/30 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 07:54:09] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 07:54:09] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 07:54:09] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 07:54:10] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:54:10] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 07:54:10] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 140 unsolved
[2024-06-01 07:54:10] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/86 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/86 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 11 (OVERLAPS) 135/221 variables, 86/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 66/189 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/221 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 14 (OVERLAPS) 1/222 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/222 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 16 (OVERLAPS) 0/222 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Real declared 222/222 variables, and 190 constraints, problems are : Problem set: 0 solved, 140 unsolved in 8288 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 140 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 4 (OVERLAPS) 135/221 variables, 86/123 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/221 variables, 66/189 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 140/329 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 8 (OVERLAPS) 1/222 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/222 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 140 unsolved
At refinement iteration 10 (OVERLAPS) 0/222 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 140 unsolved
No progress, stopping.
After SMT solving in domain Int declared 222/222 variables, and 330 constraints, problems are : Problem set: 0 solved, 140 unsolved in 6053 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 86/86 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 140/140 constraints, Known Traps: 35/35 constraints]
After SMT, in 14380ms problems are : Problem set: 0 solved, 140 unsolved
Search for dead transitions found 0 dead transitions in 14383ms
Starting structural reductions in LTL mode, iteration 1 : 86/106 places, 141/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14514 ms. Remains : 86/106 places, 141/169 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 301 ms.
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Computed a total of 26 stabilizing places and 25 stable transitions
Computed a total of 26 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 44 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-03a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-03a-LTLFireability-05 finished in 15307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p1 U p2))||p0))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 158
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 26 place count 89 transition count 148
Iterating global reduction 0 with 8 rules applied. Total rules applied 34 place count 89 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 37 place count 89 transition count 145
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 39 place count 87 transition count 143
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 87 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 87 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 86 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 86 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 85 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 85 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 84 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 84 transition count 139
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 49 place count 84 transition count 138
Applied a total of 49 rules in 9 ms. Remains 84 /106 variables (removed 22) and now considering 138/169 (removed 31) transitions.
[2024-06-01 07:54:22] [INFO ] Flow matrix only has 132 transitions (discarded 6 similar events)
// Phase 1: matrix 132 rows 84 cols
[2024-06-01 07:54:22] [INFO ] Computed 3 invariants in 1 ms
[2024-06-01 07:54:22] [INFO ] Implicit Places using invariants in 388 ms returned []
[2024-06-01 07:54:22] [INFO ] Flow matrix only has 132 transitions (discarded 6 similar events)
[2024-06-01 07:54:22] [INFO ] Invariant cache hit.
[2024-06-01 07:54:22] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-01 07:54:22] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [83]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 492 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/106 places, 138/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 72 transition count 127
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 72 transition count 127
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 72 transition count 123
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 68 transition count 119
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 68 transition count 119
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 64 transition count 115
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 64 transition count 115
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 60 transition count 111
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 60 transition count 111
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 56 transition count 107
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 56 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 53 transition count 104
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 53 transition count 104
Applied a total of 64 rules in 7 ms. Remains 53 /83 variables (removed 30) and now considering 104/138 (removed 34) transitions.
[2024-06-01 07:54:22] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
// Phase 1: matrix 98 rows 53 cols
[2024-06-01 07:54:22] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:54:22] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 07:54:22] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
[2024-06-01 07:54:22] [INFO ] Invariant cache hit.
[2024-06-01 07:54:22] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:54:22] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/106 places, 104/169 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 579 ms. Remains : 53/106 places, 104/169 transitions.
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-07
Product exploration explored 100000 steps with 3571 reset in 115 ms.
Product exploration explored 100000 steps with 3571 reset in 154 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 108 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-06-01 07:54:24] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
[2024-06-01 07:54:24] [INFO ] Invariant cache hit.
[2024-06-01 07:54:24] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:54:24] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 07:54:24] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:54:24] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-06-01 07:54:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:54:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:54:24] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 07:54:24] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-06-01 07:54:24] [INFO ] Computed and/alt/rep : 62/134/62 causal constraints (skipped 35 transitions) in 7 ms.
[2024-06-01 07:54:24] [INFO ] Added : 50 causal constraints over 11 iterations in 96 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 104/104 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-06-01 07:54:24] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
[2024-06-01 07:54:24] [INFO ] Invariant cache hit.
[2024-06-01 07:54:24] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 07:54:24] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
[2024-06-01 07:54:24] [INFO ] Invariant cache hit.
[2024-06-01 07:54:24] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:54:24] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-06-01 07:54:24] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
[2024-06-01 07:54:24] [INFO ] Invariant cache hit.
[2024-06-01 07:54:24] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:54:24] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 15 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:54:25] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 97/150 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 32/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 1/151 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/151 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 111 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3408 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 97/150 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 32/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 103/213 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 214 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 23/23 constraints]
After SMT, in 7476ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 7477ms
Finished structural reductions in LTL mode , in 1 iterations and 7556 ms. Remains : 53/53 places, 104/104 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 108 steps (0 resets) in 8 ms. (12 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-06-01 07:54:32] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
[2024-06-01 07:54:32] [INFO ] Invariant cache hit.
[2024-06-01 07:54:32] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:54:32] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 07:54:32] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:54:32] [INFO ] [Real]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-06-01 07:54:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:54:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:54:32] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-06-01 07:54:32] [INFO ] [Nat]Added 33 Read/Feed constraints in 3 ms returned sat
[2024-06-01 07:54:32] [INFO ] Computed and/alt/rep : 62/134/62 causal constraints (skipped 35 transitions) in 6 ms.
[2024-06-01 07:54:32] [INFO ] Added : 50 causal constraints over 11 iterations in 84 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 3571 reset in 143 ms.
Product exploration explored 100000 steps with 3571 reset in 85 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 104/104 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 53 transition count 104
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 13 place count 53 transition count 108
Deduced a syphon composed of 17 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 53 transition count 108
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 45 transition count 100
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 45 transition count 100
Performed 16 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 49 place count 45 transition count 103
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 72 place count 45 transition count 80
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 82 place count 35 transition count 70
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 92 place count 35 transition count 70
Deduced a syphon composed of 15 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 100 place count 35 transition count 62
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 104 place count 35 transition count 62
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 112 place count 27 transition count 54
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 2 with 8 rules applied. Total rules applied 120 place count 27 transition count 54
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 120 rules in 16 ms. Remains 27 /53 variables (removed 26) and now considering 54/104 (removed 50) transitions.
[2024-06-01 07:54:33] [INFO ] Redundant transitions in 1 ms returned []
Running 53 sub problems to find dead transitions.
[2024-06-01 07:54:33] [INFO ] Flow matrix only has 48 transitions (discarded 6 similar events)
// Phase 1: matrix 48 rows 27 cols
[2024-06-01 07:54:33] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 07:54:33] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD10 is UNSAT
Problem TDEAD14 is UNSAT
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:54:33] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 3/20 constraints. Problems are: Problem set: 2 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 51 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 TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 5 (OVERLAPS) 47/74 variables, 27/47 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 21/68 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/68 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 1/75 variables, 1/69 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/75 variables, 0/69 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/75 variables, 0/69 constraints. Problems are: Problem set: 14 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 69 constraints, problems are : Problem set: 14 solved, 39 unsolved in 1090 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 14 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 12/27 variables, 2/2 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 18/20 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/20 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 47/74 variables, 27/47 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 21/68 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 39/107 constraints. Problems are: Problem set: 14 solved, 39 unsolved
[2024-06-01 07:54:34] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 1/108 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 0/108 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 1/75 variables, 1/109 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/75 variables, 0/109 constraints. Problems are: Problem set: 14 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/75 variables, 0/109 constraints. Problems are: Problem set: 14 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 109 constraints, problems are : Problem set: 14 solved, 39 unsolved in 937 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 27/27 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 39/53 constraints, Known Traps: 19/19 constraints]
After SMT, in 2048ms problems are : Problem set: 14 solved, 39 unsolved
Search for dead transitions found 14 dead transitions in 2048ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 27/53 places, 40/104 transitions.
Graph (complete) has 72 edges and 27 vertex of which 16 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 16 /27 variables (removed 11) and now considering 40/40 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/53 places, 40/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2079 ms. Remains : 16/53 places, 40/104 transitions.
Support contains 5 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 104/104 transitions.
Applied a total of 0 rules in 0 ms. Remains 53 /53 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2024-06-01 07:54:35] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
// Phase 1: matrix 98 rows 53 cols
[2024-06-01 07:54:35] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:54:35] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 07:54:35] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
[2024-06-01 07:54:35] [INFO ] Invariant cache hit.
[2024-06-01 07:54:35] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:54:35] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2024-06-01 07:54:35] [INFO ] Flow matrix only has 98 transitions (discarded 6 similar events)
[2024-06-01 07:54:35] [INFO ] Invariant cache hit.
[2024-06-01 07:54:35] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:54:35] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 16 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:54:36] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 97/150 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 32/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 1/151 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/151 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 111 constraints, problems are : Problem set: 0 solved, 103 unsolved in 3313 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 97/150 variables, 53/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 32/110 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 103/213 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/151 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/151 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 214 constraints, problems are : Problem set: 0 solved, 103 unsolved in 4150 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 53/53 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 23/23 constraints]
After SMT, in 7502ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 7503ms
Finished structural reductions in LTL mode , in 1 iterations and 7577 ms. Remains : 53/53 places, 104/104 transitions.
Treatment of property StigmergyCommit-PT-03a-LTLFireability-07 finished in 20726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(F(p0)&&(!p1||X(p2)))))))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 157
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 89 transition count 148
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 89 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 36 place count 89 transition count 146
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 87 transition count 144
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 87 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 87 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 86 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 86 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 85 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 85 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 84 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 84 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 84 transition count 139
Applied a total of 48 rules in 13 ms. Remains 84 /106 variables (removed 22) and now considering 139/169 (removed 30) transitions.
[2024-06-01 07:54:43] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 84 cols
[2024-06-01 07:54:43] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:54:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 07:54:43] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 07:54:43] [INFO ] Invariant cache hit.
[2024-06-01 07:54:43] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 07:54:43] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2024-06-01 07:54:43] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 07:54:43] [INFO ] Invariant cache hit.
[2024-06-01 07:54:43] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:54:43] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 23 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 2 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:54:44] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 3 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 22 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 0 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 0 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 3 ms to minimize.
[2024-06-01 07:54:45] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 133/217 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 65/189 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/217 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 1/218 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (OVERLAPS) 0/218 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 190 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7175 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/84 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 133/217 variables, 84/124 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/217 variables, 65/189 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 138/327 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 1/218 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 138 unsolved
[2024-06-01 07:54:53] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/218 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 329 constraints, problems are : Problem set: 0 solved, 138 unsolved in 7243 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 84/84 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 39/39 constraints]
After SMT, in 14455ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 14456ms
Starting structural reductions in LTL mode, iteration 1 : 84/106 places, 139/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14579 ms. Remains : 84/106 places, 139/169 transitions.
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Product exploration explored 100000 steps with 50000 reset in 88 ms.
Computed a total of 26 stabilizing places and 25 stable transitions
Computed a total of 26 stabilizing places and 25 stable transitions
Detected a total of 26/84 stabilizing places and 25/139 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-03a-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-03a-LTLFireability-09 finished in 14966 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 90 transition count 149
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 90 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 90 transition count 146
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 37 place count 88 transition count 144
Iterating global reduction 1 with 2 rules applied. Total rules applied 39 place count 88 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 40 place count 88 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 87 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 87 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 86 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 86 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 85 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 85 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 85 transition count 139
Applied a total of 47 rules in 16 ms. Remains 85 /106 variables (removed 21) and now considering 139/169 (removed 30) transitions.
[2024-06-01 07:54:58] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
// Phase 1: matrix 134 rows 85 cols
[2024-06-01 07:54:58] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 07:54:58] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 07:54:58] [INFO ] Flow matrix only has 134 transitions (discarded 5 similar events)
[2024-06-01 07:54:58] [INFO ] Invariant cache hit.
[2024-06-01 07:54:58] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-01 07:54:58] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/106 places, 139/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 128
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 73 transition count 125
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 69 transition count 121
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 69 transition count 121
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 37 place count 65 transition count 117
Iterating global reduction 1 with 4 rules applied. Total rules applied 41 place count 65 transition count 117
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 45 place count 61 transition count 113
Iterating global reduction 1 with 4 rules applied. Total rules applied 49 place count 61 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 53 place count 57 transition count 109
Iterating global reduction 1 with 4 rules applied. Total rules applied 57 place count 57 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 54 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 54 transition count 106
Applied a total of 63 rules in 9 ms. Remains 54 /84 variables (removed 30) and now considering 106/139 (removed 33) transitions.
[2024-06-01 07:54:58] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
// Phase 1: matrix 101 rows 54 cols
[2024-06-01 07:54:58] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:54:58] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:54:58] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2024-06-01 07:54:58] [INFO ] Invariant cache hit.
[2024-06-01 07:54:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:54:58] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/106 places, 106/169 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 246 ms. Remains : 54/106 places, 106/169 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 79 ms.
Product exploration explored 100000 steps with 0 reset in 78 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2056 steps (3 resets) in 15 ms. (128 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-06-01 07:54:59] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2024-06-01 07:54:59] [INFO ] Invariant cache hit.
[2024-06-01 07:54:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 07:54:59] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2024-06-01 07:54:59] [INFO ] Invariant cache hit.
[2024-06-01 07:54:59] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:54:59] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 07:54:59] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2024-06-01 07:54:59] [INFO ] Invariant cache hit.
[2024-06-01 07:54:59] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 0 ms to minimize.
[2024-06-01 07:54:59] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 18 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:55:00] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 100/154 variables, 54/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:55:01] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/155 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/155 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 113 constraints, problems are : Problem set: 0 solved, 105 unsolved in 4058 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 100/154 variables, 54/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 32/112 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 105/217 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/155 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/155 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 218 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 25/25 constraints]
After SMT, in 7807ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 7808ms
Finished structural reductions in LTL mode , in 1 iterations and 7885 ms. Remains : 54/54 places, 106/106 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 2224 steps (6 resets) in 17 ms. (123 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 113 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 154 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 106/106 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 54 transition count 106
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 13 place count 54 transition count 110
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 17 place count 54 transition count 110
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 46 transition count 102
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 46 transition count 102
Performed 21 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 54 place count 46 transition count 107
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 81 place count 46 transition count 80
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 95 place count 32 transition count 66
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 109 place count 32 transition count 66
Performed 3 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 2 with 3 rules applied. Total rules applied 112 place count 32 transition count 83
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 126 place count 32 transition count 69
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 132 place count 26 transition count 57
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 3 with 6 rules applied. Total rules applied 138 place count 26 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 139 place count 26 transition count 66
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 147 place count 26 transition count 58
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 149 place count 24 transition count 54
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 151 place count 24 transition count 54
Deduced a syphon composed of 12 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 163 place count 24 transition count 42
Deduced a syphon composed of 12 places in 0 ms
Applied a total of 163 rules in 16 ms. Remains 24 /54 variables (removed 30) and now considering 42/106 (removed 64) transitions.
[2024-06-01 07:55:08] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2024-06-01 07:55:08] [INFO ] Flow matrix only has 37 transitions (discarded 5 similar events)
// Phase 1: matrix 37 rows 24 cols
[2024-06-01 07:55:08] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:55:08] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 1/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:08] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 41 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 TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
At refinement iteration 5 (OVERLAPS) 36/60 variables, 24/41 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 11/52 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/52 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/61 variables, 1/53 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/53 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/61 variables, 0/53 constraints. Problems are: Problem set: 17 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 61/61 variables, and 53 constraints, problems are : Problem set: 17 solved, 24 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 17 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 13/24 variables, 1/1 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 16/17 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/17 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 36/60 variables, 24/41 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 11/52 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 24/76 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/76 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 1/61 variables, 1/77 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/61 variables, 0/77 constraints. Problems are: Problem set: 17 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 61/61 variables, and 77 constraints, problems are : Problem set: 17 solved, 24 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 24/24 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 24/41 constraints, Known Traps: 16/16 constraints]
After SMT, in 1215ms problems are : Problem set: 17 solved, 24 unsolved
Search for dead transitions found 17 dead transitions in 1216ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 24/54 places, 25/106 transitions.
Graph (complete) has 55 edges and 24 vertex of which 12 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 12 /24 variables (removed 12) and now considering 25/25 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/54 places, 25/106 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1243 ms. Remains : 12/54 places, 25/106 transitions.
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 106/106 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2024-06-01 07:55:09] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
// Phase 1: matrix 101 rows 54 cols
[2024-06-01 07:55:09] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:55:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 07:55:09] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2024-06-01 07:55:09] [INFO ] Invariant cache hit.
[2024-06-01 07:55:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:55:09] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 105 sub problems to find dead transitions.
[2024-06-01 07:55:09] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2024-06-01 07:55:09] [INFO ] Invariant cache hit.
[2024-06-01 07:55:09] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 14 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:55:10] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:55:11] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:55:11] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:55:11] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 100/154 variables, 54/79 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 32/111 constraints. Problems are: Problem set: 0 solved, 105 unsolved
[2024-06-01 07:55:12] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/155 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/155 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 113 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3975 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 25/25 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 25/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 100/154 variables, 54/80 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 32/112 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 105/217 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (OVERLAPS) 1/155 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (OVERLAPS) 0/155 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 218 constraints, problems are : Problem set: 0 solved, 105 unsolved in 3834 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 54/54 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 25/25 constraints]
After SMT, in 7842ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 7843ms
Finished structural reductions in LTL mode , in 1 iterations and 7929 ms. Remains : 54/54 places, 106/106 transitions.
Treatment of property StigmergyCommit-PT-03a-LTLFireability-10 finished in 19717 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)&&F(p1)&&F(G(p2)))))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 106 transition count 163
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 100 transition count 161
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 14 place count 100 transition count 141
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 54 place count 80 transition count 141
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 61 place count 73 transition count 133
Iterating global reduction 2 with 7 rules applied. Total rules applied 68 place count 73 transition count 133
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 67 transition count 126
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 67 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 84 place count 67 transition count 122
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 85 place count 66 transition count 121
Iterating global reduction 3 with 1 rules applied. Total rules applied 86 place count 66 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 87 place count 66 transition count 120
Performed 17 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 121 place count 49 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 125 place count 49 transition count 97
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 132 place count 42 transition count 90
Iterating global reduction 5 with 7 rules applied. Total rules applied 139 place count 42 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 145 place count 42 transition count 84
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 150 place count 37 transition count 79
Iterating global reduction 6 with 5 rules applied. Total rules applied 155 place count 37 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 156 place count 37 transition count 78
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 160 place count 33 transition count 74
Iterating global reduction 7 with 4 rules applied. Total rules applied 164 place count 33 transition count 74
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 168 place count 31 transition count 72
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 172 place count 31 transition count 68
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 173 place count 31 transition count 68
Applied a total of 173 rules in 15 ms. Remains 31 /106 variables (removed 75) and now considering 68/169 (removed 101) transitions.
[2024-06-01 07:55:17] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
// Phase 1: matrix 62 rows 31 cols
[2024-06-01 07:55:17] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 07:55:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 07:55:17] [INFO ] Flow matrix only has 62 transitions (discarded 6 similar events)
[2024-06-01 07:55:17] [INFO ] Invariant cache hit.
[2024-06-01 07:55:17] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-06-01 07:55:17] [INFO ] Implicit Places using invariants and state equation in 55 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 84 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/106 places, 68/169 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 30 transition count 64
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 26 transition count 64
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 32 place count 14 transition count 52
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 14 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 13 transition count 50
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 50 place count 13 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 22 transitions
Redundant transition composition rules discarded 22 transitions
Iterating global reduction 4 with 22 rules applied. Total rules applied 72 place count 13 transition count 20
Applied a total of 72 rules in 3 ms. Remains 13 /30 variables (removed 17) and now considering 20/68 (removed 48) transitions.
[2024-06-01 07:55:17] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
// Phase 1: matrix 15 rows 13 cols
[2024-06-01 07:55:17] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:55:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 07:55:17] [INFO ] Flow matrix only has 15 transitions (discarded 5 similar events)
[2024-06-01 07:55:17] [INFO ] Invariant cache hit.
[2024-06-01 07:55:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 07:55:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/106 places, 20/169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 13/106 places, 20/169 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-11 finished in 293 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 97 transition count 158
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 97 transition count 158
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 90 transition count 149
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 90 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 90 transition count 147
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 88 transition count 145
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 88 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 39 place count 88 transition count 144
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 87 transition count 143
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 87 transition count 143
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 86 transition count 142
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 86 transition count 142
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 85 transition count 141
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 85 transition count 141
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 85 transition count 140
Applied a total of 46 rules in 7 ms. Remains 85 /106 variables (removed 21) and now considering 140/169 (removed 29) transitions.
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
// Phase 1: matrix 135 rows 85 cols
[2024-06-01 07:55:18] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 135 transitions (discarded 5 similar events)
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
[2024-06-01 07:55:18] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [84]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 142 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 84/106 places, 140/169 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 73 transition count 129
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 73 transition count 129
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 73 transition count 125
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 69 transition count 121
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 69 transition count 121
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 38 place count 65 transition count 117
Iterating global reduction 1 with 4 rules applied. Total rules applied 42 place count 65 transition count 117
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 61 transition count 113
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 61 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 54 place count 57 transition count 109
Iterating global reduction 1 with 4 rules applied. Total rules applied 58 place count 57 transition count 109
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 54 transition count 106
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 54 transition count 106
Applied a total of 64 rules in 6 ms. Remains 54 /84 variables (removed 30) and now considering 106/140 (removed 34) transitions.
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
// Phase 1: matrix 101 rows 54 cols
[2024-06-01 07:55:18] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 101 transitions (discarded 5 similar events)
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
[2024-06-01 07:55:18] [INFO ] State equation strengthened by 33 read => feed constraints.
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/106 places, 106/169 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 225 ms. Remains : 54/106 places, 106/169 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-12
Stuttering criterion allowed to conclude after 27 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-12 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 104 transition count 111
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 65 rules applied. Total rules applied 123 place count 47 transition count 103
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 132 place count 44 transition count 97
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 3 with 8 rules applied. Total rules applied 140 place count 41 transition count 92
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 144 place count 39 transition count 90
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 144 place count 39 transition count 86
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 152 place count 35 transition count 86
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 158 place count 29 transition count 78
Iterating global reduction 5 with 6 rules applied. Total rules applied 164 place count 29 transition count 78
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 167 place count 29 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 167 place count 29 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 171 place count 27 transition count 73
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 173 place count 25 transition count 69
Iterating global reduction 6 with 2 rules applied. Total rules applied 175 place count 25 transition count 69
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 187 place count 25 transition count 57
Performed 6 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 199 place count 19 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 203 place count 19 transition count 45
Performed 5 Post agglomeration using F-continuation condition with reduction of 34 identical transitions.
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 213 place count 14 transition count 51
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 8 with 16 rules applied. Total rules applied 229 place count 14 transition count 35
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 9 with 8 rules applied. Total rules applied 237 place count 14 transition count 27
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 240 place count 11 transition count 24
Applied a total of 240 rules in 21 ms. Remains 11 /106 variables (removed 95) and now considering 24/169 (removed 145) transitions.
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 11 cols
[2024-06-01 07:55:18] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 07:55:18] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:18] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 18/29 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/30 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 18/29 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/30 variables, and 35 constraints, problems are : Problem set: 0 solved, 11 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 396ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/106 places, 24/169 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 474 ms. Remains : 11/106 places, 24/169 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-13 finished in 526 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((G(F(!p0)) U G(!p1)))))'
Support contains 6 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 96 transition count 157
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 96 transition count 157
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 88 transition count 147
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 88 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 88 transition count 144
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 86 transition count 142
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 86 transition count 142
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 86 transition count 141
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 45 place count 85 transition count 140
Iterating global reduction 2 with 1 rules applied. Total rules applied 46 place count 85 transition count 140
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 84 transition count 139
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 84 transition count 139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 83 transition count 138
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 83 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 83 transition count 137
Applied a total of 51 rules in 7 ms. Remains 83 /106 variables (removed 23) and now considering 137/169 (removed 32) transitions.
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
// Phase 1: matrix 132 rows 83 cols
[2024-06-01 07:55:18] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 07:55:18] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 07:55:18] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-06-01 07:55:18] [INFO ] Invariant cache hit.
[2024-06-01 07:55:19] [INFO ] State equation strengthened by 65 read => feed constraints.
[2024-06-01 07:55:19] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
Running 136 sub problems to find dead transitions.
[2024-06-01 07:55:19] [INFO ] Flow matrix only has 132 transitions (discarded 5 similar events)
[2024-06-01 07:55:19] [INFO ] Invariant cache hit.
[2024-06-01 07:55:19] [INFO ] State equation strengthened by 65 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:55:19] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 22 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 22 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 18 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:55:20] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 11/33 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 131/214 variables, 83/116 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 64/180 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:55:22] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:55:22] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/214 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (OVERLAPS) 1/215 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 12 (OVERLAPS) 0/215 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 183 constraints, problems are : Problem set: 0 solved, 136 unsolved in 8119 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 136 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 33/35 constraints. Problems are: Problem set: 0 solved, 136 unsolved
[2024-06-01 07:55:27] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 07:55:27] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 131/214 variables, 83/120 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 64/184 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 136/320 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 1/215 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 321 constraints, problems are : Problem set: 0 solved, 136 unsolved in 5443 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 65/65 constraints, PredecessorRefiner: 136/136 constraints, Known Traps: 35/35 constraints]
After SMT, in 13604ms problems are : Problem set: 0 solved, 136 unsolved
Search for dead transitions found 0 dead transitions in 13605ms
Starting structural reductions in LTL mode, iteration 1 : 83/106 places, 137/169 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13734 ms. Remains : 83/106 places, 137/169 transitions.
Stuttering acceptance computed with spot in 194 ms :[p1, p1, p1, p0, (AND p0 (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-14
Stuttering criterion allowed to conclude after 294 steps with 2 reset in 3 ms.
FORMULA StigmergyCommit-PT-03a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-03a-LTLFireability-14 finished in 13954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X((p1 U p2))||p0))))'
Found a Shortening insensitive property : StigmergyCommit-PT-03a-LTLFireability-07
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 104 transition count 116
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 62 rules applied. Total rules applied 115 place count 52 transition count 106
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 11 rules applied. Total rules applied 126 place count 48 transition count 99
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 132 place count 45 transition count 96
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 132 place count 45 transition count 89
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 146 place count 38 transition count 89
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 157 place count 27 transition count 76
Iterating global reduction 4 with 11 rules applied. Total rules applied 168 place count 27 transition count 76
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 175 place count 27 transition count 69
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 175 place count 27 transition count 67
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 179 place count 25 transition count 67
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 181 place count 23 transition count 63
Iterating global reduction 5 with 2 rules applied. Total rules applied 183 place count 23 transition count 63
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 195 place count 23 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 201 place count 20 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 20 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 203 place count 19 transition count 47
Applied a total of 203 rules in 24 ms. Remains 19 /106 variables (removed 87) and now considering 47/169 (removed 122) transitions.
[2024-06-01 07:55:33] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 19 cols
[2024-06-01 07:55:33] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:55:33] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 07:55:33] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-06-01 07:55:33] [INFO ] Invariant cache hit.
[2024-06-01 07:55:33] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 07:55:33] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 07:55:33] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-06-01 07:55:33] [INFO ] Invariant cache hit.
[2024-06-01 07:55:33] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:33] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 40/59 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 938 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 43/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 19/19 constraints]
After SMT, in 1501ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1501ms
Starting structural reductions in LI_LTL mode, iteration 1 : 19/106 places, 47/169 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1576 ms. Remains : 19/106 places, 47/169 transitions.
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-07
Product exploration explored 100000 steps with 20000 reset in 95 ms.
Product exploration explored 100000 steps with 20000 reset in 107 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (NOT p0)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-06-01 07:55:35] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-06-01 07:55:35] [INFO ] Invariant cache hit.
[2024-06-01 07:55:35] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 07:55:35] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 07:55:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 07:55:35] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-06-01 07:55:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:55:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 07:55:35] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-06-01 07:55:35] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-06-01 07:55:35] [INFO ] Computed and/alt/rep : 13/69/13 causal constraints (skipped 24 transitions) in 2 ms.
[2024-06-01 07:55:35] [INFO ] Added : 4 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 47/47 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-01 07:55:35] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-06-01 07:55:35] [INFO ] Invariant cache hit.
[2024-06-01 07:55:35] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 07:55:35] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-06-01 07:55:35] [INFO ] Invariant cache hit.
[2024-06-01 07:55:35] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 07:55:35] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 07:55:35] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-06-01 07:55:35] [INFO ] Invariant cache hit.
[2024-06-01 07:55:35] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:55:35] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:55:36] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 40/59 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 43/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 19/19 constraints]
After SMT, in 1515ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1515ms
Finished structural reductions in LTL mode , in 1 iterations and 1562 ms. Remains : 19/19 places, 47/47 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 202 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p2), (F p0), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-06-01 07:55:37] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-06-01 07:55:37] [INFO ] Invariant cache hit.
[2024-06-01 07:55:37] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 07:55:37] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 07:55:37] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 07:55:37] [INFO ] [Real]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-06-01 07:55:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 07:55:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 07:55:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 07:55:37] [INFO ] [Nat]Added 23 Read/Feed constraints in 2 ms returned sat
[2024-06-01 07:55:37] [INFO ] Computed and/alt/rep : 13/69/13 causal constraints (skipped 24 transitions) in 3 ms.
[2024-06-01 07:55:37] [INFO ] Added : 4 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 20000 reset in 105 ms.
Product exploration explored 100000 steps with 20000 reset in 105 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 19/19 places, 47/47 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 19 transition count 43
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 19 transition count 43
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 8 ms. Remains 19 /19 variables (removed 0) and now considering 43/47 (removed 4) transitions.
[2024-06-01 07:55:38] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 07:55:38] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
// Phase 1: matrix 37 rows 19 cols
[2024-06-01 07:55:38] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:55:38] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
Problem TDEAD17 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 12/14 constraints. Problems are: Problem set: 1 solved, 38 unsolved
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:55:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 38 unsolved
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
At refinement iteration 5 (OVERLAPS) 36/55 variables, 19/35 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 22/57 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/57 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1/56 variables, 1/58 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/58 constraints. Problems are: Problem set: 4 solved, 35 unsolved
[2024-06-01 07:55:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/56 variables, 1/59 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/56 variables, 0/59 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 12 (OVERLAPS) 0/56 variables, 0/59 constraints. Problems are: Problem set: 4 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 59 constraints, problems are : Problem set: 4 solved, 35 unsolved in 888 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 4 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 1 (OVERLAPS) 8/19 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 15/17 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/17 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 4 (OVERLAPS) 36/55 variables, 19/36 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 22/58 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 35/93 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/93 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 8 (OVERLAPS) 1/56 variables, 1/94 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/94 constraints. Problems are: Problem set: 4 solved, 35 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/94 constraints. Problems are: Problem set: 4 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 94 constraints, problems are : Problem set: 4 solved, 35 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 35/39 constraints, Known Traps: 15/15 constraints]
After SMT, in 1401ms problems are : Problem set: 4 solved, 35 unsolved
Search for dead transitions found 4 dead transitions in 1402ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 19/19 places, 39/47 transitions.
Graph (complete) has 71 edges and 19 vertex of which 15 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 15 /19 variables (removed 4) and now considering 39/39 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/19 places, 39/47 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1419 ms. Remains : 15/19 places, 39/47 transitions.
Support contains 5 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 47/47 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-06-01 07:55:39] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
// Phase 1: matrix 41 rows 19 cols
[2024-06-01 07:55:39] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 07:55:39] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 07:55:39] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-06-01 07:55:39] [INFO ] Invariant cache hit.
[2024-06-01 07:55:39] [INFO ] State equation strengthened by 23 read => feed constraints.
[2024-06-01 07:55:39] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Running 43 sub problems to find dead transitions.
[2024-06-01 07:55:40] [INFO ] Flow matrix only has 41 transitions (discarded 6 similar events)
[2024-06-01 07:55:40] [INFO ] Invariant cache hit.
[2024-06-01 07:55:40] [INFO ] State equation strengthened by 23 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 07:55:40] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 40/59 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 63 constraints, problems are : Problem set: 0 solved, 43 unsolved in 898 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 4/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 40/59 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 22/62 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 43/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 1/60 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 106 constraints, problems are : Problem set: 0 solved, 43 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 19/19 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 19/19 constraints]
After SMT, in 1509ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1510ms
Finished structural reductions in LTL mode , in 1 iterations and 1557 ms. Remains : 19/19 places, 47/47 transitions.
Treatment of property StigmergyCommit-PT-03a-LTLFireability-07 finished in 8670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-03a-LTLFireability-10
Stuttering acceptance computed with spot in 178 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 169/169 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 58 rules applied. Total rules applied 58 place count 104 transition count 111
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 67 rules applied. Total rules applied 125 place count 47 transition count 101
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 137 place count 43 transition count 93
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 3 with 10 rules applied. Total rules applied 147 place count 39 transition count 87
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 151 place count 37 transition count 85
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 151 place count 37 transition count 81
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 159 place count 33 transition count 81
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 164 place count 28 transition count 74
Iterating global reduction 5 with 5 rules applied. Total rules applied 169 place count 28 transition count 74
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 172 place count 28 transition count 71
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 172 place count 28 transition count 69
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 176 place count 26 transition count 69
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 178 place count 24 transition count 65
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 24 transition count 65
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 192 place count 24 transition count 53
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 202 place count 19 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 206 place count 19 transition count 44
Performed 4 Post agglomeration using F-continuation condition with reduction of 34 identical transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 214 place count 15 transition count 51
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 229 place count 15 transition count 36
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 233 place count 11 transition count 32
Applied a total of 233 rules in 14 ms. Remains 11 /106 variables (removed 95) and now considering 32/169 (removed 137) transitions.
[2024-06-01 07:55:41] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 11 cols
[2024-06-01 07:55:41] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 07:55:41] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 07:55:41] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-06-01 07:55:41] [INFO ] Invariant cache hit.
[2024-06-01 07:55:41] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2024-06-01 07:55:41] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-06-01 07:55:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:55:41] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:55:42] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 26/37 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/38 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 26/37 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/38 variables, and 35 constraints, problems are : Problem set: 0 solved, 11 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
After SMT, in 446ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 446ms
Starting structural reductions in LI_LTL mode, iteration 1 : 11/106 places, 32/169 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 506 ms. Remains : 11/106 places, 32/169 transitions.
Running random walk in product with property : StigmergyCommit-PT-03a-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 41 ms.
Product exploration explored 100000 steps with 0 reset in 141 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 531 steps (46 resets) in 7 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 07:55:43] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-06-01 07:55:43] [INFO ] Invariant cache hit.
[2024-06-01 07:55:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:55:43] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-06-01 07:55:43] [INFO ] Invariant cache hit.
[2024-06-01 07:55:43] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2024-06-01 07:55:43] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-06-01 07:55:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:55:43] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 26/37 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/38 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 26/37 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/38 variables, and 35 constraints, problems are : Problem set: 0 solved, 11 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
After SMT, in 453ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 453ms
Finished structural reductions in LTL mode , in 1 iterations and 502 ms. Remains : 11/11 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 199 steps (12 resets) in 5 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 75 ms. Reduced automaton from 5 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 6 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 37 ms.
Product exploration explored 100000 steps with 0 reset in 42 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 11/11 places, 32/32 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 11 transition count 24
Applied a total of 8 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 24/32 (removed 8) transitions.
[2024-06-01 07:55:45] [INFO ] Redundant transitions in 0 ms returned []
Running 11 sub problems to find dead transitions.
[2024-06-01 07:55:45] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 11 cols
[2024-06-01 07:55:45] [INFO ] Computed 1 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 18/29 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 29/30 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 18/29 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/29 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 29/30 variables, and 35 constraints, problems are : Problem set: 0 solved, 11 unsolved in 83 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
After SMT, in 426ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 426ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/11 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 433 ms. Remains : 11/11 places, 24/32 transitions.
Support contains 1 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2024-06-01 07:55:45] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 11 cols
[2024-06-01 07:55:45] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 07:55:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 07:55:45] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-06-01 07:55:45] [INFO ] Invariant cache hit.
[2024-06-01 07:55:45] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Running 11 sub problems to find dead transitions.
[2024-06-01 07:55:45] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-06-01 07:55:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 07:55:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 26/37 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 37/38 variables, and 24 constraints, problems are : Problem set: 0 solved, 11 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 4/11 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 26/37 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 11/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/37 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 37/38 variables, and 35 constraints, problems are : Problem set: 0 solved, 11 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 11/11 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 12/12 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 444ms
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 11/11 places, 32/32 transitions.
Treatment of property StigmergyCommit-PT-03a-LTLFireability-10 finished in 4410 ms.
[2024-06-01 07:55:45] [INFO ] Flatten gal took : 9 ms
[2024-06-01 07:55:45] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 07:55:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 169 transitions and 632 arcs took 4 ms.
Total runtime 136717 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA StigmergyCommit-PT-03a-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA StigmergyCommit-PT-03a-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717228546358

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name StigmergyCommit-PT-03a-LTLFireability-07
ltl formula formula --ltl=/tmp/3333/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 106 places, 169 transitions and 632 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.030 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3333/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3333/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3333/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3333/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 107, there are 202 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3088
pnml2lts-mc( 0/ 4): unique states count: 3088
pnml2lts-mc( 0/ 4): unique transitions count: 38403
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 35482
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 3159
pnml2lts-mc( 0/ 4): - cum. max stack depth: 104
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 3159 states 39420 transitions, fanout: 12.479
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 78975, Transitions per second: 985500
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, 9.2 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 169 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-03a-LTLFireability-10
ltl formula formula --ltl=/tmp/3333/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 106 places, 169 transitions and 632 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.050 real 0.000 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3333/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3333/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3333/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3333/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 107, there are 176 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~32!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 169
pnml2lts-mc( 0/ 4): unique transitions count: 605
pnml2lts-mc( 0/ 4): - self-loop count: 68
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 173
pnml2lts-mc( 0/ 4): - claim success count: 175
pnml2lts-mc( 0/ 4): - cum. max stack depth: 81
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 175 states 652 transitions, fanout: 3.726
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 16.7 B/state, compr.: 3.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 169 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)

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-03a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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