Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 155M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K 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.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 11 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 17:53 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 155M 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-10a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717239088906

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:51:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 10:51:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:51:35] [INFO ] Load time of PNML (sax parser for PT used): 5092 ms
[2024-06-01 10:51:35] [INFO ] Transformed 400 places.
[2024-06-01 10:51:36] [INFO ] Transformed 136960 transitions.
[2024-06-01 10:51:36] [INFO ] Found NUPN structural information;
[2024-06-01 10:51:36] [INFO ] Parsed PT model containing 400 places and 136960 transitions and 3002181 arcs in 5963 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-10a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 4615/4615 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 318 transition count 4523
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 318 transition count 4523
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 174 place count 318 transition count 4513
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 214 place count 278 transition count 4465
Iterating global reduction 1 with 40 rules applied. Total rules applied 254 place count 278 transition count 4465
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 264 place count 278 transition count 4455
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 273 place count 269 transition count 4446
Iterating global reduction 2 with 9 rules applied. Total rules applied 282 place count 269 transition count 4446
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 290 place count 261 transition count 4438
Iterating global reduction 2 with 8 rules applied. Total rules applied 298 place count 261 transition count 4438
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 303 place count 256 transition count 4433
Iterating global reduction 2 with 5 rules applied. Total rules applied 308 place count 256 transition count 4433
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 313 place count 251 transition count 4428
Iterating global reduction 2 with 5 rules applied. Total rules applied 318 place count 251 transition count 4428
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 323 place count 251 transition count 4423
Applied a total of 323 rules in 233 ms. Remains 251 /400 variables (removed 149) and now considering 4423/4615 (removed 192) transitions.
[2024-06-01 10:51:37] [INFO ] Flow matrix only has 4410 transitions (discarded 13 similar events)
// Phase 1: matrix 4410 rows 251 cols
[2024-06-01 10:51:37] [INFO ] Computed 2 invariants in 68 ms
[2024-06-01 10:51:38] [INFO ] Implicit Places using invariants in 1390 ms returned []
[2024-06-01 10:51:38] [INFO ] Flow matrix only has 4410 transitions (discarded 13 similar events)
[2024-06-01 10:51:38] [INFO ] Invariant cache hit.
[2024-06-01 10:51:39] [INFO ] State equation strengthened by 4203 read => feed constraints.
[2024-06-01 10:51:43] [INFO ] Implicit Places using invariants and state equation in 5015 ms returned [250]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 6478 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 250/400 places, 4423/4615 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 224 transition count 4397
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 224 transition count 4397
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 61 place count 224 transition count 4388
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 213 transition count 4377
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 213 transition count 4377
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 93 place count 203 transition count 4367
Iterating global reduction 1 with 10 rules applied. Total rules applied 103 place count 203 transition count 4367
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 112 place count 194 transition count 4358
Iterating global reduction 1 with 9 rules applied. Total rules applied 121 place count 194 transition count 4358
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 130 place count 185 transition count 4349
Iterating global reduction 1 with 9 rules applied. Total rules applied 139 place count 185 transition count 4349
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 146 place count 178 transition count 4342
Iterating global reduction 1 with 7 rules applied. Total rules applied 153 place count 178 transition count 4342
Applied a total of 153 rules in 113 ms. Remains 178 /250 variables (removed 72) and now considering 4342/4423 (removed 81) transitions.
[2024-06-01 10:51:43] [INFO ] Flow matrix only has 4329 transitions (discarded 13 similar events)
// Phase 1: matrix 4329 rows 178 cols
[2024-06-01 10:51:43] [INFO ] Computed 1 invariants in 33 ms
[2024-06-01 10:51:44] [INFO ] Implicit Places using invariants in 1028 ms returned []
[2024-06-01 10:51:44] [INFO ] Flow matrix only has 4329 transitions (discarded 13 similar events)
[2024-06-01 10:51:44] [INFO ] Invariant cache hit.
[2024-06-01 10:51:46] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:51:47] [INFO ] Implicit Places using invariants and state equation in 2786 ms returned []
Implicit Place search using SMT with State Equation took 3824 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 178/400 places, 4342/4615 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 10681 ms. Remains : 178/400 places, 4342/4615 transitions.
Support contains 22 out of 178 places after structural reductions.
[2024-06-01 10:51:48] [INFO ] Flatten gal took : 510 ms
[2024-06-01 10:51:48] [INFO ] Flatten gal took : 294 ms
[2024-06-01 10:51:49] [INFO ] Input system was already deterministic with 4342 transitions.
Reduction of identical properties reduced properties to check from 14 to 13
RANDOM walk for 40000 steps (9 resets) in 12482 ms. (3 steps per ms) remains 7/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
[2024-06-01 10:51:52] [INFO ] Flow matrix only has 4329 transitions (discarded 13 similar events)
[2024-06-01 10:51:52] [INFO ] Invariant cache hit.
[2024-06-01 10:51:53] [INFO ] State equation strengthened by 4104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 167/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 4328/4506 variables, 178/179 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4506 variables, 4103/4282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4506 variables, 0/4282 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/4507 variables, 1/4283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4507 variables, 0/4283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/4507 variables, 0/4283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4507/4507 variables, and 4283 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2776 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 178/178 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 167/178 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 10:51:58] [INFO ] Deduced a trap composed of 15 places in 1618 ms of which 16 ms to minimize.
[2024-06-01 10:52:00] [INFO ] Deduced a trap composed of 13 places in 1578 ms of which 5 ms to minimize.
[2024-06-01 10:52:01] [INFO ] Deduced a trap composed of 14 places in 1475 ms of which 2 ms to minimize.
[2024-06-01 10:52:03] [INFO ] Deduced a trap composed of 14 places in 1578 ms of which 2 ms to minimize.
SMT process timed out in 10263ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Graph (complete) has 596 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.36 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 177 transition count 4257
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 76 rules applied. Total rules applied 161 place count 117 transition count 4241
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 168 place count 110 transition count 4241
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 168 place count 110 transition count 4235
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 180 place count 104 transition count 4235
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 195 place count 89 transition count 4218
Iterating global reduction 3 with 15 rules applied. Total rules applied 210 place count 89 transition count 4218
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 217 place count 89 transition count 4211
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 223 place count 83 transition count 4205
Iterating global reduction 4 with 6 rules applied. Total rules applied 229 place count 83 transition count 4205
Performed 48 Post agglomeration using F-continuation condition with reduction of 3806 identical transitions.
Deduced a syphon composed of 48 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 327 place count 33 transition count 351
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 263 transitions
Reduce isomorphic transitions removed 283 transitions.
Iterating post reduction 4 with 283 rules applied. Total rules applied 610 place count 33 transition count 68
Performed 2 Post agglomeration using F-continuation condition with reduction of 8 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 615 place count 30 transition count 58
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 631 place count 30 transition count 42
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 6 with 9 rules applied. Total rules applied 640 place count 30 transition count 33
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 644 place count 28 transition count 31
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 646 place count 28 transition count 29
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 648 place count 26 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 649 place count 25 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 650 place count 24 transition count 28
Applied a total of 650 rules in 429 ms. Remains 24 /178 variables (removed 154) and now considering 28/4342 (removed 4314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 430 ms. Remains : 24/178 places, 28/4342 transitions.
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 2/2 properties
// Phase 1: matrix 28 rows 24 cols
[2024-06-01 10:52:03] [INFO ] Computed 7 invariants in 1 ms
[2024-06-01 10:52:03] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/27 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 3/30 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/34 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/34 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 14/48 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 4/52 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/52 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/52 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/52 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 39 constraints, problems are : Problem set: 0 solved, 2 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 10:52:03] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:03] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:03] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/27 variables, 12/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 4/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/30 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/30 variables, 1/26 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 10:52:03] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/30 variables, 1/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/30 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/34 variables, 4/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/34 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 14/48 variables, 6/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/48 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 10:52:03] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:04] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/48 variables, 2/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/48 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/52 variables, 2/42 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/52 variables, 4/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/52 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/52 variables, 0/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 46 constraints, problems are : Problem set: 1 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 6/6 constraints]
After SMT, in 245ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 24 transition count 22
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 18 transition count 21
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 15 place count 16 transition count 19
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 16 transition count 19
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 16 transition count 17
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 9 rules applied. Total rules applied 28 place count 10 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 30 place count 10 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 33 place count 8 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 35 place count 8 transition count 9
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 36 place count 8 transition count 8
Applied a total of 36 rules in 5 ms. Remains 8 /24 variables (removed 16) and now considering 8/28 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 8/24 places, 8/28 transitions.
RANDOM walk for 40000 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 15 ms. (steps per millisecond=0 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
Computed a total of 11 stabilizing places and 11 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' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 178 transition count 4280
Reduce places removed 62 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 66 rules applied. Total rules applied 128 place count 116 transition count 4276
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 130 place count 115 transition count 4275
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 130 place count 115 transition count 4262
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 156 place count 102 transition count 4262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 99 transition count 4257
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 99 transition count 4257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 165 place count 99 transition count 4254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 165 place count 99 transition count 4253
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 98 transition count 4253
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 168 place count 97 transition count 4251
Iterating global reduction 4 with 1 rules applied. Total rules applied 169 place count 97 transition count 4251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 173 place count 97 transition count 4247
Performed 55 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 55 places in 2 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 5 with 110 rules applied. Total rules applied 283 place count 42 transition count 4166
Ensure Unique test removed 1027 transitions
Reduce isomorphic transitions removed 1027 transitions.
Iterating post reduction 5 with 1027 rules applied. Total rules applied 1310 place count 42 transition count 3139
Drop transitions (Redundant composition of simpler transitions.) removed 3051 transitions
Redundant transition composition rules discarded 3051 transitions
Iterating global reduction 6 with 3051 rules applied. Total rules applied 4361 place count 42 transition count 88
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 4383 place count 31 transition count 77
Applied a total of 4383 rules in 1495 ms. Remains 31 /178 variables (removed 147) and now considering 77/4342 (removed 4265) transitions.
[2024-06-01 10:52:05] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
// Phase 1: matrix 66 rows 31 cols
[2024-06-01 10:52:05] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 10:52:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-06-01 10:52:05] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-06-01 10:52:05] [INFO ] Invariant cache hit.
[2024-06-01 10:52:05] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 10:52:05] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-06-01 10:52:05] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-06-01 10:52:05] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-06-01 10:52:05] [INFO ] Invariant cache hit.
[2024-06-01 10:52:05] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 2 ms to minimize.
[2024-06-01 10:52:06] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 2 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:52:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 65/96 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 44/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/97 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 117 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3056 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:09] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:52:10] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 65/96 variables, 31/112 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 76/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/97 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 233 constraints, problems are : Problem set: 0 solved, 76 unsolved in 6695 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 80/80 constraints]
After SMT, in 9878ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 9880ms
Starting structural reductions in SI_LTL mode, iteration 1 : 31/178 places, 77/4342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11514 ms. Remains : 31/178 places, 77/4342 transitions.
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 139 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 : [(AND p0 p1), (X p0), (X (NOT p1)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 88 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 1262 steps (37 resets) in 15 ms. (78 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT p1)), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 147 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 77/77 transitions.
Applied a total of 0 rules in 8 ms. Remains 31 /31 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-06-01 10:52:17] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-06-01 10:52:17] [INFO ] Invariant cache hit.
[2024-06-01 10:52:17] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 10:52:17] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-06-01 10:52:17] [INFO ] Invariant cache hit.
[2024-06-01 10:52:17] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 10:52:17] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-06-01 10:52:17] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-06-01 10:52:17] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-06-01 10:52:17] [INFO ] Invariant cache hit.
[2024-06-01 10:52:17] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:17] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:52:18] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 65/96 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 44/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/97 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 117 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2940 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:52:20] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 65/96 variables, 31/112 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 76/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/97 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 233 constraints, problems are : Problem set: 0 solved, 76 unsolved in 6793 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 80/80 constraints]
After SMT, in 9861ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 9863ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10001 ms. Remains : 31/31 places, 77/77 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 : [(AND p0 p1), (X p0), (X (NOT p1)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 519 steps (18 resets) in 9 ms. (51 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (NOT p1)), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 87 ms.
Product exploration explored 100000 steps with 0 reset in 152 ms.
Support contains 4 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 77/77 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2024-06-01 10:52:28] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-06-01 10:52:28] [INFO ] Invariant cache hit.
[2024-06-01 10:52:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-06-01 10:52:28] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-06-01 10:52:28] [INFO ] Invariant cache hit.
[2024-06-01 10:52:28] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-06-01 10:52:28] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-06-01 10:52:28] [INFO ] Redundant transitions in 1 ms returned []
Running 76 sub problems to find dead transitions.
[2024-06-01 10:52:28] [INFO ] Flow matrix only has 66 transitions (discarded 11 similar events)
[2024-06-01 10:52:28] [INFO ] Invariant cache hit.
[2024-06-01 10:52:28] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:28] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-06-01 10:52:29] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 65/96 variables, 31/72 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 44/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/97 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/97 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 117 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2999 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 40/41 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:52:31] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 4 ms to minimize.
[2024-06-01 10:52:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 65/96 variables, 31/112 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 44/156 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 76/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 1/97 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 12 (OVERLAPS) 0/97 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 233 constraints, problems are : Problem set: 0 solved, 76 unsolved in 6442 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 31/31 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 80/80 constraints]
After SMT, in 9538ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 9540ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9660 ms. Remains : 31/31 places, 77/77 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-00 finished in 34317 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 178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 178 transition count 4278
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 68 rules applied. Total rules applied 132 place count 114 transition count 4274
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 135 place count 113 transition count 4272
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 136 place count 112 transition count 4272
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 136 place count 112 transition count 4259
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 162 place count 99 transition count 4259
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 166 place count 95 transition count 4252
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 95 transition count 4252
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 177 place count 95 transition count 4245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 177 place count 95 transition count 4244
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 179 place count 94 transition count 4244
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 93 transition count 4242
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 93 transition count 4242
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 189 place count 93 transition count 4234
Performed 55 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 6 with 110 rules applied. Total rules applied 299 place count 38 transition count 4152
Ensure Unique test removed 2043 transitions
Reduce isomorphic transitions removed 2043 transitions.
Iterating post reduction 6 with 2043 rules applied. Total rules applied 2342 place count 38 transition count 2109
Drop transitions (Redundant composition of simpler transitions.) removed 2058 transitions
Redundant transition composition rules discarded 2058 transitions
Iterating global reduction 7 with 2058 rules applied. Total rules applied 4400 place count 38 transition count 51
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 4422 place count 27 transition count 40
Applied a total of 4422 rules in 667 ms. Remains 27 /178 variables (removed 151) and now considering 40/4342 (removed 4302) transitions.
[2024-06-01 10:52:39] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
// Phase 1: matrix 29 rows 27 cols
[2024-06-01 10:52:39] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 10:52:39] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 10:52:39] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-06-01 10:52:39] [INFO ] Invariant cache hit.
[2024-06-01 10:52:39] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 10:52:39] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2024-06-01 10:52:39] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 10:52:39] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-06-01 10:52:39] [INFO ] Invariant cache hit.
[2024-06-01 10:52:39] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:39] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52: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/27 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:40] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 113 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2701 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 72/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:43] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 39/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 181 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2714 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 101/101 constraints]
After SMT, in 5426ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 5427ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/178 places, 40/4342 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6237 ms. Remains : 27/178 places, 40/4342 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 50 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 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 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 109 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 70 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 40/40 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 10:52:45] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-06-01 10:52:45] [INFO ] Invariant cache hit.
[2024-06-01 10:52:45] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:52:45] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-06-01 10:52:45] [INFO ] Invariant cache hit.
[2024-06-01 10:52:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 10:52:45] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-06-01 10:52:45] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 10:52:45] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-06-01 10:52:45] [INFO ] Invariant cache hit.
[2024-06-01 10:52:45] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:52:45] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:52:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 113 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2667 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 72/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:48] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:49] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:49] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 39/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 181 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2656 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 101/101 constraints]
After SMT, in 5339ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 5339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5417 ms. Remains : 27/27 places, 40/40 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 73 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 83 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 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 96 ms.
Product exploration explored 100000 steps with 1 reset in 80 ms.
Support contains 2 out of 27 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 27/27 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2024-06-01 10:52:51] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-06-01 10:52:51] [INFO ] Invariant cache hit.
[2024-06-01 10:52:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 10:52:51] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-06-01 10:52:51] [INFO ] Invariant cache hit.
[2024-06-01 10:52:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 10:52:51] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-06-01 10:52:51] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2024-06-01 10:52:51] [INFO ] Flow matrix only has 29 transitions (discarded 11 similar events)
[2024-06-01 10:52:51] [INFO ] Invariant cache hit.
[2024-06-01 10:52:51] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:51] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 5 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/50 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 3/53 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:52] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 2 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:53] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 20/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/100 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 1/56 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (OVERLAPS) 0/56 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 113 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2572 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (OVERLAPS) 1/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 72/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 6/79 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 9/88 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:52:54] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:55] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:52:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:52:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 11/99 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2024-06-01 10:52:55] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:52:55] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:52:55] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 28/55 variables, 27/129 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 12/141 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/55 variables, 39/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/55 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 1/56 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 14 (OVERLAPS) 0/56 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 181 constraints, problems are : Problem set: 0 solved, 39 unsolved in 2612 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 101/101 constraints]
After SMT, in 5196ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 5196ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5281 ms. Remains : 27/27 places, 40/40 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-03 finished in 18648 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(p0)))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 163 transition count 4324
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 163 transition count 4324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 163 transition count 4323
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 43 place count 151 transition count 4310
Iterating global reduction 1 with 12 rules applied. Total rules applied 55 place count 151 transition count 4310
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 60 place count 151 transition count 4305
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 65 place count 146 transition count 4300
Iterating global reduction 2 with 5 rules applied. Total rules applied 70 place count 146 transition count 4300
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 143 transition count 4297
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 143 transition count 4297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 143 transition count 4296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 78 place count 142 transition count 4295
Iterating global reduction 3 with 1 rules applied. Total rules applied 79 place count 142 transition count 4295
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 80 place count 141 transition count 4294
Iterating global reduction 3 with 1 rules applied. Total rules applied 81 place count 141 transition count 4294
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 82 place count 141 transition count 4293
Applied a total of 82 rules in 105 ms. Remains 141 /178 variables (removed 37) and now considering 4293/4342 (removed 49) transitions.
[2024-06-01 10:52:57] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
// Phase 1: matrix 4281 rows 141 cols
[2024-06-01 10:52:57] [INFO ] Computed 1 invariants in 19 ms
[2024-06-01 10:52:58] [INFO ] Implicit Places using invariants in 1236 ms returned []
[2024-06-01 10:52:58] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-06-01 10:52:58] [INFO ] Invariant cache hit.
[2024-06-01 10:52:59] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:53:01] [INFO ] Implicit Places using invariants and state equation in 2841 ms returned []
Implicit Place search using SMT with State Equation took 4079 ms to find 0 implicit places.
Running 4292 sub problems to find dead transitions.
[2024-06-01 10:53:01] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-06-01 10:53:01] [INFO ] Invariant cache hit.
[2024-06-01 10:53:01] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4292 unsolved
SMT process timed out in 96845ms, After SMT, problems are : Problem set: 0 solved, 4292 unsolved
Search for dead transitions found 0 dead transitions in 96891ms
Starting structural reductions in LTL mode, iteration 1 : 141/178 places, 4293/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101103 ms. Remains : 141/178 places, 4293/4342 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 196 ms.
Product exploration explored 100000 steps with 0 reset in 6896 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 (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (10 resets) in 16664 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4695 steps, run visited all 1 properties in 87 ms. (steps per millisecond=53 )
Probabilistic random walk after 4695 steps, saw 4559 distinct states, run finished after 95 ms. (steps per millisecond=49 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 4293/4293 transitions.
Applied a total of 0 rules in 14 ms. Remains 141 /141 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-06-01 10:54:50] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-06-01 10:54:50] [INFO ] Invariant cache hit.
[2024-06-01 10:54:52] [INFO ] Implicit Places using invariants in 1186 ms returned []
[2024-06-01 10:54:52] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-06-01 10:54:52] [INFO ] Invariant cache hit.
[2024-06-01 10:54:53] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:54:54] [INFO ] Implicit Places using invariants and state equation in 2653 ms returned []
Implicit Place search using SMT with State Equation took 3841 ms to find 0 implicit places.
Running 4292 sub problems to find dead transitions.
[2024-06-01 10:54:54] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-06-01 10:54:54] [INFO ] Invariant cache hit.
[2024-06-01 10:54:55] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4292 unsolved
SMT process timed out in 96157ms, After SMT, problems are : Problem set: 0 solved, 4292 unsolved
Search for dead transitions found 0 dead transitions in 96202ms
Finished structural reductions in LTL mode , in 1 iterations and 100078 ms. Remains : 141/141 places, 4293/4293 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), true]
RANDOM walk for 40000 steps (9 resets) in 11880 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4695 steps, run visited all 1 properties in 24 ms. (steps per millisecond=195 )
Probabilistic random walk after 4695 steps, saw 4559 distinct states, run finished after 24 ms. (steps per millisecond=195 ) properties seen :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Product exploration explored 100000 steps with 0 reset in 2080 ms.
Product exploration explored 100000 steps with 0 reset in 1840 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 141/141 places, 4293/4293 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 141 transition count 4293
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 33 place count 141 transition count 4304
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 44 place count 141 transition count 4304
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 63 place count 122 transition count 4285
Deduced a syphon composed of 25 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 82 place count 122 transition count 4285
Performed 58 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 83 places in 1 ms
Iterating global reduction 1 with 58 rules applied. Total rules applied 140 place count 122 transition count 4298
Ensure Unique test removed 2080 transitions
Reduce isomorphic transitions removed 2080 transitions.
Iterating post reduction 1 with 2080 rules applied. Total rules applied 2220 place count 122 transition count 2218
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 2258 place count 84 transition count 2180
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 2296 place count 84 transition count 2180
Deduced a syphon composed of 45 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2069 transitions
Redundant transition composition rules discarded 2069 transitions
Iterating global reduction 2 with 2069 rules applied. Total rules applied 4365 place count 84 transition count 111
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 4376 place count 84 transition count 111
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 4398 place count 62 transition count 89
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 22 rules applied. Total rules applied 4420 place count 62 transition count 89
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 4420 rules in 831 ms. Remains 62 /141 variables (removed 79) and now considering 89/4293 (removed 4204) transitions.
[2024-06-01 10:56:40] [INFO ] Redundant transitions in 4 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-01 10:56:40] [INFO ] Flow matrix only has 78 transitions (discarded 11 similar events)
// Phase 1: matrix 78 rows 62 cols
[2024-06-01 10:56:40] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 10:56:40] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 0 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 3 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:56:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:56:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 10:56:42] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 10:56:43] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
At refinement iteration 9 (OVERLAPS) 77/139 variables, 62/139 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 13/152 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/152 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 1/140 variables, 1/153 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/153 constraints. Problems are: Problem set: 47 solved, 41 unsolved
[2024-06-01 10:56:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/140 variables, 1/154 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/140 variables, 0/154 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 16 (OVERLAPS) 0/140 variables, 0/154 constraints. Problems are: Problem set: 47 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 154 constraints, problems are : Problem set: 47 solved, 41 unsolved in 6011 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 77/77 constraints]
Escalating to Integer solving :Problem set: 47 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 1 (OVERLAPS) 35/62 variables, 1/1 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 77/78 constraints. Problems are: Problem set: 47 solved, 41 unsolved
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:56:46] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 20/98 constraints. Problems are: Problem set: 47 solved, 41 unsolved
[2024-06-01 10:56:47] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:56:47] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 10:56:47] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 10:56:47] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:56:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 5/103 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/103 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 77/139 variables, 62/165 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 13/178 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 41/219 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/219 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 1/140 variables, 1/220 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/220 constraints. Problems are: Problem set: 47 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/220 constraints. Problems are: Problem set: 47 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 220 constraints, problems are : Problem set: 47 solved, 41 unsolved in 4647 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 41/88 constraints, Known Traps: 102/102 constraints]
After SMT, in 10680ms problems are : Problem set: 47 solved, 41 unsolved
Search for dead transitions found 47 dead transitions in 10682ms
Found 47 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 47 transitions
Dead transitions reduction (with SMT) removed 47 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/141 places, 42/4293 transitions.
Graph (complete) has 313 edges and 62 vertex of which 28 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.0 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 28 /62 variables (removed 34) and now considering 42/42 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/141 places, 42/4293 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11528 ms. Remains : 28/141 places, 42/4293 transitions.
Support contains 2 out of 141 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 141/141 places, 4293/4293 transitions.
Applied a total of 0 rules in 13 ms. Remains 141 /141 variables (removed 0) and now considering 4293/4293 (removed 0) transitions.
[2024-06-01 10:56:50] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
// Phase 1: matrix 4281 rows 141 cols
[2024-06-01 10:56:50] [INFO ] Computed 1 invariants in 25 ms
[2024-06-01 10:56:52] [INFO ] Implicit Places using invariants in 1197 ms returned []
[2024-06-01 10:56:52] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-06-01 10:56:52] [INFO ] Invariant cache hit.
[2024-06-01 10:56:53] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:56:54] [INFO ] Implicit Places using invariants and state equation in 2770 ms returned []
Implicit Place search using SMT with State Equation took 3969 ms to find 0 implicit places.
Running 4292 sub problems to find dead transitions.
[2024-06-01 10:56:54] [INFO ] Flow matrix only has 4281 transitions (discarded 12 similar events)
[2024-06-01 10:56:54] [INFO ] Invariant cache hit.
[2024-06-01 10:56:55] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4292 unsolved
SMT process timed out in 96255ms, After SMT, problems are : Problem set: 0 solved, 4292 unsolved
Search for dead transitions found 0 dead transitions in 96297ms
Finished structural reductions in LTL mode , in 1 iterations and 100299 ms. Remains : 141/141 places, 4293/4293 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-06 finished in 334343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||(G(p1)&&F((G(p1)&&p2))))))'
Support contains 4 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 164 transition count 4326
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 164 transition count 4326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 164 transition count 4325
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 40 place count 153 transition count 4314
Iterating global reduction 1 with 11 rules applied. Total rules applied 51 place count 153 transition count 4314
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 56 place count 153 transition count 4309
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 149 transition count 4305
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 149 transition count 4305
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 149 transition count 4304
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 147 transition count 4302
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 147 transition count 4302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 70 place count 147 transition count 4301
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 71 place count 146 transition count 4300
Iterating global reduction 4 with 1 rules applied. Total rules applied 72 place count 146 transition count 4300
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 145 transition count 4299
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 145 transition count 4299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 145 transition count 4298
Applied a total of 75 rules in 109 ms. Remains 145 /178 variables (removed 33) and now considering 4298/4342 (removed 44) transitions.
[2024-06-01 10:58:31] [INFO ] Flow matrix only has 4285 transitions (discarded 13 similar events)
// Phase 1: matrix 4285 rows 145 cols
[2024-06-01 10:58:31] [INFO ] Computed 1 invariants in 16 ms
[2024-06-01 10:58:32] [INFO ] Implicit Places using invariants in 1194 ms returned []
[2024-06-01 10:58:32] [INFO ] Flow matrix only has 4285 transitions (discarded 13 similar events)
[2024-06-01 10:58:32] [INFO ] Invariant cache hit.
[2024-06-01 10:58:33] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 10:58:35] [INFO ] Implicit Places using invariants and state equation in 2665 ms returned []
Implicit Place search using SMT with State Equation took 3860 ms to find 0 implicit places.
Running 4297 sub problems to find dead transitions.
[2024-06-01 10:58:35] [INFO ] Flow matrix only has 4285 transitions (discarded 13 similar events)
[2024-06-01 10:58:35] [INFO ] Invariant cache hit.
[2024-06-01 10:58:35] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4297 unsolved
SMT process timed out in 96513ms, After SMT, problems are : Problem set: 0 solved, 4297 unsolved
Search for dead transitions found 0 dead transitions in 96568ms
Starting structural reductions in LTL mode, iteration 1 : 145/178 places, 4298/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100569 ms. Remains : 145/178 places, 4298/4342 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-08
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-08 finished in 100819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 162 transition count 4323
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 162 transition count 4323
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 162 transition count 4322
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 149 transition count 4308
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 149 transition count 4308
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 64 place count 149 transition count 4303
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 70 place count 143 transition count 4297
Iterating global reduction 2 with 6 rules applied. Total rules applied 76 place count 143 transition count 4297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 143 transition count 4296
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 140 transition count 4293
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 140 transition count 4293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 84 place count 140 transition count 4292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 139 transition count 4291
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 139 transition count 4291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 138 transition count 4290
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 138 transition count 4290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 138 transition count 4289
Applied a total of 89 rules in 107 ms. Remains 138 /178 variables (removed 40) and now considering 4289/4342 (removed 53) transitions.
[2024-06-01 11:00:12] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
// Phase 1: matrix 4277 rows 138 cols
[2024-06-01 11:00:12] [INFO ] Computed 1 invariants in 19 ms
[2024-06-01 11:00:13] [INFO ] Implicit Places using invariants in 1200 ms returned []
[2024-06-01 11:00:13] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-06-01 11:00:13] [INFO ] Invariant cache hit.
[2024-06-01 11:00:14] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:00:16] [INFO ] Implicit Places using invariants and state equation in 2795 ms returned []
Implicit Place search using SMT with State Equation took 3997 ms to find 0 implicit places.
Running 4288 sub problems to find dead transitions.
[2024-06-01 11:00:16] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-06-01 11:00:16] [INFO ] Invariant cache hit.
[2024-06-01 11:00:16] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4288 unsolved
SMT process timed out in 110551ms, After SMT, problems are : Problem set: 0 solved, 4288 unsolved
Search for dead transitions found 0 dead transitions in 110594ms
Starting structural reductions in LTL mode, iteration 1 : 138/178 places, 4289/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 114720 ms. Remains : 138/178 places, 4289/4342 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 341 ms.
Product exploration explored 100000 steps with 50000 reset in 326 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 : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-10a-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-09 finished in 115527 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 162 transition count 4324
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 162 transition count 4324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 162 transition count 4323
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 46 place count 149 transition count 4309
Iterating global reduction 1 with 13 rules applied. Total rules applied 59 place count 149 transition count 4309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 65 place count 149 transition count 4303
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 71 place count 143 transition count 4297
Iterating global reduction 2 with 6 rules applied. Total rules applied 77 place count 143 transition count 4297
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 143 transition count 4296
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 81 place count 140 transition count 4293
Iterating global reduction 3 with 3 rules applied. Total rules applied 84 place count 140 transition count 4293
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 85 place count 140 transition count 4292
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 86 place count 139 transition count 4291
Iterating global reduction 4 with 1 rules applied. Total rules applied 87 place count 139 transition count 4291
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 88 place count 138 transition count 4290
Iterating global reduction 4 with 1 rules applied. Total rules applied 89 place count 138 transition count 4290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 138 transition count 4289
Applied a total of 90 rules in 105 ms. Remains 138 /178 variables (removed 40) and now considering 4289/4342 (removed 53) transitions.
[2024-06-01 11:02:08] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
// Phase 1: matrix 4277 rows 138 cols
[2024-06-01 11:02:08] [INFO ] Computed 1 invariants in 24 ms
[2024-06-01 11:02:09] [INFO ] Implicit Places using invariants in 1188 ms returned []
[2024-06-01 11:02:09] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-06-01 11:02:09] [INFO ] Invariant cache hit.
[2024-06-01 11:02:10] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:02:11] [INFO ] Implicit Places using invariants and state equation in 2660 ms returned []
Implicit Place search using SMT with State Equation took 3850 ms to find 0 implicit places.
Running 4288 sub problems to find dead transitions.
[2024-06-01 11:02:11] [INFO ] Flow matrix only has 4277 transitions (discarded 12 similar events)
[2024-06-01 11:02:11] [INFO ] Invariant cache hit.
[2024-06-01 11:02:12] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/137 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4288 unsolved
SMT process timed out in 99785ms, After SMT, problems are : Problem set: 0 solved, 4288 unsolved
Search for dead transitions found 0 dead transitions in 99827ms
Starting structural reductions in LTL mode, iteration 1 : 138/178 places, 4289/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 103803 ms. Remains : 138/178 places, 4289/4342 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-11
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-11 finished in 103979 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 163 transition count 4324
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 163 transition count 4324
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 43 place count 150 transition count 4310
Iterating global reduction 0 with 13 rules applied. Total rules applied 56 place count 150 transition count 4310
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 61 place count 150 transition count 4305
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 144 transition count 4299
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 144 transition count 4299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 144 transition count 4298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 77 place count 141 transition count 4295
Iterating global reduction 2 with 3 rules applied. Total rules applied 80 place count 141 transition count 4295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 141 transition count 4294
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 82 place count 140 transition count 4293
Iterating global reduction 3 with 1 rules applied. Total rules applied 83 place count 140 transition count 4293
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 139 transition count 4292
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 139 transition count 4292
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 139 transition count 4291
Applied a total of 86 rules in 97 ms. Remains 139 /178 variables (removed 39) and now considering 4291/4342 (removed 51) transitions.
[2024-06-01 11:03:52] [INFO ] Flow matrix only has 4279 transitions (discarded 12 similar events)
// Phase 1: matrix 4279 rows 139 cols
[2024-06-01 11:03:52] [INFO ] Computed 1 invariants in 20 ms
[2024-06-01 11:03:53] [INFO ] Implicit Places using invariants in 1182 ms returned []
[2024-06-01 11:03:53] [INFO ] Flow matrix only has 4279 transitions (discarded 12 similar events)
[2024-06-01 11:03:53] [INFO ] Invariant cache hit.
[2024-06-01 11:03:54] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:03:55] [INFO ] Implicit Places using invariants and state equation in 2629 ms returned []
Implicit Place search using SMT with State Equation took 3822 ms to find 0 implicit places.
Running 4290 sub problems to find dead transitions.
[2024-06-01 11:03:55] [INFO ] Flow matrix only has 4279 transitions (discarded 12 similar events)
[2024-06-01 11:03:55] [INFO ] Invariant cache hit.
[2024-06-01 11:03:56] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4290 unsolved
SMT process timed out in 96404ms, After SMT, problems are : Problem set: 0 solved, 4290 unsolved
Search for dead transitions found 0 dead transitions in 96459ms
Starting structural reductions in LTL mode, iteration 1 : 139/178 places, 4291/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100400 ms. Remains : 139/178 places, 4291/4342 transitions.
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-12
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 2 ms.
FORMULA StigmergyCommit-PT-10a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-12 finished in 100566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p1||G(F(p0))))))'
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 163 transition count 4324
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 163 transition count 4324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 163 transition count 4323
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 44 place count 150 transition count 4309
Iterating global reduction 1 with 13 rules applied. Total rules applied 57 place count 150 transition count 4309
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 63 place count 150 transition count 4303
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 68 place count 145 transition count 4298
Iterating global reduction 2 with 5 rules applied. Total rules applied 73 place count 145 transition count 4298
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 145 transition count 4297
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 76 place count 143 transition count 4295
Iterating global reduction 3 with 2 rules applied. Total rules applied 78 place count 143 transition count 4295
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 79 place count 143 transition count 4294
Applied a total of 79 rules in 77 ms. Remains 143 /178 variables (removed 35) and now considering 4294/4342 (removed 48) transitions.
[2024-06-01 11:05:32] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
// Phase 1: matrix 4282 rows 143 cols
[2024-06-01 11:05:32] [INFO ] Computed 1 invariants in 21 ms
[2024-06-01 11:05:33] [INFO ] Implicit Places using invariants in 1193 ms returned []
[2024-06-01 11:05:33] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-06-01 11:05:33] [INFO ] Invariant cache hit.
[2024-06-01 11:05:34] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:05:36] [INFO ] Implicit Places using invariants and state equation in 2685 ms returned []
Implicit Place search using SMT with State Equation took 3880 ms to find 0 implicit places.
Running 4293 sub problems to find dead transitions.
[2024-06-01 11:05:36] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-06-01 11:05:36] [INFO ] Invariant cache hit.
[2024-06-01 11:05:36] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
SMT process timed out in 96438ms, After SMT, problems are : Problem set: 0 solved, 4293 unsolved
Search for dead transitions found 0 dead transitions in 96481ms
Starting structural reductions in LTL mode, iteration 1 : 143/178 places, 4294/4342 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 100455 ms. Remains : 143/178 places, 4294/4342 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-15
Product exploration explored 100000 steps with 1 reset in 5061 ms.
Product exploration explored 100000 steps with 0 reset in 3525 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 107 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 10660 ms. (3 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 545028 steps, run timeout after 6001 ms. (steps per millisecond=90 ) properties seen :3 out of 4
Probabilistic random walk after 545028 steps, saw 69456 distinct states, run finished after 6005 ms. (steps per millisecond=90 ) properties seen :3
[2024-06-01 11:07:31] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-06-01 11:07:31] [INFO ] Invariant cache hit.
[2024-06-01 11:07:31] [INFO ] State equation strengthened by 4104 read => feed constraints.
All remaining problems are real, not stopping.
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) 141/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4281/4424 variables, 143/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4424 variables, 4103/4247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4424 variables, 0/4247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/4425 variables, 1/4248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4425 variables, 0/4248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/4425 variables, 0/4248 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4425/4425 variables, and 4248 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1406 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 143/143 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 141/143 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:07:34] [INFO ] Deduced a trap composed of 13 places in 1394 ms of which 1 ms to minimize.
[2024-06-01 11:07:35] [INFO ] Deduced a trap composed of 16 places in 1549 ms of which 2 ms to minimize.
[2024-06-01 11:07:37] [INFO ] Deduced a trap composed of 13 places in 1381 ms of which 1 ms to minimize.
[2024-06-01 11:07:38] [INFO ] Deduced a trap composed of 13 places in 1381 ms of which 1 ms to minimize.
SMT process timed out in 7440ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 143/143 places, 4294/4294 transitions.
Graph (complete) has 549 edges and 143 vertex of which 142 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 142 transition count 4220
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 71 rules applied. Total rules applied 145 place count 92 transition count 4199
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 155 place count 82 transition count 4199
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 166 place count 71 transition count 4188
Iterating global reduction 3 with 11 rules applied. Total rules applied 177 place count 71 transition count 4188
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 188 place count 60 transition count 4177
Iterating global reduction 3 with 11 rules applied. Total rules applied 199 place count 60 transition count 4177
Performed 45 Post agglomeration using F-continuation condition with reduction of 4084 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 297 place count 7 transition count 48
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 3 with 42 rules applied. Total rules applied 339 place count 7 transition count 6
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 340 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 341 place count 5 transition count 5
Applied a total of 341 rules in 202 ms. Remains 5 /143 variables (removed 138) and now considering 5/4294 (removed 4289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 5/143 places, 5/4294 transitions.
RANDOM walk for 40000 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Probably explored full state space saw : 4 states, properties seen :0
Probabilistic random walk after 9 steps, saw 4 distinct states, run finished after 4 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 4 states, properties seen :0
Exhaustive walk after 9 steps, saw 4 distinct states, run finished after 1 ms. (steps per millisecond=9 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1))), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 184 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 4294/4294 transitions.
Applied a total of 0 rules in 15 ms. Remains 143 /143 variables (removed 0) and now considering 4294/4294 (removed 0) transitions.
[2024-06-01 11:07:39] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-06-01 11:07:39] [INFO ] Invariant cache hit.
[2024-06-01 11:07:40] [INFO ] Implicit Places using invariants in 1189 ms returned []
[2024-06-01 11:07:40] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-06-01 11:07:40] [INFO ] Invariant cache hit.
[2024-06-01 11:07:41] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:07:43] [INFO ] Implicit Places using invariants and state equation in 2654 ms returned []
Implicit Place search using SMT with State Equation took 3846 ms to find 0 implicit places.
Running 4293 sub problems to find dead transitions.
[2024-06-01 11:07:43] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-06-01 11:07:43] [INFO ] Invariant cache hit.
[2024-06-01 11:07:43] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
SMT process timed out in 96061ms, After SMT, problems are : Problem set: 0 solved, 4293 unsolved
Search for dead transitions found 0 dead transitions in 96106ms
Finished structural reductions in LTL mode , in 1 iterations and 99989 ms. Remains : 143/143 places, 4294/4294 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 100 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (8 resets) in 11219 ms. (3 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 4723 steps, run visited all 2 properties in 52 ms. (steps per millisecond=90 )
Probabilistic random walk after 4723 steps, saw 4570 distinct states, run finished after 52 ms. (steps per millisecond=90 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 131 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 5627 ms.
Product exploration explored 100000 steps with 0 reset in 1230 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 4294/4294 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 143 transition count 4294
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 39 place count 143 transition count 4304
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 49 place count 143 transition count 4304
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 74 place count 118 transition count 4279
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 99 place count 118 transition count 4279
Performed 56 Post agglomeration using F-continuation condition with reduction of 22 identical transitions.
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 1 with 56 rules applied. Total rules applied 155 place count 118 transition count 4291
Ensure Unique test removed 1056 transitions
Reduce isomorphic transitions removed 1056 transitions.
Iterating post reduction 1 with 1056 rules applied. Total rules applied 1211 place count 118 transition count 3235
Discarding 36 places :
Symmetric choice reduction at 2 with 36 rule applications. Total rules 1247 place count 82 transition count 3199
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1283 place count 82 transition count 3199
Deduced a syphon composed of 44 places in 1 ms
Drop transitions (Redundant composition of simpler transitions.) removed 3076 transitions
Redundant transition composition rules discarded 3076 transitions
Iterating global reduction 2 with 3076 rules applied. Total rules applied 4359 place count 82 transition count 123
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 4370 place count 82 transition count 123
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 4391 place count 61 transition count 102
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 4412 place count 61 transition count 102
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 4412 rules in 1336 ms. Remains 61 /143 variables (removed 82) and now considering 102/4294 (removed 4192) transitions.
[2024-06-01 11:09:31] [INFO ] Redundant transitions in 1 ms returned []
Running 101 sub problems to find dead transitions.
[2024-06-01 11:09:31] [INFO ] Flow matrix only has 91 transitions (discarded 11 similar events)
// Phase 1: matrix 91 rows 61 cols
[2024-06-01 11:09:31] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 11:09:31] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:09:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:09:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 11:09:31] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-06-01 11:09:31] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 11:09:31] [INFO ] Deduced a trap composed of 4 places in 13 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:09:32] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 18/39 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:09:33] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 17/56 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 101 unsolved
[2024-06-01 11:09:34] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/61 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
At refinement iteration 8 (OVERLAPS) 90/151 variables, 61/132 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 27/159 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/159 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 11 (OVERLAPS) 1/152 variables, 1/160 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/152 variables, 0/160 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 13 (OVERLAPS) 0/152 variables, 0/160 constraints. Problems are: Problem set: 46 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 152/152 variables, and 160 constraints, problems are : Problem set: 46 solved, 55 unsolved in 5594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 46 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 1 (OVERLAPS) 35/61 variables, 1/1 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 70/71 constraints. Problems are: Problem set: 46 solved, 55 unsolved
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:09:37] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 20/91 constraints. Problems are: Problem set: 46 solved, 55 unsolved
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:09:38] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 11/102 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/61 variables, 0/102 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 6 (OVERLAPS) 90/151 variables, 61/163 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 27/190 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 55/245 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 0/245 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 1/152 variables, 1/246 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/152 variables, 0/246 constraints. Problems are: Problem set: 46 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/152 variables, 0/246 constraints. Problems are: Problem set: 46 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 152/152 variables, and 246 constraints, problems are : Problem set: 46 solved, 55 unsolved in 7183 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 61/61 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 55/101 constraints, Known Traps: 101/101 constraints]
After SMT, in 12821ms problems are : Problem set: 46 solved, 55 unsolved
Search for dead transitions found 46 dead transitions in 12823ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 61/143 places, 56/4294 transitions.
Graph (complete) has 312 edges and 61 vertex of which 27 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.0 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 27 /61 variables (removed 34) and now considering 56/56 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/143 places, 56/4294 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 14177 ms. Remains : 27/143 places, 56/4294 transitions.
Support contains 2 out of 143 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 143/143 places, 4294/4294 transitions.
Applied a total of 0 rules in 12 ms. Remains 143 /143 variables (removed 0) and now considering 4294/4294 (removed 0) transitions.
[2024-06-01 11:09:44] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
// Phase 1: matrix 4282 rows 143 cols
[2024-06-01 11:09:44] [INFO ] Computed 1 invariants in 21 ms
[2024-06-01 11:09:45] [INFO ] Implicit Places using invariants in 1220 ms returned []
[2024-06-01 11:09:45] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-06-01 11:09:45] [INFO ] Invariant cache hit.
[2024-06-01 11:09:46] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-06-01 11:09:48] [INFO ] Implicit Places using invariants and state equation in 2771 ms returned []
Implicit Place search using SMT with State Equation took 3992 ms to find 0 implicit places.
Running 4293 sub problems to find dead transitions.
[2024-06-01 11:09:48] [INFO ] Flow matrix only has 4282 transitions (discarded 12 similar events)
[2024-06-01 11:09:48] [INFO ] Invariant cache hit.
[2024-06-01 11:09:48] [INFO ] State equation strengthened by 4104 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4293 unsolved
SMT process timed out in 96140ms, After SMT, problems are : Problem set: 0 solved, 4293 unsolved
Search for dead transitions found 0 dead transitions in 96182ms
Finished structural reductions in LTL mode , in 1 iterations and 100204 ms. Remains : 143/143 places, 4294/4294 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-15 finished in 352449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(X(p0)))))'
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((X(p0)&&(p1||G(F(p0))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-10a-LTLCardinality-15
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 178 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 178/178 places, 4342/4342 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 65 place count 177 transition count 4276
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 69 rules applied. Total rules applied 134 place count 112 transition count 4272
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 136 place count 111 transition count 4271
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 136 place count 111 transition count 4258
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 162 place count 98 transition count 4258
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 165 place count 95 transition count 4252
Iterating global reduction 3 with 3 rules applied. Total rules applied 168 place count 95 transition count 4252
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 171 place count 95 transition count 4249
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 172 place count 94 transition count 4247
Iterating global reduction 4 with 1 rules applied. Total rules applied 173 place count 94 transition count 4247
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 177 place count 94 transition count 4243
Performed 46 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 269 place count 48 transition count 4177
Ensure Unique test removed 1027 transitions
Reduce isomorphic transitions removed 1027 transitions.
Iterating post reduction 5 with 1027 rules applied. Total rules applied 1296 place count 48 transition count 3150
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1310 place count 41 transition count 3143
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1317 place count 41 transition count 3136
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 1321 place count 37 transition count 3132
Applied a total of 1321 rules in 440 ms. Remains 37 /178 variables (removed 141) and now considering 3132/4342 (removed 1210) transitions.
[2024-06-01 11:11:26] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
// Phase 1: matrix 3120 rows 37 cols
[2024-06-01 11:11:26] [INFO ] Computed 1 invariants in 17 ms
[2024-06-01 11:11:26] [INFO ] Implicit Places using invariants in 910 ms returned []
[2024-06-01 11:11:26] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-06-01 11:11:26] [INFO ] Invariant cache hit.
[2024-06-01 11:11:28] [INFO ] Implicit Places using invariants and state equation in 1396 ms returned []
Implicit Place search using SMT with State Equation took 2308 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-06-01 11:11:28] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-06-01 11:11:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 11/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 11:11:29] [INFO ] Deduced a trap composed of 5 places in 1101 ms of which 0 ms to minimize.
[2024-06-01 11:11:30] [INFO ] Deduced a trap composed of 4 places in 1104 ms of which 0 ms to minimize.
[2024-06-01 11:11:32] [INFO ] Deduced a trap composed of 4 places in 1084 ms of which 1 ms to minimize.
[2024-06-01 11:11:33] [INFO ] Deduced a trap composed of 4 places in 1026 ms of which 0 ms to minimize.
[2024-06-01 11:11:33] [INFO ] Deduced a trap composed of 4 places in 923 ms of which 1 ms to minimize.
[2024-06-01 11:11:34] [INFO ] Deduced a trap composed of 6 places in 1020 ms of which 1 ms to minimize.
[2024-06-01 11:11:36] [INFO ] Deduced a trap composed of 4 places in 1041 ms of which 1 ms to minimize.
[2024-06-01 11:11:37] [INFO ] Deduced a trap composed of 4 places in 1008 ms of which 1 ms to minimize.
[2024-06-01 11:11:38] [INFO ] Deduced a trap composed of 4 places in 1012 ms of which 1 ms to minimize.
[2024-06-01 11:11:39] [INFO ] Deduced a trap composed of 4 places in 1019 ms of which 1 ms to minimize.
[2024-06-01 11:11:40] [INFO ] Deduced a trap composed of 4 places in 942 ms of which 1 ms to minimize.
[2024-06-01 11:11:41] [INFO ] Deduced a trap composed of 4 places in 943 ms of which 1 ms to minimize.
[2024-06-01 11:11:41] [INFO ] Deduced a trap composed of 4 places in 832 ms of which 0 ms to minimize.
[2024-06-01 11:11:42] [INFO ] Deduced a trap composed of 4 places in 694 ms of which 0 ms to minimize.
[2024-06-01 11:11:43] [INFO ] Deduced a trap composed of 5 places in 860 ms of which 1 ms to minimize.
[2024-06-01 11:11:44] [INFO ] Deduced a trap composed of 4 places in 792 ms of which 1 ms to minimize.
[2024-06-01 11:11:44] [INFO ] Deduced a trap composed of 4 places in 660 ms of which 0 ms to minimize.
[2024-06-01 11:11:45] [INFO ] Deduced a trap composed of 4 places in 584 ms of which 0 ms to minimize.
[2024-06-01 11:11:46] [INFO ] Deduced a trap composed of 4 places in 797 ms of which 1 ms to minimize.
[2024-06-01 11:11:47] [INFO ] Deduced a trap composed of 4 places in 756 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 11:11:47] [INFO ] Deduced a trap composed of 5 places in 685 ms of which 1 ms to minimize.
[2024-06-01 11:11:48] [INFO ] Deduced a trap composed of 5 places in 611 ms of which 0 ms to minimize.
[2024-06-01 11:11:48] [INFO ] Deduced a trap composed of 5 places in 517 ms of which 0 ms to minimize.
[2024-06-01 11:11:49] [INFO ] Deduced a trap composed of 4 places in 757 ms of which 1 ms to minimize.
[2024-06-01 11:11:50] [INFO ] Deduced a trap composed of 4 places in 659 ms of which 0 ms to minimize.
[2024-06-01 11:11:50] [INFO ] Deduced a trap composed of 4 places in 560 ms of which 1 ms to minimize.
[2024-06-01 11:11:51] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 0 ms to minimize.
[2024-06-01 11:11:51] [INFO ] Deduced a trap composed of 4 places in 364 ms of which 0 ms to minimize.
[2024-06-01 11:11:52] [INFO ] Deduced a trap composed of 5 places in 426 ms of which 1 ms to minimize.
[2024-06-01 11:11:52] [INFO ] Deduced a trap composed of 5 places in 376 ms of which 0 ms to minimize.
[2024-06-01 11:11:52] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 1 ms to minimize.
[2024-06-01 11:11:53] [INFO ] Deduced a trap composed of 5 places in 241 ms of which 0 ms to minimize.
[2024-06-01 11:11:53] [INFO ] Deduced a trap composed of 5 places in 239 ms of which 0 ms to minimize.
[2024-06-01 11:11:53] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 0 ms to minimize.
[2024-06-01 11:11:54] [INFO ] Deduced a trap composed of 4 places in 528 ms of which 0 ms to minimize.
[2024-06-01 11:11:54] [INFO ] Deduced a trap composed of 4 places in 768 ms of which 1 ms to minimize.
[2024-06-01 11:11:55] [INFO ] Deduced a trap composed of 4 places in 666 ms of which 1 ms to minimize.
[2024-06-01 11:11:56] [INFO ] Deduced a trap composed of 4 places in 585 ms of which 0 ms to minimize.
[2024-06-01 11:11:56] [INFO ] Deduced a trap composed of 4 places in 661 ms of which 1 ms to minimize.
[2024-06-01 11:11:57] [INFO ] Deduced a trap composed of 4 places in 577 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 11:11:58] [INFO ] Deduced a trap composed of 4 places in 659 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 11:11:59] [INFO ] Deduced a trap composed of 4 places in 651 ms of which 0 ms to minimize.
SMT process timed out in 30840ms, After SMT, problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 30842ms
Starting structural reductions in LI_LTL mode, iteration 1 : 37/178 places, 3132/4342 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 33593 ms. Remains : 37/178 places, 3132/4342 transitions.
Running random walk in product with property : StigmergyCommit-PT-10a-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 571 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 103 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (22 resets) in 11833 ms. (3 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
[2024-06-01 11:12:03] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-06-01 11:12:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
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) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3119/3156 variables, 37/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3156 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/3156 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3156/3157 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
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) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 11:12:04] [INFO ] Deduced a trap composed of 4 places in 989 ms of which 1 ms to minimize.
[2024-06-01 11:12:05] [INFO ] Deduced a trap composed of 4 places in 985 ms of which 1 ms to minimize.
[2024-06-01 11:12:06] [INFO ] Deduced a trap composed of 4 places in 835 ms of which 0 ms to minimize.
[2024-06-01 11:12:07] [INFO ] Deduced a trap composed of 4 places in 798 ms of which 1 ms to minimize.
[2024-06-01 11:12:08] [INFO ] Deduced a trap composed of 4 places in 705 ms of which 0 ms to minimize.
[2024-06-01 11:12:08] [INFO ] Deduced a trap composed of 4 places in 797 ms of which 1 ms to minimize.
SMT process timed out in 5751ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 37/37 places, 3132/3132 transitions.
Graph (complete) has 190 edges and 37 vertex of which 36 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 36 transition count 3108
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 46 place count 25 transition count 3097
Performed 11 Post agglomeration using F-continuation condition with reduction of 3049 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 14 transition count 37
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 2 with 21 rules applied. Total rules applied 89 place count 14 transition count 16
Applied a total of 89 rules in 84 ms. Remains 14 /37 variables (removed 23) and now considering 16/3132 (removed 3116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 14/37 places, 16/3132 transitions.
RANDOM walk for 40000 steps (16252 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (2409 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Probably explored full state space saw : 15 states, properties seen :0
Probabilistic random walk after 31 steps, saw 15 distinct states, run finished after 3 ms. (steps per millisecond=10 ) properties seen :0
Explored full state space saw : 15 states, properties seen :0
Exhaustive walk after 31 steps, saw 15 distinct states, run finished after 1 ms. (steps per millisecond=31 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 164 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 3132/3132 transitions.
Applied a total of 0 rules in 14 ms. Remains 37 /37 variables (removed 0) and now considering 3132/3132 (removed 0) transitions.
[2024-06-01 11:12:09] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-06-01 11:12:09] [INFO ] Invariant cache hit.
[2024-06-01 11:12:10] [INFO ] Implicit Places using invariants in 937 ms returned []
[2024-06-01 11:12:10] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-06-01 11:12:10] [INFO ] Invariant cache hit.
[2024-06-01 11:12:11] [INFO ] Implicit Places using invariants and state equation in 1425 ms returned []
Implicit Place search using SMT with State Equation took 2365 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-06-01 11:12:11] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-06-01 11:12:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 11/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 11:12:13] [INFO ] Deduced a trap composed of 5 places in 1095 ms of which 0 ms to minimize.
[2024-06-01 11:12:14] [INFO ] Deduced a trap composed of 4 places in 986 ms of which 0 ms to minimize.
[2024-06-01 11:12:15] [INFO ] Deduced a trap composed of 4 places in 1056 ms of which 1 ms to minimize.
[2024-06-01 11:12:16] [INFO ] Deduced a trap composed of 4 places in 1037 ms of which 0 ms to minimize.
[2024-06-01 11:12:17] [INFO ] Deduced a trap composed of 4 places in 918 ms of which 1 ms to minimize.
[2024-06-01 11:12:18] [INFO ] Deduced a trap composed of 6 places in 1019 ms of which 1 ms to minimize.
[2024-06-01 11:12:19] [INFO ] Deduced a trap composed of 4 places in 1027 ms of which 0 ms to minimize.
[2024-06-01 11:12:20] [INFO ] Deduced a trap composed of 4 places in 1019 ms of which 1 ms to minimize.
[2024-06-01 11:12:21] [INFO ] Deduced a trap composed of 4 places in 1023 ms of which 0 ms to minimize.
[2024-06-01 11:12:22] [INFO ] Deduced a trap composed of 4 places in 943 ms of which 1 ms to minimize.
[2024-06-01 11:12:23] [INFO ] Deduced a trap composed of 4 places in 927 ms of which 1 ms to minimize.
[2024-06-01 11:12:24] [INFO ] Deduced a trap composed of 4 places in 936 ms of which 1 ms to minimize.
[2024-06-01 11:12:25] [INFO ] Deduced a trap composed of 4 places in 781 ms of which 0 ms to minimize.
[2024-06-01 11:12:25] [INFO ] Deduced a trap composed of 4 places in 650 ms of which 1 ms to minimize.
[2024-06-01 11:12:26] [INFO ] Deduced a trap composed of 5 places in 877 ms of which 1 ms to minimize.
[2024-06-01 11:12:27] [INFO ] Deduced a trap composed of 4 places in 792 ms of which 0 ms to minimize.
[2024-06-01 11:12:28] [INFO ] Deduced a trap composed of 4 places in 645 ms of which 0 ms to minimize.
[2024-06-01 11:12:28] [INFO ] Deduced a trap composed of 4 places in 643 ms of which 0 ms to minimize.
[2024-06-01 11:12:29] [INFO ] Deduced a trap composed of 4 places in 782 ms of which 0 ms to minimize.
[2024-06-01 11:12:30] [INFO ] Deduced a trap composed of 4 places in 745 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 11:12:31] [INFO ] Deduced a trap composed of 5 places in 672 ms of which 1 ms to minimize.
[2024-06-01 11:12:31] [INFO ] Deduced a trap composed of 5 places in 607 ms of which 0 ms to minimize.
[2024-06-01 11:12:32] [INFO ] Deduced a trap composed of 5 places in 522 ms of which 0 ms to minimize.
[2024-06-01 11:12:33] [INFO ] Deduced a trap composed of 4 places in 854 ms of which 0 ms to minimize.
[2024-06-01 11:12:33] [INFO ] Deduced a trap composed of 4 places in 770 ms of which 0 ms to minimize.
[2024-06-01 11:12:34] [INFO ] Deduced a trap composed of 4 places in 648 ms of which 1 ms to minimize.
[2024-06-01 11:12:35] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 0 ms to minimize.
[2024-06-01 11:12:35] [INFO ] Deduced a trap composed of 4 places in 378 ms of which 0 ms to minimize.
[2024-06-01 11:12:36] [INFO ] Deduced a trap composed of 5 places in 500 ms of which 1 ms to minimize.
[2024-06-01 11:12:36] [INFO ] Deduced a trap composed of 5 places in 427 ms of which 0 ms to minimize.
[2024-06-01 11:12:36] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 0 ms to minimize.
[2024-06-01 11:12:37] [INFO ] Deduced a trap composed of 5 places in 255 ms of which 1 ms to minimize.
[2024-06-01 11:12:37] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 0 ms to minimize.
[2024-06-01 11:12:37] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2024-06-01 11:12:38] [INFO ] Deduced a trap composed of 4 places in 594 ms of which 1 ms to minimize.
[2024-06-01 11:12:39] [INFO ] Deduced a trap composed of 4 places in 872 ms of which 1 ms to minimize.
[2024-06-01 11:12:39] [INFO ] Deduced a trap composed of 4 places in 763 ms of which 0 ms to minimize.
[2024-06-01 11:12:40] [INFO ] Deduced a trap composed of 4 places in 593 ms of which 0 ms to minimize.
[2024-06-01 11:12:41] [INFO ] Deduced a trap composed of 4 places in 751 ms of which 0 ms to minimize.
[2024-06-01 11:12:41] [INFO ] Deduced a trap composed of 4 places in 649 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 11:12:42] [INFO ] Deduced a trap composed of 4 places in 711 ms of which 0 ms to minimize.
SMT process timed out in 30753ms, After SMT, problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 30753ms
Finished structural reductions in LTL mode , in 1 iterations and 33136 ms. Remains : 37/37 places, 3132/3132 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 37346 steps (13 resets) in 10833 ms. (3 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 2 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 0 reset in 442 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 37/37 places, 3132/3132 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3066 transitions
Redundant transition composition rules discarded 3066 transitions
Iterating global reduction 0 with 3066 rules applied. Total rules applied 3066 place count 37 transition count 66
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 3077 place count 37 transition count 66
Deduced a syphon composed of 11 places in 0 ms
Applied a total of 3077 rules in 698 ms. Remains 37 /37 variables (removed 0) and now considering 66/3132 (removed 3066) transitions.
[2024-06-01 11:12:47] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2024-06-01 11:12:47] [INFO ] Flow matrix only has 55 transitions (discarded 11 similar events)
// Phase 1: matrix 55 rows 37 cols
[2024-06-01 11:12:47] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 11:12:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 11/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 11:12:47] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem TDEAD7 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
At refinement iteration 5 (OVERLAPS) 54/91 variables, 37/68 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:12:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 3 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 13/81 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/81 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 1/92 variables, 1/82 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/83 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/83 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/92 variables, 1/84 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/84 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/84 constraints. Problems are: Problem set: 11 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 92/92 variables, and 84 constraints, problems are : Problem set: 11 solved, 26 unsolved in 1920 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 11 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 22/37 variables, 1/1 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 45/46 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:12:49] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/66 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:12:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 20/86 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 11:12:51] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 11:12:52] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 15/101 constraints. Problems are: Problem set: 11 solved, 26 unsolved
[2024-06-01 11:12:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 11:12:52] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 2/103 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/103 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 54/91 variables, 37/140 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 26/166 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/166 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 1/92 variables, 1/167 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/167 constraints. Problems are: Problem set: 11 solved, 26 unsolved
At refinement iteration 13 (OVERLAPS) 0/92 variables, 0/167 constraints. Problems are: Problem set: 11 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 92/92 variables, and 167 constraints, problems are : Problem set: 11 solved, 26 unsolved in 3242 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/37 constraints, Known Traps: 102/102 constraints]
After SMT, in 5173ms problems are : Problem set: 11 solved, 26 unsolved
Search for dead transitions found 11 dead transitions in 5174ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 37/37 places, 55/3132 transitions.
Graph (complete) has 301 edges and 37 vertex of which 26 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 26 /37 variables (removed 11) and now considering 55/55 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 26/37 places, 55/3132 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5885 ms. Remains : 26/37 places, 55/3132 transitions.
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 37/37 places, 3132/3132 transitions.
Applied a total of 0 rules in 9 ms. Remains 37 /37 variables (removed 0) and now considering 3132/3132 (removed 0) transitions.
[2024-06-01 11:12:53] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
// Phase 1: matrix 3120 rows 37 cols
[2024-06-01 11:12:53] [INFO ] Computed 1 invariants in 14 ms
[2024-06-01 11:12:53] [INFO ] Implicit Places using invariants in 905 ms returned []
[2024-06-01 11:12:53] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-06-01 11:12:53] [INFO ] Invariant cache hit.
[2024-06-01 11:12:55] [INFO ] Implicit Places using invariants and state equation in 1408 ms returned []
Implicit Place search using SMT with State Equation took 2314 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-06-01 11:12:55] [INFO ] Flow matrix only has 3120 transitions (discarded 12 similar events)
[2024-06-01 11:12:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 11/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 11:12:56] [INFO ] Deduced a trap composed of 5 places in 992 ms of which 1 ms to minimize.
[2024-06-01 11:12:57] [INFO ] Deduced a trap composed of 4 places in 971 ms of which 0 ms to minimize.
[2024-06-01 11:12:58] [INFO ] Deduced a trap composed of 4 places in 970 ms of which 1 ms to minimize.
[2024-06-01 11:12:59] [INFO ] Deduced a trap composed of 4 places in 920 ms of which 1 ms to minimize.
[2024-06-01 11:13:00] [INFO ] Deduced a trap composed of 4 places in 930 ms of which 0 ms to minimize.
[2024-06-01 11:13:01] [INFO ] Deduced a trap composed of 6 places in 912 ms of which 1 ms to minimize.
[2024-06-01 11:13:02] [INFO ] Deduced a trap composed of 4 places in 936 ms of which 0 ms to minimize.
[2024-06-01 11:13:03] [INFO ] Deduced a trap composed of 4 places in 926 ms of which 1 ms to minimize.
[2024-06-01 11:13:04] [INFO ] Deduced a trap composed of 4 places in 1001 ms of which 1 ms to minimize.
[2024-06-01 11:13:05] [INFO ] Deduced a trap composed of 4 places in 1017 ms of which 1 ms to minimize.
[2024-06-01 11:13:06] [INFO ] Deduced a trap composed of 4 places in 1039 ms of which 0 ms to minimize.
[2024-06-01 11:13:07] [INFO ] Deduced a trap composed of 4 places in 950 ms of which 1 ms to minimize.
[2024-06-01 11:13:08] [INFO ] Deduced a trap composed of 4 places in 781 ms of which 0 ms to minimize.
[2024-06-01 11:13:08] [INFO ] Deduced a trap composed of 4 places in 640 ms of which 0 ms to minimize.
[2024-06-01 11:13:09] [INFO ] Deduced a trap composed of 5 places in 858 ms of which 0 ms to minimize.
[2024-06-01 11:13:10] [INFO ] Deduced a trap composed of 4 places in 1014 ms of which 0 ms to minimize.
[2024-06-01 11:13:11] [INFO ] Deduced a trap composed of 4 places in 721 ms of which 1 ms to minimize.
[2024-06-01 11:13:12] [INFO ] Deduced a trap composed of 4 places in 643 ms of which 1 ms to minimize.
[2024-06-01 11:13:13] [INFO ] Deduced a trap composed of 4 places in 900 ms of which 0 ms to minimize.
[2024-06-01 11:13:13] [INFO ] Deduced a trap composed of 4 places in 744 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-06-01 11:13:14] [INFO ] Deduced a trap composed of 5 places in 700 ms of which 0 ms to minimize.
[2024-06-01 11:13:15] [INFO ] Deduced a trap composed of 5 places in 594 ms of which 0 ms to minimize.
[2024-06-01 11:13:15] [INFO ] Deduced a trap composed of 5 places in 587 ms of which 0 ms to minimize.
[2024-06-01 11:13:16] [INFO ] Deduced a trap composed of 4 places in 862 ms of which 1 ms to minimize.
[2024-06-01 11:13:17] [INFO ] Deduced a trap composed of 4 places in 773 ms of which 0 ms to minimize.
[2024-06-01 11:13:18] [INFO ] Deduced a trap composed of 4 places in 649 ms of which 1 ms to minimize.
[2024-06-01 11:13:19] [INFO ] Deduced a trap composed of 4 places in 509 ms of which 1 ms to minimize.
[2024-06-01 11:13:19] [INFO ] Deduced a trap composed of 4 places in 432 ms of which 0 ms to minimize.
[2024-06-01 11:13:20] [INFO ] Deduced a trap composed of 5 places in 513 ms of which 0 ms to minimize.
[2024-06-01 11:13:20] [INFO ] Deduced a trap composed of 5 places in 432 ms of which 0 ms to minimize.
[2024-06-01 11:13:20] [INFO ] Deduced a trap composed of 5 places in 310 ms of which 1 ms to minimize.
[2024-06-01 11:13:21] [INFO ] Deduced a trap composed of 5 places in 230 ms of which 0 ms to minimize.
[2024-06-01 11:13:21] [INFO ] Deduced a trap composed of 5 places in 235 ms of which 0 ms to minimize.
[2024-06-01 11:13:21] [INFO ] Deduced a trap composed of 5 places in 194 ms of which 0 ms to minimize.
[2024-06-01 11:13:22] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 0 ms to minimize.
[2024-06-01 11:13:23] [INFO ] Deduced a trap composed of 4 places in 879 ms of which 1 ms to minimize.
[2024-06-01 11:13:23] [INFO ] Deduced a trap composed of 4 places in 763 ms of which 0 ms to minimize.
[2024-06-01 11:13:24] [INFO ] Deduced a trap composed of 4 places in 677 ms of which 1 ms to minimize.
[2024-06-01 11:13:25] [INFO ] Deduced a trap composed of 4 places in 765 ms of which 1 ms to minimize.
[2024-06-01 11:13:25] [INFO ] Deduced a trap composed of 4 places in 591 ms of which 0 ms to minimize.
SMT process timed out in 30491ms, After SMT, problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 30492ms
Finished structural reductions in LTL mode , in 1 iterations and 32816 ms. Remains : 37/37 places, 3132/3132 transitions.
Treatment of property StigmergyCommit-PT-10a-LTLCardinality-15 finished in 120957 ms.
[2024-06-01 11:13:26] [INFO ] Flatten gal took : 302 ms
[2024-06-01 11:13:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:13:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 178 places, 4342 transitions and 90814 arcs took 58 ms.
Total runtime 1316551 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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