Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 11 17:51 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 1.8M 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-06a-LTLCardinality-00
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-01
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-02
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-03
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-04
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-05
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-06
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-07
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-08
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-09
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-10
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-11
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-12
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-13
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-14
FORMULA_NAME StigmergyCommit-PT-06a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716989723968

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:35:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 13:35:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:35:25] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2024-05-29 13:35:25] [INFO ] Transformed 256 places.
[2024-05-29 13:35:25] [INFO ] Transformed 2816 transitions.
[2024-05-29 13:35:25] [INFO ] Found NUPN structural information;
[2024-05-29 13:35:25] [INFO ] Parsed PT model containing 256 places and 2816 transitions and 35321 arcs in 397 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 587/587 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 212 transition count 538
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 212 transition count 538
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 92 place count 212 transition count 534
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 111 place count 193 transition count 511
Iterating global reduction 1 with 19 rules applied. Total rules applied 130 place count 193 transition count 511
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 135 place count 193 transition count 506
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 190 transition count 503
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 190 transition count 503
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 187 transition count 500
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 187 transition count 500
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 185 transition count 498
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 185 transition count 498
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 153 place count 183 transition count 496
Iterating global reduction 2 with 2 rules applied. Total rules applied 155 place count 183 transition count 496
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 157 place count 183 transition count 494
Applied a total of 157 rules in 82 ms. Remains 183 /256 variables (removed 73) and now considering 494/587 (removed 93) transitions.
[2024-05-29 13:35:25] [INFO ] Flow matrix only has 483 transitions (discarded 11 similar events)
// Phase 1: matrix 483 rows 183 cols
[2024-05-29 13:35:25] [INFO ] Computed 3 invariants in 23 ms
[2024-05-29 13:35:26] [INFO ] Implicit Places using invariants in 316 ms returned []
[2024-05-29 13:35:26] [INFO ] Flow matrix only has 483 transitions (discarded 11 similar events)
[2024-05-29 13:35:26] [INFO ] Invariant cache hit.
[2024-05-29 13:35:26] [INFO ] State equation strengthened by 332 read => feed constraints.
[2024-05-29 13:35:26] [INFO ] Implicit Places using invariants and state equation in 725 ms returned [182]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1073 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 182/256 places, 494/587 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 167 transition count 479
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 167 transition count 479
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 35 place count 167 transition count 474
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 162 transition count 469
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 162 transition count 469
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 157 transition count 464
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 157 transition count 464
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 59 place count 153 transition count 460
Iterating global reduction 1 with 4 rules applied. Total rules applied 63 place count 153 transition count 460
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 67 place count 149 transition count 456
Iterating global reduction 1 with 4 rules applied. Total rules applied 71 place count 149 transition count 456
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 74 place count 146 transition count 453
Iterating global reduction 1 with 3 rules applied. Total rules applied 77 place count 146 transition count 453
Applied a total of 77 rules in 29 ms. Remains 146 /182 variables (removed 36) and now considering 453/494 (removed 41) transitions.
[2024-05-29 13:35:26] [INFO ] Flow matrix only has 442 transitions (discarded 11 similar events)
// Phase 1: matrix 442 rows 146 cols
[2024-05-29 13:35:26] [INFO ] Computed 2 invariants in 4 ms
[2024-05-29 13:35:27] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-29 13:35:27] [INFO ] Flow matrix only has 442 transitions (discarded 11 similar events)
[2024-05-29 13:35:27] [INFO ] Invariant cache hit.
[2024-05-29 13:35:27] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:35:27] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 146/256 places, 453/587 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1508 ms. Remains : 146/256 places, 453/587 transitions.
Support contains 27 out of 146 places after structural reductions.
[2024-05-29 13:35:27] [INFO ] Flatten gal took : 73 ms
[2024-05-29 13:35:27] [INFO ] Flatten gal took : 37 ms
[2024-05-29 13:35:27] [INFO ] Input system was already deterministic with 453 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 40000 steps (18 resets) in 3504 ms. (11 steps per ms) remains 0/15 properties
Computed a total of 16 stabilizing places and 16 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((G(p1) U X(p2)) U p3))||p0))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 453/453 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 131 transition count 436
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 131 transition count 436
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 33 place count 131 transition count 433
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 43 place count 121 transition count 422
Iterating global reduction 1 with 10 rules applied. Total rules applied 53 place count 121 transition count 422
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 55 place count 121 transition count 420
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 115 transition count 414
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 115 transition count 414
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 71 place count 111 transition count 410
Iterating global reduction 2 with 4 rules applied. Total rules applied 75 place count 111 transition count 410
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 107 transition count 406
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 107 transition count 406
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 84 place count 107 transition count 405
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 86 place count 105 transition count 403
Iterating global reduction 3 with 2 rules applied. Total rules applied 88 place count 105 transition count 403
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 90 place count 105 transition count 401
Applied a total of 90 rules in 20 ms. Remains 105 /146 variables (removed 41) and now considering 401/453 (removed 52) transitions.
[2024-05-29 13:35:29] [INFO ] Flow matrix only has 392 transitions (discarded 9 similar events)
// Phase 1: matrix 392 rows 105 cols
[2024-05-29 13:35:29] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:35:29] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-29 13:35:29] [INFO ] Flow matrix only has 392 transitions (discarded 9 similar events)
[2024-05-29 13:35:29] [INFO ] Invariant cache hit.
[2024-05-29 13:35:29] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:35:29] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2024-05-29 13:35:29] [INFO ] Flow matrix only has 392 transitions (discarded 9 similar events)
[2024-05-29 13:35:29] [INFO ] Invariant cache hit.
[2024-05-29 13:35:29] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-29 13:35:33] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 11 ms to minimize.
[2024-05-29 13:35:33] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2024-05-29 13:35:33] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 2 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 1 ms to minimize.
[2024-05-29 13:35:34] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 15 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:35:35] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:35:36] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-29 13:35:37] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:35:37] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:35:37] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:35:37] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:35:38] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:35:38] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:35:38] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:35:38] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:35:38] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:35:38] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:35:38] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:35:38] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 2 ms to minimize.
[2024-05-29 13:35:38] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:35:39] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 14/55 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-29 13:35:39] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:35:39] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 0 ms to minimize.
[2024-05-29 13:35:39] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 8 ms to minimize.
[2024-05-29 13:35:39] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:35:40] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:35:41] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 15/70 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-29 13:35:41] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:35:41] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:35:44] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 2/74 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-29 13:35:45] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:35:46] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-29 13:35:46] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:35:47] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/105 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 11 (OVERLAPS) 391/496 variables, 105/183 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/496 variables, 259/442 constraints. Problems are: Problem set: 0 solved, 400 unsolved
[2024-05-29 13:35:59] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/496 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 496/497 variables, and 443 constraints, problems are : Problem set: 0 solved, 400 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 400 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (OVERLAPS) 1/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 4 (OVERLAPS) 391/496 variables, 105/184 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 259/443 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 400/843 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 400 unsolved
SMT process timed out in 62061ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 62082ms
Starting structural reductions in LTL mode, iteration 1 : 105/146 places, 401/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62403 ms. Remains : 105/146 places, 401/453 transitions.
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 p3), (X p0), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06a-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-00 finished in 63105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 453/453 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 128 transition count 433
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 128 transition count 433
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 128 transition count 429
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 52 place count 116 transition count 415
Iterating global reduction 1 with 12 rules applied. Total rules applied 64 place count 116 transition count 415
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 116 transition count 411
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 76 place count 108 transition count 403
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 108 transition count 403
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 88 place count 104 transition count 399
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 104 transition count 399
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 96 place count 100 transition count 395
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 100 transition count 395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 100 transition count 394
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 98 transition count 392
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 98 transition count 392
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 107 place count 98 transition count 390
Applied a total of 107 rules in 20 ms. Remains 98 /146 variables (removed 48) and now considering 390/453 (removed 63) transitions.
[2024-05-29 13:36:32] [INFO ] Flow matrix only has 382 transitions (discarded 8 similar events)
// Phase 1: matrix 382 rows 98 cols
[2024-05-29 13:36:32] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 13:36:32] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-29 13:36:32] [INFO ] Flow matrix only has 382 transitions (discarded 8 similar events)
[2024-05-29 13:36:32] [INFO ] Invariant cache hit.
[2024-05-29 13:36:32] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:36:33] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
Running 389 sub problems to find dead transitions.
[2024-05-29 13:36:33] [INFO ] Flow matrix only has 382 transitions (discarded 8 similar events)
[2024-05-29 13:36:33] [INFO ] Invariant cache hit.
[2024-05-29 13:36:33] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:36] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:36:36] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:36:36] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:36:36] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:36:36] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:36:37] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2024-05-29 13:36:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:36:39] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:36:39] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:36:39] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:36:39] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:36:39] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:36:39] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:36:40] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:36:41] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:42] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:36:42] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:36:42] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:43] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:36:44] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 2 ms to minimize.
[2024-05-29 13:36:44] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:36:44] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:36:44] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:46] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:36:46] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 2/71 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:46] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:36:46] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:36:46] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-29 13:36:46] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:36:46] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:36:47] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 6/77 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:48] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:36:48] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:50] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:36:50] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:36:50] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:36:50] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 12 (OVERLAPS) 381/479 variables, 98/181 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/479 variables, 259/440 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:36:59] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:37:00] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/479 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 479/480 variables, and 442 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 84/84 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 84/85 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:37:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:37:07] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 3/88 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 381/479 variables, 98/186 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/479 variables, 259/445 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/479 variables, 389/834 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/479 variables, 0/834 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SMT process timed out in 61788ms, After SMT, problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 61793ms
Starting structural reductions in LTL mode, iteration 1 : 98/146 places, 390/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62586 ms. Remains : 98/146 places, 390/453 transitions.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 95 ms.
Product exploration explored 100000 steps with 50000 reset in 91 ms.
Computed a total of 5 stabilizing places and 5 stable transitions
Computed a total of 5 stabilizing places and 5 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-06a-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-01 finished in 62961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(G(p1))||G((G(p2) U p0))))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 453/453 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 146 transition count 387
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 73 rules applied. Total rules applied 139 place count 80 transition count 380
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 142 place count 79 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 143 place count 78 transition count 378
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 143 place count 78 transition count 369
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 161 place count 69 transition count 369
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 166 place count 64 transition count 362
Iterating global reduction 4 with 5 rules applied. Total rules applied 171 place count 64 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 172 place count 64 transition count 361
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 172 place count 64 transition count 360
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 174 place count 63 transition count 360
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 176 place count 61 transition count 356
Iterating global reduction 5 with 2 rules applied. Total rules applied 178 place count 61 transition count 356
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 184 place count 61 transition count 350
Performed 31 Post agglomeration using F-continuation condition with reduction of 17 identical transitions.
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 246 place count 30 transition count 302
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 6 with 63 rules applied. Total rules applied 309 place count 30 transition count 239
Drop transitions (Redundant composition of simpler transitions.) removed 195 transitions
Redundant transition composition rules discarded 195 transitions
Iterating global reduction 7 with 195 rules applied. Total rules applied 504 place count 30 transition count 44
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 7 with 14 rules applied. Total rules applied 518 place count 23 transition count 37
Applied a total of 518 rules in 77 ms. Remains 23 /146 variables (removed 123) and now considering 37/453 (removed 416) transitions.
[2024-05-29 13:37:35] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
// Phase 1: matrix 30 rows 23 cols
[2024-05-29 13:37:35] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:37:35] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 13:37:35] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
[2024-05-29 13:37:35] [INFO ] Invariant cache hit.
[2024-05-29 13:37:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 13:37:35] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-29 13:37:35] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-29 13:37:35] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
[2024-05-29 13:37:35] [INFO ] Invariant cache hit.
[2024-05-29 13:37:35] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 3 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:36] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 29/52 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 1/53 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (OVERLAPS) 0/53 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 71 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1713 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:37] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 29/52 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 36/110 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 1/53 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/53 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 111 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 38/38 constraints]
After SMT, in 2885ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2887ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/146 places, 37/453 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3044 ms. Remains : 23/146 places, 37/453 transitions.
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 139 ms.
Product exploration explored 100000 steps with 0 reset in 130 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 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (NOT (OR (AND p0 p1) (AND p1 p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 p1) (AND p1 p2))))), (X (X (AND p0 (NOT p1)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 27 factoid took 160 ms. Reduced automaton from 5 states, 28 edges and 3 AP (stutter insensitive) to 4 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) p2 (NOT p0))]
RANDOM walk for 40000 steps (4073 resets) in 375 ms. (106 steps per ms) remains 5/17 properties
BEST_FIRST walk for 40003 steps (757 resets) in 171 ms. (232 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (795 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (793 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (773 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (784 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
[2024-05-29 13:37:39] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
[2024-05-29 13:37:39] [INFO ] Invariant cache hit.
[2024-05-29 13:37:39] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 19/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf5 is UNSAT
Problem apf6 is UNSAT
At refinement iteration 3 (OVERLAPS) 29/52 variables, 23/24 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 12/36 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:39] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
Problem apf2 is UNSAT
Problem apf7 is UNSAT
Problem apf9 is UNSAT
After SMT solving in domain Real declared 52/53 variables, and 39 constraints, problems are : Problem set: 5 solved, 0 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 12/13 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 119ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 5 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT p0)), (X (NOT (OR (AND p0 p1) (AND p1 p2)))), (X (NOT (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (OR (AND p0 p1) (AND p1 p2))))), (X (X (AND p0 (NOT p1)))), (X (X (OR (AND p0 (NOT p1)) (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT p1))), (G (OR (NOT p1) p0)), (G (OR (NOT p1) p2 p0)), (G (OR p1 (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) p0)), (G (OR (NOT p1) (NOT p2) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (OR (NOT p1) (NOT p2)) (OR (NOT p1) (NOT p0))))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR p1 p0))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0))), (F p2), (F p1), (F (NOT (OR p1 p2 p0))), (F (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) p0)))), (F (NOT (OR p1 (NOT p2) (NOT p0))))]
Knowledge based reduction with 32 factoid took 602 ms. Reduced automaton from 4 states, 24 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 23 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 37/37 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 37/37 (removed 0) transitions.
[2024-05-29 13:37:40] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
[2024-05-29 13:37:40] [INFO ] Invariant cache hit.
[2024-05-29 13:37:40] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 13:37:40] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
[2024-05-29 13:37:40] [INFO ] Invariant cache hit.
[2024-05-29 13:37:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-29 13:37:40] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-29 13:37:40] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-05-29 13:37:40] [INFO ] Flow matrix only has 30 transitions (discarded 7 similar events)
[2024-05-29 13:37:40] [INFO ] Invariant cache hit.
[2024-05-29 13:37:40] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 6 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:37:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 29/52 variables, 23/58 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 1/53 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/53 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 13 (OVERLAPS) 0/53 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 53/53 variables, and 71 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1857 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1/23 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 36 unsolved
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:42] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 29/52 variables, 23/62 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 12/74 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 36/110 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 9 (OVERLAPS) 1/53 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 11 (OVERLAPS) 0/53 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 53/53 variables, and 111 constraints, problems are : Problem set: 0 solved, 36 unsolved in 1066 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 23/23 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 38/38 constraints]
After SMT, in 2935ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 2936ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3017 ms. Remains : 23/23 places, 37/37 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 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(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 111 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 156 ms.
Product exploration explored 100000 steps with 0 reset in 87 ms.
Support contains 2 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 37/37 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 21 transition count 35
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 2 with 4 rules applied. Total rules applied 8 place count 19 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 19 transition count 32
Applied a total of 9 rules in 4 ms. Remains 19 /23 variables (removed 4) and now considering 32/37 (removed 5) transitions.
[2024-05-29 13:37:43] [INFO ] Flow matrix only has 24 transitions (discarded 8 similar events)
// Phase 1: matrix 24 rows 19 cols
[2024-05-29 13:37:43] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:37:44] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-29 13:37:44] [INFO ] Flow matrix only has 24 transitions (discarded 8 similar events)
[2024-05-29 13:37:44] [INFO ] Invariant cache hit.
[2024-05-29 13:37:44] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-05-29 13:37:44] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-29 13:37:44] [INFO ] Redundant transitions in 1 ms returned []
Running 31 sub problems to find dead transitions.
[2024-05-29 13:37:44] [INFO ] Flow matrix only has 24 transitions (discarded 8 similar events)
[2024-05-29 13:37:44] [INFO ] Invariant cache hit.
[2024-05-29 13:37:44] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:44] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 15/36 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 23/42 variables, 19/55 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 11/66 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 1/43 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (OVERLAPS) 0/43 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 67 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1341 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 35/35 constraints]
Escalating to Integer solving :Problem set: 0 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 35/36 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:37:45] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:37:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:45] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:37:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 31 unsolved
[2024-05-29 13:37:45] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 8 (OVERLAPS) 23/42 variables, 19/60 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/42 variables, 11/71 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/42 variables, 31/102 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 12 (OVERLAPS) 1/43 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/43 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 14 (OVERLAPS) 0/43 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 103 constraints, problems are : Problem set: 0 solved, 31 unsolved in 1146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 40/40 constraints]
After SMT, in 2498ms problems are : Problem set: 0 solved, 31 unsolved
Search for dead transitions found 0 dead transitions in 2500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/23 places, 32/37 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2592 ms. Remains : 19/23 places, 32/37 transitions.
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-02 finished in 11437 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 G(p1)))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 453/453 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 145 transition count 386
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 74 rules applied. Total rules applied 140 place count 79 transition count 378
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 145 place count 77 transition count 375
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 3 with 3 rules applied. Total rules applied 148 place count 76 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 75 transition count 373
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 149 place count 75 transition count 365
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 165 place count 67 transition count 365
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 170 place count 62 transition count 357
Iterating global reduction 5 with 5 rules applied. Total rules applied 175 place count 62 transition count 357
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 178 place count 62 transition count 354
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 178 place count 62 transition count 353
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 180 place count 61 transition count 353
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 182 place count 59 transition count 349
Iterating global reduction 6 with 2 rules applied. Total rules applied 184 place count 59 transition count 349
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 188 place count 59 transition count 345
Performed 23 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 234 place count 36 transition count 313
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 7 with 64 rules applied. Total rules applied 298 place count 36 transition count 249
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 304 place count 33 transition count 246
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 307 place count 33 transition count 243
Drop transitions (Redundant composition of simpler transitions.) removed 189 transitions
Redundant transition composition rules discarded 189 transitions
Iterating global reduction 9 with 189 rules applied. Total rules applied 496 place count 33 transition count 54
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 9 with 14 rules applied. Total rules applied 510 place count 26 transition count 47
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 513 place count 26 transition count 47
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 517 place count 22 transition count 43
Applied a total of 517 rules in 68 ms. Remains 22 /146 variables (removed 124) and now considering 43/453 (removed 410) transitions.
[2024-05-29 13:37:46] [INFO ] Flow matrix only has 35 transitions (discarded 8 similar events)
// Phase 1: matrix 35 rows 22 cols
[2024-05-29 13:37:46] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:37:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 13:37:46] [INFO ] Flow matrix only has 35 transitions (discarded 8 similar events)
[2024-05-29 13:37:46] [INFO ] Invariant cache hit.
[2024-05-29 13:37:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-29 13:37:46] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2024-05-29 13:37:46] [INFO ] Flow matrix only has 35 transitions (discarded 8 similar events)
[2024-05-29 13:37:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 17/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 34/56 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 14/54 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:37:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/56 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 10 (OVERLAPS) 0/56 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/57 variables, and 61 constraints, problems are : Problem set: 0 solved, 22 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 7/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 38/39 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:48] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 34/56 variables, 22/66 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 22/88 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/57 variables, and 88 constraints, problems are : Problem set: 0 solved, 22 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 43/43 constraints]
After SMT, in 1796ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 1796ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/146 places, 43/453 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1932 ms. Remains : 22/146 places, 43/453 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 98 ms.
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-04 finished in 2202 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 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 453/453 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 145 transition count 383
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 77 rules applied. Total rules applied 146 place count 76 transition count 375
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 151 place count 74 transition count 372
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 153 place count 73 transition count 371
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 153 place count 73 transition count 362
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 171 place count 64 transition count 362
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 176 place count 59 transition count 354
Iterating global reduction 4 with 5 rules applied. Total rules applied 181 place count 59 transition count 354
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 184 place count 59 transition count 351
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 184 place count 59 transition count 350
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 186 place count 58 transition count 350
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 188 place count 56 transition count 346
Iterating global reduction 5 with 2 rules applied. Total rules applied 190 place count 56 transition count 346
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 202 place count 56 transition count 334
Performed 23 Post agglomeration using F-continuation condition with reduction of 11 identical transitions.
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 248 place count 33 transition count 300
Ensure Unique test removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Iterating post reduction 6 with 119 rules applied. Total rules applied 367 place count 33 transition count 181
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 373 place count 30 transition count 178
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 376 place count 30 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 133 transitions
Redundant transition composition rules discarded 133 transitions
Iterating global reduction 8 with 133 rules applied. Total rules applied 509 place count 30 transition count 42
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 8 with 14 rules applied. Total rules applied 523 place count 23 transition count 35
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 525 place count 23 transition count 35
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 529 place count 19 transition count 31
Applied a total of 529 rules in 55 ms. Remains 19 /146 variables (removed 127) and now considering 31/453 (removed 422) transitions.
[2024-05-29 13:37:48] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
// Phase 1: matrix 23 rows 19 cols
[2024-05-29 13:37:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 13:37:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 13:37:48] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 13:37:48] [INFO ] Invariant cache hit.
[2024-05-29 13:37:49] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-29 13:37:49] [INFO ] Redundant transitions in 0 ms returned []
Running 19 sub problems to find dead transitions.
[2024-05-29 13:37:49] [INFO ] Flow matrix only has 23 transitions (discarded 8 similar events)
[2024-05-29 13:37:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 7/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 22/41 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:49] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/41 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/42 variables, and 51 constraints, problems are : Problem set: 0 solved, 19 unsolved in 930 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 7/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 13:37:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 13:37:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 13:37:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 13:37:50] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 13:37:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 13:37:50] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 13:37:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 7/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-29 13:37:50] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/19 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 22/41 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/41 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/42 variables, and 78 constraints, problems are : Problem set: 0 solved, 19 unsolved in 475 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 39/39 constraints]
After SMT, in 1409ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 1409ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/146 places, 31/453 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1528 ms. Remains : 19/146 places, 31/453 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-06 finished in 1620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(F(p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 453/453 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 128 transition count 432
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 128 transition count 432
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 128 transition count 428
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 53 place count 115 transition count 413
Iterating global reduction 1 with 13 rules applied. Total rules applied 66 place count 115 transition count 413
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 70 place count 115 transition count 409
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 108 transition count 402
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 108 transition count 402
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 103 transition count 397
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 103 transition count 397
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 98 transition count 392
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 98 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 98 transition count 391
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 108 place count 95 transition count 388
Iterating global reduction 3 with 3 rules applied. Total rules applied 111 place count 95 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 114 place count 95 transition count 385
Applied a total of 114 rules in 14 ms. Remains 95 /146 variables (removed 51) and now considering 385/453 (removed 68) transitions.
[2024-05-29 13:37:50] [INFO ] Flow matrix only has 376 transitions (discarded 9 similar events)
// Phase 1: matrix 376 rows 95 cols
[2024-05-29 13:37:50] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 13:37:50] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-29 13:37:50] [INFO ] Flow matrix only has 376 transitions (discarded 9 similar events)
[2024-05-29 13:37:50] [INFO ] Invariant cache hit.
[2024-05-29 13:37:50] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:37:50] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-05-29 13:37:50] [INFO ] Flow matrix only has 376 transitions (discarded 9 similar events)
[2024-05-29 13:37:50] [INFO ] Invariant cache hit.
[2024-05-29 13:37:50] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 2 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:37:54] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 0 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:37:55] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 0 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-29 13:37:56] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:37:57] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2024-05-29 13:37:57] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-29 13:37:57] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:37:57] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:37:57] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-29 13:37:57] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:37:57] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 17 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 1 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:37:58] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:37:59] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:37:59] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:37:59] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 13:37:59] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-29 13:37:59] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:37:59] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:37:59] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:37:59] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-29 13:38:00] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 8/70 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:38:01] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/95 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (OVERLAPS) 375/470 variables, 95/166 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/470 variables, 259/425 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 11 (OVERLAPS) 1/471 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:38:13] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/471 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 427 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 95/95 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 70/70 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:38:24] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:38:24] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:38:24] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:38:25] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (OVERLAPS) 375/470 variables, 95/171 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 259/430 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 384/814 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/814 constraints. Problems are: Problem set: 0 solved, 384 unsolved
SMT process timed out in 61683ms, After SMT, problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 61689ms
Starting structural reductions in LTL mode, iteration 1 : 95/146 places, 385/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61965 ms. Remains : 95/146 places, 385/453 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-10 finished in 62169 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&&X(F(!p0)))||G(F(!p0))))))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 453/453 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 128 transition count 433
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 128 transition count 433
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 128 transition count 430
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 52 place count 115 transition count 416
Iterating global reduction 1 with 13 rules applied. Total rules applied 65 place count 115 transition count 416
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 69 place count 115 transition count 412
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 77 place count 107 transition count 404
Iterating global reduction 2 with 8 rules applied. Total rules applied 85 place count 107 transition count 404
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 101 transition count 398
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 101 transition count 398
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 95 transition count 392
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 95 transition count 392
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 110 place count 95 transition count 391
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 113 place count 92 transition count 388
Iterating global reduction 3 with 3 rules applied. Total rules applied 116 place count 92 transition count 388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 119 place count 92 transition count 385
Applied a total of 119 rules in 12 ms. Remains 92 /146 variables (removed 54) and now considering 385/453 (removed 68) transitions.
[2024-05-29 13:38:52] [INFO ] Flow matrix only has 376 transitions (discarded 9 similar events)
// Phase 1: matrix 376 rows 92 cols
[2024-05-29 13:38:52] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 13:38:52] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-29 13:38:52] [INFO ] Flow matrix only has 376 transitions (discarded 9 similar events)
[2024-05-29 13:38:52] [INFO ] Invariant cache hit.
[2024-05-29 13:38:52] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:38:53] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-05-29 13:38:53] [INFO ] Flow matrix only has 376 transitions (discarded 9 similar events)
[2024-05-29 13:38:53] [INFO ] Invariant cache hit.
[2024-05-29 13:38:53] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:38:56] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:38:56] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2024-05-29 13:38:56] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2024-05-29 13:38:56] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:38:56] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 0 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:38:57] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 0 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 0 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 0 ms to minimize.
[2024-05-29 13:38:58] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-29 13:38:59] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:39:00] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:39:00] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 16 places in 215 ms of which 0 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 1 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 0 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:39:01] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:39:02] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:39:02] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-05-29 13:39:02] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:39:02] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:39:02] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:39:02] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 17 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-29 13:39:03] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2024-05-29 13:39:04] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:39:04] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:39:04] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 6/67 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:39:04] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:39:05] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 0 ms to minimize.
[2024-05-29 13:39:05] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:39:05] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:39:05] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2024-05-29 13:39:06] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 14 ms to minimize.
[2024-05-29 13:39:06] [INFO ] Deduced a trap composed of 13 places in 497 ms of which 1 ms to minimize.
[2024-05-29 13:39:06] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:39:07] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 13:39:07] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:39:07] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 18 places in 52 ms of which 1 ms to minimize.
[2024-05-29 13:39:08] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:39:09] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 10 (OVERLAPS) 375/467 variables, 92/174 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 259/433 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:39:14] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/467 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/468 variables, and 434 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 259/260 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 82/82 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 82/83 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:39:26] [INFO ] Deduced a trap composed of 14 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:39:26] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:39:27] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (OVERLAPS) 375/467 variables, 92/178 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 259/437 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 384/821 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 0/821 constraints. Problems are: Problem set: 0 solved, 384 unsolved
SMT process timed out in 61857ms, After SMT, problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 61862ms
Starting structural reductions in LTL mode, iteration 1 : 92/146 places, 385/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62223 ms. Remains : 92/146 places, 385/453 transitions.
Stuttering acceptance computed with spot in 104 ms :[p0, p0, p0]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-11
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-11 finished in 62359 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 453/453 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 127 transition count 431
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 127 transition count 431
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 127 transition count 427
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 55 place count 114 transition count 412
Iterating global reduction 1 with 13 rules applied. Total rules applied 68 place count 114 transition count 412
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 114 transition count 408
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 80 place count 106 transition count 400
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 106 transition count 400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 101 transition count 395
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 101 transition count 395
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 96 transition count 390
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 96 transition count 390
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 96 transition count 389
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 111 place count 94 transition count 387
Iterating global reduction 3 with 2 rules applied. Total rules applied 113 place count 94 transition count 387
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 94 transition count 385
Applied a total of 115 rules in 21 ms. Remains 94 /146 variables (removed 52) and now considering 385/453 (removed 68) transitions.
[2024-05-29 13:39:55] [INFO ] Flow matrix only has 377 transitions (discarded 8 similar events)
// Phase 1: matrix 377 rows 94 cols
[2024-05-29 13:39:55] [INFO ] Computed 1 invariants in 2 ms
[2024-05-29 13:39:55] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-29 13:39:55] [INFO ] Flow matrix only has 377 transitions (discarded 8 similar events)
[2024-05-29 13:39:55] [INFO ] Invariant cache hit.
[2024-05-29 13:39:55] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:39:55] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2024-05-29 13:39:55] [INFO ] Flow matrix only has 377 transitions (discarded 8 similar events)
[2024-05-29 13:39:55] [INFO ] Invariant cache hit.
[2024-05-29 13:39:55] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:39:58] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2024-05-29 13:39:58] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 0 ms to minimize.
[2024-05-29 13:39:58] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:39:58] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 1 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 0 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 15 places in 98 ms of which 0 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 1 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:39:59] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 1 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 0 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 1 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 1 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 0 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 13:40:00] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 0 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 0 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 0 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 0 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 0 ms to minimize.
[2024-05-29 13:40:01] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:40:02] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:40:02] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:40:03] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-29 13:40:03] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:40:03] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:40:03] [INFO ] Deduced a trap composed of 13 places in 62 ms of which 1 ms to minimize.
[2024-05-29 13:40:03] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-29 13:40:03] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-29 13:40:03] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 22 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 10/51 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:40:04] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 4 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 0 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 0 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-29 13:40:05] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/94 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:40:07] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/94 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 384 unsolved
[2024-05-29 13:40:08] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:40:08] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/94 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/94 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 9 (OVERLAPS) 376/470 variables, 94/160 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/470 variables, 259/419 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/470 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 12 (OVERLAPS) 1/471 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 471/471 variables, and 420 constraints, problems are : Problem set: 0 solved, 384 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 94/94 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 65/65 constraints]
Escalating to Integer solving :Problem set: 0 solved, 384 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (OVERLAPS) 376/470 variables, 94/160 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 259/419 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 384/803 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 0/803 constraints. Problems are: Problem set: 0 solved, 384 unsolved
SMT process timed out in 61798ms, After SMT, problems are : Problem set: 0 solved, 384 unsolved
Search for dead transitions found 0 dead transitions in 61803ms
Starting structural reductions in LTL mode, iteration 1 : 94/146 places, 385/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62124 ms. Remains : 94/146 places, 385/453 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-13 finished in 62216 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 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 453/453 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 127 transition count 431
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 127 transition count 431
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 127 transition count 427
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 56 place count 113 transition count 411
Iterating global reduction 1 with 14 rules applied. Total rules applied 70 place count 113 transition count 411
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 113 transition count 407
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 83 place count 104 transition count 398
Iterating global reduction 2 with 9 rules applied. Total rules applied 92 place count 104 transition count 398
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 98 place count 98 transition count 392
Iterating global reduction 2 with 6 rules applied. Total rules applied 104 place count 98 transition count 392
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 110 place count 92 transition count 386
Iterating global reduction 2 with 6 rules applied. Total rules applied 116 place count 92 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 92 transition count 385
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 120 place count 89 transition count 382
Iterating global reduction 3 with 3 rules applied. Total rules applied 123 place count 89 transition count 382
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 126 place count 89 transition count 379
Applied a total of 126 rules in 17 ms. Remains 89 /146 variables (removed 57) and now considering 379/453 (removed 74) transitions.
[2024-05-29 13:40:57] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
// Phase 1: matrix 371 rows 89 cols
[2024-05-29 13:40:57] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 13:40:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-29 13:40:57] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
[2024-05-29 13:40:57] [INFO ] Invariant cache hit.
[2024-05-29 13:40:57] [INFO ] State equation strengthened by 260 read => feed constraints.
[2024-05-29 13:40:57] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2024-05-29 13:40:57] [INFO ] Flow matrix only has 371 transitions (discarded 8 similar events)
[2024-05-29 13:40:57] [INFO ] Invariant cache hit.
[2024-05-29 13:40:57] [INFO ] State equation strengthened by 260 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-29 13:41:00] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 1 ms to minimize.
[2024-05-29 13:41:00] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:41:00] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:41:00] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-05-29 13:41:00] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-29 13:41:00] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 0 ms to minimize.
[2024-05-29 13:41:00] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 82 ms of which 1 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 0 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 0 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 0 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 0 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-29 13:41:01] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:41:02] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 13:41:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:41:03] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-29 13:41:03] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 0 ms to minimize.
[2024-05-29 13:41:03] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 1 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 1 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 0 ms to minimize.
[2024-05-29 13:41:04] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:41:05] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2024-05-29 13:41:05] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 17/58 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-29 13:41:05] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-29 13:41:05] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:41:06] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-05-29 13:41:06] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 0 ms to minimize.
[2024-05-29 13:41:06] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 0 ms to minimize.
[2024-05-29 13:41:06] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
[2024-05-29 13:41:06] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-29 13:41:06] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-29 13:41:06] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-05-29 13:41:06] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-29 13:41:07] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-29 13:41:07] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-05-29 13:41:08] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2024-05-29 13:41:09] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 9 (OVERLAPS) 370/459 variables, 89/162 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 259/421 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-29 13:41:15] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-29 13:41:16] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 3/424 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/459 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 13 (OVERLAPS) 1/460 variables, 1/425 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 460/460 variables, and 425 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 260/260 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 378 unsolved
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 0 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-29 13:41:30] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-29 13:41:31] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (OVERLAPS) 370/459 variables, 89/172 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 259/431 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 378/809 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 378 unsolved
SMT process timed out in 61366ms, After SMT, problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 61372ms
Starting structural reductions in LTL mode, iteration 1 : 89/146 places, 379/453 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61663 ms. Remains : 89/146 places, 379/453 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-06a-LTLCardinality-15
Stuttering criterion allowed to conclude after 45 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-06a-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-06a-LTLCardinality-15 finished in 61751 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(G(p1))||G((G(p2) U p0))))))'
[2024-05-29 13:41:59] [INFO ] Flatten gal took : 33 ms
[2024-05-29 13:41:59] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-29 13:41:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 146 places, 453 transitions and 4056 arcs took 11 ms.
Total runtime 394191 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-06a

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 2996
MODEL NAME: /home/mcc/execution/407/model
146 places, 453 transitions.

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

BK_STOP 1716990124273

--------------------
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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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