Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 11 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.4M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716991082153

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-07a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:58:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 13:58:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:58:03] [INFO ] Load time of PNML (sax parser for PT used): 439 ms
[2024-05-29 13:58:03] [INFO ] Transformed 292 places.
[2024-05-29 13:58:04] [INFO ] Transformed 7108 transitions.
[2024-05-29 13:58:04] [INFO ] Found NUPN structural information;
[2024-05-29 13:58:04] [INFO ] Parsed PT model containing 292 places and 7108 transitions and 108222 arcs in 620 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 6218 transitions
Reduce redundant transitions removed 6218 transitions.
FORMULA StigmergyCommit-PT-07a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-07a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 292/292 places, 890/890 transitions.
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 62 place count 230 transition count 821
Iterating global reduction 0 with 62 rules applied. Total rules applied 124 place count 230 transition count 821
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 132 place count 230 transition count 813
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 161 place count 201 transition count 778
Iterating global reduction 1 with 29 rules applied. Total rules applied 190 place count 201 transition count 778
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 197 place count 201 transition count 771
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 204 place count 194 transition count 764
Iterating global reduction 2 with 7 rules applied. Total rules applied 211 place count 194 transition count 764
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 218 place count 187 transition count 757
Iterating global reduction 2 with 7 rules applied. Total rules applied 225 place count 187 transition count 757
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 231 place count 181 transition count 751
Iterating global reduction 2 with 6 rules applied. Total rules applied 237 place count 181 transition count 751
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 241 place count 177 transition count 747
Iterating global reduction 2 with 4 rules applied. Total rules applied 245 place count 177 transition count 747
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 249 place count 177 transition count 743
Applied a total of 249 rules in 95 ms. Remains 177 /292 variables (removed 115) and now considering 743/890 (removed 147) transitions.
[2024-05-29 13:58:04] [INFO ] Flow matrix only has 733 transitions (discarded 10 similar events)
// Phase 1: matrix 733 rows 177 cols
[2024-05-29 13:58:04] [INFO ] Computed 2 invariants in 26 ms
[2024-05-29 13:58:04] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-29 13:58:04] [INFO ] Flow matrix only has 733 transitions (discarded 10 similar events)
[2024-05-29 13:58:04] [INFO ] Invariant cache hit.
[2024-05-29 13:58:05] [INFO ] State equation strengthened by 588 read => feed constraints.
[2024-05-29 13:58:06] [INFO ] Implicit Places using invariants and state equation in 1169 ms returned [176]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1584 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/292 places, 743/890 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 158 transition count 725
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 158 transition count 725
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 158 transition count 719
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 50 place count 150 transition count 711
Iterating global reduction 1 with 8 rules applied. Total rules applied 58 place count 150 transition count 711
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 143 transition count 704
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 143 transition count 704
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 136 transition count 697
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 136 transition count 697
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 129 transition count 690
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 129 transition count 690
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 124 transition count 685
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 124 transition count 685
Applied a total of 110 rules in 29 ms. Remains 124 /176 variables (removed 52) and now considering 685/743 (removed 58) transitions.
[2024-05-29 13:58:06] [INFO ] Flow matrix only has 675 transitions (discarded 10 similar events)
// Phase 1: matrix 675 rows 124 cols
[2024-05-29 13:58:06] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 13:58:06] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-29 13:58:06] [INFO ] Flow matrix only has 675 transitions (discarded 10 similar events)
[2024-05-29 13:58:06] [INFO ] Invariant cache hit.
[2024-05-29 13:58:06] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:58:06] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/292 places, 685/890 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2242 ms. Remains : 124/292 places, 685/890 transitions.
Support contains 16 out of 124 places after structural reductions.
[2024-05-29 13:58:06] [INFO ] Flatten gal took : 121 ms
[2024-05-29 13:58:06] [INFO ] Flatten gal took : 76 ms
[2024-05-29 13:58:07] [INFO ] Input system was already deterministic with 685 transitions.
RANDOM walk for 40000 steps (13 resets) in 2400 ms. (16 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
[2024-05-29 13:58:07] [INFO ] Flow matrix only has 675 transitions (discarded 10 similar events)
[2024-05-29 13:58:07] [INFO ] Invariant cache hit.
[2024-05-29 13:58:07] [INFO ] State equation strengthened by 517 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 674/798 variables, 124/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 516/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/798 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/799 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/799 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/799 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 799/799 variables, and 642 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 124/124 constraints, ReadFeed: 517/517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 120/124 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:58:08] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 7 ms to minimize.
[2024-05-29 13:58:08] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 2 ms to minimize.
[2024-05-29 13:58:08] [INFO ] Deduced a trap composed of 14 places in 186 ms of which 2 ms to minimize.
[2024-05-29 13:58:09] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 2 ms to minimize.
[2024-05-29 13:58:09] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-05-29 13:58:09] [INFO ] Deduced a trap composed of 16 places in 157 ms of which 2 ms to minimize.
[2024-05-29 13:58:09] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:58:09] [INFO ] Deduced a trap composed of 13 places in 148 ms of which 1 ms to minimize.
[2024-05-29 13:58:09] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 1 ms to minimize.
[2024-05-29 13:58:09] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 8 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 16 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 14 places in 147 ms of which 1 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 1 ms to minimize.
[2024-05-29 13:58:10] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 16 places in 123 ms of which 1 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 15 places in 135 ms of which 0 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 2 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:58:11] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:58:12] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
Problem AtomicPropp6 is UNSAT
After SMT solving in domain Int declared 124/799 variables, and 41 constraints, problems are : Problem set: 1 solved, 0 unsolved in 4961 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/124 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 40/40 constraints]
After SMT, in 5394ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA StigmergyCommit-PT-07a-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 7 simplifications.
FORMULA StigmergyCommit-PT-07a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 8 stabilizing places and 8 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 685/685 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 123 transition count 645
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 83 place count 84 transition count 640
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 83 transition count 639
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 85 place count 83 transition count 629
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 105 place count 73 transition count 629
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 70 transition count 624
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 70 transition count 624
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 70 transition count 621
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 114 place count 70 transition count 620
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 69 transition count 620
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 68 transition count 618
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 68 transition count 618
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 68 transition count 614
Performed 32 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 186 place count 36 transition count 572
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 5 with 257 rules applied. Total rules applied 443 place count 36 transition count 315
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 6 with 10 rules applied. Total rules applied 453 place count 31 transition count 310
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 458 place count 31 transition count 305
Drop transitions (Redundant composition of simpler transitions.) removed 263 transitions
Redundant transition composition rules discarded 263 transitions
Iterating global reduction 7 with 263 rules applied. Total rules applied 721 place count 31 transition count 42
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 737 place count 23 transition count 34
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 739 place count 23 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 741 place count 21 transition count 32
Applied a total of 741 rules in 122 ms. Remains 21 /124 variables (removed 103) and now considering 32/685 (removed 653) transitions.
[2024-05-29 13:58:13] [INFO ] Flow matrix only has 23 transitions (discarded 9 similar events)
// Phase 1: matrix 23 rows 21 cols
[2024-05-29 13:58:13] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:58:13] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 13:58:13] [INFO ] Flow matrix only has 23 transitions (discarded 9 similar events)
[2024-05-29 13:58:13] [INFO ] Invariant cache hit.
[2024-05-29 13:58:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-29 13:58:13] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-29 13:58:13] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-29 13:58:13] [INFO ] Flow matrix only has 23 transitions (discarded 9 similar events)
[2024-05-29 13:58:13] [INFO ] Invariant cache hit.
[2024-05-29 13:58:13] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:58:13] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 8 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 7/28 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:58:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/21 variables, 2/50 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:58:15] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:58:15] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 22/43 variables, 21/73 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 8/81 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/43 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (OVERLAPS) 1/44 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 15 (OVERLAPS) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 82 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1733 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 51/51 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (OVERLAPS) 1/21 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:58:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:58:15] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (OVERLAPS) 22/43 variables, 21/75 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 8/83 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 31/114 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 1/44 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/44 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 0/44 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 115 constraints, problems are : Problem set: 0 solved, 31 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 53/53 constraints]
After SMT, in 2380ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 2380ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/124 places, 32/685 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2573 ms. Remains : 21/124 places, 32/685 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLCardinality-00
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-07a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLCardinality-00 finished in 2783 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 685/685 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 113 transition count 672
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 113 transition count 672
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 113 transition count 668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 107 transition count 661
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 107 transition count 661
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 40 place count 107 transition count 659
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 43 place count 104 transition count 656
Iterating global reduction 2 with 3 rules applied. Total rules applied 46 place count 104 transition count 656
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 102 transition count 654
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 102 transition count 654
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 101 transition count 653
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 101 transition count 653
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 53 place count 101 transition count 652
Applied a total of 53 rules in 22 ms. Remains 101 /124 variables (removed 23) and now considering 652/685 (removed 33) transitions.
[2024-05-29 13:58:16] [INFO ] Flow matrix only has 643 transitions (discarded 9 similar events)
// Phase 1: matrix 643 rows 101 cols
[2024-05-29 13:58:16] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:58:16] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-29 13:58:16] [INFO ] Flow matrix only has 643 transitions (discarded 9 similar events)
[2024-05-29 13:58:16] [INFO ] Invariant cache hit.
[2024-05-29 13:58:16] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:58:16] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
Running 651 sub problems to find dead transitions.
[2024-05-29 13:58:16] [INFO ] Flow matrix only has 643 transitions (discarded 9 similar events)
[2024-05-29 13:58:16] [INFO ] Invariant cache hit.
[2024-05-29 13:58:16] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:26] [INFO ] Deduced a trap composed of 14 places in 139 ms of which 0 ms to minimize.
[2024-05-29 13:58:26] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 0 ms to minimize.
[2024-05-29 13:58:27] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:58:27] [INFO ] Deduced a trap composed of 17 places in 459 ms of which 1 ms to minimize.
[2024-05-29 13:58:27] [INFO ] Deduced a trap composed of 14 places in 170 ms of which 1 ms to minimize.
[2024-05-29 13:58:27] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:58:28] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 0 ms to minimize.
[2024-05-29 13:58:28] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 1 ms to minimize.
[2024-05-29 13:58:28] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 0 ms to minimize.
[2024-05-29 13:58:28] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2024-05-29 13:58:28] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
[2024-05-29 13:58:28] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 0 ms to minimize.
[2024-05-29 13:58:28] [INFO ] Deduced a trap composed of 13 places in 133 ms of which 1 ms to minimize.
[2024-05-29 13:58:29] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:58:29] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
[2024-05-29 13:58:29] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:58:29] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:58:29] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 13:58:29] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-05-29 13:58:29] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:30] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 13:58:30] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:58:30] [INFO ] Deduced a trap composed of 13 places in 105 ms of which 1 ms to minimize.
[2024-05-29 13:58:30] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 0 ms to minimize.
[2024-05-29 13:58:30] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:58:30] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2024-05-29 13:58:30] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:58:30] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 13:58:31] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:58:32] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:58:32] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:33] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 0 ms to minimize.
[2024-05-29 13:58:33] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2024-05-29 13:58:33] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:58:33] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 1 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 0 ms to minimize.
[2024-05-29 13:58:34] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 0 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:58:35] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:58:36] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:58:36] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:58:36] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:58:36] [INFO ] Deduced a trap composed of 17 places in 162 ms of which 1 ms to minimize.
[2024-05-29 13:58:36] [INFO ] Deduced a trap composed of 16 places in 166 ms of which 1 ms to minimize.
[2024-05-29 13:58:36] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:58:36] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 0 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 16 places in 145 ms of which 1 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 2 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 0 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:58:37] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:58:38] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:58:38] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:38] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:58:38] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:58:38] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:42] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:58:42] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:58:42] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:58:42] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:58:42] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:58:42] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:58:44] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 10 ms to minimize.
[2024-05-29 13:58:44] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 8/92 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:44] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:46] [INFO ] Deduced a trap composed of 17 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:58:46] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:58:47] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:50] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:58:50] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 13:58:50] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:52] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 0 ms to minimize.
[2024-05-29 13:58:52] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 101/744 variables, and 101 constraints, problems are : Problem set: 0 solved, 651 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/101 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 651 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:58:57] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:58:57] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:59:01] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 651 unsolved
[2024-05-29 13:59:06] [INFO ] Deduced a trap composed of 17 places in 101 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 7 (OVERLAPS) 642/743 variables, 101/206 constraints. Problems are: Problem set: 0 solved, 651 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/743 variables, 516/722 constraints. Problems are: Problem set: 0 solved, 651 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/744 variables, and 1373 constraints, problems are : Problem set: 0 solved, 651 unsolved in 32455 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 651/651 constraints, Known Traps: 104/104 constraints]
After SMT, in 69322ms problems are : Problem set: 0 solved, 651 unsolved
Search for dead transitions found 0 dead transitions in 69334ms
Starting structural reductions in LTL mode, iteration 1 : 101/124 places, 652/685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69864 ms. Remains : 101/124 places, 652/685 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Product exploration explored 100000 steps with 50000 reset in 158 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, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 27 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-07a-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-07a-LTLCardinality-05 finished in 70476 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(p1)&&p0)))'
Support contains 3 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 685/685 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 115 transition count 675
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 115 transition count 675
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 115 transition count 673
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 25 place count 110 transition count 668
Iterating global reduction 1 with 5 rules applied. Total rules applied 30 place count 110 transition count 668
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 32 place count 110 transition count 666
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 108 transition count 664
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 108 transition count 664
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 38 place count 106 transition count 662
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 106 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 105 transition count 661
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 105 transition count 661
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 105 transition count 660
Applied a total of 43 rules in 13 ms. Remains 105 /124 variables (removed 19) and now considering 660/685 (removed 25) transitions.
[2024-05-29 13:59:26] [INFO ] Flow matrix only has 650 transitions (discarded 10 similar events)
// Phase 1: matrix 650 rows 105 cols
[2024-05-29 13:59:26] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 13:59:26] [INFO ] Implicit Places using invariants in 229 ms returned []
[2024-05-29 13:59:26] [INFO ] Flow matrix only has 650 transitions (discarded 10 similar events)
[2024-05-29 13:59:26] [INFO ] Invariant cache hit.
[2024-05-29 13:59:27] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 13:59:27] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
Running 659 sub problems to find dead transitions.
[2024-05-29 13:59:27] [INFO ] Flow matrix only has 650 transitions (discarded 10 similar events)
[2024-05-29 13:59:27] [INFO ] Invariant cache hit.
[2024-05-29 13:59:27] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 13 places in 158 ms of which 1 ms to minimize.
[2024-05-29 13:59:38] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 0 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 13 places in 160 ms of which 0 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 18 places in 131 ms of which 0 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 14 places in 136 ms of which 1 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 13:59:39] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 1 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 1 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 13 places in 114 ms of which 1 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 13:59:40] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 0 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:59:41] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 0 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:59:42] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:59:44] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 16 places in 152 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:59:45] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 0 ms to minimize.
[2024-05-29 13:59:46] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:59:46] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:59:46] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:59:46] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:59:46] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:59:46] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:59:46] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:59:46] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:59:47] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:59:48] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:59:48] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 19/80 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 13:59:49] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:59:49] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 1 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:59:50] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:59:51] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 13/93 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 8 (OVERLAPS) 649/754 variables, 105/198 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 516/714 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 754/755 variables, and 714 constraints, problems are : Problem set: 0 solved, 659 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 659 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 14:00:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 14:00:08] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 0 ms to minimize.
[2024-05-29 14:00:08] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 1 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 1 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 14:00:09] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-05-29 14:00:10] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 9/102 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 14:00:14] [INFO ] Deduced a trap composed of 17 places in 139 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 14:00:18] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2024-05-29 14:00:18] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 659 unsolved
[2024-05-29 14:00:26] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 8 (OVERLAPS) 649/754 variables, 105/211 constraints. Problems are: Problem set: 0 solved, 659 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/754 variables, 516/727 constraints. Problems are: Problem set: 0 solved, 659 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 754/755 variables, and 1386 constraints, problems are : Problem set: 0 solved, 659 unsolved in 32512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 659/659 constraints, Known Traps: 105/105 constraints]
After SMT, in 70026ms problems are : Problem set: 0 solved, 659 unsolved
Search for dead transitions found 0 dead transitions in 70038ms
Starting structural reductions in LTL mode, iteration 1 : 105/124 places, 660/685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70931 ms. Remains : 105/124 places, 660/685 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-07a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLCardinality-06 finished in 71145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 685/685 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 124 transition count 645
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 85 place count 84 transition count 640
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 87 place count 83 transition count 639
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 87 place count 83 transition count 630
Deduced a syphon composed of 9 places in 17 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 105 place count 74 transition count 630
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 71 transition count 625
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 71 transition count 625
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 71 transition count 622
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 114 place count 71 transition count 621
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 116 place count 70 transition count 621
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 117 place count 69 transition count 619
Iterating global reduction 4 with 1 rules applied. Total rules applied 118 place count 69 transition count 619
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 122 place count 69 transition count 615
Performed 40 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 5 with 80 rules applied. Total rules applied 202 place count 29 transition count 558
Ensure Unique test removed 256 transitions
Reduce isomorphic transitions removed 256 transitions.
Iterating post reduction 5 with 256 rules applied. Total rules applied 458 place count 29 transition count 302
Drop transitions (Redundant composition of simpler transitions.) removed 263 transitions
Redundant transition composition rules discarded 263 transitions
Iterating global reduction 6 with 263 rules applied. Total rules applied 721 place count 29 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 737 place count 21 transition count 31
Applied a total of 737 rules in 114 ms. Remains 21 /124 variables (removed 103) and now considering 31/685 (removed 654) transitions.
[2024-05-29 14:00:37] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
// Phase 1: matrix 23 rows 21 cols
[2024-05-29 14:00:37] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 14:00:38] [INFO ] Implicit Places using invariants in 287 ms returned []
[2024-05-29 14:00:38] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 14:00:38] [INFO ] Invariant cache hit.
[2024-05-29 14:00:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 14:00:38] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-29 14:00:38] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-29 14:00:38] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 14:00:38] [INFO ] Invariant cache hit.
[2024-05-29 14:00:38] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 14:00:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:39] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 22/43 variables, 21/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/44 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 82 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1961 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:00:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:00:40] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:00:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 22/43 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/44 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 117 constraints, problems are : Problem set: 0 solved, 30 unsolved in 917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 55/55 constraints]
After SMT, in 2911ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 2911ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/124 places, 31/685 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3347 ms. Remains : 21/124 places, 31/685 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLCardinality-08
Product exploration explored 100000 steps with 2 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 98 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-29 14:00:41] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 14:00:41] [INFO ] Invariant cache hit.
[2024-05-29 14:00:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-29 14:00:41] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 14:00:41] [INFO ] Invariant cache hit.
[2024-05-29 14:00:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 14:00:42] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-29 14:00:42] [INFO ] Redundant transitions in 1 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-29 14:00:42] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 14:00:42] [INFO ] Invariant cache hit.
[2024-05-29 14:00:42] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:00:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:43] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 22/43 variables, 21/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/44 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 82 constraints, problems are : Problem set: 0 solved, 30 unsolved in 1983 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 14:00:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:00:44] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:00:44] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 22/43 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/44 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 117 constraints, problems are : Problem set: 0 solved, 30 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 55/55 constraints]
After SMT, in 2953ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 2963ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3040 ms. Remains : 21/21 places, 31/31 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (NOT p0)), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 49 ms.
Product exploration explored 100000 steps with 0 reset in 167 ms.
Support contains 2 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-29 14:00:45] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 14:00:45] [INFO ] Invariant cache hit.
[2024-05-29 14:00:45] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 14:00:45] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 14:00:45] [INFO ] Invariant cache hit.
[2024-05-29 14:00:45] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-29 14:00:45] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-29 14:00:45] [INFO ] Redundant transitions in 0 ms returned []
Running 30 sub problems to find dead transitions.
[2024-05-29 14:00:45] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 14:00:45] [INFO ] Invariant cache hit.
[2024-05-29 14:00:45] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:00:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 19/39 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 14:00:47] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 12/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 22/43 variables, 21/72 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 9/81 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/44 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 44/44 variables, and 82 constraints, problems are : Problem set: 0 solved, 30 unsolved in 2365 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 30 unsolved
[2024-05-29 14:00:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 14:00:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 14:00:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 14:00:48] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 22/43 variables, 21/77 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 30/116 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 9 (OVERLAPS) 1/44 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/44 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 11 (OVERLAPS) 0/44 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 44/44 variables, and 117 constraints, problems are : Problem set: 0 solved, 30 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 55/55 constraints]
After SMT, in 3357ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 3359ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3518 ms. Remains : 21/21 places, 31/31 transitions.
Treatment of property StigmergyCommit-PT-07a-LTLCardinality-08 finished in 11605 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 124/124 places, 685/685 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 123 transition count 643
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 87 place count 82 transition count 638
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 81 transition count 637
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 89 place count 81 transition count 628
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 107 place count 72 transition count 628
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 109 place count 70 transition count 625
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 70 transition count 625
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 112 place count 70 transition count 624
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 112 place count 70 transition count 623
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 114 place count 69 transition count 623
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 115 place count 68 transition count 621
Iterating global reduction 4 with 1 rules applied. Total rules applied 116 place count 68 transition count 621
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 118 place count 68 transition count 619
Performed 32 Post agglomeration using F-continuation condition with reduction of 13 identical transitions.
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 182 place count 36 transition count 574
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 5 with 68 rules applied. Total rules applied 250 place count 36 transition count 506
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 6 with 10 rules applied. Total rules applied 260 place count 31 transition count 501
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 265 place count 31 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 438 transitions
Redundant transition composition rules discarded 438 transitions
Iterating global reduction 7 with 438 rules applied. Total rules applied 703 place count 31 transition count 58
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 719 place count 23 transition count 50
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 722 place count 20 transition count 47
Applied a total of 722 rules in 136 ms. Remains 20 /124 variables (removed 104) and now considering 47/685 (removed 638) transitions.
[2024-05-29 14:00:49] [INFO ] Flow matrix only has 39 transitions (discarded 8 similar events)
// Phase 1: matrix 39 rows 20 cols
[2024-05-29 14:00:49] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 14:00:49] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-29 14:00:49] [INFO ] Flow matrix only has 39 transitions (discarded 8 similar events)
[2024-05-29 14:00:49] [INFO ] Invariant cache hit.
[2024-05-29 14:00:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 14:00:49] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-05-29 14:00:49] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-29 14:00:49] [INFO ] Flow matrix only has 39 transitions (discarded 8 similar events)
[2024-05-29 14:00:49] [INFO ] Invariant cache hit.
[2024-05-29 14:00:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 8/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 14:00:50] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 14:00:51] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 14:00:51] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:51] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 14:00:51] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 14:00:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 14:00:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 14:00:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 10/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 38/58 variables, 20/53 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 1/59 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-29 14:00:51] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/59 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 59/59 variables, and 55 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 33/33 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 8/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 38/58 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 1/59 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/59 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 59/59 variables, and 75 constraints, problems are : Problem set: 0 solved, 20 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 33/33 constraints]
After SMT, in 1834ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1834ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/124 places, 47/685 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2290 ms. Remains : 20/124 places, 47/685 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLCardinality-09
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-07a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-07a-LTLCardinality-09 finished in 2368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (!p0||G(p1)))))'
Support contains 2 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 685/685 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 112 transition count 671
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 112 transition count 671
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 112 transition count 667
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 34 place count 106 transition count 660
Iterating global reduction 1 with 6 rules applied. Total rules applied 40 place count 106 transition count 660
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 106 transition count 658
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 103 transition count 655
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 103 transition count 655
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 50 place count 101 transition count 653
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 101 transition count 653
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 100 transition count 652
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 100 transition count 652
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 100 transition count 651
Applied a total of 55 rules in 19 ms. Remains 100 /124 variables (removed 24) and now considering 651/685 (removed 34) transitions.
[2024-05-29 14:00:51] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
// Phase 1: matrix 642 rows 100 cols
[2024-05-29 14:00:51] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 14:00:52] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-29 14:00:52] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 14:00:52] [INFO ] Invariant cache hit.
[2024-05-29 14:00:52] [INFO ] State equation strengthened by 517 read => feed constraints.
[2024-05-29 14:00:52] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 650 sub problems to find dead transitions.
[2024-05-29 14:00:52] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 14:00:52] [INFO ] Invariant cache hit.
[2024-05-29 14:00:52] [INFO ] State equation strengthened by 517 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 14:01:03] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 1 ms to minimize.
[2024-05-29 14:01:03] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:01:03] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 0 ms to minimize.
[2024-05-29 14:01:03] [INFO ] Deduced a trap composed of 14 places in 166 ms of which 1 ms to minimize.
[2024-05-29 14:01:03] [INFO ] Deduced a trap composed of 14 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:01:04] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 1 ms to minimize.
[2024-05-29 14:01:04] [INFO ] Deduced a trap composed of 13 places in 144 ms of which 0 ms to minimize.
[2024-05-29 14:01:04] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2024-05-29 14:01:04] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 1 ms to minimize.
[2024-05-29 14:01:04] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 1 ms to minimize.
[2024-05-29 14:01:04] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:01:05] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 4 ms to minimize.
[2024-05-29 14:01:05] [INFO ] Deduced a trap composed of 14 places in 332 ms of which 0 ms to minimize.
[2024-05-29 14:01:05] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 0 ms to minimize.
[2024-05-29 14:01:05] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:01:05] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2024-05-29 14:01:05] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 0 ms to minimize.
[2024-05-29 14:01:05] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 1 ms to minimize.
[2024-05-29 14:01:06] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2024-05-29 14:01:06] [INFO ] Deduced a trap composed of 14 places in 131 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 14:01:06] [INFO ] Deduced a trap composed of 13 places in 109 ms of which 1 ms to minimize.
[2024-05-29 14:01:06] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:01:06] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 14:01:06] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:01:06] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:01:07] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 14:01:08] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:01:08] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 14:01:08] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:01:08] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 1 ms to minimize.
[2024-05-29 14:01:08] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 14:01:09] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 14:01:09] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 0 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 14:01:10] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 0 ms to minimize.
[2024-05-29 14:01:11] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 14:01:11] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 14:01:11] [INFO ] Deduced a trap composed of 15 places in 96 ms of which 1 ms to minimize.
[2024-05-29 14:01:11] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 14:01:11] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 14:01:13] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 1 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 0 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 1 ms to minimize.
[2024-05-29 14:01:14] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 14:01:15] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 14:01:15] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 0 ms to minimize.
[2024-05-29 14:01:15] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/100 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 14:01:15] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 14:01:15] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-29 14:01:15] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 0 ms to minimize.
[2024-05-29 14:01:16] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 14:01:16] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 14:01:16] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 14:01:16] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 0 ms to minimize.
[2024-05-29 14:01:16] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-29 14:01:17] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2024-05-29 14:01:18] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 14:01:18] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 14:01:18] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 12/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 8 (OVERLAPS) 641/741 variables, 100/193 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/741 variables, 516/709 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 741/742 variables, and 709 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 650 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 92/93 constraints. Problems are: Problem set: 0 solved, 650 unsolved
[2024-05-29 14:01:35] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/100 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 5 (OVERLAPS) 641/741 variables, 100/194 constraints. Problems are: Problem set: 0 solved, 650 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/741 variables, 516/710 constraints. Problems are: Problem set: 0 solved, 650 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 741/742 variables, and 1360 constraints, problems are : Problem set: 0 solved, 650 unsolved in 30774 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 516/517 constraints, PredecessorRefiner: 650/650 constraints, Known Traps: 93/93 constraints]
After SMT, in 68699ms problems are : Problem set: 0 solved, 650 unsolved
Search for dead transitions found 0 dead transitions in 68706ms
Starting structural reductions in LTL mode, iteration 1 : 100/124 places, 651/685 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69423 ms. Remains : 100/124 places, 651/685 transitions.
Stuttering acceptance computed with spot in 196 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-07a-LTLCardinality-15
Product exploration explored 100000 steps with 24966 reset in 261 ms.
Product exploration explored 100000 steps with 25053 reset in 383 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 184 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1), false, false]
RANDOM walk for 40000 steps (15 resets) in 1401 ms. (28 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
[2024-05-29 14:02:03] [INFO ] Flow matrix only has 642 transitions (discarded 9 similar events)
[2024-05-29 14:02:03] [INFO ] Invariant cache hit.
[2024-05-29 14:02:03] [INFO ] State equation strengthened by 517 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) 98/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-29 14:02:03] [INFO ] Deduced a trap composed of 13 places in 256 ms of which 1 ms to minimize.
[2024-05-29 14:02:03] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 1 ms to minimize.
[2024-05-29 14:02:03] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 1 ms to minimize.
[2024-05-29 14:02:03] [INFO ] Deduced a trap composed of 13 places in 162 ms of which 1 ms to minimize.
[2024-05-29 14:02:04] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 14:02:04] [INFO ] Deduced a trap composed of 13 places in 157 ms of which 1 ms to minimize.
[2024-05-29 14:02:04] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:02:04] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 1 ms to minimize.
[2024-05-29 14:02:04] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 741/742 variables, and 110 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1760 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, ReadFeed: 0/517 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1778ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 12 factoid took 186 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-07a-LTLCardinality-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-07a-LTLCardinality-15 finished in 73203 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)))'
[2024-05-29 14:02:05] [INFO ] Flatten gal took : 65 ms
[2024-05-29 14:02:05] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-05-29 14:02:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 685 transitions and 8643 arcs took 33 ms.
Total runtime 241916 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-07a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 124
TRANSITIONS: 685
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.040s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2731
MODEL NAME: /home/mcc/execution/412/model
124 places, 685 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-07a-LTLCardinality-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716991329244

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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