Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 17:55 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.4M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717230531183

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:28:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:28:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:28:52] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2024-06-01 08:28:52] [INFO ] Transformed 1837 places.
[2024-06-01 08:28:52] [INFO ] Transformed 3460 transitions.
[2024-06-01 08:28:52] [INFO ] Found NUPN structural information;
[2024-06-01 08:28:52] [INFO ] Parsed PT model containing 1837 places and 3460 transitions and 22362 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA StigmergyCommit-PT-05b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-05b-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 1837 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1837/1837 places, 3460/3460 transitions.
Discarding 146 places :
Symmetric choice reduction at 0 with 146 rule applications. Total rules 146 place count 1691 transition count 3314
Iterating global reduction 0 with 146 rules applied. Total rules applied 292 place count 1691 transition count 3314
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 381 place count 1602 transition count 3225
Iterating global reduction 0 with 89 rules applied. Total rules applied 470 place count 1602 transition count 3225
Discarding 52 places :
Symmetric choice reduction at 0 with 52 rule applications. Total rules 522 place count 1550 transition count 3173
Iterating global reduction 0 with 52 rules applied. Total rules applied 574 place count 1550 transition count 3173
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 620 place count 1504 transition count 3127
Iterating global reduction 0 with 46 rules applied. Total rules applied 666 place count 1504 transition count 3127
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 707 place count 1463 transition count 3086
Iterating global reduction 0 with 41 rules applied. Total rules applied 748 place count 1463 transition count 3086
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 789 place count 1422 transition count 3045
Iterating global reduction 0 with 41 rules applied. Total rules applied 830 place count 1422 transition count 3045
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 870 place count 1382 transition count 3005
Iterating global reduction 0 with 40 rules applied. Total rules applied 910 place count 1382 transition count 3005
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 950 place count 1342 transition count 2965
Iterating global reduction 0 with 40 rules applied. Total rules applied 990 place count 1342 transition count 2965
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 1024 place count 1308 transition count 2931
Iterating global reduction 0 with 34 rules applied. Total rules applied 1058 place count 1308 transition count 2931
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 1086 place count 1280 transition count 2903
Iterating global reduction 0 with 28 rules applied. Total rules applied 1114 place count 1280 transition count 2903
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 1120 place count 1280 transition count 2897
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1130 place count 1270 transition count 2887
Iterating global reduction 1 with 10 rules applied. Total rules applied 1140 place count 1270 transition count 2887
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 1150 place count 1260 transition count 2877
Iterating global reduction 1 with 10 rules applied. Total rules applied 1160 place count 1260 transition count 2877
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1166 place count 1254 transition count 2871
Iterating global reduction 1 with 6 rules applied. Total rules applied 1172 place count 1254 transition count 2871
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1178 place count 1248 transition count 2865
Iterating global reduction 1 with 6 rules applied. Total rules applied 1184 place count 1248 transition count 2865
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1190 place count 1242 transition count 2859
Iterating global reduction 1 with 6 rules applied. Total rules applied 1196 place count 1242 transition count 2859
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 1202 place count 1236 transition count 2853
Iterating global reduction 1 with 6 rules applied. Total rules applied 1208 place count 1236 transition count 2853
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1213 place count 1231 transition count 2848
Iterating global reduction 1 with 5 rules applied. Total rules applied 1218 place count 1231 transition count 2848
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1223 place count 1226 transition count 2843
Iterating global reduction 1 with 5 rules applied. Total rules applied 1228 place count 1226 transition count 2843
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1233 place count 1221 transition count 2838
Iterating global reduction 1 with 5 rules applied. Total rules applied 1238 place count 1221 transition count 2838
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1243 place count 1216 transition count 2833
Iterating global reduction 1 with 5 rules applied. Total rules applied 1248 place count 1216 transition count 2833
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1253 place count 1211 transition count 2828
Iterating global reduction 1 with 5 rules applied. Total rules applied 1258 place count 1211 transition count 2828
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 1263 place count 1206 transition count 2823
Iterating global reduction 1 with 5 rules applied. Total rules applied 1268 place count 1206 transition count 2823
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 1273 place count 1206 transition count 2818
Applied a total of 1273 rules in 2109 ms. Remains 1206 /1837 variables (removed 631) and now considering 2818/3460 (removed 642) transitions.
// Phase 1: matrix 2818 rows 1206 cols
[2024-06-01 08:28:55] [INFO ] Computed 7 invariants in 64 ms
[2024-06-01 08:28:55] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-06-01 08:28:55] [INFO ] Invariant cache hit.
[2024-06-01 08:28:56] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1790 ms to find 0 implicit places.
Running 2817 sub problems to find dead transitions.
[2024-06-01 08:28:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1205/4024 variables, and 0 constraints, problems are : Problem set: 0 solved, 2817 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1206 constraints, PredecessorRefiner: 2817/2817 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2817 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1205/4024 variables, and 0 constraints, problems are : Problem set: 0 solved, 2817 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1206 constraints, PredecessorRefiner: 0/2817 constraints, Known Traps: 0/0 constraints]
After SMT, in 81330ms problems are : Problem set: 0 solved, 2817 unsolved
Search for dead transitions found 0 dead transitions in 81391ms
Starting structural reductions in LTL mode, iteration 1 : 1206/1837 places, 2818/3460 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85338 ms. Remains : 1206/1837 places, 2818/3460 transitions.
Support contains 50 out of 1206 places after structural reductions.
[2024-06-01 08:30:19] [INFO ] Flatten gal took : 349 ms
[2024-06-01 08:30:19] [INFO ] Flatten gal took : 171 ms
[2024-06-01 08:30:19] [INFO ] Input system was already deterministic with 2818 transitions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (354 resets) in 1724 ms. (23 steps per ms) remains 25/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
[2024-06-01 08:30:20] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1146/1192 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:30:22] [INFO ] Deduced a trap composed of 295 places in 680 ms of which 40 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1192 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1192 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 14/1206 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1206 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 2818/4024 variables, 1206/1214 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 4024/4024 variables, and 1214 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1206/1206 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 1146/1192 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1192 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 08:30:27] [INFO ] Deduced a trap composed of 300 places in 609 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1192 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1192 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 14/1206 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 2818/4024 variables, 1206/1215 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 4024/4024 variables, and 1240 constraints, problems are : Problem set: 0 solved, 25 unsolved in 5120 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1206/1206 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
After SMT, in 10510ms problems are : Problem set: 0 solved, 25 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 46 out of 1206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Graph (trivial) has 1148 edges and 1206 vertex of which 101 / 1206 are part of one of the 18 SCC in 6 ms
Free SCC test removed 83 places
Drop transitions (Empty/Sink Transition effects.) removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Graph (complete) has 2059 edges and 1123 vertex of which 1117 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.20 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 797 transitions
Trivial Post-agglo rules discarded 797 transitions
Performed 797 trivial Post agglomeration. Transition count delta: 797
Iterating post reduction 0 with 802 rules applied. Total rules applied 804 place count 1117 transition count 1904
Reduce places removed 797 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 816 rules applied. Total rules applied 1620 place count 320 transition count 1885
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1629 place count 313 transition count 1883
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1631 place count 311 transition count 1883
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 1631 place count 311 transition count 1818
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 1761 place count 246 transition count 1818
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1762 place count 246 transition count 1817
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 5 with 88 rules applied. Total rules applied 1850 place count 202 transition count 1773
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 1860 place count 202 transition count 1763
Discarding 22 places :
Symmetric choice reduction at 6 with 22 rule applications. Total rules 1882 place count 180 transition count 1730
Iterating global reduction 6 with 22 rules applied. Total rules applied 1904 place count 180 transition count 1730
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 1909 place count 180 transition count 1725
Discarding 15 places :
Symmetric choice reduction at 7 with 15 rule applications. Total rules 1924 place count 165 transition count 1710
Iterating global reduction 7 with 15 rules applied. Total rules applied 1939 place count 165 transition count 1710
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1948 place count 156 transition count 1701
Iterating global reduction 7 with 9 rules applied. Total rules applied 1957 place count 156 transition count 1701
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 1960 place count 156 transition count 1698
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1974 place count 149 transition count 1691
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1982 place count 145 transition count 1706
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1983 place count 145 transition count 1705
Free-agglomeration rule applied 47 times.
Iterating global reduction 9 with 47 rules applied. Total rules applied 2030 place count 145 transition count 1658
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 9 with 47 rules applied. Total rules applied 2077 place count 98 transition count 1658
Discarding 6 places :
Symmetric choice reduction at 10 with 6 rule applications. Total rules 2083 place count 92 transition count 1652
Iterating global reduction 10 with 6 rules applied. Total rules applied 2089 place count 92 transition count 1652
Drop transitions (Redundant composition of simpler transitions.) removed 63 transitions
Redundant transition composition rules discarded 63 transitions
Iterating global reduction 10 with 63 rules applied. Total rules applied 2152 place count 92 transition count 1589
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2154 place count 91 transition count 1588
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 2158 place count 89 transition count 1606
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 2163 place count 89 transition count 1606
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 2165 place count 89 transition count 1604
Applied a total of 2165 rules in 712 ms. Remains 89 /1206 variables (removed 1117) and now considering 1604/2818 (removed 1214) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 713 ms. Remains : 89/1206 places, 1604/2818 transitions.
RANDOM walk for 40000 steps (1853 resets) in 2312 ms. (17 steps per ms) remains 13/25 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 98 ms. (404 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/2 properties
BEST_FIRST walk for 580 steps (0 resets) in 4 ms. (116 steps per ms) remains 0/1 properties
Computed a total of 250 stabilizing places and 262 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X((p1||F(p2))))||p0)))'
Support contains 7 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 572 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2024-06-01 08:30:33] [INFO ] Computed 7 invariants in 46 ms
[2024-06-01 08:30:34] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-06-01 08:30:34] [INFO ] Invariant cache hit.
[2024-06-01 08:30:35] [INFO ] Implicit Places using invariants and state equation in 1432 ms returned []
Implicit Place search using SMT with State Equation took 1953 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:30:35] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 82592ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 82620ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85158 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 329 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-00
Product exploration explored 100000 steps with 886 reset in 355 ms.
Product exploration explored 100000 steps with 886 reset in 339 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (353 resets) in 267 ms. (149 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (55 resets) in 135 ms. (294 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (58 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
[2024-06-01 08:31:59] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1157/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3967/3967 variables, and 1185 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1164 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 1157/1164 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 1/1186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3967/3967 variables, and 1186 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2495 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3703ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 16749 steps, including 130 resets, run visited all 1 properties in 45 ms. (steps per millisecond=372 )
Parikh walk visited 1 properties in 51 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (G (OR p2 p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-05b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-05b-LTLFireability-00 finished in 90706 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 6 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 474 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
[2024-06-01 08:32:04] [INFO ] Invariant cache hit.
[2024-06-01 08:32:04] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-06-01 08:32:04] [INFO ] Invariant cache hit.
[2024-06-01 08:32:06] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 1919 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:32:06] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 80646ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 80671ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83072 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-01
Product exploration explored 100000 steps with 885 reset in 229 ms.
Product exploration explored 100000 steps with 897 reset in 210 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (358 resets) in 110 ms. (360 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (58 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 382476 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 1
Probabilistic random walk after 382476 steps, saw 77170 distinct states, run finished after 3004 ms. (steps per millisecond=127 ) properties seen :0
[2024-06-01 08:33:30] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1158/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3967/3967 variables, and 1185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 909 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1158/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3967/3967 variables, and 1186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1954 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2893ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 278 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=139 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-05b-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-05b-LTLFireability-01 finished in 89891 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((F(G(p1))&&p0)))))))'
Support contains 9 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 470 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
[2024-06-01 08:33:34] [INFO ] Invariant cache hit.
[2024-06-01 08:33:34] [INFO ] Implicit Places using invariants in 414 ms returned []
[2024-06-01 08:33:34] [INFO ] Invariant cache hit.
[2024-06-01 08:33:35] [INFO ] Implicit Places using invariants and state equation in 1240 ms returned []
Implicit Place search using SMT with State Equation took 1657 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:33:35] [INFO ] Invariant cache hit.
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 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
(s1 1)
(s2 1)
(s3 1)
(s4 1)
(s5 1)
(s6 1)
(s7 1)
(s8 1)
(s9 1)
(s10 1)
(s11 1)
(s12 1)
(s13 1)
(s14 1)
(s15 1)
(s16 1)
(s17 1)
(s18 1)
(s19 1)
(s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s42 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 81125ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 81155ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83293 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-02
Stuttering criterion allowed to conclude after 108 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-02 finished in 83563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 2 out of 1206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Graph (trivial) has 1201 edges and 1206 vertex of which 104 / 1206 are part of one of the 18 SCC in 3 ms
Free SCC test removed 86 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 831 transitions
Trivial Post-agglo rules discarded 831 transitions
Performed 831 trivial Post agglomeration. Transition count delta: 831
Iterating post reduction 0 with 831 rules applied. Total rules applied 832 place count 1119 transition count 1888
Reduce places removed 831 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 851 rules applied. Total rules applied 1683 place count 288 transition count 1868
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 1692 place count 281 transition count 1866
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1694 place count 279 transition count 1866
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 1694 place count 279 transition count 1806
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 1814 place count 219 transition count 1806
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1821 place count 212 transition count 1799
Iterating global reduction 4 with 7 rules applied. Total rules applied 1828 place count 212 transition count 1799
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1830 place count 210 transition count 1797
Iterating global reduction 4 with 2 rules applied. Total rules applied 1832 place count 210 transition count 1797
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1924 place count 164 transition count 1751
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1959 place count 129 transition count 392
Iterating global reduction 4 with 35 rules applied. Total rules applied 1994 place count 129 transition count 392
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 2012 place count 129 transition count 374
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 2030 place count 111 transition count 350
Iterating global reduction 5 with 18 rules applied. Total rules applied 2048 place count 111 transition count 350
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2065 place count 94 transition count 327
Iterating global reduction 5 with 17 rules applied. Total rules applied 2082 place count 94 transition count 327
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2087 place count 94 transition count 322
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2107 place count 84 transition count 336
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2108 place count 83 transition count 324
Iterating global reduction 6 with 1 rules applied. Total rules applied 2109 place count 83 transition count 324
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2110 place count 83 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 2116 place count 83 transition count 317
Applied a total of 2116 rules in 316 ms. Remains 83 /1206 variables (removed 1123) and now considering 317/2818 (removed 2501) transitions.
[2024-06-01 08:34:57] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
// Phase 1: matrix 310 rows 83 cols
[2024-06-01 08:34:57] [INFO ] Computed 2 invariants in 7 ms
[2024-06-01 08:34:57] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-01 08:34:57] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2024-06-01 08:34:57] [INFO ] Invariant cache hit.
[2024-06-01 08:34:57] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 08:34:57] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2024-06-01 08:34:57] [INFO ] Redundant transitions in 22 ms returned []
Running 292 sub problems to find dead transitions.
[2024-06-01 08:34:57] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2024-06-01 08:34:57] [INFO ] Invariant cache hit.
[2024-06-01 08:34:57] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:34:59] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:34:59] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:34:59] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:34:59] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:35:00] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:35:00] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:35:00] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 0 ms to minimize.
[2024-06-01 08:35:00] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:35:00] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:35:00] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-06-01 08:35:00] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2024-06-01 08:35:00] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:35:01] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:35:01] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:35:01] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2024-06-01 08:35:01] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:35:01] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2024-06-01 08:35:01] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:35:01] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:35:01] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:02] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:35:02] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 25 places in 88 ms of which 0 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 0 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:35:03] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:35:04] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 4 ms to minimize.
[2024-06-01 08:35:04] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:04] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:35:04] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2024-06-01 08:35:05] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:35:05] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:35:05] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:35:05] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:35:05] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:35:05] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 0 ms to minimize.
[2024-06-01 08:35:05] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:35:05] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:06] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
[2024-06-01 08:35:06] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:35:06] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2024-06-01 08:35:06] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 309/392 variables, 83/133 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 1/393 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 13 (OVERLAPS) 0/393 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 196 constraints, problems are : Problem set: 0 solved, 292 unsolved in 19592 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:19] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 309/392 variables, 83/134 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 292/488 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:29] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:35:29] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2024-06-01 08:35:30] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 0 ms to minimize.
[2024-06-01 08:35:30] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:36] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/393 variables, and 493 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 54/54 constraints]
After SMT, in 50095ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 50101ms
Starting structural reductions in SI_LTL mode, iteration 1 : 83/1206 places, 317/2818 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50739 ms. Remains : 83/1206 places, 317/2818 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-03
Product exploration explored 100000 steps with 9133 reset in 217 ms.
Product exploration explored 100000 steps with 9162 reset in 384 ms.
Computed a total of 6 stabilizing places and 31 stable transitions
Computed a total of 6 stabilizing places and 31 stable transitions
Detected a total of 6/83 stabilizing places and 31/317 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 172 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 745 steps (67 resets) in 6 ms. (106 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 208 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 317/317 transitions.
Applied a total of 0 rules in 14 ms. Remains 83 /83 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2024-06-01 08:35:49] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2024-06-01 08:35:49] [INFO ] Invariant cache hit.
[2024-06-01 08:35:49] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-01 08:35:49] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2024-06-01 08:35:49] [INFO ] Invariant cache hit.
[2024-06-01 08:35:49] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 08:35:49] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2024-06-01 08:35:49] [INFO ] Redundant transitions in 5 ms returned []
Running 292 sub problems to find dead transitions.
[2024-06-01 08:35:49] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2024-06-01 08:35:49] [INFO ] Invariant cache hit.
[2024-06-01 08:35:49] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:51] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:35:51] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2024-06-01 08:35:51] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:35:51] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 0 ms to minimize.
[2024-06-01 08:35:51] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-06-01 08:35:51] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:35:52] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:35:52] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:35:52] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:35:52] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 0 ms to minimize.
[2024-06-01 08:35:52] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:35:52] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:35:52] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:35:53] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2024-06-01 08:35:53] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2024-06-01 08:35:53] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2024-06-01 08:35:53] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:35:53] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-06-01 08:35:53] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:35:53] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:54] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2024-06-01 08:35:54] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:35:54] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:35:55] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:56] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:35:56] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:35:56] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2024-06-01 08:35:57] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:35:57] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2024-06-01 08:35:57] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:35:57] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
[2024-06-01 08:35:57] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-06-01 08:35:57] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-06-01 08:35:57] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:35:58] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:35:58] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 0 ms to minimize.
[2024-06-01 08:35:58] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-06-01 08:35:58] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 309/392 variables, 83/133 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 1/393 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 13 (OVERLAPS) 0/393 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 196 constraints, problems are : Problem set: 0 solved, 292 unsolved in 19750 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:36:11] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 309/392 variables, 83/134 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 292/488 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:36:21] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:36:22] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:36:22] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2024-06-01 08:36:22] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:36:29] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/393 variables, and 493 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 54/54 constraints]
After SMT, in 50294ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 50297ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50595 ms. Remains : 83/83 places, 317/317 transitions.
Computed a total of 6 stabilizing places and 31 stable transitions
Computed a total of 6 stabilizing places and 31 stable transitions
Detected a total of 6/83 stabilizing places and 31/317 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 166 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 573 steps (49 resets) in 5 ms. (95 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X p1), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 154 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 9155 reset in 311 ms.
Product exploration explored 100000 steps with 9082 reset in 214 ms.
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 317/317 transitions.
Applied a total of 0 rules in 8 ms. Remains 83 /83 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2024-06-01 08:36:41] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2024-06-01 08:36:41] [INFO ] Invariant cache hit.
[2024-06-01 08:36:41] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 08:36:41] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2024-06-01 08:36:41] [INFO ] Invariant cache hit.
[2024-06-01 08:36:41] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 08:36:41] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
[2024-06-01 08:36:41] [INFO ] Redundant transitions in 3 ms returned []
Running 292 sub problems to find dead transitions.
[2024-06-01 08:36:41] [INFO ] Flow matrix only has 310 transitions (discarded 7 similar events)
[2024-06-01 08:36:41] [INFO ] Invariant cache hit.
[2024-06-01 08:36:41] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 0 ms to minimize.
[2024-06-01 08:36:43] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:36:44] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2024-06-01 08:36:45] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:36:45] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:36:45] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:36:45] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2024-06-01 08:36:45] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:36:45] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:36:46] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2024-06-01 08:36:46] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:36:46] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-06-01 08:36:46] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 1 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-06-01 08:36:47] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:36:48] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:36:48] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:36:48] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 0 ms to minimize.
[2024-06-01 08:36:48] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 0 ms to minimize.
[2024-06-01 08:36:48] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:36:49] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2024-06-01 08:36:49] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:36:49] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:36:49] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:36:49] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 10/46 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:36:50] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2024-06-01 08:36:50] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:36:50] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2024-06-01 08:36:50] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (OVERLAPS) 309/392 variables, 83/133 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 62/195 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 11 (OVERLAPS) 1/393 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/393 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 13 (OVERLAPS) 0/393 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 196 constraints, problems are : Problem set: 0 solved, 292 unsolved in 19543 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 1/83 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 48/50 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:37:03] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 309/392 variables, 83/134 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 62/196 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 292/488 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:37:13] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:37:13] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2024-06-01 08:37:13] [INFO ] Deduced a trap composed of 24 places in 70 ms of which 0 ms to minimize.
[2024-06-01 08:37:13] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-06-01 08:37:20] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 392/393 variables, and 493 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 83/83 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 54/54 constraints]
After SMT, in 50086ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 50089ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50363 ms. Remains : 83/83 places, 317/317 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-03 finished in 155033 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)&&X((G(p1)&&X(G(p2))))))'
Support contains 13 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1201 transition count 2813
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1201 transition count 2813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1196 transition count 2808
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1196 transition count 2808
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1192 transition count 2804
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1192 transition count 2804
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 1189 transition count 2801
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 1189 transition count 2801
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1187 transition count 2799
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1185 transition count 2796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1184 transition count 2795
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1184 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1183 transition count 2794
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Applied a total of 53 rules in 572 ms. Remains 1180 /1206 variables (removed 26) and now considering 2791/2818 (removed 27) transitions.
// Phase 1: matrix 2791 rows 1180 cols
[2024-06-01 08:37:32] [INFO ] Computed 7 invariants in 69 ms
[2024-06-01 08:37:33] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-06-01 08:37:33] [INFO ] Invariant cache hit.
[2024-06-01 08:37:35] [INFO ] Implicit Places using invariants and state equation in 1472 ms returned []
Implicit Place search using SMT with State Equation took 2111 ms to find 0 implicit places.
Running 2790 sub problems to find dead transitions.
[2024-06-01 08:37:35] [INFO ] Invariant cache hit.
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 1179/3971 variables, and 0 constraints, problems are : Problem set: 0 solved, 2790 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1180 constraints, PredecessorRefiner: 2790/2790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2790 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 Int declared 1179/3971 variables, and 0 constraints, problems are : Problem set: 0 solved, 2790 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1180 constraints, PredecessorRefiner: 0/2790 constraints, Known Traps: 0/0 constraints]
After SMT, in 83867ms problems are : Problem set: 0 solved, 2790 unsolved
Search for dead transitions found 0 dead transitions in 83896ms
Starting structural reductions in LTL mode, iteration 1 : 1180/1206 places, 2791/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86593 ms. Remains : 1180/1206 places, 2791/2818 transitions.
Stuttering acceptance computed with spot in 240 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2) (NOT p0)), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-05 finished in 86884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p1)&&p0))&&X(G(p2))))'
Support contains 13 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1201 transition count 2813
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1201 transition count 2813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1196 transition count 2808
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1196 transition count 2808
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 1192 transition count 2804
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 1192 transition count 2804
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 1189 transition count 2801
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 1189 transition count 2801
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 1187 transition count 2799
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 43 place count 1185 transition count 2796
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1184 transition count 2795
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1184 transition count 2795
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 1183 transition count 2794
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Applied a total of 53 rules in 484 ms. Remains 1180 /1206 variables (removed 26) and now considering 2791/2818 (removed 27) transitions.
// Phase 1: matrix 2791 rows 1180 cols
[2024-06-01 08:38:59] [INFO ] Computed 7 invariants in 40 ms
[2024-06-01 08:39:00] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-06-01 08:39:00] [INFO ] Invariant cache hit.
[2024-06-01 08:39:01] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
Running 2790 sub problems to find dead transitions.
[2024-06-01 08:39:01] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1179/3971 variables, and 0 constraints, problems are : Problem set: 0 solved, 2790 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1180 constraints, PredecessorRefiner: 2790/2790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1179/3971 variables, and 0 constraints, problems are : Problem set: 0 solved, 2790 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1180 constraints, PredecessorRefiner: 0/2790 constraints, Known Traps: 0/0 constraints]
After SMT, in 82997ms problems are : Problem set: 0 solved, 2790 unsolved
Search for dead transitions found 0 dead transitions in 83022ms
Starting structural reductions in LTL mode, iteration 1 : 1180/1206 places, 2791/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85244 ms. Remains : 1180/1206 places, 2791/2818 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-06 finished in 85468 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (p1||G(!p0)))))'
Support contains 8 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 524 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2024-06-01 08:40:25] [INFO ] Computed 7 invariants in 34 ms
[2024-06-01 08:40:25] [INFO ] Implicit Places using invariants in 486 ms returned []
[2024-06-01 08:40:25] [INFO ] Invariant cache hit.
[2024-06-01 08:40:27] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 2042 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:40:27] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 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 Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 84189ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 84218ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86798 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 496 ms.
Product exploration explored 100000 steps with 50000 reset in 526 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 58 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-05b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-05b-LTLFireability-07 finished in 88059 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(((F((X(p0)||(!p0&&G(p1))))&&X(X(p1)))||G(F((p0||G(p1)))))))'
Support contains 7 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 1201 transition count 2813
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 1201 transition count 2813
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 1196 transition count 2808
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 1196 transition count 2808
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 1193 transition count 2805
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 1193 transition count 2805
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 1191 transition count 2803
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 1191 transition count 2803
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1190 transition count 2802
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1189 transition count 2801
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1189 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 1188 transition count 2800
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 1188 transition count 2800
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1187 transition count 2799
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1186 transition count 2798
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1186 transition count 2798
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 1185 transition count 2797
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 1184 transition count 2796
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 1184 transition count 2796
Applied a total of 44 rules in 531 ms. Remains 1184 /1206 variables (removed 22) and now considering 2796/2818 (removed 22) transitions.
// Phase 1: matrix 2796 rows 1184 cols
[2024-06-01 08:41:53] [INFO ] Computed 7 invariants in 24 ms
[2024-06-01 08:41:53] [INFO ] Implicit Places using invariants in 470 ms returned []
[2024-06-01 08:41:53] [INFO ] Invariant cache hit.
[2024-06-01 08:41:55] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1855 ms to find 0 implicit places.
Running 2795 sub problems to find dead transitions.
[2024-06-01 08:41:55] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1183/3980 variables, and 0 constraints, problems are : Problem set: 0 solved, 2795 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 2795/2795 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1183/3980 variables, and 0 constraints, problems are : Problem set: 0 solved, 2795 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1184 constraints, PredecessorRefiner: 0/2795 constraints, Known Traps: 0/0 constraints]
After SMT, in 84055ms problems are : Problem set: 0 solved, 2795 unsolved
Search for dead transitions found 0 dead transitions in 84084ms
Starting structural reductions in LTL mode, iteration 1 : 1184/1206 places, 2796/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86477 ms. Remains : 1184/1206 places, 2796/2818 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-08
Product exploration explored 100000 steps with 1748 reset in 266 ms.
Product exploration explored 100000 steps with 1763 reset in 313 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 149 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (353 resets) in 293 ms. (136 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (57 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (56 resets) in 172 ms. (231 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (60 resets) in 373 ms. (106 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (57 resets) in 168 ms. (236 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (55 resets) in 184 ms. (216 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (61 resets) in 225 ms. (177 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 161257 steps, run timeout after 3010 ms. (steps per millisecond=53 ) properties seen :0 out of 6
Probabilistic random walk after 161257 steps, saw 36335 distinct states, run finished after 3020 ms. (steps per millisecond=53 ) properties seen :0
[2024-06-01 08:43:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 1163/1170 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1170 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 14/1184 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1184 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2796/3980 variables, 1184/1191 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3980 variables, 0/1191 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/3980 variables, 0/1191 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3980/3980 variables, and 1191 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2258 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1184/1184 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1163/1170 variables, 6/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 08:43:27] [INFO ] Deduced a trap composed of 291 places in 879 ms of which 7 ms to minimize.
[2024-06-01 08:43:28] [INFO ] Deduced a trap composed of 298 places in 871 ms of which 7 ms to minimize.
[2024-06-01 08:43:29] [INFO ] Deduced a trap composed of 304 places in 879 ms of which 11 ms to minimize.
[2024-06-01 08:43:30] [INFO ] Deduced a trap composed of 298 places in 829 ms of which 6 ms to minimize.
[2024-06-01 08:43:30] [INFO ] Deduced a trap composed of 294 places in 748 ms of which 6 ms to minimize.
[2024-06-01 08:43:31] [INFO ] Deduced a trap composed of 297 places in 737 ms of which 6 ms to minimize.
SMT process timed out in 7558ms, After SMT, problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 7 out of 1184 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1184/1184 places, 2796/2796 transitions.
Graph (trivial) has 1176 edges and 1184 vertex of which 102 / 1184 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 2033 edges and 1100 vertex of which 1094 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 823 transitions
Trivial Post-agglo rules discarded 823 transitions
Performed 823 trivial Post agglomeration. Transition count delta: 823
Iterating post reduction 0 with 829 rules applied. Total rules applied 831 place count 1094 transition count 1853
Reduce places removed 823 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 841 rules applied. Total rules applied 1672 place count 271 transition count 1835
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1678 place count 265 transition count 1835
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 1678 place count 265 transition count 1768
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 1812 place count 198 transition count 1768
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1813 place count 198 transition count 1767
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 1899 place count 155 transition count 1724
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 1911 place count 155 transition count 1712
Discarding 33 places :
Symmetric choice reduction at 5 with 33 rule applications. Total rules 1944 place count 122 transition count 606
Iterating global reduction 5 with 33 rules applied. Total rules applied 1977 place count 122 transition count 606
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1992 place count 122 transition count 591
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 2010 place count 104 transition count 573
Iterating global reduction 6 with 18 rules applied. Total rules applied 2028 place count 104 transition count 573
Discarding 12 places :
Symmetric choice reduction at 6 with 12 rule applications. Total rules 2040 place count 92 transition count 561
Iterating global reduction 6 with 12 rules applied. Total rules applied 2052 place count 92 transition count 561
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 2058 place count 92 transition count 555
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 2070 place count 86 transition count 549
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 2076 place count 83 transition count 557
Free-agglomeration rule applied 36 times.
Iterating global reduction 7 with 36 rules applied. Total rules applied 2112 place count 83 transition count 521
Reduce places removed 36 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 7 with 53 rules applied. Total rules applied 2165 place count 47 transition count 504
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2171 place count 41 transition count 498
Iterating global reduction 8 with 6 rules applied. Total rules applied 2177 place count 41 transition count 498
Drop transitions (Redundant composition of simpler transitions.) removed 104 transitions
Redundant transition composition rules discarded 104 transitions
Iterating global reduction 8 with 104 rules applied. Total rules applied 2281 place count 41 transition count 394
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2283 place count 40 transition count 393
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2287 place count 38 transition count 411
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2288 place count 38 transition count 410
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2289 place count 37 transition count 410
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 2294 place count 37 transition count 410
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2297 place count 37 transition count 407
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2298 place count 36 transition count 405
Iterating global reduction 9 with 1 rules applied. Total rules applied 2299 place count 36 transition count 405
Applied a total of 2299 rules in 213 ms. Remains 36 /1184 variables (removed 1148) and now considering 405/2796 (removed 2391) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 36/1184 places, 405/2796 transitions.
RANDOM walk for 540 steps (0 resets) in 10 ms. (49 steps per ms) remains 0/5 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 221 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), false]
Support contains 7 out of 1184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1184/1184 places, 2796/2796 transitions.
Graph (trivial) has 1176 edges and 1184 vertex of which 102 / 1184 are part of one of the 18 SCC in 2 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 811 transitions
Trivial Post-agglo rules discarded 811 transitions
Performed 811 trivial Post agglomeration. Transition count delta: 811
Iterating post reduction 0 with 811 rules applied. Total rules applied 812 place count 1099 transition count 1888
Reduce places removed 811 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 829 rules applied. Total rules applied 1641 place count 288 transition count 1870
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1647 place count 282 transition count 1870
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 1647 place count 282 transition count 1809
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 1769 place count 221 transition count 1809
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1774 place count 216 transition count 1804
Iterating global reduction 3 with 5 rules applied. Total rules applied 1779 place count 216 transition count 1804
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 1873 place count 169 transition count 1757
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 1905 place count 137 transition count 657
Iterating global reduction 3 with 32 rules applied. Total rules applied 1937 place count 137 transition count 657
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1951 place count 137 transition count 643
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 1969 place count 119 transition count 619
Iterating global reduction 4 with 18 rules applied. Total rules applied 1987 place count 119 transition count 619
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2005 place count 101 transition count 595
Iterating global reduction 4 with 18 rules applied. Total rules applied 2023 place count 101 transition count 595
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2029 place count 101 transition count 589
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2049 place count 91 transition count 596
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2050 place count 90 transition count 584
Iterating global reduction 5 with 1 rules applied. Total rules applied 2051 place count 90 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2052 place count 90 transition count 583
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 2058 place count 90 transition count 577
Applied a total of 2058 rules in 140 ms. Remains 90 /1184 variables (removed 1094) and now considering 577/2796 (removed 2219) transitions.
[2024-06-01 08:43:32] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
// Phase 1: matrix 570 rows 90 cols
[2024-06-01 08:43:32] [INFO ] Computed 2 invariants in 13 ms
[2024-06-01 08:43:32] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 08:43:32] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 08:43:32] [INFO ] Invariant cache hit.
[2024-06-01 08:43:32] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 08:43:32] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-06-01 08:43:33] [INFO ] Redundant transitions in 8 ms returned []
Running 560 sub problems to find dead transitions.
[2024-06-01 08:43:33] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 08:43:33] [INFO ] Invariant cache hit.
[2024-06-01 08:43:33] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 08:43:38] [INFO ] Deduced a trap composed of 16 places in 176 ms of which 1 ms to minimize.
[2024-06-01 08:43:38] [INFO ] Deduced a trap composed of 27 places in 171 ms of which 1 ms to minimize.
[2024-06-01 08:43:38] [INFO ] Deduced a trap composed of 27 places in 163 ms of which 0 ms to minimize.
[2024-06-01 08:43:38] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 28 places in 339 ms of which 1 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 1 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 30 places in 163 ms of which 1 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 26 places in 145 ms of which 0 ms to minimize.
[2024-06-01 08:43:39] [INFO ] Deduced a trap composed of 23 places in 141 ms of which 1 ms to minimize.
[2024-06-01 08:43:40] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2024-06-01 08:43:40] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 0 ms to minimize.
[2024-06-01 08:43:40] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 1 ms to minimize.
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 1 ms to minimize.
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 26 places in 141 ms of which 0 ms to minimize.
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2024-06-01 08:43:41] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 1 ms to minimize.
[2024-06-01 08:43:42] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2024-06-01 08:43:43] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 08:43:44] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 0 ms to minimize.
[2024-06-01 08:43:46] [INFO ] Deduced a trap composed of 29 places in 149 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 08:43:48] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (OVERLAPS) 569/659 variables, 90/115 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 62/177 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 10 (OVERLAPS) 1/660 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 560 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 660/660 variables, and 178 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (OVERLAPS) 569/659 variables, 90/115 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 62/177 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 560/737 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 737 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 23/23 constraints]
After SMT, in 62899ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 62905ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/1184 places, 577/2796 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63454 ms. Remains : 90/1184 places, 577/2796 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), false]
RANDOM walk for 40000 steps (3590 resets) in 634 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (337 resets) in 104 ms. (380 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (334 resets) in 73 ms. (540 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (332 resets) in 84 ms. (470 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (347 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 496824 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 4
Probabilistic random walk after 496824 steps, saw 100213 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
[2024-06-01 08:44:39] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 08:44:39] [INFO ] Invariant cache hit.
[2024-06-01 08:44:39] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:44:39] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 568/656 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/656 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/656 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/659 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/660 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/660 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/660 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:44:40] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 08:44:40] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 568/656 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/656 variables, 62/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/656 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/659 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/659 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/660 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/660 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/660 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 162 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1506 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 2141ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 3338 steps, including 207 resets, run visited all 4 properties in 67 ms. (steps per millisecond=49 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 67 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 163 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 103 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 185 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 9037 reset in 219 ms.
Product exploration explored 100000 steps with 9011 reset in 215 ms.
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 577/577 transitions.
Applied a total of 0 rules in 15 ms. Remains 90 /90 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2024-06-01 08:44:42] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 08:44:42] [INFO ] Invariant cache hit.
[2024-06-01 08:44:42] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-01 08:44:42] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 08:44:42] [INFO ] Invariant cache hit.
[2024-06-01 08:44:42] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 08:44:43] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2024-06-01 08:44:43] [INFO ] Redundant transitions in 7 ms returned []
Running 560 sub problems to find dead transitions.
[2024-06-01 08:44:43] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 08:44:43] [INFO ] Invariant cache hit.
[2024-06-01 08:44:43] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 08:44:48] [INFO ] Deduced a trap composed of 16 places in 171 ms of which 0 ms to minimize.
[2024-06-01 08:44:48] [INFO ] Deduced a trap composed of 27 places in 168 ms of which 1 ms to minimize.
[2024-06-01 08:44:48] [INFO ] Deduced a trap composed of 27 places in 159 ms of which 1 ms to minimize.
[2024-06-01 08:44:48] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2024-06-01 08:44:48] [INFO ] Deduced a trap composed of 28 places in 144 ms of which 0 ms to minimize.
[2024-06-01 08:44:49] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 1 ms to minimize.
[2024-06-01 08:44:49] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2024-06-01 08:44:49] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 1 ms to minimize.
[2024-06-01 08:44:49] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 0 ms to minimize.
[2024-06-01 08:44:49] [INFO ] Deduced a trap composed of 23 places in 152 ms of which 0 ms to minimize.
[2024-06-01 08:44:49] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 0 ms to minimize.
[2024-06-01 08:44:50] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 1 ms to minimize.
[2024-06-01 08:44:50] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 0 ms to minimize.
[2024-06-01 08:44:51] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2024-06-01 08:44:51] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 0 ms to minimize.
[2024-06-01 08:44:51] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 1 ms to minimize.
[2024-06-01 08:44:51] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 0 ms to minimize.
[2024-06-01 08:44:51] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2024-06-01 08:44:52] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2024-06-01 08:44:52] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 08:44:54] [INFO ] Deduced a trap composed of 22 places in 131 ms of which 0 ms to minimize.
[2024-06-01 08:44:55] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 08:44:57] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (OVERLAPS) 569/659 variables, 90/115 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 62/177 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 10 (OVERLAPS) 1/660 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/660 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/660 variables, and 178 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 23/25 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (OVERLAPS) 569/659 variables, 90/115 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/659 variables, 62/177 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 560/737 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 737 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 23/23 constraints]
After SMT, in 62920ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 62927ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63343 ms. Remains : 90/90 places, 577/577 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-08 finished in 233491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 6 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 453 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2024-06-01 08:45:46] [INFO ] Computed 7 invariants in 31 ms
[2024-06-01 08:45:47] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-06-01 08:45:47] [INFO ] Invariant cache hit.
[2024-06-01 08:45:48] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1918 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:45:48] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 81098ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 81127ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83509 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 172 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-09
Product exploration explored 100000 steps with 892 reset in 290 ms.
Product exploration explored 100000 steps with 887 reset in 227 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (355 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (57 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 370985 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 1
Probabilistic random walk after 370985 steps, saw 75468 distinct states, run finished after 3002 ms. (steps per millisecond=123 ) properties seen :0
[2024-06-01 08:47:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1158/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3967/3967 variables, and 1185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 850 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1158/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3967/3967 variables, and 1186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3050ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 278 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=139 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 40 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
[2024-06-01 08:47:17] [INFO ] Invariant cache hit.
[2024-06-01 08:47:17] [INFO ] Implicit Places using invariants in 438 ms returned []
[2024-06-01 08:47:17] [INFO ] Invariant cache hit.
[2024-06-01 08:47:19] [INFO ] Implicit Places using invariants and state equation in 1415 ms returned []
Implicit Place search using SMT with State Equation took 1856 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:47:19] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 81617ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 81643ms
Finished structural reductions in LTL mode , in 1 iterations and 83550 ms. Remains : 1178/1178 places, 2789/2789 transitions.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (354 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (55 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 354557 steps, run timeout after 3001 ms. (steps per millisecond=118 ) properties seen :0 out of 1
Probabilistic random walk after 354557 steps, saw 72806 distinct states, run finished after 3003 ms. (steps per millisecond=118 ) properties seen :0
[2024-06-01 08:48:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1158/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/3967 variables, 0/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3967/3967 variables, and 1185 constraints, problems are : Problem set: 0 solved, 1 unsolved in 787 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1158/1164 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1164 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 14/1178 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2789/3967 variables, 1178/1185 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3967 variables, 1/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3967/3967 variables, and 1186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2275 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3090ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 278 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=139 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 899 reset in 233 ms.
Product exploration explored 100000 steps with 893 reset in 239 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 1178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1171 edges and 1178 vertex of which 102 / 1178 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 807 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 807 rules applied. Total rules applied 808 place count 1094 transition count 2693
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 820 place count 1094 transition count 2681
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 48 Pre rules applied. Total rules applied 820 place count 1094 transition count 2687
Deduced a syphon composed of 855 places in 1 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 868 place count 1094 transition count 2687
Discarding 726 places :
Symmetric choice reduction at 2 with 726 rule applications. Total rules 1594 place count 368 transition count 1961
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 2 with 726 rules applied. Total rules applied 2320 place count 368 transition count 1961
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 2387 place count 368 transition count 1979
Discarding 104 places :
Symmetric choice reduction at 2 with 104 rule applications. Total rules 2491 place count 264 transition count 1199
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 104 rules applied. Total rules applied 2595 place count 264 transition count 1199
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 2614 place count 264 transition count 1180
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 2657 place count 221 transition count 1131
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 3 with 43 rules applied. Total rules applied 2700 place count 221 transition count 1131
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2718 place count 203 transition count 1113
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 3 with 18 rules applied. Total rules applied 2736 place count 203 transition count 1113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 2742 place count 203 transition count 1107
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 2754 place count 191 transition count 1095
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 4 with 12 rules applied. Total rules applied 2766 place count 191 transition count 1095
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 100 places in 1 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 2775 place count 191 transition count 1140
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 2790 place count 176 transition count 1110
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 2805 place count 176 transition count 1110
Deduced a syphon composed of 85 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 2817 place count 176 transition count 1098
Deduced a syphon composed of 85 places in 0 ms
Applied a total of 2817 rules in 451 ms. Remains 176 /1178 variables (removed 1002) and now considering 1098/2789 (removed 1691) transitions.
[2024-06-01 08:48:48] [INFO ] Redundant transitions in 15 ms returned []
Running 1090 sub problems to find dead transitions.
[2024-06-01 08:48:48] [INFO ] Flow matrix only has 1091 transitions (discarded 7 similar events)
// Phase 1: matrix 1091 rows 176 cols
[2024-06-01 08:48:48] [INFO ] Computed 2 invariants in 12 ms
[2024-06-01 08:48:48] [INFO ] State equation strengthened by 93 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/175 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1090 unsolved
At refinement iteration 1 (OVERLAPS) 1/176 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1090 unsolved
[2024-06-01 08:49:09] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 2 ms to minimize.
[2024-06-01 08:49:09] [INFO ] Deduced a trap composed of 16 places in 308 ms of which 1 ms to minimize.
[2024-06-01 08:49:09] [INFO ] Deduced a trap composed of 25 places in 304 ms of which 1 ms to minimize.
[2024-06-01 08:49:10] [INFO ] Deduced a trap composed of 25 places in 300 ms of which 2 ms to minimize.
[2024-06-01 08:49:10] [INFO ] Deduced a trap composed of 16 places in 290 ms of which 1 ms to minimize.
[2024-06-01 08:49:10] [INFO ] Deduced a trap composed of 16 places in 278 ms of which 1 ms to minimize.
[2024-06-01 08:49:10] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 1 ms to minimize.
[2024-06-01 08:49:11] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 1 ms to minimize.
[2024-06-01 08:49:11] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 1 ms to minimize.
[2024-06-01 08:49:11] [INFO ] Deduced a trap composed of 17 places in 259 ms of which 1 ms to minimize.
[2024-06-01 08:49:11] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 0 ms to minimize.
Problem TDEAD1013 is UNSAT
[2024-06-01 08:49:17] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 1 ms to minimize.
[2024-06-01 08:49:17] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 2 ms to minimize.
[2024-06-01 08:49:18] [INFO ] Deduced a trap composed of 24 places in 283 ms of which 1 ms to minimize.
[2024-06-01 08:49:18] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 1 ms to minimize.
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 15/17 constraints. Problems are: Problem set: 10 solved, 1080 unsolved
[2024-06-01 08:49:19] [INFO ] Deduced a trap composed of 24 places in 288 ms of which 1 ms to minimize.
[2024-06-01 08:49:19] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 1 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 25 places in 291 ms of which 1 ms to minimize.
[2024-06-01 08:49:20] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 1 ms to minimize.
[2024-06-01 08:49:25] [INFO ] Deduced a trap composed of 24 places in 267 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 5/22 constraints. Problems are: Problem set: 10 solved, 1080 unsolved
[2024-06-01 08:49:30] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 176/1267 variables, and 23 constraints, problems are : Problem set: 10 solved, 1080 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/176 constraints, ReadFeed: 0/93 constraints, PredecessorRefiner: 1090/1090 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 10 solved, 1080 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 1080 unsolved
At refinement iteration 1 (OVERLAPS) 4/176 variables, 2/2 constraints. Problems are: Problem set: 10 solved, 1080 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 21/23 constraints. Problems are: Problem set: 10 solved, 1080 unsolved
[2024-06-01 08:49:35] [INFO ] Deduced a trap composed of 25 places in 271 ms of which 1 ms to minimize.
[2024-06-01 08:49:36] [INFO ] Deduced a trap composed of 27 places in 266 ms of which 1 ms to minimize.
[2024-06-01 08:49:36] [INFO ] Deduced a trap composed of 25 places in 241 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/176 variables, 3/26 constraints. Problems are: Problem set: 10 solved, 1080 unsolved
[2024-06-01 08:49:42] [INFO ] Deduced a trap composed of 27 places in 282 ms of which 1 ms to minimize.
[2024-06-01 08:49:43] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 1 ms to minimize.
[2024-06-01 08:49:48] [INFO ] Deduced a trap composed of 24 places in 297 ms of which 2 ms to minimize.
[2024-06-01 08:49:48] [INFO ] Deduced a trap composed of 24 places in 290 ms of which 2 ms to minimize.
[2024-06-01 08:49:49] [INFO ] Deduced a trap composed of 24 places in 275 ms of which 1 ms to minimize.
[2024-06-01 08:49:49] [INFO ] Deduced a trap composed of 24 places in 271 ms of which 2 ms to minimize.
[2024-06-01 08:49:49] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 7/33 constraints. Problems are: Problem set: 10 solved, 1080 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/33 constraints. Problems are: Problem set: 10 solved, 1080 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1019 is UNSAT
Problem TDEAD1021 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1039 is UNSAT
Problem TDEAD1041 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1051 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1096 is UNSAT
At refinement iteration 6 (OVERLAPS) 1090/1266 variables, 176/209 constraints. Problems are: Problem set: 123 solved, 967 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1266 variables, 92/301 constraints. Problems are: Problem set: 123 solved, 967 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1266/1267 variables, and 1268 constraints, problems are : Problem set: 123 solved, 967 unsolved in 33597 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 176/176 constraints, ReadFeed: 92/93 constraints, PredecessorRefiner: 967/1090 constraints, Known Traps: 31/31 constraints]
After SMT, in 76343ms problems are : Problem set: 123 solved, 967 unsolved
Search for dead transitions found 123 dead transitions in 76354ms
Found 123 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 123 transitions
Dead transitions reduction (with SMT) removed 123 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 176/1178 places, 975/2789 transitions.
Graph (complete) has 632 edges and 176 vertex of which 91 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 91 transition count 983
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 35 ms. Remains 91 /176 variables (removed 85) and now considering 983/975 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/1178 places, 983/2789 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 76867 ms. Remains : 91/1178 places, 983/2789 transitions.
Support contains 6 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 42 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2024-06-01 08:50:05] [INFO ] Computed 7 invariants in 33 ms
[2024-06-01 08:50:05] [INFO ] Implicit Places using invariants in 463 ms returned []
[2024-06-01 08:50:05] [INFO ] Invariant cache hit.
[2024-06-01 08:50:07] [INFO ] Implicit Places using invariants and state equation in 1402 ms returned []
Implicit Place search using SMT with State Equation took 1876 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:50:07] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 81965ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 81994ms
Finished structural reductions in LTL mode , in 1 iterations and 83920 ms. Remains : 1178/1178 places, 2789/2789 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-09 finished in 343175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 535 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
[2024-06-01 08:51:29] [INFO ] Invariant cache hit.
[2024-06-01 08:51:30] [INFO ] Implicit Places using invariants in 524 ms returned []
[2024-06-01 08:51:30] [INFO ] Invariant cache hit.
[2024-06-01 08:51:32] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:51:32] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 82117ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 82142ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 84777 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 322 ms.
Product exploration explored 100000 steps with 25000 reset in 387 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Detected a total of 246/1178 stabilizing places and 258/2789 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (356 resets) in 156 ms. (254 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (57 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 361460 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :0 out of 1
Probabilistic random walk after 361460 steps, saw 73986 distinct states, run finished after 3002 ms. (steps per millisecond=120 ) properties seen :0
[2024-06-01 08:52:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 195/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 982/1178 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:52:59] [INFO ] Deduced a trap composed of 302 places in 825 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1178 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2789/3967 variables, 1178/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3967/3967 variables, and 1186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 195/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 982/1178 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1178 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2789/3967 variables, 1178/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3967 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3967 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3967/3967 variables, and 1187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1085 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 3113ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 1178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1175 edges and 1178 vertex of which 102 / 1178 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 2026 edges and 1094 vertex of which 1088 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 823 transitions
Trivial Post-agglo rules discarded 823 transitions
Performed 823 trivial Post agglomeration. Transition count delta: 823
Iterating post reduction 0 with 829 rules applied. Total rules applied 831 place count 1088 transition count 1846
Reduce places removed 823 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 841 rules applied. Total rules applied 1672 place count 265 transition count 1828
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 1679 place count 259 transition count 1827
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1680 place count 258 transition count 1827
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1680 place count 258 transition count 1761
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1812 place count 192 transition count 1761
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1813 place count 192 transition count 1760
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 1899 place count 149 transition count 1717
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1911 place count 149 transition count 1705
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1948 place count 112 transition count 339
Iterating global reduction 6 with 37 rules applied. Total rules applied 1985 place count 112 transition count 339
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2004 place count 112 transition count 320
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2022 place count 94 transition count 302
Iterating global reduction 7 with 18 rules applied. Total rules applied 2040 place count 94 transition count 302
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 2051 place count 83 transition count 291
Iterating global reduction 7 with 11 rules applied. Total rules applied 2062 place count 83 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2067 place count 83 transition count 286
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 2079 place count 77 transition count 280
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 2085 place count 74 transition count 288
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2117 place count 74 transition count 256
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (complete) has 151 edges and 42 vertex of which 5 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 146 output transitions
Drop transitions (Output transitions of discarded places.) removed 146 transitions
Iterating post reduction 8 with 98 rules applied. Total rules applied 2215 place count 5 transition count 45
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 9 with 41 rules applied. Total rules applied 2256 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2257 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2258 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 2258 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2260 place count 2 transition count 2
Applied a total of 2260 rules in 114 ms. Remains 2 /1178 variables (removed 1176) and now considering 2/2789 (removed 2787) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 2/1178 places, 2/2789 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 43 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
[2024-06-01 08:53:02] [INFO ] Invariant cache hit.
[2024-06-01 08:53:02] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-06-01 08:53:02] [INFO ] Invariant cache hit.
[2024-06-01 08:53:04] [INFO ] Implicit Places using invariants and state equation in 1414 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:53:04] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 82075ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 82103ms
Finished structural reductions in LTL mode , in 1 iterations and 84059 ms. Remains : 1178/1178 places, 2789/2789 transitions.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Detected a total of 246/1178 stabilizing places and 258/2789 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (357 resets) in 112 ms. (353 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (56 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 363217 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 1
Probabilistic random walk after 363217 steps, saw 74282 distinct states, run finished after 3001 ms. (steps per millisecond=121 ) properties seen :0
[2024-06-01 08:54:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 195/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 982/1178 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 08:54:30] [INFO ] Deduced a trap composed of 302 places in 771 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1178 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2789/3967 variables, 1178/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/3967 variables, 0/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3967/3967 variables, and 1186 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1874 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 195/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 982/1178 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1178 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1178 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2789/3967 variables, 1178/1186 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3967 variables, 1/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3967 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/3967 variables, 0/1187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3967/3967 variables, and 1187 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1094 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1178/1178 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 2979ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 46 ms.
Support contains 1 out of 1178 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1175 edges and 1178 vertex of which 102 / 1178 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 2026 edges and 1094 vertex of which 1088 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 823 transitions
Trivial Post-agglo rules discarded 823 transitions
Performed 823 trivial Post agglomeration. Transition count delta: 823
Iterating post reduction 0 with 829 rules applied. Total rules applied 831 place count 1088 transition count 1846
Reduce places removed 823 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 841 rules applied. Total rules applied 1672 place count 265 transition count 1828
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 1679 place count 259 transition count 1827
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1680 place count 258 transition count 1827
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 66 Pre rules applied. Total rules applied 1680 place count 258 transition count 1761
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 4 with 132 rules applied. Total rules applied 1812 place count 192 transition count 1761
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1813 place count 192 transition count 1760
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 5 with 86 rules applied. Total rules applied 1899 place count 149 transition count 1717
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1911 place count 149 transition count 1705
Discarding 37 places :
Symmetric choice reduction at 6 with 37 rule applications. Total rules 1948 place count 112 transition count 339
Iterating global reduction 6 with 37 rules applied. Total rules applied 1985 place count 112 transition count 339
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 2004 place count 112 transition count 320
Discarding 18 places :
Symmetric choice reduction at 7 with 18 rule applications. Total rules 2022 place count 94 transition count 302
Iterating global reduction 7 with 18 rules applied. Total rules applied 2040 place count 94 transition count 302
Discarding 11 places :
Symmetric choice reduction at 7 with 11 rule applications. Total rules 2051 place count 83 transition count 291
Iterating global reduction 7 with 11 rules applied. Total rules applied 2062 place count 83 transition count 291
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 2067 place count 83 transition count 286
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 2079 place count 77 transition count 280
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
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 2085 place count 74 transition count 288
Free-agglomeration rule applied 32 times.
Iterating global reduction 8 with 32 rules applied. Total rules applied 2117 place count 74 transition count 256
Reduce places removed 32 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 65 transitions.
Graph (complete) has 151 edges and 42 vertex of which 5 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.0 ms
Discarding 37 places :
Also discarding 146 output transitions
Drop transitions (Output transitions of discarded places.) removed 146 transitions
Iterating post reduction 8 with 98 rules applied. Total rules applied 2215 place count 5 transition count 45
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 9 with 41 rules applied. Total rules applied 2256 place count 5 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 2257 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2258 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 1 Pre rules applied. Total rules applied 2258 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 2260 place count 2 transition count 2
Applied a total of 2260 rules in 119 ms. Remains 2 /1178 variables (removed 1176) and now considering 2/2789 (removed 2787) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 2/1178 places, 2/2789 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 473 ms.
Product exploration explored 100000 steps with 25000 reset in 422 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1178 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Graph (trivial) has 1175 edges and 1178 vertex of which 102 / 1178 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Performed 812 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 812 rules applied. Total rules applied 813 place count 1094 transition count 2693
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 825 place count 1094 transition count 2681
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 47 Pre rules applied. Total rules applied 825 place count 1094 transition count 2687
Deduced a syphon composed of 859 places in 1 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 872 place count 1094 transition count 2687
Discarding 730 places :
Symmetric choice reduction at 2 with 730 rule applications. Total rules 1602 place count 364 transition count 1957
Deduced a syphon composed of 134 places in 1 ms
Iterating global reduction 2 with 730 rules applied. Total rules applied 2332 place count 364 transition count 1957
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 201 places in 0 ms
Iterating global reduction 2 with 67 rules applied. Total rules applied 2399 place count 364 transition count 1975
Discarding 110 places :
Symmetric choice reduction at 2 with 110 rule applications. Total rules 2509 place count 254 transition count 530
Deduced a syphon composed of 128 places in 0 ms
Iterating global reduction 2 with 110 rules applied. Total rules applied 2619 place count 254 transition count 530
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 2 with 25 rules applied. Total rules applied 2644 place count 254 transition count 505
Discarding 48 places :
Symmetric choice reduction at 3 with 48 rule applications. Total rules 2692 place count 206 transition count 451
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 3 with 48 rules applied. Total rules applied 2740 place count 206 transition count 451
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 2757 place count 189 transition count 434
Deduced a syphon composed of 98 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 2774 place count 189 transition count 434
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 2779 place count 189 transition count 429
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 2790 place count 178 transition count 418
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 4 with 11 rules applied. Total rules applied 2801 place count 178 transition count 418
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -41
Deduced a syphon composed of 96 places in 0 ms
Iterating global reduction 4 with 9 rules applied. Total rules applied 2810 place count 178 transition count 459
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 2825 place count 163 transition count 429
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 2840 place count 163 transition count 429
Deduced a syphon composed of 81 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 2852 place count 163 transition count 417
Deduced a syphon composed of 81 places in 0 ms
Applied a total of 2852 rules in 238 ms. Remains 163 /1178 variables (removed 1015) and now considering 417/2789 (removed 2372) transitions.
[2024-06-01 08:54:34] [INFO ] Redundant transitions in 2 ms returned []
Running 409 sub problems to find dead transitions.
[2024-06-01 08:54:34] [INFO ] Flow matrix only has 410 transitions (discarded 7 similar events)
// Phase 1: matrix 410 rows 163 cols
[2024-06-01 08:54:34] [INFO ] Computed 2 invariants in 3 ms
[2024-06-01 08:54:34] [INFO ] State equation strengthened by 94 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (OVERLAPS) 1/163 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 409 unsolved
[2024-06-01 08:54:37] [INFO ] Deduced a trap composed of 6 places in 118 ms of which 2 ms to minimize.
[2024-06-01 08:54:37] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-06-01 08:54:37] [INFO ] Deduced a trap composed of 20 places in 105 ms of which 2 ms to minimize.
[2024-06-01 08:54:37] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 5 ms to minimize.
[2024-06-01 08:54:37] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 1 ms to minimize.
[2024-06-01 08:54:38] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-06-01 08:54:38] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:54:38] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2024-06-01 08:54:38] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:54:38] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:54:38] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 0 ms to minimize.
[2024-06-01 08:54:38] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
Problem TDEAD335 is UNSAT
[2024-06-01 08:54:39] [INFO ] Deduced a trap composed of 20 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:54:39] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-06-01 08:54:40] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:54:40] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 16/18 constraints. Problems are: Problem set: 10 solved, 399 unsolved
[2024-06-01 08:54:40] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-01 08:54:40] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 2/20 constraints. Problems are: Problem set: 10 solved, 399 unsolved
[2024-06-01 08:54:43] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:54:43] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/163 variables, 2/22 constraints. Problems are: Problem set: 10 solved, 399 unsolved
[2024-06-01 08:54:44] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 1/23 constraints. Problems are: Problem set: 10 solved, 399 unsolved
[2024-06-01 08:54:46] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:54:46] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:54:46] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 08:54:46] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 4/27 constraints. Problems are: Problem set: 10 solved, 399 unsolved
[2024-06-01 08:54:49] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 1/28 constraints. Problems are: Problem set: 10 solved, 399 unsolved
[2024-06-01 08:54:50] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:54:50] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 2/30 constraints. Problems are: Problem set: 10 solved, 399 unsolved
[2024-06-01 08:54:52] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 1/31 constraints. Problems are: Problem set: 10 solved, 399 unsolved
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 5/36 constraints. Problems are: Problem set: 10 solved, 399 unsolved
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2024-06-01 08:54:56] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 2/38 constraints. Problems are: Problem set: 10 solved, 399 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/38 constraints. Problems are: Problem set: 10 solved, 399 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
At refinement iteration 13 (OVERLAPS) 409/572 variables, 163/201 constraints. Problems are: Problem set: 115 solved, 294 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/572 variables, 93/294 constraints. Problems are: Problem set: 115 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 572/573 variables, and 294 constraints, problems are : Problem set: 115 solved, 294 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 163/163 constraints, ReadFeed: 93/94 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 115 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 115 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 82/163 variables, 2/2 constraints. Problems are: Problem set: 115 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 36/38 constraints. Problems are: Problem set: 115 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/38 constraints. Problems are: Problem set: 115 solved, 294 unsolved
At refinement iteration 4 (OVERLAPS) 409/572 variables, 163/201 constraints. Problems are: Problem set: 115 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/572 variables, 93/294 constraints. Problems are: Problem set: 115 solved, 294 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/572 variables, 294/588 constraints. Problems are: Problem set: 115 solved, 294 unsolved
[2024-06-01 08:55:13] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/572 variables, 1/589 constraints. Problems are: Problem set: 115 solved, 294 unsolved
[2024-06-01 08:55:23] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-06-01 08:55:24] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 1 ms to minimize.
[2024-06-01 08:55:24] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/572 variables, 3/592 constraints. Problems are: Problem set: 115 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 572/573 variables, and 592 constraints, problems are : Problem set: 115 solved, 294 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 163/163 constraints, ReadFeed: 93/94 constraints, PredecessorRefiner: 294/409 constraints, Known Traps: 40/40 constraints]
After SMT, in 60501ms problems are : Problem set: 115 solved, 294 unsolved
Search for dead transitions found 115 dead transitions in 60506ms
Found 115 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 115 transitions
Dead transitions reduction (with SMT) removed 115 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 163/1178 places, 302/2789 transitions.
Graph (complete) has 560 edges and 163 vertex of which 82 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.2 ms
Discarding 81 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 82 transition count 310
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 82 /163 variables (removed 81) and now considering 310/302 (removed -8) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/1178 places, 310/2789 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60767 ms. Remains : 82/1178 places, 310/2789 transitions.
Support contains 1 out of 1178 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1178/1178 places, 2789/2789 transitions.
Applied a total of 0 rules in 38 ms. Remains 1178 /1178 variables (removed 0) and now considering 2789/2789 (removed 0) transitions.
// Phase 1: matrix 2789 rows 1178 cols
[2024-06-01 08:55:35] [INFO ] Computed 7 invariants in 32 ms
[2024-06-01 08:55:35] [INFO ] Implicit Places using invariants in 542 ms returned []
[2024-06-01 08:55:35] [INFO ] Invariant cache hit.
[2024-06-01 08:55:37] [INFO ] Implicit Places using invariants and state equation in 1564 ms returned []
Implicit Place search using SMT with State Equation took 2110 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:55:37] [INFO ] Invariant cache hit.
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 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 81863ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 81890ms
Finished structural reductions in LTL mode , in 1 iterations and 84050 ms. Remains : 1178/1178 places, 2789/2789 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-11 finished in 329927 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 13 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 460 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
[2024-06-01 08:56:59] [INFO ] Invariant cache hit.
[2024-06-01 08:57:00] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-06-01 08:57:00] [INFO ] Invariant cache hit.
[2024-06-01 08:57:01] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1682 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:57:01] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 83608ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 83637ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85791 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 622 ms.
Product exploration explored 100000 steps with 50000 reset in 605 ms.
Computed a total of 246 stabilizing places and 258 stable transitions
Computed a total of 246 stabilizing places and 258 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-05b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-05b-LTLFireability-12 finished in 87172 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F(X((X(p1) U p2)))))'
Support contains 7 out of 1206 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1200 transition count 2812
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1200 transition count 2812
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 1194 transition count 2806
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 1190 transition count 2802
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 1190 transition count 2802
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 1187 transition count 2799
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 1187 transition count 2799
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 1185 transition count 2797
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 1185 transition count 2797
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 1183 transition count 2795
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 1183 transition count 2795
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 1183 transition count 2794
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 1182 transition count 2793
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 1182 transition count 2793
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 1181 transition count 2792
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 1181 transition count 2792
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 1180 transition count 2791
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 1180 transition count 2791
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 1179 transition count 2790
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 1179 transition count 2790
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 1178 transition count 2789
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 1178 transition count 2789
Applied a total of 57 rules in 487 ms. Remains 1178 /1206 variables (removed 28) and now considering 2789/2818 (removed 29) transitions.
[2024-06-01 08:58:27] [INFO ] Invariant cache hit.
[2024-06-01 08:58:27] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-06-01 08:58:27] [INFO ] Invariant cache hit.
[2024-06-01 08:58:28] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1739 ms to find 0 implicit places.
Running 2788 sub problems to find dead transitions.
[2024-06-01 08:58:28] [INFO ] Invariant cache hit.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 2788/2788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2788 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 Int declared 1177/3967 variables, and 0 constraints, problems are : Problem set: 0 solved, 2788 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1178 constraints, PredecessorRefiner: 0/2788 constraints, Known Traps: 0/0 constraints]
After SMT, in 83291ms problems are : Problem set: 0 solved, 2788 unsolved
Search for dead transitions found 0 dead transitions in 83320ms
Starting structural reductions in LTL mode, iteration 1 : 1178/1206 places, 2789/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85557 ms. Remains : 1178/1206 places, 2789/2818 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-13
Stuttering criterion allowed to conclude after 110 steps with 0 reset in 1 ms.
FORMULA StigmergyCommit-PT-05b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property StigmergyCommit-PT-05b-LTLFireability-13 finished in 85772 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 1 out of 1206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Graph (trivial) has 1203 edges and 1206 vertex of which 104 / 1206 are part of one of the 18 SCC in 1 ms
Free SCC test removed 86 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 834 transitions
Trivial Post-agglo rules discarded 834 transitions
Performed 834 trivial Post agglomeration. Transition count delta: 834
Iterating post reduction 0 with 834 rules applied. Total rules applied 835 place count 1119 transition count 1885
Reduce places removed 834 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 854 rules applied. Total rules applied 1689 place count 285 transition count 1865
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1696 place count 278 transition count 1865
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 1696 place count 278 transition count 1803
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 1820 place count 216 transition count 1803
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 1826 place count 210 transition count 1797
Iterating global reduction 3 with 6 rules applied. Total rules applied 1832 place count 210 transition count 1797
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 1833 place count 209 transition count 1796
Iterating global reduction 3 with 1 rules applied. Total rules applied 1834 place count 209 transition count 1796
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1926 place count 163 transition count 1750
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 1961 place count 128 transition count 391
Iterating global reduction 3 with 35 rules applied. Total rules applied 1996 place count 128 transition count 391
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 2013 place count 128 transition count 374
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2031 place count 110 transition count 350
Iterating global reduction 4 with 18 rules applied. Total rules applied 2049 place count 110 transition count 350
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2067 place count 92 transition count 326
Iterating global reduction 4 with 18 rules applied. Total rules applied 2085 place count 92 transition count 326
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2091 place count 92 transition count 320
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2111 place count 82 transition count 327
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2112 place count 81 transition count 315
Iterating global reduction 5 with 1 rules applied. Total rules applied 2113 place count 81 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2114 place count 81 transition count 314
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 2120 place count 81 transition count 308
Applied a total of 2120 rules in 125 ms. Remains 81 /1206 variables (removed 1125) and now considering 308/2818 (removed 2510) transitions.
[2024-06-01 08:59:52] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
// Phase 1: matrix 301 rows 81 cols
[2024-06-01 08:59:52] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 08:59:52] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 08:59:52] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 08:59:52] [INFO ] Invariant cache hit.
[2024-06-01 08:59:52] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 08:59:52] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-06-01 08:59:52] [INFO ] Redundant transitions in 3 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-01 08:59:52] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 08:59:52] [INFO ] Invariant cache hit.
[2024-06-01 08:59:52] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 0 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 0 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2024-06-01 08:59:54] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 0 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 0 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 0 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 0 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 08:59:55] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2024-06-01 08:59:56] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 1 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 0 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-06-01 08:59:57] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 23 places in 94 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2024-06-01 08:59:58] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-01 08:59:59] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:00:00] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:00:00] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:00:00] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:00:00] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:00:00] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 300/381 variables, 81/132 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 62/194 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:00:05] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 12 (OVERLAPS) 1/382 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 14 (OVERLAPS) 0/382 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 199 constraints, problems are : Problem set: 0 solved, 291 unsolved in 21325 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:00:15] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:00:16] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 300/381 variables, 81/138 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 62/200 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 291/491 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 1/382 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:00:42] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:00:42] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:00:42] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:00:42] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:00:42] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 5/497 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/382 variables, and 497 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 60/60 constraints]
After SMT, in 51732ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 51736ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/1206 places, 308/2818 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52157 ms. Remains : 81/1206 places, 308/2818 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-14
Product exploration explored 100000 steps with 9519 reset in 174 ms.
Product exploration explored 100000 steps with 9529 reset in 172 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3854 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (369 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2391992 steps, run timeout after 3001 ms. (steps per millisecond=797 ) properties seen :0 out of 1
Probabilistic random walk after 2391992 steps, saw 429191 distinct states, run finished after 3001 ms. (steps per millisecond=797 ) properties seen :0
[2024-06-01 09:00:48] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 09:00:48] [INFO ] Invariant cache hit.
[2024-06-01 09:00:48] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 299/378 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 62/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/381 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/382 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/382 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 127 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 1 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 14 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:00:48] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 299/378 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 62/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/381 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 933ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 728 steps, including 39 resets, run visited all 1 properties in 4 ms. (steps per millisecond=182 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 308/308 transitions.
Applied a total of 0 rules in 12 ms. Remains 81 /81 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-06-01 09:00:49] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 09:00:49] [INFO ] Invariant cache hit.
[2024-06-01 09:00:49] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 09:00:49] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 09:00:49] [INFO ] Invariant cache hit.
[2024-06-01 09:00:49] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:00:49] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2024-06-01 09:00:49] [INFO ] Redundant transitions in 1 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-01 09:00:49] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 09:00:49] [INFO ] Invariant cache hit.
[2024-06-01 09:00:49] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 0 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:00:51] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:00:52] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:00:53] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 24 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:00:54] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 0 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:00:55] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:00:56] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2024-06-01 09:00:56] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:00:56] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:00:56] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:00:57] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 300/381 variables, 81/132 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 62/194 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:01:02] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 12 (OVERLAPS) 1/382 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 14 (OVERLAPS) 0/382 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 199 constraints, problems are : Problem set: 0 solved, 291 unsolved in 21625 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:01:13] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:01:13] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 300/381 variables, 81/138 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 62/200 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 291/491 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 1/382 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:01:39] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:01:39] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:01:40] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:01:40] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:01:40] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 5/497 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/382 variables, and 497 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 60/60 constraints]
After SMT, in 52084ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 52088ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52373 ms. Remains : 81/81 places, 308/308 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3745 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (373 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2236442 steps, run timeout after 3001 ms. (steps per millisecond=745 ) properties seen :0 out of 1
Probabilistic random walk after 2236442 steps, saw 401066 distinct states, run finished after 3001 ms. (steps per millisecond=745 ) properties seen :0
[2024-06-01 09:01:44] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 09:01:44] [INFO ] Invariant cache hit.
[2024-06-01 09:01:44] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 299/378 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 62/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/381 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/382 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/382 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/382 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 146 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 78/79 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 1 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:01:45] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 299/378 variables, 79/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 62/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/378 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/378 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/381 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/382 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/382 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 382/382 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 925ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1725 steps, including 94 resets, run visited all 1 properties in 7 ms. (steps per millisecond=246 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9533 reset in 183 ms.
Product exploration explored 100000 steps with 9462 reset in 181 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 308/308 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2024-06-01 09:01:46] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 09:01:46] [INFO ] Invariant cache hit.
[2024-06-01 09:01:46] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-01 09:01:46] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 09:01:46] [INFO ] Invariant cache hit.
[2024-06-01 09:01:46] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:01:46] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-06-01 09:01:46] [INFO ] Redundant transitions in 1 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-01 09:01:46] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
[2024-06-01 09:01:46] [INFO ] Invariant cache hit.
[2024-06-01 09:01:46] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:01:48] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:01:49] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:01:50] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:01:50] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:01:50] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:01:50] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:01:50] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:01:51] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:01:51] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:01:51] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:01:51] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:01:51] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 0 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:01:52] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:01:53] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:01:53] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:01:53] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:01:53] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:01:54] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:01:54] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:01:54] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:01:55] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:01:55] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2024-06-01 09:01:55] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:01:55] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:01:55] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 300/381 variables, 81/132 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 62/194 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:01:59] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:01:59] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:01:59] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:02:00] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 4/198 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 12 (OVERLAPS) 1/382 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 14 (OVERLAPS) 0/382 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 199 constraints, problems are : Problem set: 0 solved, 291 unsolved in 21207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 53/53 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:02:09] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:02:10] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (OVERLAPS) 300/381 variables, 81/138 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 62/200 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 291/491 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (OVERLAPS) 1/382 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:02:36] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:02:36] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:02:37] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:02:37] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:02:37] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/382 variables, 5/497 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 382/382 variables, and 497 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 60/60 constraints]
After SMT, in 51769ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 51772ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52056 ms. Remains : 81/81 places, 308/308 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-14 finished in 166550 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 U p2)||X(p3)))))'
Support contains 14 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 1202 transition count 2814
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 1202 transition count 2814
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 1198 transition count 2810
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 1198 transition count 2810
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 1196 transition count 2808
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 1196 transition count 2808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 1194 transition count 2806
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 1194 transition count 2806
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 1192 transition count 2804
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 1192 transition count 2804
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 1190 transition count 2802
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 1190 transition count 2802
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1190 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1189 transition count 2800
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1189 transition count 2800
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1188 transition count 2799
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1188 transition count 2799
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1187 transition count 2798
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1187 transition count 2798
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1186 transition count 2797
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1186 transition count 2797
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1185 transition count 2796
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1185 transition count 2796
Applied a total of 43 rules in 468 ms. Remains 1185 /1206 variables (removed 21) and now considering 2796/2818 (removed 22) transitions.
// Phase 1: matrix 2796 rows 1185 cols
[2024-06-01 09:02:39] [INFO ] Computed 7 invariants in 34 ms
[2024-06-01 09:02:39] [INFO ] Implicit Places using invariants in 448 ms returned []
[2024-06-01 09:02:39] [INFO ] Invariant cache hit.
[2024-06-01 09:02:41] [INFO ] Implicit Places using invariants and state equation in 1296 ms returned []
Implicit Place search using SMT with State Equation took 1745 ms to find 0 implicit places.
Running 2795 sub problems to find dead transitions.
[2024-06-01 09:02:41] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 timeout
1.0)
(s576 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1184/3981 variables, and 0 constraints, problems are : Problem set: 0 solved, 2795 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1185 constraints, PredecessorRefiner: 2795/2795 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1184/3981 variables, and 0 constraints, problems are : Problem set: 0 solved, 2795 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/7 constraints, State Equation: 0/1185 constraints, PredecessorRefiner: 0/2795 constraints, Known Traps: 0/0 constraints]
After SMT, in 82999ms problems are : Problem set: 0 solved, 2795 unsolved
Search for dead transitions found 0 dead transitions in 83026ms
Starting structural reductions in LTL mode, iteration 1 : 1185/1206 places, 2796/2818 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 85248 ms. Remains : 1185/1206 places, 2796/2818 transitions.
Stuttering acceptance computed with spot in 462 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, p0, (NOT p2), (AND p0 (NOT p2) p3)]
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-15
Product exploration explored 100000 steps with 887 reset in 322 ms.
Product exploration explored 100000 steps with 892 reset in 236 ms.
Computed a total of 250 stabilizing places and 262 stable transitions
Computed a total of 250 stabilizing places and 262 stable transitions
Detected a total of 250/1185 stabilizing places and 262/2796 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT p3)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) p3)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p0 p3)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 42 factoid took 185 ms. Reduced automaton from 10 states, 36 edges and 4 AP (stutter sensitive) to 10 states, 36 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 543 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND p0 (NOT p3))), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), true, p0, (NOT p2), (AND p0 (NOT p2) p3)]
RANDOM walk for 40000 steps (356 resets) in 383 ms. (104 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 22/22 properties
Interrupted probabilistic random walk after 98928 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :0 out of 22
Probabilistic random walk after 98928 steps, saw 23879 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :0
[2024-06-01 09:04:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem apf3 is UNSAT
Problem apf9 is UNSAT
Problem apf13 is UNSAT
Problem apf16 is UNSAT
Problem apf21 is UNSAT
At refinement iteration 1 (OVERLAPS) 1157/1171 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 17 unsolved
[2024-06-01 09:04:10] [INFO ] Deduced a trap composed of 293 places in 580 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1171 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1171 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 14/1185 variables, 1/8 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1185 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2796/3981 variables, 1185/1193 constraints. Problems are: Problem set: 5 solved, 17 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3981/3981 variables, and 1193 constraints, problems are : Problem set: 5 solved, 17 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 1185/1185 constraints, PredecessorRefiner: 22/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 5 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 1157/1171 variables, 6/6 constraints. Problems are: Problem set: 5 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1171 variables, 1/7 constraints. Problems are: Problem set: 5 solved, 17 unsolved
[2024-06-01 09:04:15] [INFO ] Deduced a trap composed of 367 places in 783 ms of which 6 ms to minimize.
[2024-06-01 09:04:16] [INFO ] Deduced a trap composed of 294 places in 714 ms of which 5 ms to minimize.
[2024-06-01 09:04:17] [INFO ] Deduced a trap composed of 298 places in 700 ms of which 4 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 295 places in 691 ms of which 5 ms to minimize.
[2024-06-01 09:04:18] [INFO ] Deduced a trap composed of 301 places in 645 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1171 variables, 5/12 constraints. Problems are: Problem set: 5 solved, 17 unsolved
[2024-06-01 09:04:20] [INFO ] Deduced a trap composed of 300 places in 679 ms of which 4 ms to minimize.
SMT process timed out in 10783ms, After SMT, problems are : Problem set: 5 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 1185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1185/1185 places, 2796/2796 transitions.
Graph (trivial) has 1168 edges and 1185 vertex of which 102 / 1185 are part of one of the 18 SCC in 1 ms
Free SCC test removed 84 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Reduce isomorphic transitions removed 114 transitions.
Graph (complete) has 2033 edges and 1101 vertex of which 1095 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 815 transitions
Trivial Post-agglo rules discarded 815 transitions
Performed 815 trivial Post agglomeration. Transition count delta: 815
Iterating post reduction 0 with 821 rules applied. Total rules applied 823 place count 1095 transition count 1861
Reduce places removed 815 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 834 rules applied. Total rules applied 1657 place count 280 transition count 1842
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1664 place count 273 transition count 1842
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 1664 place count 273 transition count 1774
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 1800 place count 205 transition count 1774
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1801 place count 205 transition count 1773
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 1885 place count 163 transition count 1731
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1896 place count 163 transition count 1720
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 1923 place count 136 transition count 930
Iterating global reduction 5 with 27 rules applied. Total rules applied 1950 place count 136 transition count 930
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 1961 place count 136 transition count 919
Discarding 16 places :
Symmetric choice reduction at 6 with 16 rule applications. Total rules 1977 place count 120 transition count 903
Iterating global reduction 6 with 16 rules applied. Total rules applied 1993 place count 120 transition count 903
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 2004 place count 109 transition count 892
Iterating global reduction 6 with 11 rules applied. Total rules applied 2015 place count 109 transition count 892
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 2020 place count 109 transition count 887
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 2034 place count 102 transition count 880
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 2040 place count 99 transition count 888
Free-agglomeration rule applied 40 times.
Iterating global reduction 7 with 40 rules applied. Total rules applied 2080 place count 99 transition count 848
Reduce places removed 40 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 45 rules applied. Total rules applied 2125 place count 59 transition count 843
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 2131 place count 53 transition count 837
Iterating global reduction 8 with 6 rules applied. Total rules applied 2137 place count 53 transition count 837
Drop transitions (Redundant composition of simpler transitions.) removed 206 transitions
Redundant transition composition rules discarded 206 transitions
Iterating global reduction 8 with 206 rules applied. Total rules applied 2343 place count 53 transition count 631
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2345 place count 52 transition count 630
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 2349 place count 50 transition count 648
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2351 place count 50 transition count 646
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 2353 place count 48 transition count 646
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 2357 place count 48 transition count 646
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 2360 place count 48 transition count 643
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2361 place count 47 transition count 641
Iterating global reduction 9 with 1 rules applied. Total rules applied 2362 place count 47 transition count 641
Applied a total of 2362 rules in 360 ms. Remains 47 /1185 variables (removed 1138) and now considering 641/2796 (removed 2155) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 47/1185 places, 641/2796 transitions.
RANDOM walk for 11302 steps (569 resets) in 263 ms. (42 steps per ms) remains 0/17 properties
Found 5 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), (X (NOT p2)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND p0 (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p3)))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1) (NOT p3))), (X (AND (NOT p2) (NOT p1))), (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3)))), (X (AND (NOT p0) (NOT p3))), (X (NOT p3)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1 p0 (NOT p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0) p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) p3)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p2) p1 p0 p3)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0 p3)))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT p3))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 p0 (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (G (OR (NOT p0) (NOT p1) p2)), (G (OR p0 (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) (NOT p1) p2 (NOT p3))), (G (OR (NOT p0) p1 p2 (NOT p3))), (G (OR (NOT p0) (NOT p1) p2 p3))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p1) p2 p3))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (OR p0 (NOT p1) p2 p3))), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2 p3))), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR (NOT p0) p3))), (F p3), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) (NOT p3)))), (F (NOT (OR p0 p1 p2 (NOT p3)))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p1)]
Property proved to be false thanks to negative knowledge :(F (NOT (OR (NOT p0) p1 p2 p3)))
Knowledge based reduction with 47 factoid took 464 ms. Reduced automaton from 10 states, 36 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA StigmergyCommit-PT-05b-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property StigmergyCommit-PT-05b-LTLFireability-15 finished in 102364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F((X(p0)||(!p0&&G(p1))))&&X(X(p1)))||G(F((p0||G(p1)))))))'
Found a Shortening insensitive property : StigmergyCommit-PT-05b-LTLFireability-08
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Graph (trivial) has 1197 edges and 1206 vertex of which 104 / 1206 are part of one of the 18 SCC in 1 ms
Free SCC test removed 86 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 828 transitions
Trivial Post-agglo rules discarded 828 transitions
Performed 828 trivial Post agglomeration. Transition count delta: 828
Iterating post reduction 0 with 828 rules applied. Total rules applied 829 place count 1119 transition count 1891
Reduce places removed 828 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 847 rules applied. Total rules applied 1676 place count 291 transition count 1872
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1683 place count 284 transition count 1872
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 1683 place count 284 transition count 1811
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 1805 place count 223 transition count 1811
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1812 place count 216 transition count 1804
Iterating global reduction 3 with 7 rules applied. Total rules applied 1819 place count 216 transition count 1804
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1821 place count 214 transition count 1802
Iterating global reduction 3 with 2 rules applied. Total rules applied 1823 place count 214 transition count 1802
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1915 place count 168 transition count 1756
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1946 place count 137 transition count 657
Iterating global reduction 3 with 31 rules applied. Total rules applied 1977 place count 137 transition count 657
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 1991 place count 137 transition count 643
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2009 place count 119 transition count 619
Iterating global reduction 4 with 18 rules applied. Total rules applied 2027 place count 119 transition count 619
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2045 place count 101 transition count 595
Iterating global reduction 4 with 18 rules applied. Total rules applied 2063 place count 101 transition count 595
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2069 place count 101 transition count 589
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2089 place count 91 transition count 596
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2090 place count 90 transition count 584
Iterating global reduction 5 with 1 rules applied. Total rules applied 2091 place count 90 transition count 584
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2092 place count 90 transition count 583
Applied a total of 2092 rules in 131 ms. Remains 90 /1206 variables (removed 1116) and now considering 583/2818 (removed 2235) transitions.
[2024-06-01 09:04:21] [INFO ] Flow matrix only has 576 transitions (discarded 7 similar events)
// Phase 1: matrix 576 rows 90 cols
[2024-06-01 09:04:21] [INFO ] Computed 2 invariants in 11 ms
[2024-06-01 09:04:21] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-01 09:04:21] [INFO ] Flow matrix only has 576 transitions (discarded 7 similar events)
[2024-06-01 09:04:21] [INFO ] Invariant cache hit.
[2024-06-01 09:04:22] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:04:22] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 425 ms to find 0 implicit places.
Running 566 sub problems to find dead transitions.
[2024-06-01 09:04:22] [INFO ] Flow matrix only has 576 transitions (discarded 7 similar events)
[2024-06-01 09:04:22] [INFO ] Invariant cache hit.
[2024-06-01 09:04:22] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
[2024-06-01 09:04:27] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 1 ms to minimize.
[2024-06-01 09:04:27] [INFO ] Deduced a trap composed of 22 places in 179 ms of which 0 ms to minimize.
[2024-06-01 09:04:27] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 1 ms to minimize.
[2024-06-01 09:04:27] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 1 ms to minimize.
[2024-06-01 09:04:28] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 0 ms to minimize.
[2024-06-01 09:04:28] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 1 ms to minimize.
[2024-06-01 09:04:28] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2024-06-01 09:04:28] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 0 ms to minimize.
[2024-06-01 09:04:28] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2024-06-01 09:04:28] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 1 ms to minimize.
[2024-06-01 09:04:28] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2024-06-01 09:04:29] [INFO ] Deduced a trap composed of 23 places in 139 ms of which 0 ms to minimize.
[2024-06-01 09:04:29] [INFO ] Deduced a trap composed of 28 places in 134 ms of which 0 ms to minimize.
[2024-06-01 09:04:29] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 1 ms to minimize.
[2024-06-01 09:04:29] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 1 ms to minimize.
[2024-06-01 09:04:30] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 1 ms to minimize.
[2024-06-01 09:04:30] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 1 ms to minimize.
[2024-06-01 09:04:30] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2024-06-01 09:04:30] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 0 ms to minimize.
[2024-06-01 09:04:31] [INFO ] Deduced a trap composed of 31 places in 165 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 566 unsolved
[2024-06-01 09:04:33] [INFO ] Deduced a trap composed of 24 places in 158 ms of which 0 ms to minimize.
[2024-06-01 09:04:35] [INFO ] Deduced a trap composed of 26 places in 161 ms of which 0 ms to minimize.
[2024-06-01 09:04:35] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-06-01 09:04:35] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 1 ms to minimize.
[2024-06-01 09:04:35] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 566 unsolved
[2024-06-01 09:04:37] [INFO ] Deduced a trap composed of 24 places in 140 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (OVERLAPS) 575/665 variables, 90/118 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 62/180 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 10 (OVERLAPS) 1/666 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 666/666 variables, and 181 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 0 solved, 566 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 5 (OVERLAPS) 575/665 variables, 90/118 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/665 variables, 62/180 constraints. Problems are: Problem set: 0 solved, 566 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/665 variables, 566/746 constraints. Problems are: Problem set: 0 solved, 566 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 665/666 variables, and 746 constraints, problems are : Problem set: 0 solved, 566 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 566/566 constraints, Known Traps: 26/26 constraints]
After SMT, in 62800ms problems are : Problem set: 0 solved, 566 unsolved
Search for dead transitions found 0 dead transitions in 62811ms
Starting structural reductions in LI_LTL mode, iteration 1 : 90/1206 places, 583/2818 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 63369 ms. Remains : 90/1206 places, 583/2818 transitions.
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-08
Product exploration explored 100000 steps with 14185 reset in 227 ms.
Product exploration explored 100000 steps with 14220 reset in 234 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (3577 resets) in 1811 ms. (22 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (341 resets) in 313 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (347 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (344 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (339 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (334 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (335 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 351774 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 6
Probabilistic random walk after 351774 steps, saw 72512 distinct states, run finished after 3003 ms. (steps per millisecond=117 ) properties seen :0
[2024-06-01 09:05:29] [INFO ] Flow matrix only has 576 transitions (discarded 7 similar events)
[2024-06-01 09:05:29] [INFO ] Invariant cache hit.
[2024-06-01 09:05:29] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 81/88 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 09:05:30] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 1 ms to minimize.
[2024-06-01 09:05:30] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 574/662 variables, 88/91 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 62/153 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 0/153 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 3/665 variables, 2/155 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/665 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/665 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/666 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/666 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/666 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 666/666 variables, and 157 constraints, problems are : Problem set: 1 solved, 5 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 81/88 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 2/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 09:05:30] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 0 ms to minimize.
[2024-06-01 09:05:31] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 1 ms to minimize.
[2024-06-01 09:05:31] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 574/662 variables, 88/94 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 62/156 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 5/161 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/662 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 3/665 variables, 2/163 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/665 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/665 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/666 variables, 1/165 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/666 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/666 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 666/666 variables, and 165 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1949 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 2823ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Finished Parikh walk after 1488 steps, including 111 resets, run visited all 2 properties in 18 ms. (steps per millisecond=82 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 80 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p1))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 290 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), false]
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 583/583 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 577
Applied a total of 6 rules in 33 ms. Remains 90 /90 variables (removed 0) and now considering 577/583 (removed 6) transitions.
[2024-06-01 09:05:33] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
// Phase 1: matrix 570 rows 90 cols
[2024-06-01 09:05:33] [INFO ] Computed 2 invariants in 10 ms
[2024-06-01 09:05:33] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 09:05:33] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 09:05:33] [INFO ] Invariant cache hit.
[2024-06-01 09:05:33] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:05:33] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-06-01 09:05:33] [INFO ] Redundant transitions in 6 ms returned []
Running 560 sub problems to find dead transitions.
[2024-06-01 09:05:33] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 09:05:33] [INFO ] Invariant cache hit.
[2024-06-01 09:05:33] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 09:05:39] [INFO ] Deduced a trap composed of 16 places in 173 ms of which 1 ms to minimize.
[2024-06-01 09:05:39] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 1 ms to minimize.
[2024-06-01 09:05:39] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 0 ms to minimize.
[2024-06-01 09:05:39] [INFO ] Deduced a trap composed of 16 places in 156 ms of which 1 ms to minimize.
[2024-06-01 09:05:39] [INFO ] Deduced a trap composed of 23 places in 135 ms of which 0 ms to minimize.
[2024-06-01 09:05:39] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2024-06-01 09:05:40] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2024-06-01 09:05:40] [INFO ] Deduced a trap composed of 15 places in 209 ms of which 1 ms to minimize.
[2024-06-01 09:05:40] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 1 ms to minimize.
[2024-06-01 09:05:40] [INFO ] Deduced a trap composed of 21 places in 143 ms of which 1 ms to minimize.
[2024-06-01 09:05:41] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 1 ms to minimize.
[2024-06-01 09:05:41] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 0 ms to minimize.
[2024-06-01 09:05:41] [INFO ] Deduced a trap composed of 26 places in 143 ms of which 0 ms to minimize.
[2024-06-01 09:05:41] [INFO ] Deduced a trap composed of 27 places in 138 ms of which 0 ms to minimize.
[2024-06-01 09:05:42] [INFO ] Deduced a trap composed of 25 places in 131 ms of which 0 ms to minimize.
[2024-06-01 09:05:42] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2024-06-01 09:05:43] [INFO ] Deduced a trap composed of 31 places in 146 ms of which 0 ms to minimize.
[2024-06-01 09:05:43] [INFO ] Deduced a trap composed of 26 places in 154 ms of which 1 ms to minimize.
[2024-06-01 09:05:43] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 1 ms to minimize.
[2024-06-01 09:05:43] [INFO ] Deduced a trap composed of 22 places in 127 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 09:05:44] [INFO ] Deduced a trap composed of 24 places in 153 ms of which 1 ms to minimize.
[2024-06-01 09:05:44] [INFO ] Deduced a trap composed of 24 places in 307 ms of which 1 ms to minimize.
[2024-06-01 09:05:45] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 1 ms to minimize.
[2024-06-01 09:05:45] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (OVERLAPS) 569/659 variables, 90/116 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 62/178 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 9 (OVERLAPS) 1/660 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/660 variables, and 179 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 09:06:08] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (OVERLAPS) 569/659 variables, 90/117 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 62/179 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 560/739 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 739 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 25/25 constraints]
After SMT, in 63039ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 63046ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/90 places, 577/583 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63503 ms. Remains : 90/90 places, 577/583 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), false]
RANDOM walk for 40000 steps (3613 resets) in 1570 ms. (25 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (328 resets) in 177 ms. (224 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (340 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (343 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (348 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 461781 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 4
Probabilistic random walk after 461781 steps, saw 97225 distinct states, run finished after 3002 ms. (steps per millisecond=153 ) properties seen :0
[2024-06-01 09:06:40] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 09:06:40] [INFO ] Invariant cache hit.
[2024-06-01 09:06:40] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:06:40] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 568/656 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/656 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/656 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 3/659 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/659 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/660 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/660 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/660 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 660/660 variables, and 156 constraints, problems are : Problem set: 0 solved, 4 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 81/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:06:41] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 09:06:41] [INFO ] Deduced a trap composed of 16 places in 125 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 568/656 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/656 variables, 62/154 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/656 variables, 4/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/656 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 3/659 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/659 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/659 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/660 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/660 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/660 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 660/660 variables, and 162 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1563 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 2223ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 235 steps, including 12 resets, run visited all 4 properties in 7 ms. (steps per millisecond=33 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 8 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 199 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (NOT p1), false]
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), false]
Product exploration explored 100000 steps with 8977 reset in 218 ms.
Product exploration explored 100000 steps with 4350 reset in 142 ms.
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 577/577 transitions.
Applied a total of 0 rules in 14 ms. Remains 90 /90 variables (removed 0) and now considering 577/577 (removed 0) transitions.
[2024-06-01 09:06:44] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 09:06:44] [INFO ] Invariant cache hit.
[2024-06-01 09:06:44] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 09:06:44] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 09:06:44] [INFO ] Invariant cache hit.
[2024-06-01 09:06:44] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:06:44] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
[2024-06-01 09:06:44] [INFO ] Redundant transitions in 7 ms returned []
Running 560 sub problems to find dead transitions.
[2024-06-01 09:06:44] [INFO ] Flow matrix only has 570 transitions (discarded 7 similar events)
[2024-06-01 09:06:44] [INFO ] Invariant cache hit.
[2024-06-01 09:06:44] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 09:06:49] [INFO ] Deduced a trap composed of 16 places in 178 ms of which 1 ms to minimize.
[2024-06-01 09:06:49] [INFO ] Deduced a trap composed of 29 places in 150 ms of which 1 ms to minimize.
[2024-06-01 09:06:49] [INFO ] Deduced a trap composed of 19 places in 140 ms of which 0 ms to minimize.
[2024-06-01 09:06:50] [INFO ] Deduced a trap composed of 16 places in 154 ms of which 1 ms to minimize.
[2024-06-01 09:06:50] [INFO ] Deduced a trap composed of 23 places in 157 ms of which 0 ms to minimize.
[2024-06-01 09:06:50] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 0 ms to minimize.
[2024-06-01 09:06:50] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 1 ms to minimize.
[2024-06-01 09:06:51] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 1 ms to minimize.
[2024-06-01 09:06:51] [INFO ] Deduced a trap composed of 21 places in 151 ms of which 0 ms to minimize.
[2024-06-01 09:06:51] [INFO ] Deduced a trap composed of 21 places in 487 ms of which 1 ms to minimize.
[2024-06-01 09:06:51] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 0 ms to minimize.
[2024-06-01 09:06:52] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 0 ms to minimize.
[2024-06-01 09:06:52] [INFO ] Deduced a trap composed of 26 places in 134 ms of which 1 ms to minimize.
[2024-06-01 09:06:52] [INFO ] Deduced a trap composed of 27 places in 126 ms of which 1 ms to minimize.
[2024-06-01 09:06:52] [INFO ] Deduced a trap composed of 25 places in 124 ms of which 1 ms to minimize.
[2024-06-01 09:06:53] [INFO ] Deduced a trap composed of 24 places in 125 ms of which 0 ms to minimize.
[2024-06-01 09:06:53] [INFO ] Deduced a trap composed of 31 places in 157 ms of which 1 ms to minimize.
[2024-06-01 09:06:54] [INFO ] Deduced a trap composed of 26 places in 137 ms of which 0 ms to minimize.
[2024-06-01 09:06:54] [INFO ] Deduced a trap composed of 23 places in 144 ms of which 1 ms to minimize.
[2024-06-01 09:06:54] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 09:06:55] [INFO ] Deduced a trap composed of 24 places in 150 ms of which 1 ms to minimize.
[2024-06-01 09:06:55] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 0 ms to minimize.
[2024-06-01 09:06:55] [INFO ] Deduced a trap composed of 23 places in 138 ms of which 1 ms to minimize.
[2024-06-01 09:06:56] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (OVERLAPS) 569/659 variables, 90/116 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 62/178 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 9 (OVERLAPS) 1/660 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/660 variables, and 179 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 560 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 24/26 constraints. Problems are: Problem set: 0 solved, 560 unsolved
[2024-06-01 09:07:18] [INFO ] Deduced a trap composed of 29 places in 153 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 6 (OVERLAPS) 569/659 variables, 90/117 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/659 variables, 62/179 constraints. Problems are: Problem set: 0 solved, 560 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/659 variables, 560/739 constraints. Problems are: Problem set: 0 solved, 560 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 659/660 variables, and 739 constraints, problems are : Problem set: 0 solved, 560 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 560/560 constraints, Known Traps: 25/25 constraints]
After SMT, in 62782ms problems are : Problem set: 0 solved, 560 unsolved
Search for dead transitions found 0 dead transitions in 62787ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63226 ms. Remains : 90/90 places, 577/577 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-08 finished in 206122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : StigmergyCommit-PT-05b-LTLFireability-09
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Graph (trivial) has 1199 edges and 1206 vertex of which 104 / 1206 are part of one of the 18 SCC in 1 ms
Free SCC test removed 86 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 830 transitions
Trivial Post-agglo rules discarded 830 transitions
Performed 830 trivial Post agglomeration. Transition count delta: 830
Iterating post reduction 0 with 830 rules applied. Total rules applied 831 place count 1119 transition count 1889
Reduce places removed 830 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 850 rules applied. Total rules applied 1681 place count 289 transition count 1869
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1688 place count 282 transition count 1869
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 1688 place count 282 transition count 1808
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 1810 place count 221 transition count 1808
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1817 place count 214 transition count 1801
Iterating global reduction 3 with 7 rules applied. Total rules applied 1824 place count 214 transition count 1801
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 1826 place count 212 transition count 1799
Iterating global reduction 3 with 2 rules applied. Total rules applied 1828 place count 212 transition count 1799
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 1920 place count 166 transition count 1753
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1949 place count 137 transition count 1059
Iterating global reduction 3 with 29 rules applied. Total rules applied 1978 place count 137 transition count 1059
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 1990 place count 137 transition count 1047
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2008 place count 119 transition count 1023
Iterating global reduction 4 with 18 rules applied. Total rules applied 2026 place count 119 transition count 1023
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 2044 place count 101 transition count 999
Iterating global reduction 4 with 18 rules applied. Total rules applied 2062 place count 101 transition count 999
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 2068 place count 101 transition count 993
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 2088 place count 91 transition count 1000
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2089 place count 90 transition count 988
Iterating global reduction 5 with 1 rules applied. Total rules applied 2090 place count 90 transition count 988
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2091 place count 90 transition count 987
Applied a total of 2091 rules in 137 ms. Remains 90 /1206 variables (removed 1116) and now considering 987/2818 (removed 1831) transitions.
[2024-06-01 09:07:47] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
// Phase 1: matrix 980 rows 90 cols
[2024-06-01 09:07:47] [INFO ] Computed 2 invariants in 8 ms
[2024-06-01 09:07:47] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-06-01 09:07:47] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
[2024-06-01 09:07:47] [INFO ] Invariant cache hit.
[2024-06-01 09:07:48] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:07:48] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
Running 970 sub problems to find dead transitions.
[2024-06-01 09:07:48] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
[2024-06-01 09:07:48] [INFO ] Invariant cache hit.
[2024-06-01 09:07:48] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 09:08:05] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 1 ms to minimize.
[2024-06-01 09:08:05] [INFO ] Deduced a trap composed of 16 places in 294 ms of which 1 ms to minimize.
[2024-06-01 09:08:05] [INFO ] Deduced a trap composed of 25 places in 311 ms of which 0 ms to minimize.
[2024-06-01 09:08:06] [INFO ] Deduced a trap composed of 16 places in 297 ms of which 1 ms to minimize.
[2024-06-01 09:08:06] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 1 ms to minimize.
[2024-06-01 09:08:06] [INFO ] Deduced a trap composed of 31 places in 251 ms of which 0 ms to minimize.
[2024-06-01 09:08:07] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 0 ms to minimize.
[2024-06-01 09:08:07] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 0 ms to minimize.
[2024-06-01 09:08:07] [INFO ] Deduced a trap composed of 16 places in 258 ms of which 1 ms to minimize.
[2024-06-01 09:08:08] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 1 ms to minimize.
[2024-06-01 09:08:08] [INFO ] Deduced a trap composed of 17 places in 333 ms of which 1 ms to minimize.
[2024-06-01 09:08:12] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 1 ms to minimize.
[2024-06-01 09:08:12] [INFO ] Deduced a trap composed of 24 places in 274 ms of which 1 ms to minimize.
[2024-06-01 09:08:12] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 1 ms to minimize.
[2024-06-01 09:08:12] [INFO ] Deduced a trap composed of 30 places in 242 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 09:08:15] [INFO ] Deduced a trap composed of 29 places in 274 ms of which 1 ms to minimize.
[2024-06-01 09:08:15] [INFO ] Deduced a trap composed of 24 places in 250 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 09:08:21] [INFO ] Deduced a trap composed of 28 places in 264 ms of which 1 ms to minimize.
[2024-06-01 09:08:21] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 0 ms to minimize.
[2024-06-01 09:08:21] [INFO ] Deduced a trap composed of 28 places in 251 ms of which 1 ms to minimize.
[2024-06-01 09:08:21] [INFO ] Deduced a trap composed of 24 places in 229 ms of which 0 ms to minimize.
[2024-06-01 09:08:22] [INFO ] Deduced a trap composed of 26 places in 222 ms of which 1 ms to minimize.
[2024-06-01 09:08:22] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 1 ms to minimize.
[2024-06-01 09:08:22] [INFO ] Deduced a trap composed of 26 places in 241 ms of which 1 ms to minimize.
[2024-06-01 09:08:22] [INFO ] Deduced a trap composed of 24 places in 241 ms of which 1 ms to minimize.
[2024-06-01 09:08:23] [INFO ] Deduced a trap composed of 27 places in 239 ms of which 1 ms to minimize.
[2024-06-01 09:08:23] [INFO ] Deduced a trap composed of 24 places in 224 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 970 unsolved
SMT process timed out in 42750ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 42760ms
Starting structural reductions in LI_LTL mode, iteration 1 : 90/1206 places, 987/2818 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 43580 ms. Remains : 90/1206 places, 987/2818 transitions.
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-09
Product exploration explored 100000 steps with 9017 reset in 237 ms.
Product exploration explored 100000 steps with 9037 reset in 246 ms.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3622 resets) in 137 ms. (289 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (326 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1094173 steps, run timeout after 3001 ms. (steps per millisecond=364 ) properties seen :0 out of 1
Probabilistic random walk after 1094173 steps, saw 195492 distinct states, run finished after 3001 ms. (steps per millisecond=364 ) properties seen :0
[2024-06-01 09:08:35] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
[2024-06-01 09:08:35] [INFO ] Invariant cache hit.
[2024-06-01 09:08:35] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 978/1066 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 62/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1069 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1069 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1069 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1070 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1070 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1070 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1070/1070 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 978/1066 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 62/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/1069 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1069 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1069 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1070 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1070 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1070 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1070/1070 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1082 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1466ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 987/987 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 987/987 (removed 0) transitions.
[2024-06-01 09:08:36] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
[2024-06-01 09:08:36] [INFO ] Invariant cache hit.
[2024-06-01 09:08:37] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-06-01 09:08:37] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
[2024-06-01 09:08:37] [INFO ] Invariant cache hit.
[2024-06-01 09:08:37] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:08:37] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Running 970 sub problems to find dead transitions.
[2024-06-01 09:08:37] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
[2024-06-01 09:08:37] [INFO ] Invariant cache hit.
[2024-06-01 09:08:37] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 09:08:54] [INFO ] Deduced a trap composed of 16 places in 296 ms of which 2 ms to minimize.
[2024-06-01 09:08:54] [INFO ] Deduced a trap composed of 16 places in 301 ms of which 1 ms to minimize.
[2024-06-01 09:08:55] [INFO ] Deduced a trap composed of 25 places in 293 ms of which 1 ms to minimize.
[2024-06-01 09:08:55] [INFO ] Deduced a trap composed of 16 places in 292 ms of which 1 ms to minimize.
[2024-06-01 09:08:55] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 1 ms to minimize.
[2024-06-01 09:08:55] [INFO ] Deduced a trap composed of 31 places in 264 ms of which 1 ms to minimize.
[2024-06-01 09:08:56] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 1 ms to minimize.
[2024-06-01 09:08:56] [INFO ] Deduced a trap composed of 24 places in 232 ms of which 0 ms to minimize.
[2024-06-01 09:08:56] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 0 ms to minimize.
[2024-06-01 09:08:57] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 1 ms to minimize.
[2024-06-01 09:08:57] [INFO ] Deduced a trap composed of 17 places in 233 ms of which 0 ms to minimize.
[2024-06-01 09:09:00] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 0 ms to minimize.
[2024-06-01 09:09:01] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 1 ms to minimize.
[2024-06-01 09:09:01] [INFO ] Deduced a trap composed of 24 places in 265 ms of which 1 ms to minimize.
[2024-06-01 09:09:01] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 09:09:04] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 1 ms to minimize.
[2024-06-01 09:09:04] [INFO ] Deduced a trap composed of 24 places in 272 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 09:09:08] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 0 ms to minimize.
[2024-06-01 09:09:08] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:09:09] [INFO ] Deduced a trap composed of 28 places in 248 ms of which 0 ms to minimize.
[2024-06-01 09:09:09] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:09:09] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 1 ms to minimize.
[2024-06-01 09:09:09] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 0 ms to minimize.
[2024-06-01 09:09:10] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 0 ms to minimize.
[2024-06-01 09:09:10] [INFO ] Deduced a trap composed of 24 places in 243 ms of which 1 ms to minimize.
[2024-06-01 09:09:10] [INFO ] Deduced a trap composed of 27 places in 264 ms of which 1 ms to minimize.
[2024-06-01 09:09:10] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 970 unsolved
SMT process timed out in 42498ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 42509ms
Finished structural reductions in LTL mode , in 1 iterations and 43158 ms. Remains : 90/90 places, 987/987 transitions.
Computed a total of 3 stabilizing places and 20 stable transitions
Computed a total of 3 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3596 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (322 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1087827 steps, run timeout after 3001 ms. (steps per millisecond=362 ) properties seen :0 out of 1
Probabilistic random walk after 1087827 steps, saw 194565 distinct states, run finished after 3001 ms. (steps per millisecond=362 ) properties seen :0
[2024-06-01 09:09:23] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
[2024-06-01 09:09:23] [INFO ] Invariant cache hit.
[2024-06-01 09:09:23] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 978/1066 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 62/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/1069 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1069 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1069 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/1070 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1070 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1070 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1070/1070 variables, and 155 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 82/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 978/1066 variables, 88/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1066 variables, 62/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1066 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1066 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/1069 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1069 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1069 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/1070 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1070 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/1070 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1070/1070 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1097 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1495ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9052 reset in 264 ms.
Product exploration explored 100000 steps with 9007 reset in 253 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 987/987 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 90 transition count 981
Applied a total of 6 rules in 53 ms. Remains 90 /90 variables (removed 0) and now considering 981/987 (removed 6) transitions.
[2024-06-01 09:09:26] [INFO ] Redundant transitions in 12 ms returned []
Running 964 sub problems to find dead transitions.
[2024-06-01 09:09:26] [INFO ] Flow matrix only has 974 transitions (discarded 7 similar events)
// Phase 1: matrix 974 rows 90 cols
[2024-06-01 09:09:26] [INFO ] Computed 2 invariants in 10 ms
[2024-06-01 09:09:26] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 964 unsolved
[2024-06-01 09:09:42] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 1 ms to minimize.
[2024-06-01 09:09:43] [INFO ] Deduced a trap composed of 16 places in 260 ms of which 1 ms to minimize.
[2024-06-01 09:09:43] [INFO ] Deduced a trap composed of 16 places in 257 ms of which 1 ms to minimize.
[2024-06-01 09:09:43] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 0 ms to minimize.
[2024-06-01 09:09:44] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 1 ms to minimize.
[2024-06-01 09:09:44] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:09:44] [INFO ] Deduced a trap composed of 16 places in 269 ms of which 1 ms to minimize.
[2024-06-01 09:09:44] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 1 ms to minimize.
[2024-06-01 09:09:45] [INFO ] Deduced a trap composed of 21 places in 233 ms of which 1 ms to minimize.
[2024-06-01 09:09:45] [INFO ] Deduced a trap composed of 17 places in 300 ms of which 1 ms to minimize.
[2024-06-01 09:09:49] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:09:49] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 1 ms to minimize.
[2024-06-01 09:09:49] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 1 ms to minimize.
[2024-06-01 09:09:50] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 5 (OVERLAPS) 973/1063 variables, 90/106 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1063 variables, 62/168 constraints. Problems are: Problem set: 0 solved, 964 unsolved
[2024-06-01 09:10:07] [INFO ] Deduced a trap composed of 25 places in 265 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1063/1064 variables, and 169 constraints, problems are : Problem set: 0 solved, 964 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 964/964 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 964 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 964 unsolved
[2024-06-01 09:10:11] [INFO ] Deduced a trap composed of 24 places in 277 ms of which 0 ms to minimize.
[2024-06-01 09:10:12] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 1 ms to minimize.
[2024-06-01 09:10:12] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 6 (OVERLAPS) 973/1063 variables, 90/110 constraints. Problems are: Problem set: 0 solved, 964 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1063 variables, 62/172 constraints. Problems are: Problem set: 0 solved, 964 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1063/1064 variables, and 1136 constraints, problems are : Problem set: 0 solved, 964 unsolved in 30593 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 90/90 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 964/964 constraints, Known Traps: 18/18 constraints]
After SMT, in 72893ms problems are : Problem set: 0 solved, 964 unsolved
Search for dead transitions found 0 dead transitions in 72906ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/90 places, 981/987 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72985 ms. Remains : 90/90 places, 981/987 transitions.
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 987/987 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 987/987 (removed 0) transitions.
[2024-06-01 09:10:39] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
// Phase 1: matrix 980 rows 90 cols
[2024-06-01 09:10:39] [INFO ] Computed 2 invariants in 10 ms
[2024-06-01 09:10:39] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-06-01 09:10:39] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
[2024-06-01 09:10:39] [INFO ] Invariant cache hit.
[2024-06-01 09:10:39] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:10:39] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 970 sub problems to find dead transitions.
[2024-06-01 09:10:39] [INFO ] Flow matrix only has 980 transitions (discarded 7 similar events)
[2024-06-01 09:10:39] [INFO ] Invariant cache hit.
[2024-06-01 09:10:39] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 2 (OVERLAPS) 1/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 09:10:55] [INFO ] Deduced a trap composed of 16 places in 295 ms of which 1 ms to minimize.
[2024-06-01 09:10:56] [INFO ] Deduced a trap composed of 16 places in 290 ms of which 1 ms to minimize.
[2024-06-01 09:10:56] [INFO ] Deduced a trap composed of 25 places in 452 ms of which 0 ms to minimize.
[2024-06-01 09:10:56] [INFO ] Deduced a trap composed of 16 places in 259 ms of which 1 ms to minimize.
[2024-06-01 09:10:57] [INFO ] Deduced a trap composed of 17 places in 276 ms of which 1 ms to minimize.
[2024-06-01 09:10:57] [INFO ] Deduced a trap composed of 31 places in 247 ms of which 0 ms to minimize.
[2024-06-01 09:10:57] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 1 ms to minimize.
[2024-06-01 09:10:57] [INFO ] Deduced a trap composed of 24 places in 236 ms of which 1 ms to minimize.
[2024-06-01 09:10:58] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 0 ms to minimize.
[2024-06-01 09:10:58] [INFO ] Deduced a trap composed of 25 places in 267 ms of which 1 ms to minimize.
[2024-06-01 09:10:58] [INFO ] Deduced a trap composed of 17 places in 263 ms of which 0 ms to minimize.
[2024-06-01 09:11:02] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 1 ms to minimize.
[2024-06-01 09:11:02] [INFO ] Deduced a trap composed of 24 places in 247 ms of which 1 ms to minimize.
[2024-06-01 09:11:02] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 0 ms to minimize.
[2024-06-01 09:11:03] [INFO ] Deduced a trap composed of 30 places in 236 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 09:11:05] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 0 ms to minimize.
[2024-06-01 09:11:05] [INFO ] Deduced a trap composed of 24 places in 226 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 970 unsolved
[2024-06-01 09:11:09] [INFO ] Deduced a trap composed of 28 places in 285 ms of which 1 ms to minimize.
[2024-06-01 09:11:10] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 1 ms to minimize.
[2024-06-01 09:11:10] [INFO ] Deduced a trap composed of 28 places in 267 ms of which 1 ms to minimize.
[2024-06-01 09:11:10] [INFO ] Deduced a trap composed of 24 places in 259 ms of which 1 ms to minimize.
[2024-06-01 09:11:10] [INFO ] Deduced a trap composed of 26 places in 253 ms of which 0 ms to minimize.
[2024-06-01 09:11:11] [INFO ] Deduced a trap composed of 24 places in 248 ms of which 1 ms to minimize.
[2024-06-01 09:11:11] [INFO ] Deduced a trap composed of 26 places in 265 ms of which 1 ms to minimize.
[2024-06-01 09:11:11] [INFO ] Deduced a trap composed of 24 places in 269 ms of which 1 ms to minimize.
[2024-06-01 09:11:11] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 1 ms to minimize.
[2024-06-01 09:11:12] [INFO ] Deduced a trap composed of 24 places in 251 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/90 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 970 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/90 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 970 unsolved
SMT process timed out in 41720ms, After SMT, problems are : Problem set: 0 solved, 970 unsolved
Search for dead transitions found 0 dead transitions in 41734ms
Finished structural reductions in LTL mode , in 1 iterations and 42408 ms. Remains : 90/90 places, 987/987 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-09 finished in 214278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : StigmergyCommit-PT-05b-LTLFireability-11
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 1206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1206/1206 places, 2818/2818 transitions.
Graph (trivial) has 1203 edges and 1206 vertex of which 104 / 1206 are part of one of the 18 SCC in 1 ms
Free SCC test removed 86 places
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 834 transitions
Trivial Post-agglo rules discarded 834 transitions
Performed 834 trivial Post agglomeration. Transition count delta: 834
Iterating post reduction 0 with 834 rules applied. Total rules applied 835 place count 1119 transition count 1885
Reduce places removed 834 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 854 rules applied. Total rules applied 1689 place count 285 transition count 1865
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 1697 place count 278 transition count 1864
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1698 place count 277 transition count 1864
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 60 Pre rules applied. Total rules applied 1698 place count 277 transition count 1804
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 4 with 120 rules applied. Total rules applied 1818 place count 217 transition count 1804
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 1825 place count 210 transition count 1797
Iterating global reduction 4 with 7 rules applied. Total rules applied 1832 place count 210 transition count 1797
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 1834 place count 208 transition count 1795
Iterating global reduction 4 with 2 rules applied. Total rules applied 1836 place count 208 transition count 1795
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 4 with 92 rules applied. Total rules applied 1928 place count 162 transition count 1749
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1963 place count 127 transition count 390
Iterating global reduction 4 with 35 rules applied. Total rules applied 1998 place count 127 transition count 390
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 2016 place count 127 transition count 372
Discarding 18 places :
Symmetric choice reduction at 5 with 18 rule applications. Total rules 2034 place count 109 transition count 348
Iterating global reduction 5 with 18 rules applied. Total rules applied 2052 place count 109 transition count 348
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 2069 place count 92 transition count 325
Iterating global reduction 5 with 17 rules applied. Total rules applied 2086 place count 92 transition count 325
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 2091 place count 92 transition count 320
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 2111 place count 82 transition count 327
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2112 place count 81 transition count 315
Iterating global reduction 6 with 1 rules applied. Total rules applied 2113 place count 81 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2114 place count 81 transition count 314
Applied a total of 2114 rules in 115 ms. Remains 81 /1206 variables (removed 1125) and now considering 314/2818 (removed 2504) transitions.
[2024-06-01 09:11:22] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
// Phase 1: matrix 307 rows 81 cols
[2024-06-01 09:11:22] [INFO ] Computed 2 invariants in 5 ms
[2024-06-01 09:11:22] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 09:11:22] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
[2024-06-01 09:11:22] [INFO ] Invariant cache hit.
[2024-06-01 09:11:22] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:11:22] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-06-01 09:11:22] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
[2024-06-01 09:11:22] [INFO ] Invariant cache hit.
[2024-06-01 09:11:22] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:11:23] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:11:24] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:11:25] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:11:26] [INFO ] Deduced a trap composed of 24 places in 88 ms of which 1 ms to minimize.
[2024-06-01 09:11:26] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 1 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:11:27] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:11:28] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:11:28] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:11:28] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:11:28] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:11:28] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:11:29] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:11:29] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:11:29] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 0 ms to minimize.
[2024-06-01 09:11:29] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:11:29] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 306/387 variables, 81/124 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 62/186 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:11:32] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:11:35] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:11:35] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:11:35] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 0 ms to minimize.
[2024-06-01 09:11:36] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (OVERLAPS) 1/388 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 0/388 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 192 constraints, problems are : Problem set: 0 solved, 297 unsolved in 21819 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 306/387 variables, 81/129 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 297/488 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:11:49] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:11:49] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:11:54] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:11:54] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:11:54] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:11:54] [INFO ] Deduced a trap composed of 24 places in 74 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 6/494 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:12:02] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2024-06-01 09:12:02] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:12:05] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/388 variables, and 497 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 55/55 constraints]
After SMT, in 52271ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 52275ms
Starting structural reductions in LI_LTL mode, iteration 1 : 81/1206 places, 314/2818 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 52653 ms. Remains : 81/1206 places, 314/2818 transitions.
Running random walk in product with property : StigmergyCommit-PT-05b-LTLFireability-11
Product exploration explored 100000 steps with 25000 reset in 186 ms.
Product exploration explored 100000 steps with 25000 reset in 198 ms.
Computed a total of 6 stabilizing places and 24 stable transitions
Computed a total of 6 stabilizing places and 24 stable transitions
Detected a total of 6/81 stabilizing places and 24/314 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 584 steps (49 resets) in 5 ms. (97 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 314/314 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-01 09:12:15] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
[2024-06-01 09:12:15] [INFO ] Invariant cache hit.
[2024-06-01 09:12:15] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 09:12:15] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
[2024-06-01 09:12:15] [INFO ] Invariant cache hit.
[2024-06-01 09:12:15] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:12:16] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-06-01 09:12:16] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
[2024-06-01 09:12:16] [INFO ] Invariant cache hit.
[2024-06-01 09:12:16] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 20 places in 93 ms of which 0 ms to minimize.
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:12:17] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 1 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:12:18] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:12:19] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:12:19] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:12:19] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:12:19] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:12:19] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:12:20] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2024-06-01 09:12:20] [INFO ] Deduced a trap composed of 26 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:12:20] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 09:12:20] [INFO ] Deduced a trap composed of 20 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:12:21] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 0 ms to minimize.
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 0 ms to minimize.
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:12:22] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:12:23] [INFO ] Deduced a trap composed of 20 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 306/387 variables, 81/124 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 62/186 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:12:26] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:12:29] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (OVERLAPS) 1/388 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 0/388 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 192 constraints, problems are : Problem set: 0 solved, 297 unsolved in 21626 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 306/387 variables, 81/129 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 297/488 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:12:43] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:12:43] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:12:47] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:12:48] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 1 ms to minimize.
[2024-06-01 09:12:48] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:12:48] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 6/494 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:12:56] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:12:56] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 1 ms to minimize.
[2024-06-01 09:12:59] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/388 variables, and 497 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 55/55 constraints]
After SMT, in 52101ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 52105ms
Finished structural reductions in LTL mode , in 1 iterations and 52357 ms. Remains : 81/81 places, 314/314 transitions.
Computed a total of 6 stabilizing places and 24 stable transitions
Computed a total of 6 stabilizing places and 24 stable transitions
Detected a total of 6/81 stabilizing places and 24/314 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 425 steps (38 resets) in 6 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 160 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 197 ms.
Product exploration explored 100000 steps with 25000 reset in 200 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 314/314 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 81 transition count 308
Applied a total of 6 rules in 19 ms. Remains 81 /81 variables (removed 0) and now considering 308/314 (removed 6) transitions.
[2024-06-01 09:13:09] [INFO ] Redundant transitions in 1 ms returned []
Running 291 sub problems to find dead transitions.
[2024-06-01 09:13:09] [INFO ] Flow matrix only has 301 transitions (discarded 7 similar events)
// Phase 1: matrix 301 rows 81 cols
[2024-06-01 09:13:09] [INFO ] Computed 2 invariants in 2 ms
[2024-06-01 09:13:09] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 0 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 1 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:13:11] [INFO ] Deduced a trap composed of 29 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 0 ms to minimize.
[2024-06-01 09:13:12] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:13:13] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 0 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:13:14] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 0 ms to minimize.
[2024-06-01 09:13:15] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:13:16] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:13:17] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 300/381 variables, 81/123 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 62/185 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:13:21] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 12 (OVERLAPS) 1/382 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/382 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 14 (OVERLAPS) 0/382 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 382/382 variables, and 187 constraints, problems are : Problem set: 0 solved, 291 unsolved in 19749 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 41/41 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 41/43 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:13:31] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-06-01 09:13:31] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 300/381 variables, 81/126 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 62/188 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 291/479 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:13:40] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2024-06-01 09:13:40] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 2/481 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-06-01 09:13:50] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-06-01 09:13:51] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:13:51] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:13:51] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:13:51] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 0 ms to minimize.
[2024-06-01 09:13:51] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 6/487 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/382 variables, and 487 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 51/51 constraints]
After SMT, in 50220ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 50224ms
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 308/314 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 50254 ms. Remains : 81/81 places, 308/314 transitions.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 314/314 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-01 09:14:00] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
// Phase 1: matrix 307 rows 81 cols
[2024-06-01 09:14:00] [INFO ] Computed 2 invariants in 4 ms
[2024-06-01 09:14:00] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 09:14:00] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
[2024-06-01 09:14:00] [INFO ] Invariant cache hit.
[2024-06-01 09:14:00] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-01 09:14:00] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Running 297 sub problems to find dead transitions.
[2024-06-01 09:14:00] [INFO ] Flow matrix only has 307 transitions (discarded 7 similar events)
[2024-06-01 09:14:00] [INFO ] Invariant cache hit.
[2024-06-01 09:14:00] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:14:01] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:14:01] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:14:01] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2024-06-01 09:14:02] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 0 ms to minimize.
[2024-06-01 09:14:02] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:14:02] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 1 ms to minimize.
[2024-06-01 09:14:02] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:14:02] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:14:02] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-06-01 09:14:02] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:14:02] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 0 ms to minimize.
[2024-06-01 09:14:02] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-01 09:14:03] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-06-01 09:14:03] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 0 ms to minimize.
[2024-06-01 09:14:03] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:14:03] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:14:03] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:14:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:14:03] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-01 09:14:03] [INFO ] Deduced a trap composed of 20 places in 134 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:14:04] [INFO ] Deduced a trap composed of 24 places in 87 ms of which 1 ms to minimize.
[2024-06-01 09:14:04] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2024-06-01 09:14:04] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 1 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 0 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 0 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-06-01 09:14:05] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 14/36 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-06-01 09:14:06] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 1 ms to minimize.
[2024-06-01 09:14:07] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 7/43 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (OVERLAPS) 306/387 variables, 81/124 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 62/186 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:14:10] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:14:13] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 1 ms to minimize.
[2024-06-01 09:14:13] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-01 09:14:13] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 1 ms to minimize.
[2024-06-01 09:14:13] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/387 variables, 4/191 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/387 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 12 (OVERLAPS) 1/388 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 14 (OVERLAPS) 0/388 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 297 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 192 constraints, problems are : Problem set: 0 solved, 297 unsolved in 21685 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 46/46 constraints]
Escalating to Integer solving :Problem set: 0 solved, 297 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 5 (OVERLAPS) 306/387 variables, 81/129 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/387 variables, 62/191 constraints. Problems are: Problem set: 0 solved, 297 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/387 variables, 297/488 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:14:27] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2024-06-01 09:14:27] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2024-06-01 09:14:32] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 0 ms to minimize.
[2024-06-01 09:14:32] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2024-06-01 09:14:32] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 1 ms to minimize.
[2024-06-01 09:14:32] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/387 variables, 6/494 constraints. Problems are: Problem set: 0 solved, 297 unsolved
[2024-06-01 09:14:40] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2024-06-01 09:14:40] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 09:14:43] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/387 variables, 3/497 constraints. Problems are: Problem set: 0 solved, 297 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 387/388 variables, and 497 constraints, problems are : Problem set: 0 solved, 297 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 297/297 constraints, Known Traps: 55/55 constraints]
After SMT, in 52111ms problems are : Problem set: 0 solved, 297 unsolved
Search for dead transitions found 0 dead transitions in 52115ms
Finished structural reductions in LTL mode , in 1 iterations and 52380 ms. Remains : 81/81 places, 314/314 transitions.
Treatment of property StigmergyCommit-PT-05b-LTLFireability-11 finished in 210816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 09:14:52] [INFO ] Flatten gal took : 137 ms
[2024-06-01 09:14:52] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2024-06-01 09:14:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1206 places, 2818 transitions and 21032 arcs took 22 ms.
Total runtime 2760413 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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